-
Notifications
You must be signed in to change notification settings - Fork 0
/
tracer.go
109 lines (90 loc) · 2.8 KB
/
tracer.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
package covertree
import (
"fmt"
"time"
)
// Tracer represents a record for performance metrics of Tree operations.
//
// Tracers for a given tree can be created using the tree’s NewTracer method.
//
// Tracers are not thread safe and should not be shared by multiple Goroutines.
type Tracer struct {
tree *Tree
TotalCoveredSetSize int
MaxCoverSetSize int
MaxLevelsTraversed int
LoadChildrenCount int
TotalLoadChildrenTime time.Duration
TotalTime time.Duration
}
// FindNearest returns the nearest items in the tree to the specified query
// item, up to the specified maximum number of results and maximum distance.
//
// Results are returned with their distances from the query item, in order from
// closest to furthest.
//
// If no items are found matching the given criteria, an empty result set is
// returned.
func (t *Tracer) FindNearest(query interface{}, maxResults int, maxDistance float64) (results []ItemWithDistance, err error) {
t.doWithTrace(func() {
results, err = t.tree.findNearestWithTrace(query, maxResults, maxDistance, t)
})
return
}
// Insert inserts the specified item into the tree.
func (t *Tracer) Insert(item interface{}) (err error) {
t.doWithTrace(func() {
err = t.tree.insertWithTrace(item, t)
})
return
}
// Remove removes the given item from the tree. If no such item exists in the
// tree, this has no effect.
//
// removed will be the item that was successfully removed, or nil if no matching
// item was found.
func (t *Tracer) Remove(item interface{}) (removed interface{}, err error) {
t.doWithTrace(func() {
removed, err = t.tree.removeWithTrace(item, t)
})
return
}
func (t *Tracer) String() string {
if t == nil {
return "nil"
}
return fmt.Sprintf("%v, total covered set size: %d, max visible cover set size: %d, levels traversed: %d, load children count: %d, total load children time: %v", t.TotalTime, t.TotalCoveredSetSize, t.MaxCoverSetSize, t.MaxLevelsTraversed, t.LoadChildrenCount, t.TotalLoadChildrenTime)
}
func (t *Tracer) doWithTrace(f func()) {
var startTime time.Time
t.reset()
defer func() {
t.TotalTime = time.Now().Sub(startTime)
}()
startTime = time.Now()
f()
}
func (t *Tracer) loadChildren(parents ...interface{}) ([]LevelsWithItems, error) {
var startTime time.Time
t.LoadChildrenCount++
defer func() {
t.TotalLoadChildrenTime += time.Now().Sub(startTime)
}()
startTime = time.Now()
return t.tree.store.LoadChildren(parents...)
}
func (t *Tracer) recordLevel(cs coverSet) {
t.TotalCoveredSetSize = cs.totalItemCount
size := cs.visibleItemCount
if size > t.MaxCoverSetSize {
t.MaxCoverSetSize = size
}
t.MaxLevelsTraversed++
}
func (t *Tracer) reset() {
t.TotalCoveredSetSize = 0
t.MaxCoverSetSize = 0
t.MaxLevelsTraversed = 0
t.LoadChildrenCount = 0
t.TotalLoadChildrenTime = 0
}