reflect.go 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121
  1. // Copyright 2013 Google Inc. All rights reserved.
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. package pretty
  15. import (
  16. "encoding"
  17. "fmt"
  18. "reflect"
  19. "sort"
  20. )
  21. func isZeroVal(val reflect.Value) bool {
  22. if !val.CanInterface() {
  23. return false
  24. }
  25. z := reflect.Zero(val.Type()).Interface()
  26. return reflect.DeepEqual(val.Interface(), z)
  27. }
  28. func (c *Config) val2node(val reflect.Value) node {
  29. // TODO(kevlar): pointer tracking?
  30. if !val.IsValid() {
  31. return rawVal("nil")
  32. }
  33. if val.CanInterface() {
  34. v := val.Interface()
  35. if formatter, ok := c.Formatter[val.Type()]; ok {
  36. if formatter != nil {
  37. res := reflect.ValueOf(formatter).Call([]reflect.Value{val})
  38. return rawVal(res[0].Interface().(string))
  39. }
  40. } else {
  41. if s, ok := v.(fmt.Stringer); ok && c.PrintStringers {
  42. return stringVal(s.String())
  43. }
  44. if t, ok := v.(encoding.TextMarshaler); ok && c.PrintTextMarshalers {
  45. if raw, err := t.MarshalText(); err == nil { // if NOT an error
  46. return stringVal(string(raw))
  47. }
  48. }
  49. }
  50. }
  51. switch kind := val.Kind(); kind {
  52. case reflect.Ptr, reflect.Interface:
  53. if val.IsNil() {
  54. return rawVal("nil")
  55. }
  56. return c.val2node(val.Elem())
  57. case reflect.String:
  58. return stringVal(val.String())
  59. case reflect.Slice, reflect.Array:
  60. n := list{}
  61. length := val.Len()
  62. for i := 0; i < length; i++ {
  63. n = append(n, c.val2node(val.Index(i)))
  64. }
  65. return n
  66. case reflect.Map:
  67. n := keyvals{}
  68. keys := val.MapKeys()
  69. for _, key := range keys {
  70. // TODO(kevlar): Support arbitrary type keys?
  71. n = append(n, keyval{compactString(c.val2node(key)), c.val2node(val.MapIndex(key))})
  72. }
  73. sort.Sort(n)
  74. return n
  75. case reflect.Struct:
  76. n := keyvals{}
  77. typ := val.Type()
  78. fields := typ.NumField()
  79. for i := 0; i < fields; i++ {
  80. sf := typ.Field(i)
  81. if !c.IncludeUnexported && sf.PkgPath != "" {
  82. continue
  83. }
  84. field := val.Field(i)
  85. if c.SkipZeroFields && isZeroVal(field) {
  86. continue
  87. }
  88. n = append(n, keyval{sf.Name, c.val2node(field)})
  89. }
  90. return n
  91. case reflect.Bool:
  92. if val.Bool() {
  93. return rawVal("true")
  94. }
  95. return rawVal("false")
  96. case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
  97. return rawVal(fmt.Sprintf("%d", val.Int()))
  98. case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
  99. return rawVal(fmt.Sprintf("%d", val.Uint()))
  100. case reflect.Uintptr:
  101. return rawVal(fmt.Sprintf("0x%X", val.Uint()))
  102. case reflect.Float32, reflect.Float64:
  103. return rawVal(fmt.Sprintf("%v", val.Float()))
  104. case reflect.Complex64, reflect.Complex128:
  105. return rawVal(fmt.Sprintf("%v", val.Complex()))
  106. }
  107. // Fall back to the default %#v if we can
  108. if val.CanInterface() {
  109. return rawVal(fmt.Sprintf("%#v", val.Interface()))
  110. }
  111. return rawVal(val.String())
  112. }