/
sparsebitvector_element.go
72 lines (62 loc) · 1.27 KB
/
sparsebitvector_element.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
// This file is distributed under the
// University of Illinois Open Source License.
// See LICENSE.TXT for details.
package sparsebitvector
// element is used internally by SparseBitVector.
type element struct {
FiniteBitVector
index KeyType
prev *element
next *element
}
func (sbv *SparseBitVector) create(index KeyType, prev, next *element) *element {
element := &element{index: index, next: next, prev: prev}
if prev == nil {
sbv.start = element
} else {
prev.next = element
}
if next != nil {
next.prev = element
}
sbv.current = element
return element
}
func (sbv *SparseBitVector) delete(e *element) {
if sbv.start == e {
sbv.start = e.next
}
if sbv.current == e {
sbv.current = e.prev
}
if e.prev != nil {
e.prev.next = e.next
}
if e.next != nil {
e.next.prev = e.prev
}
}
func (sbv *SparseBitVector) search(index KeyType) *element {
if sbv.current == nil {
if sbv.start == nil {
return nil
}
sbv.current = sbv.start
}
if sbv.current.index > index {
for e := sbv.current; e != nil; e = e.prev {
sbv.current = e
if e.index == index {
break
}
}
} else if sbv.current.index < index {
for e := sbv.current; e != nil; e = e.next {
sbv.current = e
if e.index == index {
break
}
}
}
return sbv.current
}