1
// Copied with small adaptations from the reflect package in the
4
// Copyright 2009 The Go Authors. All rights reserved.
5
// Use of this source code is governed by a BSD-style
6
// license that can be found in the LICENSE file.
8
// Deep equality test via reflection
14
// During deepValueEqual, must keep track of checks that are
15
// in progress. The comparison algorithm assumes that all
16
// checks in progress are true when it reencounters them.
17
// Visited comparisons are stored in a map indexed by visit.
24
// Tests for deep equality using reflected types. The map argument tracks
25
// comparisons that have already been seen, which allows short circuiting on
27
func deepValueEqual(v1, v2 reflect.Value, visited map[visit]bool, depth int) bool {
28
if !v1.IsValid() || !v2.IsValid() {
29
return v1.IsValid() == v2.IsValid()
31
if v1.Type() != v2.Type() {
35
// if depth > 10 { panic("deepValueEqual") } // for debugging
36
hard := func(k reflect.Kind) bool {
38
case reflect.Array, reflect.Map, reflect.Slice, reflect.Struct:
44
if v1.CanAddr() && v2.CanAddr() && hard(v1.Kind()) {
45
addr1 := v1.UnsafeAddr()
46
addr2 := v2.UnsafeAddr()
48
// Canonicalize order to reduce number of entries in visited.
49
addr1, addr2 = addr2, addr1
52
// Short circuit if references are identical ...
57
// ... or already seen
59
v := visit{addr1, addr2, typ}
64
// Remember for later.
70
if v1.Len() != v2.Len() {
73
for i := 0; i < v1.Len(); i++ {
74
if !deepValueEqual(v1.Index(i), v2.Index(i), visited, depth+1) {
80
// No check for nil == nil here.
82
if v1.Len() != v2.Len() {
85
if v1.Pointer() == v2.Pointer() {
88
for i := 0; i < v1.Len(); i++ {
89
if !deepValueEqual(v1.Index(i), v2.Index(i), visited, depth+1) {
94
case reflect.Interface:
95
if v1.IsNil() || v2.IsNil() {
96
return v1.IsNil() == v2.IsNil()
98
return deepValueEqual(v1.Elem(), v2.Elem(), visited, depth+1)
100
return deepValueEqual(v1.Elem(), v2.Elem(), visited, depth+1)
102
for i, n := 0, v1.NumField(); i < n; i++ {
103
if !deepValueEqual(v1.Field(i), v2.Field(i), visited, depth+1) {
109
// No check for nil == nil here.
111
if v1.Len() != v2.Len() {
114
if v1.Pointer() == v2.Pointer() {
117
for _, k := range v1.MapKeys() {
118
if !deepValueEqual(v1.MapIndex(k), v2.MapIndex(k), visited, depth+1) {
124
if v1.IsNil() && v2.IsNil() {
127
// Can't do better than this:
129
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
130
return v1.Int() == v2.Int()
131
case reflect.Uint, reflect.Uintptr, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
132
return v1.Uint() == v2.Uint()
133
case reflect.Float32, reflect.Float64:
134
return v1.Float() == v2.Float()
135
case reflect.Complex64, reflect.Complex128:
136
return v1.Complex() == v2.Complex()
138
return v1.Bool() == v2.Bool()
140
return v1.String() == v2.String()
141
case reflect.Chan, reflect.UnsafePointer:
142
return v1.Pointer() == v2.Pointer()
144
panic("unexpected type " + v1.Type().String())
148
// DeepEqual tests for deep equality. It uses normal == equality where
149
// possible but will scan elements of arrays, slices, maps, and fields of
150
// structs. In maps, keys are compared with == but elements use deep
151
// equality. DeepEqual correctly handles recursive types. Functions are equal
152
// only if they are both nil.
153
// DeepEqual differs from reflect.DeepEqual in that an empty
154
// slice is equal to a nil slice, and an empty map is equal to a nil map.
155
func DeepEqual(a1, a2 interface{}) bool {
156
if a1 == nil || a2 == nil {
159
v1 := reflect.ValueOf(a1)
160
v2 := reflect.ValueOf(a2)
161
if v1.Type() != v2.Type() {
164
return deepValueEqual(v1, v2, make(map[visit]bool), 0)