Mirroristas/etcd
2
0
Fork 0
mirror of https://github.com/etcd-io/etcd.git synced 2024-09-27 06:25:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

adt: Visit() interval trees in sorted order and terminate early

Browse Source 
For all intervals [x, y), Visit will visit intervals in ascending order
sorted by x. Also fixes a bug where Visit would not terminate the search
when requested by the visitor function.
This commit is contained in:
Anthony Romano
2017-03-22 22:27:05 -07:00
parent 1a75165ed8
commit 25e3ce1feb
2 changed files with 108 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
pkg/adt/interval_tree.go
View File

@@ -134,25 +134,29 @@ func (x *intervalNode) updateMax() {
type nodeVisitor func(n *intervalNode) bool
// visit will call a node visitor on each node that overlaps the given interval
func (x *intervalNode) visit(iv *Interval, nv nodeVisitor) {
func (x *intervalNode) visit(iv *Interval, nv nodeVisitor) bool {
if x == nil {
return
return true
}
v := iv.Compare(&x.iv.Ivl)
switch {
case v < 0:
x.left.visit(iv, nv)
if !x.left.visit(iv, nv) {
return false
}
case v > 0:
maxiv := Interval{x.iv.Ivl.Begin, x.max}
if maxiv.Compare(iv) == 0 {
x.left.visit(iv, nv)
x.right.visit(iv, nv)
if !x.left.visit(iv, nv) || !x.right.visit(iv, nv) {
return false
}
}
default:
nv(x)
x.left.visit(iv, nv)
x.right.visit(iv, nv)
if !x.left.visit(iv, nv) || !nv(x) || !x.right.visit(iv, nv) {
return false
}
}
return true
}
type IntervalValue struct {
@@ -406,6 +410,7 @@ func (ivt *IntervalTree) MaxHeight() int {
type IntervalVisitor func(n *IntervalValue) bool
// Visit calls a visitor function on every tree node intersecting the given interval.
// It will visit each interval [x, y) in ascending order sorted on x.
func (ivt *IntervalTree) Visit(ivl Interval, ivv IntervalVisitor) {
ivt.root.visit(&ivl, func(n *intervalNode) bool { return ivv(&n.iv) })
}