Boost C++ Libraries Home Libraries People FAQ More

PrevUpHomeNext

Class template rbtree_algorithms

boost::intrusive::rbtree_algorithms

Synopsis

// In header: <boost/intrusive/rbtree_algorithms.hpp>

template<typename NodeTraits> 
class rbtree_algorithms {
public:
  // types
  typedef                       ;       
  typedef                 ;              
  typedef             ;          
  typedef       ;    
  typedef                ;             
  typedef  ;

  // public static functions
   () ;
   () ;
   () ;
   (, ) ;
   (, ) ;
   (, , , ) ;
   (, ) ;
   (, , ) ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   () ;
   (, ) ;
  template<typename NodePtrCompare> 
     (, , , );
  template<typename NodePtrCompare> 
     (, , , );
  template<typename Cloner, typename Disposer> 
     (, , , );
  template<typename Disposer> 
     (, ) ;
  template<typename KeyType, typename KeyNodePtrCompare> 
     
    (, , );
  template<typename KeyType, typename KeyNodePtrCompare> 
     
    (, , );
  template<typename KeyType, typename KeyNodePtrCompare> 
     (, , );
  template<typename KeyType, typename KeyNodePtrCompare> 
     
    (, , );
  template<typename KeyType, typename KeyNodePtrCompare> 
     
    (, , , 
                  , , );
  template<typename KeyType, typename KeyNodePtrCompare> 
     
    (, , );
  template<typename NodePtrCompare> 
     
    (, , );
  template<typename NodePtrCompare> 
     
    (, , );
  template<typename NodePtrCompare> 
     (, , , );
   (, , ) ;
   (, ) ;
   (, ) ;
  template<typename KeyType, typename KeyNodePtrCompare> 
     
    (, , , 
                        );
  template<typename KeyType, typename KeyNodePtrCompare> 
     
    (, , , 
                        , );
   (, , 
                                   ) ;
   () ;
};

Description

rbtree_algorithms provides basic algorithms to manipulate nodes forming a red-black tree. The insertion and deletion algorithms are based on those in Cormen, Leiserson, and Rivest, Introduction to Algorithms (MIT Press, 1990), except that

(1) the header node is maintained with links not only to the root but also to the leftmost node of the tree, to enable constant time begin(), and to the rightmost node of the tree, to enable linear time performance when used with the generic set algorithms (set_union, etc.);

(2) when a node being deleted has two children its successor node is relinked into its place, rather than copied, so that the only pointers invalidated are those referring to the deleted node.

rbtree_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. NodeTraits must support the following interface:

Typedefs:

node: The type of the node that forms the binary search tree

node_ptr: A pointer to a node

const_node_ptr: A pointer to a const node

color: The type that can store the color of a node

Static functions:

static node_ptr get_parent(const_node_ptr n);

static void set_parent(node_ptr n, node_ptr parent);

static node_ptr get_left(const_node_ptr n);

static void set_left(node_ptr n, node_ptr left);

static node_ptr get_right(const_node_ptr n);

static void set_right(node_ptr n, node_ptr right);

static color get_color(const_node_ptr n);

static void set_color(node_ptr n, color c);

static color black();

static color red();

rbtree_algorithms public types

  1. typedef ;

    This type is the information that will be filled by insert_unique_check

rbtree_algorithms public static functions

  1.  ( n) ;

    Requires: 'n' is a node of the tree or a header node.

    Effects: Returns the header of the tree.

    Complexity: Logarithmic.

    Throws: Nothing.

  2.  ( header) ;

    Requires: 'header' is the header node of a tree.

    Effects: Returns the first node of the tree, the header if the tree is empty.

    Complexity: Constant time.

    Throws: Nothing.

  3.  ( header) ;

    Requires: 'header' is the header node of a tree.

    Effects: Returns the header of the tree.

    Complexity: Constant time.

    Throws: Nothing.

  4.  ( header1,  header2) ;

    Requires: header1 and header2 must be the header nodes of two trees.

    Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

    Complexity: Constant.

    Throws: Nothing.

  5.  ( node1,  node2) ;

    Requires: node1 and node2 can't be header nodes of two trees.

    Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

    Complexity: Logarithmic.

    Throws: Nothing.

    Note: This function will break container ordering invariants if node1 and node2 are not equivalent according to the ordering rules.

    Experimental function

  6.  ( node1,  header1,  node2, 
                            header2) ;

    Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.

    Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

    Complexity: Constant.

    Throws: Nothing.

    Note: This function will break container ordering invariants if node1 and node2 are not equivalent according to the ordering rules.

    Experimental function

  7.  ( node_to_be_replaced,  new_node) ;

    Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.

    Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced

    Complexity: Logarithmic.

    Throws: Nothing.

    Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function

  8.  ( node_to_be_replaced,  header, 
                              new_node) ;

    Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.

    Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced

    Complexity: Constant.

    Throws: Nothing.

    Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function

  9.  ( n) ;

    Requires: 'n' is a tree node but not the header.

    Effects: Unlinks the node and rebalances the tree.

    Complexity: Average complexity is constant time.

    Throws: Nothing.

  10.  ( header) ;

    Requires: header is the header of a tree.

    Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

    Complexity: Average complexity is constant time.

    Throws: Nothing.

    Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

  11.  ( n) ;

    Requires: 'n' is a node of the tree or a node initialized by init(...) or init_node.

    Effects: Returns true if the node is initialized by init() or init_node().

    Complexity: Constant time.

    Throws: Nothing.

  12.  ( header) ;

    Requires: 'header' the header of the tree.

    Effects: Returns the number of nodes of the tree.

    Complexity: Linear time.

    Throws: Nothing.

  13.  ( n) ;
  14.  ( n) ;
  15.  ( n) ;

    Requires: 'n' must not be part of any tree.

    Effects: After the function unique(node) == true.

    Complexity: Constant.

    Throws: Nothing.

    Nodes: If node is inserted in a tree, this function corrupts the tree.

  16.  ( header) ;

    Requires: header must not be part of any tree.

    Effects: Initializes the header to represent an empty tree. unique(header) == true.

    Complexity: Constant.

    Throws: Nothing.

    Nodes: If header is inserted in a tree, this function corrupts the tree.

  17.  ( header,  z) ;

    Requires: header must be the header of a tree, z a node of that tree and z != header.

    Effects: Erases node "z" from the tree with header "header".

    Complexity: Amortized constant time.

    Throws: Nothing.

  18. template<typename NodePtrCompare> 
       ( header1,  comp, 
                                   header2,  z);

    Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

    Effects: Transfers node "z" from tree1 to tree2 if tree1 does not contain a node that is equivalent to z.

    Returns: True if the node was trasferred, false otherwise.

    Complexity: Logarithmic.

    Throws: If the comparison throws.

  19. template<typename NodePtrCompare> 
       ( header1,  comp, 
                                  header2,  z);

    Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

    Effects: Transfers node "z" from tree1 to tree2.

    Complexity: Logarithmic.

    Throws: If the comparison throws.

  20. template<typename Cloner, typename Disposer> 
       ( source_header,  target_header, 
                         cloner,  disposer);

    Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

    Effects: First empties target tree calling void disposer::operator()(node_ptr) for every node of the tree except the header.

    Then, duplicates the entire tree pointed by "source_header" cloning each source node with node_ptr Cloner::operator()(node_ptr) to obtain the nodes of the target tree. If "cloner" throws, the cloned target nodes are disposed using void disposer(node_ptr ).

    Complexity: Linear to the number of element of the source tree plus the number of elements of tree target tree when calling this function.

    Throws: If cloner functor throws. If this happens target nodes are disposed.

  21. template<typename Disposer> 
       ( header,  disposer) ;
  22. template<typename KeyType, typename KeyNodePtrCompare> 
       
      ( header,  key, 
                   comp);

    Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

    Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

    Complexity: Logarithmic.

    Throws: If "comp" throws.

  23. template<typename KeyType, typename KeyNodePtrCompare> 
       
      ( header,  key, 
                   comp);

    Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

    Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

    Complexity: Logarithmic.

    Throws: If "comp" throws.

  24. template<typename KeyType, typename KeyNodePtrCompare> 
       
      ( header,  key,  comp);

    Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

    Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

    Complexity: Logarithmic.

    Throws: If "comp" throws.

  25. template<typename KeyType, typename KeyNodePtrCompare> 
       
      ( header,  key, 
                   comp);

    Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

    Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

    Complexity: Logarithmic.

    Throws: If "comp" throws.

  26. template<typename KeyType, typename KeyNodePtrCompare> 
       
      ( eader,  lower_key, 
                     upper_key,  comp, 
                     left_closed,  right_closed);

    Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

    Effects: Returns an a pair with the following criteria:

    first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

    second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

    Complexity: Logarithmic.

    Throws: If "comp" throws.

    Note: This function can be more efficient than calling upper_bound and lower_bound for lower_key and upper_key.

    Note: Experimental function, the interface might change.

  27. template<typename KeyType, typename KeyNodePtrCompare> 
       
      ( header,  key,  comp);

    Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

    Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

    Complexity: Logarithmic.

    Throws: If "comp" throws.

  28. template<typename NodePtrCompare> 
       
      ( h,  new_node,  comp);

    Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

    Effects: Inserts new_node into the tree before the upper bound according to "comp".

    Complexity: Average complexity for insert element is at most logarithmic.

    Throws: If "comp" throws.

  29. template<typename NodePtrCompare> 
       
      ( h,  new_node,  comp);

    Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

    Effects: Inserts new_node into the tree before the lower bound according to "comp".

    Complexity: Average complexity for insert element is at most logarithmic.

    Throws: If "comp" throws.

  30. template<typename NodePtrCompare> 
       
      ( header,  hint,  new_node, 
                    comp);

    Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.

    Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).

    Complexity: Logarithmic in general, but it is amortized constant time if new_node is inserted immediately before "hint".

    Throws: If "comp" throws.

  31.  
    ( header,  pos,  new_node) ;

    Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

    Effects: Inserts new_node into the tree before "pos".

    Complexity: Constant-time.

    Throws: Nothing.

    Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken.

  32.  ( header,  new_node) ;

    Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

    Effects: Inserts new_node into the tree before "pos".

    Complexity: Constant-time.

    Throws: Nothing.

    Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before".

  33.  ( header,  new_node) ;

    Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

    Effects: Inserts new_node into the tree before "pos".

    Complexity: Constant-time.

    Throws: Nothing.

    Note: If "new_node" is greater than the lowest inserted key tree invariants are broken. This function is slightly faster than using "insert_before".

  34. template<typename KeyType, typename KeyNodePtrCompare> 
       
      ( header,  key, 
                           comp, 
                           commit_data);
  35. template<typename KeyType, typename KeyNodePtrCompare> 
       
      ( header,  hint, 
                           key,  comp, 
                           commit_data);
  36.  ( header,  new_value, 
                                      commit_data) ;
  37.  ( p) ;

    Requires: p is a node of a tree.

    Effects: Returns true if p is the header of the tree.

    Complexity: Constant.

    Throws: Nothing.


PrevUpHomeNext