1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
// Copyright (c) 2019, Maxime Soulé
// All rights reserved.
//
// This source code is licensed under the BSD-style license found in the
// LICENSE file in the root directory of this source tree.
package tdutil
import (
"math"
"reflect"
"github.com/maxatome/go-testdeep/internal/visited"
)
func cmpRet(less, gt bool) int {
if less {
return -1
}
if gt {
return 1
}
return 0
}
func cmpFloat(a, b float64) int {
if math.IsNaN(a) {
return -1
}
if math.IsNaN(b) {
return 1
}
return cmpRet(a < b, a > b)
}
// cmp returns -1 if a < b, 1 if a > b, 0 if a == b.
func cmp(v visited.Visited, a, b reflect.Value) int {
if !a.IsValid() {
if !b.IsValid() {
return 0
}
return -1
}
if !b.IsValid() {
return 1
}
if at, bt := a.Type(), b.Type(); at != bt {
sat, sbt := at.String(), bt.String()
return cmpRet(sat < sbt, sat > sbt)
}
// Avoid looping forever on cyclic references
if v.Record(a, b) {
return 0
}
switch a.Kind() {
case reflect.Bool:
if a.Bool() {
if b.Bool() {
return 0
}
return 1
}
if b.Bool() {
return -1
}
return 0
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
na, nb := a.Int(), b.Int()
return cmpRet(na < nb, na > nb)
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32,
reflect.Uint64, reflect.Uintptr:
na, nb := a.Uint(), b.Uint()
return cmpRet(na < nb, na > nb)
case reflect.Float32, reflect.Float64:
return cmpFloat(a.Float(), b.Float())
case reflect.Complex64, reflect.Complex128:
na, nb := a.Complex(), b.Complex()
fa, fb := real(na), real(nb)
if r := cmpFloat(fa, fb); r != 0 {
return r
}
return cmpFloat(imag(na), imag(nb))
case reflect.String:
sa, sb := a.String(), b.String()
return cmpRet(sa < sb, sa > sb)
case reflect.Array:
for i := 0; i < a.Len(); i++ {
if r := cmp(v, a.Index(i), b.Index(i)); r != 0 {
return r
}
}
return 0
case reflect.Slice:
al, bl := a.Len(), b.Len()
maxl := al
if al > bl {
maxl = bl
}
for i := 0; i < maxl; i++ {
if r := cmp(v, a.Index(i), b.Index(i)); r != 0 {
return r
}
}
return cmpRet(al < bl, al > bl)
case reflect.Interface:
if a.IsNil() {
if b.IsNil() {
return 0
}
return -1
}
if b.IsNil() {
return 1
}
return cmp(v, a.Elem(), b.Elem())
case reflect.Struct:
for i, m := 0, a.NumField(); i < m; i++ {
if r := cmp(v, a.Field(i), b.Field(i)); r != 0 {
return r
}
}
return 0
case reflect.Ptr:
if a.Pointer() == b.Pointer() {
return 0
}
if a.IsNil() {
return -1
}
if b.IsNil() {
return 1
}
return cmp(v, a.Elem(), b.Elem())
case reflect.Map:
// consider shorter maps are before longer ones
al, bl := a.Len(), b.Len()
if r := cmpRet(al < bl, al > bl); r != 0 {
return r
}
// then fallback on pointers comparison. How to say a map is
// before another one otherwise?
fallthrough
case reflect.Func, reflect.Chan, reflect.UnsafePointer:
pa, pb := a.Pointer(), b.Pointer()
return cmpRet(pa < pb, pa > pb)
default:
panic("don't know how to compare " + a.Kind().String())
}
}
|
