class MAGES::Recorder::IntervalTree::Node¶
Overview¶
class Node
{
public:
// properties
TKey Min;
TKey Max;
Node Left;
Node Right;
RVP[] Items;
// methods
Node();
Node(IList items);
int Contains(TKey min, TKey max);
List Q(TKey key);
List Q(TKey inMin, TKey inMax);
};
Detailed Documentation¶
Properties¶
Node Left
Gets the left child.
Node Right
Gets the right child.
RVP[] Items
Gets the items.
Methods¶
int Contains(TKey min, TKey max)
Determines if the given range is contained in the sub-tree.
Parameters:
min |
The minimum key. |
max |
The maximum key. |
Returns:
-2: Range is on the left side of this RVP. -1: Range is intersected coming from the left. 0: Range is inside this RVP, or is RVP. +1: Range is intersected coming from the right. +2: Range is on the right side of this RVP.