pkg/adt/interval_tree.go
func (ivt *IntervalTree) Stab(iv Interval) (ivs []*IntervalValue) {
	if ivt.count == 0 {
		return nil
	}
	f := func(n *IntervalValue) bool { ivs = append(ivs, n); return true }
	ivt.Visit(iv, f)
	return ivs
}
func (ivt *IntervalTree) Stab(iv Interval) (ivs []*IntervalValue) {
	if ivt.count == 0 {
		return nil
	}
	f := func(n *IntervalValue) bool { ivs = append(ivs, n); return true }
	ivt.Visit(iv, f)
	return ivs
}
func ( ivt * IntervalTree ) Stab ( iv Interval ) ( ivs [ ] * IntervalValue ) { if ivt . count == 0 { return nil } f := func ( n * IntervalValue ) bool { ivs = append ( ivs , n ) ; return true } ivt . Visit ( iv , f ) return ivs }
// Stab returns a slice with all elements in the tree intersecting the interval.
Stab returns a slice with all elements in the tree intersecting the interval .