pkg/adt/interval_tree.go
func (ivt *IntervalTree) Intersects(iv Interval) bool {
	x := ivt.root
	for x != nil && iv.Compare(&x.iv.Ivl) != 0 {
		if x.left != nil && x.left.max.Compare(iv.Begin) > 0 {
			x = x.left
		} else {
			x = x.right
		}
	}
	return x != nil
}
func (ivt *IntervalTree) Intersects(iv Interval) bool {
	x := ivt.root
	for x != nil && iv.Compare(&x.iv.Ivl) != 0 {
		if x.left != nil && x.left.max.Compare(iv.Begin) > 0 {
			x = x.left
		} else {
			x = x.right
		}
	}
	return x != nil
}
func ( ivt * IntervalTree ) Intersects ( iv Interval ) bool { x := ivt . root for x != nil && iv . Compare ( & x . iv . Ivl ) != 0 { if x . left != nil && x . left . max . Compare ( iv . Begin ) > 0 { x = x . left } else { x = x . right } } return x != nil }
// Intersects returns true if there is some tree node intersecting the given interval.
Intersects returns true if there is some tree node intersecting the given interval .