-
Notifications
You must be signed in to change notification settings - Fork 5
/
registry.go
152 lines (118 loc) Β· 2.91 KB
/
registry.go
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
package types
import (
"fmt"
)
// A Registry holds a collection of unique types that can are referenced
// internally to allow for circular references but also be serializable.
type Registry map[string]*Type
func (registry Registry) EqualTypeSlices(a, b []*Type) bool {
if len(a) != len(b) {
return false
}
for i := range a {
if !registry.EqualTypes(a[i], b[i]) {
return false
}
}
return true
}
// EqualTypes ignores only the Name.
func (registry Registry) EqualTypes(a, b *Type) bool {
// This covers cases where we compare Element.
if a == nil && b == nil {
return true
}
if a == nil || b == nil {
return false
}
if a.Ref != "" {
a = registry.Get(a.Ref)
}
if b.Ref != "" {
b = registry.Get(b.Ref)
}
if a.Kind != b.Kind {
return false
}
if !registry.EqualTypes(a.Element, b.Element) {
return false
}
if !registry.EqualTypeSlices(a.Arguments, b.Arguments) {
return false
}
if !registry.EqualTypeSlices(a.Returns, b.Returns) {
return false
}
if len(a.Properties) != len(b.Properties) {
return false
}
for i := range a.Properties {
if !registry.EqualTypes(a.Properties[i], b.Properties[i]) {
return false
}
}
return true
}
// Add will merge new types into the register. An error is returned only if an
// unresolved interface type is added and there's no way to resolve it right
// now.
func (registry Registry) Add(ty *Type) (string, error) {
for key, ty2 := range registry {
if registry.EqualTypes(ty, ty2) {
return key, nil
}
}
ty = ty.Copy()
// Flatten dependent types. After this process the root type and all
// recursive types will only contain a Ref. It is rewired with Get().
if ty.Element != nil {
newType, err := registry.Add(ty.Element)
if err != nil {
return "", err
}
ty.Element = NewRef(newType)
}
for i := range ty.Returns {
newType, err := registry.Add(ty.Returns[i])
if err != nil {
return "", err
}
ty.Returns[i] = NewRef(newType)
}
for i := range ty.Arguments {
newType, err := registry.Add(ty.Arguments[i])
if err != nil {
return "", err
}
ty.Arguments[i] = NewRef(newType)
}
for _, i := range ty.SortedPropertyNames() {
newType, err := registry.Add(ty.Properties[i])
if err != nil {
return "", err
}
ty.Properties[i] = NewRef(newType)
}
key := fmt.Sprintf("%d", len(registry))
registry[key] = ty
return key, nil
}
func (registry Registry) Get(key string) *Type {
// Let the following code panic if the type key does not exist. Get is only
// used internally and must be from existing TypeRegister values.
ty := registry[key].Copy()
// Unflatten types.
if ty.Element != nil {
ty.Element = registry.Get(ty.Element.Ref)
}
for i := range ty.Arguments {
ty.Arguments[i] = registry.Get(ty.Arguments[i].Ref)
}
for i := range ty.Returns {
ty.Returns[i] = registry.Get(ty.Returns[i].Ref)
}
for i := range ty.Properties {
ty.Properties[i] = registry.Get(ty.Properties[i].Ref)
}
return ty
}