Boost logo

Boost-Commit :

Subject: [Boost-commit] svn:boost r84977 - in sandbox/tree_node/libs/tree_node/doc: . html html/tree_node html/tree_node/concepts html/tree_node/reference
From: sponage_at_[hidden]
Date: 2013-07-07 14:52:52


Author: expaler
Date: 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013)
New Revision: 84977
URL: http://svn.boost.org/trac/boost/changeset/84977

Log:
Boost.TreeNode: updated documentation to use Quickbook 1.6 features.

Replaced:
   sandbox/tree_node/libs/tree_node/doc/changelog.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_assoc_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_base_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_base_type_generator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_binary_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_copyable_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_descendant_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_full_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_indexable_container.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_indexable_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_movable_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_nary_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_node_type_generator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_non_assoc_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_rvrsible_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concepts.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/index.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/changelog.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/associative_tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/base_tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/base_type_generator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/binary_tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/copyable_tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/full_tree_node_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/indexable_container.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/indexable_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/movable_tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/nary_tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/node_type_generator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/non_assoc_tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/reversible_tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node_desc_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/accumulation_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/advance_binary.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/assoc_cont_derived_body.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/assoc_node_base_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/associative_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/associative_node_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/associative_node_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/at_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/avl_balancer.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_descendant.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_descendant_at_index.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_index_of.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_lower_bound.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_node_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_node_base_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_node_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binary_upper_bound.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binode_assoc_container.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binode_container.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binode_map.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binode_multimap.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binode_multiset.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/binode_set.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/breadth_first_desc_iter.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/breadth_first_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/can_use_fusion.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/can_use_fusion_with_typeof.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/cartesian_sort.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/cartesian_sort_range.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/compare_selector.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/container_derived_body.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/copyable_and_movable.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/count_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/data_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/depth_first_desc_iter.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/depth_first_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/dereference_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/emplace_ctor_fwd_decl.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/emplace_ctor_inline_def.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/emplace_ctor_inline_hdr.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/emplace_ctor_w_alloc_f_dcl.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/emplace_ctor_w_alloc_i_def.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/emplace_ctor_w_alloc_i_hdr.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/get_keys.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/get_properties.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/has_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/height_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/in_order_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/nary_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/nary_node_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/nary_node_base_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/nary_node_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/null_balancer.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/position_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/post_order_desc_iter.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/post_order_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/pre_order_desc_iter.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/pre_order_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/red_black_balancer.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/red_black_flag_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/traversal_state.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/tree_node_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/value_at_key.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_accumulation.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_accumulation_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_accumulation_base_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_accumulation_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_count.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_count_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_count_base_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_count_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_height.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_height_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_height_base_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_height_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_position.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_position_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_position_base_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_position_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_rb_flag.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_rb_flag_base.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_rb_flag_base_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/with_rb_flag_gen.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_accumulation_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_advance_binary.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_assoc_cont_derived_body.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_assoc_node_base_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_associative_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_associative_node_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_associative_node_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_at_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_avl_balancer.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_bin_descendant_at_index.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binary_descendant.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binary_index_of.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binary_lower_bound.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binary_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binary_node_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binary_node_base_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binary_node_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binary_upper_bound.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binode_assoc_container.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binode_container.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binode_map.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binode_multimap.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binode_multiset.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_binode_set.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_breadth_first_desc_iter.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_breadth_first_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_can_use_fusion.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_can_use_fusion_w_typeof.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_cartesian_sort.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_cartesian_sort_range.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_compare_selector.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_container_derived_body.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_copyable_and_movable.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_count_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_data_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_depth_first_desc_iter.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_depth_first_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_dereference_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_empl_ctor_w_allc_f_decl.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_empl_ctor_w_allc_il_def.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_empl_ctor_w_allc_il_hdr.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_emplace_ctor_fwd_decl.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_emplace_ctor_inline_def.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_emplace_ctor_inline_hdr.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_get_keys.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_get_properties.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_has_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_height_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_in_order_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_nary_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_nary_node_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_nary_node_base_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_nary_node_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_null_balancer.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_position_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_post_order_desc_iter.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_post_order_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_pre_order_desc_iter.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_pre_order_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_red_black_balancer.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_red_black_flag_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_traversal_state.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_tree_node_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_value_at_key.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_accum_base_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_accumulation.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_accumulation_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_accumulation_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_count.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_count_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_count_base_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_count_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_height.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_height_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_height_base_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_height_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_position.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_position_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_position_base_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_position_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_rb_flag.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_rb_flag_base.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_rb_flag_base_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_with_rb_flag_gen.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/reference.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/tree_node.qbk (contents, props changed)

Added: sandbox/tree_node/libs/tree_node/doc/changelog.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/changelog.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,186 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section Changelog]
+
+[heading From 0.4 to 0.5]
+
+[itemized_list
+ [Added the __Copyable_Tree_Node__ and __Movable_Tree_Node__ concepts.]
+ [Added the __tree_node_compare_selector__ template.]
+ [Added the __null_balancer__ trait struct.]
+ [Added the __at_key__ intrinsic function object.]
+ [Added the __cartesian_sort__ and __cartesian_sort_range__ algorithms.]
+]
+
+[heading From 0.3 to 0.4]
+
+[itemized_list
+ [
+ Added the __binode_container__, __binode_associative_container__,
+ __binode_set__, __binode_multiset__, __binode_map__, and
+ __binode_multimap__ data structures.
+ ]
+ [Added the __red_black_balancer__ and __avl_balancer__ trait structs.]
+ [
+ Added the __Reversible_Tree_Node__, __Indexable_Container__, and
+ __Indexable_Iterator__ concepts.
+ ]
+ [
+ Refined the [*Type Generator] concept into the __Node_Type_Generator__
+ and __Base_Type_Generator__ concepts.
+ ]
+ [
+ Added the __TREE_NODE_COPYABLE_AND_MOVABLE__,
+ __TREE_NODE_EMPLACEMENT_CTOR_FWD_DECL__,
+ __TREE_NODE_EMPLACEMENT_CTOR_INLINE_HEADER__,
+ __TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF__,
+ __TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_FWD_DECL__,
+ __TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_HEADER__,
+ __TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF__,
+ __TREE_NODE_CAN_USE_FUSION__, and
+ __TREE_NODE_CAN_USE_FUSION_WITH_TYPEOF__ preprocessor macros.
+ ]
+ [
+ Added size type and emplacement constructor and size method expressions
+ to the __Tree_Node__ concept.
+ ]
+ [
+ Added `on_post_*` and `on_post_*_impl` method expressions to the
+ __Base_Tree_Node__ concept.
+ ]
+ [
+ Added iterator range and immutable iterator range types to the
+ __Associative_Tree_Node__ concept.
+ ]
+ [__Tree_Node__ models are now __Movable__.]
+ [
+ __Tree_Node__ models are no longer __Equality_Comparable__ or
+ __Less_Than_Comparable__.
+ ]
+ [
+ Added the __tree_node_with_accumulation__ adaptor class template,
+ the corresponding __Base_Tree_Node__ model
+ __tree_node_with_accumulation_base__, the corresponding
+ __Node_Type_Generator__ model __tree_node_with_accumulation_gen__,
+ and the corresponding __Base_Type_Generator__ model
+ __tree_node_with_accumulation_base_gen__.
+ ]
+ [
+ Added the __tree_node_with_count__ adaptor class template, the
+ corresponding __Base_Tree_Node__ model __tree_node_with_count_base__,
+ the corresponding __Node_Type_Generator__ model
+ __tree_node_with_count_gen__, and the corresponding
+ __Base_Type_Generator__ model __tree_node_with_count_base_gen__.
+ ]
+ [Renamed `with_depth` to __tree_node_with_height__.]
+ [Renamed `with_depth_base` to __tree_node_with_height_base__.]
+ [Renamed `with_depth_gen` to __tree_node_with_height_gen__.]
+ [
+ Added the __Base_Type_Generator__ models
+ __tree_node_with_count_base_gen__, __tree_node_with_height_base_gen__,
+ __tree_node_with_position_base_gen__, and
+ __tree_node_with_red_black_flag_base_gen__.
+ ]
+ [
+ Added the __advance_binary__, __binary_index_of__,
+ __binary_descendant__, __binary_descendant_at_index__,
+ __binary_upper_bound__, and __binary_lower_bound__ algorithms.
+ ]
+ [
+ Removed `tree_node_equal`, `tree_node_strictly_equal`,
+ `tree_node_lexicographical_compare`, and
+ `tree_node_strict_lexicographical_compare` algorithms.
+ ]
+]
+
+[heading From 0.2 to 0.3]
+
+[itemized_list
+ [
+ Added the __Associative_Tree_Node__, __Non_Associative_Tree_Node__,
+ __Binary_Tree_Node__, __N_ary_Tree_Node__, and [*Type Generator]
+ concepts.
+ ]
+ [
+ Added the __binary_node__ data structure, the corresponding
+ __Base_Tree_Node__ model __binary_node_base__, and the corresponding
+ [*Type Generator] model __binary_node_gen__.
+ ]
+ [
+ Renamed `raw_node` to __nary_node__; added the corresponding
+ __Base_Tree_Node__ model __nary_node_base__ and the corresponding
+ [*Type Generator] model __nary_node_gen__.
+ ]
+ [
+ Renamed `raw_associative_node` to __associative_node__; added the
+ corresponding __Base_Tree_Node__ model __associative_node_base__ and
+ the corresponding [*Type Generator] model __associative_node_gen__.
+ ]
+ [
+ Added the __Base_Tree_Node__ model `with_depth_base` and the
+ corresponding [*Type Generator] model `with_depth_gen`.
+ ]
+ [
+ Added __tree_node_with_position__ adaptor class template,
+ the corresponding __Base_Tree_Node__ model
+ __tree_node_with_position_base__, and the corresponding
+ [*Type Generator] model __tree_node_with_position_gen__.
+ ]
+ [
+ Added the __tree_node_with_red_black_flag__ adaptor class template,
+ the corresponding __Base_Tree_Node__ model
+ __tree_node_with_red_black_flag_base__, and the corresponding
+ [*Type Generator] model __tree_node_with_red_black_flag_gen__.
+ ]
+ [
+ Added the __breadth_first_descendant_iterator__,
+ __pre_order_descendant_iterator__, __post_order_descendant_iterator__,
+ __in_order_iterator__, and __depth_first_descendant_iterator__ adaptor
+ class templates.
+ ]
+ [
+ Added the __dereference_iterator__, `tree_node_equal`,
+ `tree_node_strictly_equal`, `tree_node_lexicographical_compare`, and
+ `tree_node_strict_lexicographical_compare` algorithms.
+ ]
+ [
+ Removed the [*Factory-Constructible Tree Node] and
+ [*Cloneable Tree Node] concepts.
+ ]
+ [Removed the `tree_node_factory` facade.]
+ [Removed the `shared_tree_node_base` `struct` template.]
+ [Removed the `simple_node` and `simple_associative_node` data structures.]
+ [
+ Removed the `with_child_range_access` adaptor class template; the
+ __Tree_Node__ concept now requires child range access for all models.
+ ]
+]
+
+[heading From 0.1 to 0.2]
+
+[itemized_list
+ [
+ Added the __Base_Tree_Node__, [*Factory-Constructible Tree Node], and
+ [*Cloneable Tree Node] concepts.
+ ]
+ [Added `tree_node_factory` facade.]
+ [
+ Added the __tree_node_base__ and `shared_tree_node_base` `struct`
+ templates; each __Tree_Node__ model that is not a __Base_Tree_Node__
+ now inherits from a corresponding __Base_Tree_Node__ which, in turn,
+ inherits from one of these two types.
+ ]
+ [
+ Added the `with_child_range_access` and `with_depth` adaptor class
+ templates.
+ ]
+]
+
+[endsect] [/ Changelog]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_assoc_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_assoc_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,337 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:associative_tree_node Associative Tree Node]
+
+[section Description]
+Models of this concept provide key-based access to their child nodes.
+[endsect]
+
+[section Refinement of]
+__Tree_Node__
+[endsect]
+
+[variablelist Notation
+ [[`Node`][A type that models the [*Associative Tree Node] concept.]]
+ [[`node`][An object of type `Node&`.]]
+ [[`const_node`][An object of type `Node const&`.]]
+ [[`source`][An object of type `Node&&`.]]
+ [[`key`][An object of type `Node::traits::key_type const&`.]]
+ [[`Args`][The type of `args`.]]
+ [
+ [`args`]
+ [
+ Arguments to be forwarded to the appropriate
+ `Node::traits::data_type` constructor.
+ ]
+ ]
+]
+
+[section:types Associated Types]
+Three new types are introduced.
+
+[table
+ [[Name][Expression][Description][Requirements]]
+ [
+ [Key type]
+ [`Node::traits::key_type`]
+ [The type of a key that a tree node will associate with a child node.]
+ []
+ ]
+ [
+ [Iterator range type]
+ [`Node::traits::iterator_range`]
+ [The type of a range of child nodes and their associated keys.]
+ [It must model a __Boost_Range__ concept.]
+ ]
+ [
+ [Immutable iterator range type]
+ [`Node::traits::const_iterator_range`]
+ [
+ The type of an immutable view of a range of child nodes and their
+ associated keys.
+ ]
+ [It must model a __Boost_Range__ concept.]
+ ]
+]
+
+In addition, the requirements for the iterator types are strengthened:
+
+[itemized_list
+ [The value type of `Node::iterator` must define a `first_type` type.]
+ [
+ The value type of `Node::iterator` must define a `first` member
+ variable of type `first_type`.
+ ]
+ [
+ Given an object `itr` of type `Node::iterator`, `itr->first` must be
+ convertible to `Node::traits::key_type const&`.
+ ]
+ [The value type of `Node::iterator` must define a `second_type` type.]
+ [
+ The value type of `Node::iterator` must define a `second` member
+ variable of type `second_type`.
+ ]
+ [
+ Given an object `itr` of type `Node::iterator`,
+ [^_dereference_iterator_(itr)] must be convertible to `Node&`.
+ ]
+ [The value type of `Node::const_iterator` must define a `first_type` type.]
+ [
+ The value type of `Node::const_iterator` must define a `first` member
+ variable of type `first_type`.
+ ]
+ [
+ Given an object `itr` of type `Node::const_iterator`, `itr->first` must
+ be convertible to `Node::traits::key_type const&`.
+ ]
+ [
+ The value type of `Node::const_iterator` must define a `second_type`
+ type.
+ ]
+ [
+ The value type of `Node::const_iterator` must define a `second` member
+ variable of type `second_type`.
+ ]
+ [
+ Given an object `itr` of type `Node::const_iterator`,
+ [^_dereference_iterator_(itr)] must be convertible to `Node const&`.
+ ]
+]
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Tree_Node__ concept, the
+following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type requirements]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Child creation]
+ [``
+ node.emplace(
+ key
+ , _boost_forward_<Args>(args)...
+ );
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Returns an iterator pointing to the child that `node` associates
+ with `key` if `node` allows only one such association to exist;
+ otherwise, creates a tree node to be associated with the specified
+ key in the range of children of the invoking node, then returns an
+ iterator pointing to the created node, which will initialize its
+ data with the specified arguments.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child copy creation]
+ [``
+ node.insert(key, const_node)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Returns an iterator pointing to the child that `node` associates
+ with `key` if `node` allows only one such association to exist;
+ otherwise, creates a deep copy of `const_node` to be associated
+ with the specified key in the range of children of the invoking
+ node, then returns an iterator pointing to the created node.
+ ]
+ [
+ The data type must model the __Copy_Constructible__ and __Movable__
+ concepts.
+ ]
+ [Linear with respect to the number of descendants of `const_node`]
+ ]
+ [
+ [Child move insertion]
+ [``
+ node.insert(key, source)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Returns an iterator pointing to the child that `node` associates
+ with `key` if `node` allows only one such association to exist;
+ otherwise, move-constructs a copy of `source` to be associated
+ with the specified key in the range of children of the invoking
+ node, then returns an iterator pointing to the created node.
+ ]
+ [The data type must model the __Movable__ concept.]
+ [Linear with respect to the number of children of `source`]
+ ]
+ [
+ [Child read-only search]
+ [``
+ const_node.find(key)
+ ``]
+ [``
+ Node::const_iterator
+ ``]
+ [
+ Returns an iterator pointing to a child node associated with the
+ specified key, or `const_node.end()` if no such child exists.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child search]
+ [``
+ node.find(key)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Returns an iterator pointing to a child node associated with the
+ specified key, or `node.end()` if no such child exists.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child read-only search lower bound]
+ [``
+ const_node.lower_bound(key)
+ ``]
+ [``
+ Node::const_iterator
+ ``]
+ [
+ Returns an iterator pointing to a child node associated with the
+ lowest key not less than the specified key, or `const_node.end()`
+ if no such child exists.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child search lower bound]
+ [``
+ node.lower_bound(key)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Returns an iterator pointing to a child node associated with the
+ lowest key not less than the specified key, or `node.end()` if no
+ such child exists.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child read-only search upper bound]
+ [``
+ const_node.upper_bound(key)
+ ``]
+ [``
+ Node::const_iterator
+ ``]
+ [
+ Returns an iterator pointing to a child node associated with the
+ lowest key that is strictly greater than the specified key, or
+ `const_node.end()` if no such child exists.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child search upper bound]
+ [``
+ node.upper_bound(key)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Returns an iterator pointing to a child node associated with the
+ lowest key that is strictly greater than the specified key, or
+ `node.end()` if no such child exists.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child read-only search range]
+ [``
+ const_node.equal_range(key)
+ ``]
+ [``
+ Node::traits::const_iterator_range
+ ``]
+ [
+ Returns a __Boost_Range__ of all child nodes associated with the
+ specified key. The child nodes in the range returned cannot be
+ modified. If no such children exist, then the range will be empty.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child search range]
+ [``
+ node.equal_range(key)
+ ``]
+ [``
+ Node::traits::iterator_range
+ ``]
+ [
+ Returns a __Boost_Range__ of all child nodes associated with the
+ specified key. The child nodes in the range returned can be
+ modified. If no such children exist, then the range will be empty.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Remove children]
+ [``
+ node.erase(key)
+ ``]
+ [``
+ Node::size_type
+ ``]
+ [
+ Removes all child nodes associated with the specified key from the
+ tree node. Returns the number of children removed.
+ ]
+ []
+ [
+ Linear with respect to the number of children and their descendants
+ in the range to be removed, plus logarithmic
+ ]
+ ]
+]
+[endsect]
+
+[section Models]
+[itemized_list
+ [__associative_node__]
+ [__associative_node_base__]
+]
+[endsect]
+
+[endsect] [/ Associative Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_base_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_base_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,379 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:base_tree_node Base Tree Node]
+
+[section Description]
+Models of this concept allow the __Tree_Node__ adaptor types to parameterically
+inherit their functionality for greater reuse.
+
+In practice, each [*Base Tree Node] model must do the following:
+
+[itemized_list
+ [
+ Inherit from either __tree_node_base__ or the return type of a
+ __Base_Type_Generator__.
+ ]
+ [Take in the derived type and the data type as template parameters.]
+ [
+ Also take in the key type if the derived type is (possibly) an
+ __Associative_Tree_Node__ model.
+ ]
+ [
+ Declare a template instantiation of __tree_node_base__ with the derived
+ type as a `friend struct` if it overrides any of __tree_node_base__
+ implementation methods.
+ ]
+]
+
+[endsect]
+
+[section Refinement of]
+__Tree_Node__
+[endsect]
+
+[variablelist Notation
+ [[`Base`][A type that models the [*Base Tree Node] concept.]]
+ [[`base`][An object of type `Base&`.]]
+ [[`const_base`][An object of type `Base const&`.]]
+ [[`Node`][A __Tree_Node__ model that inherits from `Base`.]]
+ [[`copy`][An object of type `Node const&`.]]
+ [[`source`][An object of type `Node&&`.]]
+ [[`alloc`][An object of type `Node::traits::allocator_reference`.]]
+ [[`itr`][An object of type `Node::iterator`.]]
+ [[`BIC`][A type that models the __Boolean_Integral_Constant__ concept.]]
+ [[`bic`][An object of type `BIC`.]]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Tree_Node__ concept.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Tree_Node__ concept, the
+following expressions must be valid.
+
+[table
+ [[Name][Expression][Return Type][Semantics][__Runtime_Complexity__]]
+ [
+ [Derived access]
+ [`base.get_derived()`]
+ [`Node::pointer`]
+ [Returns a pointer to the same `Node` object.]
+ [Constant]
+ ]
+ [
+ [Derived read-only access]
+ [`const_base.get_derived()`]
+ [`Node::const_pointer`]
+ [Returns a pointer to the same immutable `Node` object.]
+ [Constant]
+ ]
+]
+
+Also, the following expressions must be valid (unless the `Node` type does
+/not/ define the operation within which the expression can be invoked).
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type requirements]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Derived copy constructor]
+ [`Base(copy)`]
+ []
+ [Constructs a deep copy of the specified node.]
+ [
+ The initializer list of the `Node` copy constructor must be able
+ to call this constructor.
+ ]
+ [Linear with respect to the number of descendants]
+ ]
+ [
+ [Derived copy constructor with allocator]
+ [`Base(copy, alloc)`]
+ []
+ [
+ Constructs a deep copy of the specified node. The new node will
+ use the specified allocator (if the allocator reference type is
+ mutable) or a copy of it (if the allocator reference type is to
+ `const`) to construct its own parent node or its own child nodes
+ if and when invoking its respective creation methods.
+ ]
+ [
+ The initializer list of the `Node` copy constructor with allocator
+ must be able to call this constructor.
+ ]
+ [Linear with respect to the number of descendants]
+ ]
+ [
+ [Derived move constructor]
+ [`Base(source)`]
+ []
+ [Transfers the contents of the specified node to this one.]
+ [
+ The initializer list of the `Node` move constructor must be able
+ to call this constructor.
+ ]
+ [Linear with respect to the number of children]
+ ]
+ [
+ [Derived move constructor with allocator]
+ [`Base(source, alloc)`]
+ []
+ [
+ Transfers the contents of the specified node to this one. The new
+ node will use the specified allocator (if the allocator reference
+ type is mutable) or a copy of it (if the allocator reference type
+ is to `const`) to construct its own parent node or its own child
+ nodes if and when invoking its respective creation methods.
+ ]
+ [
+ The initializer list of the `Node` move constructor with allocator
+ must be able to call this constructor.
+ ]
+ [Linear with respect to the number of children]
+ ]
+ [
+ [Base descendant cloning]
+ [`base.clone_descendants(copy)`]
+ [`void`]
+ [
+ Structurally modifies the invoking node so that it is a deep copy
+ of the specified node.
+ ]
+ [
+ The body of the `Node` copy constructor must be able to call this
+ method.
+ ]
+ [Linear with respect to the number of descendants]
+ ]
+ [
+ [Base descendant movement]
+ [`base.move_descendants(source)`]
+ [`void`]
+ [
+ Structurally modifies the invoking node so that it stores the
+ contents of the specified node.
+ ]
+ [
+ The body of the `Node` move constructor must be able to call this
+ method.
+ ]
+ [Linear with respect to the number of children]
+ ]
+ [
+ [Base copy assignment]
+ [`base.copy_assign(copy)`]
+ [`void`]
+ [
+ Structurally modifies the invoking node so that it is a deep copy
+ of the specified node.
+ ]
+ [
+ The body of the `Node` copy assignment operator must be able
+ to call this method.
+ ]
+ [Linear with respect to the number of descendants]
+ ]
+ [
+ [Base move assignment]
+ [`base.move_assign(source)`]
+ [`void`]
+ [
+ Structurally modifies the invoking node so that it stores the
+ contents of the specified node.
+ ]
+ [
+ The body of the `Node` move assignment operator must be able
+ to call this method.
+ ]
+ [Linear with respect to the number of children]
+ ]
+ [
+ [Assignment notification]
+ [`base.on_post_assign()`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by `Base` copy
+ or move assignment. In practice, propagates `Base`-specific values
+ affected by the assignment up the tree node's chain of ancestors.
+ ]
+ [
+ The body of the `Node` copy or move assignment operator must be
+ able to call this method.
+ ]
+ [Linear with respect to the number of ancestors]
+ ]
+ [
+ [Key-value modified notification]
+ [`base.on_post_modify_value(Key())`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that modify the value that the tree node associates with the
+ specified key.
+ ]
+ [
+ The body of the `Node` key-value modification function must be able
+ to call this method, and [^_result_of__has_key_<Node,Key>] must be
+ equivalent to __mpl_true__.
+ ]
+ [Linear with respect to the number of ancestors]
+ ]
+ [
+ [Key-value propagated notification]
+ [`base.on_post_propagate_value(Key())`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that propagate the value that the tree node associates with the
+ specified key up the tree node's chain of ancestors.
+ ]
+ [
+ [^_result_of__has_key_<Node,Key>] must be equivalent to
+ __mpl_true__.
+ ]
+ [Linear with respect to the number of ancestors]
+ ]
+ [
+ [Key-value once-propagated notification]
+ [`base.on_post_propagate_value_once(Key())`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that propagate the value that the tree node associates with the
+ specified key up to the tree node's parent.
+ ]
+ [
+ [^_result_of__has_key_<Node,Key>] must be equivalent to
+ __mpl_true__.
+ ]
+ [Constant]
+ ]
+ [
+ [Insertion notification]
+ [`base.on_post_inserted(itr, bic)`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that insert or emplace the invoking node. The specified iterator
+ points to this node.
+ ]
+ [
+ The body of any `Node` insertion or emplacement member function
+ must be able to call this method.
+ ]
+ [
+ Amortized constant if `BIC::value == true`, linear with respect to
+ the number of siblings otherwise
+ ]
+ ]
+ [
+ [Range insertion notification]
+ [`base.on_post_insert(itr, itr_end, bic)`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that insert or emplace the nodes in the specified range.
+ ]
+ [
+ The body of any `Node` insertion or emplacement member function
+ must be able to call this method.
+ ]
+ [
+ Amortized constant if `BIC::value == true`, linear with respect to
+ the number of siblings otherwise
+ ]
+ ]
+ [
+ [Erasure notification]
+ [`base.on_post_erase(bic)`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that remove the specified children and their descendants from a
+ node.
+ ]
+ [
+ The body of any `Node` erasure member function must be able to call
+ this method.
+ ]
+ [
+ Linear with respect to the number of children plus the number of
+ ancestors
+ ]
+ ]
+ [
+ [Clear notification]
+ [`base.on_post_clear()`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that remove all descendants from a node.
+ ]
+ [
+ The body of the `Node::clear()` member function must be able
+ to call this method.
+ ]
+ [
+ Linear with respect to the number of children removed plus the
+ number of ancestors
+ ]
+ ]
+ [
+ [Left rotation notification]
+ [`base.on_post_rotate_left()`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that rotate a node to the left.
+ ]
+ [
+ The body of the `Node::rotate_left()` member function must be able
+ to call this method.
+ ]
+ [Linear with respect to the number of ancestors]
+ ]
+ [
+ [Right rotation notification]
+ [`base.on_post_rotate_right()`]
+ [`void`]
+ [
+ Updates any `Node`-specific information invalidated by operations
+ that rotate a node to the right.
+ ]
+ [
+ The body of the `Node::rotate_right()` member function must be able
+ to call this method.
+ ]
+ [Linear with respect to the number of ancestors]
+ ]
+]
+[endsect] [/ Valid Expressions and Semantics]
+
+[section Models]
+[itemized_list
+ [__binary_node_base__]
+ [__nary_node_base__]
+ [__associative_node_base__]
+ [__tree_node_with_accumulation_base__]
+ [__tree_node_with_count_base__]
+ [__tree_node_with_height_base__]
+ [__tree_node_with_position_base__]
+ [__tree_node_with_red_black_flag_base__]
+]
+[endsect]
+
+[endsect] [/ Base Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_base_type_generator.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_base_type_generator.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,75 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:base_type_generator Base Type Generator]
+
+[section Description]
+A [*Base Type Generator] is a __Metafunction_Class__ that returns a
+__Base_Tree_Node__ from which __Tree_Node__ adaptor types can inherit the
+necessary functionality.
+[endsect]
+
+[variablelist Notation
+ [
+ [`Generator`]
+ [A type that models the [*Base Type Generator] concept.]
+ ]
+ [
+ [`Derived`]
+ [
+ The most descendant type that will inherit from the return type of
+ `Generator`.
+ ]
+ ]
+ [
+ [`Key`]
+ [The key type of the __Associative_Tree_Node__ to be returned.]
+ ]
+ [
+ [`Data`]
+ [The data type of the __Tree_Node__ to be returned.]
+ ]
+]
+
+[section:expressions Valid Expressions and Semantics]
+[table
+ [[Name][Expression][Return Type]]
+ [
+ [Non-associative invocation]
+ [[^_mpl_apply_wrap2_<Generator,Derived,Data>::type]]
+ [
+ A __Non_Associative_Tree_Node__ model whose `traits::data_type` is
+ the same as `Data`.
+ ]
+ ]
+ [
+ [Associative invocation]
+ [[^_mpl_apply_wrap3_<Generator,Derived,Key,Data>::type]]
+ [
+ An __Associative_Tree_Node__ model whose `traits::key_type` is the
+ same as `Key` and whose `traits::data_type` is the same as `Data`.
+ ]
+ ]
+]
+[endsect]
+
+[section Models]
+[itemized_list
+ [__binary_node_base_gen__]
+ [__nary_node_base_gen__]
+ [__associative_node_base_gen__]
+ [__tree_node_with_accumulation_base_gen__]
+ [__tree_node_with_count_base_gen__]
+ [__tree_node_with_height_base_gen__]
+ [__tree_node_with_position_base_gen__]
+ [__tree_node_with_red_black_flag_base_gen__]
+]
+[endsect]
+
+[endsect] [/ Base Type Generator]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_binary_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_binary_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,315 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:binary_tree_node Binary Tree Node]
+
+[section Description]
+Models of this concept store at most two child nodes: left and right. The
+operations that this concept defines include access to these children and
+rotations that use the appropriate child as a pivot node.
+[endsect]
+
+[section Refinement of]
+[itemized_list
+ [__Non_Associative_Tree_Node__]
+ [__Reversible_Tree_Node__]
+]
+[endsect]
+
+[variablelist Notation
+ [[`Node`][A type that models the [*Binary Tree Node] concept.]]
+ [[`node`][An object of type `Node&`.]]
+ [[`const_node`][An object of type `Node const&`.]]
+ [[`rvalue_node`][An object of type `Node&&`.]]
+ [[`Args`][The type of `args`.]]
+ [
+ [`args`]
+ [
+ Arguments to be forwarded to the appropriate
+ `Node::traits::data_type` constructor.
+ ]
+ ]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Non_Associative_Tree_Node__
+and __Reversible_Tree_Node__ concepts.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Non_Associative_Tree_Node__
+and __Reversible_Tree_Node__ concepts, the following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type requirements]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Parent-of-left creation]
+ [``
+ node.emplace_parent_of_left(
+ _boost_forward_<Args>(args)...
+ )
+ ``]
+ [``
+ Node::pointer
+ ``]
+ [
+ Creates and returns a tree node to be stored as the parent of the
+ invoking node. The node returned will initialize its data with the
+ specified arguments. The invoking node will become the left child
+ of the new node.
+
+ If a parent existed previously, that node shall become the parent
+ of the new node, and the new node shall take the place of the
+ invoking node.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Parent-of-right creation]
+ [``
+ node.emplace_parent_of_right(
+ _boost_forward_<Args>(args)...
+ )
+ ``]
+ [``
+ Node::pointer
+ ``]
+ [
+ Creates and returns a tree node to be stored as the parent of the
+ invoking node. The node returned will initialize its data with the
+ specified arguments. The invoking node will become the right child
+ of the new node.
+
+ If a parent existed previously, that node shall become the parent
+ of the new node, and the new node shall take the place of the
+ invoking node.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Left child creation]
+ [``
+ node.emplace_left(
+ _boost_forward_<Args>(args)...
+ )
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Creates and returns a tree node to be stored as the left child of
+ the invoking node. The node returned will initialize its data with
+ the specified arguments.
+
+ If a left child existed previously, that node shall become the left
+ child of the new node.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Left child copy creation]
+ [``
+ node.insert_left(const_node)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Creates and returns a deep copy of `const_node` to be stored as the
+ left child of the invoking node.
+
+ If a left child existed previously, that node shall become the
+ left-most descendant of the new node, or the first node encountered
+ during a forward in-order traversal of the new node's descendants.
+ ]
+ [
+ The data type must model the __Copy_Constructible__ and __Movable__
+ concepts.
+ ]
+ [Linear with respect to the number of descendants of `const_node`]
+ ]
+ [
+ [Right child creation]
+ [``
+ node.emplace_right(
+ _boost_forward_<Args>(args)...
+ )
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Creates and returns a tree node to be stored as the right child of
+ the invoking node. The node returned will initialize its data with
+ the specified arguments.
+
+ If a right child existed previously, that node shall become the
+ right child of the new node.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Right child copy creation]
+ [``
+ node.insert_right(const_node)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Creates and returns a deep copy of `const_node` to be stored as the
+ right child of the invoking node.
+
+ If a right child existed previously, that node shall become the
+ right-most descendant of the new node, or the last node encountered
+ during a forward in-order traversal of the new node's descendants.
+ ]
+ [
+ The data type must model the __Copy_Constructible__ and __Movable__
+ concepts.
+ ]
+ [Linear with respect to the number of descendants of `const_node`]
+ ]
+ [
+ [Left child read-only access]
+ [``
+ const_node.get_left_child_ptr()
+ ``]
+ [``
+ Node::const_pointer
+ ``]
+ [
+ Returns the left child of the tree node, or a null pointer if no
+ such tree node exists.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Left child access]
+ [``
+ node.get_left_child_ptr()
+ ``]
+ [``
+ Node::pointer
+ ``]
+ [
+ Returns the left child of the tree node, or a null pointer if no
+ such tree node exists.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Right child read-only access]
+ [``
+ const_node.get_right_child_ptr()
+ ``]
+ [``
+ Node::const_pointer
+ ``]
+ [
+ Returns the right child of the tree node, or a null pointer if no
+ such tree node exists.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Right child access]
+ [``
+ node.get_right_child_ptr()
+ ``]
+ [``
+ Node::pointer
+ ``]
+ [
+ Returns the right child of the tree node, or a null pointer if no
+ such tree node exists.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Rotate left]
+ [``
+ node.rotate_left()
+ ``]
+ [``
+ Node::pointer
+ ``]
+ [
+ Rotates the tree node in its hierarchy so that its right child, the
+ pivot node, becomes its parent. The left child of the pivot node
+ becomes the right child of the tree node. Returns the pivot node.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Rotate right]
+ [``
+ node.rotate_right()
+ ``]
+ [``
+ Node::pointer
+ ``]
+ [
+ Rotates the tree node in its hierarchy so that its left child, the
+ pivot node, becomes its parent. The right child of the pivot node
+ becomes the left child of the tree node. Returns the pivot node.
+ ]
+ []
+ [Amortized constant]
+ ]
+ [
+ [Remove left child]
+ [``
+ node.erase_left()
+ ``]
+ [``
+ void
+ ``]
+ [Removes the left child from the tree node.]
+ []
+ [Linear with respect to the number of descendants of the left child]
+ ]
+ [
+ [Remove right child]
+ [``
+ node.erase_right()
+ ``]
+ [`void
+ ``]
+ [Removes the right child from the tree node.]
+ []
+ [Linear with respect to the number of descendants of the right child]
+ ]
+]
+[endsect]
+
+[section Models]
+[itemized_list
+ [__binary_node__]
+ [__binary_node_base__]
+]
+[endsect]
+
+[endsect] [/ Binary Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_copyable_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_copyable_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,134 @@
+[/=============================================================================
+ Copyright (C) 2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:copyable_tree_node Copyable Tree Node]
+
+[section Description]
+Models of this concept are meant for external usage by applications or by other
+data structures.
+
+In practice, each [*Copyable Tree Node] model must do the following:
+
+[itemized_list
+ [Inherit from the corresponding __Base_Tree_Node__ model.]
+ [Take in the data type as template parameters.]
+ [
+ Also take in the key type if (possibly) modeling the
+ __Associative_Tree_Node__ concept.
+ ]
+ [
+ Use the __TREE_NODE_COPYABLE_AND_MOVABLE__,
+ __TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF__, and
+ __TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF__ macros to support
+ C++03 compilers.
+ ]
+]
+
+[endsect]
+
+[section Refinement of]
+[itemized_list
+ [__Tree_Node__]
+ [__Copy_Constructible__]
+]
+[endsect]
+
+[variablelist Notation
+ [[`Node`][A type that models the [*Copyable Tree Node] concept.]]
+ [[`node`][An object of type `Node&`.]]
+ [[`const_node`][An object of type `Node const&`.]]
+ [[`alloc`][An object of type `Node::traits::allocator_reference`.]]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Tree_Node__ and
+__Copy_Constructible__ concepts.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Tree_Node__ and
+__Copy_Constructible__ concepts, the following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type requirements]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Copy constructor]
+ [``
+ Node(const_node)
+ ``]
+ []
+ [Constructs a deep copy of the specified node.]
+ [
+ The data type must be __Copy_Constructible__, the
+ __container_allocator_traits__ static method
+ `select_on_container_copy_construction` must be callable when
+ passed in the allocator of the specified node, and the allocator
+ reference type must be `Node::traits::allocator const&`.
+ ]
+ []
+ ]
+ [
+ [Copy constructor with allocator]
+ [``
+ Node(
+ boost::container::allocator_arg
+ , alloc
+ , const_node
+ )
+ ``]
+ []
+ [
+ Constructs a deep copy of the specified node. The new node will
+ use the specified allocator (if the allocator reference type is
+ mutable) or a copy of it (if the allocator reference type is to
+ `const`) to construct its own parent node or its own child nodes
+ if and when invoking its respective creation methods.
+ ]
+ [The data type must be __Copy_Constructible__.]
+ []
+ ]
+]
+[endsect] [/ Valid Expressions and Semantics]
+
+[section Models]
+[itemized_list
+ [__binary_node__ if `T` is __Copy_Constructible__]
+ [__nary_node__ if `T` is __Copy_Constructible__]
+ [__associative_node__ if `Data` is __Copy_Constructible__]
+ [
+ __tree_node_with_accumulation__ if `BaseGenerator` returns a [*Copyable
+ Tree Node] model
+ ]
+ [
+ __tree_node_with_count__ if `BaseGenerator` returns a [*Copyable Tree
+ Node] model
+ ]
+ [
+ __tree_node_with_height__ if `BaseGenerator` returns a [*Copyable Tree
+ Node] model
+ ]
+ [
+ __tree_node_with_position__ if `BaseGenerator` returns a [*Copyable
+ Tree Node] model
+ ]
+ [
+ __tree_node_with_red_black_flag__ if `BaseGenerator` returns a
+ [*Copyable Tree Node] model
+ ]
+]
+[endsect]
+
+[endsect] [/ Copyable Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_descendant_iterator.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_descendant_iterator.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,85 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:tree_node_desc_iterator Tree Node Descendant Iterator]
+
+[section Description]
+This concept may seem redundant at first, especially when iterating through
+__Non_Associative_Tree_Node__ objects; however, for __Associative_Tree_Node__
+objects, models of this concept provide the sole means of accessing the key
+associated with each node being traversed. (Root nodes are not associated with
+keys at the tree node level, so models of this concept do not traverse them.)
+[endsect]
+
+[section Refinement of]
+__Tree_Node_Iterator__
+[endsect]
+
+[variablelist Notation
+ [
+ [`Iterator`]
+ [A type that models the [*Tree Node Descendant Iterator] concept.]
+ ]
+ [
+ [`itr`]
+ [An object of type `Iterator`.]
+ ]
+ [
+ [`Node`]
+ [A type that models the __Tree_Node__ concept.]
+ ]
+ [
+ [`node`]
+ [An object of type `Node&`.]
+ ]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Tree_Node_Iterator__ concept;
+however, the requirements for the value type are strengthened: it must be the
+appropriate iterator type of `Node`.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+None beyond those defined in the __Tree_Node_Iterator__ concept; however, the
+type requirements for the constructors are strengthened, and their semantics
+are clarified.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Type requirements]
+ [Semantics]
+ ]
+ [
+ [Constructor from node]
+ [``
+ Iterator(node)
+ Iterator itr(node)
+ ``]
+ []
+ [
+ Constructs an iterator that will iterate through the descendants of
+ the specified node.
+ ]
+ ]
+]
+[endsect]
+
+[section Models]
+[itemized_list
+ [__breadth_first_descendant_iterator__]
+ [__pre_order_descendant_iterator__]
+ [__post_order_descendant_iterator__]
+ [__depth_first_descendant_iterator__]
+]
+[endsect]
+
+[endsect] [/ Tree Node Descendant Iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_full_iterator.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_full_iterator.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,71 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:full_tree_node_iterator Full Tree Node Iterator]
+
+[section Description]
+This concept specifies the requirement that models traverse the root node as
+well as its descendants.
+[endsect]
+
+[section Refinement of]
+__Tree_Node_Iterator__
+[endsect]
+
+[variablelist Notation
+ [[`Iterator`][A type that models the [*Full Tree Node Iterator] concept.]]
+ [[`itr`][An object of type `Iterator`.]]
+ [[`Node`][The value type of `Iterator`.]]
+ [[`node`][An object of type `Node&`.]]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Tree_Node_Iterator__ concept;
+however, the requirements for the value type are strengthened: it must model
+the __Tree_Node__ concept.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+None beyond those defined in the __Tree_Node_Iterator__ concept; however, the
+type requirements for the constructors are strengthened, and their semantics
+are clarified.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Type requirements]
+ [Semantics]
+ ]
+ [
+ [Constructor from node]
+ [``
+ Iterator(node)
+ Iterator itr(node)
+ ``]
+ []
+ [
+ Constructs an iterator that will iterate through the specified node
+ and its descendants.
+ ]
+ ]
+]
+[endsect]
+
+[section Models]
+[itemized_list
+ [__breadth_first_iterator__]
+ [__pre_order_iterator__]
+ [__post_order_iterator__]
+ [__in_order_iterator__]
+ [__depth_first_iterator__]
+]
+[endsect]
+
+[endsect] [/ Full Tree Node Iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_indexable_container.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_indexable_container.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,75 @@
+[/=============================================================================
+ Copyright (C) 2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:indexable_container Indexable Container]
+
+[section Description]
+An [*Indexable Container] is a __Reversible_Container__ whose iterator type is
+an __Indexable_Iterator__. It provides sub-linear time access to arbitrary
+elements.
+[endsect]
+
+[section Refinement of]
+__Reversible_Container__
+[endsect]
+
+[section:types Associated Types]
+None beyond those defined in __Reversible_Container__. However, the
+requirements for the iterator type are strengthened: it must be an
+__Indexable_Iterator__.
+[endsect]
+
+[variablelist Notation
+ [[`X`][A type that models the [*Indexable Container] concept.]]
+ [[`a`][An object of type `X`.]]
+]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Reversible_Container__ concept,
+the following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type Requirements]
+ [Precondition]
+ [Invariant]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Element access]
+ [`a[n]`]
+ [`reference` if `a` is mutable, `const_reference` otherwise]
+ [Returns the `n`th element from the beginning of the container.]
+ [`n` must be convertible to `size_type`]
+ [`0 < n <= a.size()`]
+ [Equivalent to `*(a.begin() + n)`.]
+ [Sublinear]
+ ]
+]
+[endsect] [/ Valid Expressions and Semantics]
+
+[section Models]
+[itemized_list
+ [
+ __binode_container__ if the value associated with __count_key__ exists
+ for the return type of `NodeGenerator`
+ ]
+ [__binode_associative_container__]
+ [__binode_set__]
+ [__binode_map__]
+ [__binode_multiset__]
+ [__binode_multimap__]
+]
+[endsect]
+
+[endsect] [/ Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_indexable_iterator.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_indexable_iterator.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,163 @@
+[/=============================================================================
+ Copyright (C) 2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:indexable_iterator Indexable Iterator]
+
+[section Description]
+An [*Indexable Iterator] is an iterator that provides both increment and
+decrement as well as sublinear-time operators for moving forward and backward
+in arbitrary-sized steps. The runtime complexity requirement is the only
+major difference between an [*Indexable Iterator] and a
+__Random_Access_Iterator__.
+[endsect]
+
+[section Refinement of]
+[itemized_list
+ [__Bidirectional_Iterator__]
+ [__Less_Than_Comparable__]
+]
+[endsect]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Bidirectional_Iterator__ and
+__Less_Than_Comparable__ concepts.
+[endsect]
+
+[variablelist Notation
+ [[`Iterator`][A type that models the [*Indexable Iterator] concept.]]
+ [[`i`, `j`][Objects of type `Iterator`.]]
+ [[`T`][The value type of `Iterator`.]]
+ [[`t`][An object of type `T`.]]
+ [[`Distance`][The distance type of `Iterator`.]]
+ [[`n`][An object of type `Distance`.]]
+]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Bidirectional_Iterator__
+concept, the following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type Requirements]
+ [Precondition]
+ [Postcondition]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Iterator addition assignment]
+ [`i += n`]
+ [`X&`]
+ [
+ If `n > 0`, equivalent to executing `++i` `n` times. If `n < 0`,
+ equivalent to executing `--i` `n` times. If `n == 0`, this is a
+ null operation.
+ ]
+ []
+ [
+ Including `i` itself, there must be `n` dereferenceable or
+ past-the-end iterators following or preceding `i`, depending on
+ whether `n` is positive or negative.
+ ]
+ [`i` is dereferenceable or past-the-end.]
+ [Sublinear]
+ ]
+ [
+ [Iterator addition]
+ [`i + n` or `n + i`]
+ [`X`]
+ [
+ Equivalent to `{ X tmp = i; return tmp += n; }`. The two forms
+ `i + n` and `n + i` are identical.
+ ]
+ []
+ [Same as for `i += n`]
+ [The result is dereferenceable or past-the-end.]
+ [Sublinear]
+ ]
+ [
+ [Iterator subtraction assignment]
+ [`i -= n`]
+ [`X&`]
+ [Equivalent to `i += (-n)`.]
+ []
+ [
+ Including `i` itself, there must be `n` dereferenceable or
+ past-the-end iterators preceding or following `i`, depending on
+ whether `n` is positive or negative.
+ ]
+ [`i` is dereferenceable or past-the-end.]
+ [Sublinear]
+ ]
+ [
+ [Iterator subtraction]
+ [`i - n`]
+ [`X`]
+ [Equivalent to `{ X tmp = i; return tmp -= n; }`.]
+ []
+ [Same as for `i -= n`]
+ [The result is dereferenceable or past-the-end.]
+ [Sublinear]
+ ]
+ [
+ [Difference]
+ [`i - j`]
+ [`Distance`]
+ [Returns a number `n` such that `i == j + n`.]
+ []
+ [
+ Either `i` is reachable from `j` or `j` is reachable from `i`, or
+ both.
+ ]
+ []
+ [Sublinear]
+ ]
+ [
+ [Element operator]
+ [`i[n]`]
+ [Convertible to `T`]
+ [Equivalent to `*(i + n)`.]
+ []
+ [`i + n` exists and is dereferenceable.]
+ []
+ [Sublinear]
+ ]
+ [
+ [Element assignment]
+ [`i[n] = t`]
+ [Convertible to `T`]
+ [Equivalent to `*(i + n)`.]
+ [`X` is mutable.]
+ [`i + n` exists and is dereferenceable.]
+ [`i[n]` is a copy of `t`.]
+ [Sublinear]
+ ]
+]
+
+In addition, the domain of the less-than comparison expression `i < j` is the
+group of iterators that are reachable from each other: that is, either `i` is
+reachable from `j` or `j` is reachable from `i`, or both.
+
+The __Forward_Iterator__ and __Reverse_Iterator__ requirements that the
+increment and decrement operators must exhibit constant time complexity have
+been relaxed; they now need only exhibit linear time complexity with respect
+to the number of descendants in the worst case.
+[endsect]
+
+[section Models]
+[itemized_list
+ [The iterator types of __binode_container__]
+ [The iterator types of __binode_associative_container__]
+]
+[endsect]
+
+[endsect] [/ Tree Node Iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_iterator.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_iterator.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,107 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:tree_node_iterator Tree Node Iterator]
+
+[section Description]
+Tree-traversing iterators at the __Tree_Node__ level must be created
+differently from iterators at the __Container__ level. Furthermore, tree node
+iterators typically store more stateful information than their __Container__
+counterparts; requiring two of them to check for dereferenceability may prove
+somewhat memory-inefficient. This concept provides an alternate means of
+checking for dereferenceability that requires the use of only the active
+iterator.
+[endsect]
+
+[section Refinement of]
+__Forward_Iterator__
+[endsect]
+
+[variablelist Notation
+ [[`Iterator`][A type that models the [*Tree Node Iterator] concept.]]
+ [[`itr`][An object of type `Iterator`.]]
+ [[`Node`][A type that models the __Tree_Node__ concept.]]
+ [[`node`][An object of type `Node&`.]]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Forward_Iterator__ concept.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Forward_Iterator__ concept, the
+following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Default constructor]
+ [``
+ Iterator()
+ Iterator itr
+ ``]
+ []
+ [Constructs a non-dereferenceable (past-the-end) iterator.]
+ [Constant]
+ ]
+ [
+ [Constructor from node]
+ [``
+ Iterator(node)
+ Iterator itr(node)
+ ``]
+ []
+ [Refinement-specific.]
+ [Amortized constant]
+ ]
+ [
+ [Dereferenceability]
+ [``
+ itr
+ ``]
+ [A type that can be used in a boolean context.]
+ [
+ Returns a value convertible to `true` if `itr` is dereferenceable,
+ a value convertible to `false` if it is past-the-end.
+ ]
+ [Constant]
+ ]
+ [
+ [Node dereference]
+ [``
+ _dereference_iterator_(itr)
+ ``]
+ [`Node&` or `Node const&`, depending on the mutability of `itr`.]
+ [
+ Returns a reference to the __Tree_Node__ to which `itr` currently
+ points.
+ ]
+ [Constant]
+ ]
+]
+
+The __Forward_Iterator__ requirement that the increment operators must exhibit
+constant time complexity has been relaxed; they now need only exhibit linear
+time complexity with respect to the number of descendants in the worst case.
+[endsect]
+
+[section Models]
+[itemized_list
+ [All models of the __Full_Tree_Node_Iterator__ concept.]
+ [All models of the __Tree_Node_Descendant_Iterator__ concept.]
+]
+[endsect]
+
+[endsect] [/ Tree Node Iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_movable_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_movable_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,135 @@
+[/=============================================================================
+ Copyright (C) 2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:movable_tree_node Movable Tree Node]
+
+[section Description]
+Models of this concept are meant for external usage by applications or by other
+data structures.
+
+In practice, each [*Movable Tree Node] model must do the following:
+
+[itemized_list
+ [Inherit from the corresponding __Base_Tree_Node__ model.]
+ [Take in the data type as template parameters.]
+ [
+ Also take in the key type if (possibly) modeling the
+ __Associative_Tree_Node__ concept.
+ ]
+ [
+ Use the __TREE_NODE_COPYABLE_AND_MOVABLE__,
+ __TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF__, and
+ __TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF__ macros to support
+ C++03 compilers.
+ ]
+]
+
+[endsect]
+
+[section Refinement of]
+[itemized_list
+ [__Tree_Node__]
+ [__Movable__]
+]
+[endsect]
+
+[variablelist Notation
+ [[`Node`][A type that models the [*Movable Tree Node] concept.]]
+ [[`node`][An object of type `Node&`.]]
+ [[`rvalue_node`][An object of type `Node&&`.]]
+ [[`alloc`][An object of type `Node::traits::allocator_reference`.]]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Tree_Node__ and __Movable__
+concepts.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Tree_Node__ and __Movable__
+concepts, the following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type requirements]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Move constructor]
+ [``
+ Node(rvalue_node)
+ ``]
+ []
+ [Transfers the contents of the specified node to this one.]
+ [
+ The data type must be __Movable__, the
+ __container_allocator_traits__ static method
+ `select_on_container_copy_construction` must be callable when
+ passed in the allocator of the specified node, and the allocator
+ reference type must be `Node::traits::allocator const&`.
+ ]
+ []
+ ]
+ [
+ [Move constructor with allocator]
+ [``
+ Node(
+ boost::container::allocator_arg
+ , alloc
+ , rvalue_node
+ )
+ ``]
+ []
+ [
+ Transfers the contents of the specified node to this one. The
+ new node will use the specified allocator (if the allocator
+ reference type is mutable) or a copy of it (if the allocator
+ reference type is to `const`) to construct its own parent node or
+ its own child nodes if and when invoking its respective creation
+ methods.
+ ]
+ [The data type must be __Movable__.]
+ []
+ ]
+]
+[endsect] [/ Valid Expressions and Semantics]
+
+[section Models]
+[itemized_list
+ [__binary_node__ if `T` is __Movable__]
+ [__nary_node__ if `T` is __Movable__]
+ [__associative_node__ if `Data` is __Movable__]
+ [
+ __tree_node_with_accumulation__ if `BaseGenerator` returns a [*Movable
+ Tree Node] model
+ ]
+ [
+ __tree_node_with_count__ if `BaseGenerator` returns a [*Movable Tree
+ Node] model
+ ]
+ [
+ __tree_node_with_height__ if `BaseGenerator` returns a [*Movable Tree
+ Node] model
+ ]
+ [
+ __tree_node_with_position__ if `BaseGenerator` returns a [*Movable Tree
+ Node] model
+ ]
+ [
+ __tree_node_with_red_black_flag__ if `BaseGenerator` returns a
+ [*Movable Tree Node] model
+ ]
+]
+[endsect]
+
+[endsect] [/ Movable Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_nary_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_nary_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,182 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:nary_tree_node N-ary Tree Node]
+
+[section Description]
+Models of this concept store arbitrary numbers of children and provide simple
+child insertion expressions.
+[endsect]
+
+[section Refinement of]
+__Non_Associative_Tree_Node__
+[endsect]
+
+[variablelist Notation
+ [[`Node`][A type that models the [*N-ary Tree Node] concept.]]
+ [[`dest_node`, `src_node`][Objects of type `Node&`.]]
+ [[`const_node`][An object of type `Node const&`.]]
+ [[`rvalue_node`][An object of type `Node&&`.]]
+ [[`pos`, `itr`, `itr_end`][Objects of type `Node::iterator`.]]
+ [[`Args`][The type of `args`.]]
+ [
+ [`args`]
+ [
+ Arguments to be forwarded to the appropriate
+ `Node::traits::data_type` constructor.
+ ]
+ ]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Non_Associative_Tree_Node__
+concept.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Non_Associative_Tree_Node__
+concept, the following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Requirements]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Child creation]
+ [``
+ dest_node.emplace(
+ _boost_forward_<Args>(args)...
+ )
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Creates and returns a tree node to be stored in the range of
+ children of `dest_node`. The node returned will initialize
+ its data with the specified arguments.
+ ]
+ []
+ [Logarithmic]
+ ]
+ [
+ [Child copy creation]
+ [``
+ dest_node.insert(const_node)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Creates and returns a deep copy of `const_node` to be stored in the
+ range of children of `dest_node`.
+ ]
+ [
+ The data type must model the __Copy_Constructible__ and __Movable__
+ concepts.
+ ]
+ [Linear with respect to the number of descendants of `const_node`]
+ ]
+ [
+ [Child move insertion]
+ [``
+ dest_node.insert(rvalue_node)
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [Stores `rvalue_node` in the range of children of `dest_node`.]
+ [The data type must model the __Movable__ concept.]
+ [Logarithmic]
+ ]
+ [
+ [Splice node]
+ [``
+ dest_node.splice(pos, src_node)
+ ``]
+ [A __Boost_Range__ whose element type is `Node`]
+ [
+ Transfers all child nodes and their descendants from `src_node` to
+ `dest_node`, with `pos` as the insertion point. Returns the range
+ of child nodes inserted.
+ ]
+ [
+ `pos` must be dereferenceable or past-the-end of the range of
+ children of `dest_node`.
+ ]
+ [Linear with respect to the number of children of `src_node`]
+ ]
+ [
+ [Splice single child]
+ [``
+ dest_node.splice(pos, src_node, itr)
+ ``]
+ [A __Boost_Range__ whose element type is `Node`]
+ [
+ Transfers the child node to which `itr` points, along with its
+ descendants, from `src_node` to `dest_node`, with `pos` as the
+ insertion point. Returns a range containing the node inserted.
+ ]
+ [[itemized_list
+ [
+ `pos` must be dereferenceable or past-the-end of the range of
+ children of `dest_node`.
+ ]
+ [`itr` must point to a valid child node of `src_node`.]
+ ]]
+ []
+ ]
+ [
+ [Splice range]
+ [``
+ dest_node.splice(
+ pos
+ , src_node
+ , itr
+ , itr_end
+ )
+ ``]
+ [A __Boost_Range__ whose element type is `Node`]
+ [
+ Transfers all child nodes in the specified sub-range, along with
+ their descendants, from `src_node` to `dest_node`, with `pos` as
+ the insertion point. Returns the range of child nodes inserted.
+ ]
+ [[itemized_list
+ [
+ `pos` must be dereferenceable or past-the-end of the range of
+ children of `dest_node`.
+ ]
+ [
+ `itr` and `itr_end` must refer to a valid sub-range of the
+ range of children of `src_node`.
+ ]
+ [
+ `pos` must point outside the sub-range referred to by `itr` and
+ `itr_end`.
+ ]
+ ]]
+ [Linear with respect to the size of the specified sub-range]
+ ]
+]
+[endsect]
+
+[section Models]
+[itemized_list
+ [__nary_node__]
+ [__nary_node_base__]
+]
+[endsect]
+
+[endsect] [/ N-ary Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_node_type_generator.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_node_type_generator.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,67 @@
+[/=============================================================================
+ Copyright (C) 2011-2012 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:node_type_generator Node Type Generator]
+
+[section Description]
+A [*Node Type Generator] is a __Metafunction_Class__ that returns a
+__Tree_Node__ model of which objects can be instantiated.
+[endsect]
+
+[variablelist Notation
+ [
+ [`Generator`]
+ [A type that models the [*Node Type Generator] concept.]
+ ]
+ [
+ [`Key`]
+ [The key type of the __Associative_Tree_Node__ to be returned.]
+ ]
+ [
+ [`Data`]
+ [The data type of the __Tree_Node__ to be returned.]
+ ]
+]
+
+[section:expressions Valid Expressions and Semantics]
+[table
+ [[Name][Expression][Return Type]]
+ [
+ [Non-associative invocation]
+ [[^_mpl_apply_wrap1_<Generator,Data>::type]]
+ [
+ A __Non_Associative_Tree_Node__ model whose `traits::data_type` is
+ the same as `Data`.
+ ]
+ ]
+ [
+ [Associative invocation]
+ [[^_mpl_apply_wrap2_<Generator,Key,Data>::type]]
+ [
+ An __Associative_Tree_Node__ model whose `traits::key_type` is the
+ same as `Key` and whose `traits::data_type` is the same as `Data`.
+ ]
+ ]
+]
+[endsect]
+
+[section Models]
+[itemized_list
+ [__binary_node_gen__]
+ [__nary_node_gen__]
+ [__associative_node_gen__]
+ [__tree_node_with_accumulation_gen__]
+ [__tree_node_with_count_gen__]
+ [__tree_node_with_height_gen__]
+ [__tree_node_with_position_gen__]
+ [__tree_node_with_red_black_flag_gen__]
+]
+[endsect]
+
+[endsect] [/ Node Type Generator]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_non_assoc_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_non_assoc_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,44 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:non_assoc_tree_node Non-Associative Tree Node]
+
+[section Description]
+Models of this concept provide access to their child nodes via iterator
+dereferencing.
+[endsect]
+
+[section Refinement of]
+__Tree_Node__
+[endsect]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Tree_Node__ concept; however,
+the requirements for the child iterator types are strengthened:
+
+[itemized_list
+ [The value type of `Node::iterator` must be `Node&`.]
+ [The value type of `Node::const_iterator` must be `Node const&`.]
+]
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+None beyond those defined in the __Tree_Node__ concept.
+[endsect]
+
+[section Models]
+[itemized_list
+ [__binary_node__]
+ [__binary_node_base__]
+ [__nary_node__]
+ [__nary_node_base__]
+]
+[endsect]
+
+[endsect] [/ Non-Associative Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_rvrsible_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_rvrsible_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,196 @@
+[/=============================================================================
+ Copyright (C) 2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:reversible_tree_node Reversible Tree Node]
+
+[section Description]
+Objects of types that model both the __Tree_Node_Iterator__ and
+__Bidirectional_Iterator__ concepts can iterate over objects of types that
+model this concept.
+[endsect]
+
+[section Refinement of]
+__Tree_Node__
+[endsect]
+
+[variablelist Notation
+ [[`Node`][A type that models the [*Reversible Tree Node] concept.]]
+ [[`node`][An object of type `Node&`.]]
+ [[`const_node`][An object of type `Node const&`.]]
+]
+
+[section:types Associated Types]
+Two new types are introduced.
+
+[table
+ [[Name][Expression][Description][Requirements]]
+ [
+ [Reverse iterator type]
+ [`Node::reverse_iterator`]
+ [
+ The type of iterator used to iterate in reverse through the
+ children of a `Node` object.
+ ]
+ [
+ It must model the __Bidirectional_Iterator__ concept, and it must
+ be convertible to `Node::const_reverse_iterator`.
+ ]
+ ]
+ [
+ [Immutable reverse iterator type]
+ [`Node::const_reverse_iterator`]
+ [
+ The type of iterator used to iterate in reverse through the
+ children of a `Node const` object.
+ ]
+ [
+ It must model the __Bidirectional_Iterator__ concept, and it must
+ /not/ point to a mutable object.
+ ]
+ ]
+]
+
+In addition, the requirements for the iterator types are strengthened: they
+must also model the __Bidirectional_Iterator__ concept.
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+In addition to the expressions defined in the __Tree_Node__ concept, the
+following expressions must be valid.
+
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type Requirements]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Children reverse range begin read-only access]
+ [``
+ const_node.crbegin()
+ const_node.rbegin()
+ ``]
+ [`Node::const_reverse_iterator`]
+ [
+ Returns an iterator pointing to the beginning of the reverse range
+ of children of the tree node. If the range is empty, then the
+ iterator points past-the-end.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Children reverse range begin access]
+ [`node.rbegin()`]
+ [`Node::reverse_iterator`]
+ [
+ Returns an iterator pointing to the beginning of the reverse range
+ of children of the tree node. If the range is empty, then the
+ iterator points past-the-end.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Children reverse range past-the-end read-only access]
+ [``
+ const_node.crend()
+ const_node.rend()
+ ``]
+ [`Node::const_reverse_iterator`]
+ [
+ Returns an iterator pointing past the end of the reverse range of
+ children of the tree node.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Children reverse range past-the-end access]
+ [`node.rend()`]
+ [`Node::reverse_iterator`]
+ [
+ Returns an iterator pointing past the end of the reverse range of
+ children of the tree node.
+ ]
+ []
+ [Constant]
+ ]
+]
+[endsect] [/ Valid Expressions and Semantics]
+
+[section Models]
+[itemized_list
+ [__binary_node__]
+ [__binary_node_base__]
+ [
+ __nary_node__ if [^_container_gen_<Selector,_nary_node_>::type] returns
+ a __Reversible_Container__ model
+ ]
+ [
+ __nary_node_base__ if [^_container_gen_<Selector,Derived>::type]
+ returns a __Reversible_Container__ model
+ ]
+ [
+ __associative_node__ if
+ [^_container_gen_<Selector,Key,_associative_node_>::type] returns a
+ __Reversible_Container__ model
+ ]
+ [
+ __associative_node_base__ if
+ [^_container_gen_<Selector,Key,Derived>::type] returns a
+ __Reversible_Container__ model
+ ]
+ [
+ __tree_node_with_accumulation__ if `BaseGenerator` returns a
+ [*Reversible Tree Node] model
+ ]
+ [
+ __tree_node_with_accumulation_base__ if `BaseGenerator` returns a
+ [*Reversible Tree Node] model
+ ]
+ [
+ __tree_node_with_count__ if `BaseGenerator` returns a [*Reversible Tree
+ Node] model
+ ]
+ [
+ __tree_node_with_count_base__ if `BaseGenerator` returns a [*Reversible
+ Tree Node] model
+ ]
+ [
+ __tree_node_with_height__ if `BaseGenerator` returns a [*Reversible
+ Tree Node] model
+ ]
+ [
+ __tree_node_with_height_base__ if `BaseGenerator` returns a
+ [*Reversible Tree Node] model
+ ]
+ [
+ __tree_node_with_position__ if `BaseGenerator` returns a [*Reversible
+ Tree Node] model
+ ]
+ [
+ __tree_node_with_position_base__ if `BaseGenerator` returns a
+ [*Reversible Tree Node] model
+ ]
+ [
+ __tree_node_with_red_black_flag__ if `BaseGenerator` returns a
+ [*Reversible Tree Node] model
+ ]
+ [
+ __tree_node_with_red_black_flag_base__ if `BaseGenerator` returns a
+ [*Reversible Tree Node] model
+ ]
+]
+[endsect]
+
+[endsect] [/ Reversible Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_tree_node.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concept_tree_node.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,438 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section:tree_node Tree Node]
+
+[section Description]
+All tree node implementations that this library provides model this concept:
+a structure that maintains information about its data and its immediate
+parent-child relationships. However, in practice, a full-fledged tree node
+data structure or adaptor consists of four components: a __Base_Tree_Node__
+model that defines the functionality, a __Base_Type_Generator__ that returns
+the __Base_Tree_Node__ model from which adaptor types can also inherit, a
+[*Tree Node] model that inherits from the base type and is better suited for
+external usage, and a __Node_Type_Generator__ that returns the [*Tree Node]
+model.
+[endsect]
+
+[variablelist Notation
+ [[`Node`][A type that models the [*Tree Node] concept.]]
+ [[`node`][An object of type `Node&`.]]
+ [[`const_node`][An object of type `Node const&`.]]
+ [[`alloc`][An object of type `Node::traits::allocator_reference`.]]
+ [[`Args`][The type of `args`.]]
+ [
+ [`args`]
+ [
+ Arguments to be forwarded to the appropriate
+ `Node::traits::data_type` constructor.
+ ]
+ ]
+]
+
+[section:types Associated Types]
+[table
+ [[Name][Expression][Description][Requirements]]
+ [
+ [Super type]
+ [`Node::super_t`]
+ [The type from which `Node` inherits its functionality.]
+ [
+ It must either be [^_tree_node_base_<Node>] or model the
+ __Base_Tree_Node__ concept.
+ ]
+ ]
+ [
+ [Data type]
+ [`Node::traits::data_type`]
+ [The type of user data stored in a tree node.]
+ []
+ ]
+ [
+ [Allocator type]
+ [`Node::traits::allocator`]
+ [
+ The type that defines the memory model to be used by the child
+ creation methods for creating `Node` objects.
+ ]
+ [It must be a valid __container_allocator_traits__ template argument.]
+ ]
+ [
+ [Allocator reference type]
+ [`Node::traits::allocator_reference`]
+ [
+ The type to which `alloc` will be bound if passed to the
+ emplacement constructor.
+ ]
+ [
+ It must be either `Node::traits::allocator&` or
+ `Node::traits::allocator const&`.
+ ]
+ ]
+ [
+ [Pointer type]
+ [`Node::pointer`]
+ [The type of a pointer to a `Node` object.]
+ [
+ It must model the __Trivial_Iterator__ concept, it must point to
+ a mutable object, and it must be implicitly convertible to
+ `Node::const_pointer`.
+ ]
+ ]
+ [
+ [Pointer-to-const type]
+ [`Node::const_pointer`]
+ [The type of a pointer to a `Node const` object.]
+ [
+ It must model the __Trivial_Iterator__ concept, and it must /not/
+ point to a mutable object.
+ ]
+ ]
+ [
+ [Iterator type]
+ [`Node::iterator`]
+ [
+ The type of iterator used to iterate through the children of a
+ `Node` object.
+ ]
+ [
+ It must model the __Input_Iterator__ concept, and it must be
+ convertible to `Node::const_iterator`.
+ ]
+ ]
+ [
+ [Immutable iterator type]
+ [`Node::const_iterator`]
+ [
+ The type of iterator used to iterate through the children of a
+ `Node const` object.
+ ]
+ [
+ It must model the __Input_Iterator__ concept, and it must /not/
+ point to a mutable object.
+ ]
+ ]
+ [
+ [Size type]
+ [`Node::size_type`]
+ [
+ The type of unsigned integer used to represent the number of
+ children of a `Node const` object.
+ ]
+ []
+ ]
+]
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+[table
+ [
+ [Name]
+ [Expression]
+ [Return Type]
+ [Semantics]
+ [Type Requirements]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Emplacement constructor]
+ [``
+ Node(_boost_forward_<Args>(args)...)
+ ``]
+ []
+ [
+ Constructs a `Node` object that initializes its user data with the
+ specified arguments.
+ ]
+ [
+ The allocator type must be __Default_Constructible__, and the
+ allocator reference type must be `Node::traits::allocator const&`.
+ ]
+ []
+ ]
+ [
+ [Emplacement constructor with allocator]
+ [``
+ Node(
+ boost::container::allocator_arg
+ , alloc
+ , _boost_forward_<Args>(args)...
+ )
+ ``]
+ []
+ [
+ Constructs a `Node` object that initializes its user data with the
+ specified arguments. The new node will use the specified allocator
+ (if the allocator reference type is mutable) or a copy of it (if
+ the allocator reference type is to `const`) to construct its own
+ parent node or its own child nodes if and when invoking its
+ respective creation methods.
+ ]
+ []
+ []
+ ]
+ [
+ [Data read-only access]
+ [``
+ get<_data_key_>(const_node)
+ get(const_node, _data_key_())
+ ``]
+ [``
+ Node::traits::data_type const&
+ ``]
+ [Returns the user data stored in the tree node.]
+ []
+ [Constant]
+ ]
+ [
+ [Data access]
+ [``
+ get<_data_key_>(node)
+ get(node, _data_key_())
+ ``]
+ [``
+ Node::traits::data_type&
+ ``]
+ [Returns the user data stored in the tree node.]
+ []
+ [Constant]
+ ]
+ [
+ [Data modification]
+ [``
+ put(node, _data_key_(), data)
+ ``]
+ [``
+ void
+ ``]
+ [Sets the user data to be stored in the tree node.]
+ [The type of `data` must be convertible to `Node::traits::data_type`.]
+ [Constant]
+ ]
+ [
+ [Key-value read-only access]
+ [``
+ get<Key>(const_node)
+ get(const_node, Key())
+ ``]
+ [``
+ _result_of__at_key_<
+ Node const
+ , Key
+ >::type
+ ``]
+ [
+ Returns the value that the tree node associates with the specified
+ key.
+ ]
+ [
+ [^_result_of__has_key_<Node,Key>] must be equivalent to
+ __mpl_true__.
+ ]
+ [Constant]
+ ]
+ [
+ [Key-value access]
+ [``
+ get<Key>(node)
+ get(node, Key())
+ ``]
+ [``
+ _result_of__at_key_<
+ Node
+ , Key
+ >::type
+ ``]
+ [
+ Returns the value that the tree node associates with the specified
+ key.
+ ]
+ [
+ [^_result_of__has_key_<Node,Key>] must be equivalent to
+ __mpl_true__.
+ ]
+ [Constant]
+ ]
+ [
+ [Key-value modification]
+ [``
+ put(node, Key(), value)
+ ``]
+ [``
+ void
+ ``]
+ [
+ Sets the value to be associated with the specified key type in the
+ tree node.
+ ]
+ [
+ [^_result_of__has_key_<Node,Key>] must be equivalent to
+ __mpl_true__, and the type of `value` must be convertible to
+ [^_result_of__value_at_key_<Node,Key>::type].
+ ]
+ [Constant]
+ ]
+ [
+ [Parent read-only access]
+ [``
+ const_node.get_parent_ptr()
+ ``]
+ [``
+ Node::const_pointer
+ ``]
+ [
+ Returns a pointer to the parent of the tree node, or a null pointer
+ if the node is the root.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Parent access]
+ [``
+ node.get_parent_ptr()
+ ``]
+ [``
+ Node::pointer
+ ``]
+ [
+ Returns a pointer to the parent of the tree node, or a null pointer
+ if the node is the root.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Children range begin read-only access]
+ [``
+ const_node.cbegin()
+ const_node.begin()
+ ``]
+ [``
+ Node::const_iterator
+ ``]
+ [
+ Returns an iterator pointing to the beginning of the range of
+ children of the tree node. If the range is empty, then the
+ iterator points past-the-end.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Children range begin access]
+ [``
+ node.begin()
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Returns an iterator pointing to the beginning of the range of
+ children of the tree node. If the range is empty, then the
+ iterator points past-the-end.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Children range past-the-end read-only access]
+ [``
+ const_node.cend()
+ const_node.end()
+ ``]
+ [``
+ Node::const_iterator
+ ``]
+ [
+ Returns an iterator pointing past the end of the range of children
+ of the tree node.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Children range past-the-end access]
+ [``
+ node.end()
+ ``]
+ [``
+ Node::iterator
+ ``]
+ [
+ Returns an iterator pointing past the end of the range of children
+ of the tree node.
+ ]
+ []
+ [Constant]
+ ]
+ [
+ [Children range size query]
+ [``
+ const_node.size()
+ ``]
+ [``
+ Node::size_type
+ ``]
+ [Returns the number of children of the tree node.]
+ []
+ [Linear with respect to the number of children]
+ ]
+ [
+ [Leaf node query]
+ [``
+ const_node.empty()
+ ``]
+ [``
+ bool
+ ``]
+ [
+ Equivalent to `const_node.begin() == const_node.end()`, but may
+ be more efficient in certain cases.
+ ]
+ []
+ [Linear with respect to the number of children]
+ ]
+ [
+ [Remove all descendants]
+ [``
+ node.clear()
+ ``]
+ [``
+ void
+ ``]
+ [Removes all children and their descendants from the tree node.]
+ []
+ [Linear with respect to the number of children and their descendants]
+ ]
+]
+[endsect] [/ Valid Expressions and Semantics]
+
+[section Models]
+[itemized_list
+ [__binary_node__]
+ [__binary_node_base__]
+ [__nary_node__]
+ [__nary_node_base__]
+ [__associative_node__]
+ [__associative_node_base__]
+ [__tree_node_with_accumulation__]
+ [__tree_node_with_accumulation_base__]
+ [__tree_node_with_count__]
+ [__tree_node_with_count_base__]
+ [__tree_node_with_height__]
+ [__tree_node_with_height_base__]
+ [__tree_node_with_position__]
+ [__tree_node_with_position_base__]
+ [__tree_node_with_red_black_flag__]
+ [__tree_node_with_red_black_flag_base__]
+]
+[endsect]
+
+[endsect] [/ Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concepts.qbk
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/concepts.qbk 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,64 @@
+[/=============================================================================
+ Copyright (C) 2011-2013 Cromwell D. Enage
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ [@http://www.boost.org/LICENSE_1_0.txt])
+=============================================================================/]
+
+[section Concepts]
+
+[include concept_tree_node.qbk]
+[include concept_copyable_tree_node.qbk]
+[include concept_movable_tree_node.qbk]
+[include concept_base_tree_node.qbk]
+[include concept_rvrsible_tree_node.qbk]
+[include concept_assoc_tree_node.qbk]
+[include concept_non_assoc_tree_node.qbk]
+[include concept_binary_tree_node.qbk]
+[include concept_nary_tree_node.qbk]
+[include concept_node_type_generator.qbk]
+[include concept_base_type_generator.qbk]
+[include concept_iterator.qbk]
+[include concept_full_iterator.qbk]
+[include concept_descendant_iterator.qbk]
+[include concept_indexable_container.qbk]
+[include concept_indexable_iterator.qbk]
+
+[heading Core Concepts]
+
+[itemized_list
+ [__Tree_Node__
+ [itemized_list
+ [__Copyable_Tree_Node__]
+ [__Movable_Tree_Node__]
+ [__Base_Tree_Node__]
+ [__Reversible_Tree_Node__]
+ [__Associative_Tree_Node__]
+ [__Non_Associative_Tree_Node__
+ [itemized_list
+ [__Binary_Tree_Node__]
+ [__N_ary_Tree_Node__]
+ ]
+ ]
+ ]
+ ]
+ [__Node_Type_Generator__]
+ [__Base_Type_Generator__]
+ [__Tree_Node_Iterator__
+ [itemized_list
+ [__Full_Tree_Node_Iterator__]
+ [__Tree_Node_Descendant_Iterator__]
+ ]
+ ]
+]
+
+[heading Auxiliary Concepts]
+
+[itemized_list
+ [__Indexable_Container__]
+ [__Indexable_Iterator__]
+]
+
+[endsect] [/ Concepts]
+

Added: sandbox/tree_node/libs/tree_node/doc/html/index.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/index.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,70 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Chapter&#160;1.&#160;tree_node 0.5</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="next" href="tree_node/concepts.html" title="Concepts">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav"><a accesskey="n" href="tree_node/concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a></div>
+<div class="chapter">
+<div class="titlepage"><div>
+<div><h2 class="title">
+<a name="tree_node"></a>Chapter&#160;1.&#160;tree_node 0.5</h2></div>
+<div><div class="author"><h3 class="author">
+<span class="firstname">Cromwell D.</span> <span class="surname">Enage</span>
+</h3></div></div>
+<div><p class="copyright">Copyright &#169; 2011-2013 Cromwell D. Enage</p></div>
+<div><div class="legalnotice">
+<a name="tree_node.legal"></a><p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></div>
+</div></div>
+<div class="toc">
+<p><b>Table of Contents</b></p>
+<dl>
+<dt><span class="section">Concepts</span></dt>
+<dt><span class="section">Reference</span></dt>
+<dt><span class="section">Changelog</span></dt>
+</dl>
+</div>
+<h3>
+<a name="tree_node.h0"></a>
+ <span class="phrase"><a name="tree_node.rationale"></a></span><a class="link" href="index.html#tree_node.rationale">Rationale</a>
+ </h3>
+<p>
+ Over the course of reimplementing a decision tree learning algorithm to use modern
+ C++ techniques, the need for a generic tree library became evident. The in-house
+ data structures in use at the time were undergoing modification as well. It was
+ found that the core operations occurred at the node level rather than at the
+ tree level, which stored only high-level algorithms. Efforts went underway to
+ retrofit these algorithms to use iterators and to further factor out generic
+ data structures from the decision tree components and other application-specific
+ utilities. This library represents the Boostified culmination of these efforts.
+ </p>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="http://www.boost.org/doc/libs/release/doc/src/images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+ This library depends on Boost.ContainerGen, which is not yet a part
+ of Boost. For now, you must perform a Subversion checkout from the <a href="http://svn.boost.org/" target="_top">SVN
+ Trac</a>.
+ </p></td></tr>
+</table></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"><p><small>Last revised: July 07, 2013 at 18:36:21 GMT</small></p></td>
+<td align="right"><div class="copyright-footer"></div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav"><a accesskey="n" href="tree_node/concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a></div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/changelog.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/changelog.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,273 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Changelog</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="prev" href="reference/can_use_fusion_with_typeof.html" title="BOOST_TREE_NODE_CAN_USE_FUSION_WITH_TYPEOF">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="reference/can_use_fusion_with_typeof.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="tree_node.changelog"></a><a class="link" href="changelog.html" title="Changelog">Changelog</a>
+</h2></div></div></div>
+<h4>
+<a name="tree_node.changelog.h0"></a>
+ <span class="phrase"><a name="tree_node.changelog.from_0_4_to_0_5"></a></span><a class="link" href="changelog.html#tree_node.changelog.from_0_4_to_0_5">From
+ 0.4 to 0.5</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ Added the <a class="link" href="concepts/copyable_tree_node.html" title="Copyable Tree Node"><span class="bold"><strong>Copyable Tree Node</strong></span></a> and <a class="link" href="concepts/movable_tree_node.html" title="Movable Tree Node"><span class="bold"><strong>Movable Tree Node</strong></span></a> concepts.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/compare_selector.html" title="compare_selector&lt;Key&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">compare_selector</span></code></a> template.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/null_balancer.html" title="null_balancer"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">null_balancer</span></code></a> trait struct.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/at_key.html" title="at_key&lt;Key&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">at_key</span></code></a>
+ intrinsic function object.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/cartesian_sort.html" title="cartesian_sort()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">cartesian_sort</span><span class="special">()</span></code></a>
+ and <a class="link" href="reference/cartesian_sort_range.html" title="cartesian_sort_range()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">cartesian_sort_range</span><span class="special">()</span></code></a>
+ algorithms.
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.changelog.h1"></a>
+ <span class="phrase"><a name="tree_node.changelog.from_0_3_to_0_4"></a></span><a class="link" href="changelog.html#tree_node.changelog.from_0_3_to_0_4">From
+ 0.3 to 0.4</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/binode_container.html" title="binode_container&lt;NodeGenerator,T,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_container</span></code></a>, <a class="link" href="reference/binode_assoc_container.html" title="binode_associative_container&lt; NodeGenerator , T1 , T2 , IsMultipleAssociative , CompareSelector , Balancer &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_associative_container</span></code></a>,
+ <a class="link" href="reference/binode_set.html" title="binode_set&lt;NodeGenerator,T,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_set</span></code></a>,
+ <a class="link" href="reference/binode_multiset.html" title="binode_multiset&lt;NodeGenerator,T,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_multiset</span></code></a>,
+ <a class="link" href="reference/binode_map.html" title="binode_map&lt;NodeGenerator,Key,Mapped,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_map</span></code></a>,
+ and <a class="link" href="reference/binode_multimap.html" title="binode_multimap&lt;NodeGenerator,Key,Mapped,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_multimap</span></code></a>
+ data structures.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/red_black_balancer.html" title="red_black_balancer"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">red_black_balancer</span></code></a> and <a class="link" href="reference/avl_balancer.html" title="adelson_velskii_landis_balancer"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">adelson_velskii_landis_balancer</span></code></a>
+ trait structs.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a>, <a class="link" href="concepts/indexable_container.html" title="Indexable Container"><span class="bold"><strong>Indexable Container</strong></span></a>, and <a class="link" href="concepts/indexable_iterator.html" title="Indexable Iterator"><span class="bold"><strong>Indexable Iterator</strong></span></a> concepts.
+ </p></li>
+<li class="listitem"><p>
+ Refined the <span class="bold"><strong>Type Generator</strong></span> concept into
+ the <a class="link" href="concepts/node_type_generator.html" title="Node Type Generator"><span class="bold"><strong>Node
+ Type Generator</strong></span></a> and <a class="link" href="concepts/base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base Type Generator</strong></span></a> concepts.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/copyable_and_movable.html" title="BOOST_TREE_NODE_COPYABLE_AND_MOVABLE"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_COPYABLE_AND_MOVABLE</span></code></a>,
+ <a class="link" href="reference/emplace_ctor_fwd_decl.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_FWD_DECL"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_FWD_DECL</span></code></a>,
+ <a class="link" href="reference/emplace_ctor_inline_hdr.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_HDR"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_HEADER</span></code></a>,
+ <a class="link" href="reference/emplace_ctor_inline_def.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF</span></code></a>,
+ <a class="link" href="reference/emplace_ctor_w_alloc_f_dcl.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_FWD_DECL"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_FWD_DECL</span></code></a>,
+ <a class="link" href="reference/emplace_ctor_w_alloc_i_hdr.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_HEADER"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_HEADER</span></code></a>,
+ <a class="link" href="reference/emplace_ctor_w_alloc_i_def.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF</span></code></a>,
+ <a class="link" href="reference/can_use_fusion.html" title="BOOST_TREE_NODE_CAN_USE_FUSION"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_CAN_USE_FUSION</span></code></a>,
+ and <a class="link" href="reference/can_use_fusion_with_typeof.html" title="BOOST_TREE_NODE_CAN_USE_FUSION_WITH_TYPEOF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_CAN_USE_FUSION_WITH_TYPEOF</span></code></a>
+ preprocessor macros.
+ </p></li>
+<li class="listitem"><p>
+ Added size type and emplacement constructor and size method expressions
+ to the <a class="link" href="concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a> concept.
+ </p></li>
+<li class="listitem"><p>
+ Added <code class="computeroutput"><span class="identifier">on_post_</span><span class="special">*</span></code>
+ and <code class="computeroutput"><span class="identifier">on_post_</span><span class="special">*</span><span class="identifier">_impl</span></code> method expressions to the <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base
+ Tree Node</strong></span></a> concept.
+ </p></li>
+<li class="listitem"><p>
+ Added iterator range and immutable iterator range types to the <a class="link" href="concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> concept.
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a> models are now Movable.
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a> models are no longer Equality Comparable or Less-Than Comparable.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/with_accumulation.html" title="with_accumulation&lt;BaseGenerator,T1,T2,AccumulationKey&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation</span></code></a> adaptor class
+ template, the corresponding <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model <a class="link" href="reference/with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a>, the corresponding
+ <a class="link" href="concepts/node_type_generator.html" title="Node Type Generator"><span class="bold"><strong>Node
+ Type Generator</strong></span></a> model <a class="link" href="reference/with_accumulation_gen.html" title="with_accumulation_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_gen</span></code></a>, and the
+ corresponding <a class="link" href="concepts/base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base Type Generator</strong></span></a> model <a class="link" href="reference/with_accumulation_base_gen.html" title="with_accumulation_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/with_count.html" title="with_count&lt;BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count</span></code></a> adaptor class template,
+ the corresponding <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model <a class="link" href="reference/with_count_base.html" title="with_count_base&lt;Derived,BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base</span></code></a>, the corresponding
+ <a class="link" href="concepts/node_type_generator.html" title="Node Type Generator"><span class="bold"><strong>Node
+ Type Generator</strong></span></a> model <a class="link" href="reference/with_count_gen.html" title="with_count_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_gen</span></code></a>, and the corresponding
+ <a class="link" href="concepts/base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base
+ Type Generator</strong></span></a> model <a class="link" href="reference/with_count_base_gen.html" title="with_count_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Renamed <code class="computeroutput"><span class="identifier">with_depth</span></code> to
+ <a class="link" href="reference/with_height.html" title="with_height&lt;BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Renamed <code class="computeroutput"><span class="identifier">with_depth_base</span></code>
+ to <a class="link" href="reference/with_height_base.html" title="with_height_base&lt;Derived,BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_base</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Renamed <code class="computeroutput"><span class="identifier">with_depth_gen</span></code>
+ to <a class="link" href="reference/with_height_gen.html" title="with_height_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="concepts/base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base Type Generator</strong></span></a> models <a class="link" href="reference/with_count_base_gen.html" title="with_count_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base_gen</span></code></a>, <a class="link" href="reference/with_height_base_gen.html" title="with_height_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_base_gen</span></code></a>, <a class="link" href="reference/with_position_base_gen.html" title="with_position_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_base_gen</
 span></code></a>, and <a class="link" href="reference/with_rb_flag_base_gen.html" title="with_red_black_flag_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_base_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/advance_binary.html" title="advance_binary()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">advance_binary</span><span class="special">()</span></code></a>,
+ <a class="link" href="reference/binary_index_of.html" title="binary_index_of()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_index_of</span><span class="special">()</span></code></a>, <a class="link" href="reference/binary_descendant.html" title="binary_descendant()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_descendant</span><span class="special">()</span></code></a>,
+ <a class="link" href="reference/binary_descendant_at_index.html" title="binary_descendant_at_index()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_descendant_at_index</span><span class="special">()</span></code></a>,
+ <a class="link" href="reference/binary_upper_bound.html" title="binary_upper_bound()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_upper_bound</span><span class="special">()</span></code></a>, and <a class="link" href="reference/binary_lower_bound.html" title="binary_lower_bound()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_lower_bound</span><span class="special">()</span></code></a>
+ algorithms.
+ </p></li>
+<li class="listitem"><p>
+ Removed <code class="computeroutput"><span class="identifier">tree_node_equal</span></code>,
+ <code class="computeroutput"><span class="identifier">tree_node_strictly_equal</span></code>,
+ <code class="computeroutput"><span class="identifier">tree_node_lexicographical_compare</span></code>,
+ and <code class="computeroutput"><span class="identifier">tree_node_strict_lexicographical_compare</span></code>
+ algorithms.
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.changelog.h2"></a>
+ <span class="phrase"><a name="tree_node.changelog.from_0_2_to_0_3"></a></span><a class="link" href="changelog.html#tree_node.changelog.from_0_2_to_0_3">From
+ 0.2 to 0.3</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ Added the <a class="link" href="concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>, <a class="link" href="concepts/non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative Tree Node</strong></span></a>, <a class="link" href="concepts/binary_tree_node.html" title="Binary Tree Node"><span class="bold"><strong>Binary Tree Node</strong></span></a>, <a class="link" href="concepts/nary_tree_node.html" title="N-ary Tree Node"><span class="bold"><strong>N-ary Tree Node</strong></span></a>, and <span class="bold"><strong>Type
+ Generator</strong></span> concepts.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/binary_node.html" title="binary_node&lt;T,Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node</span></code></a> data structure, the
+ corresponding <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model <a class="link" href="reference/binary_node_base.html" title="binary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base</span></code></a>, and the corresponding
+ <span class="bold"><strong>Type Generator</strong></span> model <a class="link" href="reference/binary_node_gen.html" title="binary_node_gen&lt;Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Renamed <code class="computeroutput"><span class="identifier">raw_node</span></code> to <a class="link" href="reference/nary_node.html" title="nary_node&lt;T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node</span></code></a>;
+ added the corresponding <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model <a class="link" href="reference/nary_node_base.html" title="nary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base</span></code></a> and the corresponding
+ <span class="bold"><strong>Type Generator</strong></span> model <a class="link" href="reference/nary_node_gen.html" title="nary_node_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Renamed <code class="computeroutput"><span class="identifier">raw_associative_node</span></code>
+ to <a class="link" href="reference/associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a>;
+ added the corresponding <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model <a class="link" href="reference/associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a> and the
+ corresponding <span class="bold"><strong>Type Generator</strong></span> model <a class="link" href="reference/associative_node_gen.html" title="associative_node_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base
+ Tree Node</strong></span></a> model <code class="computeroutput"><span class="identifier">with_depth_base</span></code>
+ and the corresponding <span class="bold"><strong>Type Generator</strong></span> model
+ <code class="computeroutput"><span class="identifier">with_depth_gen</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ Added <a class="link" href="reference/with_position.html" title="with_position&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position</span></code></a>
+ adaptor class template, the corresponding <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model <a class="link" href="reference/with_position_base.html" title="with_position_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_base</span></code></a>, and the corresponding
+ <span class="bold"><strong>Type Generator</strong></span> model <a class="link" href="reference/with_position_gen.html" title="with_position_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/with_rb_flag.html" title="with_red_black_flag&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag</span></code></a> adaptor class
+ template, the corresponding <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model <a class="link" href="reference/with_rb_flag_base.html" title="with_red_black_flag_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_base</span></code></a>, and
+ the corresponding <span class="bold"><strong>Type Generator</strong></span> model
+ <a class="link" href="reference/with_rb_flag_gen.html" title="with_red_black_flag_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_gen</span></code></a>.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/breadth_first_desc_iter.html" title="breadth_first_descendant_iterator&lt;Node,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">breadth_first_descendant_iterator</span></code></a>,
+ <a class="link" href="reference/pre_order_desc_iter.html" title="pre_order_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">pre_order_descendant_iterator</span></code></a>,
+ <a class="link" href="reference/post_order_desc_iter.html" title="post_order_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">post_order_descendant_iterator</span></code></a>,
+ <a class="link" href="reference/in_order_iterator.html" title="in_order_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">in_order_iterator</span></code></a>,
+ and <a class="link" href="reference/depth_first_desc_iter.html" title="depth_first_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">depth_first_descendant_iterator</span></code></a>
+ adaptor class templates.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/dereference_iterator.html" title="dereference_iterator()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">dereference_iterator</span><span class="special">()</span></code></a>,
+ <code class="computeroutput"><span class="identifier">tree_node_equal</span></code>, <code class="computeroutput"><span class="identifier">tree_node_strictly_equal</span></code>, <code class="computeroutput"><span class="identifier">tree_node_lexicographical_compare</span></code>, and
+ <code class="computeroutput"><span class="identifier">tree_node_strict_lexicographical_compare</span></code>
+ algorithms.
+ </p></li>
+<li class="listitem"><p>
+ Removed the <span class="bold"><strong>Factory-Constructible Tree Node</strong></span>
+ and <span class="bold"><strong>Cloneable Tree Node</strong></span> concepts.
+ </p></li>
+<li class="listitem"><p>
+ Removed the <code class="computeroutput"><span class="identifier">tree_node_factory</span></code>
+ facade.
+ </p></li>
+<li class="listitem"><p>
+ Removed the <code class="computeroutput"><span class="identifier">shared_tree_node_base</span></code>
+ <code class="computeroutput"><span class="keyword">struct</span></code> template.
+ </p></li>
+<li class="listitem"><p>
+ Removed the <code class="computeroutput"><span class="identifier">simple_node</span></code>
+ and <code class="computeroutput"><span class="identifier">simple_associative_node</span></code>
+ data structures.
+ </p></li>
+<li class="listitem"><p>
+ Removed the <code class="computeroutput"><span class="identifier">with_child_range_access</span></code>
+ adaptor class template; the <a class="link" href="concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept now requires child range
+ access for all models.
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.changelog.h3"></a>
+ <span class="phrase"><a name="tree_node.changelog.from_0_1_to_0_2"></a></span><a class="link" href="changelog.html#tree_node.changelog.from_0_1_to_0_2">From
+ 0.1 to 0.2</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ Added the <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base
+ Tree Node</strong></span></a>, <span class="bold"><strong>Factory-Constructible
+ Tree Node</strong></span>, and <span class="bold"><strong>Cloneable Tree Node</strong></span>
+ concepts.
+ </p></li>
+<li class="listitem"><p>
+ Added <code class="computeroutput"><span class="identifier">tree_node_factory</span></code>
+ facade.
+ </p></li>
+<li class="listitem"><p>
+ Added the <a class="link" href="reference/tree_node_base.html" title="tree_node_base&lt;Derived&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">tree_node_base</span></code></a> and <code class="computeroutput"><span class="identifier">shared_tree_node_base</span></code> <code class="computeroutput"><span class="keyword">struct</span></code>
+ templates; each <a class="link" href="concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> model that is not a <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> now inherits from a corresponding
+ <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base
+ Tree Node</strong></span></a> which, in turn, inherits from one of these
+ two types.
+ </p></li>
+<li class="listitem"><p>
+ Added the <code class="computeroutput"><span class="identifier">with_child_range_access</span></code>
+ and <code class="computeroutput"><span class="identifier">with_depth</span></code> adaptor
+ class templates.
+ </p></li>
+</ul></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="reference/can_use_fusion_with_typeof.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,123 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Concepts</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="prev" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="next" href="concepts/tree_node.html" title="Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concepts/tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="tree_node.concepts"></a><a class="link" href="concepts.html" title="Concepts">Concepts</a>
+</h2></div></div></div>
+<h4>
+<a name="tree_node.concepts.h0"></a>
+ <span class="phrase"><a name="tree_node.concepts.core_concepts"></a></span><a class="link" href="concepts.html#tree_node.concepts.core_concepts">Core
+ Concepts</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+<p>
+ <a class="link" href="concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
+<li class="listitem"><p>
+ <a class="link" href="concepts/copyable_tree_node.html" title="Copyable Tree Node"><span class="bold"><strong>Copyable
+ Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/movable_tree_node.html" title="Movable Tree Node"><span class="bold"><strong>Movable
+ Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base
+ Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible
+ Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem">
+<p>
+ <a class="link" href="concepts/non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative
+ Tree Node</strong></span></a>
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: square; ">
+<li class="listitem"><p>
+ <a class="link" href="concepts/binary_tree_node.html" title="Binary Tree Node"><span class="bold"><strong>Binary
+ Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/nary_tree_node.html" title="N-ary Tree Node"><span class="bold"><strong>N-ary
+ Tree Node</strong></span></a>
+ </p></li>
+</ul></div>
+</li>
+</ul></div>
+</li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/node_type_generator.html" title="Node Type Generator"><span class="bold"><strong>Node
+ Type Generator</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base
+ Type Generator</strong></span></a>
+ </p></li>
+<li class="listitem">
+<p>
+ <a class="link" href="concepts/tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree
+ Node Iterator</strong></span></a>
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
+<li class="listitem"><p>
+ <a class="link" href="concepts/full_tree_node_iterator.html" title="Full Tree Node Iterator"><span class="bold"><strong>Full Tree Node Iterator</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/tree_node_desc_iterator.html" title="Tree Node Descendant Iterator"><span class="bold"><strong>Tree Node Descendant Iterator</strong></span></a>
+ </p></li>
+</ul></div>
+</li>
+</ul></div>
+<h4>
+<a name="tree_node.concepts.h1"></a>
+ <span class="phrase"><a name="tree_node.concepts.auxiliary_concepts"></a></span><a class="link" href="concepts.html#tree_node.concepts.auxiliary_concepts">Auxiliary
+ Concepts</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="concepts/indexable_container.html" title="Indexable Container"><span class="bold"><strong>Indexable
+ Container</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="concepts/indexable_iterator.html" title="Indexable Iterator"><span class="bold"><strong>Indexable
+ Iterator</strong></span></a>
+ </p></li>
+</ul></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concepts/tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/associative_tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/associative_tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,701 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Associative Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="reversible_tree_node.html" title="Reversible Tree Node">
+<link rel="next" href="non_assoc_tree_node.html" title="Non-Associative Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="reversible_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="non_assoc_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.associative_tree_node"></a><a class="link" href="associative_tree_node.html" title="Associative Tree Node">Associative
+ Tree Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.associative_tree_node.description"></a><a class="link" href="associative_tree_node.html#tree_node.concepts.associative_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Models of this concept provide key-based access to their child nodes.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.associative_tree_node.refinement_of"></a><a class="link" href="associative_tree_node.html#tree_node.concepts.associative_tree_node.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Associative Tree Node</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">const_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">source</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">key</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Args</span></code></span></dt>
+<dd><p>
+ The type of <code class="computeroutput"><span class="identifier">args</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">args</span></code></span></dt>
+<dd><p>
+ Arguments to be forwarded to the appropriate <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code>
+ constructor.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.associative_tree_node.types"></a><a class="link" href="associative_tree_node.html#tree_node.concepts.associative_tree_node.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ Three new types are introduced.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+<th>
+ <p>
+ Requirements
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Key type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a key that a tree node will associate with a child
+ node.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator range type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">iterator_range</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a range of child nodes and their associated keys.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model a Boost.Range concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable iterator range type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">const_iterator_range</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of an immutable view of a range of child nodes and their
+ associated keys.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model a Boost.Range concept.
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+ In addition, the requirements for the iterator types are strengthened:
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>
+ must define a <code class="computeroutput"><span class="identifier">first_type</span></code>
+ type.
+ </p></li>
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>
+ must define a <code class="computeroutput"><span class="identifier">first</span></code>
+ member variable of type <code class="computeroutput"><span class="identifier">first_type</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ Given an object <code class="computeroutput"><span class="identifier">itr</span></code>
+ of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>, <code class="computeroutput"><span class="identifier">itr</span><span class="special">-&gt;</span><span class="identifier">first</span></code>
+ must be convertible to <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>
+ must define a <code class="computeroutput"><span class="identifier">second_type</span></code>
+ type.
+ </p></li>
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>
+ must define a <code class="computeroutput"><span class="identifier">second</span></code>
+ member variable of type <code class="computeroutput"><span class="identifier">second_type</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ Given an object <code class="computeroutput"><span class="identifier">itr</span></code>
+ of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>, <code class="literal"><a class="link" href="../reference/dereference_iterator.html" title="dereference_iterator()">tree_node::dereference_iterator</a>(itr)</code>
+ must be convertible to <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>
+ must define a <code class="computeroutput"><span class="identifier">first_type</span></code>
+ type.
+ </p></li>
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>
+ must define a <code class="computeroutput"><span class="identifier">first</span></code>
+ member variable of type <code class="computeroutput"><span class="identifier">first_type</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ Given an object <code class="computeroutput"><span class="identifier">itr</span></code>
+ of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>, <code class="computeroutput"><span class="identifier">itr</span><span class="special">-&gt;</span><span class="identifier">first</span></code>
+ must be convertible to <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>
+ must define a <code class="computeroutput"><span class="identifier">second_type</span></code>
+ type.
+ </p></li>
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>
+ must define a <code class="computeroutput"><span class="identifier">second</span></code>
+ member variable of type <code class="computeroutput"><span class="identifier">second_type</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ Given an object <code class="computeroutput"><span class="identifier">itr</span></code>
+ of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>, <code class="literal"><a class="link" href="../reference/dereference_iterator.html" title="dereference_iterator()">tree_node::dereference_iterator</a>(itr)</code>
+ must be convertible to <code class="computeroutput"><span class="identifier">Node</span>
+ <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.associative_tree_node.expressions"></a><a class="link" href="associative_tree_node.html#tree_node.concepts.associative_tree_node.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept, the following expressions
+ must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type requirements
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Child creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">emplace</span><span class="special">(</span>
+ <span class="identifier">key</span>
+ <span class="special">,</span> boost::forward<span class="special">&lt;</span><span class="identifier">Args</span><span class="special">&gt;(</span><span class="identifier">args</span><span class="special">)...</span>
+<span class="special">);</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to the child that <code class="computeroutput"><span class="identifier">node</span></code> associates with <code class="computeroutput"><span class="identifier">key</span></code> if <code class="computeroutput"><span class="identifier">node</span></code>
+ allows only one such association to exist; otherwise, creates
+ a tree node to be associated with the specified key in the range
+ of children of the invoking node, then returns an iterator pointing
+ to the created node, which will initialize its data with the
+ specified arguments.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child copy creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">key</span><span class="special">,</span> <span class="identifier">const_node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to the child that <code class="computeroutput"><span class="identifier">node</span></code> associates with <code class="computeroutput"><span class="identifier">key</span></code> if <code class="computeroutput"><span class="identifier">node</span></code>
+ allows only one such association to exist; otherwise, creates
+ a deep copy of <code class="computeroutput"><span class="identifier">const_node</span></code>
+ to be associated with the specified key in the range of children
+ of the invoking node, then returns an iterator pointing to the
+ created node.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must model the Copy Constructible and Movable
+ concepts.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants of <code class="computeroutput"><span class="identifier">const_node</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child move insertion
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">key</span><span class="special">,</span> <span class="identifier">source</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to the child that <code class="computeroutput"><span class="identifier">node</span></code> associates with <code class="computeroutput"><span class="identifier">key</span></code> if <code class="computeroutput"><span class="identifier">node</span></code>
+ allows only one such association to exist; otherwise, move-constructs
+ a copy of <code class="computeroutput"><span class="identifier">source</span></code>
+ to be associated with the specified key in the range of children
+ of the invoking node, then returns an iterator pointing to the
+ created node.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must model the Movable concept.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children of <code class="computeroutput"><span class="identifier">source</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child read-only search
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to a child node associated with
+ the specified key, or <code class="computeroutput"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code> if no such child exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to a child node associated with
+ the specified key, or <code class="computeroutput"><span class="identifier">node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code> if no such child exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child read-only search lower bound
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to a child node associated with
+ the lowest key not less than the specified key, or <code class="computeroutput"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
+ if no such child exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search lower bound
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to a child node associated with
+ the lowest key not less than the specified key, or <code class="computeroutput"><span class="identifier">node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
+ if no such child exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child read-only search upper bound
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to a child node associated with
+ the lowest key that is strictly greater than the specified key,
+ or <code class="computeroutput"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code> if no such child exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search upper bound
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to a child node associated with
+ the lowest key that is strictly greater than the specified key,
+ or <code class="computeroutput"><span class="identifier">node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
+ if no such child exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child read-only search range
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">const_iterator_range</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns a Boost.Range of all child nodes
+ associated with the specified key. The child nodes in the range
+ returned cannot be modified. If no such children exist, then
+ the range will be empty.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search range
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">iterator_range</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns a Boost.Range of all child nodes
+ associated with the specified key. The child nodes in the range
+ returned can be modified. If no such children exist, then the
+ range will be empty.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove children
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">size_type</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Removes all child nodes associated with the specified key from
+ the tree node. Returns the number of children removed.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children and their descendants
+ in the range to be removed, plus logarithmic
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.associative_tree_node.models"></a><a class="link" href="associative_tree_node.html#tree_node.concepts.associative_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="reversible_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="non_assoc_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/base_tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/base_tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,953 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Base Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="movable_tree_node.html" title="Movable Tree Node">
+<link rel="next" href="reversible_tree_node.html" title="Reversible Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="movable_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reversible_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.base_tree_node"></a><a class="link" href="base_tree_node.html" title="Base Tree Node">Base Tree Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.base_tree_node.description"></a><a class="link" href="base_tree_node.html#tree_node.concepts.base_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Models of this concept allow the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> adaptor types to parameterically
+ inherit their functionality for greater reuse.
+ </p>
+<p>
+ In practice, each <span class="bold"><strong>Base Tree Node</strong></span> model
+ must do the following:
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ Inherit from either <a class="link" href="../reference/tree_node_base.html" title="tree_node_base&lt;Derived&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">tree_node_base</span></code></a> or the return
+ type of a <a class="link" href="base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base Type Generator</strong></span></a>.
+ </p></li>
+<li class="listitem"><p>
+ Take in the derived type and the data type as template parameters.
+ </p></li>
+<li class="listitem"><p>
+ Also take in the key type if the derived type is (possibly) an <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative
+ Tree Node</strong></span></a> model.
+ </p></li>
+<li class="listitem"><p>
+ Declare a template instantiation of <a class="link" href="../reference/tree_node_base.html" title="tree_node_base&lt;Derived&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">tree_node_base</span></code></a> with the derived
+ type as a <code class="computeroutput"><span class="keyword">friend</span> <span class="keyword">struct</span></code>
+ if it overrides any of <a class="link" href="../reference/tree_node_base.html" title="tree_node_base&lt;Derived&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">tree_node_base</span></code></a> implementation
+ methods.
+ </p></li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.base_tree_node.refinement_of"></a><a class="link" href="base_tree_node.html#tree_node.concepts.base_tree_node.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Base</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Base Tree Node</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">base</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Base</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">const_base</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Base</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a> model that inherits from <code class="computeroutput"><span class="identifier">Base</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">copy</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">source</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">alloc</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator_reference</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">itr</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">BIC</span></code></span></dt>
+<dd><p>
+ A type that models the Boolean Integral Constant concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">bic</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">BIC</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.base_tree_node.types"></a><a class="link" href="base_tree_node.html#tree_node.concepts.base_tree_node.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.base_tree_node.expressions"></a><a class="link" href="base_tree_node.html#tree_node.concepts.base_tree_node.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept, the following expressions
+ must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Derived access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">get_derived</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns a pointer to the same <code class="computeroutput"><span class="identifier">Node</span></code>
+ object.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Derived read-only access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_base</span><span class="special">.</span><span class="identifier">get_derived</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns a pointer to the same immutable <code class="computeroutput"><span class="identifier">Node</span></code>
+ object.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+ Also, the following expressions must be valid (unless the <code class="computeroutput"><span class="identifier">Node</span></code> type does <span class="emphasis"><em>not</em></span>
+ define the operation within which the expression can be invoked).
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type requirements
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Derived copy constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Base</span><span class="special">(</span><span class="identifier">copy</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs a deep copy of the specified node.
+ </p>
+ </td>
+<td>
+ <p>
+ The initializer list of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ copy constructor must be able to call this constructor.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Derived copy constructor with allocator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Base</span><span class="special">(</span><span class="identifier">copy</span><span class="special">,</span>
+ <span class="identifier">alloc</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs a deep copy of the specified node. The new node will
+ use the specified allocator (if the allocator reference type
+ is mutable) or a copy of it (if the allocator reference type
+ is to <code class="computeroutput"><span class="keyword">const</span></code>) to
+ construct its own parent node or its own child nodes if and when
+ invoking its respective creation methods.
+ </p>
+ </td>
+<td>
+ <p>
+ The initializer list of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ copy constructor with allocator must be able to call this constructor.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Derived move constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Base</span><span class="special">(</span><span class="identifier">source</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Transfers the contents of the specified node to this one.
+ </p>
+ </td>
+<td>
+ <p>
+ The initializer list of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ move constructor must be able to call this constructor.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Derived move constructor with allocator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Base</span><span class="special">(</span><span class="identifier">source</span><span class="special">,</span>
+ <span class="identifier">alloc</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Transfers the contents of the specified node to this one. The
+ new node will use the specified allocator (if the allocator reference
+ type is mutable) or a copy of it (if the allocator reference
+ type is to <code class="computeroutput"><span class="keyword">const</span></code>)
+ to construct its own parent node or its own child nodes if and
+ when invoking its respective creation methods.
+ </p>
+ </td>
+<td>
+ <p>
+ The initializer list of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ move constructor with allocator must be able to call this constructor.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Base descendant cloning
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">clone_descendants</span><span class="special">(</span><span class="identifier">copy</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Structurally modifies the invoking node so that it is a deep
+ copy of the specified node.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ copy constructor must be able to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Base descendant movement
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">move_descendants</span><span class="special">(</span><span class="identifier">source</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Structurally modifies the invoking node so that it stores the
+ contents of the specified node.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ move constructor must be able to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Base copy assignment
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">copy_assign</span><span class="special">(</span><span class="identifier">copy</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Structurally modifies the invoking node so that it is a deep
+ copy of the specified node.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ copy assignment operator must be able to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Base move assignment
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">move_assign</span><span class="special">(</span><span class="identifier">source</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Structurally modifies the invoking node so that it stores the
+ contents of the specified node.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ move assignment operator must be able to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Assignment notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_assign</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by <code class="computeroutput"><span class="identifier">Base</span></code>
+ copy or move assignment. In practice, propagates <code class="computeroutput"><span class="identifier">Base</span></code>-specific values affected
+ by the assignment up the tree node's chain of ancestors.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ copy or move assignment operator must be able to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of ancestors
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Key-value modified notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_modify_value</span><span class="special">(</span><span class="identifier">Key</span><span class="special">())</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that modify the value that
+ the tree node associates with the specified key.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span></code>
+ key-value modification function must be able to call this method,
+ and <code class="literal"><a class="link" href="../reference/has_key.html#tree_node.reference.has_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::has_key</a>&lt;Node,Key&gt;</code>
+ must be equivalent to boost::mpl::true_.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of ancestors
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Key-value propagated notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_propagate_value</span><span class="special">(</span><span class="identifier">Key</span><span class="special">())</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that propagate the value
+ that the tree node associates with the specified key up the tree
+ node's chain of ancestors.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal"><a class="link" href="../reference/has_key.html#tree_node.reference.has_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::has_key</a>&lt;Node,Key&gt;</code>
+ must be equivalent to boost::mpl::true_.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of ancestors
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Key-value once-propagated notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_propagate_value_once</span><span class="special">(</span><span class="identifier">Key</span><span class="special">())</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that propagate the value
+ that the tree node associates with the specified key up to the
+ tree node's parent.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal"><a class="link" href="../reference/has_key.html#tree_node.reference.has_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::has_key</a>&lt;Node,Key&gt;</code>
+ must be equivalent to boost::mpl::true_.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Insertion notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_inserted</span><span class="special">(</span><span class="identifier">itr</span><span class="special">,</span>
+ <span class="identifier">bic</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that insert or emplace
+ the invoking node. The specified iterator points to this node.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of any <code class="computeroutput"><span class="identifier">Node</span></code>
+ insertion or emplacement member function must be able to call
+ this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant if <code class="computeroutput"><span class="identifier">BIC</span><span class="special">::</span><span class="identifier">value</span>
+ <span class="special">==</span> <span class="keyword">true</span></code>,
+ linear with respect to the number of siblings otherwise
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Range insertion notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_insert</span><span class="special">(</span><span class="identifier">itr</span><span class="special">,</span>
+ <span class="identifier">itr_end</span><span class="special">,</span>
+ <span class="identifier">bic</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that insert or emplace
+ the nodes in the specified range.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of any <code class="computeroutput"><span class="identifier">Node</span></code>
+ insertion or emplacement member function must be able to call
+ this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant if <code class="computeroutput"><span class="identifier">BIC</span><span class="special">::</span><span class="identifier">value</span>
+ <span class="special">==</span> <span class="keyword">true</span></code>,
+ linear with respect to the number of siblings otherwise
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Erasure notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_erase</span><span class="special">(</span><span class="identifier">bic</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that remove the specified
+ children and their descendants from a node.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of any <code class="computeroutput"><span class="identifier">Node</span></code>
+ erasure member function must be able to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children plus the number
+ of ancestors
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Clear notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_clear</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that remove all descendants
+ from a node.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">clear</span><span class="special">()</span></code> member function must be able
+ to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children removed plus the
+ number of ancestors
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Left rotation notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_rotate_left</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that rotate a node to the
+ left.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">rotate_left</span><span class="special">()</span></code> member function must be able
+ to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of ancestors
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Right rotation notification
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">base</span><span class="special">.</span><span class="identifier">on_post_rotate_right</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Updates any <code class="computeroutput"><span class="identifier">Node</span></code>-specific
+ information invalidated by operations that rotate a node to the
+ right.
+ </p>
+ </td>
+<td>
+ <p>
+ The body of the <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">rotate_right</span><span class="special">()</span></code> member function must be able
+ to call this method.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of ancestors
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.base_tree_node.models"></a><a class="link" href="base_tree_node.html#tree_node.concepts.base_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node_base.html" title="binary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node_base.html" title="nary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count_base.html" title="with_count_base&lt;Derived,BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height_base.html" title="with_height_base&lt;Derived,BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position_base.html" title="with_position_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag_base.html" title="with_red_black_flag_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_base</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="movable_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reversible_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/base_type_generator.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/base_type_generator.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,169 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Base Type Generator</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="node_type_generator.html" title="Node Type Generator">
+<link rel="next" href="tree_node_iterator.html" title="Tree Node Iterator">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="node_type_generator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tree_node_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.base_type_generator"></a><a class="link" href="base_type_generator.html" title="Base Type Generator">Base Type Generator</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.base_type_generator.description"></a><a class="link" href="base_type_generator.html#tree_node.concepts.base_type_generator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ A <span class="bold"><strong>Base Type Generator</strong></span> is a Metafunction Class that returns a <a class="link" href="base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base
+ Tree Node</strong></span></a> from which <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> adaptor types can inherit the necessary
+ functionality.
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Generator</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Base Type Generator</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Derived</span></code></span></dt>
+<dd><p>
+ The most descendant type that will inherit from the return type of
+ <code class="computeroutput"><span class="identifier">Generator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Key</span></code></span></dt>
+<dd><p>
+ The key type of the <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> to be returned.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Data</span></code></span></dt>
+<dd><p>
+ The data type of the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> to be returned.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.base_type_generator.expressions"></a><a class="link" href="base_type_generator.html#tree_node.concepts.base_type_generator.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Non-associative invocation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal">boost::mpl::apply_wrap2&lt;Generator,Derived,Data&gt;::type</code>
+ </p>
+ </td>
+<td>
+ <p>
+ A <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative Tree Node</strong></span></a> model
+ whose <code class="computeroutput"><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code>
+ is the same as <code class="computeroutput"><span class="identifier">Data</span></code>.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Associative invocation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal">boost::mpl::apply_wrap3&lt;Generator,Derived,Key,Data&gt;::type</code>
+ </p>
+ </td>
+<td>
+ <p>
+ An <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> model whose
+ <code class="computeroutput"><span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span></code> is the same as <code class="computeroutput"><span class="identifier">Key</span></code> and whose <code class="computeroutput"><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code> is the same as <code class="computeroutput"><span class="identifier">Data</span></code>.
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.base_type_generator.models"></a><a class="link" href="base_type_generator.html#tree_node.concepts.base_type_generator.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node_base_gen.html" title="binary_node_base_gen&lt;Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node_base_gen.html" title="nary_node_base_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/assoc_node_base_gen.html" title="associative_node_base_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation_base_gen.html" title="with_accumulation_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count_base_gen.html" title="with_count_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height_base_gen.html" title="with_height_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position_base_gen.html" title="with_position_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag_base_gen.html" title="with_red_black_flag_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_base_gen</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="node_type_generator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tree_node_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/binary_tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/binary_tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,617 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Binary Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="non_assoc_tree_node.html" title="Non-Associative Tree Node">
+<link rel="next" href="nary_tree_node.html" title="N-ary Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="non_assoc_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nary_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.binary_tree_node"></a><a class="link" href="binary_tree_node.html" title="Binary Tree Node">Binary Tree Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.binary_tree_node.description"></a><a class="link" href="binary_tree_node.html#tree_node.concepts.binary_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Models of this concept store at most two child nodes: left and right. The
+ operations that this concept defines include access to these children and
+ rotations that use the appropriate child as a pivot node.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.binary_tree_node.refinement_of"></a><a class="link" href="binary_tree_node.html#tree_node.concepts.binary_tree_node.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative
+ Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible
+ Tree Node</strong></span></a>
+ </p></li>
+</ul></div>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Binary Tree Node</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">const_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">rvalue_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Args</span></code></span></dt>
+<dd><p>
+ The type of <code class="computeroutput"><span class="identifier">args</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">args</span></code></span></dt>
+<dd><p>
+ Arguments to be forwarded to the appropriate <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code>
+ constructor.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.binary_tree_node.types"></a><a class="link" href="binary_tree_node.html#tree_node.concepts.binary_tree_node.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative Tree Node</strong></span></a> and <a class="link" href="reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a> concepts.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.binary_tree_node.expressions"></a><a class="link" href="binary_tree_node.html#tree_node.concepts.binary_tree_node.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative Tree Node</strong></span></a> and <a class="link" href="reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a> concepts, the following
+ expressions must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type requirements
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Parent-of-left creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">emplace_parent_of_left</span><span class="special">(</span>
+ boost::forward<span class="special">&lt;</span><span class="identifier">Args</span><span class="special">&gt;(</span><span class="identifier">args</span><span class="special">)...</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Creates and returns a tree node to be stored as the parent of
+ the invoking node. The node returned will initialize its data
+ with the specified arguments. The invoking node will become the
+ left child of the new node.
+ </p>
+ <p>
+ If a parent existed previously, that node shall become the parent
+ of the new node, and the new node shall take the place of the
+ invoking node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent-of-right creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">emplace_parent_of_right</span><span class="special">(</span>
+ boost::forward<span class="special">&lt;</span><span class="identifier">Args</span><span class="special">&gt;(</span><span class="identifier">args</span><span class="special">)...</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Creates and returns a tree node to be stored as the parent of
+ the invoking node. The node returned will initialize its data
+ with the specified arguments. The invoking node will become the
+ right child of the new node.
+ </p>
+ <p>
+ If a parent existed previously, that node shall become the parent
+ of the new node, and the new node shall take the place of the
+ invoking node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Left child creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">emplace_left</span><span class="special">(</span>
+ boost::forward<span class="special">&lt;</span><span class="identifier">Args</span><span class="special">&gt;(</span><span class="identifier">args</span><span class="special">)...</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Creates and returns a tree node to be stored as the left child
+ of the invoking node. The node returned will initialize its data
+ with the specified arguments.
+ </p>
+ <p>
+ If a left child existed previously, that node shall become the
+ left child of the new node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Left child copy creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">insert_left</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Creates and returns a deep copy of <code class="computeroutput"><span class="identifier">const_node</span></code>
+ to be stored as the left child of the invoking node.
+ </p>
+ <p>
+ If a left child existed previously, that node shall become the
+ left-most descendant of the new node, or the first node encountered
+ during a forward in-order traversal of the new node's descendants.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must model the Copy Constructible and Movable
+ concepts.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants of <code class="computeroutput"><span class="identifier">const_node</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Right child creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">emplace_right</span><span class="special">(</span>
+ boost::forward<span class="special">&lt;</span><span class="identifier">Args</span><span class="special">&gt;(</span><span class="identifier">args</span><span class="special">)...</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Creates and returns a tree node to be stored as the right child
+ of the invoking node. The node returned will initialize its data
+ with the specified arguments.
+ </p>
+ <p>
+ If a right child existed previously, that node shall become the
+ right child of the new node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Right child copy creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">insert_right</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Creates and returns a deep copy of <code class="computeroutput"><span class="identifier">const_node</span></code>
+ to be stored as the right child of the invoking node.
+ </p>
+ <p>
+ If a right child existed previously, that node shall become the
+ right-most descendant of the new node, or the last node encountered
+ during a forward in-order traversal of the new node's descendants.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must model the Copy Constructible and Movable
+ concepts.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants of <code class="computeroutput"><span class="identifier">const_node</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Left child read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">get_left_child_ptr</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the left child of the tree node, or a null pointer if
+ no such tree node exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Left child access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">get_left_child_ptr</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the left child of the tree node, or a null pointer if
+ no such tree node exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Right child read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">get_right_child_ptr</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the right child of the tree node, or a null pointer if
+ no such tree node exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Right child access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">get_right_child_ptr</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the right child of the tree node, or a null pointer if
+ no such tree node exists.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Rotate left
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">rotate_left</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Rotates the tree node in its hierarchy so that its right child,
+ the pivot node, becomes its parent. The left child of the pivot
+ node becomes the right child of the tree node. Returns the pivot
+ node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Rotate right
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">rotate_right</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Rotates the tree node in its hierarchy so that its left child,
+ the pivot node, becomes its parent. The right child of the pivot
+ node becomes the left child of the tree node. Returns the pivot
+ node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove left child
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">erase_left</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">void</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Removes the left child from the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants of the left
+ child
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove right child
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">erase_right</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span> </code>`
+ </p>
+ </td>
+<td>
+ <p>
+ Removes the right child from the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants of the right
+ child
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.binary_tree_node.models"></a><a class="link" href="binary_tree_node.html#tree_node.concepts.binary_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node.html" title="binary_node&lt;T,Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node_base.html" title="binary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="non_assoc_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nary_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/copyable_tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/copyable_tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,272 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Copyable Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="tree_node.html" title="Tree Node">
+<link rel="next" href="movable_tree_node.html" title="Movable Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="movable_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.copyable_tree_node"></a><a class="link" href="copyable_tree_node.html" title="Copyable Tree Node">Copyable Tree
+ Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.copyable_tree_node.description"></a><a class="link" href="copyable_tree_node.html#tree_node.concepts.copyable_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Models of this concept are meant for external usage by applications or
+ by other data structures.
+ </p>
+<p>
+ In practice, each <span class="bold"><strong>Copyable Tree Node</strong></span> model
+ must do the following:
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ Inherit from the corresponding <a class="link" href="base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model.
+ </p></li>
+<li class="listitem"><p>
+ Take in the data type as template parameters.
+ </p></li>
+<li class="listitem"><p>
+ Also take in the key type if (possibly) modeling the <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> concept.
+ </p></li>
+<li class="listitem"><p>
+ Use the <a class="link" href="../reference/copyable_and_movable.html" title="BOOST_TREE_NODE_COPYABLE_AND_MOVABLE"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_COPYABLE_AND_MOVABLE</span></code></a>,
+ <a class="link" href="../reference/emplace_ctor_inline_def.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF</span></code></a>,
+ and <a class="link" href="../reference/emplace_ctor_w_alloc_i_def.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF</span></code></a>
+ macros to support C++03 compilers.
+ </p></li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.copyable_tree_node.refinement_of"></a><a class="link" href="copyable_tree_node.html#tree_node.concepts.copyable_tree_node.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a href="http://www.boost.org/libs/utility/CopyConstructible.html" target="_top"><span class="bold"><strong>Copy
+ Constructible</strong></span></a>
+ </p></li>
+</ul></div>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Copyable Tree Node</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">const_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">alloc</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator_reference</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.copyable_tree_node.types"></a><a class="link" href="copyable_tree_node.html#tree_node.concepts.copyable_tree_node.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> and Copy Constructible concepts.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.copyable_tree_node.expressions"></a><a class="link" href="copyable_tree_node.html#tree_node.concepts.copyable_tree_node.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> and Copy Constructible concepts, the following
+ expressions must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type requirements
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Copy constructor
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs a deep copy of the specified node.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must be Copy Constructible, the boost::container::allocator_traits
+ static method <code class="computeroutput"><span class="identifier">select_on_container_copy_construction</span></code>
+ must be callable when passed in the allocator of the specified
+ node, and the allocator reference type must be <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor with allocator
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">(</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">container</span><span class="special">::</span><span class="identifier">allocator_arg</span>
+ <span class="special">,</span> <span class="identifier">alloc</span>
+ <span class="special">,</span> <span class="identifier">const_node</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs a deep copy of the specified node. The new node will
+ use the specified allocator (if the allocator reference type
+ is mutable) or a copy of it (if the allocator reference type
+ is to <code class="computeroutput"><span class="keyword">const</span></code>) to
+ construct its own parent node or its own child nodes if and when
+ invoking its respective creation methods.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must be Copy Constructible.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.copyable_tree_node.models"></a><a class="link" href="copyable_tree_node.html#tree_node.concepts.copyable_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node.html" title="binary_node&lt;T,Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node</span></code></a>
+ if <code class="computeroutput"><span class="identifier">T</span></code> is Copy Constructible
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node.html" title="nary_node&lt;T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node</span></code></a>
+ if <code class="computeroutput"><span class="identifier">T</span></code> is Copy Constructible
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a> if <code class="computeroutput"><span class="identifier">Data</span></code> is Copy Constructible
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation.html" title="with_accumulation&lt;BaseGenerator,T1,T2,AccumulationKey&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation</span></code></a> if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns a <span class="bold"><strong>Copyable Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count.html" title="with_count&lt;BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Copyable Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height.html" title="with_height&lt;BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Copyable Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position.html" title="with_position&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Copyable Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag.html" title="with_red_black_flag&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Copyable Tree Node</strong></span> model
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="movable_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/full_tree_node_iterator.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/full_tree_node_iterator.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,172 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Full Tree Node Iterator</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="tree_node_iterator.html" title="Tree Node Iterator">
+<link rel="next" href="tree_node_desc_iterator.html" title="Tree Node Descendant Iterator">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="tree_node_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tree_node_desc_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.full_tree_node_iterator"></a><a class="link" href="full_tree_node_iterator.html" title="Full Tree Node Iterator">Full Tree
+ Node Iterator</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.full_tree_node_iterator.description"></a><a class="link" href="full_tree_node_iterator.html#tree_node.concepts.full_tree_node_iterator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This concept specifies the requirement that models traverse the root node
+ as well as its descendants.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.full_tree_node_iterator.refinement_of"></a><a class="link" href="full_tree_node_iterator.html#tree_node.concepts.full_tree_node_iterator.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree
+ Node Iterator</strong></span></a>
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Iterator</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Full Tree Node Iterator</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">itr</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ The value type of <code class="computeroutput"><span class="identifier">Iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.full_tree_node_iterator.types"></a><a class="link" href="full_tree_node_iterator.html#tree_node.concepts.full_tree_node_iterator.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the <a class="link" href="tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree Node Iterator</strong></span></a> concept; however, the
+ requirements for the value type are strengthened: it must model the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a>
+ concept.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.full_tree_node_iterator.expressions"></a><a class="link" href="full_tree_node_iterator.html#tree_node.concepts.full_tree_node_iterator.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ None beyond those defined in the <a class="link" href="tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree Node Iterator</strong></span></a> concept; however, the
+ type requirements for the constructors are strengthened, and their semantics
+ are clarified.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Type requirements
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+</tr></thead>
+<tbody><tr>
+<td>
+ <p>
+ Constructor from node
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Iterator</span><span class="special">(</span><span class="identifier">node</span><span class="special">)</span>
+<span class="identifier">Iterator</span> <span class="identifier">itr</span><span class="special">(</span><span class="identifier">node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs an iterator that will iterate through the specified
+ node and its descendants.
+ </p>
+ </td>
+</tr></tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.full_tree_node_iterator.models"></a><a class="link" href="full_tree_node_iterator.html#tree_node.concepts.full_tree_node_iterator.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/breadth_first_iterator.html" title="breadth_first_iterator&lt;Node,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">breadth_first_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/pre_order_iterator.html" title="pre_order_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">pre_order_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/post_order_iterator.html" title="post_order_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">post_order_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/in_order_iterator.html" title="in_order_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">in_order_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/depth_first_iterator.html" title="depth_first_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">depth_first_iterator</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="tree_node_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tree_node_desc_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/indexable_container.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/indexable_container.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,222 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Indexable Container</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="tree_node_desc_iterator.html" title="Tree Node Descendant Iterator">
+<link rel="next" href="indexable_iterator.html" title="Indexable Iterator">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="tree_node_desc_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="indexable_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.indexable_container"></a><a class="link" href="indexable_container.html" title="Indexable Container">Indexable Container</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_container.description"></a><a class="link" href="indexable_container.html#tree_node.concepts.indexable_container.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ An <span class="bold"><strong>Indexable Container</strong></span> is a Reversible Container whose iterator type
+ is an <a class="link" href="indexable_iterator.html" title="Indexable Iterator"><span class="bold"><strong>Indexable
+ Iterator</strong></span></a>. It provides sub-linear time access to arbitrary
+ elements.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_container.refinement_of"></a><a class="link" href="indexable_container.html#tree_node.concepts.indexable_container.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ Reversible Container
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_container.types"></a><a class="link" href="indexable_container.html#tree_node.concepts.indexable_container.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ None beyond those defined in Reversible Container. However, the requirements
+ for the iterator type are strengthened: it must be an <a class="link" href="indexable_iterator.html" title="Indexable Iterator"><span class="bold"><strong>Indexable Iterator</strong></span></a>.
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">X</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Indexable Container</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">a</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">X</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_container.expressions"></a><a class="link" href="indexable_container.html#tree_node.concepts.indexable_container.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the Reversible Container concept, the following
+ expressions must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type Requirements
+ </p>
+ </th>
+<th>
+ <p>
+ Precondition
+ </p>
+ </th>
+<th>
+ <p>
+ Invariant
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody><tr>
+<td>
+ <p>
+ Element access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">a</span><span class="special">[</span><span class="identifier">n</span><span class="special">]</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span></code> if
+ <code class="computeroutput"><span class="identifier">a</span></code> is mutable,
+ <code class="computeroutput"><span class="identifier">const_reference</span></code>
+ otherwise
+ </p>
+ </td>
+<td>
+ <p>
+ Returns the <code class="computeroutput"><span class="identifier">n</span></code>th
+ element from the beginning of the container.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">n</span></code> must be convertible
+ to <code class="computeroutput"><span class="identifier">size_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="number">0</span> <span class="special">&lt;</span>
+ <span class="identifier">n</span> <span class="special">&lt;=</span>
+ <span class="identifier">a</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Equivalent to <code class="computeroutput"><span class="special">*(</span><span class="identifier">a</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span>
+ <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code>.
+ </p>
+ </td>
+<td>
+ <p>
+ Sublinear
+ </p>
+ </td>
+</tr></tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_container.models"></a><a class="link" href="indexable_container.html#tree_node.concepts.indexable_container.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binode_container.html" title="binode_container&lt;NodeGenerator,T,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_container</span></code></a> if the value
+ associated with <a class="link" href="../reference/count_key.html" title="count_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">count_key</span></code></a> exists for the return
+ type of <code class="computeroutput"><span class="identifier">NodeGenerator</span></code>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binode_assoc_container.html" title="binode_associative_container&lt; NodeGenerator , T1 , T2 , IsMultipleAssociative , CompareSelector , Balancer &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_associative_container</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binode_set.html" title="binode_set&lt;NodeGenerator,T,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_set</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binode_map.html" title="binode_map&lt;NodeGenerator,Key,Mapped,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_map</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binode_multiset.html" title="binode_multiset&lt;NodeGenerator,T,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_multiset</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binode_multimap.html" title="binode_multimap&lt;NodeGenerator,Key,Mapped,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_multimap</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="tree_node_desc_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="indexable_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/indexable_iterator.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/indexable_iterator.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,509 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Indexable Iterator</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="indexable_container.html" title="Indexable Container">
+<link rel="next" href="../reference.html" title="Reference">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="indexable_container.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.indexable_iterator"></a><a class="link" href="indexable_iterator.html" title="Indexable Iterator">Indexable Iterator</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_iterator.description"></a><a class="link" href="indexable_iterator.html#tree_node.concepts.indexable_iterator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ An <span class="bold"><strong>Indexable Iterator</strong></span> is an iterator that
+ provides both increment and decrement as well as sublinear-time operators
+ for moving forward and backward in arbitrary-sized steps. The runtime complexity
+ requirement is the only major difference between an <span class="bold"><strong>Indexable
+ Iterator</strong></span> and a Random Access Iterator.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_iterator.refinement_of"></a><a class="link" href="indexable_iterator.html#tree_node.concepts.indexable_iterator.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ Bidirectional Iterator
+ </p></li>
+<li class="listitem"><p>
+ Less-Than Comparable
+ </p></li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_iterator.types"></a><a class="link" href="indexable_iterator.html#tree_node.concepts.indexable_iterator.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the Bidirectional Iterator and Less-Than Comparable concepts.
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Iterator</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Indexable Iterator</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">i</span></code>, <code class="computeroutput"><span class="identifier">j</span></code></span></dt>
+<dd><p>
+ Objects of type <code class="computeroutput"><span class="identifier">Iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">T</span></code></span></dt>
+<dd><p>
+ The value type of <code class="computeroutput"><span class="identifier">Iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">t</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">T</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Distance</span></code></span></dt>
+<dd><p>
+ The distance type of <code class="computeroutput"><span class="identifier">Iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">n</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Distance</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_iterator.expressions"></a><a class="link" href="indexable_iterator.html#tree_node.concepts.indexable_iterator.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the Bidirectional Iterator concept, the following
+ expressions must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type Requirements
+ </p>
+ </th>
+<th>
+ <p>
+ Precondition
+ </p>
+ </th>
+<th>
+ <p>
+ Postcondition
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Iterator addition assignment
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span> <span class="special">+=</span>
+ <span class="identifier">n</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">X</span><span class="special">&amp;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ If <code class="computeroutput"><span class="identifier">n</span> <span class="special">&gt;</span>
+ <span class="number">0</span></code>, equivalent to executing
+ <code class="computeroutput"><span class="special">++</span><span class="identifier">i</span></code>
+ <code class="computeroutput"><span class="identifier">n</span></code> times. If
+ <code class="computeroutput"><span class="identifier">n</span> <span class="special">&lt;</span>
+ <span class="number">0</span></code>, equivalent to executing
+ <code class="computeroutput"><span class="special">--</span><span class="identifier">i</span></code>
+ <code class="computeroutput"><span class="identifier">n</span></code> times. If
+ <code class="computeroutput"><span class="identifier">n</span> <span class="special">==</span>
+ <span class="number">0</span></code>, this is a null operation.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Including <code class="computeroutput"><span class="identifier">i</span></code> itself,
+ there must be <code class="computeroutput"><span class="identifier">n</span></code>
+ dereferenceable or past-the-end iterators following or preceding
+ <code class="computeroutput"><span class="identifier">i</span></code>, depending
+ on whether <code class="computeroutput"><span class="identifier">n</span></code>
+ is positive or negative.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span></code> is dereferenceable
+ or past-the-end.
+ </p>
+ </td>
+<td>
+ <p>
+ Sublinear
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator addition
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span> <span class="special">+</span>
+ <span class="identifier">n</span></code> or <code class="computeroutput"><span class="identifier">n</span> <span class="special">+</span>
+ <span class="identifier">i</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">X</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Equivalent to <code class="computeroutput"><span class="special">{</span> <span class="identifier">X</span> <span class="identifier">tmp</span>
+ <span class="special">=</span> <span class="identifier">i</span><span class="special">;</span> <span class="keyword">return</span>
+ <span class="identifier">tmp</span> <span class="special">+=</span>
+ <span class="identifier">n</span><span class="special">;</span>
+ <span class="special">}</span></code>. The two forms <code class="computeroutput"><span class="identifier">i</span> <span class="special">+</span>
+ <span class="identifier">n</span></code> and <code class="computeroutput"><span class="identifier">n</span> <span class="special">+</span>
+ <span class="identifier">i</span></code> are identical.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Same as for <code class="computeroutput"><span class="identifier">i</span> <span class="special">+=</span> <span class="identifier">n</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The result is dereferenceable or past-the-end.
+ </p>
+ </td>
+<td>
+ <p>
+ Sublinear
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator subtraction assignment
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span> <span class="special">-=</span>
+ <span class="identifier">n</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">X</span><span class="special">&amp;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Equivalent to <code class="computeroutput"><span class="identifier">i</span> <span class="special">+=</span> <span class="special">(-</span><span class="identifier">n</span><span class="special">)</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Including <code class="computeroutput"><span class="identifier">i</span></code> itself,
+ there must be <code class="computeroutput"><span class="identifier">n</span></code>
+ dereferenceable or past-the-end iterators preceding or following
+ <code class="computeroutput"><span class="identifier">i</span></code>, depending
+ on whether <code class="computeroutput"><span class="identifier">n</span></code>
+ is positive or negative.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span></code> is dereferenceable
+ or past-the-end.
+ </p>
+ </td>
+<td>
+ <p>
+ Sublinear
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator subtraction
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span> <span class="special">-</span>
+ <span class="identifier">n</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">X</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Equivalent to <code class="computeroutput"><span class="special">{</span> <span class="identifier">X</span> <span class="identifier">tmp</span>
+ <span class="special">=</span> <span class="identifier">i</span><span class="special">;</span> <span class="keyword">return</span>
+ <span class="identifier">tmp</span> <span class="special">-=</span>
+ <span class="identifier">n</span><span class="special">;</span>
+ <span class="special">}</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Same as for <code class="computeroutput"><span class="identifier">i</span> <span class="special">-=</span> <span class="identifier">n</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The result is dereferenceable or past-the-end.
+ </p>
+ </td>
+<td>
+ <p>
+ Sublinear
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Difference
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span> <span class="special">-</span>
+ <span class="identifier">j</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Distance</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns a number <code class="computeroutput"><span class="identifier">n</span></code>
+ such that <code class="computeroutput"><span class="identifier">i</span> <span class="special">==</span> <span class="identifier">j</span>
+ <span class="special">+</span> <span class="identifier">n</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Either <code class="computeroutput"><span class="identifier">i</span></code> is reachable
+ from <code class="computeroutput"><span class="identifier">j</span></code> or <code class="computeroutput"><span class="identifier">j</span></code> is reachable from <code class="computeroutput"><span class="identifier">i</span></code>, or both.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Sublinear
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Element operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span><span class="special">[</span><span class="identifier">n</span><span class="special">]</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Convertible to <code class="computeroutput"><span class="identifier">T</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Equivalent to <code class="computeroutput"><span class="special">*(</span><span class="identifier">i</span> <span class="special">+</span>
+ <span class="identifier">n</span><span class="special">)</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span> <span class="special">+</span>
+ <span class="identifier">n</span></code> exists and is dereferenceable.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Sublinear
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Element assignment
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span><span class="special">[</span><span class="identifier">n</span><span class="special">]</span>
+ <span class="special">=</span> <span class="identifier">t</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Convertible to <code class="computeroutput"><span class="identifier">T</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Equivalent to <code class="computeroutput"><span class="special">*(</span><span class="identifier">i</span> <span class="special">+</span>
+ <span class="identifier">n</span><span class="special">)</span></code>.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">X</span></code> is mutable.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span> <span class="special">+</span>
+ <span class="identifier">n</span></code> exists and is dereferenceable.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">i</span><span class="special">[</span><span class="identifier">n</span><span class="special">]</span></code>
+ is a copy of <code class="computeroutput"><span class="identifier">t</span></code>.
+ </p>
+ </td>
+<td>
+ <p>
+ Sublinear
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+ In addition, the domain of the less-than comparison expression <code class="computeroutput"><span class="identifier">i</span> <span class="special">&lt;</span> <span class="identifier">j</span></code> is the group of iterators that are
+ reachable from each other: that is, either <code class="computeroutput"><span class="identifier">i</span></code>
+ is reachable from <code class="computeroutput"><span class="identifier">j</span></code> or
+ <code class="computeroutput"><span class="identifier">j</span></code> is reachable from <code class="computeroutput"><span class="identifier">i</span></code>, or both.
+ </p>
+<p>
+ The Forward Iterator and Reverse Iterator requirements that the increment
+ and decrement operators must exhibit constant time complexity have been
+ relaxed; they now need only exhibit linear time complexity with respect
+ to the number of descendants in the worst case.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.indexable_iterator.models"></a><a class="link" href="indexable_iterator.html#tree_node.concepts.indexable_iterator.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ The iterator types of <a class="link" href="../reference/binode_container.html" title="binode_container&lt;NodeGenerator,T,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_container</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ The iterator types of <a class="link" href="../reference/binode_assoc_container.html" title="binode_associative_container&lt; NodeGenerator , T1 , T2 , IsMultipleAssociative , CompareSelector , Balancer &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_associative_container</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="indexable_container.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/movable_tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/movable_tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,270 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Movable Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="copyable_tree_node.html" title="Copyable Tree Node">
+<link rel="next" href="base_tree_node.html" title="Base Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="copyable_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="base_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.movable_tree_node"></a><a class="link" href="movable_tree_node.html" title="Movable Tree Node">Movable Tree Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.movable_tree_node.description"></a><a class="link" href="movable_tree_node.html#tree_node.concepts.movable_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Models of this concept are meant for external usage by applications or
+ by other data structures.
+ </p>
+<p>
+ In practice, each <span class="bold"><strong>Movable Tree Node</strong></span> model
+ must do the following:
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ Inherit from the corresponding <a class="link" href="base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model.
+ </p></li>
+<li class="listitem"><p>
+ Take in the data type as template parameters.
+ </p></li>
+<li class="listitem"><p>
+ Also take in the key type if (possibly) modeling the <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> concept.
+ </p></li>
+<li class="listitem"><p>
+ Use the <a class="link" href="../reference/copyable_and_movable.html" title="BOOST_TREE_NODE_COPYABLE_AND_MOVABLE"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_COPYABLE_AND_MOVABLE</span></code></a>,
+ <a class="link" href="../reference/emplace_ctor_inline_def.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF</span></code></a>,
+ and <a class="link" href="../reference/emplace_ctor_w_alloc_i_def.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF</span></code></a>
+ macros to support C++03 compilers.
+ </p></li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.movable_tree_node.refinement_of"></a><a class="link" href="movable_tree_node.html#tree_node.concepts.movable_tree_node.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ Movable
+ </p></li>
+</ul></div>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Movable Tree Node</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">rvalue_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">alloc</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator_reference</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.movable_tree_node.types"></a><a class="link" href="movable_tree_node.html#tree_node.concepts.movable_tree_node.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> and Movable concepts.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.movable_tree_node.expressions"></a><a class="link" href="movable_tree_node.html#tree_node.concepts.movable_tree_node.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> and Movable concepts, the following expressions
+ must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type requirements
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Move constructor
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">(</span><span class="identifier">rvalue_node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Transfers the contents of the specified node to this one.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must be Movable, the boost::container::allocator_traits static
+ method <code class="computeroutput"><span class="identifier">select_on_container_copy_construction</span></code>
+ must be callable when passed in the allocator of the specified
+ node, and the allocator reference type must be <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Move constructor with allocator
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">(</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">container</span><span class="special">::</span><span class="identifier">allocator_arg</span>
+ <span class="special">,</span> <span class="identifier">alloc</span>
+ <span class="special">,</span> <span class="identifier">rvalue_node</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Transfers the contents of the specified node to this one. The
+ new node will use the specified allocator (if the allocator reference
+ type is mutable) or a copy of it (if the allocator reference
+ type is to <code class="computeroutput"><span class="keyword">const</span></code>)
+ to construct its own parent node or its own child nodes if and
+ when invoking its respective creation methods.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must be Movable.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.movable_tree_node.models"></a><a class="link" href="movable_tree_node.html#tree_node.concepts.movable_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node.html" title="binary_node&lt;T,Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node</span></code></a>
+ if <code class="computeroutput"><span class="identifier">T</span></code> is Movable
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node.html" title="nary_node&lt;T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node</span></code></a>
+ if <code class="computeroutput"><span class="identifier">T</span></code> is Movable
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a> if <code class="computeroutput"><span class="identifier">Data</span></code> is Movable
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation.html" title="with_accumulation&lt;BaseGenerator,T1,T2,AccumulationKey&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation</span></code></a> if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns a <span class="bold"><strong>Movable Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count.html" title="with_count&lt;BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Movable Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height.html" title="with_height&lt;BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Movable Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position.html" title="with_position&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Movable Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag.html" title="with_red_black_flag&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Movable Tree Node</strong></span> model
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="copyable_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="base_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/nary_tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/nary_tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,392 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>N-ary Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="binary_tree_node.html" title="Binary Tree Node">
+<link rel="next" href="node_type_generator.html" title="Node Type Generator">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="binary_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="node_type_generator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.nary_tree_node"></a><a class="link" href="nary_tree_node.html" title="N-ary Tree Node">N-ary Tree Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.nary_tree_node.description"></a><a class="link" href="nary_tree_node.html#tree_node.concepts.nary_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Models of this concept store arbitrary numbers of children and provide
+ simple child insertion expressions.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.nary_tree_node.refinement_of"></a><a class="link" href="nary_tree_node.html#tree_node.concepts.nary_tree_node.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative
+ Tree Node</strong></span></a>
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>N-ary Tree Node</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">dest_node</span></code>, <code class="computeroutput"><span class="identifier">src_node</span></code></span></dt>
+<dd><p>
+ Objects of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">const_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">rvalue_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">pos</span></code>, <code class="computeroutput"><span class="identifier">itr</span></code>, <code class="computeroutput"><span class="identifier">itr_end</span></code></span></dt>
+<dd><p>
+ Objects of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Args</span></code></span></dt>
+<dd><p>
+ The type of <code class="computeroutput"><span class="identifier">args</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">args</span></code></span></dt>
+<dd><p>
+ Arguments to be forwarded to the appropriate <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code>
+ constructor.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.nary_tree_node.types"></a><a class="link" href="nary_tree_node.html#tree_node.concepts.nary_tree_node.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative Tree Node</strong></span></a> concept.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.nary_tree_node.expressions"></a><a class="link" href="nary_tree_node.html#tree_node.concepts.nary_tree_node.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative Tree Node</strong></span></a> concept, the following
+ expressions must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Requirements
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Child creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">dest_node</span><span class="special">.</span><span class="identifier">emplace</span><span class="special">(</span>
+ boost::forward<span class="special">&lt;</span><span class="identifier">Args</span><span class="special">&gt;(</span><span class="identifier">args</span><span class="special">)...</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Creates and returns a tree node to be stored in the range of
+ children of <code class="computeroutput"><span class="identifier">dest_node</span></code>.
+ The node returned will initialize its data with the specified
+ arguments.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child copy creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">dest_node</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Creates and returns a deep copy of <code class="computeroutput"><span class="identifier">const_node</span></code>
+ to be stored in the range of children of <code class="computeroutput"><span class="identifier">dest_node</span></code>.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must model the Copy Constructible and Movable
+ concepts.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of descendants of <code class="computeroutput"><span class="identifier">const_node</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child move insertion
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">dest_node</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">rvalue_node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Stores <code class="computeroutput"><span class="identifier">rvalue_node</span></code>
+ in the range of children of <code class="computeroutput"><span class="identifier">dest_node</span></code>.
+ </p>
+ </td>
+<td>
+ <p>
+ The data type must model the Movable concept.
+ </p>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Splice node
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">dest_node</span><span class="special">.</span><span class="identifier">splice</span><span class="special">(</span><span class="identifier">pos</span><span class="special">,</span> <span class="identifier">src_node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+ <p>
+ A Boost.Range whose element type
+ is <code class="computeroutput"><span class="identifier">Node</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Transfers all child nodes and their descendants from <code class="computeroutput"><span class="identifier">src_node</span></code> to <code class="computeroutput"><span class="identifier">dest_node</span></code>,
+ with <code class="computeroutput"><span class="identifier">pos</span></code> as the
+ insertion point. Returns the range of child nodes inserted.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pos</span></code> must be dereferenceable
+ or past-the-end of the range of children of <code class="computeroutput"><span class="identifier">dest_node</span></code>.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children of <code class="computeroutput"><span class="identifier">src_node</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Splice single child
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">dest_node</span><span class="special">.</span><span class="identifier">splice</span><span class="special">(</span><span class="identifier">pos</span><span class="special">,</span> <span class="identifier">src_node</span><span class="special">,</span> <span class="identifier">itr</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+ <p>
+ A Boost.Range whose element type
+ is <code class="computeroutput"><span class="identifier">Node</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Transfers the child node to which <code class="computeroutput"><span class="identifier">itr</span></code>
+ points, along with its descendants, from <code class="computeroutput"><span class="identifier">src_node</span></code>
+ to <code class="computeroutput"><span class="identifier">dest_node</span></code>,
+ with <code class="computeroutput"><span class="identifier">pos</span></code> as the
+ insertion point. Returns a range containing the node inserted.
+ </p>
+ </td>
+<td>
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <code class="computeroutput"><span class="identifier">pos</span></code> must
+ be dereferenceable or past-the-end of the range of children
+ of <code class="computeroutput"><span class="identifier">dest_node</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ <code class="computeroutput"><span class="identifier">itr</span></code> must
+ point to a valid child node of <code class="computeroutput"><span class="identifier">src_node</span></code>.
+ </p></li>
+</ul></div>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Splice range
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">dest_node</span><span class="special">.</span><span class="identifier">splice</span><span class="special">(</span>
+ <span class="identifier">pos</span>
+ <span class="special">,</span> <span class="identifier">src_node</span>
+ <span class="special">,</span> <span class="identifier">itr</span>
+ <span class="special">,</span> <span class="identifier">itr_end</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+ <p>
+ A Boost.Range whose element type
+ is <code class="computeroutput"><span class="identifier">Node</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Transfers all child nodes in the specified sub-range, along with
+ their descendants, from <code class="computeroutput"><span class="identifier">src_node</span></code>
+ to <code class="computeroutput"><span class="identifier">dest_node</span></code>,
+ with <code class="computeroutput"><span class="identifier">pos</span></code> as the
+ insertion point. Returns the range of child nodes inserted.
+ </p>
+ </td>
+<td>
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <code class="computeroutput"><span class="identifier">pos</span></code> must
+ be dereferenceable or past-the-end of the range of children
+ of <code class="computeroutput"><span class="identifier">dest_node</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ <code class="computeroutput"><span class="identifier">itr</span></code> and
+ <code class="computeroutput"><span class="identifier">itr_end</span></code> must
+ refer to a valid sub-range of the range of children of <code class="computeroutput"><span class="identifier">src_node</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ <code class="computeroutput"><span class="identifier">pos</span></code> must
+ point outside the sub-range referred to by <code class="computeroutput"><span class="identifier">itr</span></code> and <code class="computeroutput"><span class="identifier">itr_end</span></code>.
+ </p></li>
+</ul></div>
+ </td>
+<td>
+ <p>
+ Linear with respect to the size of the specified sub-range
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.nary_tree_node.models"></a><a class="link" href="nary_tree_node.html#tree_node.concepts.nary_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node.html" title="nary_node&lt;T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node_base.html" title="nary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="binary_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="node_type_generator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/node_type_generator.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/node_type_generator.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,163 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Node Type Generator</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="nary_tree_node.html" title="N-ary Tree Node">
+<link rel="next" href="base_type_generator.html" title="Base Type Generator">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="nary_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="base_type_generator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.node_type_generator"></a><a class="link" href="node_type_generator.html" title="Node Type Generator">Node Type Generator</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.node_type_generator.description"></a><a class="link" href="node_type_generator.html#tree_node.concepts.node_type_generator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ A <span class="bold"><strong>Node Type Generator</strong></span> is a Metafunction Class that returns a <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a>
+ model of which objects can be instantiated.
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Generator</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Node Type Generator</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Key</span></code></span></dt>
+<dd><p>
+ The key type of the <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> to be returned.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Data</span></code></span></dt>
+<dd><p>
+ The data type of the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> to be returned.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.node_type_generator.expressions"></a><a class="link" href="node_type_generator.html#tree_node.concepts.node_type_generator.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Non-associative invocation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal">boost::mpl::apply_wrap1&lt;Generator,Data&gt;::type</code>
+ </p>
+ </td>
+<td>
+ <p>
+ A <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative Tree Node</strong></span></a> model
+ whose <code class="computeroutput"><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code>
+ is the same as <code class="computeroutput"><span class="identifier">Data</span></code>.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Associative invocation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal">boost::mpl::apply_wrap2&lt;Generator,Key,Data&gt;::type</code>
+ </p>
+ </td>
+<td>
+ <p>
+ An <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> model whose
+ <code class="computeroutput"><span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span></code> is the same as <code class="computeroutput"><span class="identifier">Key</span></code> and whose <code class="computeroutput"><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code> is the same as <code class="computeroutput"><span class="identifier">Data</span></code>.
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.node_type_generator.models"></a><a class="link" href="node_type_generator.html#tree_node.concepts.node_type_generator.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node_gen.html" title="binary_node_gen&lt;Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node_gen.html" title="nary_node_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node_gen.html" title="associative_node_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation_gen.html" title="with_accumulation_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count_gen.html" title="with_count_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height_gen.html" title="with_height_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position_gen.html" title="with_position_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag_gen.html" title="with_red_black_flag_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_gen</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="nary_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="base_type_generator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/non_assoc_tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/non_assoc_tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,104 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Non-Associative Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="associative_tree_node.html" title="Associative Tree Node">
+<link rel="next" href="binary_tree_node.html" title="Binary Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="associative_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binary_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.non_assoc_tree_node"></a><a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node">Non-Associative
+ Tree Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.non_assoc_tree_node.description"></a><a class="link" href="non_assoc_tree_node.html#tree_node.concepts.non_assoc_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Models of this concept provide access to their child nodes via iterator
+ dereferencing.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.non_assoc_tree_node.refinement_of"></a><a class="link" href="non_assoc_tree_node.html#tree_node.concepts.non_assoc_tree_node.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.non_assoc_tree_node.types"></a><a class="link" href="non_assoc_tree_node.html#tree_node.concepts.non_assoc_tree_node.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept; however, the requirements
+ for the child iterator types are strengthened:
+ </p>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>
+ must be <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></li>
+<li class="listitem"><p>
+ The value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>
+ must be <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.non_assoc_tree_node.expressions"></a><a class="link" href="non_assoc_tree_node.html#tree_node.concepts.non_assoc_tree_node.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ None beyond those defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.non_assoc_tree_node.models"></a><a class="link" href="non_assoc_tree_node.html#tree_node.concepts.non_assoc_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node.html" title="binary_node&lt;T,Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node_base.html" title="binary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node.html" title="nary_node&lt;T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node_base.html" title="nary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="associative_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binary_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/reversible_tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/reversible_tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,421 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Reversible Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="base_tree_node.html" title="Base Tree Node">
+<link rel="next" href="associative_tree_node.html" title="Associative Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="base_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="associative_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.reversible_tree_node"></a><a class="link" href="reversible_tree_node.html" title="Reversible Tree Node">Reversible Tree
+ Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.reversible_tree_node.description"></a><a class="link" href="reversible_tree_node.html#tree_node.concepts.reversible_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Objects of types that model both the <a class="link" href="tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree Node Iterator</strong></span></a> and Bidirectional Iterator concepts can iterate
+ over objects of types that model this concept.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.reversible_tree_node.refinement_of"></a><a class="link" href="reversible_tree_node.html#tree_node.concepts.reversible_tree_node.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Reversible Tree Node</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">const_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.reversible_tree_node.types"></a><a class="link" href="reversible_tree_node.html#tree_node.concepts.reversible_tree_node.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ Two new types are introduced.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+<th>
+ <p>
+ Requirements
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Reverse iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">reverse_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of iterator used to iterate in reverse through the children
+ of a <code class="computeroutput"><span class="identifier">Node</span></code> object.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Bidirectional Iterator concept,
+ and it must be convertible to <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span></code>.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable reverse iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of iterator used to iterate in reverse through the children
+ of a <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span></code>
+ object.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Bidirectional Iterator concept,
+ and it must <span class="emphasis"><em>not</em></span> point to a mutable object.
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+ In addition, the requirements for the iterator types are strengthened:
+ they must also model the Bidirectional Iterator concept.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.reversible_tree_node.expressions"></a><a class="link" href="reversible_tree_node.html#tree_node.concepts.reversible_tree_node.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept, the following expressions
+ must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type Requirements
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Children reverse range begin read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">crbegin</span><span class="special">()</span>
+<span class="identifier">const_node</span><span class="special">.</span><span class="identifier">rbegin</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to the beginning of the reverse
+ range of children of the tree node. If the range is empty, then
+ the iterator points past-the-end.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children reverse range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">.</span><span class="identifier">rbegin</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">reverse_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to the beginning of the reverse
+ range of children of the tree node. If the range is empty, then
+ the iterator points past-the-end.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children reverse range past-the-end read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">crend</span><span class="special">()</span>
+<span class="identifier">const_node</span><span class="special">.</span><span class="identifier">rend</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing past the end of the reverse range
+ of children of the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children reverse range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">.</span><span class="identifier">rend</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">reverse_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing past the end of the reverse range
+ of children of the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.reversible_tree_node.models"></a><a class="link" href="reversible_tree_node.html#tree_node.concepts.reversible_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node.html" title="binary_node&lt;T,Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node_base.html" title="binary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node.html" title="nary_node&lt;T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node</span></code></a>
+ if <code class="literal">boost::container_gen&lt;Selector,<a class="link" href="../reference/nary_node.html" title="nary_node&lt;T,Selector&gt;">tree_node::nary_node</a>&gt;::type</code>
+ returns a Reversible Container model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node_base.html" title="nary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base</span></code></a>
+ if <code class="literal">boost::container_gen&lt;Selector,Derived&gt;::type</code>
+ returns a Reversible Container model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a> if <code class="literal">boost::container_gen&lt;Selector,Key,<a class="link" href="../reference/associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;">tree_node::associative_node</a>&gt;::type</code>
+ returns a Reversible Container model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a> if
+ <code class="literal">boost::container_gen&lt;Selector,Key,Derived&gt;::type</code>
+ returns a Reversible Container model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation.html" title="with_accumulation&lt;BaseGenerator,T1,T2,AccumulationKey&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation</span></code></a> if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a> if
+ <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count.html" title="with_count&lt;BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count_base.html" title="with_count_base&lt;Derived,BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height.html" title="with_height&lt;BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height_base.html" title="with_height_base&lt;Derived,BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_base</span></code></a> if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position.html" title="with_position&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position_base.html" title="with_position_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_base</span></code></a> if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag.html" title="with_red_black_flag&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag</span></code></a>
+ if <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag_base.html" title="with_red_black_flag_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_base</span></code></a> if
+ <code class="computeroutput"><span class="identifier">BaseGenerator</span></code> returns
+ a <span class="bold"><strong>Reversible Tree Node</strong></span> model
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="base_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="associative_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,946 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Tree Node</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="../concepts.html" title="Concepts">
+<link rel="next" href="copyable_tree_node.html" title="Copyable Tree Node">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="copyable_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.tree_node"></a><a class="link" href="tree_node.html" title="Tree Node">Tree Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node.description"></a><a class="link" href="tree_node.html#tree_node.concepts.tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ All tree node implementations that this library provides model this concept:
+ a structure that maintains information about its data and its immediate
+ parent-child relationships. However, in practice, a full-fledged tree node
+ data structure or adaptor consists of four components: a <a class="link" href="base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model that defines the functionality,
+ a <a class="link" href="base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base
+ Type Generator</strong></span></a> that returns the <a class="link" href="base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> model from which adaptor types
+ can also inherit, a <span class="bold"><strong>Tree Node</strong></span> model that
+ inherits from the base type and is better suited for external usage, and
+ a <a class="link" href="node_type_generator.html" title="Node Type Generator"><span class="bold"><strong>Node
+ Type Generator</strong></span></a> that returns the <span class="bold"><strong>Tree
+ Node</strong></span> model.
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Tree Node</strong></span> concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">const_node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">alloc</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator_reference</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Args</span></code></span></dt>
+<dd><p>
+ The type of <code class="computeroutput"><span class="identifier">args</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">args</span></code></span></dt>
+<dd><p>
+ Arguments to be forwarded to the appropriate <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code>
+ constructor.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node.types"></a><a class="link" href="tree_node.html#tree_node.concepts.tree_node.types" title="Associated Types">Associated Types</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+<th>
+ <p>
+ Requirements
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Super type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">super_t</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type from which <code class="computeroutput"><span class="identifier">Node</span></code>
+ inherits its functionality.
+ </p>
+ </td>
+<td>
+ <p>
+ It must either be <code class="literal"><a class="link" href="../reference/tree_node_base.html" title="tree_node_base&lt;Derived&gt;">tree_node::tree_node_base</a>&lt;Node&gt;</code>
+ or model the <a class="link" href="base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of user data stored in a tree node.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Allocator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that defines the memory model to be used by the child
+ creation methods for creating <code class="computeroutput"><span class="identifier">Node</span></code>
+ objects.
+ </p>
+ </td>
+<td>
+ <p>
+ It must be a valid boost::container::allocator_traits template
+ argument.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Allocator reference type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator_reference</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type to which <code class="computeroutput"><span class="identifier">alloc</span></code>
+ will be bound if passed to the emplacement constructor.
+ </p>
+ </td>
+<td>
+ <p>
+ It must be either <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator</span><span class="special">&amp;</span></code> or <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator</span>
+ <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a pointer to a <code class="computeroutput"><span class="identifier">Node</span></code>
+ object.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Trivial Iterator concept, it must
+ point to a mutable object, and it must be implicitly convertible
+ to <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_pointer</span></code>.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer-to-const type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a pointer to a <code class="computeroutput"><span class="identifier">Node</span>
+ <span class="keyword">const</span></code> object.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Trivial Iterator concept, and
+ it must <span class="emphasis"><em>not</em></span> point to a mutable object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of iterator used to iterate through the children of
+ a <code class="computeroutput"><span class="identifier">Node</span></code> object.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Input Iterator concept, and it
+ must be convertible to <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of iterator used to iterate through the children of
+ a <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span></code>
+ object.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Input Iterator concept, and it
+ must <span class="emphasis"><em>not</em></span> point to a mutable object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Size type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">size_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of unsigned integer used to represent the number of
+ children of a <code class="computeroutput"><span class="identifier">Node</span>
+ <span class="keyword">const</span></code> object.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node.expressions"></a><a class="link" href="tree_node.html#tree_node.concepts.tree_node.expressions" title="Valid Expressions and Semantics">Valid Expressions
+ and Semantics</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ Type Requirements
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Emplacement constructor
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">(</span>boost::forward<span class="special">&lt;</span><span class="identifier">Args</span><span class="special">&gt;(</span><span class="identifier">args</span><span class="special">)...)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs a <code class="computeroutput"><span class="identifier">Node</span></code>
+ object that initializes its user data with the specified arguments.
+ </p>
+ </td>
+<td>
+ <p>
+ The allocator type must be Default Constructible, and the
+ allocator reference type must be <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator</span>
+ <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Emplacement constructor with allocator
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">(</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">container</span><span class="special">::</span><span class="identifier">allocator_arg</span>
+ <span class="special">,</span> <span class="identifier">alloc</span>
+ <span class="special">,</span> boost::forward<span class="special">&lt;</span><span class="identifier">Args</span><span class="special">&gt;(</span><span class="identifier">args</span><span class="special">)...</span>
+<span class="special">)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs a <code class="computeroutput"><span class="identifier">Node</span></code>
+ object that initializes its user data with the specified arguments.
+ The new node will use the specified allocator (if the allocator
+ reference type is mutable) or a copy of it (if the allocator
+ reference type is to <code class="computeroutput"><span class="keyword">const</span></code>)
+ to construct its own parent node or its own child nodes if and
+ when invoking its respective creation methods.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">get</span><span class="special">&lt;</span><a class="link" href="../reference/data_key.html" title="data_key">tree_node::data_key</a><span class="special">&gt;(</span><span class="identifier">const_node</span><span class="special">)</span>
+<span class="identifier">get</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">,</span> <a class="link" href="../reference/data_key.html" title="data_key">tree_node::data_key</a><span class="special">())</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the user data stored in the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">get</span><span class="special">&lt;</span><a class="link" href="../reference/data_key.html" title="data_key">tree_node::data_key</a><span class="special">&gt;(</span><span class="identifier">node</span><span class="special">)</span>
+<span class="identifier">get</span><span class="special">(</span><span class="identifier">node</span><span class="special">,</span> <a class="link" href="../reference/data_key.html" title="data_key">tree_node::data_key</a><span class="special">())</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span><span class="special">&amp;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the user data stored in the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data modification
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">put</span><span class="special">(</span><span class="identifier">node</span><span class="special">,</span> <a class="link" href="../reference/data_key.html" title="data_key">tree_node::data_key</a><span class="special">(),</span> <span class="identifier">data</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">void</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Sets the user data to be stored in the tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ The type of <code class="computeroutput"><span class="identifier">data</span></code>
+ must be convertible to <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">traits</span><span class="special">::</span><span class="identifier">data_type</span></code>.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Key-value read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">get</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">&gt;(</span><span class="identifier">const_node</span><span class="special">)</span>
+<span class="identifier">get</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">,</span> <span class="identifier">Key</span><span class="special">())</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><a class="link" href="../reference/at_key.html#tree_node.reference.at_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::at_key</a><span class="special">&lt;</span>
+ <span class="identifier">Node</span> <span class="keyword">const</span>
+ <span class="special">,</span> <span class="identifier">Key</span>
+<span class="special">&gt;::</span><span class="identifier">type</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the value that the tree node associates with the specified
+ key.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal"><a class="link" href="../reference/has_key.html#tree_node.reference.has_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::has_key</a>&lt;Node,Key&gt;</code>
+ must be equivalent to boost::mpl::true_.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Key-value access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">get</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">&gt;(</span><span class="identifier">node</span><span class="special">)</span>
+<span class="identifier">get</span><span class="special">(</span><span class="identifier">node</span><span class="special">,</span> <span class="identifier">Key</span><span class="special">())</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><a class="link" href="../reference/at_key.html#tree_node.reference.at_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::at_key</a><span class="special">&lt;</span>
+ <span class="identifier">Node</span>
+ <span class="special">,</span> <span class="identifier">Key</span>
+<span class="special">&gt;::</span><span class="identifier">type</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the value that the tree node associates with the specified
+ key.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal"><a class="link" href="../reference/has_key.html#tree_node.reference.has_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::has_key</a>&lt;Node,Key&gt;</code>
+ must be equivalent to boost::mpl::true_.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Key-value modification
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">put</span><span class="special">(</span><span class="identifier">node</span><span class="special">,</span> <span class="identifier">Key</span><span class="special">(),</span> <span class="identifier">value</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">void</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Sets the value to be associated with the specified key type in
+ the tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal"><a class="link" href="../reference/has_key.html#tree_node.reference.has_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::has_key</a>&lt;Node,Key&gt;</code>
+ must be equivalent to boost::mpl::true_, and the type
+ of <code class="computeroutput"><span class="identifier">value</span></code> must
+ be convertible to <code class="literal"><a class="link" href="../reference/value_at_key.html" title="result_of::value_at_key&lt;Node,Key&gt;">tree_node::value_at_key</a>&lt;Node,Key&gt;::type</code>.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">get_parent_ptr</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns a pointer to the parent of the tree node, or a null pointer
+ if the node is the root.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">get_parent_ptr</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns a pointer to the parent of the tree node, or a null pointer
+ if the node is the root.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">cbegin</span><span class="special">()</span>
+<span class="identifier">const_node</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to the beginning of the range of
+ children of the tree node. If the range is empty, then the iterator
+ points past-the-end.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing to the beginning of the range of
+ children of the tree node. If the range is empty, then the iterator
+ points past-the-end.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">cend</span><span class="special">()</span>
+<span class="identifier">const_node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing past the end of the range of children
+ of the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">iterator</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing past the end of the range of children
+ of the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range size query
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">size_type</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Returns the number of children of the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Leaf node query
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">empty</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">bool</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Equivalent to <code class="computeroutput"><span class="identifier">const_node</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">==</span>
+ <span class="identifier">const_node</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>,
+ but may be more efficient in certain cases.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove all descendants
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">node</span><span class="special">.</span><span class="identifier">clear</span><span class="special">()</span>
+</pre>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">void</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Removes all children and their descendants from the tree node.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children and their descendants
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node.models"></a><a class="link" href="tree_node.html#tree_node.concepts.tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node.html" title="binary_node&lt;T,Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/binary_node_base.html" title="binary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node.html" title="nary_node&lt;T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/nary_node_base.html" title="nary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation.html" title="with_accumulation&lt;BaseGenerator,T1,T2,AccumulationKey&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count.html" title="with_count&lt;BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_count_base.html" title="with_count_base&lt;Derived,BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height.html" title="with_height&lt;BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_height_base.html" title="with_height_base&lt;Derived,BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position.html" title="with_position&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_position_base.html" title="with_position_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag.html" title="with_red_black_flag&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/with_rb_flag_base.html" title="with_red_black_flag_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_base</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="copyable_tree_node.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node_desc_iterator.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node_desc_iterator.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,173 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Tree Node Descendant Iterator</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="full_tree_node_iterator.html" title="Full Tree Node Iterator">
+<link rel="next" href="indexable_container.html" title="Indexable Container">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="full_tree_node_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="indexable_container.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.tree_node_desc_iterator"></a><a class="link" href="tree_node_desc_iterator.html" title="Tree Node Descendant Iterator">Tree Node
+ Descendant Iterator</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_desc_iterator.description"></a><a class="link" href="tree_node_desc_iterator.html#tree_node.concepts.tree_node_desc_iterator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This concept may seem redundant at first, especially when iterating through
+ <a class="link" href="non_assoc_tree_node.html" title="Non-Associative Tree Node"><span class="bold"><strong>Non-Associative
+ Tree Node</strong></span></a> objects; however, for <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> objects, models of
+ this concept provide the sole means of accessing the key associated with
+ each node being traversed. (Root nodes are not associated with keys at
+ the tree node level, so models of this concept do not traverse them.)
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_desc_iterator.refinement_of"></a><a class="link" href="tree_node_desc_iterator.html#tree_node.concepts.tree_node_desc_iterator.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree
+ Node Iterator</strong></span></a>
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Iterator</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Tree Node Descendant Iterator</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">itr</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_desc_iterator.types"></a><a class="link" href="tree_node_desc_iterator.html#tree_node.concepts.tree_node_desc_iterator.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the <a class="link" href="tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree Node Iterator</strong></span></a> concept; however, the
+ requirements for the value type are strengthened: it must be the appropriate
+ iterator type of <code class="computeroutput"><span class="identifier">Node</span></code>.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_desc_iterator.expressions"></a><a class="link" href="tree_node_desc_iterator.html#tree_node.concepts.tree_node_desc_iterator.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ None beyond those defined in the <a class="link" href="tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree Node Iterator</strong></span></a> concept; however, the
+ type requirements for the constructors are strengthened, and their semantics
+ are clarified.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Type requirements
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+</tr></thead>
+<tbody><tr>
+<td>
+ <p>
+ Constructor from node
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Iterator</span><span class="special">(</span><span class="identifier">node</span><span class="special">)</span>
+<span class="identifier">Iterator</span> <span class="identifier">itr</span><span class="special">(</span><span class="identifier">node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs an iterator that will iterate through the descendants
+ of the specified node.
+ </p>
+ </td>
+</tr></tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_desc_iterator.models"></a><a class="link" href="tree_node_desc_iterator.html#tree_node.concepts.tree_node_desc_iterator.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../reference/breadth_first_desc_iter.html" title="breadth_first_descendant_iterator&lt;Node,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">breadth_first_descendant_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/pre_order_desc_iter.html" title="pre_order_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">pre_order_descendant_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/post_order_desc_iter.html" title="post_order_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">post_order_descendant_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../reference/depth_first_desc_iter.html" title="depth_first_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">depth_first_descendant_iterator</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="full_tree_node_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="indexable_container.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node_iterator.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node_iterator.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,262 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Tree Node Iterator</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="base_type_generator.html" title="Base Type Generator">
+<link rel="next" href="full_tree_node_iterator.html" title="Full Tree Node Iterator">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="base_type_generator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="full_tree_node_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.tree_node_iterator"></a><a class="link" href="tree_node_iterator.html" title="Tree Node Iterator">Tree Node Iterator</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_iterator.description"></a><a class="link" href="tree_node_iterator.html#tree_node.concepts.tree_node_iterator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Tree-traversing iterators at the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> level must be created differently
+ from iterators at the Container level. Furthermore, tree node
+ iterators typically store more stateful information than their Container counterparts; requiring two of
+ them to check for dereferenceability may prove somewhat memory-inefficient.
+ This concept provides an alternate means of checking for dereferenceability
+ that requires the use of only the active iterator.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_iterator.refinement_of"></a><a class="link" href="tree_node_iterator.html#tree_node.concepts.tree_node_iterator.refinement_of" title="Refinement of">Refinement
+ of</a>
+</h4></div></div></div>
+<p>
+ Forward Iterator
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Iterator</span></code></span></dt>
+<dd><p>
+ A type that models the <span class="bold"><strong>Tree Node Iterator</strong></span>
+ concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">itr</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Iterator</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Node</span></code></span></dt>
+<dd><p>
+ A type that models the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">node</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>.
+ </p></dd>
+</dl>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_iterator.types"></a><a class="link" href="tree_node_iterator.html#tree_node.concepts.tree_node_iterator.types" title="Associated Types">Associated
+ Types</a>
+</h4></div></div></div>
+<p>
+ No additional types beyond those defined in the Forward Iterator concept.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_iterator.expressions"></a><a class="link" href="tree_node_iterator.html#tree_node.concepts.tree_node_iterator.expressions" title="Valid Expressions and Semantics">Valid
+ Expressions and Semantics</a>
+</h4></div></div></div>
+<p>
+ In addition to the expressions defined in the Forward Iterator concept, the following
+ expressions must be valid.
+ </p>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Return Type
+ </p>
+ </th>
+<th>
+ <p>
+ Semantics
+ </p>
+ </th>
+<th>
+ <p>
+ <a href="http://en.wikipedia.org/wiki/Amortized_analysis" target="_top">Runtime
+ Complexity</a>
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Default constructor
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Iterator</span><span class="special">()</span>
+<span class="identifier">Iterator</span> <span class="identifier">itr</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs a non-dereferenceable (past-the-end) iterator.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor from node
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">Iterator</span><span class="special">(</span><span class="identifier">node</span><span class="special">)</span>
+<span class="identifier">Iterator</span> <span class="identifier">itr</span><span class="special">(</span><span class="identifier">node</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Refinement-specific.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Dereferenceability
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">itr</span>
+</pre>
+ </td>
+<td>
+ <p>
+ A type that can be used in a boolean context.
+ </p>
+ </td>
+<td>
+ <p>
+ Returns a value convertible to <code class="computeroutput"><span class="keyword">true</span></code>
+ if <code class="computeroutput"><span class="identifier">itr</span></code> is dereferenceable,
+ a value convertible to <code class="computeroutput"><span class="keyword">false</span></code>
+ if it is past-the-end.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Node dereference
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><a class="link" href="../reference/dereference_iterator.html" title="dereference_iterator()">tree_node::dereference_iterator</a><span class="special">(</span><span class="identifier">itr</span><span class="special">)</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">&amp;</span></code>
+ or <code class="computeroutput"><span class="identifier">Node</span> <span class="keyword">const</span><span class="special">&amp;</span></code>, depending on the mutability
+ of <code class="computeroutput"><span class="identifier">itr</span></code>.
+ </p>
+ </td>
+<td>
+ <p>
+ Returns a reference to the <a class="link" href="tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> to which <code class="computeroutput"><span class="identifier">itr</span></code> currently points.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+<p>
+ The Forward Iterator requirement that the increment
+ operators must exhibit constant time complexity has been relaxed; they
+ now need only exhibit linear time complexity with respect to the number
+ of descendants in the worst case.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.tree_node_iterator.models"></a><a class="link" href="tree_node_iterator.html#tree_node.concepts.tree_node_iterator.models" title="Models">Models</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ All models of the <a class="link" href="full_tree_node_iterator.html" title="Full Tree Node Iterator"><span class="bold"><strong>Full Tree Node Iterator</strong></span></a> concept.
+ </p></li>
+<li class="listitem"><p>
+ All models of the <a class="link" href="tree_node_desc_iterator.html" title="Tree Node Descendant Iterator"><span class="bold"><strong>Tree Node Descendant Iterator</strong></span></a> concept.
+ </p></li>
+</ul></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="base_type_generator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="full_tree_node_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,409 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Reference</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="prev" href="concepts/indexable_iterator.html" title="Indexable Iterator">
+<link rel="next" href="reference/binode_container.html" title="binode_container&lt;NodeGenerator,T,Balancer&gt;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="concepts/indexable_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/binode_container.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="tree_node.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
+</h2></div></div></div>
+<h4>
+<a name="tree_node.reference.h0"></a>
+ <span class="phrase"><a name="tree_node.reference.container_types"></a></span><a class="link" href="reference.html#tree_node.reference.container_types">Container
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/binode_container.html" title="binode_container&lt;NodeGenerator,T,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_container</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binode_assoc_container.html" title="binode_associative_container&lt; NodeGenerator , T1 , T2 , IsMultipleAssociative , CompareSelector , Balancer &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_associative_container</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binode_set.html" title="binode_set&lt;NodeGenerator,T,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_set</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binode_multiset.html" title="binode_multiset&lt;NodeGenerator,T,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_multiset</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binode_map.html" title="binode_map&lt;NodeGenerator,Key,Mapped,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_map</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binode_multimap.html" title="binode_multimap&lt;NodeGenerator,Key,Mapped,CompareSelector,Balancer&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binode_multimap</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h1"></a>
+ <span class="phrase"><a name="tree_node.reference.balancer_types"></a></span><a class="link" href="reference.html#tree_node.reference.balancer_types">Balancer
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/null_balancer.html" title="null_balancer"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">null_balancer</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/red_black_balancer.html" title="red_black_balancer"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">red_black_balancer</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/avl_balancer.html" title="adelson_velskii_landis_balancer"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">adelson_velskii_landis_balancer</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h2"></a>
+ <span class="phrase"><a name="tree_node.reference.node_types"></a></span><a class="link" href="reference.html#tree_node.reference.node_types">Node
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_node.html" title="binary_node&lt;T,Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/nary_node.html" title="nary_node&lt;T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h3"></a>
+ <span class="phrase"><a name="tree_node.reference.adaptor_types"></a></span><a class="link" href="reference.html#tree_node.reference.adaptor_types">Adaptor
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/with_accumulation.html" title="with_accumulation&lt;BaseGenerator,T1,T2,AccumulationKey&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_count.html" title="with_count&lt;BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_height.html" title="with_height&lt;BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_position.html" title="with_position&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_rb_flag.html" title="with_red_black_flag&lt;BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h4"></a>
+ <span class="phrase"><a name="tree_node.reference.base_types"></a></span><a class="link" href="reference.html#tree_node.reference.base_types">Base
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_node_base.html" title="binary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/nary_node_base.html" title="nary_node_base&lt;Derived,T,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_count_base.html" title="with_count_base&lt;Derived,BaseGenerator,T1,T2,Count&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_height_base.html" title="with_height_base&lt;Derived,BaseGenerator,T1,T2,Height&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_position_base.html" title="with_position_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_rb_flag_base.html" title="with_red_black_flag_base&lt;Derived,BaseGenerator,T1,T2&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_base</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/tree_node_base.html" title="tree_node_base&lt;Derived&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">tree_node_base</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h5"></a>
+ <span class="phrase"><a name="tree_node.reference.type_generators"></a></span><a class="link" href="reference.html#tree_node.reference.type_generators">Type
+ Generators</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_node_gen.html" title="binary_node_gen&lt;Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_node_base_gen.html" title="binary_node_base_gen&lt;Size,AllocatorSelector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_node_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/nary_node_gen.html" title="nary_node_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/nary_node_base_gen.html" title="nary_node_base_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">nary_node_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/associative_node_gen.html" title="associative_node_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/assoc_node_base_gen.html" title="associative_node_base_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_accumulation_gen.html" title="with_accumulation_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_accumulation_base_gen.html" title="with_accumulation_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_count_gen.html" title="with_count_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_count_base_gen.html" title="with_count_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_count_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_height_gen.html" title="with_height_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_height_base_gen.html" title="with_height_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_height_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_position_gen.html" title="with_position_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_position_base_gen.html" title="with_position_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_position_base_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_rb_flag_gen.html" title="with_red_black_flag_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_gen</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/with_rb_flag_base_gen.html" title="with_red_black_flag_base_gen&lt;BaseGenerator&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_red_black_flag_base_gen</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h6"></a>
+ <span class="phrase"><a name="tree_node.reference.iterator_types"></a></span><a class="link" href="reference.html#tree_node.reference.iterator_types">Iterator
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/breadth_first_iterator.html" title="breadth_first_iterator&lt;Node,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">breadth_first_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/breadth_first_desc_iter.html" title="breadth_first_descendant_iterator&lt;Node,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">breadth_first_descendant_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/pre_order_iterator.html" title="pre_order_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">pre_order_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/pre_order_desc_iter.html" title="pre_order_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">pre_order_descendant_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/post_order_iterator.html" title="post_order_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">post_order_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/post_order_desc_iter.html" title="post_order_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">post_order_descendant_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/in_order_iterator.html" title="in_order_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">in_order_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/depth_first_iterator.html" title="depth_first_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">depth_first_iterator</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/depth_first_desc_iter.html" title="depth_first_descendant_iterator&lt;Node,IsReverse&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">depth_first_descendant_iterator</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h7"></a>
+ <span class="phrase"><a name="tree_node.reference.selector_types"></a></span><a class="link" href="reference.html#tree_node.reference.selector_types">Selector
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>
+ <a class="link" href="reference/compare_selector.html" title="compare_selector&lt;Key&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">compare_selector</span></code></a>
+ </p></li></ul></div>
+<h4>
+<a name="tree_node.reference.h8"></a>
+ <span class="phrase"><a name="tree_node.reference.enum_types"></a></span><a class="link" href="reference.html#tree_node.reference.enum_types">Enum
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>
+ <a class="link" href="reference/traversal_state.html" title="traversal_state"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">traversal_state</span></code></a>
+ </p></li></ul></div>
+<h4>
+<a name="tree_node.reference.h9"></a>
+ <span class="phrase"><a name="tree_node.reference.key_types"></a></span><a class="link" href="reference.html#tree_node.reference.key_types">Key
+ Types</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/data_key.html" title="data_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">data_key</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/accumulation_key.html" title="accumulation_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">accumulation_key</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/count_key.html" title="count_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">count_key</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/height_key.html" title="height_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">height_key</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/position_key.html" title="position_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">position_key</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/red_black_flag_key.html" title="red_flag_key and black_flag_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">red_flag_key</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/red_black_flag_key.html" title="red_flag_key and black_flag_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">black_flag_key</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h10"></a>
+ <span class="phrase"><a name="tree_node.reference.algorithms"></a></span><a class="link" href="reference.html#tree_node.reference.algorithms">Algorithms</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/advance_binary.html" title="advance_binary()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">advance_binary</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_index_of.html" title="binary_index_of()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_index_of</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_descendant.html" title="binary_descendant()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_descendant</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_descendant_at_index.html" title="binary_descendant_at_index()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_descendant_at_index</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_lower_bound.html" title="binary_lower_bound()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_lower_bound</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/binary_upper_bound.html" title="binary_upper_bound()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">binary_upper_bound</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/cartesian_sort.html" title="cartesian_sort()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">cartesian_sort</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/cartesian_sort_range.html" title="cartesian_sort_range()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">cartesian_sort_range</span><span class="special">()</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h11"></a>
+ <span class="phrase"><a name="tree_node.reference.intrinsic_functions"></a></span><a class="link" href="reference.html#tree_node.reference.intrinsic_functions">Intrinsic
+ Functions</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/dereference_iterator.html" title="dereference_iterator()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">dereference_iterator</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/get_properties.html" title="get_properties()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">get_properties</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/has_key.html" title="has_key()"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">has_key</span><span class="special">()</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/at_key.html" title="at_key&lt;Key&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">at_key</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h12"></a>
+ <span class="phrase"><a name="tree_node.reference.metafunctions"></a></span><a class="link" href="reference.html#tree_node.reference.metafunctions">Metafunctions</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/dereference_iterator.html#tree_node.reference.dereference_iterator.result_of" title="Return Type Metafunction Synopsis"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">dereference_iterator</span><span class="special">&lt;&gt;</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/get_properties.html#tree_node.reference.get_properties.result_of" title="Return Type Metafunction Synopsis"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">get_properties</span><span class="special">&lt;&gt;</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/has_key.html#tree_node.reference.has_key.result_of" title="Return Type Metafunction Synopsis"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">has_key</span><span class="special">&lt;&gt;</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/get_keys.html" title="result_of::get_keys&lt;Node&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">get_keys</span><span class="special">&lt;&gt;</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/at_key.html#tree_node.reference.at_key.result_of" title="Return Type Metafunction Synopsis"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">at_key</span><span class="special">&lt;&gt;</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/value_at_key.html" title="result_of::value_at_key&lt;Node,Key&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">result_of</span><span class="special">::</span><span class="identifier">value_at_key</span><span class="special">&lt;&gt;</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h13"></a>
+ <span class="phrase"><a name="tree_node.reference.boilerplate_macros"></a></span><a class="link" href="reference.html#tree_node.reference.boilerplate_macros">Boilerplate
+ Macros</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/copyable_and_movable.html" title="BOOST_TREE_NODE_COPYABLE_AND_MOVABLE"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_COPYABLE_AND_MOVABLE</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/container_derived_body.html" title="BOOST_TREE_NODE_CONTAINER_DERIVED_BODY"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_CONTAINER_DERIVED_BODY</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/assoc_cont_derived_body.html" title="BOOST_TREE_NODE_ASSOCIATIVE_CONTAINER_DERIVED_BODY"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_ASSOCIATIVE_CONTAINER_DERIVED_BODY</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h14"></a>
+ <span class="phrase"><a name="tree_node.reference.workaround_macros"></a></span><a class="link" href="reference.html#tree_node.reference.workaround_macros">Workaround
+ Macros</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/emplace_ctor_fwd_decl.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_FWD_DECL"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_FWD_DECL</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/emplace_ctor_inline_hdr.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_HDR"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_HEADER</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/emplace_ctor_inline_def.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_INLINE_DEF</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/emplace_ctor_w_alloc_f_dcl.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_FWD_DECL"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_FWD_DECL</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/emplace_ctor_w_alloc_i_hdr.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_HEADER"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_HEADER</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/emplace_ctor_w_alloc_i_def.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_EMPLACEMENT_CTOR_W_ALLOC_INLINE_DEF</span></code></a>
+ </p></li>
+</ul></div>
+<h4>
+<a name="tree_node.reference.h15"></a>
+ <span class="phrase"><a name="tree_node.reference.feature_querying_macros"></a></span><a class="link" href="reference.html#tree_node.reference.feature_querying_macros">Feature
+ Querying Macros</a>
+ </h4>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="reference/can_use_fusion.html" title="BOOST_TREE_NODE_CAN_USE_FUSION"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_CAN_USE_FUSION</span></code></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="reference/can_use_fusion_with_typeof.html" title="BOOST_TREE_NODE_CAN_USE_FUSION_WITH_TYPEOF"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_CAN_USE_FUSION_WITH_TYPEOF</span></code></a>
+ </p></li>
+</ul></div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="concepts/indexable_iterator.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/binode_container.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/accumulation_key.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/accumulation_key.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,240 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>accumulation_key</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="data_key.html" title="data_key">
+<link rel="next" href="count_key.html" title="count_key">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="data_key.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="count_key.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.accumulation_key"></a><a class="link" href="accumulation_key.html" title="accumulation_key"><code class="computeroutput"><span class="identifier">accumulation_key</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.accumulation_key.synopsis"></a><a class="link" href="accumulation_key.html#tree_node.reference.accumulation_key.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tree_node</span> <span class="special">{</span>
+
+
+ <span class="keyword">template</span> <span class="special">&lt;</span>
+ <span class="keyword">typename</span> <span class="identifier">Key</span> <span class="special">=</span> <span class="identifier">data_key</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Tag</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">accumulators</span><span class="special">::</span><span class="identifier">tag</span><span class="special">::</span><span class="identifier">sum</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">IncludesAllDescendants</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">true_</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">IncludesRoot</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">true_</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Value</span> <span class="special">=</span> <span class="keyword">void</span>
+ <span class="special">&gt;</span>
+ <span class="keyword">struct</span> <span class="identifier">accumulation_key</span>
+ <span class="special">{</span>
+ <span class="keyword">typedef</span> <span class="identifier">Key</span> <span class="identifier">key</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Tag</span> <span class="identifier">tag</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">IncludesAllDescendants</span> <span class="identifier">includes_all_descendants</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">IncludesRoot</span> <span class="identifier">includes_root</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Value</span> <span class="identifier">value</span><span class="special">;</span>
+ <span class="special">};</span>
+
+ <span class="keyword">typedef</span> <span class="identifier">accumulation_key</span><span class="special">&lt;&gt;</span> <span class="identifier">default_accumulation_key</span><span class="special">;</span>
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.accumulation_key.description"></a><a class="link" href="accumulation_key.html#tree_node.reference.accumulation_key.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Use this type to access statistical data stored in <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> objects of types ultimately inheriting
+ from <a class="link" href="with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a>.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.accumulation_key.definition"></a><a class="link" href="accumulation_key.html#tree_node.reference.accumulation_key.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/key/accumulation.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ To register under Boost.Typeof:
+ </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/typeof/boost/tree_node/key/accumulation.hpp<span class="special">&gt;</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.accumulation_key.tpl_param"></a><a class="link" href="accumulation_key.html#tree_node.reference.accumulation_key.tpl_param" title="Template Parameters">Template
+ Parameters</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Parameter
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+<th>
+ <p>
+ Requirements
+ </p>
+ </th>
+<th>
+ <p>
+ Default
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Key</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type used to access the data to be accumulated.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal"><a class="link" href="has_key.html#tree_node.reference.has_key.result_of" title="Return Type Metafunction Synopsis">tree_node::result_of::has_key</a>&lt;Node,Key&gt;</code>
+ must evaluate to boost::mpl::true_ for some <code class="computeroutput"><span class="identifier">Node</span> <span class="identifier">node</span></code>
+ storing the desired data.
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="data_key.html" title="data_key"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">data_key</span></code></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Tag</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of the actual computation.
+ </p>
+ </td>
+<td>
+ <p>
+ It must be a valid Boost.Accumulators feature.
+ </p>
+ </td>
+<td>
+ <p>
+ boost::accumulators::tag::sum
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">IncludesAllDescendants</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Configures the <a class="link" href="with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a>
+ to include all descendants of a target node for statistical evaluation
+ if set to boost::mpl::true_; otherwise, only
+ the node's immediate children will be included.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Boolean Integral Constant concept.
+ </p>
+ </td>
+<td>
+ <p>
+ boost::mpl::true_
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">IncludesRoot</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Configures the <a class="link" href="with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a>
+ to include a target node along with its children/descendants
+ for statistical evaluation if set to boost::mpl::true_; otherwise, the
+ node will be excluded from evaluation.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Boolean Integral Constant concept.
+ </p>
+ </td>
+<td>
+ <p>
+ boost::mpl::true_
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Value</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of the accumulated result. If left unspecified, the
+ <a class="link" href="with_accumulation_base.html" title="with_accumulation_base&lt; Derived , BaseGenerator , T1 , T2 , Key , Tag , IncludesAllDescendants , IncludesRoot , Value &gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">with_accumulation_base</span></code></a>
+ will use the type of the data to be accumulated.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="data_key.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="count_key.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/advance_binary.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/advance_binary.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,71 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>advance_binary()</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="red_black_flag_key.html" title="red_flag_key and black_flag_key">
+<link rel="next" href="binary_index_of.html" title="binary_index_of()">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="red_black_flag_key.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binary_index_of.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.advance_binary"></a><a class="link" href="advance_binary.html" title="advance_binary()"><code class="computeroutput"><span class="identifier">advance_binary</span><span class="special">()</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.advance_binary.synopsis"></a><a class="link" href="advance_binary.html#tree_node.reference.advance_binary.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tree_node</span> <span class="special">{</span>
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">NodePointer</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Difference</span><span class="special">&gt;</span>
+ <span class="identifier">NodePointer</span>
+ <span class="identifier">advance_binary</span><span class="special">(</span>
+ <span class="identifier">NodePointer</span> <span class="identifier">node_ptr</span>
+ <span class="special">,</span> <span class="identifier">Difference</span> <span class="identifier">difference</span>
+ <span class="special">,</span> <span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">root_ptr</span>
+ <span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">NodePointer</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Difference</span><span class="special">&gt;</span>
+ <span class="identifier">NodePointer</span> <span class="identifier">advance_binary</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="identifier">node_ptr</span><span class="special">,</span> <span class="identifier">Difference</span> <span class="identifier">difference</span><span class="special">);</span>
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.advance_binary.description"></a><a class="link" href="advance_binary.html#tree_node.reference.advance_binary.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ TODO.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.advance_binary.definition"></a><a class="link" href="advance_binary.html#tree_node.reference.advance_binary.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/algorithm/advance_binary.hpp<span class="special">&gt;</span>
+</pre>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="red_black_flag_key.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binary_index_of.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/assoc_cont_derived_body.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/assoc_cont_derived_body.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,97 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>BOOST_TREE_NODE_ASSOCIATIVE_CONTAINER_DERIVED_BODY</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="container_derived_body.html" title="BOOST_TREE_NODE_CONTAINER_DERIVED_BODY">
+<link rel="next" href="emplace_ctor_fwd_decl.html" title="BOOST_TREE_NODE_EMPLACEMENT_CTOR_FWD_DECL">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="container_derived_body.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="emplace_ctor_fwd_decl.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.assoc_cont_derived_body"></a><a class="link" href="assoc_cont_derived_body.html" title="BOOST_TREE_NODE_ASSOCIATIVE_CONTAINER_DERIVED_BODY"><code class="computeroutput"><span class="identifier">BOOST_TREE_NODE_ASSOCIATIVE_CONTAINER_DERIVED_BODY</span></code>
+ </a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_cont_derived_body.synopsis"></a><a class="link" href="assoc_cont_derived_body.html#tree_node.reference.assoc_cont_derived_body.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">BOOST_TREE_NODE_ASSOCIATIVE_CONTAINER_DERIVED_BODY</span><span class="special">(</span><span class="identifier">Derived</span><span class="special">,</span> <span class="identifier">Base</span><span class="special">)</span> <span class="special">\</span>
+ <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">Base</span><span class="special">::</span><span class="identifier">key_type</span> <span class="identifier">key_type</span><span class="special">;</span> <span class="special">\</span>
+ <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">Base</span><span class="special">::</span><span class="identifier">value_type</span> <span class="identifier">value_type</span><span class="special">;</span> <span class="special">\</span>
+ <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">Base</span><span class="special">::</span><span class="identifier">key_compare</span> <span class="identifier">key_compare</span><span class="special">;</span> <span class="special">\</span>
+ <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">Base</span><span class="special">::</span><span class="identifier">value_compare</span> <span class="identifier">value_compare</span><span class="special">;</span> <span class="special">\</span>
+ <span class="identifier">BOOST_TREE_NODE_CONTAINER_DERIVED_BODY</span><span class="special">(</span><span class="identifier">Derived</span><span class="special">,</span> <span class="identifier">Base</span><span class="special">)</span> <span class="special">\</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_cont_derived_body.description"></a><a class="link" href="assoc_cont_derived_body.html#tree_node.reference.assoc_cont_derived_body.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Meant to be used in the <code class="computeroutput"><span class="keyword">public</span></code>
+ scope of an Associative Container model that inherits
+ from another.
+ </p>
+<p>
+ This macro defines the type definitions; the default, copy, and move constructors;
+ and the copy and move assignment operators necessary for the <code class="computeroutput"><span class="identifier">Derived</span></code> class to model the Default Constructible, Copy Constructible, Assignable, Movable, and Associative Container concepts.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_cont_derived_body.usage"></a><a class="link" href="assoc_cont_derived_body.html#tree_node.reference.assoc_cont_derived_body.usage" title="Usage">Usage</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="identifier">BOOST_TREE_NODE_ASSOCIATIVE_CONTAINER_DERIVED_BODY</span><span class="special">(</span><span class="identifier">Derived</span><span class="special">,</span> <span class="identifier">Base</span><span class="special">)</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_cont_derived_body.arguments"></a><a class="link" href="assoc_cont_derived_body.html#tree_node.reference.assoc_cont_derived_body.arguments" title="Arguments">Arguments</a>
+</h4></div></div></div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl class="variablelist">
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Derived</span></code></span></dt>
+<dd><p>
+ The name of the enclosing type.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Base</span></code></span></dt>
+<dd><p>
+ The name of the type from which <code class="computeroutput"><span class="identifier">Derived</span></code>
+ inherits.
+ </p></dd>
+</dl>
+</div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_cont_derived_body.definition"></a><a class="link" href="assoc_cont_derived_body.html#tree_node.reference.assoc_cont_derived_body.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/preprocessor.hpp<span class="special">&gt;</span>
+</pre>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="container_derived_body.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="emplace_ctor_fwd_decl.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/assoc_node_base_gen.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/assoc_node_base_gen.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,193 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>associative_node_base_gen&lt;Selector&gt;</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;">
+<link rel="next" href="with_accumulation.html" title="with_accumulation&lt;BaseGenerator,T1,T2,AccumulationKey&gt;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="associative_node_base.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="with_accumulation.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.assoc_node_base_gen"></a><a class="link" href="assoc_node_base_gen.html" title="associative_node_base_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">associative_node_base_gen</span><span class="special">&lt;</span><span class="identifier">Selector</span><span class="special">&gt;</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_node_base_gen.synopsis"></a><a class="link" href="assoc_node_base_gen.html#tree_node.reference.assoc_node_base_gen.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">tree_node</span> <span class="special">{</span>
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Selector</span> <span class="special">=</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">ptr_mapS</span><span class="special">&gt;</span>
+ <span class="keyword">struct</span> <span class="identifier">associative_node_base_gen</span>
+ <span class="special">{</span>
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">Derived</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Key</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Data</span><span class="special">&gt;</span>
+ <span class="keyword">struct</span> <span class="identifier">apply</span>
+ <span class="special">{</span>
+ <span class="keyword">typedef</span> <span class="identifier">associative_node_base</span><span class="special">&lt;</span><span class="identifier">Derived</span><span class="special">,</span><span class="identifier">Key</span><span class="special">,</span><span class="identifier">Data</span><span class="special">,</span><span class="identifier">Selector</span><span class="special">&gt;</span> <span class="identifier">type</span><span class="special">;</span>
+ <span class="special">};</span>
+ <span class="special">};</span>
+
+ <span class="keyword">typedef</span> <span class="identifier">associative_node_base_gen</span><span class="special">&lt;&gt;</span> <span class="identifier">associative_node_base_default_gen</span><span class="special">;</span>
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_node_base_gen.description"></a><a class="link" href="assoc_node_base_gen.html#tree_node.reference.assoc_node_base_gen.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Minimalist selector that can be passed on to generic functions and/or data
+ structures that use models of the <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> and <a class="link" href="../concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base Tree Node</strong></span></a> concepts.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_node_base_gen.definition"></a><a class="link" href="assoc_node_base_gen.html#tree_node.reference.assoc_node_base_gen.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/associative_node.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ To register under Boost.Typeof:
+ </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/typeof/boost/tree_node/associative_node.hpp<span class="special">&gt;</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_node_base_gen.model_of"></a><a class="link" href="assoc_node_base_gen.html#tree_node.reference.assoc_node_base_gen.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="../concepts/base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base
+ Type Generator</strong></span></a>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_node_base_gen.tpl_param"></a><a class="link" href="assoc_node_base_gen.html#tree_node.reference.assoc_node_base_gen.tpl_param" title="Template Parameters">Template
+ Parameters</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Parameter
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+<th>
+ <p>
+ Requirements
+ </p>
+ </th>
+<th>
+ <p>
+ Default
+ </p>
+ </th>
+</tr></thead>
+<tbody><tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Selector</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines the child container type of <a class="link" href="associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a>.
+ </p>
+ </td>
+<td>
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <code class="literal">boost::is_recursive_selector&lt;Selector&gt;</code>
+ must evaluate to boost::mpl::true_.
+ </p></li>
+<li class="listitem"><p>
+ <code class="literal">boost::is_associative_selector&lt;Selector&gt;</code>
+ must evaluate to boost::mpl::true_.
+ </p></li>
+</ul></div>
+ </td>
+<td>
+ <p>
+ boost::ptr_mapS
+ </p>
+ </td>
+</tr></tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_node_base_gen.expressions"></a><a class="link" href="assoc_node_base_gen.html#tree_node.reference.assoc_node_base_gen.expressions" title="Expression Semantics">Expression
+ Semantics</a>
+</h4></div></div></div>
+<p>
+ Let <code class="computeroutput"><span class="identifier">Derived</span></code> be the type
+ that will inherit from <a class="link" href="associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a>.
+ </p>
+<p>
+ Let <code class="computeroutput"><span class="identifier">Key</span></code> be the key type.
+ </p>
+<p>
+ Let <code class="computeroutput"><span class="identifier">Data</span></code> be the user data
+ type.
+ </p>
+<p>
+ Let <code class="computeroutput"><span class="identifier">Selector</span></code> be a valid
+ <code class="computeroutput"><span class="identifier">associative_node_base_gen</span></code>
+ template argument.
+ </p>
+<pre class="programlisting"><span class="keyword">typedef</span> boost::mpl::apply_wrap3<span class="special">&lt;</span>
+ <span class="identifier">associative_node_base_gen</span><span class="special">&lt;</span><span class="identifier">Selector</span><span class="special">&gt;</span>
+ <span class="special">,</span> <span class="identifier">Derived</span>
+ <span class="special">,</span> <span class="identifier">Key</span>
+ <span class="special">,</span> <span class="identifier">Data</span>
+<span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">r</span><span class="special">;</span>
+</pre>
+<p>
+ <span class="bold"><strong>Return type:</strong></span> <code class="literal"><a class="link" href="associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;">tree_node::associative_node_base</a>&lt;Derived,Key,Data,Selector&gt;</code>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.assoc_node_base_gen.complexity"></a><a class="link" href="assoc_node_base_gen.html#tree_node.reference.assoc_node_base_gen.complexity" title="Complexity">Complexity</a>
+</h4></div></div></div>
+<p>
+ Compile time.
+ </p>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="associative_node_base.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="with_accumulation.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/associative_node.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/associative_node.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,1178 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>associative_node&lt;Key,Data,Selector&gt;</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="nary_node_base_gen.html" title="nary_node_base_gen&lt;Selector&gt;">
+<link rel="next" href="associative_node_gen.html" title="associative_node_gen&lt;Selector&gt;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="nary_node_base_gen.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="associative_node_gen.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.associative_node"></a><a class="link" href="associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">associative_node</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">,</span><span class="identifier">Data</span><span class="special">,</span><span class="identifier">Selector</span><span class="special">&gt;</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node.description"></a><a class="link" href="associative_node.html#tree_node.reference.associative_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This class template is suitable for classes or algorithms that need to
+ map keys to child nodes in a tree node data structure. Objects of this
+ type can be stored by value, and their children can be accessed by their
+ associated keys for fast lookup.
+ </p>
+<p>
+ If the user data type models the Fusion Associative Sequence concept, then
+ each of the elements within can be also be obtained through key-value access
+ and set through key-value modification as defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept; more specifically, for
+ some object <code class="computeroutput"><span class="identifier">node</span></code> of type
+ <code class="computeroutput"><span class="identifier">Node</span></code> such that <code class="computeroutput"><span class="identifier">Node</span></code> is a template instantiation of
+ <code class="computeroutput"><span class="identifier">associative_node</span></code>, then
+ for any type <code class="computeroutput"><span class="identifier">Key</span></code> such that
+ <code class="literal">boost::fusion::has_key&lt;Key&gt;(get&lt;<a class="link" href="data_key.html" title="data_key">tree_node::data_key</a>&gt;(node))</code>
+ returns <code class="computeroutput"><span class="keyword">true</span></code>, so does <code class="literal"><a class="link" href="has_key.html" title="has_key()">tree_node::has_key</a>&lt;Key&gt;(node)</code>.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node.definition"></a><a class="link" href="associative_node.html#tree_node.reference.associative_node.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/associative_node.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ Forward-declared:
+ </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/associative_node_fwd.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ To register under Boost.Typeof:
+ </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/typeof/boost/tree_node/associative_node.hpp<span class="special">&gt;</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node.tpl_param"></a><a class="link" href="associative_node.html#tree_node.reference.associative_node.tpl_param" title="Template Parameters">Template
+ Parameters</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Parameter
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+<th>
+ <p>
+ Requirements
+ </p>
+ </th>
+<th>
+ <p>
+ Default
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Key</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a key object to be associated with a child of a
+ <code class="computeroutput"><span class="identifier">associative_node</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Data</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of the user data to be stored in an <code class="computeroutput"><span class="identifier">associative_node</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Selector</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines the child container type.
+ </p>
+ </td>
+<td>
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <code class="literal">boost::is_recursive_selector&lt;Selector&gt;</code>
+ must evaluate to boost::mpl::true_.
+ </p></li>
+<li class="listitem"><p>
+ <code class="literal">boost::is_associative_selector&lt;Selector&gt;</code>
+ must evaluate to boost::mpl::true_.
+ </p></li>
+</ul></div>
+ </td>
+<td>
+ <p>
+ boost::ptr_mapS
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node.model_of"></a><a class="link" href="associative_node.html#tree_node.reference.associative_node.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible
+ Tree Node</strong></span></a> if <code class="literal">boost::container_gen&lt;Selector,Key,associative_node&gt;::type</code>
+ returns a Reversible Container model
+ </p></li>
+<li class="listitem"><p>
+ Default Constructible if <code class="computeroutput"><span class="identifier">Data</span></code> is Default Constructible
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../concepts/copyable_tree_node.html" title="Copyable Tree Node"><span class="bold"><strong>Copyable
+ Tree Node</strong></span></a> if <code class="computeroutput"><span class="identifier">Data</span></code>
+ is Copy Constructible
+ </p></li>
+<li class="listitem"><p>
+ Assignable
+ if <code class="computeroutput"><span class="identifier">Data</span></code> is Copy Constructible and Movable
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../concepts/movable_tree_node.html" title="Movable Tree Node"><span class="bold"><strong>Movable
+ Tree Node</strong></span></a> if <code class="computeroutput"><span class="identifier">Data</span></code>
+ is Movable
+ </p></li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node.public_bases"></a><a class="link" href="associative_node.html#tree_node.reference.associative_node.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="identifier">associative_node_base</span><span class="special">&lt;</span>
+ <span class="identifier">associative_node</span><span class="special">&lt;</span><span class="identifier">Key</span><span class="special">,</span><span class="identifier">Data</span><span class="special">,</span><span class="identifier">Selector</span><span class="special">&gt;</span>
+ <span class="special">,</span> <span class="identifier">Key</span>
+ <span class="special">,</span> <span class="identifier">Data</span>
+ <span class="special">,</span> <span class="identifier">Selector</span>
+<span class="special">&gt;</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node.members"></a><a class="link" href="associative_node.html#tree_node.reference.associative_node.members" title="Public Members">Public
+ Members</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Definition
+ </p>
+ </th>
+<th>
+ <p>
+ Where defined
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Super type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="identifier">associative_node_base</span><span class="special">&lt;</span>
+ <span class="identifier">associative_node</span>
+ <span class="special">,</span> <span class="identifier">Key</span>
+ <span class="special">,</span> <span class="identifier">Data</span>
+ <span class="special">,</span> <span class="identifier">Selector</span>
+ <span class="special">&gt;</span>
+ <span class="identifier">super_t</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Key type, data type, iterator range type, immutable iterator
+ range type, allocator type, allocator reference type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">super_t</span><span class="special">::</span><span class="identifier">traits</span>
+ <span class="identifier">traits</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">super_t</span><span class="special">::</span><span class="identifier">pointer</span>
+ <span class="identifier">pointer</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer-to-const type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">super_t</span><span class="special">::</span><span class="identifier">const_pointer</span>
+ <span class="identifier">const_pointer</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">super_t</span><span class="special">::</span><span class="identifier">iterator</span>
+ <span class="identifier">iterator</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable iterator type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">super_t</span><span class="special">::</span><span class="identifier">const_iterator</span>
+ <span class="identifier">const_iterator</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Reverse iterator type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">children</span><span class="special">::</span><span class="identifier">reverse_iterator</span> <span class="identifier">reverse_iterator</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable reverse iterator type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">children</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span>
+ <span class="identifier">const_reverse_iterator</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Emplacement constructor
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="special">...</span><span class="identifier">Args</span><span class="special">&gt;</span>
+<span class="keyword">explicit</span> <span class="identifier">associative_node</span><span class="special">(</span><span class="identifier">Args</span><span class="special">&amp;&amp;</span> <span class="special">...</span><span class="identifier">args</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Emplacement constructor with allocator
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="special">...</span><span class="identifier">Args</span><span class="special">&gt;</span>
+<span class="keyword">explicit</span> <span class="identifier">associative_node</span><span class="special">(</span>
+ <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">container</span><span class="special">::</span><span class="identifier">allocator_arg_t</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator_reference</span> <span class="identifier">allocator</span>
+ <span class="special">,</span> <span class="identifier">Args</span><span class="special">&amp;&amp;</span> <span class="special">...</span><span class="identifier">args</span>
+<span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">associative_node</span><span class="special">(</span><span class="identifier">associative_node</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/copyable_tree_node.html" title="Copyable Tree Node"><span class="bold"><strong>Copyable Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor with allocator
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">associative_node</span><span class="special">(</span>
+ <span class="identifier">associative_node</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator_reference</span> <span class="identifier">allocator</span>
+<span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/copyable_tree_node.html" title="Copyable Tree Node"><span class="bold"><strong>Copyable Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Move constructor
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">associative_node</span><span class="special">(</span><span class="identifier">associative_node</span><span class="special">&amp;&amp;</span> <span class="identifier">source</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/movable_tree_node.html" title="Movable Tree Node"><span class="bold"><strong>Movable Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Move constructor with allocator
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">associative_node</span><span class="special">(</span>
+ <span class="identifier">associative_node</span><span class="special">&amp;&amp;</span> <span class="identifier">source</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">allocator_reference</span> <span class="identifier">allocator</span>
+<span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/movable_tree_node.html" title="Movable Tree Node"><span class="bold"><strong>Movable Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy assignment operator
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">associative_node</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">associative_node</span> <span class="keyword">const</span><span class="special">&amp;);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Assignable
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Move assignment operator
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">associative_node</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">associative_node</span><span class="special">&amp;&amp;);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ Movable
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_pointer</span> <span class="identifier">get_parent_ptr</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">pointer</span> <span class="identifier">get_parent_ptr</span><span class="special">();</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="special">...</span><span class="identifier">Args</span><span class="special">&gt;</span>
+<span class="identifier">iterator</span> <span class="identifier">emplace</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">,</span> <span class="identifier">Args</span><span class="special">&amp;&amp;</span> <span class="special">...</span><span class="identifier">args</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child copy creation
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">iterator</span>
+ <span class="identifier">insert</span><span class="special">(</span>
+ <span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span>
+ <span class="special">,</span> <span class="identifier">associative_node</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">child</span>
+ <span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child move insertion
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">iterator</span>
+ <span class="identifier">insert</span><span class="special">(</span>
+ <span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span>
+ <span class="special">,</span> <span class="identifier">associative_node</span><span class="special">&amp;&amp;</span> <span class="identifier">child</span>
+ <span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_iterator</span> <span class="identifier">cbegin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+<span class="identifier">const_iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">();</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_iterator</span> <span class="identifier">cend</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+<span class="identifier">const_iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">();</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children reverse range begin read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_reverse_iterator</span> <span class="identifier">crbegin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+<span class="identifier">const_reverse_iterator</span> <span class="identifier">rbegin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children reverse range begin access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">reverse_iterator</span> <span class="identifier">rbegin</span><span class="special">();</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children reverse range past-the-end read-only access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_reverse_iterator</span> <span class="identifier">crend</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+<span class="identifier">const_reverse_iterator</span> <span class="identifier">rend</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children reverse range past-the-end access
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">reverse_iterator</span> <span class="identifier">rend</span><span class="special">();</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range size query
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">size_type</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child read-only search
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_iterator</span> <span class="identifier">find</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">iterator</span> <span class="identifier">find</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child read-only search lower bound
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_iterator</span> <span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search lower bound
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">iterator</span> <span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child read-only search upper bound
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">const_iterator</span> <span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search upper bound
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">iterator</span> <span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child read-only search range
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">const_iterator_range</span>
+ <span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search range
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">iterator_range</span>
+ <span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove children
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">size_type</span> <span class="identifier">erase</span><span class="special">(</span><span class="keyword">typename</span> <span class="identifier">traits</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">);</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Leaf node query
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">bool</span> <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove all children
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">void</span> <span class="identifier">clear</span><span class="special">();</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node.non_members"></a><a class="link" href="associative_node.html#tree_node.reference.associative_node.non_members" title="Non-Members">Non-Members</a>
+</h4></div></div></div>
+<p>
+ Same as those defined in <a class="link" href="associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base</span></code></a>.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node.example"></a><a class="link" href="associative_node.html#tree_node.reference.associative_node.example" title="Example">Example</a>
+</h4></div></div></div>
+<p>
+ An inverted index
+ maps words and numbers to the documents that contain them, making it a
+ vital component for implementing search engines. In turn, a <a href="http://en.wikipedia.org/wiki/Radix_tree" target="_top">radix
+ tree</a>, designed to store strings as keys, is a good underlying data
+ structure for an inverted index.
+ </p>
+<p>
+ For the sake of simplicity, the program will store its documents in a random-access
+ container, so our inverted index implementation will refer to them by index.
+ </p>
+<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span><span class="special">&gt;</span> <span class="identifier">Indices</span><span class="special">;</span>
+<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span><span class="identifier">Indices</span><span class="special">&gt;</span> <span class="identifier">RadixTrieNode</span><span class="special">;</span>
+</pre>
+<p>
+ Since a radix tree
+ is a space-optimized trie
+ data structure, we can simplify things further by keeping the insertion
+ and space-optimization routines as separate functions. (An industrial-strength
+ implementation will, of course, optimize for space during insertion.) Thus,
+ our inverted index will treat each word it encounters as a sequence of
+ letters, initially storing them as keys to the next successive node or
+ to the set of indices to the documents containing the word. The documents
+ are simply strings of space-delimited words, which can be extracted via
+ Boost.Tokenizer.
+ </p>
+<pre class="programlisting"><span class="keyword">class</span> <span class="identifier">InvertedIndex</span>
+<span class="special">{</span>
+ <span class="identifier">RadixTrieNode</span> <span class="identifier">radix_root_node</span><span class="special">;</span>
+
+ <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">entry</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">index</span><span class="special">)</span>
+ <span class="special">{</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">tokenizer</span><span class="special">&lt;&gt;</span> <span class="identifier">word_parser</span><span class="special">(</span><span class="identifier">entry</span><span class="special">);</span>
+
+ <span class="keyword">for</span> <span class="special">(</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">tokenizer</span><span class="special">&lt;&gt;::</span><span class="identifier">iterator</span> <span class="identifier">word_itr</span> <span class="special">=</span> <span class="identifier">word_parser</span><span class="special">.</span><span class="identifier">begin</span><span class="special">();</span>
+ <span class="identifier">word_itr</span> <span class="special">!=</span> <span class="identifier">word_parser</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span>
+ <span class="special">++</span><span class="identifier">word_itr</span>
+ <span class="special">)</span>
+ <span class="special">{</span>
+ <span class="identifier">RadixTrieNode</span><span class="special">::</span><span class="identifier">pointer</span> <span class="identifier">p</span> <span class="special">=</span> <span class="special">&amp;</span><span class="identifier">radix_root_node</span><span class="special">;</span>
+
+ <span class="keyword">for</span> <span class="special">(</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">const_iterator</span> <span class="identifier">itr_to_char</span> <span class="special">=</span> <span class="identifier">word_itr</span><span class="special">-&gt;</span><span class="identifier">begin</span><span class="special">();</span>
+ <span class="identifier">itr_to_char</span> <span class="special">!=</span> <span class="identifier">word_itr</span><span class="special">-&gt;</span><span class="identifier">end</span><span class="special">();</span>
+ <span class="special">++</span><span class="identifier">itr_to_char</span>
+ <span class="special">)</span>
+ <span class="special">{</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">letter</span> <span class="special">=</span> <span class="string">""</span><span class="special">;</span>
+
+ <span class="identifier">p</span> <span class="special">=</span> <span class="special">&amp;</span><span class="identifier">dereference_iterator</span><span class="special">(</span><span class="identifier">p</span><span class="special">-&gt;</span><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">letter</span> <span class="special">+=</span> <span class="special">*</span><span class="identifier">itr_to_char</span><span class="special">));</span>
+ <span class="special">}</span>
+
+ <span class="identifier">get</span><span class="special">(*</span><span class="identifier">p</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">data_key</span><span class="special">()).</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">index</span><span class="special">);</span>
+ <span class="special">}</span>
+ <span class="special">}</span>
+</pre>
+<p>
+ To optimize for space, in this case, means merging each single-child node
+ with its offspring while concatenating the associated keys. A breadth-first
+ traversal will encounter the minimum number of nodes that need to be checked.
+ </p>
+<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">flatten</span><span class="special">()</span>
+<span class="special">{</span>
+ <span class="keyword">for</span> <span class="special">(</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">RadixTrieNode</span><span class="special">&gt;</span> <span class="identifier">tree_itr</span><span class="special">(</span>
+ <span class="identifier">radix_root_node</span>
+ <span class="special">);</span>
+ <span class="identifier">tree_itr</span><span class="special">;</span>
+ <span class="special">++</span><span class="identifier">tree_itr</span>
+ <span class="special">)</span>
+ <span class="special">{</span>
+ <span class="keyword">for</span> <span class="special">(</span>
+ <span class="identifier">RadixTrieNode</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">child_itr</span> <span class="special">=</span> <span class="identifier">tree_itr</span><span class="special">-&gt;</span><span class="identifier">begin</span><span class="special">();</span>
+ <span class="identifier">child_itr</span> <span class="special">!=</span> <span class="identifier">tree_itr</span><span class="special">-&gt;</span><span class="identifier">end</span><span class="special">();</span>
+ <span class="special">++</span><span class="identifier">child_itr</span>
+ <span class="special">)</span>
+ <span class="special">{</span>
+ <span class="keyword">while</span> <span class="special">(</span><span class="number">1</span> <span class="special">==</span> <span class="identifier">dereference_iterator</span><span class="special">(</span><span class="identifier">child_itr</span><span class="special">).</span><span class="identifier">size</span><span class="special">())</span>
+ <span class="special">{</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">key</span> <span class="special">=</span> <span class="identifier">child_itr</span><span class="special">-&gt;</span><span class="identifier">first</span> <span class="special">+</span> <span class="identifier">dereference_iterator</span><span class="special">(</span>
+ <span class="identifier">child_itr</span>
+ <span class="special">).</span><span class="identifier">begin</span><span class="special">()-&gt;</span><span class="identifier">first</span><span class="special">;</span>
+ <span class="identifier">RadixTrieNode</span> <span class="identifier">merger</span><span class="special">(</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">move</span><span class="special">(</span>
+ <span class="identifier">dereference_iterator</span><span class="special">(</span>
+ <span class="identifier">dereference_iterator</span><span class="special">(</span><span class="identifier">child_itr</span><span class="special">).</span><span class="identifier">begin</span><span class="special">()</span>
+ <span class="special">)</span>
+ <span class="special">)</span>
+ <span class="special">);</span>
+
+ <span class="identifier">tree_itr</span><span class="special">-&gt;</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">child_itr</span><span class="special">-&gt;</span><span class="identifier">first</span><span class="special">);</span>
+ <span class="identifier">child_itr</span> <span class="special">=</span> <span class="identifier">tree_itr</span><span class="special">-&gt;</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">key</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">move</span><span class="special">(</span><span class="identifier">merger</span><span class="special">));</span>
+ <span class="special">}</span>
+ <span class="special">}</span>
+ <span class="special">}</span>
+<span class="special">}</span>
+</pre>
+<p>
+ When searching for a particular word, our inverted index will, at each
+ step, determine what portion of the specified word needs to be processed,
+ then choose the branch whose key matches either that portion or a prefix
+ substring. If the key matches the remaining portion, then the function
+ returns the indices to the containing documents. If the key matches a prefix,
+ then the suffix will be processed at the next step. If no branch exists,
+ then the word is not found.
+ </p>
+<pre class="programlisting"> <span class="identifier">Indices</span> <span class="identifier">find</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">word</span><span class="special">)</span> <span class="keyword">const</span>
+ <span class="special">{</span>
+ <span class="identifier">Indices</span> <span class="identifier">result</span><span class="special">;</span>
+
+ <span class="keyword">if</span> <span class="special">(</span><span class="identifier">word</span><span class="special">.</span><span class="identifier">empty</span><span class="special">())</span>
+ <span class="special">{</span>
+ <span class="keyword">return</span> <span class="identifier">result</span><span class="special">;</span>
+ <span class="special">}</span>
+
+ <span class="identifier">RadixTrieNode</span><span class="special">::</span><span class="identifier">const_pointer</span> <span class="identifier">p</span> <span class="special">=</span> <span class="special">&amp;</span><span class="identifier">radix_root_node</span><span class="special">;</span>
+
+ <span class="keyword">for</span> <span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">prefix</span> <span class="special">=</span> <span class="string">""</span><span class="special">;</span> <span class="special">!</span><span class="identifier">p</span><span class="special">-&gt;</span><span class="identifier">empty</span><span class="special">();)</span>
+ <span class="special">{</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">suffix</span><span class="special">(</span><span class="identifier">word</span><span class="special">,</span> <span class="identifier">prefix</span><span class="special">.</span><span class="identifier">size</span><span class="special">(),</span> <span class="identifier">word</span><span class="special">.</span><span class="identifier">size</span><span class="special">());</span>
+ <span class="identifier">RadixTrieNode</span><span class="special">::</span><span class="identifier">const_iterator</span> <span class="identifier">node_itr</span> <span class="special">=</span> <span class="identifier">p</span><span class="special">-&gt;</span><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">suffix</span><span class="special">);</span>
+
+ <span class="keyword">if</span> <span class="special">(!(</span><span class="identifier">node_itr</span> <span class="special">==</span> <span class="identifier">p</span><span class="special">-&gt;</span><span class="identifier">end</span><span class="special">())</span> <span class="special">&amp;&amp;</span> <span class="special">(</span><span class="identifier">suffix</span> <span class="special">==</span> <span class="identifier">node_itr</span><span class="special">-&gt;</span><span class="identifier">first</span><span class="special">))</span>
+ <span class="special">{</span>
+ <span class="identifier">result</span> <span class="special">=</span> <span class="identifier">get</span><span class="special">(</span>
+ <span class="identifier">dereference_iterator</span><span class="special">(</span><span class="identifier">node_itr</span><span class="special">)</span>
+ <span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">data_key</span><span class="special">()</span>
+ <span class="special">);</span>
+ <span class="keyword">break</span><span class="special">;</span>
+ <span class="special">}</span>
+ <span class="keyword">else</span> <span class="keyword">if</span> <span class="special">(</span><span class="identifier">node_itr</span> <span class="special">==</span> <span class="identifier">p</span><span class="special">-&gt;</span><span class="identifier">begin</span><span class="special">())</span>
+ <span class="special">{</span>
+ <span class="keyword">break</span><span class="special">;</span>
+ <span class="special">}</span>
+ <span class="keyword">else</span>
+ <span class="special">{</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">next_prefix</span><span class="special">(</span><span class="identifier">suffix</span><span class="special">,</span> <span class="number">0</span><span class="special">,</span> <span class="special">(--</span><span class="identifier">node_itr</span><span class="special">)-&gt;</span><span class="identifier">first</span><span class="special">.</span><span class="identifier">size</span><span class="special">());</span>
+
+ <span class="keyword">if</span> <span class="special">(</span><span class="identifier">next_prefix</span> <span class="special">==</span> <span class="identifier">node_itr</span><span class="special">-&gt;</span><span class="identifier">first</span><span class="special">)</span>
+ <span class="special">{</span>
+ <span class="identifier">prefix</span> <span class="special">+=</span> <span class="identifier">next_prefix</span><span class="special">;</span>
+ <span class="identifier">p</span> <span class="special">=</span> <span class="special">&amp;</span><span class="identifier">dereference_iterator</span><span class="special">(</span><span class="identifier">node_itr</span><span class="special">);</span>
+ <span class="special">}</span>
+ <span class="keyword">else</span>
+ <span class="special">{</span>
+ <span class="keyword">break</span><span class="special">;</span>
+ <span class="special">}</span>
+ <span class="special">}</span>
+ <span class="special">}</span>
+
+ <span class="keyword">return</span> <span class="identifier">result</span><span class="special">;</span>
+ <span class="special">}</span>
+<span class="special">};</span>
+</pre>
+<p>
+ In our program, the search space is a small array of documents, each of
+ which the program will feed to the inverted index.
+ </p>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">test_main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">char</span><span class="special">**</span> <span class="identifier">argv</span><span class="special">)</span>
+<span class="special">{</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;</span> <span class="identifier">database</span><span class="special">(</span><span class="number">3</span><span class="special">);</span>
+
+ <span class="identifier">database</span><span class="special">[</span><span class="number">0</span><span class="special">]</span> <span class="special">=</span> <span class="string">"it is what it is"</span><span class="special">;</span>
+ <span class="identifier">database</span><span class="special">[</span><span class="number">1</span><span class="special">]</span> <span class="special">=</span> <span class="string">"what is it"</span><span class="special">;</span>
+ <span class="identifier">database</span><span class="special">[</span><span class="number">2</span><span class="special">]</span> <span class="special">=</span> <span class="string">"it is a banana"</span><span class="special">;</span>
+
+ <span class="identifier">InvertedIndex</span> <span class="identifier">inverted_index</span><span class="special">;</span>
+
+ <span class="keyword">for</span> <span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">0</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">&lt;</span> <span class="identifier">database</span><span class="special">.</span><span class="identifier">size</span><span class="special">();</span> <span class="special">++</span><span class="identifier">i</span><span class="special">)</span>
+ <span class="special">{</span>
+ <span class="identifier">inverted_index</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">database</span><span class="special">[</span><span class="identifier">i</span><span class="special">],</span> <span class="identifier">i</span><span class="special">);</span>
+ <span class="special">}</span>
+
+ <span class="identifier">inverted_index</span><span class="special">.</span><span class="identifier">flatten</span><span class="special">();</span>
+</pre>
+<p>
+ Then, for each unique word, the program will send the associated indices
+ to standard output.
+ </p>
+<pre class="programlisting"> <span class="identifier">Indices</span> <span class="identifier">indices</span> <span class="special">=</span> <span class="identifier">inverted_index</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"a"</span><span class="special">);</span>
+
+ <span class="identifier">BOOST_CHECK</span><span class="special">(</span><span class="number">1</span> <span class="special">==</span> <span class="identifier">indices</span><span class="special">.</span><span class="identifier">size</span><span class="special">());</span>
+ <span class="identifier">BOOST_CHECK</span><span class="special">(</span><span class="number">2</span> <span class="special">==</span> <span class="special">*</span><span class="identifier">indices</span><span class="special">.</span><span class="identifier">begin</span><span class="special">());</span>
+ <span class="identifier">indices</span> <span class="special">=</span> <span class="identifier">inverted_index</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"banana"</span><span class="special">);</span>
+ <span class="identifier">BOOST_CHECK</span><span class="special">(</span><span class="number">1</span> <span class="special">==</span> <span class="identifier">indices</span><span class="special">.</span><span class="identifier">size</span><span class="special">());</span>
+ <span class="identifier">BOOST_CHECK</span><span class="special">(</span><span class="number">2</span> <span class="special">==</span> <span class="special">*</span><span class="identifier">indices</span><span class="special">.</span><span class="identifier">begin</span><span class="special">());</span>
+ <span class="identifier">indices</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="number">0</span><span class="special">);</span>
+ <span class="identifier">indices</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="number">1</span><span class="special">);</span>
+ <span class="identifier">BOOST_CHECK</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span><span class="identifier">indices</span><span class="special">,</span> <span class="identifier">inverted_index</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"is"</span><span class="special">)));</span>
+ <span class="identifier">BOOST_CHECK</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span><span class="identifier">indices</span><span class="special">,</span> <span class="identifier">inverted_index</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"it"</span><span class="special">)));</span>
+ <span class="identifier">indices</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="number">2</span><span class="special">);</span>
+ <span class="identifier">BOOST_CHECK</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span><span class="identifier">indices</span><span class="special">,</span> <span class="identifier">inverted_index</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"what"</span><span class="special">)));</span>
+
+ <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
+<span class="special">}</span>
+</pre>
+<p>
+ The complete program source can be found here: &lt;test/inverted_index.cpp&gt;
+ </p>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2011-2013 Cromwell D. Enage<p>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ </p>
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="nary_node_base_gen.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="associative_node_gen.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/associative_node_base.html
==============================================================================
--- /dev/null 00:00:00 1970 (empty, because file is newly added)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/associative_node_base.html 2013-07-07 14:52:52 EDT (Sun, 07 Jul 2013) (r84977)
@@ -0,0 +1,1686 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>associative_node_base&lt;Derived,Key,Data,Selector&gt;</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.5">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="associative_node_gen.html" title="associative_node_gen&lt;Selector&gt;">
+<link rel="next" href="assoc_node_base_gen.html" title="associative_node_base_gen&lt;Selector&gt;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr><td valign="top"><img alt="C++ Boost" width="277" height="86" src="../../../../../../boost.png"></td></tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="associative_node_gen.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="assoc_node_base_gen.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.associative_node_base"></a><a class="link" href="associative_node_base.html" title="associative_node_base&lt;Derived,Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">associative_node_base</span><span class="special">&lt;</span><span class="identifier">Derived</span><span class="special">,</span><span class="identifier">Key</span><span class="special">,</span><span class="identifier">Data</span><span class="special">,</span><span class="identifier">Selector</span><span class="special">&gt;</span></code> </a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node_base.description"></a><a class="link" href="associative_node_base.html#tree_node.reference.associative_node_base.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ The <a class="link" href="associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a> class template
+ inherits its functionality from this class template. They differ only with
+ regard to template parameters: the <a class="link" href="associative_node.html" title="associative_node&lt;Key,Data,Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node</span></code></a> class template
+ is meant to be used directly as a data structure, while <code class="computeroutput"><span class="identifier">associative_node_base</span></code>
+ is more suitable as a base class template from which <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> adaptor class templates can derive
+ via the <a class="link" href="assoc_node_base_gen.html" title="associative_node_base_gen&lt;Selector&gt;"><code class="computeroutput"><span class="identifier">tree_node</span><span class="special">::</span><span class="identifier">associative_node_base_gen</span></code></a> <a class="link" href="../concepts/base_type_generator.html" title="Base Type Generator"><span class="bold"><strong>Base
+ Type Generator</strong></span></a>.
+ </p>
+<p>
+ If the user data type models the Fusion Associative Sequence concept, then
+ each of the elements within can be also be obtained through key-value access
+ and set through key-value modification as defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept; more specifically, for
+ some object <code class="computeroutput"><span class="identifier">node</span></code> of type
+ <code class="computeroutput"><span class="identifier">Node</span></code> such that <code class="computeroutput"><span class="identifier">Node</span></code> inherits from <code class="computeroutput"><span class="identifier">associative_node_base</span></code>,
+ then for any type <code class="computeroutput"><span class="identifier">Key</span></code> such
+ that <code class="literal">boost::fusion::has_key&lt;Key&gt;(get&lt;<a class="link" href="data_key.html" title="data_key">tree_node::data_key</a>&gt;(node))</code>
+ returns <code class="computeroutput"><span class="keyword">true</span></code>, so does <code class="literal"><a class="link" href="has_key.html" title="has_key()">tree_node::has_key</a>&lt;Key&gt;(node)</code>.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node_base.definition"></a><a class="link" href="associative_node_base.html#tree_node.reference.associative_node_base.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/associative_node.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ Forward-declared:
+ </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/associative_node_fwd.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ To register under Boost.Typeof:
+ </p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/typeof/boost/tree_node/associative_node.hpp<span class="special">&gt;</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node_base.tpl_param"></a><a class="link" href="associative_node_base.html#tree_node.reference.associative_node_base.tpl_param" title="Template Parameters">Template
+ Parameters</a>
+</h4></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Parameter
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+<th>
+ <p>
+ Requirements
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Derived</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The most descendant type that will inherit from this one.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Key</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The key type.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Data</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The user data type.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Selector</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines the child container type.
+ </p>
+ </td>
+<td>
+ <div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <code class="literal">boost::is_recursive_selector&lt;Selector&gt;</code>
+ must evaluate to boost::mpl::true_.
+ </p></li>
+<li class="listitem"><p>
+ <code class="literal">boost::is_associative_selector&lt;Selector&gt;</code>
+ must evaluate to boost::mpl::true_.
+ </p></li>
+</ul></div>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node_base.model_of"></a><a class="link" href="associative_node_base.html#tree_node.reference.associative_node_base.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem"><p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible
+ Tree Node</strong></span></a> if <code class="literal">boost::container_gen&lt;Selector,Key,Derived&gt;::type</code>
+ returns a Reversible Container model
+ </p></li>
+<li class="listitem"><p>
+ <a class="link" href="../concepts/base_tree_node.html" title="Base Tree Node"><span class="bold"><strong>Base
+ Tree Node</strong></span></a>
+ </p></li>
+<li class="listitem"><p>
+ Default Constructible if <code class="computeroutput"><span class="identifier">Data</span></code> is Default Constructible
+ </p></li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node_base.public_bases"></a><a class="link" href="associative_node_base.html#tree_node.reference.associative_node_base.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="identifier">tree_node_base</span><span class="special">&lt;</span><span class="identifier">Derived</span><span class="special">&gt;</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.associative_node_base.members"></a><a class="link" href="associative_node_base.html#tree_node.reference.associative_node_base.members" title="Members">Members</a>
+</h4></div></div></div>
+<p>
+ Given:
+ </p>
+<pre class="programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">container_gen</span><span class="special">&lt;</span><span class="identifier">Selector</span><span class="special">,</span><span class="identifier">Key</span><span class="special">,</span><span class="identifier">Derived</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="identifier">children</span><span class="special">;</span>
+</pre>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ <p>
+ Name
+ </p>
+ </th>
+<th>
+ <p>
+ Definition
+ </p>
+ </th>
+<th>
+ <p>
+ Scope
+ </p>
+ </th>
+<th>
+ <p>
+ Where defined
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Super type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="identifier">tree_node_base</span><span class="special">&lt;</span><span class="identifier">Derived</span><span class="special">&gt;</span> <span class="identifier">super_t</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">public</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Key type, data type, iterator range type, immutable iterator
+ range type, allocator type, allocator reference type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">struct</span> <span class="identifier">traits</span>
+<span class="special">{</span>
+ <span class="keyword">typedef</span> <span class="identifier">Key</span>
+ <span class="identifier">key_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">Data</span>
+ <span class="identifier">data_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">if_</span><span class="special">&lt;</span>
+ <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_ptr_selector</span><span class="special">&lt;</span><span class="identifier">Selector</span><span class="special">&gt;</span>
+ <span class="special">,</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">&gt;</span>
+ <span class="special">,</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">&gt;</span>
+ <span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="identifier">iterator_range</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">if_</span><span class="special">&lt;</span>
+ <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_ptr_selector</span><span class="special">&lt;</span><span class="identifier">Selector</span><span class="special">&gt;</span>
+ <span class="special">,</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_range</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">&gt;</span>
+ <span class="special">,</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">&gt;</span>
+ <span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="identifier">const_iterator_range</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">children</span><span class="special">::</span><span class="identifier">allocator_type</span>
+ <span class="identifier">allocator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">allocator</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="identifier">allocator_reference</span><span class="special">;</span>
+<span class="special">};</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">public</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">super_t</span><span class="special">::</span><span class="identifier">pointer</span> <span class="identifier">pointer</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">public</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer-to-const type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">super_t</span><span class="special">::</span><span class="identifier">const_pointer</span> <span class="identifier">const_pointer</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">public</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree
+ Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">children</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">iterator</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">public</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable iterator type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">children</span><span class="special">::</span><span class="identifier">const_iterator</span> <span class="identifier">const_iterator</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">public</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Reverse iterator type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">children</span><span class="special">::</span><span class="identifier">reverse_iterator</span> <span class="identifier">reverse_iterator</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">public</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversible Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable reverse iterator type
+ </p>
+ </td>
+<td>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">children</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span>
+ <span class="identifier">const_reverse_iterator</span><span class="special">;</span>
+</pre>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">public</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/reversible_tree_node.html" title="Reversible Tree Node"><span class="bold"><strong>Reversi