-
Notifications
You must be signed in to change notification settings - Fork 1
/
properties.go
232 lines (217 loc) · 4.63 KB
/
properties.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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
// Copyright 2021 Cloud Privacy Labs, LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package lpg
import (
"fmt"
"strings"
)
type properties map[string]any
// GetProperty returns the value for the key, and whether or not key
// exists. p can be nil
func (p *properties) getProperty(key string) (interface{}, bool) {
if *p == nil {
return nil, false
}
x, ok := (*p)[key]
return x, ok
}
// ForEachProperty calls f for each property in p until f returns
// false. Returns false if f returned false. p can be nil
func (p *properties) forEachProperty(f func(string, interface{}) bool) bool {
if *p == nil {
return true
}
for k, v := range *p {
if !f(k, v) {
return false
}
}
return true
}
// WithNativeValue is used to return a native value for property
// values. If the property value implements this interface, the
// underlying native value for indexing and comparison is obtained
// from this interface.
type WithNativeValue interface {
GetNativeValue() interface{}
}
// ComparePropertyValue compares a and b. They must be
// comparable. Supported types are
//
// int
// string
// []int
// []string
// []interface
//
// The []interface must have one of the supported types as its elements
//
// If one of the values implement GetNativeValue() method, then it is
// called to get the underlying value
func ComparePropertyValue(a, b interface{}) int {
if n, ok := a.(WithNativeValue); ok {
return ComparePropertyValue(n.GetNativeValue(), b)
}
if n, ok := b.(WithNativeValue); ok {
return ComparePropertyValue(a, n.GetNativeValue())
}
switch v1 := a.(type) {
case string:
if v2, ok := b.(string); ok {
if v1 == v2 {
return 0
}
if v1 < v2 {
return -1
}
return 1
}
case int:
if v2, ok := b.(int); ok {
if v1 == v2 {
return 0
}
if v1 < v2 {
return -1
}
return 1
}
case []string:
if v2, ok := b.([]string); ok {
l1 := len(v1)
l2 := len(v2)
for i := 0; i < l1 && i < l2; i++ {
if v1[i] < v2[i] {
return -1
}
if v1[i] > v2[i] {
return 1
}
}
if l1 < l2 {
return -1
}
if l1 > l2 {
return 1
}
return 0
}
if v2, ok := b.([]interface{}); ok {
l1 := len(v1)
l2 := len(v2)
for i := 0; i < l1 && i < l2; i++ {
switch ComparePropertyValue(v1[i], v2[i]) {
case -1:
return -1
case 1:
return 1
}
}
if l1 < l2 {
return -1
}
if l1 > l2 {
return 1
}
return 0
}
case []int:
if v2, ok := b.([]int); ok {
l1 := len(v1)
l2 := len(v2)
for i := 0; i < l1 && i < l2; i++ {
if v1[i] < v2[i] {
return -1
}
if v1[i] > v2[i] {
return 1
}
}
if l1 < l2 {
return -1
}
if l1 > l2 {
return 1
}
return 0
}
if v2, ok := b.([]interface{}); ok {
l1 := len(v1)
l2 := len(v2)
for i := 0; i < l1 && i < l2; i++ {
switch ComparePropertyValue(v1[i], v2[i]) {
case -1:
return -1
case 1:
return 1
}
}
if l1 < l2 {
return -1
}
if l1 > l2 {
return 1
}
return 0
}
case []interface{}:
if v2, ok := b.([]interface{}); ok {
l1 := len(v1)
l2 := len(v2)
for i := 0; i < l1 && i < l2; i++ {
switch ComparePropertyValue(v1[i], v2[i]) {
case -1:
return -1
case 1:
return 1
}
}
if l1 < l2 {
return -1
}
if l1 > l2 {
return 1
}
return 0
}
if v2, ok := b.([]string); ok {
return -ComparePropertyValue(v2, v1)
}
if v2, ok := b.([]int); ok {
return -ComparePropertyValue(v2, v1)
}
}
panic(fmt.Sprintf("Incomparable values: %v (%T) vs %v (%T)", a, a, b, b))
}
func (p properties) String() string {
elements := make([]string, 0, len(p))
for k, v := range p {
if _, node := v.(*Node); node {
continue
}
if _, edge := v.(*Edge); edge {
continue
}
elements = append(elements, fmt.Sprintf("%s:%v", k, v))
}
return "{" + strings.Join(elements, " ") + "}"
}
// lookup proprs from source. allocate to target
func (p properties) clone(sourceGraph, targetGraph *Graph, cloneProperty func(string, interface{}) interface{}) properties {
ret := make(properties, len(p))
for k, v := range p {
ret[k] = cloneProperty(k, v)
}
return ret
}