|
Algorithm Development Kit 1.0 |
||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
IConstructor | Interface for constructing nodes in a Segment Tree. |
Class Summary | |
---|---|
DiscreteInterval | Represents a discrete interval [left,right) that implements IInterval. |
SegmentTree<T extends SegmentTreeNode> | Given a fixed set of [1..N] values, the segment tree is a rooted binary tree that manages intervals [begin,end] on a line, where left <= begin < end < right. |
SegmentTreeNode | Nodes of the SegmentTree are constructed from this class. |
StoredIntervalsNode | When a Segment Tree uses StoredIntervalsNode as the base node type, then a reference to the actual Intervals is stored (in no specific order) with each node in the tree. |
Defines the Segment Tree, a data structure for maintaining sets of Intervals within a closed integer domain.
|
Algorithm Development Kit 1.0 | ||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |