diff options
Diffstat (limited to 'ace/RB_Tree.i')
| -rw-r--r-- | ace/RB_Tree.i | 185 |
1 files changed, 0 insertions, 185 deletions
diff --git a/ace/RB_Tree.i b/ace/RB_Tree.i deleted file mode 100644 index 3ddfee0f079..00000000000 --- a/ace/RB_Tree.i +++ /dev/null @@ -1,185 +0,0 @@ -/* -*- C++ -*- */ -// $Id$ - -///////////////////////////////////////////// -// template class ACE_RB_Tree_Node<KEY, T> // -///////////////////////////////////////////// - -// Key accessor. - -template <class KEY, class T> ACE_INLINE KEY & -ACE_RB_Tree_Node<KEY, T>::key () -{ - return k_; -} - - -// Item accessor. - -template <class KEY, class T> ACE_INLINE T & -ACE_RB_Tree_Node<KEY, T>::item () -{ - return t_; -} - - -// Set color of the node. - -template <class KEY, class T> ACE_INLINE void -ACE_RB_Tree_Node<KEY, T>::color (ACE_RB_Tree_Node_Base::RB_Tree_Node_Color c) -{ - color_ = c; -} - - -// Get color of the node. - -template <class KEY, class T> -ACE_INLINE ACE_RB_Tree_Node_Base::RB_Tree_Node_Color -ACE_RB_Tree_Node<KEY, T>::color () -{ - return color_; -} - - -// Accessor for node's parent pointer. - -template <class KEY, class T> ACE_INLINE ACE_RB_Tree_Node<KEY, T> * -ACE_RB_Tree_Node<KEY, T>::parent () -{ - return parent_; -} - - -// Mutator for node's parent pointer. - -template <class KEY, class T> ACE_INLINE void -ACE_RB_Tree_Node<KEY, T>::parent (ACE_RB_Tree_Node<KEY, T> * p) -{ - parent_ = p; -} - - - -// Accessor for node's left child pointer. - -template <class KEY, class T> ACE_INLINE ACE_RB_Tree_Node<KEY, T> * -ACE_RB_Tree_Node<KEY, T>::left () -{ - return left_; -} - - -// Mutator for node's left child pointer. - -template <class KEY, class T> ACE_INLINE void -ACE_RB_Tree_Node<KEY, T>::left (ACE_RB_Tree_Node<KEY, T> * l) -{ - left_ = l; -} - - -// Accessor for node's right child pointer. - -template <class KEY, class T> ACE_INLINE ACE_RB_Tree_Node<KEY, T> * -ACE_RB_Tree_Node<KEY, T>::right () -{ - return right_; -} - - -// Mutator for node's right child pointer. - -template <class KEY, class T> ACE_INLINE void -ACE_RB_Tree_Node<KEY, T>::right (ACE_RB_Tree_Node<KEY, T> * r) -{ - right_ = r; -} - - - -//////////////////////////////////////////////////////////////// -// template class ACE_RB_Tree<KEY, T, COMPARE_KEYS, ACE_LOCK> // -//////////////////////////////////////////////////////////////// - - -// Destroys all nodes and sets the root pointer null. - -template <class KEY, class T, class COMPARE_KEYS, class ACE_LOCK> ACE_INLINE void -ACE_RB_Tree<KEY, T, COMPARE_KEYS, ACE_LOCK>::clear () -{ - delete root_; - root_ = 0; -} - - - -////////////////////////////////////////////////////////// -// template class ACE_RB_Tree_Iterator<KEY, T, COMPARE_KEYS, ACE_LOCK> // -////////////////////////////////////////////////////////// - - -// Accessor for key of node under iterator (if any). - -template <class KEY, class T, class COMPARE_KEYS, class ACE_LOCK> ACE_INLINE KEY * -ACE_RB_Tree_Iterator<KEY, T, COMPARE_KEYS, ACE_LOCK>::key () -{ - return node_ ? (&(node_->key ())) : 0; -} - - -// Accessor for item of node under iterator (if any). - -template <class KEY, class T, class COMPARE_KEYS, class ACE_LOCK> ACE_INLINE T * -ACE_RB_Tree_Iterator<KEY, T, COMPARE_KEYS, ACE_LOCK>::item () -{ - return node_ ? (&(node_->item ())) : 0; -} - - -// Move to the first item in the tree. - -template <class KEY, class T, class COMPARE_KEYS, class ACE_LOCK> ACE_INLINE int -ACE_RB_Tree_Iterator<KEY, T, COMPARE_KEYS, ACE_LOCK>::first () -{ - node_ = tree_.RB_tree_minimum (tree_.root_); - return node_ ? 1 : 0; -} - - -// Move to the last item in the tree. - -template <class KEY, class T, class COMPARE_KEYS, class ACE_LOCK> ACE_INLINE int -ACE_RB_Tree_Iterator<KEY, T, COMPARE_KEYS, ACE_LOCK>::last () -{ - node_ = tree_.RB_tree_maximum (tree_.root_); - return node_ ? 1 : 0; -} - - -// Moves to the next item in the tree, -// returns 1 if there is a next item, 0 otherwise. - -template <class KEY, class T, class COMPARE_KEYS, class ACE_LOCK> ACE_INLINE int -ACE_RB_Tree_Iterator<KEY, T, COMPARE_KEYS, ACE_LOCK>::next () -{ - node_ = tree_.RB_tree_successor (node_); - return node_ ? 1 : 0; -} - - -// Moves to the previous item in the tree, -// returns 1 if there is a previous item, 0 otherwise. - -template <class KEY, class T, class COMPARE_KEYS, class ACE_LOCK> ACE_INLINE int -ACE_RB_Tree_Iterator<KEY, T, COMPARE_KEYS, ACE_LOCK>::previous () -{ - node_ = tree_.RB_tree_predecessor (node_); - return node_ ? 1 : 0; -} - -template <class KEY, class T, class COMPARE_KEYS, class ACE_LOCK> ACE_INLINE int -ACE_RB_Tree_Iterator<KEY, T, COMPARE_KEYS, ACE_LOCK>::is_done () -{ - return node_ ? 0 : 1; -} |