Package blogspot.software_and_algorithms.stern_library.data_structure

Interface Summary

Interface	Description
ThriftyList.ListInternal<T>	Interface for internal helper lists to ThriftyList as instances are not required to perform bounds checking (all such responsibilities are delegated to ThriftyList itself).

Class Summary

Class	Description
DynamicIntervalTree<U extends Comparable<U>,T extends Interval<U>>	A dynamic interval tree is a balanced binary search tree which stores intervals so that both point queries (queries that return intervals from the set which contain a query point) and overlapping interval queries (queries that return intervals from the set which overlap a query interval) can be completed in time O(k*log(n)), where n is the number of intervals stored in the tree and k is the size of the result set from the query.
DynamicIntervalTree.Node<U extends Comparable<U>,T extends Interval<U>>	A node for a dynamic interval tree is a red-black tree node augmented to store the maximum high endpoint among intervals stored within the subtree rooted at the node.
Interval<T extends Comparable<T>>	An interval is the subset of elements which fall between (with respect to a total order) two endpoint elements of a set.
OrderLinkedRedBlackTree<T>	A red black tree that has been augmented to support linear time partial iteration by storing pointers to a node's predecessor and successor within the node itself.
OrderLinkedRedBlackTree.Node<T>	A red-black tree node augmented to store pointers to its predecessor and successor.
RedBlackTree<T>	A red-black tree is a binary search tree guaranteeing that no path from root to leaf is more than twice as long as any other such path.
RedBlackTree.Node<T>	A red-black tree node is a binary tree node augmented to hold an additional piece of information called the node's color.
StaticIntervalTree<U extends Comparable<U>,T extends Interval<U>>	A static interval tree is a balanced binary search tree which is built to store a pre-specified set of intervals so that both point queries (queries that return intervals from the set which contain a query point) and overlapping interval queries (queries that return intervals from the set which overlap a query interval) can be completed in time O(log(n)+k), where n is the size of the pre-specified set of intervals and k is the size of the result set from the query.
StaticIntervalTree.Node<U extends Comparable<U>,T extends Interval<U>>	A node for a static interval tree is a binary tree node augmented with an associated point value and the ability to store intervals.
ThriftyList<T>	A dynamically sized compact data structure implementing both the Deque and List interfaces.
ThriftyList.CircularListInternal<T>	A fixed capacity circular list.
ThriftyList.FixedListInternal<T>	A fixed capacity list.

Enum Summary

Enum	Description
RedBlackTree.Node.NodeColor	The domain of values from which a node's color is assigned.