forked from Workiva/go-datastructures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ordered.go
241 lines (196 loc) · 5.33 KB
/
ordered.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
233
234
235
236
237
238
239
240
241
/*
Copyright 2014 Workiva, 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 rangetree
import "sort"
// orderedNodes represents an ordered list of points living
// at the last dimension. No duplicates can be inserted here.
type orderedNodes nodes
func (nodes orderedNodes) search(value int64) int {
return sort.Search(
len(nodes),
func(i int) bool { return nodes[i].value >= value },
)
}
// addAt will add the provided node at the provided index. Returns
// a node if one was overwritten.
func (nodes *orderedNodes) addAt(i int, node *node) *node {
if i == len(*nodes) {
*nodes = append(*nodes, node)
return nil
}
if (*nodes)[i].value == node.value {
overwritten := (*nodes)[i]
// this is a duplicate, there can't be a duplicate
// point in the last dimension
(*nodes)[i] = node
return overwritten
}
*nodes = append(*nodes, nil)
copy((*nodes)[i+1:], (*nodes)[i:])
(*nodes)[i] = node
return nil
}
func (nodes *orderedNodes) add(node *node) *node {
i := nodes.search(node.value)
return nodes.addAt(i, node)
}
func (nodes *orderedNodes) deleteAt(i int) *node {
if i >= len(*nodes) { // no matching found
return nil
}
deleted := (*nodes)[i]
copy((*nodes)[i:], (*nodes)[i+1:])
(*nodes)[len(*nodes)-1] = nil
*nodes = (*nodes)[:len(*nodes)-1]
return deleted
}
func (nodes *orderedNodes) delete(value int64) *node {
i := nodes.search(value)
if (*nodes)[i].value != value || i == len(*nodes) {
return nil
}
return nodes.deleteAt(i)
}
func (nodes orderedNodes) apply(low, high int64, fn func(*node) bool) bool {
index := nodes.search(low)
if index == len(nodes) {
return true
}
for ; index < len(nodes); index++ {
if nodes[index].value >= high {
break
}
if !fn(nodes[index]) {
return false
}
}
return true
}
func (nodes orderedNodes) get(value int64) (*node, int) {
i := nodes.search(value)
if i == len(nodes) {
return nil, i
}
if nodes[i].value == value {
return nodes[i], i
}
return nil, i
}
func (nodes *orderedNodes) getOrAdd(entry Entry,
dimension, lastDimension uint64) (*node, bool) {
isLastDimension := isLastDimension(lastDimension, dimension)
value := entry.ValueAtDimension(dimension)
i := nodes.search(value)
if i == len(*nodes) {
node := newNode(value, entry, !isLastDimension)
*nodes = append(*nodes, node)
return node, true
}
if (*nodes)[i].value == value {
return (*nodes)[i], false
}
node := newNode(value, entry, !isLastDimension)
*nodes = append(*nodes, nil)
copy((*nodes)[i+1:], (*nodes)[i:])
(*nodes)[i] = node
return node, true
}
func (nodes orderedNodes) flatten(entries *Entries) {
for _, node := range nodes {
if node.orderedNodes != nil {
node.orderedNodes.flatten(entries)
} else {
*entries = append(*entries, node.entry)
}
}
}
func (nodes *orderedNodes) insert(insertDimension, dimension, maxDimension uint64,
index, number int64, modified, deleted *Entries) {
lastDimension := isLastDimension(maxDimension, dimension)
if insertDimension == dimension {
i := nodes.search(index)
var toDelete []int
for j := i; j < len(*nodes); j++ {
(*nodes)[j].value += number
if (*nodes)[j].value < index {
toDelete = append(toDelete, j)
if lastDimension {
*deleted = append(*deleted, (*nodes)[j].entry)
} else {
(*nodes)[j].orderedNodes.flatten(deleted)
}
continue
}
if lastDimension {
*modified = append(*modified, (*nodes)[j].entry)
} else {
(*nodes)[j].orderedNodes.flatten(modified)
}
}
for i, index := range toDelete {
nodes.deleteAt(index - i)
}
return
}
for _, node := range *nodes {
node.orderedNodes.insert(
insertDimension, dimension+1, maxDimension,
index, number, modified, deleted,
)
}
}
func (nodes orderedNodes) immutableInsert(insertDimension, dimension, maxDimension uint64,
index, number int64, modified, deleted *Entries) orderedNodes {
lastDimension := isLastDimension(maxDimension, dimension)
cp := make(orderedNodes, len(nodes))
copy(cp, nodes)
if insertDimension == dimension {
i := cp.search(index)
var toDelete []int
for j := i; j < len(cp); j++ {
nn := newNode(cp[j].value+number, cp[j].entry, !lastDimension)
nn.orderedNodes = cp[j].orderedNodes
cp[j] = nn
if cp[j].value < index {
toDelete = append(toDelete, j)
if lastDimension {
*deleted = append(*deleted, cp[j].entry)
} else {
cp[j].orderedNodes.flatten(deleted)
}
continue
}
if lastDimension {
*modified = append(*modified, cp[j].entry)
} else {
cp[j].orderedNodes.flatten(modified)
}
}
for _, index := range toDelete {
cp.deleteAt(index)
}
return cp
}
for i := 0; i < len(cp); i++ {
oldNode := nodes[i]
nn := newNode(oldNode.value, oldNode.entry, !lastDimension)
nn.orderedNodes = oldNode.orderedNodes.immutableInsert(
insertDimension, dimension+1,
maxDimension,
index, number,
modified, deleted,
)
cp[i] = nn
}
return cp
}