IntervalSequenceTree< Key, Allocator >::IstNode Class Reference
This class represents nodes of an Interval Sequence Tree.
More...
#include <IntervalSequenceTree.h>
Collaboration diagram for IntervalSequenceTree< Key, Allocator >::IstNode:
[legend]List of all members.
Detailed Description
template<class Key, class Allocator = allocator<Key>>
class IntervalSequenceTree< Key, Allocator >::IstNode
This class represents nodes of an Interval Sequence Tree.
Internal nodes define any of left, center, and right to be non-null and key to be null. Leaf nodes define left, center, and right as null and key points to an interval. The length field in an internal node is always the sum of lengths of the leaf nodes in its subtree. The subtree_size field is defined as the number of nodes (leaf and internal) below the node.
Definition at line 65 of file IntervalSequenceTree.h.
Constructor & Destructor Documentation
template<class Key, class Allocator = allocator<Key>> |
IntervalSequenceTree< Key, Allocator >::IstNode::IstNode |
( |
|
) |
[inline] |
|
|
Definition at line 74 of file IntervalSequenceTree.h.
References IntervalSequenceTree< Key, Allocator >::IstNode::key, IntervalSequenceTree< Key, Allocator >::IstNode::left, IntervalSequenceTree< Key, Allocator >::IstNode::length, IntervalSequenceTree< Key, Allocator >::IstNode::parent, IntervalSequenceTree< Key, Allocator >::IstNode::right, and IntervalSequenceTree< Key, Allocator >::IstNode::subtree_size. |
Member Data Documentation
|
Definition at line 72 of file IntervalSequenceTree.h.
Referenced by IntervalSequenceTree< Key, Allocator >::countNodes(), IntervalSequenceTree< Key, Allocator >::decrement(), IntervalSequenceTree< Key, Allocator >::deleteSubtree(), IntervalSequenceTree< Key, Allocator >::erase(), IntervalSequenceTree< Key, Allocator >::increment(), IntervalSequenceTree< Key, Allocator >::IstNode::IstNode(), and IntervalSequenceTree< Key, Allocator >::recursiveFind(). |
|
Definition at line 68 of file IntervalSequenceTree.h.
Referenced by IntervalSequenceTree< Key, Allocator >::countNodes(), IntervalSequenceTree< Key, Allocator >::decrement(), IntervalSequenceTree< Key, Allocator >::deleteSubtree(), IntervalSequenceTree< Key, Allocator >::erase(), IntervalSequenceTree< Key, Allocator >::increment(), IntervalSequenceTree< Key, Allocator >::IstNode::IstNode(), and IntervalSequenceTree< Key, Allocator >::recursiveFind(). |
|
Definition at line 69 of file IntervalSequenceTree.h.
Referenced by IntervalSequenceTree< Key, Allocator >::countNodes(), IntervalSequenceTree< Key, Allocator >::decrement(), IntervalSequenceTree< Key, Allocator >::deleteSubtree(), IntervalSequenceTree< Key, Allocator >::erase(), IntervalSequenceTree< Key, Allocator >::increment(), IntervalSequenceTree< Key, Allocator >::IstNode::IstNode(), and IntervalSequenceTree< Key, Allocator >::recursiveFind(). |
The documentation for this class was generated from the following file:
Generated on Mon Feb 14 19:30:00 2005 for libGenome by
1.3.8