A representation of an inequality that can be used to search and sort the
elements of an array into
buckets. It is a collection of
Point will include any values less that its own and, if the point is
inclusive, equal to its own.
True if only one value is kept for elements after the last point. Used to find the inorder successor.
True if only one value is kept for elements before the first point. Used to find the inorder predecessor.
Set the default bucket for any values greater than the last point.
A function used by Binary Search Trees to determine traversal.
The value to compare.
The current values that are stored.
If true, elements from
current will be eliminated
if they are affected by
an alternative closer to
data is found.
Will be called when there is the possibility that
there are elements smaller than this one that will satisfy
greater_find_least, thereby reducing the number of necessary traversals.
An object containing
right, which are booleans that
tell whether more data could be found to the left and right of
respectively, as well as an optional
bucket string to tell where
should be sorted.
Add a point to the collection.
The value for comparison.
bucket to sort values into, or undefined to discard.
Determines if the point includes
Generated using TypeDoc