Len returns the length of the list.

Insert inserts the Comparable e into the Tree at the first match found with e or when a nil node is reached. Insertion without replacement can specifi

Helper methods color returns the effect color of a Node. A nil node returns black.

Insert inserts the Interface e into the Tree. Insertions may replace existing stored intervals.

Compare returns a value indicating the sort order relationship between the receiver and the parameter. Given c = a.Compare(b): c < 0 if a < b; c == 0

Helper methods color returns the effect color of a Node. A nil node returns black.

Return a Comparable equal to the start value of the Overlapper.

Helper methods color returns the effect color of a IntNode. A nil node returns black.

SetRange sets the value of positions [start, end) to e.

New returns a new Vector with the extent defined by start and end, and the ground state defined by zero. The Vector's extent is mutable if the Relaxed

Return a Comparable equal to the end value of the Overlapper.

Floor returns the greatest value equal to or less than the query q according to q.Compare().

Keep conditionally pushes the provided ComparableDist onto the heap.

Return a Newick format description of a tree defined by a node

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

Delete deletes the node that matches e according to Compare(). Note that Compare must identify the target node uniquely and in cases where non-unique

Does every node correctly annotate the range of its children.

Does every node correctly annotate the range of its children.

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

Test BU and TD234 invariants.

Do all paths from root to leaf have same number of black edges?

New returns a k-d tree constructed from the values in p. If p is a Bounder and bounding is true, bounds are determined for each node.

Return a Newick format description of a tree defined by a node

Integrity checks - translated from http://www.cs.princeton.edu/~rs/talks/LLRB/Java/RedBlackBST.java Is this tree a BST?

Do performs the function fn on steps stored in the Vector in ascending sort order of start position. fn is passed the start, end and value of the step

Len returns the number of elements stored in the Tree.

Return the minimum value stored in the tree. This will be the left-most minimum value if insertion without replacement has been used.

Return the left-most interval stored in the tree.

Overlap returns a boolean indicating whether the receiver overlaps the parameter.

Overlap returns a boolean indicating whether the receiver overlaps a range.

Set sets the value of position i to e.

Test BU and TD234 invariants.

Test BU and TD234 invariants.

Integrity checks - translated from http://www.cs.princeton.edu/~rs/talks/LLRB/Java/RedBlackBST.java Is this tree a BST?

Integrity checks - translated from http://www.cs.princeton.edu/~rs/talks/LLRB/Java/RedBlackBST.java Is this tree a BST?

Do all paths from root to leaf have same number of black edges?

Do all paths from root to leaf have same number of black edges?

Set the start value.

Apply applies the mutator function m to steps stored in the Vector in over the range [from, to) in ascending sort order of start position. Redundant s

Ceil returns the smallest value equal to or greater than the query q according to q.Compare().

(a,c)b -rotR-> (,(,c)b)a

(a,c)b -rotR-> (,(,c)b)a

DeleteMin deletes the left-most interval.

Dims returns the number of dimensions described in the Comparable.

Distance returns the squared Euclidean distance between the receiver and the parameter.

Get returns the first match of q in the Tree. If insertion without replacement is used, this is probably not what you want.

Insert inserts the IntInterface e into the IntTree. Insertions may replace existing stored intervals.

Partition partitions list such that all elements less than the value at pivot prior to the call are placed before that element and all elements greate

Benchmarks

Return a Newick format description of a tree defined by a node

(aR,cR)bB -flipC-> (aB,cB)bR | (aB,cB)bR -flipC-> (aR,cR)bB

(aR,cR)bB -flipC-> (aB,cB)bR | (aB,cB)bR -flipC-> (aR,cR)bB

(aR,cR)bB -flipC-> (aB,cB)bR | (aB,cB)bR -flipC-> (aR,cR)bB

(a,c)b -rotR-> (,(,c)b)a

Len returns the number of intervals stored in the Tree.

Len returns the number of intervals stored in the IntTree.

AdjustRanges fixes range fields for all Nodes in the Tree. This must be called before Get or DoMatching* is used if fast insertion or deletion has bee

MedianOfRandoms returns the index to the median value of up to n randomly chosen elements in list.

StepAt returns the value and range of the step at i, where start <= i < end. If i is outside the extent of the vector, an error is returned.

intMaxRange returns the furthest right position held by the subtree rooted at root, assuming that the left and right nodes have correct range extents.

Build a tree from a simplified Newick format returning the root node. Single letter node names only, no error checking and all nodes are full or leaf.

Build a tree from a simplified Newick format returning the root node. Single letter node names only, no error checking and all nodes are full or leaf.

maxRange returns the furthest right position held by the subtree rooted at root, assuming that the left and right nodes have correct range extents.

(a,c)b -rotL-> ((a,)b,)c

(a,c)b -rotL-> ((a,)b,)c

At returns the value of the vector at position i. If i is outside the extent of the vector an error is returned.

Contains returns whether a Comparable is in the bounds of the tree. If no bounding has been constructed Contains returns true.

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

Return the maximum value stored in the tree. This will be the right-most maximum value if insertion without replacement has been used.

Nearest returns the nearest value to the query and the distance between them.

Pivot partitions the list based on the dimension specified.

Select partitions list such that all elements less than the kth largest element are placed placed before k in the resulting list and all elements grea

Slice returns a slice of the list.

adjustRange sets the Range to the maximum extent of the childrens' Range spans and the node's Elem span.

adjustRange sets the Range to the maximum extent of the childrens' Range spans and the node's Elem span.

(a,c)b -rotL-> ((a,)b,)c

Count returns the number of steps represented in the vector.

DeleteMax deletes the right-most interval.

DeleteMin deletes the node with the minimum value in the tree. If insertion without replacement has been used, the left-most minimum will be deleted.

DoMatch performs fn on all values stored in the tree that match q according to Compare, with q.Compare() used to guide tree traversal, so DoMatching()