| Package | Description |
|---|---|
| blogspot.software_and_algorithms.stern_library.data_structure |
| Class and Description |
|---|
| DynamicIntervalTree.Node
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
An interval is the subset of elements which fall between (with
respect to a total order) two endpoint elements of a set.
|
| OrderLinkedRedBlackTree.Node
A red-black tree node augmented to store pointers to its predecessor and
successor.
|
| RedBlackTree
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
A red-black tree node is a binary tree node augmented to hold an
additional piece of information called the node's color.
|
| RedBlackTree.Node.NodeColor
The domain of values from which a node's color is assigned.
|
| StaticIntervalTree.Node
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.IterBase |
| ThriftyList.ListInternal
Interface for internal helper lists to
ThriftyList as instances
are not required to perform bounds checking (all such responsibilities
are delegated to ThriftyList itself). |
Copyright © 1994–2024 Peter Murray-Rust. All rights reserved.