blob: 488ce7fb09be3fdebf06b9f95880b01e1cd1c79b (
plain) (
blame)
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
|
package tvm
import "sort"
type entityAttribute struct {
key string
value string
}
// subTree provides index for fast entity lookup with attributes
//
// or some subset of entity attributes
type subTree struct {
// entities contains entities with attributes from previous branches of tree:
// * root subTree contains all entities
// * next subTree contains entities with {"key#X": "value#X"}
// * next subTree after next contains entities with {"key#X": "value#X", "key#Y": "value#Y"}
// * and so on
// "key#X", "key#Y", ... - are sorted
entities []Entity
// entityLengths provides O(1) for exact entity lookup
entityLengths map[int]interface{}
// entityIds is creation-time crutch
entityIds []int
idxByAttrs *idxByAttrs
}
type idxByAttrs = map[entityAttribute]*subTree
func (s *subTree) containsExactEntity(entity Entity) bool {
subtree := s.findSubTree(entity)
if subtree == nil {
return false
}
_, ok := subtree.entityLengths[len(entity)]
return ok
}
func (s *subTree) getEntitiesWithAttrs(entityPart Entity) []Entity {
subtree := s.findSubTree(entityPart)
if subtree == nil {
return nil
}
return subtree.entities
}
func (s *subTree) findSubTree(e Entity) *subTree {
keys := make([]string, 0, len(e))
for k := range e {
keys = append(keys, k)
}
sort.Strings(keys)
res := s
for _, k := range keys {
if res.idxByAttrs == nil {
return nil
}
kv := entityAttribute{key: k, value: e[k]}
ok := false
res, ok = (*res.idxByAttrs)[kv]
if !ok {
return nil
}
}
return res
}
|
