forked from Workiva/go-datastructures
/
rangetree.go
61 lines (46 loc) · 1.28 KB
/
rangetree.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
package mock
import (
"github.com/stretchr/testify/mock"
"github.com/Workiva/go-datastructures/rangetree"
)
type RangeTree struct {
mock.Mock
}
var _ rangetree.RangeTree = new(RangeTree)
func (m *RangeTree) Add(entries ...rangetree.Entry) rangetree.Entries {
args := m.Called(entries)
ifc := args.Get(0)
if ifc == nil {
return nil
}
return ifc.(rangetree.Entries)
}
func (m *RangeTree) Len() uint64 {
return m.Called().Get(0).(uint64)
}
func (m *RangeTree) Delete(entries ...rangetree.Entry) rangetree.Entries {
return m.Called(entries).Get(0).(rangetree.Entries)
}
func (m *RangeTree) Query(interval rangetree.Interval) rangetree.Entries {
args := m.Called(interval)
ifc := args.Get(0)
if ifc == nil {
return nil
}
return ifc.(rangetree.Entries)
}
func (m *RangeTree) InsertAtDimension(dimension uint64, index,
number int64) (rangetree.Entries, rangetree.Entries) {
args := m.Called(dimension, index, number)
return args.Get(0).(rangetree.Entries), args.Get(1).(rangetree.Entries)
}
func (m *RangeTree) Apply(interval rangetree.Interval, fn func(rangetree.Entry) bool) {
m.Called(interval, fn)
}
func (m *RangeTree) Get(entries ...rangetree.Entry) rangetree.Entries {
ifc := m.Called(entries).Get(0)
if ifc == nil {
return nil
}
return ifc.(rangetree.Entries)
}