Do performs the function fn on steps stored in the Vector over the range [from, to) in ascending sort order of start position. fn is passed the start,

End returns the index of lowest position beyond the end of the Vector.

Insert adds a point to the tree, updating the bounding volumes if bounding is true, and the tree is empty or the tree already has bounding volumes sto

MedianOfMedians returns the index to the median value of the medians of groups of 5 consecutive elements.

NearestSet finds the nearest values to the query accepted by the provided Keeper, k. k must be able to return a ComparableDist specifying the maximum

NewNKeeper returns an NKeeper with the max value of the heap set to infinite distance. The returned NKeeper is able to retain at most n values.

Start returns the index of minimum position of the Vector.

fixUp ensures that black link balance is correct, that red nodes lean left, and that 4 nodes are split in the case of BU23 and properly balanced in TD

fixUp ensures that black link balance is correct, that red nodes lean left, and that 4 nodes are split in the case of BU23 and properly balanced in TD

fixUp ensures that black link balance is correct, that red nodes lean left, and that 4 nodes are split in the case of BU23 and properly balanced in TD

Ceil returns the smallest value equal to or greater than the query q according to q.Start().Compare(), with ties broken by comparison of ID() values.

Ceil returns the smallest value equal to or greater than the query q according to q.Start().Compare(), with ties broken by comparison of ID() values.

DeleteMax deletes the node with the maximum value in the tree. If insertion without replacement has been used, the right-most maximum will be deleted.

Do performs fn on all values stored in the tree. A boolean is returned indicating whether the Do traversal was interrupted by an Operation returning t

Extend returns a bounding box that has been extended to include the receiver. Extend may return nil.

Floor returns the largest value equal to or less than the query q according to q.Start().Compare(), with ties broken by comparison of ID() values.

Floor returns the largest value equal to or less than the query q according to q.Start().Compare(), with ties broken by comparison of ID() values.

Get returns a slice of IntInterfaces that overlap q in the IntTree according to q.Overlap().

Index returns the ith element of the list of points.

Return the right-most interval stored in the tree.

Return the right-most interval stored in the tree.

Return the left-most interval stored in the tree.

Apply applies the mutator function m to steps stored in the Vector in ascending sort order of start position. Redundant steps resulting from changes i

Delete deletes the element e if it exists in the IntTree.

DeleteMax deletes the right-most interval.

DeleteMin deletes the left-most interval.

Describe calculates the persistence landscape functions λₖ for the interval data in the provided Interface. fn is called for each position t of the sp

DescribeTree calculates the persistence landscape functions λₖ for the interval data in the provided interval tree. fn is called for each position t o

Do performs fn on all values stored in the tree. A boolean is returned indicating whether the Do traversal was interrupted by an Operation returning t

DoBounded performs fn on all values stored in the tree that are within the specified bound. If b is nil, the result is the same as a Do. A boolean is

DoMatch performs fn on all intervals stored in the tree that match q according to Overlap, with q.Overlap() used to guide tree traversal, so DoMatchin

DoRange performs fn on all values stored in the tree over the interval [from, to) from left to right. If to is less than from DoRange will panic. A bo

DoRangeReverse performs fn on all values stored in the tree over the interval (to, from] from right to left. If from is less than to DoRange will pani

DoReverse performs fn on all values stored in the tree, but in reverse of sort order. A boolean is returned indicating whether the Do traversal was in

Flatten all overlapping intervals, storing originals as sub-intervals.

Keep add c to the heap if its distance is less than the maximum value of the heap. If adding c would increase the size of the heap beyond the initial

Len returns the number of elements in the tree.

Merge an interval into the tree, replacing overlapping intervals, but retaining them as sub intervals.

NewDistKeeper returns an DistKeeper with the max value of the heap set to d.

Returns a unique ID for the element.

deleteRangeInclusive deletes all steps within the given range. Note that llrb.(*Tree).DoRange does not operate on the node matching the end of a range