/
container.go
151 lines (127 loc) · 2.81 KB
/
container.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
package main
import (
"context"
"github.com/andersfylling/go-sortnet/sortnet"
"github.com/kyroy/kdtree"
"golang.org/x/sync/errgroup"
)
type Container struct {
sets []sortnet.OutputSet
trees map[int]*KDTree
dirtyTree map[int]bool
dirty int
}
func (c *Container) Insert(sets []sortnet.OutputSet) {
if c.trees == nil {
c.trees = map[int]*KDTree{}
c.dirtyTree = map[int]bool{}
}
for _, set := range sets {
if set == nil {
continue
}
size := set.Size()
if _, ok := c.trees[size]; !ok {
c.trees[size] = NewKDTree()
}
point := CreateMetadataPoint(set)
c.trees[size].Insert([]*Metadata{point})
c.dirtyTree[size] = true
c.sets = append(c.sets, set)
}
}
func (c *Container) Balance() {
for size, dirty := range c.dirtyTree {
c.dirtyTree[size] = false
if !dirty {
continue
}
c.trees[size].Balance()
}
}
func (c *Container) Search(set sortnet.OutputSet, direction SearchDirection) []sortnet.NetworkID {
point := CreateMetadataPoint(set)
var ids []sortnet.NetworkID
for treeSize, tree := range c.trees {
switch direction {
case DirectionEqualAndSuperset:
if treeSize < point.Size {
continue
}
case DirectionEqual:
if treeSize != point.Size {
continue
}
}
matches := tree.FindCandidates(point, direction)
for _, id := range matches {
target := c.sets[int(id)]
if target == nil || set == target {
continue
}
ids = append(ids, target.Metadata().NetworkID)
}
}
return ids
}
func (c *Container) SearchParallel(set sortnet.OutputSet, result chan<- *Work) {
point := CreateMetadataPoint(set)
size := set.Size()
g, _ := errgroup.WithContext(context.Background())
work := make(chan int)
g.Go(func() error {
defer close(work)
for treeSize := range c.trees {
if treeSize < size {
continue
}
work <- treeSize
}
return nil
})
workers := Workers
if len(c.trees) < workers {
workers = len(c.trees)
}
for i := 0; i < workers; i++ {
g.Go(func() error {
for treeSize := range work {
tree := c.trees[treeSize]
for _, id := range tree.FindCandidates(point, DirectionEqualAndSuperset) {
target := c.sets[int(id)]
if target == nil || set == target {
continue
}
result <- &Work{
set: target,
id: target.Metadata().NetworkID,
}
}
}
return nil
})
}
_ = g.Wait()
}
func (c *Container) Prune(ids []sortnet.NetworkID) {
for _, id := range ids {
c.sets[int(id)] = nil
}
c.dirty += len(ids)
}
func (c *Container) Rebalance() {
for size, tree := range c.trees {
var remaining []kdtree.Point
ids, ps := tree.Points()
for i := range ids {
if c.sets[ids[i]] != nil {
remaining = append(remaining, ps[i])
}
}
c.trees[size] = NewKDTree()
c.trees[size].InsertRaw(remaining)
c.trees[size].Balance()
c.dirtyTree[size] = false
}
c.dirty = 0
}