X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=libstdc%2B%2B-v3%2Fdoc%2Fhtml%2Fext%2Fpb_ds%2Ftree.html;fp=libstdc%2B%2B-v3%2Fdoc%2Fhtml%2Fext%2Fpb_ds%2Ftree.html;h=3202a6e9f95e9e33ff4a6fa414a4dfab33819056;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git diff --git a/libstdc++-v3/doc/html/ext/pb_ds/tree.html b/libstdc++-v3/doc/html/ext/pb_ds/tree.html new file mode 100644 index 00000000..3202a6e9 --- /dev/null +++ b/libstdc++-v3/doc/html/ext/pb_ds/tree.html @@ -0,0 +1,516 @@ + + + +
+ + +A concrete basic tree-based associative container.
+ +Defined in: assoc_container.hpp
+ +Parameter | + +Description | + +Default Value | +
+ +typename Key ++ |
+
+
+ Key type. + |
+
+ - | +
+ +typename Mapped ++ |
+
+
+ Mapped type. + |
+
+ - | +
+ +class Cmp_Fn ++ |
+
+
+ Comparison functor. + |
+
+
+ +std::less<Key> ++ |
+
+ +class Tag ++ |
+
+
+ Mapped-structure tag. + |
+
+ rb_tree_tag | +
+ +template< + typename Const_Node_Iterator, + typename Node_Iterator, + class Cmp_Fn_, + typename Allocator_> +class Node_Update ++ |
+
+
+ Node updater type. + +Design::Tree-Based + Containers::Node Invariants explains this + concept. + |
+
+ null_tree_node_update | +
+ +class Allocator ++ |
+
+
+ Allocator type. + |
+
+
+ +std::allocator<char> ++ |
+
Class | + +Derivation Type | +
+ +basic_tree ++ |
+
+
+ public + |
+
Type | + +Definition | + +Description | +
+ +cmp_fn ++ |
+
+
+ +Cmp_Fn ++ |
+
+
+ Comparison functor type. + |
+
Type | + +Definition | + +Description | +
+ +const_node_iterator ++ |
+
+
+ +const_node_iterator ++ |
+
+
+ Const node iterator. + |
+
+ +node_iterator ++ |
+
+
+ +node_iterator ++ |
+
+
+ Node iterator. + |
+
Method | + +Description | +
+ + tree + () ++ |
+
+
+ Default constructor. + |
+
+ + tree + (const cmp_fn &r_cmp_fn) ++ |
+
+
+ Constructor taking some policy objects. r_cmp_fn will be copied by the + Cmp_Fn object of the + container object. + |
+
+ +template< + class It> + tree + (It first_it, + It last_it) ++ |
+
+
+ Constructor taking iterators to a range of + value_types. The value_types between first_it and last_it will be inserted into the + container object. + |
+
+ +template< + class It> + tree + (It first_it, + It last_it, + const cmp_fn &r_cmp_fn) ++ |
+
+
+ Constructor taking iterators to a range of value_types + and some policy objects The value_types between + first_it and + last_it will be inserted + into the container object. r_cmp_fn will be copied by the + cmp_fn object of the + container object. + |
+
+
+ tree
+ (const tree &other)
+
+ |
+
+
+ Copy constructor. + |
+
+ +virtual + ~tree + () ++ |
+
+
+ Destructor. + |
+
+ +tree & + operator= + (const tree &other) ++ |
+
+
+ Assignment operator. + |
+
+
+void
+ swap
+ (tree &other)
+
+ |
+
+
+ Swaps content. + |
+
Method | + +Description | +
+ +cmp_fn & + get_cmp_fn + () ++ |
+
+
+ Access to the cmp_fn object. + |
+
+ +const cmp_fn & + get_cmp_fn + () const ++ |
+
+
+ Const access to the cmp_fn object. + |
+
Method | + +Description | +
+ +node_iterator + node_begin + () ++ |
+
+
+ Returns a node_iterator + corresponding to the node at the root of the tree. + |
+
+ +const_node_iterator + node_begin + () const ++ |
+
+
+ Returns a const_node_iterator + corresponding to the node at the root of the tree. + |
+
+ +node_iterator + node_end + () ++ |
+
+
+ Returns a node_iterator + corresponding to a node just after a leaf of the + tree. + |
+
+ +const_node_iterator + node_end + () const ++ |
+
+
+ Returns a const_node_iterator + corresponding to a node just after a leaf of the + tree. + |
+