Boost logo

Boost-Commit :

Subject: [Boost-commit] svn:boost r74416 - in sandbox: tree_node tree_node/boost tree_node/boost/detail tree_node/boost/detail/metafunction tree_node/boost/tree_node tree_node/libs tree_node/libs/tree_node tree_node/libs/tree_node/doc tree_node/libs/tree_node/doc/html tree_node/libs/tree_node/doc/html/images tree_node/libs/tree_node/doc/html/tree_node tree_node/libs/tree_node/doc/html/tree_node/concepts tree_node/libs/tree_node/doc/html/tree_node/reference tree_node/libs/tree_node/example utility-container_gen utility-container_gen/boost utility-container_gen/boost/detail utility-container_gen/boost/detail/function utility-container_gen/boost/detail/metafunction utility-container_gen/boost/graph utility-container_gen/boost/graph/detail utility-container_gen/boost/utility utility-container_gen/libs utility-container_gen/libs/graph utility-container_gen/libs/graph/example utility-container_gen/libs/utility utility-container_gen/libs/utility/container_gen utility-container_gen/libs/utility/container_gen/doc utility-container_gen/libs/utility/container_gen/doc/html utility-container_gen/libs/utility/container_gen/doc/html/container_gen utility-container_gen/libs/utility/container_gen/doc/html/container_gen/reference utility-container_gen/libs/utility/container_gen/doc/html/images
From: sponage_at_[hidden]
Date: 2011-09-16 04:21:48


Author: expaler
Date: 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
New Revision: 74416
URL: http://svn.boost.org/trac/boost/changeset/74416

Log:
Added Boost.Utility.ContainerGen and Boost.TreeNode candidate libraries.
Added:
   sandbox/tree_node/
   sandbox/tree_node/LICENSE_1_0.txt (contents, props changed)
   sandbox/tree_node/boost/
   sandbox/tree_node/boost.png (contents, props changed)
   sandbox/tree_node/boost/detail/
   sandbox/tree_node/boost/detail/metafunction/
   sandbox/tree_node/boost/detail/metafunction/element_type.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/
   sandbox/tree_node/boost/tree_node.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/breadth_first_iterator.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/depth_first_iterator.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/post_order_iterator.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/pre_order_iterator.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/raw_associative_node.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/raw_node.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/simple_associative_node.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/simple_node.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/traversal_state.hpp (contents, props changed)
   sandbox/tree_node/boost/tree_node/typeof.hpp (contents, props changed)
   sandbox/tree_node/libs/
   sandbox/tree_node/libs/tree_node/
   sandbox/tree_node/libs/tree_node/doc/
   sandbox/tree_node/libs/tree_node/doc/Jamroot (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_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_iterator.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/concept_raci_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/
   sandbox/tree_node/libs/tree_node/doc/html/boostbook.css (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/
   sandbox/tree_node/libs/tree_node/doc/html/images/alert.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/blank.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/caution.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/draft.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/home.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/important.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/next.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/next_disabled.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/note.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/prev.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/prev_disabled.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/smiley.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/tip.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/toc-blank.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/toc-minus.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/toc-plus.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/up.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/up_disabled.png (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/images/warning.png (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/
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/
   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/full_tree_node_iterator.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/raci_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/
   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/breadth_first_iterator.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/post_order_iterator.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/raw_associative_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/raw_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/simple_associative_node.html (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/simple_node.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/ref_breadth_first_iterator.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_post_order_iterator.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_raw_associative_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_raw_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_simple_associative_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/ref_simple_node.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/reference.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/doc/tree_node.qbk (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/
   sandbox/tree_node/libs/tree_node/example/default_unconstructible_type.cpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/default_unconstructible_type.hpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/raw_associative_node.cpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/raw_node.cpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/show_functions.cpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/show_functions.hpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/showcase_descendant_iterators.hpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/showcase_iterators.hpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/simple_associative_node.cpp (contents, props changed)
   sandbox/tree_node/libs/tree_node/example/simple_node.cpp (contents, props changed)
   sandbox/utility-container_gen/
   sandbox/utility-container_gen/LICENSE_1_0.txt (contents, props changed)
   sandbox/utility-container_gen/boost/
   sandbox/utility-container_gen/boost.png (contents, props changed)
   sandbox/utility-container_gen/boost/detail/
   sandbox/utility-container_gen/boost/detail/function/
   sandbox/utility-container_gen/boost/detail/function/range_equal.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/function/range_less.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/
   sandbox/utility-container_gen/boost/detail/metafunction/has_const_iterator.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/has_const_pointer.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/has_const_reference.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/has_difference_type.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/has_pointer.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/has_reference.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/has_size_type.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/has_value_type.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/is_container.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/detail/metafunction/is_input_iterator.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/graph/
   sandbox/utility-container_gen/boost/graph/adjacency_list.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/graph/detail/
   sandbox/utility-container_gen/boost/graph/detail/adjacency_list.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/utility/
   sandbox/utility-container_gen/boost/utility/associative_container_gen.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/utility/container_gen.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/utility/container_selector.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/utility/is_random_access_selector.hpp (contents, props changed)
   sandbox/utility-container_gen/boost/utility/is_unique_assoc_selector.hpp (contents, props changed)
   sandbox/utility-container_gen/libs/
   sandbox/utility-container_gen/libs/graph/
   sandbox/utility-container_gen/libs/graph/example/
   sandbox/utility-container_gen/libs/graph/example/container_gen.cpp (contents, props changed)
   sandbox/utility-container_gen/libs/utility/
   sandbox/utility-container_gen/libs/utility/container_gen/
   sandbox/utility-container_gen/libs/utility/container_gen/doc/
   sandbox/utility-container_gen/libs/utility/container_gen/doc/Jamroot (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/container_gen.qbk (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/boostbook.css (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/container_gen/
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/container_gen/reference/
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/container_gen/reference.html (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/container_gen/reference/associative_container_gen.html (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/container_gen/reference/container_gen.html (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/container_gen/reference/is_random_access_selector.html (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/container_gen/reference/is_unique_associative_selector.html (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/alert.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/blank.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/caution.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/draft.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/home.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/important.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/next.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/next_disabled.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/note.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/prev.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/prev_disabled.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/smiley.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/tip.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/toc-blank.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/toc-minus.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/toc-plus.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/up.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/up_disabled.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/images/warning.png (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/html/index.html (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/ref_assoc_container_gen.qbk (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/ref_container_gen.qbk (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/ref_is_rand_access_selector.qbk (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/ref_is_unique_assoc_sel.qbk (contents, props changed)
   sandbox/utility-container_gen/libs/utility/container_gen/doc/reference.qbk (contents, props changed)

Added: sandbox/tree_node/LICENSE_1_0.txt
==============================================================================
--- (empty file)
+++ sandbox/tree_node/LICENSE_1_0.txt 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,23 @@
+Boost Software License - Version 1.0 - August 17th, 2003
+
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.

Added: sandbox/tree_node/boost.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/boost/detail/metafunction/element_type.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/detail/metafunction/element_type.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,23 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_ELEMENT_TYPE_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_ELEMENT_TYPE_HPP_INCLUDED
+
+#include <boost/mpl/aux_/lambda_support.hpp>
+
+namespace boost { namespace detail {
+
+ template <typename T>
+ struct element_type
+ {
+ typedef typename T::element_type type;
+
+ BOOST_MPL_AUX_LAMBDA_SUPPORT(1,element_type,(T))
+ };
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_ELEMENT_TYPE_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,20 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_HPP_INCLUDED
+#define BOOST_TREE_NODE_HPP_INCLUDED
+
+#include <boost/tree_node/traversal_state.hpp>
+#include <boost/tree_node/breadth_first_iterator.hpp>
+#include <boost/tree_node/pre_order_iterator.hpp>
+#include <boost/tree_node/post_order_iterator.hpp>
+#include <boost/tree_node/depth_first_iterator.hpp>
+#include <boost/tree_node/raw_node.hpp>
+#include <boost/tree_node/simple_node.hpp>
+#include <boost/tree_node/raw_associative_node.hpp>
+#include <boost/tree_node/simple_associative_node.hpp>
+
+#endif // BOOST_TREE_NODE_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/breadth_first_iterator.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/breadth_first_iterator.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,596 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_BREADTH_FIRST_ITERATOR_HPP_INCLUDED
+#define BOOST_TREE_BREADTH_FIRST_ITERATOR_HPP_INCLUDED
+
+#include <iterator>
+#include <deque>
+#include <boost/config.hpp>
+#include <boost/tr1/type_traits.hpp>
+#include <boost/mpl/bool.hpp>
+#include <boost/mpl/eval_if.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/mpl/equal_to.hpp>
+#ifndef BOOST_NO_SFINAE
+#include <boost/utility/enable_if.hpp>
+#endif
+#include <boost/fusion/adapted/std_pair.hpp>
+#include <boost/fusion/support/is_sequence.hpp>
+#include <boost/detail/metafunction/element_type.hpp>
+#include <boost/tree_node/traversal_state.hpp>
+
+//[reference__breadth_first_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename MimicsChildIterator>
+ class breadth_first_iterator
+ {
+ //<-
+ typedef typename ::boost::mpl::eval_if<
+ ::std::tr1::is_pointer<NodePointer>
+ , ::std::tr1::remove_pointer<NodePointer>
+ , ::boost::detail::element_type<NodePointer>
+ >::type
+ element_type;
+ typedef typename ::std::tr1::remove_const<element_type>::type
+ node_type;
+ typedef typename ::boost::mpl::if_<
+ ::std::tr1::is_const<element_type>
+ , typename node_type::const_child_iterator
+ , typename node_type::child_iterator
+ >::type
+ child_iterator;
+ typedef typename ::std::iterator_traits<child_iterator>::value_type
+ child_value;
+ typedef typename ::boost::fusion::traits::is_sequence<
+ child_value
+ >::type
+ is_associative;
+ typedef typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_iterator
+ , NodePointer
+ >::type
+ queue_element;
+ //->
+
+ public:
+ typedef // implementation_defined
+ //<-
+ typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_value
+ , NodePointer
+ >::type
+ //->
+ value_type;
+ typedef value_type const&
+ reference;
+ typedef // implementation_defined
+ //<-
+ typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_iterator
+ , value_type const*
+ >::type
+ //->
+ pointer;
+ typedef ::std::ptrdiff_t
+ distance_type;
+ typedef ::std::forward_iterator_tag
+ iterator_category;
+
+ //<-
+ private:
+#ifndef BOOST_NO_SFINAE
+ struct enabler
+ {
+ };
+#endif
+
+ ::std::deque<queue_element> _queue;
+ queue_element _current;
+ traversal_state _state;
+
+ public:
+ //->
+ breadth_first_iterator();
+
+ explicit breadth_first_iterator(NodePointer const& node);
+
+ template <typename NP, typename MCI>
+ breadth_first_iterator(
+ breadth_first_iterator<NP,MCI> const& other
+//<-
+#ifndef BOOST_NO_SFINAE
+ , typename ::boost::enable_if<
+ typename ::boost::mpl::if_<
+ ::std::tr1::is_convertible<NP,NodePointer>
+ , ::boost::mpl::equal_to<MCI,MimicsChildIterator>
+ , ::boost::mpl::false_
+ >::type
+ , enabler
+ >::type = enabler()
+#endif
+//->
+ );
+
+ reference operator*() const;
+
+ pointer operator->() const;
+
+ breadth_first_iterator& operator++();
+
+ breadth_first_iterator operator++(int);
+
+ operator traversal_state() const;
+
+ //<-
+ private:
+ static NodePointer
+ _deref(child_iterator const&, ::boost::mpl::true_);
+
+ static NodePointer
+ _deref(child_iterator const&, ::boost::mpl::false_);
+
+ reference _deref(::boost::mpl::true_) const;
+
+ reference _deref(::boost::mpl::false_) const;
+
+ pointer _indirect(::boost::mpl::true_) const;
+
+ pointer _indirect(::boost::mpl::false_) const;
+
+ NodePointer _current_node(::boost::mpl::true_) const;
+
+ NodePointer const& _current_node(::boost::mpl::false_) const;
+
+ void _initialize(NodePointer const&, ::boost::mpl::true_);
+
+ void _initialize(NodePointer const&, ::boost::mpl::false_);
+
+ void _push_child(child_iterator const&, ::boost::mpl::true_);
+
+ void _push_child(child_iterator const&, ::boost::mpl::false_);
+
+ void _push_children(NodePointer const&, ::boost::mpl::true_);
+
+ void _push_children(NodePointer const&, ::boost::mpl::false_);
+
+ void _pop();
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ friend bool
+#else
+ friend typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator==(
+ breadth_first_iterator<NP1,MCI1> const& lhs
+ , breadth_first_iterator<NP2,MCI2> const& rhs
+ );
+ //->
+ };
+
+ //<-
+ template <typename NP, typename MCI>
+ breadth_first_iterator<NP,MCI>::breadth_first_iterator()
+ : _queue(), _current(), _state(no_traversal)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ breadth_first_iterator<NP,MCI>::breadth_first_iterator(NP const& node)
+ : _queue()
+ , _current()
+ , _state(node ? breadth_first_traversal : no_traversal)
+ {
+ _initialize(node, MCI());
+ }
+
+ template <typename NP1, typename MCI1>
+ template <typename NP2, typename MCI2>
+ breadth_first_iterator<NP1,MCI1>::breadth_first_iterator(
+ breadth_first_iterator<NP2,MCI2> const& other
+ , typename ::boost::enable_if<
+ typename ::boost::mpl::if_<
+ ::std::tr1::is_convertible<NP2,NP1>
+ , ::boost::mpl::equal_to<MCI2,MCI1>
+ , ::boost::mpl::false_
+ >::type
+ , enabler
+ >::type
+ ) : _queue(other._queue.begin(), other._queue.end())
+ , _current(other._current)
+ , _state(other._state)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ breadth_first_iterator<NP,MCI>::_initialize(
+ NP const& node
+ , ::boost::mpl::true_
+ )
+ {
+ if (node)
+ {
+ _push_children(node, MCI());
+ _pop();
+ }
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ breadth_first_iterator<NP,MCI>::_initialize(
+ NP const& node
+ , ::boost::mpl::false_
+ )
+ {
+ _current = node;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename breadth_first_iterator<NP,MCI>::reference
+ breadth_first_iterator<NP,MCI>::_deref(::boost::mpl::true_) const
+ {
+ return *_current;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename breadth_first_iterator<NP,MCI>::reference
+ breadth_first_iterator<NP,MCI>::_deref(::boost::mpl::false_) const
+ {
+ return _current;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename breadth_first_iterator<NP,MCI>::reference
+ breadth_first_iterator<NP,MCI>::operator*() const
+ {
+ return _deref(MCI());
+ }
+
+ template <typename NP, typename MCI>
+ inline typename breadth_first_iterator<NP,MCI>::pointer
+ breadth_first_iterator<NP,MCI>::_indirect(::boost::mpl::true_) const
+ {
+ return _current;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename breadth_first_iterator<NP,MCI>::pointer
+ breadth_first_iterator<NP,MCI>::_indirect(::boost::mpl::false_) const
+ {
+ return &_current;
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ breadth_first_iterator<NP,MCI>::_deref(
+ child_iterator const& itr
+ , ::boost::mpl::true_
+ )
+ {
+ return itr->second;
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ breadth_first_iterator<NP,MCI>::_deref(
+ child_iterator const& itr
+ , ::boost::mpl::false_
+ )
+ {
+ return *itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ breadth_first_iterator<NP,MCI>::_current_node(
+ ::boost::mpl::true_
+ ) const
+ {
+ return _deref(_current, is_associative());
+ }
+
+ template <typename NP, typename MCI>
+ inline NP const&
+ breadth_first_iterator<NP,MCI>::_current_node(
+ ::boost::mpl::false_
+ ) const
+ {
+ return _current;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename breadth_first_iterator<NP,MCI>::pointer
+ breadth_first_iterator<NP,MCI>::operator->() const
+ {
+ return _indirect(MCI());
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ breadth_first_iterator<NP,MCI>::_push_child(
+ child_iterator const& itr
+ , ::boost::mpl::true_
+ )
+ {
+ _queue.push_back(itr->second);
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ breadth_first_iterator<NP,MCI>::_push_child(
+ child_iterator const& itr
+ , ::boost::mpl::false_
+ )
+ {
+ _queue.push_back(*itr);
+ }
+
+ template <typename NP, typename MCI>
+ void
+ breadth_first_iterator<NP,MCI>::_push_children(
+ NP const& node
+ , ::boost::mpl::true_
+ )
+ {
+ child_iterator itr_end = node->get_child_end();
+
+ for (
+ child_iterator itr = node->get_child_begin();
+ itr != itr_end;
+ ++itr
+ )
+ {
+ _queue.push_back(itr);
+ }
+ }
+
+ template <typename NP, typename MCI>
+ void
+ breadth_first_iterator<NP,MCI>::_push_children(
+ NP const& node
+ , ::boost::mpl::false_
+ )
+ {
+ child_iterator itr_end = node->get_child_end();
+
+ for (
+ child_iterator itr = node->get_child_begin();
+ itr != itr_end;
+ ++itr
+ )
+ {
+ _push_child(itr, is_associative());
+ }
+ }
+
+ template <typename NP, typename MCI>
+ inline void breadth_first_iterator<NP,MCI>::_pop()
+ {
+ if (_queue.empty())
+ {
+ _state = no_traversal;
+ }
+ else
+ {
+ _current = _queue.front();
+ _queue.pop_front();
+ }
+ }
+
+ template <typename NP, typename MCI>
+ inline breadth_first_iterator<NP,MCI>&
+ breadth_first_iterator<NP,MCI>::operator++()
+ {
+ MCI mci;
+ _push_children(_current_node(mci), mci);
+ _pop();
+ return *this;
+ }
+
+ template <typename NP, typename MCI>
+ inline breadth_first_iterator<NP,MCI>
+ breadth_first_iterator<NP,MCI>::operator++(int)
+ {
+ breadth_first_iterator<NP,MCI> itr(*this);
+ ++(*this);
+ return itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline breadth_first_iterator<NP,MCI>::operator traversal_state() const
+ {
+ return _state;
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__breadth_first_iterator__operator_equals
+namespace boost { namespace tree_node {
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+//<-
+#ifdef BOOST_NO_SFINAE
+ bool
+#else
+//->
+ typename ::boost::enable_if< ::boost::mpl::equal_to<MCI1,MCI2>,bool>::type
+//<-
+#endif
+//->
+ operator==(
+ breadth_first_iterator<NP1,MCI1> const& lhs
+ , breadth_first_iterator<NP2,MCI2> const& rhs
+ );
+
+ //<-
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ inline bool
+#else
+ inline typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator==(
+ breadth_first_iterator<NP1,MCI1> const& lhs
+ , breadth_first_iterator<NP2,MCI2> const& rhs
+ )
+ {
+ if (lhs._state == rhs._state)
+ {
+ return lhs._state ? (lhs._current == rhs._current) : !rhs._state;
+ }
+ else
+ {
+ return false;
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__breadth_first_iterator__operator_not_equal
+namespace boost { namespace tree_node {
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+//<-
+#ifdef BOOST_NO_SFINAE
+ bool
+#else
+//->
+ typename ::boost::enable_if< ::boost::mpl::equal_to<MCI1,MCI2>,bool>::type
+//<-
+#endif
+//->
+ operator!=(
+ breadth_first_iterator<NP1,MCI1> const& lhs
+ , breadth_first_iterator<NP2,MCI2> const& rhs
+ );
+
+ //<-
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ inline bool
+#else
+ inline typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator!=(
+ breadth_first_iterator<NP1,MCI1> const& lhs
+ , breadth_first_iterator<NP2,MCI2> const& rhs
+ )
+ {
+ return !(lhs == rhs);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__make_breadth_first_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer>
+ breadth_first_iterator<NodePointer,::boost::mpl::false_>
+ make_breadth_first_iterator(NodePointer const& node);
+
+ //<-
+ template <typename NodePointer>
+ inline breadth_first_iterator<NodePointer,::boost::mpl::false_>
+ make_breadth_first_iterator(NodePointer const& node)
+ {
+ return breadth_first_iterator<NodePointer,::boost::mpl::false_>(node);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__make_breadth_first_descendant_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer>
+ breadth_first_iterator<NodePointer,::boost::mpl::true_>
+ make_breadth_first_descendant_iterator(NodePointer const& node);
+
+ //<-
+ template <typename NodePointer>
+ inline breadth_first_iterator<NodePointer,::boost::mpl::true_>
+ make_breadth_first_descendant_iterator(NodePointer const& node)
+ {
+ return breadth_first_iterator<NodePointer,::boost::mpl::true_>(node);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__breadth_first_iterate
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ breadth_first_iterate(NodePointer const& node, UnaryFunction function);
+
+ //<-
+ template <typename NodePointer, typename UnaryFunction>
+ void breadth_first_iterate(NodePointer const& node, UnaryFunction function)
+ {
+ for (
+ breadth_first_iterator<NodePointer,::boost::mpl::false_> itr(node);
+ itr;
+ ++itr
+ )
+ {
+ function(*itr);
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__breadth_first_iterate_descendants
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ breadth_first_iterate_descendants(
+ NodePointer const& node
+ , UnaryFunction function
+ );
+
+ //<-
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ breadth_first_iterate_descendants(
+ NodePointer const& node
+ , UnaryFunction function
+ )
+ {
+ for (
+ breadth_first_iterator<NodePointer,::boost::mpl::true_> itr(node);
+ itr;
+ ++itr
+ )
+ {
+ function(*itr);
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_BREADTH_FIRST_ITERATOR_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/depth_first_iterator.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/depth_first_iterator.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,545 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_DEPTH_FIRST_ITERATOR_HPP_INCLUDED
+#define BOOST_TREE_NODE_DEPTH_FIRST_ITERATOR_HPP_INCLUDED
+
+#include <iterator>
+#include <deque>
+#include <boost/config.hpp>
+#include <boost/tr1/type_traits.hpp>
+#include <boost/mpl/bool.hpp>
+#include <boost/mpl/eval_if.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/mpl/equal_to.hpp>
+#ifndef BOOST_NO_SFINAE
+#include <boost/utility/enable_if.hpp>
+#endif
+#include <boost/fusion/adapted/std_pair.hpp>
+#include <boost/fusion/support/is_sequence.hpp>
+#include <boost/detail/metafunction/element_type.hpp>
+#include <boost/tree_node/traversal_state.hpp>
+
+//[reference__depth_first_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename MimicsChildIterator>
+ class depth_first_iterator
+ {
+ //<-
+ typedef typename ::boost::mpl::eval_if<
+ ::std::tr1::is_pointer<NodePointer>
+ , ::std::tr1::remove_pointer<NodePointer>
+ , ::boost::detail::element_type<NodePointer>
+ >::type
+ element_type;
+ typedef typename ::std::tr1::remove_const<element_type>::type
+ node_type;
+ typedef typename ::boost::mpl::if_<
+ ::std::tr1::is_const<element_type>
+ , typename node_type::const_child_iterator
+ , typename node_type::child_iterator
+ >::type
+ child_iterator;
+ typedef typename ::std::iterator_traits<child_iterator>::value_type
+ child_value;
+ typedef typename ::boost::fusion::traits::is_sequence<
+ child_value
+ >::type
+ is_associative;
+ //->
+
+ public:
+ typedef // implementation_defined
+ //<-
+ typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_value
+ , NodePointer
+ >::type
+ //->
+ value_type;
+ typedef value_type const&
+ reference;
+ typedef // implementation_defined
+ //<-
+ typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_iterator
+ , value_type const*
+ >::type
+ //->
+ pointer;
+ typedef ::std::ptrdiff_t
+ distance_type;
+ typedef ::std::forward_iterator_tag
+ iterator_category;
+
+ //<-
+ private:
+#ifndef BOOST_NO_SFINAE
+ struct enabler
+ {
+ };
+#endif
+
+ ::std::deque<NodePointer> _node_stack;
+ ::std::deque<child_iterator> _itr_stack;
+ NodePointer _current_node;
+ child_iterator _current_itr;
+ traversal_state _state;
+
+ public:
+ //->
+ depth_first_iterator();
+
+ explicit depth_first_iterator(NodePointer const& node);
+
+ template <typename NP, typename MCI>
+ depth_first_iterator(
+ depth_first_iterator<NP,MCI> const& other
+//<-
+#ifndef BOOST_NO_SFINAE
+ , typename ::boost::enable_if<
+ typename ::boost::mpl::if_<
+ ::std::tr1::is_convertible<NP,NodePointer>
+ , ::boost::mpl::equal_to<MCI,MimicsChildIterator>
+ , ::boost::mpl::false_
+ >::type
+ , enabler
+ >::type = enabler()
+#endif
+//->
+ );
+
+ reference operator*() const;
+
+ pointer operator->() const;
+
+ depth_first_iterator& operator++();
+
+ depth_first_iterator operator++(int);
+
+ operator traversal_state() const;
+
+ //<-
+ private:
+ static NodePointer
+ _deref(child_iterator const&, ::boost::mpl::true_);
+
+ static NodePointer
+ _deref(child_iterator const&, ::boost::mpl::false_);
+
+ reference _deref(::boost::mpl::true_) const;
+
+ reference _deref(::boost::mpl::false_) const;
+
+ pointer _indirect(::boost::mpl::true_) const;
+
+ pointer _indirect(::boost::mpl::false_) const;
+
+ void _initialize(::boost::mpl::true_);
+
+ void _initialize(::boost::mpl::false_);
+
+ void _set_state(::boost::mpl::true_);
+
+ void _set_state(::boost::mpl::false_);
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ friend bool
+#else
+ friend typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator==(
+ depth_first_iterator<NP1,MCI1> const& lhs
+ , depth_first_iterator<NP2,MCI2> const& rhs
+ );
+ //->
+ };
+
+ //<-
+ template <typename NP, typename MCI>
+ depth_first_iterator<NP,MCI>::depth_first_iterator()
+ : _node_stack()
+ , _itr_stack()
+ , _current_node()
+ , _current_itr()
+ , _state(no_traversal)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ depth_first_iterator<NP,MCI>::depth_first_iterator(NP const& node)
+ : _node_stack()
+ , _itr_stack()
+ , _current_node(node)
+ , _current_itr()
+ , _state(node ? pre_order_traversal : no_traversal)
+ {
+ if (node)
+ {
+ _itr_stack.push_back(node->get_child_begin());
+ _initialize(MCI());
+ }
+ }
+
+ template <typename NP1, typename MCI1>
+ template <typename NP2, typename MCI2>
+ depth_first_iterator<NP1,MCI1>::depth_first_iterator(
+ depth_first_iterator<NP2,MCI2> const& other
+#ifndef BOOST_NO_SFINAE
+ , typename ::boost::enable_if<
+ typename ::boost::mpl::if_<
+ ::std::tr1::is_convertible<NP2,NP1>
+ , ::boost::mpl::equal_to<MCI2,MCI1>
+ , ::boost::mpl::false_
+ >::type
+ , enabler
+ >::type
+#endif
+ ) : _node_stack(other._node_stack.begin(), other._node_stack.end())
+ , _itr_stack(other._itr_stack.begin(), other._itr_stack.end())
+ , _current_node(other._current_node)
+ , _current_itr(other._current_itr)
+ , _state(other._state)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ depth_first_iterator<NP,MCI>::_initialize(::boost::mpl::true_)
+ {
+ ++(*this);
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ depth_first_iterator<NP,MCI>::_initialize(::boost::mpl::false_)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ inline typename depth_first_iterator<NP,MCI>::reference
+ depth_first_iterator<NP,MCI>::_deref(::boost::mpl::true_) const
+ {
+ return *_current_itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename depth_first_iterator<NP,MCI>::reference
+ depth_first_iterator<NP,MCI>::_deref(::boost::mpl::false_) const
+ {
+ return _current_node;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename depth_first_iterator<NP,MCI>::reference
+ depth_first_iterator<NP,MCI>::operator*() const
+ {
+ return _deref(MCI());
+ }
+
+ template <typename NP, typename MCI>
+ inline typename depth_first_iterator<NP,MCI>::pointer
+ depth_first_iterator<NP,MCI>::_indirect(::boost::mpl::true_) const
+ {
+ return _current_itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename depth_first_iterator<NP,MCI>::pointer
+ depth_first_iterator<NP,MCI>::_indirect(::boost::mpl::false_) const
+ {
+ return &_current_node;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename depth_first_iterator<NP,MCI>::pointer
+ depth_first_iterator<NP,MCI>::operator->() const
+ {
+ return _indirect(MCI());
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ depth_first_iterator<NP,MCI>::_deref(
+ child_iterator const& itr
+ , ::boost::mpl::true_
+ )
+ {
+ return itr->second;
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ depth_first_iterator<NP,MCI>::_deref(
+ child_iterator const& itr
+ , ::boost::mpl::false_
+ )
+ {
+ return *itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline void depth_first_iterator<NP,MCI>::_set_state(::boost::mpl::true_)
+ {
+ _state = _node_stack.empty() ? no_traversal : post_order_traversal;
+ }
+
+ template <typename NP, typename MCI>
+ inline void depth_first_iterator<NP,MCI>::_set_state(::boost::mpl::false_)
+ {
+ _state = post_order_traversal;
+ }
+
+ template <typename NP, typename MCI>
+ depth_first_iterator<NP,MCI>&
+ depth_first_iterator<NP,MCI>::operator++()
+ {
+ if (_state == post_order_traversal)
+ {
+ _itr_stack.pop_back();
+
+ if (_node_stack.empty())
+ {
+ _state = no_traversal;
+
+ while (!_itr_stack.empty())
+ {
+ _itr_stack.pop_back();
+ }
+ }
+ else
+ {
+ _current_node = _node_stack.back();
+ _node_stack.pop_back();
+
+ if (++_current_itr == _current_node->get_child_end())
+ {
+ _set_state(MCI());
+
+ if (_state)
+ {
+ child_iterator itr = _itr_stack.back();
+
+ _itr_stack.pop_back();
+
+ if (!_itr_stack.empty())
+ {
+ _current_itr = _itr_stack.back();
+ }
+
+ _itr_stack.push_back(itr);
+ }
+ else
+ {
+ while (!_itr_stack.empty())
+ {
+ _itr_stack.pop_back();
+ }
+ }
+ }
+ else
+ {
+ _itr_stack.pop_back();
+ _node_stack.push_back(_current_node);
+ _itr_stack.push_back(_current_itr);
+ _current_node = _deref(_current_itr, is_associative());
+ _state = pre_order_traversal;
+ _itr_stack.push_back(_current_node->get_child_begin());
+ }
+ }
+ }
+ else
+ {
+ child_iterator& itr = _itr_stack.back();
+
+ if (itr == _current_node->get_child_end())
+ {
+ _set_state(MCI());
+ }
+ else
+ {
+ _node_stack.push_back(_current_node);
+ _current_itr = itr;
+ _current_node = _deref(itr, is_associative());
+ _state = pre_order_traversal;
+ _itr_stack.push_back(_current_node->get_child_begin());
+ }
+ }
+
+ return *this;
+ }
+
+ template <typename NP, typename MCI>
+ inline depth_first_iterator<NP,MCI>
+ depth_first_iterator<NP,MCI>::operator++(int)
+ {
+ depth_first_iterator<NP,MCI> itr(*this);
+ ++(*this);
+ return itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline depth_first_iterator<NP,MCI>::operator traversal_state() const
+ {
+ return _state;
+ }
+ //->
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+//<-
+#ifdef BOOST_NO_SFINAE
+ bool
+#else
+//->
+ typename ::boost::enable_if< ::boost::mpl::equal_to<MCI1,MCI2>,bool>::type
+//<-
+#endif
+//->
+ operator==(
+ depth_first_iterator<NP1,MCI1> const& lhs
+ , depth_first_iterator<NP2,MCI2> const& rhs
+ );
+
+ //<-
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ inline bool
+#else
+ inline typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator==(
+ depth_first_iterator<NP1,MCI1> const& lhs
+ , depth_first_iterator<NP2,MCI2> const& rhs
+ )
+ {
+ if (lhs._state == rhs._state)
+ {
+ return lhs._state ? (*lhs == *rhs) : !rhs._state;
+ }
+ else
+ {
+ return false;
+ }
+ }
+ //->
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+//<-
+#ifdef BOOST_NO_SFINAE
+ bool
+#else
+//->
+ typename ::boost::enable_if< ::boost::mpl::equal_to<MCI1,MCI2>,bool>::type
+//<-
+#endif
+//->
+ operator!=(
+ depth_first_iterator<NP1,MCI1> const& lhs
+ , depth_first_iterator<NP2,MCI2> const& rhs
+ );
+
+ //<-
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ inline bool
+#else
+ inline typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator!=(
+ depth_first_iterator<NP1,MCI1> const& lhs
+ , depth_first_iterator<NP2,MCI2> const& rhs
+ )
+ {
+ return !(lhs == rhs);
+ }
+ //->
+
+ template <typename NodePointer>
+ depth_first_iterator<NodePointer,::boost::mpl::false_>
+ make_depth_first_iterator(NodePointer const& node);
+
+ //<-
+ template <typename NodePointer>
+ inline depth_first_iterator<NodePointer,::boost::mpl::false_>
+ make_depth_first_iterator(NodePointer const& node)
+ {
+ return depth_first_iterator<NodePointer,::boost::mpl::false_>(node);
+ }
+ //->
+
+ template <typename NodePointer>
+ depth_first_iterator<NodePointer,::boost::mpl::true_>
+ make_depth_first_descendant_iterator(NodePointer const& node);
+
+ //<-
+ template <typename NodePointer>
+ inline depth_first_iterator<NodePointer,::boost::mpl::true_>
+ make_depth_first_descendant_iterator(NodePointer const& node)
+ {
+ return depth_first_iterator<NodePointer,::boost::mpl::true_>(node);
+ }
+ //->
+
+ template <typename NodePointer, typename BinaryFunction>
+ void depth_first_iterate(NodePointer const& node, BinaryFunction function);
+
+ //<-
+ template <typename NodePointer, typename BinaryFunction>
+ void depth_first_iterate(NodePointer const& node, BinaryFunction function)
+ {
+ for (
+ depth_first_iterator<NodePointer,::boost::mpl::false_> itr(node);
+ itr;
+ ++itr
+ )
+ {
+ function(*itr, traversal_state(itr));
+ }
+ }
+ //->
+
+ template <typename NodePointer, typename BinaryFunction>
+ void
+ depth_first_iterate_descendants(
+ NodePointer const& node
+ , BinaryFunction function
+ );
+
+ //<-
+ template <typename NodePointer, typename BinaryFunction>
+ void
+ depth_first_iterate_descendants(
+ NodePointer const& node
+ , BinaryFunction function
+ )
+ {
+ for (
+ depth_first_iterator<NodePointer,::boost::mpl::true_> itr(node);
+ itr;
+ ++itr
+ )
+ {
+ function(*itr, traversal_state(itr));
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_NODE_DEPTH_FIRST_ITERATOR_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/post_order_iterator.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/post_order_iterator.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,616 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_POST_ORDER_ITERATOR_HPP_INCLUDED
+#define BOOST_TREE_NODE_POST_ORDER_ITERATOR_HPP_INCLUDED
+
+#include <iterator>
+#include <deque>
+#include <boost/config.hpp>
+#include <boost/tr1/type_traits.hpp>
+#include <boost/mpl/bool.hpp>
+#include <boost/mpl/eval_if.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/mpl/equal_to.hpp>
+#ifndef BOOST_NO_SFINAE
+#include <boost/utility/enable_if.hpp>
+#endif
+#include <boost/fusion/adapted/std_pair.hpp>
+#include <boost/fusion/support/is_sequence.hpp>
+#include <boost/detail/metafunction/element_type.hpp>
+#include <boost/tree_node/traversal_state.hpp>
+
+//[reference__post_order_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename MimicsChildIterator>
+ class post_order_iterator
+ {
+ //<-
+ typedef typename ::boost::mpl::eval_if<
+ ::std::tr1::is_pointer<NodePointer>
+ , ::std::tr1::remove_pointer<NodePointer>
+ , ::boost::detail::element_type<NodePointer>
+ >::type
+ element_type;
+ typedef typename ::std::tr1::remove_const<element_type>::type
+ node_type;
+ typedef typename ::boost::mpl::if_<
+ ::std::tr1::is_const<element_type>
+ , typename node_type::const_child_iterator
+ , typename node_type::child_iterator
+ >::type
+ child_iterator;
+ typedef typename ::std::iterator_traits<child_iterator>::value_type
+ child_value;
+ typedef typename ::boost::fusion::traits::is_sequence<
+ child_value
+ >::type
+ is_associative;
+ typedef typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_iterator
+ , NodePointer
+ >::type
+ stack_element;
+ //->
+
+ public:
+ typedef // implementation_defined
+ //<-
+ typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_value
+ , NodePointer
+ >::type
+ //->
+ value_type;
+ typedef value_type const&
+ reference;
+ typedef // implementation_defined
+ //<-
+ typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_iterator
+ , value_type const*
+ >::type
+ //->
+ pointer;
+ typedef ::std::ptrdiff_t
+ distance_type;
+ typedef ::std::forward_iterator_tag
+ iterator_category;
+
+ //<-
+ private:
+ struct enabler
+ {
+ };
+
+ std::deque<stack_element> _stack;
+ stack_element _current;
+ traversal_state _state;
+
+ public:
+ //->
+ post_order_iterator();
+
+ explicit post_order_iterator(NodePointer const& node);
+
+ template <typename NP, typename MCI>
+ post_order_iterator(
+ post_order_iterator<NP,MCI> const& other
+//<-
+#ifndef BOOST_NO_SFINAE
+ , typename ::boost::enable_if<
+ typename ::boost::mpl::if_<
+ ::std::tr1::is_convertible<NP,NodePointer>
+ , ::boost::mpl::equal_to<MCI,MimicsChildIterator>
+ , ::boost::mpl::false_
+ >::type
+ , enabler
+ >::type = enabler()
+#endif
+//->
+ );
+
+ reference operator*() const;
+
+ pointer operator->() const;
+
+ post_order_iterator& operator++();
+
+ post_order_iterator operator++(int);
+
+ operator traversal_state() const;
+
+ //<-
+ private:
+ static NodePointer
+ _deref(child_iterator const&, ::boost::mpl::true_);
+
+ static NodePointer
+ _deref(child_iterator const&, ::boost::mpl::false_);
+
+ reference _deref(::boost::mpl::true_) const;
+
+ reference _deref(::boost::mpl::false_) const;
+
+ pointer _indirect(::boost::mpl::true_) const;
+
+ pointer _indirect(::boost::mpl::false_) const;
+
+ NodePointer _current_node(::boost::mpl::true_) const;
+
+ NodePointer const& _current_node(::boost::mpl::false_) const;
+
+ void _push_child(child_iterator const&, ::boost::mpl::true_);
+
+ void _push_child(child_iterator const&, ::boost::mpl::false_);
+
+ void _push_child_itr(child_iterator const&, ::boost::mpl::true_);
+
+ void _push_child_itr(child_iterator const&, ::boost::mpl::false_);
+
+ void _start(NodePointer const&);
+
+ void _initialize(NodePointer const&, ::boost::mpl::true_);
+
+ void _initialize(NodePointer const&, ::boost::mpl::false_);
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ friend bool
+#else
+ friend typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator==(
+ post_order_iterator<NP1,MCI1> const& lhs
+ , post_order_iterator<NP2,MCI2> const& rhs
+ );
+ //->
+ };
+
+ //<-
+ template <typename NP, typename MCI>
+ post_order_iterator<NP,MCI>::post_order_iterator()
+ : _stack(), _current(), _state(no_traversal)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ post_order_iterator<NP,MCI>::post_order_iterator(NP const& node)
+ : _stack()
+ , _current()
+ , _state(node ? post_order_traversal : no_traversal)
+ {
+ if (node)
+ {
+ _initialize(node, MCI());
+ }
+ }
+
+ template <typename NP1, typename MCI1>
+ template <typename NP2, typename MCI2>
+ post_order_iterator<NP1,MCI1>::post_order_iterator(
+ post_order_iterator<NP2,MCI2> const& other
+#ifndef BOOST_NO_SFINAE
+ , typename ::boost::enable_if<
+ typename ::boost::mpl::if_<
+ ::std::tr1::is_convertible<NP2,NP1>
+ , ::boost::mpl::equal_to<MCI2,MCI1>
+ , ::boost::mpl::false_
+ >::type
+ , enabler
+ >::type
+#endif
+ ) : _stack(other._stack.begin(), other._stack.end())
+ , _current(other._current)
+ , _state(other._state)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ inline typename post_order_iterator<NP,MCI>::reference
+ post_order_iterator<NP,MCI>::_deref(::boost::mpl::true_) const
+ {
+ return *_current;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename post_order_iterator<NP,MCI>::reference
+ post_order_iterator<NP,MCI>::_deref(::boost::mpl::false_) const
+ {
+ return _current;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename post_order_iterator<NP,MCI>::reference
+ post_order_iterator<NP,MCI>::operator*() const
+ {
+ return _deref(MCI());
+ }
+
+ template <typename NP, typename MCI>
+ inline typename post_order_iterator<NP,MCI>::pointer
+ post_order_iterator<NP,MCI>::_indirect(::boost::mpl::true_) const
+ {
+ return _current;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename post_order_iterator<NP,MCI>::pointer
+ post_order_iterator<NP,MCI>::_indirect(::boost::mpl::false_) const
+ {
+ return &_current;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename post_order_iterator<NP,MCI>::pointer
+ post_order_iterator<NP,MCI>::operator->() const
+ {
+ return _indirect(MCI());
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ post_order_iterator<NP,MCI>::_deref(
+ child_iterator const& itr
+ , ::boost::mpl::true_
+ )
+ {
+ return itr->second;
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ post_order_iterator<NP,MCI>::_deref(
+ child_iterator const& itr
+ , ::boost::mpl::false_
+ )
+ {
+ return *itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ post_order_iterator<NP,MCI>::_current_node(::boost::mpl::true_) const
+ {
+ return _deref(_current, is_associative());
+ }
+
+ template <typename NP, typename MCI>
+ inline NP const&
+ post_order_iterator<NP,MCI>::_current_node(::boost::mpl::false_) const
+ {
+ return _current;
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ post_order_iterator<NP,MCI>::_push_child(
+ child_iterator const& itr
+ , ::boost::mpl::true_
+ )
+ {
+ _stack.push_back(itr->second);
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ post_order_iterator<NP,MCI>::_push_child(
+ child_iterator const& itr
+ , ::boost::mpl::false_
+ )
+ {
+ _stack.push_back(*itr);
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ post_order_iterator<NP,MCI>::_push_child_itr(
+ child_iterator const& itr
+ , ::boost::mpl::true_
+ )
+ {
+ _stack.push_back(itr);
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ post_order_iterator<NP,MCI>::_push_child_itr(
+ child_iterator const& itr
+ , boost::mpl::false_
+ )
+ {
+ _push_child(itr, is_associative());
+ }
+
+ template <typename NP, typename MCI>
+ void post_order_iterator<NP,MCI>::_start(NP const& n)
+ {
+ child_iterator itr = n->get_child_begin();
+ child_iterator itr_end = n->get_child_end();
+
+ if (itr != itr_end)
+ {
+ NP node(n);
+ ::std::deque<child_iterator> pre_order_stack;
+
+ for (;;)
+ {
+ while (itr != itr_end)
+ {
+ pre_order_stack.push_back(itr);
+ ++itr;
+ }
+
+ _push_child_itr(pre_order_stack.back(), MCI());
+ node = _deref(pre_order_stack.back(), is_associative());
+ pre_order_stack.pop_back();
+
+ if (pre_order_stack.empty())
+ {
+ _current = _stack.back();
+ node = _current_node(MCI());
+ itr = node->get_child_begin();
+ itr_end = node->get_child_end();
+
+ if (itr == itr_end)
+ {
+ _stack.pop_back();
+ break;
+ }
+ }
+ else
+ {
+ itr = node->get_child_begin();
+ itr_end = node->get_child_end();
+ }
+ }
+ }
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ post_order_iterator<NP,MCI>::_initialize(
+ NP const& node
+ , ::boost::mpl::true_
+ )
+ {
+ _start(node);
+
+ if (_stack.empty())
+ {
+ _state = no_traversal;
+ }
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ post_order_iterator<NP,MCI>::_initialize(
+ NP const& node
+ , ::boost::mpl::false_
+ )
+ {
+ _stack.push_back(_current = node);
+ _start(node);
+ }
+
+ template <typename NP, typename MCI>
+ inline post_order_iterator<NP,MCI>&
+ post_order_iterator<NP,MCI>::operator++()
+ {
+ if (_stack.empty())
+ {
+ _state = no_traversal;
+ }
+ else
+ {
+ _current = _stack.back();
+ _stack.pop_back();
+ }
+
+ return *this;
+ }
+
+ template <typename NP, typename MCI>
+ inline post_order_iterator<NP,MCI>
+ post_order_iterator<NP,MCI>::operator++(int)
+ {
+ post_order_iterator<NP,MCI> itr(*this);
+ ++(*this);
+ return itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline post_order_iterator<NP,MCI>::operator traversal_state() const
+ {
+ return _state;
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__post_order_iterator__operator_equals
+namespace boost { namespace tree_node {
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+//<-
+#ifdef BOOST_NO_SFINAE
+ bool
+#else
+//->
+ typename ::boost::enable_if< ::boost::mpl::equal_to<MCI1,MCI2>,bool>::type
+//<-
+#endif
+//->
+ operator==(
+ post_order_iterator<NP1,MCI1> const& lhs
+ , post_order_iterator<NP2,MCI2> const& rhs
+ );
+
+ //<-
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ inline bool
+#else
+ inline typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator==(
+ post_order_iterator<NP1,MCI1> const& lhs
+ , post_order_iterator<NP2,MCI2> const& rhs
+ )
+ {
+ if (lhs._state == rhs._state)
+ {
+ return lhs._state ? (lhs._current == rhs._current) : !rhs._state;
+ }
+ else
+ {
+ return false;
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__post_order_iterator__operator_not_equal
+namespace boost { namespace tree_node {
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+//<-
+#ifdef BOOST_NO_SFINAE
+ bool
+#else
+//->
+ typename ::boost::enable_if< ::boost::mpl::equal_to<MCI1,MCI2>,bool>::type
+//<-
+#endif
+//->
+ operator!=(
+ post_order_iterator<NP1,MCI1> const& lhs
+ , post_order_iterator<NP2,MCI2> const& rhs
+ );
+
+ //<-
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ inline bool
+#else
+ inline typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator!=(
+ post_order_iterator<NP1,MCI1> const& lhs
+ , post_order_iterator<NP2,MCI2> const& rhs
+ )
+ {
+ return !(lhs == rhs);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__make_post_order_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer>
+ post_order_iterator<NodePointer,::boost::mpl::false_>
+ make_post_order_iterator(NodePointer const& node);
+
+ //<-
+ template <typename NodePointer>
+ inline post_order_iterator<NodePointer,::boost::mpl::false_>
+ make_post_order_iterator(NodePointer const& node)
+ {
+ return post_order_iterator<NodePointer,::boost::mpl::false_>(node);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__make_post_order_descendant_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer>
+ post_order_iterator<NodePointer,::boost::mpl::true_>
+ make_post_order_descendant_iterator(NodePointer const& node);
+
+ //<-
+ template <typename NodePointer>
+ inline post_order_iterator<NodePointer,::boost::mpl::true_>
+ make_post_order_descendant_iterator(NodePointer const& node)
+ {
+ return post_order_iterator<NodePointer,::boost::mpl::true_>(node);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__post_order_iterate
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename UnaryFunction>
+ void post_order_iterate(NodePointer const& node, UnaryFunction function);
+
+ //<-
+ template <typename NodePointer, typename UnaryFunction>
+ void post_order_iterate(NodePointer const& node, UnaryFunction function)
+ {
+ for (
+ post_order_iterator<NodePointer,::boost::mpl::false_> itr(node);
+ itr;
+ ++itr
+ )
+ {
+ function(*itr);
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__post_order_iterate_descendants
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ post_order_iterate_descendants(
+ NodePointer const& node
+ , UnaryFunction function
+ );
+
+ //<-
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ post_order_iterate_descendants(
+ NodePointer const& node
+ , UnaryFunction function
+ )
+ {
+ for (
+ post_order_iterator<NodePointer,::boost::mpl::true_> itr(node);
+ itr;
+ ++itr
+ )
+ {
+ function(*itr);
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_NODE_POST_ORDER_ITERATOR_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/pre_order_iterator.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/pre_order_iterator.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,547 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_PRE_ORDER_ITERATOR_HPP_INCLUDED
+#define BOOST_TREE_NODE_PRE_ORDER_ITERATOR_HPP_INCLUDED
+
+#include <iterator>
+#include <deque>
+#include <boost/config.hpp>
+#include <boost/tr1/type_traits.hpp>
+#include <boost/mpl/bool.hpp>
+#include <boost/mpl/eval_if.hpp>
+#include <boost/mpl/if.hpp>
+#ifndef BOOST_NO_SFINAE
+#include <boost/utility/enable_if.hpp>
+#endif
+#include <boost/utility/enable_if.hpp>
+#include <boost/fusion/adapted/std_pair.hpp>
+#include <boost/fusion/support/is_sequence.hpp>
+#include <boost/detail/metafunction/element_type.hpp>
+#include <boost/tree_node/traversal_state.hpp>
+
+//[reference__pre_order_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename MimicsChildIterator>
+ class pre_order_iterator
+ {
+ //<-
+ typedef typename ::boost::mpl::eval_if<
+ ::std::tr1::is_pointer<NodePointer>
+ , ::std::tr1::remove_pointer<NodePointer>
+ , ::boost::detail::element_type<NodePointer>
+ >::type
+ element_type;
+ typedef typename ::std::tr1::remove_const<element_type>::type
+ node_type;
+ typedef typename ::boost::mpl::if_<
+ ::std::tr1::is_const<element_type>
+ , typename node_type::const_child_iterator
+ , typename node_type::child_iterator
+ >::type
+ child_iterator;
+ typedef typename ::std::iterator_traits<child_iterator>::value_type
+ child_value;
+ typedef typename ::boost::fusion::traits::is_sequence<
+ child_value
+ >::type
+ is_associative;
+ //->
+
+ public:
+ typedef // implementation_defined
+ //<-
+ typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_value
+ , NodePointer
+ >::type
+ //->
+ value_type;
+ typedef value_type const&
+ reference;
+ typedef // implementation_defined
+ //<-
+ typename ::boost::mpl::if_<
+ MimicsChildIterator
+ , child_iterator
+ , value_type const*
+ >::type
+ //->
+ pointer;
+ typedef ::std::ptrdiff_t
+ distance_type;
+ typedef ::std::forward_iterator_tag
+ iterator_category;
+
+ //<-
+ private:
+#ifndef BOOST_NO_SFINAE
+ struct enabler
+ {
+ };
+#endif
+
+ ::std::deque<NodePointer> _node_stack;
+ ::std::deque<child_iterator> _itr_stack;
+ NodePointer _current_node;
+ child_iterator _current_itr;
+ traversal_state _state;
+
+ public:
+ //->
+ pre_order_iterator();
+
+ explicit pre_order_iterator(NodePointer const& node);
+
+ template <typename NP, typename MCI>
+ pre_order_iterator(
+ pre_order_iterator<NP,MCI> const& other
+//<-
+#ifndef BOOST_NO_SFINAE
+ , typename ::boost::enable_if<
+ typename ::boost::mpl::if_<
+ ::std::tr1::is_convertible<NP,NodePointer>
+ , ::boost::mpl::equal_to<MCI,MimicsChildIterator>
+ , ::boost::mpl::false_
+ >::type
+ , enabler
+ >::type = enabler()
+#endif
+//->
+ );
+
+ reference operator*() const;
+
+ pointer operator->() const;
+
+ pre_order_iterator& operator++();
+
+ pre_order_iterator operator++(int);
+
+ operator traversal_state() const;
+
+ //<-
+ private:
+ static NodePointer
+ _deref(child_iterator const&, ::boost::mpl::true_);
+
+ static NodePointer
+ _deref(child_iterator const&, ::boost::mpl::false_);
+
+ reference _deref(::boost::mpl::true_) const;
+
+ reference _deref(::boost::mpl::false_) const;
+
+ pointer _indirect(::boost::mpl::true_) const;
+
+ pointer _indirect(::boost::mpl::false_) const;
+
+ void _initialize(::boost::mpl::true_);
+
+ void _initialize(::boost::mpl::false_);
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ friend bool
+#else
+ friend typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator==(
+ pre_order_iterator<NP1,MCI1> const& lhs
+ , pre_order_iterator<NP2,MCI2> const& rhs
+ );
+ //->
+ };
+
+ //<-
+ template <typename NP, typename MCI>
+ pre_order_iterator<NP,MCI>::pre_order_iterator()
+ : _node_stack()
+ , _itr_stack()
+ , _current_node()
+ , _current_itr()
+ , _state(no_traversal)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ pre_order_iterator<NP,MCI>::pre_order_iterator(NP const& node)
+ : _node_stack()
+ , _itr_stack()
+ , _current_node(node)
+ , _current_itr()
+ , _state(node ? pre_order_traversal : no_traversal)
+ {
+ if (node)
+ {
+ _itr_stack.push_back(node->get_child_begin());
+ _initialize(MCI());
+ }
+ }
+
+ template <typename NP1, typename MCI1>
+ template <typename NP2, typename MCI2>
+ pre_order_iterator<NP1,MCI1>::pre_order_iterator(
+ pre_order_iterator<NP2,MCI2> const& other
+#ifndef BOOST_NO_SFINAE
+ , typename ::boost::enable_if<
+ typename ::boost::mpl::if_<
+ ::std::tr1::is_convertible<NP2,NP1>
+ , ::boost::mpl::equal_to<MCI2,MCI1>
+ , ::boost::mpl::false_
+ >::type
+ , enabler
+ >::type
+#endif
+ ) : _node_stack(other._node_stack.begin(), other._node_stack.end())
+ , _itr_stack(other._itr_stack.begin(), other._itr_stack.end())
+ , _current_node(other._current_node)
+ , _current_itr(other._current_itr)
+ , _state(other._state)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ pre_order_iterator<NP,MCI>::_initialize(::boost::mpl::true_)
+ {
+ ++(*this);
+ }
+
+ template <typename NP, typename MCI>
+ inline void
+ pre_order_iterator<NP,MCI>::_initialize(::boost::mpl::false_)
+ {
+ }
+
+ template <typename NP, typename MCI>
+ inline typename pre_order_iterator<NP,MCI>::reference
+ pre_order_iterator<NP,MCI>::_deref(::boost::mpl::true_) const
+ {
+ return *_current_itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename pre_order_iterator<NP,MCI>::reference
+ pre_order_iterator<NP,MCI>::_deref(::boost::mpl::false_) const
+ {
+ return _current_node;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename pre_order_iterator<NP,MCI>::reference
+ pre_order_iterator<NP,MCI>::operator*() const
+ {
+ return _deref(MCI());
+ }
+
+ template <typename NP, typename MCI>
+ inline typename pre_order_iterator<NP,MCI>::pointer
+ pre_order_iterator<NP,MCI>::_indirect(::boost::mpl::true_) const
+ {
+ return _current_itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename pre_order_iterator<NP,MCI>::pointer
+ pre_order_iterator<NP,MCI>::_indirect(::boost::mpl::false_) const
+ {
+ return &_current_node;
+ }
+
+ template <typename NP, typename MCI>
+ inline typename pre_order_iterator<NP,MCI>::pointer
+ pre_order_iterator<NP,MCI>::operator->() const
+ {
+ return _indirect(MCI());
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ pre_order_iterator<NP,MCI>::_deref(
+ child_iterator const& itr
+ , ::boost::mpl::true_
+ )
+ {
+ return itr->second;
+ }
+
+ template <typename NP, typename MCI>
+ inline NP
+ pre_order_iterator<NP,MCI>::_deref(
+ child_iterator const& itr
+ , ::boost::mpl::false_
+ )
+ {
+ return *itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline pre_order_iterator<NP,MCI>& pre_order_iterator<NP,MCI>::operator++()
+ {
+ if (_itr_stack.back() == _current_node->get_child_end())
+ {
+ bool is_post_order = true;
+
+ while (is_post_order)
+ {
+ _itr_stack.pop_back();
+
+ if (_node_stack.empty())
+ {
+ _state = no_traversal;
+
+ while (!_itr_stack.empty())
+ {
+ _itr_stack.pop_back();
+ }
+
+ is_post_order = false;
+ }
+ else
+ {
+ _current_node = _node_stack.back();
+ _node_stack.pop_back();
+
+ if (++_current_itr == _current_node->get_child_end())
+ {
+ child_iterator itr = _itr_stack.back();
+
+ _itr_stack.pop_back();
+
+ if (!_itr_stack.empty())
+ {
+ _current_itr = _itr_stack.back();
+ }
+
+ _itr_stack.push_back(itr);
+ }
+ else
+ {
+ _itr_stack.pop_back();
+ _node_stack.push_back(_current_node);
+ _itr_stack.push_back(_current_itr);
+ _current_node = _deref(_current_itr, is_associative());
+ _itr_stack.push_back(
+ _current_node->get_child_begin()
+ );
+ is_post_order = false;
+ }
+ }
+ }
+ }
+ else
+ {
+ _node_stack.push_back(_current_node);
+ _current_node = _deref(
+ _current_itr = _itr_stack.back()
+ , is_associative()
+ );
+ _itr_stack.push_back(_current_node->get_child_begin());
+ }
+
+ return *this;
+ }
+
+ template <typename NP, typename MCI>
+ inline pre_order_iterator<NP,MCI>
+ pre_order_iterator<NP,MCI>::operator++(int)
+ {
+ pre_order_iterator<NP,MCI> itr(*this);
+ ++(*this);
+ return itr;
+ }
+
+ template <typename NP, typename MCI>
+ inline pre_order_iterator<NP,MCI>::operator traversal_state() const
+ {
+ return _state;
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__pre_order_iterator__operator_equals
+namespace boost { namespace tree_node {
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+//<-
+#ifdef BOOST_NO_SFINAE
+ bool
+#else
+//->
+ typename ::boost::enable_if< ::boost::mpl::equal_to<MCI1,MCI2>,bool>::type
+//<-
+#endif
+//->
+ operator==(
+ pre_order_iterator<NP1,MCI1> const& lhs
+ , pre_order_iterator<NP2,MCI2> const& rhs
+ );
+
+ //<-
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ inline bool
+#else
+ inline typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator==(
+ pre_order_iterator<NP1,MCI1> const& lhs
+ , pre_order_iterator<NP2,MCI2> const& rhs
+ )
+ {
+ if (lhs._state == rhs._state)
+ {
+ return lhs._state ? (*lhs == *rhs) : !rhs._state;
+ }
+ else
+ {
+ return false;
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__pre_order_iterator__operator_not_equal
+namespace boost { namespace tree_node {
+
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+//<-
+#ifdef BOOST_NO_SFINAE
+ bool
+#else
+//->
+ typename ::boost::enable_if< ::boost::mpl::equal_to<MCI1,MCI2>,bool>::type
+//<-
+#endif
+//->
+ operator!=(
+ pre_order_iterator<NP1,MCI1> const& lhs
+ , pre_order_iterator<NP2,MCI2> const& rhs
+ );
+
+ //<-
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+#ifdef BOOST_NO_SFINAE
+ inline bool
+#else
+ inline typename ::boost::enable_if<
+ ::boost::mpl::equal_to<MCI1,MCI2>
+ , bool
+ >::type
+#endif
+ operator!=(
+ pre_order_iterator<NP1,MCI1> const& lhs
+ , pre_order_iterator<NP2,MCI2> const& rhs
+ )
+ {
+ return !(lhs == rhs);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__make_pre_order_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer>
+ pre_order_iterator<NodePointer,::boost::mpl::false_>
+ make_pre_order_iterator(NodePointer const& node);
+
+ //<-
+ template <typename NodePointer>
+ inline pre_order_iterator<NodePointer,::boost::mpl::false_>
+ make_pre_order_iterator(NodePointer const& node)
+ {
+ return pre_order_iterator<NodePointer,::boost::mpl::false_>(node);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__make_pre_order_descendant_iterator
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer>
+ pre_order_iterator<NodePointer,::boost::mpl::true_>
+ make_pre_order_descendant_iterator(NodePointer const& node);
+
+ //<-
+ template <typename NodePointer>
+ inline pre_order_iterator<NodePointer,::boost::mpl::true_>
+ make_pre_order_descendant_iterator(NodePointer const& node)
+ {
+ return pre_order_iterator<NodePointer,::boost::mpl::true_>(node);
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__pre_order_iterate
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename UnaryFunction>
+ void pre_order_iterate(NodePointer const& node, UnaryFunction function);
+
+ //<-
+ template <typename NodePointer, typename UnaryFunction>
+ void pre_order_iterate(NodePointer const& node, UnaryFunction function)
+ {
+ for (
+ pre_order_iterator<NodePointer,::boost::mpl::false_> itr(node);
+ itr;
+ ++itr
+ )
+ {
+ function(*itr);
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+//[reference__pre_order_iterate_descendants
+namespace boost { namespace tree_node {
+
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ pre_order_iterate_descendants(
+ NodePointer const& node
+ , UnaryFunction function
+ );
+
+ //<-
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ pre_order_iterate_descendants(
+ NodePointer const& node
+ , UnaryFunction function
+ )
+ {
+ for (
+ pre_order_iterator<NodePointer,::boost::mpl::true_> itr(node);
+ itr;
+ ++itr
+ )
+ {
+ function(*itr);
+ }
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_NODE_PRE_ORDER_ITERATOR_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/raw_associative_node.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/raw_associative_node.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,360 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_RAW_ASSOCIATIVE_NODE_HPP_INCLUDED
+#define BOOST_TREE_NODE_RAW_ASSOCIATIVE_NODE_HPP_INCLUDED
+
+#include <utility>
+#include <boost/mpl/bool.hpp>
+#include <boost/mpl/apply_wrap.hpp>
+#include <boost/tr1/tuple.hpp>
+#include <boost/utility/associative_container_gen.hpp>
+#include <boost/tree_node/depth_first_iterator.hpp>
+
+//[reference__raw_associative_node
+namespace boost { namespace tree_node {
+
+ template <
+ typename Key
+ , typename Data
+ , typename AssociativeContainerSelector = mapS
+ >
+ class raw_associative_node
+ {
+ public:
+ typedef Key
+ key_type;
+ typedef Data
+ data_type;
+ typedef raw_associative_node*
+ pointer;
+ typedef raw_associative_node const*
+ const_pointer;
+
+ //<-
+ private:
+ typedef typename ::boost::mpl::apply_wrap2<
+ associative_container_gen<
+ AssociativeContainerSelector
+ >
+ , Key
+ , pointer
+ >::type
+ children;
+
+ public:
+ //->
+ typedef // implementation_defined
+ //<-
+ typename children::iterator
+ //->
+ child_iterator;
+ typedef // implementation_defined
+ //<-
+ typename children::const_iterator
+ //->
+ const_child_iterator;
+
+ //<-
+ private:
+ children _children;
+ pointer _parent;
+ data_type _data;
+
+ public:
+ //->
+ raw_associative_node();
+
+ explicit raw_associative_node(data_type const& data);
+
+ raw_associative_node(raw_associative_node const& copy);
+
+ raw_associative_node&
+ operator=(raw_associative_node const& copy);
+
+ ~raw_associative_node();
+
+ data_type const& get_data() const;
+
+ data_type& get_data();
+
+ const_pointer get_parent() const;
+
+ pointer get_parent();
+
+ pointer add_child(key_type const& key, data_type const& data);
+
+ pointer add_child(key_type const& key);
+
+ pointer add_child_copy(key_type const& key, const_pointer const& copy);
+
+ const_child_iterator get_child_begin() const;
+
+ child_iterator get_child_begin();
+
+ const_child_iterator get_child_end() const;
+
+ child_iterator get_child_end();
+
+ const_child_iterator find_child(key_type const& key) const;
+
+ child_iterator find_child(key_type const& key);
+
+ ::std::pair<const_child_iterator,const_child_iterator>
+ find_children(key_type const& key) const;
+
+ ::std::pair<child_iterator,child_iterator>
+ find_children(key_type const& key);
+
+ ::std::size_t remove_children(key_type const& key);
+
+ void remove_all_children();
+ };
+
+ //<-
+ template <typename K, typename D, typename A>
+ raw_associative_node<K,D,A>::raw_associative_node()
+ : _children(), _parent(), _data()
+ {
+ }
+
+ template <typename K, typename D, typename A>
+ raw_associative_node<K,D,A>::raw_associative_node(data_type const& data)
+ : _children(), _parent(), _data(data)
+ {
+ }
+
+ template <typename K, typename D, typename A>
+ raw_associative_node<K,D,A>::raw_associative_node(
+ raw_associative_node const& copy
+ ) : _children(), _parent(), _data(copy._data)
+ {
+ pointer p = this;
+
+ for (
+ depth_first_iterator<const_pointer,::boost::mpl::true_> copy_itr(
+ &copy
+ );
+ copy_itr;
+ ++copy_itr
+ )
+ {
+ switch (traversal_state(copy_itr))
+ {
+ case pre_order_traversal:
+ {
+ p = p->add_child(
+ copy_itr->first
+ , copy_itr->second->get_data()
+ );
+ break;
+ }
+
+ case post_order_traversal:
+ {
+ p = p->_parent;
+ break;
+ }
+ }
+ }
+ }
+
+ template <typename K, typename D, typename A>
+ raw_associative_node<K,D,A>&
+ raw_associative_node<K,D,A>::operator=(
+ raw_associative_node const& copy
+ )
+ {
+ if (this != &copy)
+ {
+ raw_associative_node temp_copy(copy);
+
+ remove_all_children();
+ _children = temp_copy._children;
+ _data = temp_copy._data;
+ temp_copy._children.clear();
+
+ child_iterator itr_end = get_child_end();
+
+ for (child_iterator itr = get_child_begin(); itr != itr_end; ++itr)
+ {
+ itr->second->_parent = this;
+ }
+ }
+
+ return *this;
+ }
+
+ template <typename K, typename D, typename A>
+ raw_associative_node<K,D,A>::~raw_associative_node()
+ {
+ remove_all_children();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::data_type const&
+ raw_associative_node<K,D,A>::get_data() const
+ {
+ return _data;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::data_type&
+ raw_associative_node<K,D,A>::get_data()
+ {
+ return _data;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::const_pointer
+ raw_associative_node<K,D,A>::get_parent() const
+ {
+ return _parent;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::pointer
+ raw_associative_node<K,D,A>::get_parent()
+ {
+ return _parent;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::pointer
+ raw_associative_node<K,D,A>::add_child(
+ key_type const& key
+ , data_type const& data
+ )
+ {
+ pointer child(new raw_associative_node(data));
+
+ child->_parent = this;
+ _children.insert(typename children::value_type(key, child));
+ return child;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::pointer
+ raw_associative_node<K,D,A>::add_child(key_type const& key)
+ {
+ pointer child(new raw_associative_node());
+
+ child->_parent = this;
+ _children.insert(typename children::value_type(key, child));
+ return child;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::pointer
+ raw_associative_node<K,D,A>::add_child_copy(
+ key_type const& key
+ , const_pointer const& copy
+ )
+ {
+ pointer child(new raw_associative_node(*copy));
+
+ child->_parent = this;
+ _children.insert(typename children::value_type(key, child));
+ return child;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::const_child_iterator
+ raw_associative_node<K,D,A>::get_child_begin() const
+ {
+ return _children.begin();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::child_iterator
+ raw_associative_node<K,D,A>::get_child_begin()
+ {
+ return _children.begin();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::const_child_iterator
+ raw_associative_node<K,D,A>::get_child_end() const
+ {
+ return _children.end();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::child_iterator
+ raw_associative_node<K,D,A>::get_child_end()
+ {
+ return _children.end();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::const_child_iterator
+ raw_associative_node<K,D,A>::find_child(key_type const& key) const
+ {
+ return _children.find(key);
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename raw_associative_node<K,D,A>::child_iterator
+ raw_associative_node<K,D,A>::find_child(key_type const& key)
+ {
+ return _children.find(key);
+ }
+
+ template <typename K, typename D, typename A>
+ inline ::std::pair<
+ typename raw_associative_node<K,D,A>::const_child_iterator
+ , typename raw_associative_node<K,D,A>::const_child_iterator
+ >
+ raw_associative_node<K,D,A>::find_children(key_type const& key) const
+ {
+ return _children.equal_range(key);
+ }
+
+ template <typename K, typename D, typename A>
+ inline ::std::pair<
+ typename raw_associative_node<K,D,A>::child_iterator
+ , typename raw_associative_node<K,D,A>::child_iterator
+ >
+ raw_associative_node<K,D,A>::find_children(key_type const& key)
+ {
+ return _children.equal_range(key);
+ }
+
+ template <typename K, typename D, typename A>
+ ::std::size_t
+ raw_associative_node<K,D,A>::remove_children(key_type const& key)
+ {
+ child_iterator itr, itr_end;
+
+ for (
+ ::std::tr1::tie(itr, itr_end) = _children.equal_range(key);
+ itr != itr_end;
+ ++itr
+ )
+ {
+ delete itr->second;
+ }
+
+ return _children.erase(key);
+ }
+
+ template <typename K, typename D, typename A>
+ void raw_associative_node<K,D,A>::remove_all_children()
+ {
+ child_iterator itr_end = get_child_end();
+
+ for (child_iterator itr = get_child_begin(); itr != itr_end; ++itr)
+ {
+ delete itr->second;
+ }
+
+ _children.clear();
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_NODE_RAW_ASSOCIATIVE_NODE_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/raw_node.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/raw_node.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,277 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_RAW_NODE_HPP_INCLUDED
+#define BOOST_TREE_NODE_RAW_NODE_HPP_INCLUDED
+
+#include <deque>
+#include <boost/mpl/bool.hpp>
+#include <boost/tree_node/depth_first_iterator.hpp>
+
+//[reference__raw_node
+namespace boost { namespace tree_node {
+
+ template <typename T>
+ class raw_node
+ {
+ public:
+ typedef T
+ data_type;
+ typedef raw_node*
+ pointer;
+ typedef raw_node const*
+ const_pointer;
+
+ //<-
+ private:
+ typedef ::std::deque<pointer>
+ children;
+
+ public:
+ //->
+ typedef // implementation_defined
+ //<-
+ typename children::iterator
+ //->
+ child_iterator;
+ typedef // implementation_defined
+ //<-
+ typename children::const_iterator
+ //->
+ const_child_iterator;
+
+ //<-
+ private:
+ children _children;
+ pointer _parent;
+ data_type _data;
+
+ raw_node(data_type const& data, pointer const& parent);
+
+ explicit raw_node(pointer const& parent);
+
+ public:
+ //->
+ raw_node();
+
+ explicit raw_node(data_type const& data);
+
+ raw_node(raw_node const& copy);
+
+ raw_node& operator=(raw_node const& copy);
+
+ ~raw_node();
+
+ data_type const& get_data() const;
+
+ data_type& get_data();
+
+ const_pointer get_parent() const;
+
+ pointer get_parent();
+
+ pointer add_child(data_type const& data);
+
+ pointer add_child();
+
+ pointer add_child_copy(const_pointer const& copy);
+
+ const_child_iterator get_child_begin() const;
+
+ child_iterator get_child_begin();
+
+ const_child_iterator get_child_end() const;
+
+ child_iterator get_child_end();
+
+ void remove_all_children();
+ };
+
+ //<-
+ template <typename T>
+ raw_node<T>::raw_node(data_type const& data, pointer const& parent)
+ : _children(), _parent(parent), _data(data)
+ {
+ if (parent)
+ {
+ parent->_children.push_back(this);
+ }
+ }
+
+ template <typename T>
+ raw_node<T>::raw_node(pointer const& parent)
+ : _children(), _parent(parent), _data()
+ {
+ if (parent)
+ {
+ parent->_children.push_back(this);
+ }
+ }
+
+ template <typename T>
+ raw_node<T>::raw_node() : _children(), _parent(), _data()
+ {
+ }
+
+ template <typename T>
+ raw_node<T>::raw_node(data_type const& data)
+ : _children(), _parent(), _data(data)
+ {
+ }
+
+ template <typename T>
+ raw_node<T>::raw_node(raw_node const& copy)
+ : _children(), _parent(), _data(copy._data)
+ {
+ pointer p = this;
+
+ for (
+ depth_first_iterator<const_pointer,::boost::mpl::true_> copy_itr(
+ &copy
+ );
+ copy_itr;
+ ++copy_itr
+ )
+ {
+ switch (traversal_state(copy_itr))
+ {
+ case pre_order_traversal:
+ {
+ p = p->add_child((*copy_itr)->get_data());
+ break;
+ }
+
+ case post_order_traversal:
+ {
+ p = p->_parent;
+ break;
+ }
+ }
+ }
+ }
+
+ template <typename T>
+ raw_node<T>& raw_node<T>::operator=(raw_node const& copy)
+ {
+ if (this != &copy)
+ {
+ raw_node temp_copy(copy);
+
+ remove_all_children();
+ _children = temp_copy._children;
+ _data = temp_copy._data;
+ temp_copy._children.clear();
+
+ child_iterator itr_end = get_child_end();
+
+ for (child_iterator itr = get_child_begin(); itr != itr_end; ++itr)
+ {
+ (*itr)->_parent = this;
+ }
+ }
+
+ return *this;
+ }
+
+ template <typename T>
+ raw_node<T>::~raw_node()
+ {
+ remove_all_children();
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::data_type const& raw_node<T>::get_data() const
+ {
+ return _data;
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::data_type& raw_node<T>::get_data()
+ {
+ return _data;
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::const_pointer raw_node<T>::get_parent() const
+ {
+ return _parent;
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::pointer raw_node<T>::get_parent()
+ {
+ return _parent;
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::pointer
+ raw_node<T>::add_child(data_type const& data)
+ {
+ return new raw_node(data, this);
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::pointer raw_node<T>::add_child()
+ {
+ return new raw_node(this);
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::pointer
+ raw_node<T>::add_child_copy(const_pointer const& copy)
+ {
+ pointer child = new raw_node(*copy);
+
+ child->_parent = this;
+ _children.push_back(child);
+ return child;
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::const_child_iterator
+ raw_node<T>::get_child_begin() const
+ {
+ return _children.begin();
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::child_iterator
+ raw_node<T>::get_child_begin()
+ {
+ return _children.begin();
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::const_child_iterator
+ raw_node<T>::get_child_end() const
+ {
+ return _children.end();
+ }
+
+ template <typename T>
+ inline typename raw_node<T>::child_iterator
+ raw_node<T>::get_child_end()
+ {
+ return _children.end();
+ }
+
+ template <typename T>
+ void raw_node<T>::remove_all_children()
+ {
+ child_iterator itr_end = get_child_end();
+
+ for (child_iterator itr = get_child_begin(); itr != itr_end; ++itr)
+ {
+ delete *itr;
+ }
+
+ _children.clear();
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_NODE_RAW_NODE_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/simple_associative_node.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/simple_associative_node.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,362 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_SIMPLE_ASSOCIATIVE_NODE_HPP_INCLUDED
+#define BOOST_TREE_NODE_SIMPLE_ASSOCIATIVE_NODE_HPP_INCLUDED
+
+#include <utility>
+#include <boost/mpl/bool.hpp>
+#include <boost/mpl/apply_wrap.hpp>
+#include <boost/noncopyable.hpp>
+#include <boost/tr1/memory.hpp>
+#include <boost/tr1/tuple.hpp>
+#include <boost/utility/associative_container_gen.hpp>
+#include <boost/tree_node/depth_first_iterator.hpp>
+
+//[reference__simple_associative_node
+namespace boost { namespace tree_node {
+
+ template <
+ typename Key
+ , typename Data
+ , typename AssociativeContainerSelector = mapS
+ >
+ class simple_associative_node
+ : public ::std::tr1::enable_shared_from_this<
+ simple_associative_node<Key,Data,AssociativeContainerSelector>
+ >
+ , private noncopyable
+ {
+ public:
+ typedef Key
+ key_type;
+ typedef Data
+ data_type;
+ typedef ::std::tr1::shared_ptr<simple_associative_node>
+ pointer;
+ typedef ::std::tr1::shared_ptr<simple_associative_node const>
+ const_pointer;
+
+ //<-
+ private:
+ typedef typename ::boost::mpl::apply_wrap2<
+ associative_container_gen<
+ AssociativeContainerSelector
+ >
+ , key_type
+ , pointer
+ >::type
+ children;
+
+ public:
+ //->
+ typedef // implementation_defined
+ //<-
+ typename children::iterator
+ //->
+ child_iterator;
+ typedef // implementation_defined
+ //<-
+ typename children::const_iterator
+ //->
+ const_child_iterator;
+
+ //<-
+ private:
+ children _children;
+ ::std::tr1::weak_ptr<simple_associative_node> _parent;
+ data_type _data;
+
+ simple_associative_node();
+
+ explicit simple_associative_node(data_type const& data);
+
+ public:
+ //->
+ ~simple_associative_node();
+
+ data_type const& get_data() const;
+
+ data_type& get_data();
+
+ const_pointer get_parent() const;
+
+ pointer get_parent();
+
+ pointer add_child(key_type const& key, data_type const& data);
+
+ pointer add_child(key_type const& key);
+
+ pointer add_child_copy(key_type const& key, const_pointer const& copy);
+
+ const_child_iterator get_child_begin() const;
+
+ child_iterator get_child_begin();
+
+ const_child_iterator get_child_end() const;
+
+ child_iterator get_child_end();
+
+ const_child_iterator find_child(key_type const& key) const;
+
+ child_iterator find_child(key_type const& key);
+
+ ::std::pair<const_child_iterator,const_child_iterator>
+ find_children(key_type const& key) const;
+
+ ::std::pair<child_iterator,child_iterator>
+ find_children(key_type const& key);
+
+ ::std::size_t remove_children(Key const& key);
+
+ void remove_all_children();
+
+ static pointer create(data_type const& data);
+
+ static pointer create();
+
+ static pointer create_copy(const_pointer const& p);
+ };
+
+ //<-
+ template <typename K, typename D, typename A>
+ simple_associative_node<K,D,A>::simple_associative_node()
+ : _children(), _parent(), _data()
+ {
+ }
+
+ template <typename K, typename D, typename A>
+ simple_associative_node<K,D,A>::simple_associative_node(data_type const& d)
+ : _children(), _parent(), _data(d)
+ {
+ }
+
+ template <typename K, typename D, typename A>
+ simple_associative_node<K,D,A>::~simple_associative_node()
+ {
+ remove_all_children();
+ _parent.reset();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::data_type const&
+ simple_associative_node<K,D,A>::get_data() const
+ {
+ return _data;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::data_type&
+ simple_associative_node<K,D,A>::get_data()
+ {
+ return _data;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::const_pointer
+ simple_associative_node<K,D,A>::get_parent() const
+ {
+ return const_pointer(_parent.lock());
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::pointer
+ simple_associative_node<K,D,A>::get_parent()
+ {
+ return pointer(_parent.lock());
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::pointer
+ simple_associative_node<K,D,A>::add_child(
+ key_type const& key
+ , data_type const& data
+ )
+ {
+ pointer child(new simple_associative_node(data));
+
+ child->_parent = this->shared_from_this();
+ _children.insert(typename children::value_type(key, child));
+ return child;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::pointer
+ simple_associative_node<K,D,A>::add_child(key_type const& key)
+ {
+ pointer child(new simple_associative_node());
+
+ child->_parent = this->shared_from_this();
+ _children.insert(typename children::value_type(key, child));
+ return child;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::pointer
+ simple_associative_node<K,D,A>::add_child_copy(
+ key_type const& key
+ , const_pointer const& copy
+ )
+ {
+ pointer child(create_copy(copy));
+
+ child->_parent = this->shared_from_this();
+ _children.insert(typename children::value_type(key, child));
+ return child;
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::const_child_iterator
+ simple_associative_node<K,D,A>::get_child_begin() const
+ {
+ return _children.begin();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::child_iterator
+ simple_associative_node<K,D,A>::get_child_begin()
+ {
+ return _children.begin();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::const_child_iterator
+ simple_associative_node<K,D,A>::get_child_end() const
+ {
+ return _children.end();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::child_iterator
+ simple_associative_node<K,D,A>::get_child_end()
+ {
+ return _children.end();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::const_child_iterator
+ simple_associative_node<K,D,A>::find_child(key_type const& key) const
+ {
+ return _children.find(key);
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::child_iterator
+ simple_associative_node<K,D,A>::find_child(key_type const& key)
+ {
+ return _children.find(key);
+ }
+
+ template <typename K, typename D, typename A>
+ inline ::std::pair<
+ typename simple_associative_node<K,D,A>::const_child_iterator
+ , typename simple_associative_node<K,D,A>::const_child_iterator
+ >
+ simple_associative_node<K,D,A>::find_children(
+ key_type const& key
+ ) const
+ {
+ return _children.equal_range(key);
+ }
+
+ template <typename K, typename D, typename A>
+ inline ::std::pair<
+ typename simple_associative_node<K,D,A>::child_iterator
+ , typename simple_associative_node<K,D,A>::child_iterator
+ >
+ simple_associative_node<K,D,A>::find_children(key_type const& key)
+ {
+ return _children.equal_range(key);
+ }
+
+ template <typename K, typename D, typename A>
+ ::std::size_t
+ simple_associative_node<K,D,A>::remove_children(key_type const& key)
+ {
+ child_iterator itr, itr_end;
+
+ for (
+ ::std::tr1::tie(itr, itr_end) = _children.equal_range(key);
+ itr != itr_end;
+ ++itr
+ )
+ {
+ itr->second->remove_all_children();
+ itr->second->_parent.reset();
+ }
+
+ return _children.erase(key);
+ }
+
+ template <typename K, typename D, typename A>
+ void simple_associative_node<K,D,A>::remove_all_children()
+ {
+ child_iterator itr_end = get_child_end();
+
+ for (child_iterator itr = get_child_begin(); itr != itr_end; ++itr)
+ {
+ itr->second->remove_all_children();
+ itr->second->_parent.reset();
+ }
+
+ _children.clear();
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::pointer
+ simple_associative_node<K,D,A>::create(data_type const& data)
+ {
+ return pointer(new simple_associative_node(data));
+ }
+
+ template <typename K, typename D, typename A>
+ inline typename simple_associative_node<K,D,A>::pointer
+ simple_associative_node<K,D,A>::create()
+ {
+ return pointer(new simple_associative_node());
+ }
+
+ template <typename K, typename D, typename A>
+ typename simple_associative_node<K,D,A>::pointer
+ simple_associative_node<K,D,A>::create_copy(const_pointer const& copy)
+ {
+ pointer result(new simple_associative_node(copy->get_data()));
+ pointer p(result);
+
+ for (
+ depth_first_iterator<const_pointer,::boost::mpl::true_> copy_itr(
+ copy
+ );
+ copy_itr;
+ ++copy_itr
+ )
+ {
+ switch (traversal_state(copy_itr))
+ {
+ case pre_order_traversal:
+ {
+ p = p->add_child(
+ copy_itr->first
+ , copy_itr->second->get_data()
+ );
+ break;
+ }
+
+ case post_order_traversal:
+ {
+ p = p->get_parent();
+ break;
+ }
+ }
+ }
+
+ return result;
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_NODE_SIMPLE_ASSOCIATIVE_NODE_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/simple_node.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/simple_node.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,264 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_SIMPLE_NODE_HPP_INCLUDED
+#define BOOST_TREE_NODE_SIMPLE_NODE_HPP_INCLUDED
+
+#include <deque>
+#include <boost/mpl/bool.hpp>
+#include <boost/noncopyable.hpp>
+#include <boost/tr1/memory.hpp>
+#include <boost/tree_node/depth_first_iterator.hpp>
+
+//[reference__simple_node
+namespace boost { namespace tree_node {
+
+ template <typename T>
+ class simple_node
+ : public ::std::tr1::enable_shared_from_this<simple_node<T> >
+ , private noncopyable
+ {
+ public:
+ typedef T
+ data_type;
+ typedef ::std::tr1::shared_ptr<simple_node>
+ pointer;
+ typedef ::std::tr1::shared_ptr<simple_node const>
+ const_pointer;
+
+ //<-
+ private:
+ typedef ::std::deque<pointer>
+ children;
+
+ public:
+ //->
+ typedef // implementation_defined
+ //<-
+ typename children::iterator
+ //->
+ child_iterator;
+ typedef // implementation_defined
+ //<-
+ typename children::const_iterator
+ //->
+ const_child_iterator;
+
+ //<-
+ private:
+ children _children;
+ ::std::tr1::weak_ptr<simple_node> _parent;
+ data_type _data;
+
+ simple_node();
+
+ explicit simple_node(data_type const& data);
+
+ public:
+ //->
+ ~simple_node();
+
+ data_type const& get_data() const;
+
+ data_type& get_data();
+
+ const_pointer get_parent() const;
+
+ pointer get_parent();
+
+ pointer add_child(data_type const& data);
+
+ pointer add_child();
+
+ pointer add_child_copy(const_pointer const& copy);
+
+ const_child_iterator get_child_begin() const;
+
+ child_iterator get_child_begin();
+
+ const_child_iterator get_child_end() const;
+
+ child_iterator get_child_end();
+
+ void remove_all_children();
+
+ static pointer create(data_type const& data);
+
+ static pointer create();
+
+ static pointer create_copy(const_pointer const& p);
+ };
+
+ //<-
+ template <typename T>
+ simple_node<T>::simple_node() : _children(), _parent(), _data()
+ {
+ }
+
+ template <typename T>
+ simple_node<T>::simple_node(data_type const& data)
+ : _children(), _parent(), _data(data)
+ {
+ }
+
+ template <typename T>
+ simple_node<T>::~simple_node()
+ {
+ remove_all_children();
+ _parent.reset();
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::data_type const&
+ simple_node<T>::get_data() const
+ {
+ return _data;
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::data_type& simple_node<T>::get_data()
+ {
+ return _data;
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::const_pointer
+ simple_node<T>::get_parent() const
+ {
+ return const_pointer(_parent.lock());
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::pointer simple_node<T>::get_parent()
+ {
+ return pointer(_parent.lock());
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::pointer
+ simple_node<T>::add_child(data_type const& data)
+ {
+ pointer child(new simple_node(data));
+
+ child->_parent = this->shared_from_this();
+ _children.push_back(child);
+ return child;
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::pointer simple_node<T>::add_child()
+ {
+ pointer child(new simple_node<T>());
+
+ child->_parent = this->shared_from_this();
+ _children.push_back(child);
+ return child;
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::pointer
+ simple_node<T>::add_child_copy(const_pointer const& copy)
+ {
+ pointer child(create_copy(copy));
+
+ child->_parent = this->shared_from_this();
+ _children.push_back(child);
+ return child;
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::const_child_iterator
+ simple_node<T>::get_child_begin() const
+ {
+ return _children.begin();
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::child_iterator
+ simple_node<T>::get_child_begin()
+ {
+ return _children.begin();
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::const_child_iterator
+ simple_node<T>::get_child_end() const
+ {
+ return _children.end();
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::child_iterator
+ simple_node<T>::get_child_end()
+ {
+ return _children.end();
+ }
+
+ template <typename T>
+ void simple_node<T>::remove_all_children()
+ {
+ child_iterator itr_end = get_child_end();
+
+ for (child_iterator itr = get_child_begin(); itr != itr_end; ++itr)
+ {
+ (*itr)->remove_all_children();
+ (*itr)->_parent.reset();
+ }
+
+ _children.clear();
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::pointer
+ simple_node<T>::create(data_type const& data)
+ {
+ return pointer(new simple_node(data));
+ }
+
+ template <typename T>
+ inline typename simple_node<T>::pointer simple_node<T>::create()
+ {
+ return pointer(new simple_node());
+ }
+
+ template <typename T>
+ typename simple_node<T>::pointer
+ simple_node<T>::create_copy(const_pointer const& copy)
+ {
+ pointer result(new simple_node(copy->get_data()));
+ pointer p(result);
+
+ for (
+ depth_first_iterator<const_pointer,::boost::mpl::true_> copy_itr(
+ copy
+ );
+ copy_itr;
+ ++copy_itr
+ )
+ {
+ switch (traversal_state(copy_itr))
+ {
+ case pre_order_traversal:
+ {
+ p = p->add_child((*copy_itr)->get_data());
+ break;
+ }
+
+ case post_order_traversal:
+ {
+ p = p->get_parent();
+ break;
+ }
+ }
+ }
+
+ return result;
+ }
+ //->
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_NODE_SIMPLE_NODE_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/traversal_state.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/traversal_state.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,23 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_TRAVERSAL_STATE_HPP_INCLUDED
+#define BOOST_TREE_NODE_TRAVERSAL_STATE_HPP_INCLUDED
+
+//[reference__traversal_state
+namespace boost { namespace tree_node {
+
+ enum traversal_state
+ {
+ no_traversal
+ , pre_order_traversal
+ , post_order_traversal
+ , breadth_first_traversal
+ };
+}} // namespace boost::tree_node
+//]
+
+#endif // BOOST_TREE_NODE_TRAVERSAL_STATE_HPP_INCLUDED
+

Added: sandbox/tree_node/boost/tree_node/typeof.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/boost/tree_node/typeof.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,24 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_TREE_NODE_TYPEOF_HPP_INCLUDED
+#define BOOST_TREE_NODE_TYPEOF_HPP_INCLUDED
+
+#include <boost/typeof/typeof.hpp>
+#include <boost/tree_node.hpp>
+
+#include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
+BOOST_TYPEOF_REGISTER_TYPE(boost::tree_node::traversal_state)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::tree_node::breadth_first_iterator, 2)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::tree_node::pre_order_iterator, 2)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::tree_node::post_order_iterator, 2)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::tree_node::depth_first_iterator, 2)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::tree_node::raw_node, 1)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::tree_node::simple_node, 1)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::tree_node::raw_assocoative_node, 3)
+BOOST_TYPEOF_REGISTER_TEMPLATE(boost::tree_node::simple_assocoative_node, 3)
+
+#endif // BOOST_TREE_NODE_TYPEOF_HPP_INCLUDED
+

Added: sandbox/tree_node/libs/tree_node/doc/Jamroot
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/Jamroot 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,29 @@
+project html ;
+import boostbook : boostbook ;
+using quickbook ;
+
+xml tree_node
+ :
+ tree_node.qbk
+ ;
+boostbook standalone
+ :
+ tree_node
+ :
+ <xsl:param>admon.graphics.path=images/
+ <xsl:param>navig.graphics.path=images/
+ <xsl:param>boost.root=http://www.boost.org
+ <xsl:param>boost.libraries=http://www.boost.org/libs/libraries.htm
+ <xsl:param>boost.image.src=../../../../boost.png
+ <xsl:param>boost.image.alt="C++ Boost"
+ <xsl:param>boost.image.w=277
+ <xsl:param>boost.image.h=86
+ <xsl:param>html.stylesheet=boostbook.css
+ <xsl:param>nav.layout=none
+ <xsl:param>chunk.section.depth=2
+ <xsl:param>chunk.first.sections=1
+ <xsl:param>generate.section.toc.level=0
+ <xsl:param>toc.section.depth=0
+ <xsl:param>toc.max.depth=0
+ ;
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_assoc_tree_node.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/concept_assoc_tree_node.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,174 @@
+[/=============================================================================
+ Copyright (C) 2011 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::pointer`.]]
+ [[`const_node`][An object of type `Node::const_pointer`.]]
+ [[`Key`][The key type of `Node`.]]
+ [[`key`][An object of type `Key const&`.]]
+ [[`Data`][The data type of `Node`.]]
+ [[`data`][An object of type `Data const&`.]]
+]
+
+[section:types Associated Types]
+One new type is introduced.
+
+[table
+ [[Name][Expression][Description][Requirements]]
+ [
+ [Key type]
+ [`Node::key_type`]
+ [The type of a key that a tree node will associate with a child node.]
+ []
+ ]
+]
+
+In addition, the requirements for the child iterator types are strengthened:
+
+ * The value type of `Node::child_iterator` must be
+ [^_std_pair_<Node::key_type const&,Node::pointer>].
+ * The value type of `Node::const_child_iterator` must be
+ [^_std_pair_<Node::key_type const&,Node::const_pointer>].
+
+[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]
+ [Type requirements]
+ [Return Type]
+ [Semantics]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Child creation with data]
+ [`node->add_child(key, data);`]
+ []
+ [`Node::pointer`]
+ [
+ Creates and returns a tree node to be associated with the specified
+ key in the range of children of the invoking node. The node
+ returned will store the specified data.
+ ]
+ [Amortized constant]
+ ]
+ [
+ [Child creation]
+ [`node->add_child(key)`]
+ [
+ The data type of `Node` must model the __Default_Constructible__
+ concept.
+ ]
+ [`Node::pointer`]
+ [
+ Creates and returns a tree node to be associated with the specified
+ key in the range of children of the invoking node.
+ ]
+ [Amortized constant]
+ ]
+ [
+ [Child copy creation]
+ [`node->add_child(key, const_node)`]
+ []
+ [`Node::pointer`]
+ [
+ Creates and returns a deep copy of `const_node` to be associated
+ with the specified key in the range of children of the invoking
+ node.
+ ]
+ [Linear with respect to the number of descendants of `const_node`]
+ ]
+ [
+ [Child search]
+ [`const_node->find_child(key)`]
+ []
+ [`Node::const_child_iterator`]
+ [
+ Returns an iterator pointing to a child node associated with the
+ specified key, or `const_node->get_child_end()` if no such child
+ exists.
+ ]
+ [Logarithmic]
+ ]
+ [
+ [Child search]
+ [`node->find_child(key)`]
+ []
+ [`Node::child_iterator`]
+ [
+ Returns an iterator pointing to a child node associated with the
+ specified key, or `node->get_child_end()` if no such child exists.
+ ]
+ [Logarithmic]
+ ]
+ [
+ [Child search range]
+ [`const_node->find_children(key)`]
+ []
+ [[^_std_pair_<Node::const_child_iterator,Node::const_child_iterator>]]
+ [
+ Returns a pair `p` such that `[p.first, p.second)` is a range
+ of all child nodes associated with the specified key. If no such
+ children exist, then the range will be empty.
+ ]
+ [Logarithmic]
+ ]
+ [
+ [Child search range]
+ [`node->find_children(key)`]
+ []
+ [[^_std_pair_<Node::child_iterator,Node::child_iterator>]]
+ [
+ Returns a pair `p` such that `[p.first, p.second)` is a range
+ of all child nodes associated with the specified key. If no such
+ children exist, then the range will be empty.
+ ]
+ [Logarithmic]
+ ]
+ [
+ [Remove children]
+ [`const_node->remove_children(key)`]
+ []
+ [`std::size_t`]
+ [
+ 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]
+
+ * __raw_associative_node__
+ * __simple_associative_node__
+
+[endsect]
+
+[endsect] [/ Associative Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_descendant_iterator.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/concept_descendant_iterator.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,105 @@
+[/=============================================================================
+ Copyright (C) 2011 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
+__Random_Access_Child_Iterator_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::pointer`.]
+ ]
+ [
+ [`const_node`]
+ [An object of type `Node::const_pointer`.]
+ ]
+]
+
+[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: its value type,
+in turn, must model the __Forward_Iterator__ 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 mutable node]
+ [``
+ Iterator(node)
+ Iterator itr(node)
+ ``]
+ []
+ [
+ Constructs an iterator that will iterate through the descendants of
+ the specified node.
+ ]
+ ]
+ [
+ [Constructor from immutable node]
+ [``
+ Iterator(const_node)
+ Iterator itr(const_node)
+ ``]
+ [
+ The value type of `Iterator` must be the value type of
+ `Node::const_child_iterator`.
+ ]
+ [
+ Constructs an iterator that will iterate through the descendants of
+ the specified node.
+ ]
+ ]
+]
+[endsect]
+
+[section Models]
+
+ * The return type of __make_breadth_first_descendant_iterator__.
+ * The return type of __make_pre_order_descendant_iterator__.
+ * The return type of __make_post_order_descendant_iterator__.
+ * The return type of __make_depth_first_descendant_iterator__.
+
+[endsect]
+
+[endsect] [/ Tree Node Descendant Iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_full_iterator.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/concept_full_iterator.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,83 @@
+[/=============================================================================
+ Copyright (C) 2011 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`][A type that models the __Tree_Node__ concept.]]
+ [[`node`][An object of type `Node::pointer`.]]
+ [[`const_node`][An object of type `Node::const_pointer`.]]
+]
+
+[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: its unqualified
+value type, in turn, 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 mutable node]
+ [``
+ Iterator(node)
+ Iterator itr(node)
+ ``]
+ []
+ [
+ Constructs an iterator that will iterate through the specified node
+ and its descendants.
+ ]
+ ]
+ [
+ [Constructor from immutable node]
+ [``
+ Iterator(const_node)
+ Iterator itr(const_node)
+ ``]
+ [The value type of `Iterator::value_type` must be `const`-qualified.]
+ [
+ Constructs an iterator that will iterate through the specified node
+ and its descendants.
+ ]
+ ]
+]
+[endsect]
+
+[section Models]
+
+ * The return type of __make_breadth_first_iterator__.
+ * The return type of __make_pre_order_iterator__.
+ * The return type of __make_post_order_iterator__.
+ * The return type of __make_depth_first_iterator__.
+
+[endsect]
+
+[endsect] [/ Tree Node Iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_iterator.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/concept_iterator.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,106 @@
+[/=============================================================================
+ Copyright (C) 2011 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::pointer`.]]
+ [[`const_node`][An object of type `Node::const_pointer`.]]
+]
+
+[section:types Associated Types]
+No additional types beyond those defined in the __Forward_Iterator__ concept;
+however, the requirements for the value type are strengthened: it must model
+the __Trivial_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 mutable node]
+ [``
+ Iterator(node)
+ Iterator itr(node)
+ ``]
+ []
+ [Refinement-specific.]
+ [Amortized constant]
+ ]
+ [
+ [Constructor from immutable node]
+ [``
+ Iterator(const_node)
+ Iterator itr(const_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]
+ ]
+]
+
+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]
+
+ * 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_raci_tree_node.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/concept_raci_tree_node.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,118 @@
+[/=============================================================================
+ Copyright (C) 2011 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:raci_tree_node Random Access Child Iterator Tree Node]
+
+[section Description]
+Models of this concept provide constant-time random access to their child
+nodes.
+[endsect]
+
+[section Refinement of]
+__Tree_Node__
+[endsect]
+
+[variablelist Notation
+ [
+ [`Node`]
+ [
+ A type that models the [*Random Access Child Iterator Tree Node]
+ concept.
+ ]
+ ]
+ [
+ [`node`]
+ [An object of type `Node::pointer`.]
+ ]
+ [
+ [`const_node`]
+ [An object of type `Node::const_pointer`.]
+ ]
+ [
+ [`Data`]
+ [The data type of `Node`.]
+ ]
+ [
+ [`data`]
+ [An object of type `Data const&`.]
+ ]
+]
+
+[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:
+
+ * Both types must model the __Random_Access_Iterator__ concept.
+ * The value type of `Node::child_iterator` must be `Node::pointer`.
+ * The value type of `Node::const_child_iterator` must be
+ `Node::const_pointer`.
+
+[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]
+ [Type requirements]
+ [Return Type]
+ [Semantics]
+ [__Runtime_Complexity__]
+ ]
+ [
+ [Child creation with data]
+ [`node->add_child(data)`]
+ []
+ [`Node::pointer`]
+ [
+ Creates and returns a tree node to be stored in the range of
+ children of the invoking node. The node returned will store
+ the specified data.
+ ]
+ [Amortized constant]
+ ]
+ [
+ [Child creation]
+ [`node->add_child()`]
+ [
+ The data type of `Node` must model the __Default_Constructible__
+ concept.
+ ]
+ [`Node::pointer`]
+ [
+ Creates and returns a tree node to be stored in the range of
+ children of the invoking node.
+ ]
+ [Amortized constant]
+ ]
+ [
+ [Child copy creation]
+ [`node->add_child(const_node)`]
+ []
+ [`Node::pointer`]
+ [
+ Creates and returns a deep copy of `const_node` to be stored in the
+ range of children of the invoking node.
+ ]
+ [Linear with respect to the number of descendants of `const_node`]
+ ]
+]
+[endsect]
+
+[section Models]
+
+ * __raw_node__
+ * __simple_node__
+
+[endsect]
+
+[endsect] [/ Random-Access Child Iterator Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concept_tree_node.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/concept_tree_node.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,176 @@
+[/=============================================================================
+ Copyright (C) 2011 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.
+[endsect]
+
+[variablelist Notation
+ [[`Node`][A type that models the [*Tree Node] concept.]]
+ [[`node`][An object of type `Node::pointer`.]]
+ [[`const_node`][An object of type `Node::const_pointer`.]]
+]
+
+[section:types Associated Types]
+[table
+ [[Name][Expression][Description][Requirements]]
+ [
+ [Data type]
+ [`Node::data_type`]
+ [The type of the object stored in a tree node.]
+ [
+ It must model the __Copy_Constructible__ concept, but need not
+ model the __Assignable__ concept.
+ ]
+ ]
+ [
+ [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.
+ ]
+ ]
+ [
+ [Child iterator type]
+ [`Node::child_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_child_iterator`.
+ ]
+ ]
+ [
+ [Immutable child iterator type]
+ [`Node::const_child_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 be
+ convertible to `Node::const_child_iterator`.
+ ]
+ ]
+]
+[endsect]
+
+[section:expressions Valid Expressions and Semantics]
+[table
+ [[Name][Expression][Return Type][Semantics][__Runtime_Complexity__]]
+ [
+ [Data access]
+ [`const_node->get_data()`]
+ [`Data const&`]
+ [Returns the object stored in the tree node.]
+ [Constant]
+ ]
+ [
+ [Data access]
+ [`node->get_data()`]
+ [`Data&`]
+ [Returns the object stored in the tree node.]
+ [Constant]
+ ]
+ [
+ [Parent access]
+ [`const_node->get_parent()`]
+ [`Node::const_pointer`]
+ [
+ Returns the parent of the tree node, or a null pointer if the node
+ is the root.
+ ]
+ [Constant]
+ ]
+ [
+ [Parent access]
+ [`node->get_parent()`]
+ [`Node::pointer`]
+ [
+ Returns the parent of the tree node, or a null pointer if the node
+ is the root.
+ ]
+ [Constant]
+ ]
+ [
+ [Children range begin access]
+ [`const_node->get_child_begin()`]
+ [`Node::const_child_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->get_child_begin()`]
+ [`Node::child_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 access]
+ [`const_node->get_child_end();`]
+ [`Node::const_child_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->get_child_end();`]
+ [`Node::child_iterator`]
+ [
+ Returns an iterator pointing past the end of the range of children
+ of the tree node.
+ ]
+ [Constant]
+ ]
+ [
+ [Remove all children]
+ [`node->remove_all_children()`]
+ [`void`]
+ [Removes all children from the tree node.]
+ [Linear with respect to the number of children]
+ ]
+]
+[endsect]
+
+[section Models]
+
+ * All models of the __Random_Access_Child_Iterator_Tree_Node__ concept.
+ * All models of the __Associative_Tree_Node__ concept.
+
+[endsect]
+
+[endsect] [/ Tree Node]
+

Added: sandbox/tree_node/libs/tree_node/doc/concepts.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/concepts.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,28 @@
+[/=============================================================================
+ Copyright (C) 2007-2011 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_raci_tree_node.qbk]
+[include concept_assoc_tree_node.qbk]
+[include concept_iterator.qbk]
+[include concept_full_iterator.qbk]
+[include concept_descendant_iterator.qbk]
+
+[heading Core Concepts]
+
+ * __Tree_Node__
+ * __Random_Access_Child_Iterator_Tree_Node__
+ * __Associative_Tree_Node__
+ * __Tree_Node_Iterator__
+ * __Full_Tree_Node_Iterator__
+ * __Tree_Node_Descendant_Iterator__
+
+[endsect] [/ Concepts]
+

Added: sandbox/tree_node/libs/tree_node/doc/html/boostbook.css
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/boostbook.css 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,588 @@
+/*=============================================================================
+ Copyright (c) 2004 Joel de Guzman
+ http://spirit.sourceforge.net/
+
+ Distributed under the Boost Software License, Version 1.0. (See accompany-
+ ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================*/
+
+/*=============================================================================
+ Body defaults
+=============================================================================*/
+
+ body
+ {
+ margin: 1em;
+ font-family: sans-serif;
+ }
+
+/*=============================================================================
+ Paragraphs
+=============================================================================*/
+
+ p
+ {
+ text-align: left;
+ font-size: 10pt;
+ line-height: 1.15;
+ }
+
+/*=============================================================================
+ Program listings
+=============================================================================*/
+
+ /* Code on paragraphs */
+ p tt.computeroutput
+ {
+ font-size: 9pt;
+ }
+
+ pre.synopsis
+ {
+ font-size: 90%;
+ margin: 1pc 4% 0pc 4%;
+ padding: 0.5pc 0.5pc 0.5pc 0.5pc;
+ }
+
+ .programlisting,
+ .screen
+ {
+ font-size: 9pt;
+ display: block;
+ margin: 1pc 4% 0pc 4%;
+ padding: 0.5pc 0.5pc 0.5pc 0.5pc;
+ }
+
+ /* Program listings in tables don't get borders */
+ td .programlisting,
+ td .screen
+ {
+ margin: 0pc 0pc 0pc 0pc;
+ padding: 0pc 0pc 0pc 0pc;
+ }
+
+/*=============================================================================
+ Headings
+=============================================================================*/
+
+ h1, h2, h3, h4, h5, h6
+ {
+ text-align: left;
+ margin: 1em 0em 0.5em 0em;
+ font-weight: bold;
+ }
+
+ h1 { font: 140% }
+ h2 { font: bold 140% }
+ h3 { font: bold 130% }
+ h4 { font: bold 120% }
+ h5 { font: italic 110% }
+ h6 { font: italic 100% }
+
+ /* Top page titles */
+ title,
+ h1.title,
+ h2.title
+ h3.title,
+ h4.title,
+ h5.title,
+ h6.title,
+ .refentrytitle
+ {
+ font-weight: bold;
+ margin-bottom: 1pc;
+ }
+
+ h1.title { font-size: 140% }
+ h2.title { font-size: 140% }
+ h3.title { font-size: 130% }
+ h4.title { font-size: 120% }
+ h5.title { font-size: 110% }
+ h6.title { font-size: 100% }
+
+ .section h1
+ {
+ margin: 0em 0em 0.5em 0em;
+ font-size: 140%;
+ }
+
+ .section h2 { font-size: 140% }
+ .section h3 { font-size: 130% }
+ .section h4 { font-size: 120% }
+ .section h5 { font-size: 110% }
+ .section h6 { font-size: 100% }
+
+ /* Code on titles */
+ h1 tt.computeroutput { font-size: 140% }
+ h2 tt.computeroutput { font-size: 140% }
+ h3 tt.computeroutput { font-size: 130% }
+ h4 tt.computeroutput { font-size: 120% }
+ h5 tt.computeroutput { font-size: 110% }
+ h6 tt.computeroutput { font-size: 100% }
+
+/*=============================================================================
+ Author
+=============================================================================*/
+
+ h3.author
+ {
+ font-size: 100%
+ }
+
+/*=============================================================================
+ Lists
+=============================================================================*/
+
+ li
+ {
+ font-size: 10pt;
+ line-height: 1.3;
+ }
+
+ /* Unordered lists */
+ ul
+ {
+ text-align: left;
+ }
+
+ /* Ordered lists */
+ ol
+ {
+ text-align: left;
+ }
+
+/*=============================================================================
+ Links
+=============================================================================*/
+
+ a
+ {
+ text-decoration: none; /* no underline */
+ }
+
+ a:hover
+ {
+ text-decoration: underline;
+ }
+
+/*=============================================================================
+ Spirit style navigation
+=============================================================================*/
+
+ .spirit-nav
+ {
+ text-align: right;
+ }
+
+ .spirit-nav a
+ {
+ color: white;
+ padding-left: 0.5em;
+ }
+
+ .spirit-nav img
+ {
+ border-width: 0px;
+ }
+
+/*=============================================================================
+ Copyright footer
+=============================================================================*/
+ .copyright-footer
+ {
+ text-align: right;
+ font-size: 70%;
+ }
+
+ .copyright-footer p
+ {
+ text-align: right;
+ font-size: 80%;
+ }
+
+/*=============================================================================
+ Table of contents
+=============================================================================*/
+
+ .toc
+ {
+ margin: 1pc 4% 0pc 4%;
+ padding: 0.1pc 1pc 0.1pc 1pc;
+ font-size: 80%;
+ line-height: 1.15;
+ }
+
+ .boost-toc
+ {
+ float: right;
+ padding: 0.5pc;
+ }
+
+/*=============================================================================
+ Tables
+=============================================================================*/
+
+ .table-title,
+ div.table p.title
+ {
+ margin-left: 4%;
+ padding-right: 0.5em;
+ padding-left: 0.5em;
+ }
+
+ .informaltable table,
+ .table table
+ {
+ width: 92%;
+ margin-left: 4%;
+ margin-right: 4%;
+ }
+
+ div.informaltable table,
+ div.table table
+ {
+ padding: 4px;
+ }
+
+ /* Table Cells */
+ div.informaltable table tr td,
+ div.table table tr td
+ {
+ padding: 0.5em;
+ text-align: left;
+ font-size: 9pt;
+ }
+
+ div.informaltable table tr th,
+ div.table table tr th
+ {
+ padding: 0.5em 0.5em 0.5em 0.5em;
+ border: 1pt solid white;
+ font-size: 80%;
+ }
+
+ table.simplelist
+ {
+ width: auto !important;
+ margin: 0em !important;
+ padding: 0em !important;
+ border: none !important;
+ }
+ table.simplelist td
+ {
+ margin: 0em !important;
+ padding: 0em !important;
+ text-align: left !important;
+ font-size: 9pt !important;
+ border: none !important;
+ }
+
+/*=============================================================================
+ Blurbs
+=============================================================================*/
+
+ div.note,
+ div.tip,
+ div.important,
+ div.caution,
+ div.warning,
+ p.blurb
+ {
+ font-size: 9pt; /* A little bit smaller than the main text */
+ line-height: 1.2;
+ display: block;
+ margin: 1pc 4% 0pc 4%;
+ padding: 0.5pc 0.5pc 0.5pc 0.5pc;
+ }
+
+ p.blurb img
+ {
+ padding: 1pt;
+ }
+
+/*=============================================================================
+ Variable Lists
+=============================================================================*/
+
+ /* Make the terms in definition lists bold */
+ div.variablelist dl dt,
+ span.term
+ {
+ font-weight: bold;
+ font-size: 10pt;
+ }
+
+ div.variablelist table tbody tr td
+ {
+ text-align: left;
+ vertical-align: top;
+ padding: 0em 2em 0em 0em;
+ font-size: 10pt;
+ margin: 0em 0em 0.5em 0em;
+ line-height: 1;
+ }
+
+ div.variablelist dl dt
+ {
+ margin-bottom: 0.2em;
+ }
+
+ div.variablelist dl dd
+ {
+ margin: 0em 0em 0.5em 2em;
+ font-size: 10pt;
+ }
+
+ div.variablelist table tbody tr td p,
+ div.variablelist dl dd p
+ {
+ margin: 0em 0em 0.5em 0em;
+ line-height: 1;
+ }
+
+/*=============================================================================
+ Misc
+=============================================================================*/
+
+ /* Title of books and articles in bibliographies */
+ span.title
+ {
+ font-style: italic;
+ }
+
+ span.underline
+ {
+ text-decoration: underline;
+ }
+
+ span.strikethrough
+ {
+ text-decoration: line-through;
+ }
+
+ /* Copyright, Legal Notice */
+ div div.legalnotice p
+ {
+ text-align: left
+ }
+
+/*=============================================================================
+ Colors
+=============================================================================*/
+
+ @media screen
+ {
+ body {
+ background-color: #FFFFFF;
+ }
+
+ /* Links */
+ a
+ {
+ color: #005a9c;
+ }
+
+ a:visited
+ {
+ color: #9c5a9c;
+ }
+
+ h1 a, h2 a, h3 a, h4 a, h5 a, h6 a,
+ h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover,
+ h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited
+ {
+ text-decoration: none; /* no underline */
+ color: #000000;
+ }
+
+ /* Syntax Highlighting */
+ .keyword { color: #0000AA; }
+ .identifier { color: #000000; }
+ .special { color: #707070; }
+ .preprocessor { color: #402080; }
+ .char { color: teal; }
+ .comment { color: #800000; }
+ .string { color: teal; }
+ .number { color: teal; }
+ .white_bkd { background-color: #FFFFFF; }
+ .dk_grey_bkd { background-color: #999999; }
+
+ /* Copyright, Legal Notice */
+ .copyright
+ {
+ color: #666666;
+ font-size: small;
+ }
+
+ div div.legalnotice p
+ {
+ color: #666666;
+ }
+
+ /* Program listing */
+ pre.synopsis
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ .programlisting,
+ .screen
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ td .programlisting,
+ td .screen
+ {
+ border: 0px solid #DCDCDC;
+ }
+
+ /* Blurbs */
+ div.note,
+ div.tip,
+ div.important,
+ div.caution,
+ div.warning,
+ p.blurb
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ /* Table of contents */
+ .toc
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ /* Tables */
+ div.informaltable table tr td,
+ div.table table tr td
+ {
+ border: 1px solid #DCDCDC;
+ }
+
+ div.informaltable table tr th,
+ div.table table tr th
+ {
+ background-color: #F0F0F0;
+ border: 1px solid #DCDCDC;
+ }
+
+ .copyright-footer
+ {
+ color: #8F8F8F;
+ }
+
+ /* Misc */
+ span.highlight
+ {
+ color: #00A000;
+ }
+ }
+
+ @media print
+ {
+ /* Links */
+ a
+ {
+ color: black;
+ }
+
+ a:visited
+ {
+ color: black;
+ }
+
+ .spirit-nav
+ {
+ display: none;
+ }
+
+ /* Program listing */
+ pre.synopsis
+ {
+ border: 1px solid gray;
+ }
+
+ .programlisting,
+ .screen
+ {
+ border: 1px solid gray;
+ }
+
+ td .programlisting,
+ td .screen
+ {
+ border: 0px solid #DCDCDC;
+ }
+
+ /* Table of contents */
+ .toc
+ {
+ border: 1px solid gray;
+ }
+
+ .informaltable table,
+ .table table
+ {
+ border: 1px solid gray;
+ border-collapse: collapse;
+ }
+
+ /* Tables */
+ div.informaltable table tr td,
+ div.table table tr td
+ {
+ border: 1px solid gray;
+ }
+
+ div.informaltable table tr th,
+ div.table table tr th
+ {
+ border: 1px solid gray;
+ }
+
+ table.simplelist tr td
+ {
+ border: none !important;
+ }
+
+ /* Misc */
+ span.highlight
+ {
+ font-weight: bold;
+ }
+ }
+
+/*=============================================================================
+ Images
+=============================================================================*/
+
+ span.inlinemediaobject img
+ {
+ vertical-align: middle;
+ }
+
+/*==============================================================================
+ Super and Subscript: style so that line spacing isn't effected, see
+ http://www.adobe.com/cfusion/communityengine/index.cfm?event=showdetails&productId=1&postId=5341
+==============================================================================*/
+
+sup,
+sub {
+ height: 0;
+ line-height: 1;
+ vertical-align: baseline;
+ _vertical-align: bottom;
+ position: relative;
+
+}
+
+sup {
+ bottom: 1ex;
+}
+
+sub {
+ top: .5ex;
+}
+

Added: sandbox/tree_node/libs/tree_node/doc/html/images/alert.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/blank.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/caution.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/draft.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/home.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/important.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/next.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/next_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/note.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/prev.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/prev_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/smiley.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/tip.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/toc-blank.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/toc-minus.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/toc-plus.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/up.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/up_disabled.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/images/warning.png
==============================================================================
Binary file. No diff available.

Added: sandbox/tree_node/libs/tree_node/doc/html/index.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/index.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,58 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Chapter&#160;1.&#160;tree_node 0.1</title>
+<link rel="stylesheet" href="boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<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="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.1</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 Cromwell D. Enage</p></div>
+<div><div class="legalnotice">
+<a name="idp13403232"></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>
+</dl>
+</div>
+<a name="tree_node.rationale"></a><h3>
+<a name="idp13405408"></a>
+ <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>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"><p><small>Last revised: September 16, 2011 at 08:02:00 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="images/next.png" alt="Next"></a></div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,47 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Concepts</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="prev" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<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="../images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../images/home.png" alt="Home"></a><a accesskey="n" href="concepts/tree_node.html"><img 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>
+<a name="tree_node.concepts.core_concepts"></a><h4>
+<a name="idp14141952"></a>
+ <a class="link" href="concepts.html#tree_node.concepts.core_concepts">Core Concepts</a>
+ </h4>
+<pre class="programlisting"><span class="special">*</span> <a class="link" href="concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a>
+ <span class="special">*</span> <a class="link" href="concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random Access Child Iterator Tree Node</strong></span></a>
+ <span class="special">*</span> <a class="link" href="concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+<span class="special">*</span> <a class="link" href="concepts/tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree Node Iterator</strong></span></a>
+ <span class="special">*</span> <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>
+ <span class="special">*</span> <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>
+</pre>
+</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 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="../images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../images/home.png" alt="Home"></a><a accesskey="n" href="concepts/tree_node.html"><img 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
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/associative_tree_node.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,472 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Associative Tree Node</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="raci_tree_node.html" title="Random Access Child Iterator Tree Node">
+<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="raci_tree_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="tree_node_iterator.html"><img 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>
+<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">::</span><span class="identifier">pointer</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="special">::</span><span class="identifier">const_pointer</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 <code class="computeroutput"><span class="identifier">Node</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">Key</span> <span class="keyword">const</span><span class="special">&amp;</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Data</span></code></span></dt>
+<dd><p>
+ The data type of <code class="computeroutput"><span class="identifier">Node</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">data</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Data</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.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>
+ One new type is 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">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></tbody>
+</table></div>
+<p>
+ In addition, the requirements for the child iterator types are strengthened:
+ </p>
+<pre class="programlisting"><span class="special">*</span> <span class="identifier">The</span> <span class="identifier">value</span> <span class="identifier">type</span> <span class="identifier">of</span> <span class="error">`</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">child_iterator</span><span class="error">`</span> <span class="identifier">must</span> <span class="identifier">be</span>
+ <span class="special">[^</span>std::pair<span class="special">&lt;</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;,</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span><span class="special">&gt;].</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="identifier">value</span> <span class="identifier">type</span> <span class="identifier">of</span> <span class="error">`</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_child_iterator</span><span class="error">`</span> <span class="identifier">must</span> <span class="identifier">be</span>
+ <span class="special">[^</span>std::pair<span class="special">&lt;</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;,</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_pointer</span><span class="special">&gt;].</span>
+</pre>
+</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>
+ Type requirements
+ </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>
+ Child creation with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key</span><span class="special">,</span>
+ <span class="identifier">data</span><span class="special">);</span></code>
+ </p>
+ </td>
+<td>
+ </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>
+ Creates and returns a tree node to be associated with the specified
+ key in the range of children of the invoking node. The node returned
+ will store the specified data.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The data type of <code class="computeroutput"><span class="identifier">Node</span></code>
+ must model the Default Constructible concept.
+ </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>
+ Creates and returns a tree node to be associated with the specified
+ key in the range of children of the invoking node.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child copy creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key</span><span class="special">,</span>
+ <span class="identifier">const_node</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </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>
+ Creates and returns 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.
+ </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 search
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_node</span><span class="special">-&gt;</span><span class="identifier">find_child</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_child_iterator</span></code>
+ </p>
+ </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">-&gt;</span><span class="identifier">get_child_end</span><span class="special">()</span></code> if no such child exists.
+ </p>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">find_child</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">child_iterator</span></code>
+ </p>
+ </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">-&gt;</span><span class="identifier">get_child_end</span><span class="special">()</span></code> if no such child exists.
+ </p>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search range
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_node</span><span class="special">-&gt;</span><span class="identifier">find_children</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ <code class="literal">std::pair&lt;Node::const_child_iterator,Node::const_child_iterator&gt;</code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns a pair <code class="computeroutput"><span class="identifier">p</span></code>
+ such that <code class="computeroutput"><span class="special">[</span><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> is a range of all child nodes
+ associated with the specified key. If no such children exist,
+ then the range will be empty.
+ </p>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search range
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">find_children</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ <code class="literal">std::pair&lt;Node::child_iterator,Node::child_iterator&gt;</code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns a pair <code class="computeroutput"><span class="identifier">p</span></code>
+ such that <code class="computeroutput"><span class="special">[</span><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> is a range of all child nodes
+ associated with the specified key. If no such children exist,
+ then the range will be empty.
+ </p>
+ </td>
+<td>
+ <p>
+ Logarithmic
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove children
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_node</span><span class="special">-&gt;</span><span class="identifier">remove_children</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span></code>
+ </p>
+ </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>
+ <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>
+<pre class="programlisting"><span class="special">*</span> <a class="link" href="../reference/raw_associative_node.html" title="raw_associative_node"><code class="computeroutput"><span class="identifier">raw_associative_node</span></code></a>
+<span class="special">*</span> <a class="link" href="../reference/simple_associative_node.html" title="simple_associative_node"><code class="computeroutput"><span class="identifier">simple_associative_node</span></code></a>
+</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 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="raci_tree_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="tree_node_iterator.html"><img 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
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/full_tree_node_iterator.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,200 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Full Tree Node Iterator</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<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="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="tree_node_desc_iterator.html"><img 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>
+<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>
+ 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">::</span><span class="identifier">pointer</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="special">::</span><span class="identifier">const_pointer</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: its unqualified value
+ type, in turn, 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 mutable node
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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>
+<p>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs an iterator that will iterate through the specified
+ node and its descendants.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor from immutable node
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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">const_node</span><span class="special">)</span>
+<span class="identifier">Iterator</span> <span class="identifier">itr</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">)</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ The value type of <code class="computeroutput"><span class="identifier">Iterator</span><span class="special">::</span><span class="identifier">value_type</span></code>
+ must be <code class="computeroutput"><span class="keyword">const</span></code>-qualified.
+ </p>
+ </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>
+<pre class="programlisting"><span class="special">*</span> <span class="identifier">The</span> <span class="keyword">return</span> <span class="identifier">type</span> <span class="identifier">of</span> <a class="link" href="../reference/breadth_first_iterator.html" title="breadth_first_iterator"><code class="computeroutput"><span class="identifier">make_breadth_first_iterator</span><span class="special">()</span></code></a><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="keyword">return</span> <span class="identifier">type</span> <span class="identifier">of</span> <a class="link" href="../reference/pre_order_iterator.html" title="pre_order_iterator"><code class="computeroutput"><span class="identifier">make_pre_order_iterator</span><span class="special">()</span></code></a><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="keyword">return</span> <span class="identifier">type</span> <span class="identifier">of</span> <a class="link" href="../reference/post_order_iterator.html" title="post_order_iterator"><code class="computeroutput"><span class="identifier">make_post_order_iterator</span><span class="special">()</span></code></a><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="keyword">return</span> <span class="identifier">type</span> <span class="identifier">of</span> <a class="link" href="../reference/depth_first_iterator.html" title="depth_first_iterator"><code class="computeroutput"><span class="identifier">make_depth_first_iterator</span><span class="special">()</span></code></a><span class="special">.</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 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="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="tree_node_desc_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/raci_tree_node.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/raci_tree_node.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,255 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Random Access Child Iterator Tree Node</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="tree_node.html" title="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="tree_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="associative_tree_node.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.concepts.raci_tree_node"></a><a class="link" href="raci_tree_node.html" title="Random Access Child Iterator Tree Node">Random Access Child
+ Iterator Tree Node</a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.raci_tree_node.description"></a><a class="link" href="raci_tree_node.html#tree_node.concepts.raci_tree_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ Models of this concept provide constant-time random access to their child
+ nodes.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.raci_tree_node.refinement_of"></a><a class="link" href="raci_tree_node.html#tree_node.concepts.raci_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>
+<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>Random Access Child Iterator
+ 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">::</span><span class="identifier">pointer</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="special">::</span><span class="identifier">const_pointer</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">Data</span></code></span></dt>
+<dd><p>
+ The data type of <code class="computeroutput"><span class="identifier">Node</span></code>.
+ </p></dd>
+<dt><span class="term"><code class="computeroutput"><span class="identifier">data</span></code></span></dt>
+<dd><p>
+ An object of type <code class="computeroutput"><span class="identifier">Data</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.raci_tree_node.types"></a><a class="link" href="raci_tree_node.html#tree_node.concepts.raci_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>
+<pre class="programlisting"><span class="special">*</span> <span class="identifier">Both</span> <span class="identifier">types</span> <span class="identifier">must</span> <span class="identifier">model</span> <span class="identifier">the</span> Random Access Iterator <span class="identifier">concept</span><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="identifier">value</span> <span class="identifier">type</span> <span class="identifier">of</span> <span class="error">`</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">child_iterator</span><span class="error">`</span> <span class="identifier">must</span> <span class="identifier">be</span> <span class="error">`</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">pointer</span><span class="error">`</span><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="identifier">value</span> <span class="identifier">type</span> <span class="identifier">of</span> <span class="error">`</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_child_iterator</span><span class="error">`</span> <span class="identifier">must</span> <span class="identifier">be</span>
+ <span class="error">`</span><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_pointer</span><span class="error">`</span><span class="special">.</span>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.raci_tree_node.expressions"></a><a class="link" href="raci_tree_node.html#tree_node.concepts.raci_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>
+ Type requirements
+ </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>
+ Child creation with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">add_child</span><span class="special">(</span><span class="identifier">data</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </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>
+ Creates and returns a tree node to be stored in the range of
+ children of the invoking node. The node returned will store the
+ specified data.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">add_child</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The data type of <code class="computeroutput"><span class="identifier">Node</span></code>
+ must model the Default Constructible concept.
+ </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>
+ Creates and returns a tree node to be stored in the range of
+ children of the invoking node.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child copy creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">add_child</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ </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>
+ 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 the invoking node.
+ </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>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.concepts.raci_tree_node.models"></a><a class="link" href="raci_tree_node.html#tree_node.concepts.raci_tree_node.models" title="Models">Models</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="special">*</span> <a class="link" href="../reference/raw_node.html" title="raw_node"><code class="computeroutput"><span class="identifier">raw_node</span></code></a>
+<span class="special">*</span> <a class="link" href="../reference/simple_node.html" title="simple_node"><code class="computeroutput"><span class="identifier">simple_node</span></code></a>
+</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 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="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="associative_tree_node.html"><img 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
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,523 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Tree Node</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="../concepts.html" title="Concepts">
+<link rel="next" href="raci_tree_node.html" title="Random Access Child Iterator 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="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="raci_tree_node.html"><img 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.
+ </p>
+</div>
+<div class="variablelist">
+<p class="title"><b>Notation</b></p>
+<dl>
+<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">::</span><span class="identifier">pointer</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="special">::</span><span class="identifier">const_pointer</span></code>.
+ </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>
+ Data type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">data_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of the object stored in a tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Copy Constructible concept, but
+ need not model the Assignable concept.
+ </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>
+ Child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">child_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_child_iterator</span></code>.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_child_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 be convertible to <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_child_iterator</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.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>
+</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>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_node</span><span class="special">-&gt;</span><span class="identifier">get_data</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Data</span> <span class="keyword">const</span><span class="special">&amp;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns the object stored in the tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">get_data</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">Data</span><span class="special">&amp;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns the object stored in the tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_node</span><span class="special">-&gt;</span><span class="identifier">get_parent</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 the parent of the tree node, or a null pointer if the
+ node is the root.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">get_parent</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 the parent of the tree node, or a null pointer if the
+ node is the root.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_node</span><span class="special">-&gt;</span><span class="identifier">get_child_begin</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_child_iterator</span></code>
+ </p>
+ </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>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">get_child_begin</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">child_iterator</span></code>
+ </p>
+ </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>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_node</span><span class="special">-&gt;</span><span class="identifier">get_child_end</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_child_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing past the end of the range of children
+ of the tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">get_child_end</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">child_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns an iterator pointing past the end of the range of children
+ of the tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ Constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove all children
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">node</span><span class="special">-&gt;</span><span class="identifier">remove_all_children</span><span class="special">()</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Removes all children from the tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ Linear with respect to the number of children
+ </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>
+<pre class="programlisting"><span class="special">*</span> <span class="identifier">All</span> <span class="identifier">models</span> <span class="identifier">of</span> <span class="identifier">the</span> <a class="link" href="raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random Access Child Iterator Tree Node</strong></span></a> <span class="identifier">concept</span><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">All</span> <span class="identifier">models</span> <span class="identifier">of</span> <span class="identifier">the</span> <a class="link" href="associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a> <span class="identifier">concept</span><span class="special">.</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 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="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="raci_tree_node.html"><img 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
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node_desc_iterator.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,206 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Tree Node Descendant Iterator</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<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="../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="full_tree_node_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img 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="raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random
+ Access Child Iterator 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>
+<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">::</span><span class="identifier">pointer</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="special">::</span><span class="identifier">const_pointer</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: its value type, in turn,
+ must model the Forward Iterator concept.
+ </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 mutable node
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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>
+<p>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Constructs an iterator that will iterate through the descendants
+ of the specified node.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor from immutable node
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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">const_node</span><span class="special">)</span>
+<span class="identifier">Iterator</span> <span class="identifier">itr</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">)</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ The value type of <code class="computeroutput"><span class="identifier">Iterator</span></code>
+ must be the value type of <code class="computeroutput"><span class="identifier">Node</span><span class="special">::</span><span class="identifier">const_child_iterator</span></code>.
+ </p>
+ </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>
+<pre class="programlisting"><span class="special">*</span> <span class="identifier">The</span> <span class="keyword">return</span> <span class="identifier">type</span> <span class="identifier">of</span> <a class="link" href="../reference/breadth_first_iterator.html" title="breadth_first_iterator"><code class="computeroutput"><span class="identifier">make_breadth_first_descendant_iterator</span><span class="special">()</span></code></a><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="keyword">return</span> <span class="identifier">type</span> <span class="identifier">of</span> <a class="link" href="../reference/pre_order_iterator.html" title="pre_order_iterator"><code class="computeroutput"><span class="identifier">make_pre_order_descendant_iterator</span><span class="special">()</span></code></a><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="keyword">return</span> <span class="identifier">type</span> <span class="identifier">of</span> <a class="link" href="../reference/post_order_iterator.html" title="post_order_iterator"><code class="computeroutput"><span class="identifier">make_post_order_descendant_iterator</span><span class="special">()</span></code></a><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">The</span> <span class="keyword">return</span> <span class="identifier">type</span> <span class="identifier">of</span> <a class="link" href="../reference/depth_first_iterator.html" title="depth_first_iterator"><code class="computeroutput"><span class="identifier">make_depth_first_descendant_iterator</span><span class="special">()</span></code></a><span class="special">.</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 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="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img 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
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/concepts/tree_node_iterator.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,274 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Tree Node Iterator</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../concepts.html" title="Concepts">
+<link rel="prev" href="associative_tree_node.html" title="Associative Tree Node">
+<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="associative_tree_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="full_tree_node_iterator.html"><img 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>
+<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">::</span><span class="identifier">pointer</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="special">::</span><span class="identifier">const_pointer</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; however, the requirements
+ for the value type are strengthened: it must model the Trivial 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>
+ <p>
+
+</p>
+<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>
+<p>
+ </p>
+ </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 mutable node
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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>
+<p>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Refinement-specific.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor from immutable node
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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">const_node</span><span class="special">)</span>
+<span class="identifier">Iterator</span> <span class="identifier">itr</span><span class="special">(</span><span class="identifier">const_node</span><span class="special">)</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ <p>
+ Refinement-specific.
+ </p>
+ </td>
+<td>
+ <p>
+ Amortized constant
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Dereferenceability
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">itr</span></code>
+ </p>
+ </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>
+</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>
+<pre class="programlisting"><span class="special">*</span> <span class="identifier">All</span> <span class="identifier">models</span> <span class="identifier">of</span> <span class="identifier">the</span> <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> <span class="identifier">concept</span><span class="special">.</span>
+<span class="special">*</span> <span class="identifier">All</span> <span class="identifier">models</span> <span class="identifier">of</span> <span class="identifier">the</span> <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> <span class="identifier">concept</span><span class="special">.</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 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="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="full_tree_node_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,46 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Reference</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="prev" href="concepts/tree_node_desc_iterator.html" title="Tree Node Descendant Iterator">
+<link rel="next" href="reference/raw_node.html" title="raw_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/tree_node_desc_iterator.html"><img src="../images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../images/home.png" alt="Home"></a><a accesskey="n" href="reference/raw_node.html"><img 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>
+<pre class="programlisting"><span class="special">*</span> <a class="link" href="reference/raw_node.html" title="raw_node"><code class="computeroutput"><span class="identifier">raw_node</span></code></a>
+<span class="special">*</span> <a class="link" href="reference/simple_node.html" title="simple_node"><code class="computeroutput"><span class="identifier">simple_node</span></code></a>
+<span class="special">*</span> <a class="link" href="reference/raw_associative_node.html" title="raw_associative_node"><code class="computeroutput"><span class="identifier">raw_associative_node</span></code></a>
+<span class="special">*</span> <a class="link" href="reference/simple_associative_node.html" title="simple_associative_node"><code class="computeroutput"><span class="identifier">simple_associative_node</span></code></a>
+<span class="special">*</span> <a class="link" href="reference/breadth_first_iterator.html" title="breadth_first_iterator"><code class="computeroutput"><span class="identifier">breadth_first_iterator</span></code></a>
+<span class="special">*</span> <a class="link" href="reference/pre_order_iterator.html" title="pre_order_iterator"><code class="computeroutput"><span class="identifier">pre_order_iterator</span></code></a>
+<span class="special">*</span> <a class="link" href="reference/post_order_iterator.html" title="post_order_iterator"><code class="computeroutput"><span class="identifier">post_order_iterator</span></code></a>
+<span class="special">*</span> <a class="link" href="reference/depth_first_iterator.html" title="depth_first_iterator"><code class="computeroutput"><span class="identifier">depth_first_iterator</span></code></a>
+<span class="special">*</span> <a class="link" href="reference/traversal_state.html" title="traversal_state"><code class="computeroutput"><span class="identifier">traversal_state</span></code></a>
+</pre>
+</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 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/tree_node_desc_iterator.html"><img src="../images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../images/home.png" alt="Home"></a><a accesskey="n" href="reference/raw_node.html"><img src="../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/breadth_first_iterator.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/breadth_first_iterator.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,747 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>breadth_first_iterator</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="simple_associative_node.html" title="simple_associative_node">
+<link rel="next" href="pre_order_iterator.html" title="pre_order_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="simple_associative_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="pre_order_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.breadth_first_iterator"></a><a class="link" href="breadth_first_iterator.html" title="breadth_first_iterator"><code class="computeroutput"><span class="identifier">breadth_first_iterator</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.breadth_first_iterator.synopsis"></a><a class="link" href="breadth_first_iterator.html#tree_node.reference.breadth_first_iterator.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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">MimicsChildIterator</span><span class="special">&gt;</span>
+ <span class="keyword">class</span> <span class="identifier">breadth_first_iterator</span>
+ <span class="special">{</span>
+
+ <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span>
+ <span class="identifier">distance_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">forward_iterator_tag</span>
+ <span class="identifier">iterator_category</span><span class="special">;</span>
+
+ <span class="identifier">breadth_first_iterator</span><span class="special">();</span>
+
+ <span class="keyword">explicit</span> <span class="identifier">breadth_first_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">NP</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI</span><span class="special">&gt;</span>
+ <span class="identifier">breadth_first_iterator</span><span class="special">(</span>
+ <span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP</span><span class="special">,</span><span class="identifier">MCI</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">other</span>
+ <span class="special">);</span>
+
+ <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">*()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pointer</span> <span class="keyword">operator</span><span class="special">-&gt;()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">breadth_first_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">++();</span>
+
+ <span class="identifier">breadth_first_iterator</span> <span class="keyword">operator</span><span class="special">++(</span><span class="keyword">int</span><span class="special">);</span>
+
+ <span class="keyword">operator</span> <span class="identifier">traversal_state</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="special">};</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.breadth_first_iterator.description"></a><a class="link" href="breadth_first_iterator.html#tree_node.reference.breadth_first_iterator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This iterator traverses the specified root node and all its descendants
+ in breadth-first fashion, e.g. given the following tree representation:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"> <span class="identifier">A</span>
+ <span class="special">|</span>
+ <span class="identifier">C</span><span class="special">---+---</span><span class="identifier">B</span>
+ <span class="special">|</span> <span class="special">|</span>
+<span class="special">+-+-+</span> <span class="special">+-+-+</span>
+<span class="special">|</span> <span class="special">|</span> <span class="special">|</span> <span class="special">|</span>
+<span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">F</span> <span class="identifier">G</span>
+</pre>
+<p>
+ </p>
+<p>
+ If this iterator is a <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>, then it will traverse
+ the tree nodes in the following order:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">A</span> <span class="identifier">C</span> <span class="identifier">B</span> <span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">F</span> <span class="identifier">G</span>
+</pre>
+<p>
+ </p>
+<p>
+ If this iterator is a <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>, then it will
+ traverse the tree nodes in the following order:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">C</span> <span class="identifier">B</span> <span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">F</span> <span class="identifier">G</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.breadth_first_iterator.definition"></a><a class="link" href="breadth_first_iterator.html#tree_node.reference.breadth_first_iterator.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/breadth_first_iterator.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.breadth_first_iterator.tpl_param"></a><a class="link" href="breadth_first_iterator.html#tree_node.reference.breadth_first_iterator.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">NodePointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a pointer to a tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Trivial Iterator concept, and
+ its value type must model the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">MimicsChildIterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines whether this <code class="computeroutput"><span class="identifier">breadth_first_iterator</span></code>
+ will iterate only through the descendants of a node or will also
+ include the node in its traversal.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Boolean Integral Constant concept.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.breadth_first_iterator.model_of"></a><a class="link" href="breadth_first_iterator.html#tree_node.reference.breadth_first_iterator.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="special">*</span> <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> <span class="keyword">if</span> <span class="error">`</span><span class="identifier">MimicsChildIterator</span><span class="special">::</span><span class="identifier">value</span><span class="error">`</span> <span class="identifier">is</span> <span class="error">`</span><span class="keyword">false</span><span class="error">`</span>
+<span class="special">*</span> <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> <span class="keyword">if</span> <span class="error">`</span><span class="identifier">MimicsChildIterator</span><span class="special">::</span><span class="identifier">value</span><span class="error">`</span> <span class="identifier">is</span> <span class="error">`</span><span class="keyword">true</span><span class="error">`</span>
+<span class="special">*</span> Default Constructible
+<span class="special">*</span> Copy Constructible
+<span class="special">*</span> Assignable
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.breadth_first_iterator.public_bases"></a><a class="link" href="breadth_first_iterator.html#tree_node.reference.breadth_first_iterator.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<p>
+ None.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.breadth_first_iterator.members"></a><a class="link" href="breadth_first_iterator.html#tree_node.reference.breadth_first_iterator.members" title="Members">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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Where defined
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Value type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">value_type</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Reference type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Distance type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">distance</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator category
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator_category</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Default constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">breadth_first_iterator</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Default Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor from im/mutable node
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">breadth_first_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Conversion constructor
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NP</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI</span><span class="special">&gt;</span>
+<span class="identifier">breadth_first_iterator</span><span class="special">(</span><span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP</span><span class="special">,</span><span class="identifier">MCI</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">breadth_first_iterator</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">breadth_first_iterator</span><span class="special">(</span><span class="identifier">breadth_first_iterator</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Copy Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Assignment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">breadth_first_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">breadth_first_iterator</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Assignable
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Dereference operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">*()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Indirection operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="keyword">operator</span><span class="special">-&gt;()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pre-increment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">breadth_first_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">++();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Post-increment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">breadth_first_iterator</span>
+ <span class="keyword">operator</span><span class="special">++(</span><span class="keyword">int</span><span class="special">);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Traversal state conversion operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">operator</span> <a class="link" href="traversal_state.html" title="traversal_state">traversal_state</a><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.breadth_first_iterator.non_members"></a><a class="link" href="breadth_first_iterator.html#tree_node.reference.breadth_first_iterator.non_members" title="Non-members">Non-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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Iterator creation
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">&gt;</span>
+ <span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</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">false_</span><span class="special">&gt;</span>
+ <span class="identifier">make_breadth_first_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs and returns a <code class="computeroutput"><span class="identifier">breadth_first_iterator</span></code>
+ that will iterate through the specified node and its descendants.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Descendant iterator creation
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">&gt;</span>
+ <span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</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">&gt;</span>
+ <span class="identifier">make_breadth_first_descendant_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs and returns a <code class="computeroutput"><span class="identifier">breadth_first_iterator</span></code>
+ that will iterate through the descendants of the specified node.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iteration
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">UnaryFunction</span><span class="special">&gt;</span>
+ <span class="keyword">void</span>
+ <span class="identifier">breadth_first_iterate</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">function</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Iterates through the specified node and its descendants in breadth-first
+ fashion, passing each node pointer dereferenced to the specified
+ Unary Function object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Descendant iteration
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">UnaryFunction</span><span class="special">&gt;</span>
+ <span class="keyword">void</span>
+ <span class="identifier">breadth_first_iterate_descendants</span><span class="special">(</span>
+ <span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span>
+ <span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">function</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Iterates through the descendants of the specified node in breadth-first
+ fashion, passing each element dereferenced to the specified
+ Unary Function object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Equality
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+ <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special">&lt;</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">equal_to</span><span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">==(</span>
+ <span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span>
+ <span class="special">,</span> <span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">rhs</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the Input Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Inequality
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+ <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special">&lt;</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">equal_to</span><span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">!=(</span>
+ <span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span>
+ <span class="special">,</span> <span class="identifier">breadth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">rhs</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the Input Iterator concept.
+ </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 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="simple_associative_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="pre_order_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/depth_first_iterator.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/depth_first_iterator.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,804 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>depth_first_iterator</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="post_order_iterator.html" title="post_order_iterator">
+<link rel="next" href="traversal_state.html" title="traversal_state">
+</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="post_order_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="traversal_state.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.depth_first_iterator"></a><a class="link" href="depth_first_iterator.html" title="depth_first_iterator"><code class="computeroutput"><span class="identifier">depth_first_iterator</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.depth_first_iterator.synopsis"></a><a class="link" href="depth_first_iterator.html#tree_node.reference.depth_first_iterator.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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">MimicsChildIterator</span><span class="special">&gt;</span>
+ <span class="keyword">class</span> <span class="identifier">depth_first_iterator</span>
+ <span class="special">{</span>
+
+ <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span>
+ <span class="identifier">distance_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">forward_iterator_tag</span>
+ <span class="identifier">iterator_category</span><span class="special">;</span>
+
+ <span class="identifier">depth_first_iterator</span><span class="special">();</span>
+
+ <span class="keyword">explicit</span> <span class="identifier">depth_first_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">NP</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI</span><span class="special">&gt;</span>
+ <span class="identifier">depth_first_iterator</span><span class="special">(</span>
+ <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP</span><span class="special">,</span><span class="identifier">MCI</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">other</span>
+ <span class="special">);</span>
+
+ <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">*()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pointer</span> <span class="keyword">operator</span><span class="special">-&gt;()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">depth_first_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">++();</span>
+
+ <span class="identifier">depth_first_iterator</span> <span class="keyword">operator</span><span class="special">++(</span><span class="keyword">int</span><span class="special">);</span>
+
+ <span class="keyword">operator</span> <span class="identifier">traversal_state</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="special">};</span>
+
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+ <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special">&lt;</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">equal_to</span><span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">==(</span>
+ <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span>
+ <span class="special">,</span> <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">rhs</span>
+ <span class="special">);</span>
+
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+ <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special">&lt;</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">equal_to</span><span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">!=(</span>
+ <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span>
+ <span class="special">,</span> <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">rhs</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">&gt;</span>
+ <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</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">false_</span><span class="special">&gt;</span>
+ <span class="identifier">make_depth_first_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">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">&gt;</span>
+ <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</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">&gt;</span>
+ <span class="identifier">make_depth_first_descendant_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">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">BinaryFunction</span><span class="special">&gt;</span>
+ <span class="keyword">void</span> <span class="identifier">depth_first_iterate</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">,</span> <span class="identifier">BinaryFunction</span> <span class="identifier">function</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">BinaryFunction</span><span class="special">&gt;</span>
+ <span class="keyword">void</span>
+ <span class="identifier">depth_first_iterate_descendants</span><span class="special">(</span>
+ <span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span>
+ <span class="special">,</span> <span class="identifier">BinaryFunction</span> <span class="identifier">function</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.depth_first_iterator.description"></a><a class="link" href="depth_first_iterator.html#tree_node.reference.depth_first_iterator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This iterator traverses the specified root node and all its descendants
+ in depth-first fashion, e.g. given the following tree representation:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"> <span class="identifier">A</span>
+ <span class="special">|</span>
+ <span class="identifier">C</span><span class="special">---+---</span><span class="identifier">B</span>
+ <span class="special">|</span> <span class="special">|</span>
+<span class="special">+-+-+</span> <span class="special">+-+-+</span>
+<span class="special">|</span> <span class="special">|</span> <span class="special">|</span> <span class="special">|</span>
+<span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">F</span> <span class="identifier">G</span>
+</pre>
+<p>
+ </p>
+<p>
+ If this iterator is a <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>, then it will traverse
+ the tree nodes in the following order:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">A</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">C</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">D</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">D</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">E</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">E</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">C</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">B</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">F</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">F</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">G</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">G</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">B</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">A</span> <span class="identifier">post_order_traversal</span>
+</pre>
+<p>
+ </p>
+<p>
+ If this iterator is a <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>, then it will
+ traverse the tree nodes in the following order:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">C</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">D</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">D</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">E</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">E</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">C</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">B</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">F</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">F</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">G</span> <span class="identifier">pre_order_traversal</span>
+<span class="identifier">G</span> <span class="identifier">post_order_traversal</span>
+<span class="identifier">B</span> <span class="identifier">post_order_traversal</span>
+</pre>
+<p>
+ </p>
+<p>
+ The traversal state conversion operator of this iterator will yield each
+ value in the column on the right at the appropriate iteration.
+ </p>
+<p>
+ This iterator is ideal for algorithms that need to perform both preprocessing
+ and postprocessing of a tree node, e.g. the copy constructors of the <a class="link" href="raw_node.html" title="raw_node"><code class="computeroutput"><span class="identifier">raw_node</span></code></a>
+ and <a class="link" href="raw_associative_node.html" title="raw_associative_node"><code class="computeroutput"><span class="identifier">raw_associative_node</span></code></a> implementations.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.depth_first_iterator.definition"></a><a class="link" href="depth_first_iterator.html#tree_node.reference.depth_first_iterator.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/depth_first_iterator.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.depth_first_iterator.tpl_param"></a><a class="link" href="depth_first_iterator.html#tree_node.reference.depth_first_iterator.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">NodePointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a pointer to a tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Trivial Iterator concept, and
+ its value type must model the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">MimicsChildIterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines whether this <code class="computeroutput"><span class="identifier">depth_first_iterator</span></code>
+ will iterate only through the descendants of a node or will also
+ include the node in its traversal.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Boolean Integral Constant concept.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.depth_first_iterator.model_of"></a><a class="link" href="depth_first_iterator.html#tree_node.reference.depth_first_iterator.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="special">*</span> <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> <span class="keyword">if</span> <span class="error">`</span><span class="identifier">MimicsChildIterator</span><span class="special">::</span><span class="identifier">value</span><span class="error">`</span> <span class="identifier">is</span> <span class="error">`</span><span class="keyword">false</span><span class="error">`</span>
+<span class="special">*</span> <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> <span class="keyword">if</span> <span class="error">`</span><span class="identifier">MimicsChildIterator</span><span class="special">::</span><span class="identifier">value</span><span class="error">`</span> <span class="identifier">is</span> <span class="error">`</span><span class="keyword">true</span><span class="error">`</span>
+<span class="special">*</span> Default Constructible
+<span class="special">*</span> Copy Constructible
+<span class="special">*</span> Assignable
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.depth_first_iterator.public_bases"></a><a class="link" href="depth_first_iterator.html#tree_node.reference.depth_first_iterator.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<p>
+ None.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.depth_first_iterator.members"></a><a class="link" href="depth_first_iterator.html#tree_node.reference.depth_first_iterator.members" title="Members">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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Value type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">value_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the <a class="link" href="../concepts/tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree Node Iterator</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Reference type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Forward Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Forward Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Distance type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">distance</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Forward Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator category
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator_category</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Forward Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Default constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">depth_first_iterator</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Default Constructible concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor from im/mutable node
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">depth_first_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the <a class="link" href="../concepts/tree_node_iterator.html" title="Tree Node Iterator"><span class="bold"><strong>Tree Node Iterator</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Conversion constructor
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NP</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI</span><span class="special">&gt;</span>
+<span class="identifier">depth_first_iterator</span><span class="special">(</span><span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP</span><span class="special">,</span><span class="identifier">MCI</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs a <code class="computeroutput"><span class="identifier">depth_first_iterator</span></code>
+ object that will point to the same element that the specified
+ iterator points to.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">depth_first_iterator</span><span class="special">(</span><span class="identifier">depth_first_iterator</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Copy Constructible concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Assignment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">depth_first_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">depth_first_iterator</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Assignable concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Dereference operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">*()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Forward Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Indirection operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="keyword">operator</span><span class="special">-&gt;()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Forward Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pre-increment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">depth_first_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">++();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Forward Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Post-increment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">depth_first_iterator</span>
+ <span class="keyword">operator</span><span class="special">++(</span><span class="keyword">int</span><span class="special">);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined in the Forward Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Traversal state conversion operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">operator</span> <a class="link" href="traversal_state.html" title="traversal_state">traversal_state</a><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Returns <code class="computeroutput"><span class="identifier">pre_order_traversal</span></code>
+ if this iterator has not yet examined the children of the current
+ node, <code class="computeroutput"><span class="identifier">post_order_traversal</span></code>
+ if this iterator has examined all of the children of the current
+ node, or <code class="computeroutput"><span class="identifier">no_traversal</span></code>
+ if this iterator is not dereferenceable.
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.depth_first_iterator.non_members"></a><a class="link" href="depth_first_iterator.html#tree_node.reference.depth_first_iterator.non_members" title="Non-members">Non-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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Iterator creation
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NodePointer</span><span class="special">&gt;</span>
+<span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</span><span class="special">,</span>boost::mpl::false_<span class="special">&gt;</span>
+ <span class="identifier">make_depth_first_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs and returns a <code class="computeroutput"><span class="identifier">depth_first_iterator</span></code>
+ that will iterate through the specified node and its descendants.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Descendant iterator creation
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NodePointer</span><span class="special">&gt;</span>
+<span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</span><span class="special">,</span>boost::mpl::true_<span class="special">&gt;</span>
+ <span class="identifier">make_depth_first_descendant_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs and returns a <code class="computeroutput"><span class="identifier">depth_first_iterator</span></code>
+ that will iterate through the descendants of the specified node.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iteration
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NodePointer</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">UnaryFunction</span><span class="special">&gt;</span>
+<span class="keyword">void</span>
+ <span class="identifier">depth_first_iterate</span><span class="special">(</span>
+ <span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span>
+ <span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">function</span>
+ <span class="special">);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Iterates through the specified node and its descendants in depth-first
+ fashion, passing each node pointer dereferenced to the specified
+ Unary Function object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Descendant iteration
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NodePointer</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">UnaryFunction</span><span class="special">&gt;</span>
+<span class="keyword">void</span>
+ <span class="identifier">depth_first_iterate_descendants</span><span class="special">(</span>
+ <span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span>
+ <span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">function</span>
+ <span class="special">);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Iterates through the descendants of the specified node in depth-first
+ fashion, passing each element dereferenced to the specified
+ Unary Function object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Equality
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> enable_if<span class="special">&lt;</span>boost::mpl::equal_to<span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">==(</span>
+ <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="special">,</span> <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="special">);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the Input Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Inequality
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+<span class="keyword">typename</span> enable_if<span class="special">&lt;</span>boost::mpl::equal_to<span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">!=(</span>
+ <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="special">,</span> <span class="identifier">depth_first_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="special">);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the Input Iterator concept.
+ </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 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="post_order_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="traversal_state.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/post_order_iterator.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/post_order_iterator.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,746 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>post_order_iterator</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="pre_order_iterator.html" title="pre_order_iterator">
+<link rel="next" href="depth_first_iterator.html" title="depth_first_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="pre_order_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="depth_first_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.post_order_iterator"></a><a class="link" href="post_order_iterator.html" title="post_order_iterator"><code class="computeroutput"><span class="identifier">post_order_iterator</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.post_order_iterator.synopsis"></a><a class="link" href="post_order_iterator.html#tree_node.reference.post_order_iterator.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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">MimicsChildIterator</span><span class="special">&gt;</span>
+ <span class="keyword">class</span> <span class="identifier">post_order_iterator</span>
+ <span class="special">{</span>
+
+ <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span>
+ <span class="identifier">distance_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">forward_iterator_tag</span>
+ <span class="identifier">iterator_category</span><span class="special">;</span>
+
+ <span class="identifier">post_order_iterator</span><span class="special">();</span>
+
+ <span class="keyword">explicit</span> <span class="identifier">post_order_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">NP</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI</span><span class="special">&gt;</span>
+ <span class="identifier">post_order_iterator</span><span class="special">(</span>
+ <span class="identifier">post_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP</span><span class="special">,</span><span class="identifier">MCI</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">other</span>
+ <span class="special">);</span>
+
+ <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">*()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pointer</span> <span class="keyword">operator</span><span class="special">-&gt;()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">post_order_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">++();</span>
+
+ <span class="identifier">post_order_iterator</span> <span class="keyword">operator</span><span class="special">++(</span><span class="keyword">int</span><span class="special">);</span>
+
+ <span class="keyword">operator</span> <span class="identifier">traversal_state</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="special">};</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.post_order_iterator.description"></a><a class="link" href="post_order_iterator.html#tree_node.reference.post_order_iterator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This iterator traverses the specified root node and all its descendants
+ in post-order fashion, e.g. given the following tree representation:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"> <span class="identifier">A</span>
+ <span class="special">|</span>
+ <span class="identifier">C</span><span class="special">---+---</span><span class="identifier">B</span>
+ <span class="special">|</span> <span class="special">|</span>
+<span class="special">+-+-+</span> <span class="special">+-+-+</span>
+<span class="special">|</span> <span class="special">|</span> <span class="special">|</span> <span class="special">|</span>
+<span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">F</span> <span class="identifier">G</span>
+</pre>
+<p>
+ </p>
+<p>
+ If this iterator is a <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>, then it will traverse
+ the tree nodes in the following order:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">C</span> <span class="identifier">F</span> <span class="identifier">G</span> <span class="identifier">B</span> <span class="identifier">A</span>
+</pre>
+<p>
+ </p>
+<p>
+ If this iterator is a <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>, then it will
+ traverse the tree nodes in the following order:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">C</span> <span class="identifier">F</span> <span class="identifier">G</span> <span class="identifier">B</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.post_order_iterator.definition"></a><a class="link" href="post_order_iterator.html#tree_node.reference.post_order_iterator.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/post_order_iterator.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.post_order_iterator.tpl_param"></a><a class="link" href="post_order_iterator.html#tree_node.reference.post_order_iterator.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">NodePointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a pointer to a tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Trivial Iterator concept, and
+ its value type must model the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">MimicsChildIterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines whether this <code class="computeroutput"><span class="identifier">post_order_iterator</span></code>
+ will iterate only through the descendants of a node or will also
+ include the node in its traversal.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Boolean Integral Constant concept.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.post_order_iterator.model_of"></a><a class="link" href="post_order_iterator.html#tree_node.reference.post_order_iterator.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="special">*</span> <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> <span class="keyword">if</span> <span class="error">`</span><span class="identifier">MimicsChildIterator</span><span class="special">::</span><span class="identifier">value</span><span class="error">`</span> <span class="identifier">is</span> <span class="error">`</span><span class="keyword">false</span><span class="error">`</span>
+<span class="special">*</span> <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> <span class="keyword">if</span> <span class="error">`</span><span class="identifier">MimicsChildIterator</span><span class="special">::</span><span class="identifier">value</span><span class="error">`</span> <span class="identifier">is</span> <span class="error">`</span><span class="keyword">true</span><span class="error">`</span>
+<span class="special">*</span> Default Constructible
+<span class="special">*</span> Copy Constructible
+<span class="special">*</span> Assignable
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.post_order_iterator.public_bases"></a><a class="link" href="post_order_iterator.html#tree_node.reference.post_order_iterator.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<p>
+ None.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.post_order_iterator.members"></a><a class="link" href="post_order_iterator.html#tree_node.reference.post_order_iterator.members" title="Members">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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Where defined
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Value type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">value_type</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Reference type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Distance type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">distance</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator category
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator_category</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Default constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">post_order_iterator</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Default Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor from im/mutable node
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">post_order_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Conversion constructor
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NP</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI</span><span class="special">&gt;</span>
+<span class="identifier">post_order_iterator</span><span class="special">(</span><span class="identifier">post_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP</span><span class="special">,</span><span class="identifier">MCI</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">post_order_iterator</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">post_order_iterator</span><span class="special">(</span><span class="identifier">post_order_iterator</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Copy Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Assignment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">post_order_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">post_order_iterator</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Assignable
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Dereference operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">*()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Indirection operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="keyword">operator</span><span class="special">-&gt;()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pre-increment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">post_order_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">++();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Post-increment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">post_order_iterator</span>
+ <span class="keyword">operator</span><span class="special">++(</span><span class="keyword">int</span><span class="special">);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Traversal state conversion operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">operator</span> <a class="link" href="traversal_state.html" title="traversal_state">traversal_state</a><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.post_order_iterator.non_members"></a><a class="link" href="post_order_iterator.html#tree_node.reference.post_order_iterator.non_members" title="Non-members">Non-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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Iterator creation
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">&gt;</span>
+ <span class="identifier">post_order_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</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">false_</span><span class="special">&gt;</span>
+ <span class="identifier">make_post_order_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs and returns a <code class="computeroutput"><span class="identifier">post_order_iterator</span></code>
+ that will iterate through the specified node and its descendants.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Descendant iterator creation
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">&gt;</span>
+ <span class="identifier">post_order_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</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">&gt;</span>
+ <span class="identifier">make_post_order_descendant_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs and returns a <code class="computeroutput"><span class="identifier">post_order_iterator</span></code>
+ that will iterate through the descendants of the specified node.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iteration
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">UnaryFunction</span><span class="special">&gt;</span>
+ <span class="keyword">void</span> <span class="identifier">post_order_iterate</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">function</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Iterates through the specified node and its descendants in post-order
+ fashion, passing each node pointer dereferenced to the specified
+ Unary Function object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Descendant iteration
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">UnaryFunction</span><span class="special">&gt;</span>
+ <span class="keyword">void</span>
+ <span class="identifier">post_order_iterate_descendants</span><span class="special">(</span>
+ <span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span>
+ <span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">function</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Iterates through the descendants of the specified node in post-order
+ fashion, passing each element dereferenced to the specified
+ Unary Function object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Equality
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+ <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special">&lt;</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">equal_to</span><span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">==(</span>
+ <span class="identifier">post_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span>
+ <span class="special">,</span> <span class="identifier">post_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">rhs</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the Input Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Inequality
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+ <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special">&lt;</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">equal_to</span><span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">!=(</span>
+ <span class="identifier">post_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span>
+ <span class="special">,</span> <span class="identifier">post_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">rhs</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the Input Iterator concept.
+ </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 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="pre_order_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="depth_first_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/pre_order_iterator.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/pre_order_iterator.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,746 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>pre_order_iterator</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="breadth_first_iterator.html" title="breadth_first_iterator">
+<link rel="next" href="post_order_iterator.html" title="post_order_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="breadth_first_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="post_order_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.pre_order_iterator"></a><a class="link" href="pre_order_iterator.html" title="pre_order_iterator"><code class="computeroutput"><span class="identifier">pre_order_iterator</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.pre_order_iterator.synopsis"></a><a class="link" href="pre_order_iterator.html#tree_node.reference.pre_order_iterator.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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">MimicsChildIterator</span><span class="special">&gt;</span>
+ <span class="keyword">class</span> <span class="identifier">pre_order_iterator</span>
+ <span class="special">{</span>
+
+ <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span>
+ <span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span>
+ <span class="identifier">distance_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">forward_iterator_tag</span>
+ <span class="identifier">iterator_category</span><span class="special">;</span>
+
+ <span class="identifier">pre_order_iterator</span><span class="special">();</span>
+
+ <span class="keyword">explicit</span> <span class="identifier">pre_order_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+ <span class="keyword">template</span> <span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">NP</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI</span><span class="special">&gt;</span>
+ <span class="identifier">pre_order_iterator</span><span class="special">(</span>
+ <span class="identifier">pre_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP</span><span class="special">,</span><span class="identifier">MCI</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">other</span>
+ <span class="special">);</span>
+
+ <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">*()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pointer</span> <span class="keyword">operator</span><span class="special">-&gt;()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pre_order_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">++();</span>
+
+ <span class="identifier">pre_order_iterator</span> <span class="keyword">operator</span><span class="special">++(</span><span class="keyword">int</span><span class="special">);</span>
+
+ <span class="keyword">operator</span> <span class="identifier">traversal_state</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="special">};</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.pre_order_iterator.description"></a><a class="link" href="pre_order_iterator.html#tree_node.reference.pre_order_iterator.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This iterator traverses the specified root node and all its descendants
+ in pre-order fashion, e.g. given the following tree representation:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"> <span class="identifier">A</span>
+ <span class="special">|</span>
+ <span class="identifier">C</span><span class="special">---+---</span><span class="identifier">B</span>
+ <span class="special">|</span> <span class="special">|</span>
+<span class="special">+-+-+</span> <span class="special">+-+-+</span>
+<span class="special">|</span> <span class="special">|</span> <span class="special">|</span> <span class="special">|</span>
+<span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">F</span> <span class="identifier">G</span>
+</pre>
+<p>
+ </p>
+<p>
+ If this iterator is a <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>, then it will traverse
+ the tree nodes in the following order:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">A</span> <span class="identifier">C</span> <span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">B</span> <span class="identifier">F</span> <span class="identifier">G</span>
+</pre>
+<p>
+ </p>
+<p>
+ If this iterator is a <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>, then it will
+ traverse the tree nodes in the following order:
+ </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="identifier">C</span> <span class="identifier">D</span> <span class="identifier">E</span> <span class="identifier">B</span> <span class="identifier">F</span> <span class="identifier">G</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.pre_order_iterator.definition"></a><a class="link" href="pre_order_iterator.html#tree_node.reference.pre_order_iterator.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/pre_order_iterator.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.pre_order_iterator.tpl_param"></a><a class="link" href="pre_order_iterator.html#tree_node.reference.pre_order_iterator.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">NodePointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of a pointer to a tree node.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Trivial Iterator concept, and
+ its value type must model the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">MimicsChildIterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines whether this <code class="computeroutput"><span class="identifier">pre_order_iterator</span></code>
+ will iterate only through the descendants of a node or will also
+ include the node in its traversal.
+ </p>
+ </td>
+<td>
+ <p>
+ It must model the Boolean Integral Constant concept.
+ </p>
+ </td>
+<td>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.pre_order_iterator.model_of"></a><a class="link" href="pre_order_iterator.html#tree_node.reference.pre_order_iterator.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="special">*</span> <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> <span class="keyword">if</span> <span class="error">`</span><span class="identifier">MimicsChildIterator</span><span class="special">::</span><span class="identifier">value</span><span class="error">`</span> <span class="identifier">is</span> <span class="error">`</span><span class="keyword">false</span><span class="error">`</span>
+<span class="special">*</span> <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> <span class="keyword">if</span> <span class="error">`</span><span class="identifier">MimicsChildIterator</span><span class="special">::</span><span class="identifier">value</span><span class="error">`</span> <span class="identifier">is</span> <span class="error">`</span><span class="keyword">true</span><span class="error">`</span>
+<span class="special">*</span> Default Constructible
+<span class="special">*</span> Copy Constructible
+<span class="special">*</span> Assignable
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.pre_order_iterator.public_bases"></a><a class="link" href="pre_order_iterator.html#tree_node.reference.pre_order_iterator.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<p>
+ None.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.pre_order_iterator.members"></a><a class="link" href="pre_order_iterator.html#tree_node.reference.pre_order_iterator.members" title="Members">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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Where defined
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Value type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">value_type</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Reference type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Distance type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">distance</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iterator category
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator_category</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Default constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pre_order_iterator</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Default Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor from im/mutable node
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pre_order_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Conversion constructor
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<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="identifier">NP</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI</span><span class="special">&gt;</span>
+<span class="identifier">pre_order_iterator</span><span class="special">(</span><span class="identifier">pre_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP</span><span class="special">,</span><span class="identifier">MCI</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;);</span>
+</pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pre_order_iterator</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pre_order_iterator</span><span class="special">(</span><span class="identifier">pre_order_iterator</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Copy Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Assignment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pre_order_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">pre_order_iterator</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Assignable
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Dereference operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">*()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Indirection operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="keyword">operator</span><span class="special">-&gt;()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pre-increment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pre_order_iterator</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">++();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Post-increment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pre_order_iterator</span>
+ <span class="keyword">operator</span><span class="special">++(</span><span class="keyword">int</span><span class="special">);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Forward Iterator
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Traversal state conversion operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">operator</span> <a class="link" href="traversal_state.html" title="traversal_state">traversal_state</a><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <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>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.pre_order_iterator.non_members"></a><a class="link" href="pre_order_iterator.html#tree_node.reference.pre_order_iterator.non_members" title="Non-members">Non-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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Iterator creation
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">&gt;</span>
+ <span class="identifier">pre_order_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</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">false_</span><span class="special">&gt;</span>
+ <span class="identifier">make_pre_order_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs and returns a <code class="computeroutput"><span class="identifier">pre_order_iterator</span></code>
+ that will iterate through the specified node and its descendants.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Descendant iterator creation
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">&gt;</span>
+ <span class="identifier">pre_order_iterator</span><span class="special">&lt;</span><span class="identifier">NodePointer</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">&gt;</span>
+ <span class="identifier">make_pre_order_descendant_iterator</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Constructs and returns a <code class="computeroutput"><span class="identifier">pre_order_iterator</span></code>
+ that will iterate through the descendants of the specified node.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Iteration
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">UnaryFunction</span><span class="special">&gt;</span>
+ <span class="keyword">void</span> <span class="identifier">pre_order_iterate</span><span class="special">(</span><span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">function</span><span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Iterates through the specified node and its descendants in pre-order
+ fashion, passing each node pointer dereferenced to the specified
+ Unary Function object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Descendant iteration
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">UnaryFunction</span><span class="special">&gt;</span>
+ <span class="keyword">void</span>
+ <span class="identifier">pre_order_iterate_descendants</span><span class="special">(</span>
+ <span class="identifier">NodePointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">node</span>
+ <span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">function</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Iterates through the descendants of the specified node in pre-order
+ fashion, passing each element dereferenced to the specified
+ Unary Function object.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Equality
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+ <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special">&lt;</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">equal_to</span><span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">==(</span>
+ <span class="identifier">pre_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span>
+ <span class="special">,</span> <span class="identifier">pre_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">rhs</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the Input Iterator concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Inequality
+ </p>
+ </td>
+<td>
+ <p>
+
+</p>
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-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">NP1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">NP2</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">MCI2</span><span class="special">&gt;</span>
+ <span class="keyword">typename</span> <span class="special">::</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special">&lt;</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">equal_to</span><span class="special">&lt;</span><span class="identifier">MCI1</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;,</span><span class="keyword">bool</span><span class="special">&gt;::</span><span class="identifier">type</span>
+ <span class="keyword">operator</span><span class="special">!=(</span>
+ <span class="identifier">pre_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP1</span><span class="special">,</span><span class="identifier">MCI1</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">lhs</span>
+ <span class="special">,</span> <span class="identifier">pre_order_iterator</span><span class="special">&lt;</span><span class="identifier">NP2</span><span class="special">,</span><span class="identifier">MCI2</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">rhs</span>
+ <span class="special">);</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the Input Iterator concept.
+ </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 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="breadth_first_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="post_order_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/raw_associative_node.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/raw_associative_node.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,810 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>raw_associative_node</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="simple_node.html" title="simple_node">
+<link rel="next" href="simple_associative_node.html" title="simple_associative_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="simple_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="simple_associative_node.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.raw_associative_node"></a><a class="link" href="raw_associative_node.html" title="raw_associative_node"><code class="computeroutput"><span class="identifier">raw_associative_node</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_associative_node.synopsis"></a><a class="link" href="raw_associative_node.html#tree_node.reference.raw_associative_node.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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="keyword">typename</span> <span class="identifier">Data</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">AssociativeContainerSelector</span> <span class="special">=</span> <span class="identifier">mapS</span>
+ <span class="special">&gt;</span>
+ <span class="keyword">class</span> <span class="identifier">raw_associative_node</span>
+ <span class="special">{</span>
+ <span class="keyword">public</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="identifier">raw_associative_node</span><span class="special">*</span>
+ <span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">raw_associative_node</span> <span class="keyword">const</span><span class="special">*</span>
+ <span class="identifier">const_pointer</span><span class="special">;</span>
+
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">child_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">const_child_iterator</span><span class="special">;</span>
+
+ <span class="identifier">raw_associative_node</span><span class="special">();</span>
+
+ <span class="keyword">explicit</span> <span class="identifier">raw_associative_node</span><span class="special">(</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">data</span><span class="special">);</span>
+
+ <span class="identifier">raw_associative_node</span><span class="special">(</span><span class="identifier">raw_associative_node</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+
+ <span class="identifier">raw_associative_node</span><span class="special">&amp;</span>
+ <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">raw_associative_node</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+
+ <span class="special">~</span><span class="identifier">raw_associative_node</span><span class="special">();</span>
+
+ <span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">data_type</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">();</span>
+
+ <span class="identifier">const_pointer</span> <span class="identifier">get_parent</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">get_parent</span><span class="special">();</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child</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">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">data</span><span class="special">);</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child</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">pointer</span> <span class="identifier">add_child_copy</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">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">();</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">get_child_end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">get_child_end</span><span class="special">();</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">find_child</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>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">find_child</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="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_child_iterator</span><span class="special">,</span><span class="identifier">const_child_iterator</span><span class="special">&gt;</span>
+ <span class="identifier">find_children</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>
+
+ <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">child_iterator</span><span class="special">,</span><span class="identifier">child_iterator</span><span class="special">&gt;</span>
+ <span class="identifier">find_children</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="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">remove_children</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">void</span> <span class="identifier">remove_all_children</span><span class="special">();</span>
+ <span class="special">};</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_associative_node.description"></a><a class="link" href="raw_associative_node.html#tree_node.reference.raw_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 that does not need
+ to be exposed to external code. Objects of this type can be stored by value,
+ and their children can be accessed by their associated keys for fast lookup.
+ </p>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+ This component depends on Boost.TypeTraitsOperators, which has been
+ recently accepted into Boost but is currently not part of an official
+ release. For now, you must perform a Subversion checkout from the SVN Trac.
+ </p></td></tr>
+</table></div>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+ This component depends on Boost.Utility.ContainerGen, which is not
+ yet a part of Boost. For now, you must perform a Subversion checkout
+ from the SVN Trac.
+ </p></td></tr>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_associative_node.definition"></a><a class="link" href="raw_associative_node.html#tree_node.reference.raw_associative_node.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/raw_associative_node.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_associative_node.tpl_param"></a><a class="link" href="raw_associative_node.html#tree_node.reference.raw_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">raw_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 object to be stored in a <code class="computeroutput"><span class="identifier">raw_associative_node</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">AssociativeContainerSelector</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines the internal map types whose mapped
+ types are the same as the pointer type.
+ </p>
+ </td>
+<td>
+ <p>
+ It must be a type for which associative_container_gen
+ returns a valid container.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">mapS</span></code>
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_associative_node.model_of"></a><a class="link" href="raw_associative_node.html#tree_node.reference.raw_associative_node.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="special">*</span> <a class="link" href="../concepts/associative_tree_node.html" title="Associative Tree Node"><span class="bold"><strong>Associative Tree Node</strong></span></a>
+<span class="special">*</span> Default Constructible <span class="keyword">if</span> <span class="error">`</span><span class="identifier">Data</span><span class="error">`</span> <span class="identifier">is</span> Default Constructible
+<span class="special">*</span> Copy Constructible
+<span class="special">*</span> Assignable <span class="keyword">if</span> <span class="error">`</span><span class="identifier">Data</span><span class="error">`</span> <span class="identifier">is</span> Assignable
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_associative_node.public_bases"></a><a class="link" href="raw_associative_node.html#tree_node.reference.raw_associative_node.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<p>
+ None.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_associative_node.members"></a><a class="link" href="raw_associative_node.html#tree_node.reference.raw_associative_node.members" title="Members">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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Where defined
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Key type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">key_type</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>
+ Data type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</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 type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</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>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_pointer</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>
+ Child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</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 child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</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>
+ Default constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">raw_associative_node</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Default Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">explicit</span> <span class="identifier">raw_associative_node</span><span class="special">(</span><span class="identifier">data_type</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">raw_associative_node</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">raw_associative_node</span><span class="special">(</span><span class="identifier">raw_associative_node</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Copy Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Assignment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">raw_associative_node</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">raw_associative_node</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Assignable
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</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>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&amp;</span>
+ <span class="identifier">get_data</span><span class="special">();</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>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_pointer</span> <span class="identifier">get_parent</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</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>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">get_parent</span><span class="special">();</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>
+ Child creation with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;,</span>
+ <span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;);</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>
+ Child creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;);</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>
+ Child copy creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;,</span>
+ <span class="identifier">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;);</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>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">get_child_begin</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</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>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">();</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>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">get_child_end</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</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>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">get_child_end</span><span class="special">();</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>
+ Child search
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">find_child</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;)</span> <span class="keyword">const</span><span class="special">;</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>
+ Child search
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">find_child</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;);</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>
+ Child search range
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal">std::pair&lt;Node::const_child_iterator,Node::const_child_iterator&gt;
+ find_children(key_type const&amp;) const;</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>
+ Child search range
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal">std::pair&lt;Node::child_iterator,Node::child_iterator&gt;
+ find_children(key_type const&amp;);</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>
+ Remove children
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">remove_children</span><span class="special">(</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;);</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>
+ Remove all children
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span> <span class="identifier">remove_all_children</span><span class="special">();</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>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_associative_node.example"></a><a class="link" href="raw_associative_node.html#tree_node.reference.raw_associative_node.example" title="Example">Example</a>
+</h4></div></div></div>
+<p>
+ &lt;example/raw_associative_node.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 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="simple_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="simple_associative_node.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/raw_node.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/raw_node.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,618 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>raw_node</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="../reference.html" title="Reference">
+<link rel="next" href="simple_node.html" title="simple_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="../reference.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="simple_node.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.raw_node"></a><a class="link" href="raw_node.html" title="raw_node"><code class="computeroutput"><span class="identifier">raw_node</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_node.synopsis"></a><a class="link" href="raw_node.html#tree_node.reference.raw_node.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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">T</span><span class="special">&gt;</span>
+ <span class="keyword">class</span> <span class="identifier">raw_node</span>
+ <span class="special">{</span>
+ <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span>
+ <span class="identifier">data_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">raw_node</span><span class="special">*</span>
+ <span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">raw_node</span> <span class="keyword">const</span><span class="special">*</span>
+ <span class="identifier">const_pointer</span><span class="special">;</span>
+
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">child_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">const_child_iterator</span><span class="special">;</span>
+
+ <span class="identifier">raw_node</span><span class="special">();</span>
+
+ <span class="keyword">explicit</span> <span class="identifier">raw_node</span><span class="special">(</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">data</span><span class="special">);</span>
+
+ <span class="identifier">raw_node</span><span class="special">(</span><span class="identifier">raw_node</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+
+ <span class="identifier">raw_node</span><span class="special">&amp;</span> <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">raw_node</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+
+ <span class="special">~</span><span class="identifier">raw_node</span><span class="special">();</span>
+
+ <span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">data_type</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">();</span>
+
+ <span class="identifier">const_pointer</span> <span class="identifier">get_parent</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">get_parent</span><span class="special">();</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">data</span><span class="special">);</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">();</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child_copy</span><span class="special">(</span><span class="identifier">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">();</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">get_child_end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">get_child_end</span><span class="special">();</span>
+
+ <span class="keyword">void</span> <span class="identifier">remove_all_children</span><span class="special">();</span>
+ <span class="special">};</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_node.description"></a><a class="link" href="raw_node.html#tree_node.reference.raw_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This class template is suitable for classes or algorithms that require
+ a tree node data structure but do not need to expose it to external code.
+ Objects of this type can be stored by value, and their children can be
+ accessed by offsetting the start of the range with a numerical index for
+ fast lookup.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_node.definition"></a><a class="link" href="raw_node.html#tree_node.reference.raw_node.definition" title="Where defined">Where defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/raw_node.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_node.tpl_param"></a><a class="link" href="raw_node.html#tree_node.reference.raw_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">T</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of the object to be stored in a <code class="computeroutput"><span class="identifier">raw_node</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ </td>
+</tr></tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_node.model_of"></a><a class="link" href="raw_node.html#tree_node.reference.raw_node.model_of" title="Model of">Model of</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="special">*</span> <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random Access Child Iterator Tree Node</strong></span></a>
+<span class="special">*</span> Default Constructible <span class="keyword">if</span> <span class="error">`</span><span class="identifier">T</span><span class="error">`</span> <span class="identifier">is</span> Default Constructible
+<span class="special">*</span> Copy Constructible
+<span class="special">*</span> Assignable <span class="keyword">if</span> <span class="error">`</span><span class="identifier">T</span><span class="error">`</span> <span class="identifier">is</span> Assignable
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_node.public_bases"></a><a class="link" href="raw_node.html#tree_node.reference.raw_node.public_bases" title="Public Base Classes">Public Base
+ Classes</a>
+</h4></div></div></div>
+<p>
+ None.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_node.members"></a><a class="link" href="raw_node.html#tree_node.reference.raw_node.members" title="Members">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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Where defined
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Data type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</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 type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</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>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_pointer</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>
+ Child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random
+ Access Child Iterator Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random
+ Access Child Iterator Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Default constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">raw_node</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Default Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Constructor with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">explicit</span> <span class="identifier">raw_node</span><span class="special">(</span><span class="identifier">data_type</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">raw_node</span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Copy constructor
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">raw_node</span><span class="special">(</span><span class="identifier">raw_node</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Copy Constructible
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Assignment operator
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">raw_node</span><span class="special">&amp;</span>
+ <span class="keyword">operator</span><span class="special">=(</span><span class="identifier">raw_node</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Assignable
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</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>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&amp;</span>
+ <span class="identifier">get_data</span><span class="special">();</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>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_pointer</span> <span class="identifier">get_parent</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</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>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">get_parent</span><span class="special">();</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>
+ Child creation with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">data_type</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random
+ Access Child Iterator Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random
+ Access Child Iterator Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child copy creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">const_pointer</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random
+ Access Child Iterator Tree Node</strong></span></a>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">get_child_begin</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</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>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">();</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>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">get_child_end</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</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>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">get_child_end</span><span class="special">();</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>
+ Remove all children
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span> <span class="identifier">remove_all_children</span><span class="special">();</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>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.raw_node.example"></a><a class="link" href="raw_node.html#tree_node.reference.raw_node.example" title="Example">Example</a>
+</h4></div></div></div>
+<p>
+ &lt;example/raw_node.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 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.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="simple_node.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/simple_associative_node.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/simple_associative_node.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,785 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>simple_associative_node</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="raw_associative_node.html" title="raw_associative_node">
+<link rel="next" href="breadth_first_iterator.html" title="breadth_first_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="raw_associative_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="breadth_first_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.simple_associative_node"></a><a class="link" href="simple_associative_node.html" title="simple_associative_node"><code class="computeroutput"><span class="identifier">simple_associative_node</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_associative_node.synopsis"></a><a class="link" href="simple_associative_node.html#tree_node.reference.simple_associative_node.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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="keyword">typename</span> <span class="identifier">Data</span>
+ <span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">AssociativeContainerSelector</span> <span class="special">=</span> <span class="identifier">mapS</span>
+ <span class="special">&gt;</span>
+ <span class="keyword">class</span> <span class="identifier">simple_associative_node</span>
+ <span class="special">:</span> <span class="keyword">public</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">enable_shared_from_this</span><span class="special">&lt;</span>
+ <span class="identifier">simple_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">AssociativeContainerSelector</span><span class="special">&gt;</span>
+ <span class="special">&gt;</span>
+ <span class="special">,</span> <span class="keyword">private</span> <span class="identifier">noncopyable</span>
+ <span class="special">{</span>
+ <span class="keyword">public</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="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">shared_ptr</span><span class="special">&lt;</span><span class="identifier">simple_associative_node</span><span class="special">&gt;</span>
+ <span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">shared_ptr</span><span class="special">&lt;</span><span class="identifier">simple_associative_node</span> <span class="keyword">const</span><span class="special">&gt;</span>
+ <span class="identifier">const_pointer</span><span class="special">;</span>
+
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">child_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">const_child_iterator</span><span class="special">;</span>
+
+ <span class="special">~</span><span class="identifier">simple_associative_node</span><span class="special">();</span>
+
+ <span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">data_type</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">();</span>
+
+ <span class="identifier">const_pointer</span> <span class="identifier">get_parent</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">get_parent</span><span class="special">();</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child</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">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">data</span><span class="special">);</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child</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">pointer</span> <span class="identifier">add_child_copy</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">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">();</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">get_child_end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">get_child_end</span><span class="special">();</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">find_child</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>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">find_child</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="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_child_iterator</span><span class="special">,</span><span class="identifier">const_child_iterator</span><span class="special">&gt;</span>
+ <span class="identifier">find_children</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>
+
+ <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">child_iterator</span><span class="special">,</span><span class="identifier">child_iterator</span><span class="special">&gt;</span>
+ <span class="identifier">find_children</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="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">remove_children</span><span class="special">(</span><span class="identifier">Key</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">key</span><span class="special">);</span>
+
+ <span class="keyword">void</span> <span class="identifier">remove_all_children</span><span class="special">();</span>
+
+ <span class="keyword">static</span> <span class="identifier">pointer</span> <span class="identifier">create</span><span class="special">(</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">data</span><span class="special">);</span>
+
+ <span class="keyword">static</span> <span class="identifier">pointer</span> <span class="identifier">create</span><span class="special">();</span>
+
+ <span class="keyword">static</span> <span class="identifier">pointer</span> <span class="identifier">create_copy</span><span class="special">(</span><span class="identifier">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">p</span><span class="special">);</span>
+ <span class="special">};</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_associative_node.description"></a><a class="link" href="simple_associative_node.html#tree_node.reference.simple_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 that must be exposed
+ to external code. Objects of this type must be stored by <code class="computeroutput"><span class="identifier">simple_associative_node</span><span class="special">::</span><span class="identifier">pointer</span></code> and can only be instantiated
+ through the <code class="computeroutput"><span class="keyword">static</span></code> creation
+ methods that this class template provides. Their children can be accessed
+ by their associated keys for fast lookup.
+ </p>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+ This component depends on Boost.TypeTraitsOperators, which has been
+ recently accepted into Boost but is currently not part of an official
+ release. For now, you must perform a Subversion checkout from the SVN Trac.
+ </p></td></tr>
+</table></div>
+<div class="important"><table border="0" summary="Important">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../images/important.png"></td>
+<th align="left">Important</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+ This component depends on Boost.Utility.ContainerGen, which is not
+ yet a part of Boost. For now, you must perform a Subversion checkout
+ from the SVN Trac.
+ </p></td></tr>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_associative_node.definition"></a><a class="link" href="simple_associative_node.html#tree_node.reference.simple_associative_node.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/simple_associative_node.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_associative_node.tpl_param"></a><a class="link" href="simple_associative_node.html#tree_node.reference.simple_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">raw_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 object to be stored in a <code class="computeroutput"><span class="identifier">simple_associative_node</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">AssociativeContainerSelector</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type that determines the internal map types whose mapped
+ types are the same as the pointer type.
+ </p>
+ </td>
+<td>
+ <p>
+ It must be a type for which associative_container_gen
+ returns a valid container.
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">mapS</span></code>
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_associative_node.model_of"></a><a class="link" href="simple_associative_node.html#tree_node.reference.simple_associative_node.model_of" title="Model of">Model
+ of</a>
+</h4></div></div></div>
+<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>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_associative_node.public_bases"></a><a class="link" href="simple_associative_node.html#tree_node.reference.simple_associative_node.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<p>
+ std::tr1::enable_shared_from_this
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_associative_node.members"></a><a class="link" href="simple_associative_node.html#tree_node.reference.simple_associative_node.members" title="Members">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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Data type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer-to-const type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Node creation with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">static</span> <span class="identifier">pointer</span>
+ <span class="identifier">create</span><span class="special">(</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Creates a <code class="computeroutput"><span class="identifier">simple_associative_node</span></code>
+ object with the specified data and returns a pointer to it.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Node creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">static</span> <span class="identifier">pointer</span>
+ <span class="identifier">create</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Creates a <code class="computeroutput"><span class="identifier">simple_associative_node</span></code>
+ object and returns a pointer to it.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Node copy creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">static</span> <span class="identifier">pointer</span>
+ <span class="identifier">create_copy</span><span class="special">(</span><span class="identifier">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Creates a deep copy of the specified node. Returns a pointer
+ to the new node.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&amp;</span>
+ <span class="identifier">get_data</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_pointer</span> <span class="identifier">get_parent</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">get_parent</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child creation with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;,</span>
+ <span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child copy creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;,</span>
+ <span class="identifier">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">get_child_begin</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">get_child_end</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">get_child_end</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">find_child</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;)</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">find_child</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search range
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal">std::pair&lt;Node::const_child_iterator,Node::const_child_iterator&gt;
+ find_children(key_type const&amp;) const;</code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child search range
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="literal">std::pair&lt;Node::child_iterator,Node::child_iterator&gt;
+ find_children(key_type const&amp;);</code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove children
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">remove_children</span><span class="special">(</span><span class="identifier">key_type</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by 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>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove all children
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span> <span class="identifier">remove_all_children</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_associative_node.example"></a><a class="link" href="simple_associative_node.html#tree_node.reference.simple_associative_node.example" title="Example">Example</a>
+</h4></div></div></div>
+<p>
+ &lt;example/simple_associative_node.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 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="raw_associative_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="breadth_first_iterator.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/simple_node.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/simple_node.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,595 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>simple_node</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="raw_node.html" title="raw_node">
+<link rel="next" href="raw_associative_node.html" title="raw_associative_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="raw_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="raw_associative_node.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.simple_node"></a><a class="link" href="simple_node.html" title="simple_node"><code class="computeroutput"><span class="identifier">simple_node</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_node.synopsis"></a><a class="link" href="simple_node.html#tree_node.reference.simple_node.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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">T</span><span class="special">&gt;</span>
+ <span class="keyword">class</span> <span class="identifier">simple_node</span>
+ <span class="special">:</span> <span class="keyword">public</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">enable_shared_from_this</span><span class="special">&lt;</span><span class="identifier">simple_node</span><span class="special">&lt;</span><span class="identifier">T</span><span class="special">&gt;</span> <span class="special">&gt;</span>
+ <span class="special">,</span> <span class="keyword">private</span> <span class="identifier">noncopyable</span>
+ <span class="special">{</span>
+ <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span>
+ <span class="identifier">data_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">shared_ptr</span><span class="special">&lt;</span><span class="identifier">simple_node</span><span class="special">&gt;</span>
+ <span class="identifier">pointer</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="special">::</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">shared_ptr</span><span class="special">&lt;</span><span class="identifier">simple_node</span> <span class="keyword">const</span><span class="special">&gt;</span>
+ <span class="identifier">const_pointer</span><span class="special">;</span>
+
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">child_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="comment">// implementation_defined
+</span> <span class="identifier">const_child_iterator</span><span class="special">;</span>
+
+ <span class="special">~</span><span class="identifier">simple_node</span><span class="special">();</span>
+
+ <span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">data_type</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">();</span>
+
+ <span class="identifier">const_pointer</span> <span class="identifier">get_parent</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">get_parent</span><span class="special">();</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">data</span><span class="special">);</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">();</span>
+
+ <span class="identifier">pointer</span> <span class="identifier">add_child_copy</span><span class="special">(</span><span class="identifier">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">copy</span><span class="special">);</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">();</span>
+
+ <span class="identifier">const_child_iterator</span> <span class="identifier">get_child_end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="identifier">child_iterator</span> <span class="identifier">get_child_end</span><span class="special">();</span>
+
+ <span class="keyword">void</span> <span class="identifier">remove_all_children</span><span class="special">();</span>
+
+ <span class="keyword">static</span> <span class="identifier">pointer</span> <span class="identifier">create</span><span class="special">(</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">data</span><span class="special">);</span>
+
+ <span class="keyword">static</span> <span class="identifier">pointer</span> <span class="identifier">create</span><span class="special">();</span>
+
+ <span class="keyword">static</span> <span class="identifier">pointer</span> <span class="identifier">create_copy</span><span class="special">(</span><span class="identifier">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">p</span><span class="special">);</span>
+ <span class="special">};</span>
+
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_node.description"></a><a class="link" href="simple_node.html#tree_node.reference.simple_node.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This class template is suitable for classes or algorithms that require
+ a tree node data structure that must be exposed to external code. Objects
+ of this type must be stored by <code class="computeroutput"><span class="identifier">simple_node</span><span class="special">::</span><span class="identifier">pointer</span></code>
+ and can only be instantiated through the <code class="computeroutput"><span class="keyword">static</span></code>
+ creation methods that this class template provides. Their children can
+ be accessed by offsetting the start of the range with a numerical index
+ for fast lookup.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_node.definition"></a><a class="link" href="simple_node.html#tree_node.reference.simple_node.definition" title="Where defined">Where defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/simple_node.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_node.tpl_param"></a><a class="link" href="simple_node.html#tree_node.reference.simple_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">T</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The type of the object to be stored in a <code class="computeroutput"><span class="identifier">simple_node</span></code>.
+ </p>
+ </td>
+<td>
+ </td>
+<td>
+ </td>
+</tr></tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_node.model_of"></a><a class="link" href="simple_node.html#tree_node.reference.simple_node.model_of" title="Model of">Model of</a>
+</h4></div></div></div>
+<p>
+ <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random
+ Access Child Iterator Tree Node</strong></span></a>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_node.public_bases"></a><a class="link" href="simple_node.html#tree_node.reference.simple_node.public_bases" title="Public Base Classes">Public
+ Base Classes</a>
+</h4></div></div></div>
+<p>
+ std::tr1::enable_shared_from_this
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_node.members"></a><a class="link" href="simple_node.html#tree_node.reference.simple_node.members" title="Members">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>
+ Expression
+ </p>
+ </th>
+<th>
+ <p>
+ Description
+ </p>
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ <p>
+ Data type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Pointer-to-const type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_pointer</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random Access Child Iterator Tree Node</strong></span></a>
+ concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Immutable child iterator type
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random Access Child Iterator Tree Node</strong></span></a>
+ concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Node creation with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">static</span> <span class="identifier">pointer</span>
+ <span class="identifier">create</span><span class="special">(</span><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Creates a <code class="computeroutput"><span class="identifier">simple_node</span></code>
+ object with the specified data and returns a pointer to it.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Node creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">static</span> <span class="identifier">pointer</span>
+ <span class="identifier">create</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Creates a <code class="computeroutput"><span class="identifier">simple_node</span></code>
+ object and returns a pointer to it.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Node copy creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">static</span> <span class="identifier">pointer</span>
+ <span class="identifier">create_copy</span><span class="special">(</span><span class="identifier">const_pointer</span> <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Creates a deep copy of the specified node. Returns a pointer
+ to the new node.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get_data</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Data access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&amp;</span>
+ <span class="identifier">get_data</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_pointer</span> <span class="identifier">get_parent</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Parent access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">get_parent</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child creation with data
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">data_type</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random Access Child Iterator Tree Node</strong></span></a>
+ concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random Access Child Iterator Tree Node</strong></span></a>
+ concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Child copy creation
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pointer</span> <span class="identifier">add_child</span><span class="special">(</span><span class="identifier">const_pointer</span>
+ <span class="keyword">const</span><span class="special">&amp;);</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/raci_tree_node.html" title="Random Access Child Iterator Tree Node"><span class="bold"><strong>Random Access Child Iterator Tree Node</strong></span></a>
+ concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">get_child_begin</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range begin access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">get_child_begin</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">const_child_iterator</span>
+ <span class="identifier">get_child_end</span><span class="special">()</span>
+ <span class="keyword">const</span><span class="special">;</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Children range past-the-end access
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">child_iterator</span> <span class="identifier">get_child_end</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Remove all children
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="keyword">void</span> <span class="identifier">remove_all_children</span><span class="special">();</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Defined by the <a class="link" href="../concepts/tree_node.html" title="Tree Node"><span class="bold"><strong>Tree Node</strong></span></a> concept.
+ </p>
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.simple_node.example"></a><a class="link" href="simple_node.html#tree_node.reference.simple_node.example" title="Example">Example</a>
+</h4></div></div></div>
+<p>
+ &lt;example/simple_node.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 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="raw_node.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a><a accesskey="n" href="raw_associative_node.html"><img src="../../images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/traversal_state.html
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/html/tree_node/reference/traversal_state.html 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,85 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>traversal_state</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<link rel="home" href="../../index.html" title="Chapter&#160;1.&#160;tree_node 0.1">
+<link rel="up" href="../reference.html" title="Reference">
+<link rel="prev" href="depth_first_iterator.html" title="depth_first_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="depth_first_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="tree_node.reference.traversal_state"></a><a class="link" href="traversal_state.html" title="traversal_state"><code class="computeroutput"><span class="identifier">traversal_state</span></code></a>
+</h3></div></div></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.traversal_state.synopsis"></a><a class="link" href="traversal_state.html#tree_node.reference.traversal_state.synopsis" title="Synopsis">Synopsis</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<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">enum</span> <span class="identifier">traversal_state</span>
+ <span class="special">{</span>
+ <span class="identifier">no_traversal</span>
+ <span class="special">,</span> <span class="identifier">pre_order_traversal</span>
+ <span class="special">,</span> <span class="identifier">post_order_traversal</span>
+ <span class="special">,</span> <span class="identifier">breadth_first_traversal</span>
+ <span class="special">};</span>
+<span class="special">}}</span> <span class="comment">// namespace boost::tree_node
+</span></pre>
+<p>
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.traversal_state.description"></a><a class="link" href="traversal_state.html#tree_node.reference.traversal_state.description" title="Description">Description</a>
+</h4></div></div></div>
+<p>
+ This enumeration type is the return type of the dereferenceability expression
+ defined by each iterator type that this library provides. The <code class="computeroutput"><span class="identifier">no_traversal</span></code> value corresponds to <code class="computeroutput"><span class="keyword">false</span></code> in a boolean context, enabling the
+ iterator types to fulfill their runtime requirements for dereferenceability.
+ The <code class="computeroutput"><span class="identifier">pre_order_traversal</span></code>
+ and <code class="computeroutput"><span class="identifier">post_order_traversal</span></code>
+ values are significant because the <a class="link" href="depth_first_iterator.html" title="depth_first_iterator"><code class="computeroutput"><span class="identifier">depth_first_iterator</span></code></a> traverses
+ each node twice, so algorithms must be able to distinguish which state
+ the iterator is in when it traverses a tree node. The <code class="computeroutput"><span class="identifier">breadth_first_traversal</span></code>
+ value is defined for completeness.
+ </p>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="tree_node.reference.traversal_state.definition"></a><a class="link" href="traversal_state.html#tree_node.reference.traversal_state.definition" title="Where defined">Where
+ defined</a>
+</h4></div></div></div>
+<p>
+
+</p>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special">&lt;</span>boost/tree_node/traversal_state.hpp<span class="special">&gt;</span>
+</pre>
+<p>
+ </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 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="depth_first_iterator.html"><img src="../../images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../images/home.png" alt="Home"></a>
+</div>
+</body>
+</html>

Added: sandbox/tree_node/libs/tree_node/doc/ref_breadth_first_iterator.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_breadth_first_iterator.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,224 @@
+[/=============================================================================
+ Copyright (C) 2011 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:breadth_first_iterator `breadth_first_iterator`]
+
+[section Synopsis]
+[reference__breadth_first_iterator]
+[endsect]
+
+[section Description]
+This iterator traverses the specified root node and all its descendants in
+breadth-first fashion, e.g. given the following tree representation:
+
+``
+ A
+ |
+ C---+---B
+ | |
++-+-+ +-+-+
+| | | |
+D E F G
+``
+
+If this iterator is a __Full_Tree_Node_Iterator__, then it will traverse the
+tree nodes in the following order:
+
+``
+A C B D E F G
+``
+
+If this iterator is a __Tree_Node_Descendant_Iterator__, then it will traverse
+the tree nodes in the following order:
+
+``
+C B D E F G
+``
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_breadth_first_iterator_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`NodePointer`]
+ [The type of a pointer to a tree node.]
+ [
+ It must model the __Trivial_Iterator__ concept, and its value type
+ must model the __Tree_Node__ concept.
+ ]
+ []
+ ]
+ [
+ [`MimicsChildIterator`]
+ [
+ The type that determines whether this `breadth_first_iterator` will
+ iterate only through the descendants of a node or will also include
+ the node in its traversal.
+ ]
+ [It must model the __Boolean_Integral_Constant__ concept.]
+ []
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+
+ * __Full_Tree_Node_Iterator__ if `MimicsChildIterator::value` is `false`
+ * __Tree_Node_Descendant_Iterator__ if `MimicsChildIterator::value` is `true`
+ * __Default_Constructible__
+ * __Copy_Constructible__
+ * __Assignable__
+
+[endsect]
+
+[section:public_bases Public Base Classes]
+None.
+[endsect]
+
+[section Members]
+[table
+ [[Name][Expression][Where defined]]
+ [
+ [Value type]
+ [`value_type`]
+ [__Tree_Node_Iterator__]
+ ]
+ [
+ [Reference type]
+ [`reference`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Pointer type]
+ [`pointer`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Distance type]
+ [`distance`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Iterator category]
+ [`iterator_category`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Default constructor]
+ [`breadth_first_iterator();`]
+ [__Default_Constructible__]
+ ]
+ [
+ [Constructor from im/mutable node]
+ [`breadth_first_iterator(NodePointer const&);`]
+ [__Tree_Node_Iterator__]
+ ]
+ [
+ [Conversion constructor]
+ [``
+ template <typename NP, typename MCI>
+ breadth_first_iterator(breadth_first_iterator<NP,MCI> const&);
+ ``]
+ [`breadth_first_iterator`]
+ ]
+ [
+ [Copy constructor]
+ [`breadth_first_iterator(breadth_first_iterator const&);`]
+ [__Copy_Constructible__]
+ ]
+ [
+ [Assignment operator]
+ [`breadth_first_iterator& operator=(breadth_first_iterator const&);`]
+ [__Assignable__]
+ ]
+ [
+ [Dereference operator]
+ [`reference operator*() const;`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Indirection operator]
+ [`pointer operator->() const;`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Pre-increment operator]
+ [`breadth_first_iterator& operator++();`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Post-increment operator]
+ [`breadth_first_iterator operator++(int);`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Traversal state conversion operator]
+ [`operator _traversal_state_() const;`]
+ [__Tree_Node_Iterator__]
+ ]
+]
+[endsect] [/ Members]
+
+[section:non_members Non-members]
+[table
+ [[Name][Expression][Description]]
+ [
+ [Iterator creation]
+ [[reference__make_breadth_first_iterator]]
+ [
+ Constructs and returns a `breadth_first_iterator` that will iterate
+ through the specified node and its descendants.
+ ]
+ ]
+ [
+ [Descendant iterator creation]
+ [[reference__make_breadth_first_descendant_iterator]]
+ [
+ Constructs and returns a `breadth_first_iterator` that will iterate
+ through the descendants of the specified node.
+ ]
+ ]
+ [
+ [Iteration]
+ [[reference__breadth_first_iterate]]
+ [
+ Iterates through the specified node and its descendants in
+ breadth-first fashion, passing each node pointer dereferenced to
+ the specified __Unary_Function__ object.
+ ]
+ ]
+ [
+ [Descendant iteration]
+ [[reference__breadth_first_iterate_descendants]]
+ [
+ Iterates through the descendants of the specified node in
+ breadth-first fashion, passing each element dereferenced to
+ the specified __Unary_Function__ object.
+ ]
+ ]
+ [
+ [Equality]
+ [[reference__breadth_first_iterator__operator_equals]]
+ [Defined by the __Input_Iterator__ concept.]
+ ]
+ [
+ [Inequality]
+ [[reference__breadth_first_iterator__operator_not_equal]]
+ [Defined by the __Input_Iterator__ concept.]
+ ]
+]
+[endsect] [/ Non-members]
+
+[endsect] [/ breadth_first_iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/ref_depth_first_iterator.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_depth_first_iterator.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,299 @@
+[/=============================================================================
+ Copyright (C) 2011 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:depth_first_iterator `depth_first_iterator`]
+
+[section Synopsis]
+[reference__depth_first_iterator]
+[endsect]
+
+[section Description]
+This iterator traverses the specified root node and all its descendants in
+depth-first fashion, e.g. given the following tree representation:
+
+``
+ A
+ |
+ C---+---B
+ | |
++-+-+ +-+-+
+| | | |
+D E F G
+``
+
+If this iterator is a __Full_Tree_Node_Iterator__, then it will traverse the
+tree nodes in the following order:
+
+``
+A pre_order_traversal
+C pre_order_traversal
+D pre_order_traversal
+D post_order_traversal
+E pre_order_traversal
+E post_order_traversal
+C post_order_traversal
+B pre_order_traversal
+F pre_order_traversal
+F post_order_traversal
+G pre_order_traversal
+G post_order_traversal
+B post_order_traversal
+A post_order_traversal
+``
+
+If this iterator is a __Tree_Node_Descendant_Iterator__, then it will traverse
+the tree nodes in the following order:
+
+``
+C pre_order_traversal
+D pre_order_traversal
+D post_order_traversal
+E pre_order_traversal
+E post_order_traversal
+C post_order_traversal
+B pre_order_traversal
+F pre_order_traversal
+F post_order_traversal
+G pre_order_traversal
+G post_order_traversal
+B post_order_traversal
+``
+
+The traversal state conversion operator of this iterator will yield each value
+in the column on the right at the appropriate iteration.
+
+This iterator is ideal for algorithms that need to perform both preprocessing
+and postprocessing of a tree node, e.g. the copy constructors of the
+__raw_node__ and __raw_associative_node__ implementations.
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_depth_first_iterator_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`NodePointer`]
+ [The type of a pointer to a tree node.]
+ [
+ It must model the __Trivial_Iterator__ concept, and its value type
+ must model the __Tree_Node__ concept.
+ ]
+ []
+ ]
+ [
+ [`MimicsChildIterator`]
+ [
+ The type that determines whether this `depth_first_iterator` will
+ iterate only through the descendants of a node or will also include
+ the node in its traversal.
+ ]
+ [It must model the __Boolean_Integral_Constant__ concept.]
+ []
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+
+ * __Full_Tree_Node_Iterator__ if `MimicsChildIterator::value` is `false`
+ * __Tree_Node_Descendant_Iterator__ if `MimicsChildIterator::value` is `true`
+ * __Default_Constructible__
+ * __Copy_Constructible__
+ * __Assignable__
+
+[endsect]
+
+[section:public_bases Public Base Classes]
+None.
+[endsect]
+
+[section Members]
+[table
+ [[Name][Expression][Description]]
+ [
+ [Value type]
+ [`value_type`]
+ [Defined in the __Tree_Node_Iterator__ concept.]
+ ]
+ [
+ [Reference type]
+ [`reference`]
+ [Defined in the __Forward_Iterator__ concept.]
+ ]
+ [
+ [Pointer type]
+ [`pointer`]
+ [Defined in the __Forward_Iterator__ concept.]
+ ]
+ [
+ [Distance type]
+ [`distance`]
+ [Defined in the __Forward_Iterator__ concept.]
+ ]
+ [
+ [Iterator category]
+ [`iterator_category`]
+ [Defined in the __Forward_Iterator__ concept.]
+ ]
+ [
+ [Default constructor]
+ [`depth_first_iterator();`]
+ [Defined in the __Default_Constructible__ concept.]
+ ]
+ [
+ [Constructor from im/mutable node]
+ [`depth_first_iterator(NodePointer const&);`]
+ [Defined in the __Tree_Node_Iterator__ concept.]
+ ]
+ [
+ [Conversion constructor]
+ [``
+ template <typename NP, typename MCI>
+ depth_first_iterator(depth_first_iterator<NP,MCI> const&);
+ ``]
+ [
+ Constructs a `depth_first_iterator` object that will point to the
+ same element that the specified iterator points to.
+ ]
+ ]
+ [
+ [Copy constructor]
+ [`depth_first_iterator(depth_first_iterator const&);`]
+ [Defined in the __Copy_Constructible__ concept.]
+ ]
+ [
+ [Assignment operator]
+ [`depth_first_iterator& operator=(depth_first_iterator const&);`]
+ [Defined in the __Assignable__ concept.]
+ ]
+ [
+ [Dereference operator]
+ [`reference operator*() const;`]
+ [Defined in the __Forward_Iterator__ concept.]
+ ]
+ [
+ [Indirection operator]
+ [`pointer operator->() const;`]
+ [Defined in the __Forward_Iterator__ concept.]
+ ]
+ [
+ [Pre-increment operator]
+ [`depth_first_iterator& operator++();`]
+ [Defined in the __Forward_Iterator__ concept.]
+ ]
+ [
+ [Post-increment operator]
+ [`depth_first_iterator operator++(int);`]
+ [Defined in the __Forward_Iterator__ concept.]
+ ]
+ [
+ [Traversal state conversion operator]
+ [`operator _traversal_state_() const;`]
+ [
+ Returns `pre_order_traversal` if this iterator has not yet examined
+ the children of the current node, `post_order_traversal` if this
+ iterator has examined all of the children of the current node, or
+ `no_traversal` if this iterator is not dereferenceable.
+ ]
+ ]
+]
+[endsect] [/ Members]
+
+[section:non_members Non-members]
+[table
+ [[Name][Expression][Description]]
+ [
+ [Iterator creation]
+ [``
+ template <typename NodePointer>
+ depth_first_iterator<NodePointer,_mpl_false_>
+ make_depth_first_iterator(NodePointer const& node);
+ ``]
+ [
+ Constructs and returns a `depth_first_iterator` that will iterate
+ through the specified node and its descendants.
+ ]
+ ]
+ [
+ [Descendant iterator creation]
+ [``
+ template <typename NodePointer>
+ depth_first_iterator<NodePointer,_mpl_true_>
+ make_depth_first_descendant_iterator(NodePointer const& node);
+ ``]
+ [
+ Constructs and returns a `depth_first_iterator` that will iterate
+ through the descendants of the specified node.
+ ]
+ ]
+ [
+ [Iteration]
+ [``
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ depth_first_iterate(
+ NodePointer const& node
+ , UnaryFunction function
+ );
+ ``]
+ [
+ Iterates through the specified node and its descendants in
+ depth-first fashion, passing each node pointer dereferenced to
+ the specified __Unary_Function__ object.
+ ]
+ ]
+ [
+ [Descendant iteration]
+ [``
+ template <typename NodePointer, typename UnaryFunction>
+ void
+ depth_first_iterate_descendants(
+ NodePointer const& node
+ , UnaryFunction function
+ );
+ ``]
+ [
+ Iterates through the descendants of the specified node in
+ depth-first fashion, passing each element dereferenced to
+ the specified __Unary_Function__ object.
+ ]
+ ]
+ [
+ [Equality]
+ [``
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+ typename _enable_if_<_mpl_equal_to_<MCI1,MCI2>,bool>::type
+ operator==(
+ depth_first_iterator<NP1,MCI1> const&
+ , depth_first_iterator<NP2,MCI2> const&
+ );
+ ``]
+ [Defined by the __Input_Iterator__ concept.]
+ ]
+ [
+ [Inequality]
+ [``
+ template <typename NP1, typename NP2, typename MCI1, typename MCI2>
+ typename _enable_if_<_mpl_equal_to_<MCI1,MCI2>,bool>::type
+ operator!=(
+ depth_first_iterator<NP1,MCI1> const&
+ , depth_first_iterator<NP2,MCI2> const&
+ );
+ ``]
+ [Defined by the __Input_Iterator__ concept.]
+ ]
+]
+[endsect] [/ Non-members]
+
+[endsect] [/ depth_first_iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/ref_post_order_iterator.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_post_order_iterator.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,224 @@
+[/=============================================================================
+ Copyright (C) 2011 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:post_order_iterator `post_order_iterator`]
+
+[section Synopsis]
+[reference__post_order_iterator]
+[endsect]
+
+[section Description]
+This iterator traverses the specified root node and all its descendants in
+post-order fashion, e.g. given the following tree representation:
+
+``
+ A
+ |
+ C---+---B
+ | |
++-+-+ +-+-+
+| | | |
+D E F G
+``
+
+If this iterator is a __Full_Tree_Node_Iterator__, then it will traverse the
+tree nodes in the following order:
+
+``
+D E C F G B A
+``
+
+If this iterator is a __Tree_Node_Descendant_Iterator__, then it will traverse
+the tree nodes in the following order:
+
+``
+D E C F G B
+``
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_post_order_iterator_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`NodePointer`]
+ [The type of a pointer to a tree node.]
+ [
+ It must model the __Trivial_Iterator__ concept, and its value type
+ must model the __Tree_Node__ concept.
+ ]
+ []
+ ]
+ [
+ [`MimicsChildIterator`]
+ [
+ The type that determines whether this `post_order_iterator` will
+ iterate only through the descendants of a node or will also include
+ the node in its traversal.
+ ]
+ [It must model the __Boolean_Integral_Constant__ concept.]
+ []
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+
+ * __Full_Tree_Node_Iterator__ if `MimicsChildIterator::value` is `false`
+ * __Tree_Node_Descendant_Iterator__ if `MimicsChildIterator::value` is `true`
+ * __Default_Constructible__
+ * __Copy_Constructible__
+ * __Assignable__
+
+[endsect]
+
+[section:public_bases Public Base Classes]
+None.
+[endsect]
+
+[section Members]
+[table
+ [[Name][Expression][Where defined]]
+ [
+ [Value type]
+ [`value_type`]
+ [__Tree_Node_Iterator__]
+ ]
+ [
+ [Reference type]
+ [`reference`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Pointer type]
+ [`pointer`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Distance type]
+ [`distance`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Iterator category]
+ [`iterator_category`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Default constructor]
+ [`post_order_iterator();`]
+ [__Default_Constructible__]
+ ]
+ [
+ [Constructor from im/mutable node]
+ [`post_order_iterator(NodePointer const&);`]
+ [__Tree_Node_Iterator__]
+ ]
+ [
+ [Conversion constructor]
+ [``
+ template <typename NP, typename MCI>
+ post_order_iterator(post_order_iterator<NP,MCI> const&);
+ ``]
+ [`post_order_iterator`]
+ ]
+ [
+ [Copy constructor]
+ [`post_order_iterator(post_order_iterator const&);`]
+ [__Copy_Constructible__]
+ ]
+ [
+ [Assignment operator]
+ [`post_order_iterator& operator=(post_order_iterator const&);`]
+ [__Assignable__]
+ ]
+ [
+ [Dereference operator]
+ [`reference operator*() const;`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Indirection operator]
+ [`pointer operator->() const;`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Pre-increment operator]
+ [`post_order_iterator& operator++();`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Post-increment operator]
+ [`post_order_iterator operator++(int);`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Traversal state conversion operator]
+ [`operator _traversal_state_() const;`]
+ [__Tree_Node_Iterator__]
+ ]
+]
+[endsect] [/ Members]
+
+[section:non_members Non-members]
+[table
+ [[Name][Expression][Description]]
+ [
+ [Iterator creation]
+ [[reference__make_post_order_iterator]]
+ [
+ Constructs and returns a `post_order_iterator` that will iterate
+ through the specified node and its descendants.
+ ]
+ ]
+ [
+ [Descendant iterator creation]
+ [[reference__make_post_order_descendant_iterator]]
+ [
+ Constructs and returns a `post_order_iterator` that will iterate
+ through the descendants of the specified node.
+ ]
+ ]
+ [
+ [Iteration]
+ [[reference__post_order_iterate]]
+ [
+ Iterates through the specified node and its descendants in
+ post-order fashion, passing each node pointer dereferenced to
+ the specified __Unary_Function__ object.
+ ]
+ ]
+ [
+ [Descendant iteration]
+ [[reference__post_order_iterate_descendants]]
+ [
+ Iterates through the descendants of the specified node in
+ post-order fashion, passing each element dereferenced to
+ the specified __Unary_Function__ object.
+ ]
+ ]
+ [
+ [Equality]
+ [[reference__post_order_iterator__operator_equals]]
+ [Defined by the __Input_Iterator__ concept.]
+ ]
+ [
+ [Inequality]
+ [[reference__post_order_iterator__operator_not_equal]]
+ [Defined by the __Input_Iterator__ concept.]
+ ]
+]
+[endsect] [/ Non-members]
+
+[endsect] [/ post_order_iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/ref_pre_order_iterator.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_pre_order_iterator.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,224 @@
+[/=============================================================================
+ Copyright (C) 2011 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:pre_order_iterator `pre_order_iterator`]
+
+[section Synopsis]
+[reference__pre_order_iterator]
+[endsect]
+
+[section Description]
+This iterator traverses the specified root node and all its descendants in
+pre-order fashion, e.g. given the following tree representation:
+
+``
+ A
+ |
+ C---+---B
+ | |
++-+-+ +-+-+
+| | | |
+D E F G
+``
+
+If this iterator is a __Full_Tree_Node_Iterator__, then it will traverse the
+tree nodes in the following order:
+
+``
+A C D E B F G
+``
+
+If this iterator is a __Tree_Node_Descendant_Iterator__, then it will traverse
+the tree nodes in the following order:
+
+``
+C D E B F G
+``
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_pre_order_iterator_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`NodePointer`]
+ [The type of a pointer to a tree node.]
+ [
+ It must model the __Trivial_Iterator__ concept, and its value type
+ must model the __Tree_Node__ concept.
+ ]
+ []
+ ]
+ [
+ [`MimicsChildIterator`]
+ [
+ The type that determines whether this `pre_order_iterator` will
+ iterate only through the descendants of a node or will also include
+ the node in its traversal.
+ ]
+ [It must model the __Boolean_Integral_Constant__ concept.]
+ []
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+
+ * __Full_Tree_Node_Iterator__ if `MimicsChildIterator::value` is `false`
+ * __Tree_Node_Descendant_Iterator__ if `MimicsChildIterator::value` is `true`
+ * __Default_Constructible__
+ * __Copy_Constructible__
+ * __Assignable__
+
+[endsect]
+
+[section:public_bases Public Base Classes]
+None.
+[endsect]
+
+[section Members]
+[table
+ [[Name][Expression][Where defined]]
+ [
+ [Value type]
+ [`value_type`]
+ [__Tree_Node_Iterator__]
+ ]
+ [
+ [Reference type]
+ [`reference`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Pointer type]
+ [`pointer`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Distance type]
+ [`distance`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Iterator category]
+ [`iterator_category`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Default constructor]
+ [`pre_order_iterator();`]
+ [__Default_Constructible__]
+ ]
+ [
+ [Constructor from im/mutable node]
+ [`pre_order_iterator(NodePointer const&);`]
+ [__Tree_Node_Iterator__]
+ ]
+ [
+ [Conversion constructor]
+ [``
+ template <typename NP, typename MCI>
+ pre_order_iterator(pre_order_iterator<NP,MCI> const&);
+ ``]
+ [`pre_order_iterator`]
+ ]
+ [
+ [Copy constructor]
+ [`pre_order_iterator(pre_order_iterator const&);`]
+ [__Copy_Constructible__]
+ ]
+ [
+ [Assignment operator]
+ [`pre_order_iterator& operator=(pre_order_iterator const&);`]
+ [__Assignable__]
+ ]
+ [
+ [Dereference operator]
+ [`reference operator*() const;`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Indirection operator]
+ [`pointer operator->() const;`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Pre-increment operator]
+ [`pre_order_iterator& operator++();`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Post-increment operator]
+ [`pre_order_iterator operator++(int);`]
+ [__Forward_Iterator__]
+ ]
+ [
+ [Traversal state conversion operator]
+ [`operator _traversal_state_() const;`]
+ [__Tree_Node_Iterator__]
+ ]
+]
+[endsect] [/ Members]
+
+[section:non_members Non-members]
+[table
+ [[Name][Expression][Description]]
+ [
+ [Iterator creation]
+ [[reference__make_pre_order_iterator]]
+ [
+ Constructs and returns a `pre_order_iterator` that will iterate
+ through the specified node and its descendants.
+ ]
+ ]
+ [
+ [Descendant iterator creation]
+ [[reference__make_pre_order_descendant_iterator]]
+ [
+ Constructs and returns a `pre_order_iterator` that will iterate
+ through the descendants of the specified node.
+ ]
+ ]
+ [
+ [Iteration]
+ [[reference__pre_order_iterate]]
+ [
+ Iterates through the specified node and its descendants in
+ pre-order fashion, passing each node pointer dereferenced to
+ the specified __Unary_Function__ object.
+ ]
+ ]
+ [
+ [Descendant iteration]
+ [[reference__pre_order_iterate_descendants]]
+ [
+ Iterates through the descendants of the specified node in
+ pre-order fashion, passing each element dereferenced to
+ the specified __Unary_Function__ object.
+ ]
+ ]
+ [
+ [Equality]
+ [[reference__pre_order_iterator__operator_equals]]
+ [Defined by the __Input_Iterator__ concept.]
+ ]
+ [
+ [Inequality]
+ [[reference__pre_order_iterator__operator_not_equal]]
+ [Defined by the __Input_Iterator__ concept.]
+ ]
+]
+[endsect] [/ Non-members]
+
+[endsect] [/ pre_order_iterator]
+

Added: sandbox/tree_node/libs/tree_node/doc/ref_raw_associative_node.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_raw_associative_node.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,239 @@
+[/=============================================================================
+ Copyright (C) 2011 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:raw_associative_node `raw_associative_node`]
+
+[section Synopsis]
+[reference__raw_associative_node]
+[endsect]
+
+[section Description]
+This class template is suitable for classes or algorithms that need to map keys
+to child nodes in a tree node data structure that does not need to be exposed
+to external code. Objects of this type can be stored by value, and their
+children can be accessed by their associated keys for fast lookup.
+
+[important
+ This component depends on __Boost_Type_Traits_Operators__, which has been
+ recently accepted into Boost but is currently not part of an official
+ release. For now, you must perform a Subversion checkout from the
+ __SVN_Trac__.
+]
+
+[important
+ This component depends on __Boost_Utility_ContainerGen__, which is not yet
+ a part of Boost. For now, you must perform a Subversion checkout from the
+ __SVN_Trac__.
+]
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_raw_associative_node_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`Key`]
+ [
+ The type of a key object to be associated with a child of a
+ `raw_associative_node`.
+ ]
+ []
+ []
+ ]
+ [
+ [`Data`]
+ [The type of the object to be stored in a `raw_associative_node`.]
+ []
+ []
+ ]
+ [
+ [`AssociativeContainerSelector`]
+ [
+ The type that determines the internal map types whose mapped types
+ are the same as the pointer type.
+ ]
+ [
+ It must be a type for which __associative_container_gen__ returns
+ a valid container.
+ ]
+ [`mapS`]
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+
+ * __Associative_Tree_Node__
+ * __Default_Constructible__ if `Data` is __Default_Constructible__
+ * __Copy_Constructible__
+ * __Assignable__ if `Data` is __Assignable__
+
+[endsect]
+
+[section:public_bases Public Base Classes]
+None.
+[endsect]
+
+[section Members]
+[table
+ [[Name][Expression][Where defined]]
+ [
+ [Key type]
+ [`key_type`]
+ [__Tree_Node__]
+ ]
+ [
+ [Data type]
+ [`data_type`]
+ [__Tree_Node__]
+ ]
+ [
+ [Pointer type]
+ [`pointer`]
+ [__Tree_Node__]
+ ]
+ [
+ [Pointer-to-const type]
+ [`const_pointer`]
+ [__Tree_Node__]
+ ]
+ [
+ [Child iterator type]
+ [`child_iterator`]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Immutable child iterator type]
+ [`const_child_iterator`]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Default constructor]
+ [`raw_associative_node();`]
+ [__Default_Constructible__]
+ ]
+ [
+ [Constructor with data]
+ [`explicit raw_associative_node(data_type const&);`]
+ [`raw_associative_node`]
+ ]
+ [
+ [Copy constructor]
+ [`raw_associative_node(raw_associative_node const&);`]
+ [__Copy_Constructible__]
+ ]
+ [
+ [Assignment operator]
+ [`raw_associative_node& operator=(raw_associative_node const&);`]
+ [__Assignable__]
+ ]
+ [
+ [Data access]
+ [`data_type const& get_data() const;`]
+ [__Tree_Node__]
+ ]
+ [
+ [Data access]
+ [`data_type& get_data();`]
+ [__Tree_Node__]
+ ]
+ [
+ [Parent access]
+ [`const_pointer get_parent() const;`]
+ [__Tree_Node__]
+ ]
+ [
+ [Parent access]
+ [`pointer get_parent();`]
+ [__Tree_Node__]
+ ]
+ [
+ [Child creation with data]
+ [`pointer add_child(key_type const&, data_type const&);`]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Child creation]
+ [`pointer add_child(key_type const&);`]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Child copy creation]
+ [`pointer add_child(key_type const&, const_pointer const&);`]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Children range begin access]
+ [`const_child_iterator get_child_begin() const;`]
+ [__Tree_Node__]
+ ]
+ [
+ [Children range begin access]
+ [`child_iterator get_child_begin();`]
+ [__Tree_Node__]
+ ]
+ [
+ [Children range past-the-end access]
+ [`const_child_iterator get_child_end() const;`]
+ [__Tree_Node__]
+ ]
+ [
+ [Children range past-the-end access]
+ [`child_iterator get_child_end();`]
+ [__Tree_Node__]
+ ]
+ [
+ [Child search]
+ [`const_child_iterator find_child(key_type const&) const;`]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Child search]
+ [`child_iterator find_child(key_type const&);`]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Child search range]
+ [
+ [^_std_pair_<Node::const_child_iterator,Node::const_child_iterator>
+ find_children(key_type const&) const;]
+ ]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Child search range]
+ [
+ [^_std_pair_<Node::child_iterator,Node::child_iterator>
+ find_children(key_type const&);]
+ ]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Remove children]
+ [`std::size_t remove_children(key_type const&);`]
+ [__Associative_Tree_Node__]
+ ]
+ [
+ [Remove all children]
+ [`void remove_all_children();`]
+ [__Tree_Node__]
+ ]
+]
+[endsect] [/ Members]
+
+[section Example]
+<__example_raw_associative_node_cpp__>
+[endsect]
+
+[endsect] [/ raw_associative_node]
+

Added: sandbox/tree_node/libs/tree_node/doc/ref_raw_node.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_raw_node.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,169 @@
+[/=============================================================================
+ Copyright (C) 2011 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:raw_node `raw_node`]
+
+[section Synopsis]
+[reference__raw_node]
+[endsect]
+
+[section Description]
+This class template is suitable for classes or algorithms that require a tree
+node data structure but do not need to expose it to external code. Objects
+of this type can be stored by value, and their children can be accessed by
+offsetting the start of the range with a numerical index for fast lookup.
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_raw_node_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`T`]
+ [The type of the object to be stored in a `raw_node`.]
+ []
+ []
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+
+ * __Random_Access_Child_Iterator_Tree_Node__
+ * __Default_Constructible__ if `T` is __Default_Constructible__
+ * __Copy_Constructible__
+ * __Assignable__ if `T` is __Assignable__
+
+[endsect]
+
+[section:public_bases Public Base Classes]
+None.
+[endsect]
+
+[section Members]
+[table
+ [[Name][Expression][Where defined]]
+ [
+ [Data type]
+ [`data_type`]
+ [__Tree_Node__]
+ ]
+ [
+ [Pointer type]
+ [`pointer`]
+ [__Tree_Node__]
+ ]
+ [
+ [Pointer-to-const type]
+ [`const_pointer`]
+ [__Tree_Node__]
+ ]
+ [
+ [Child iterator type]
+ [`child_iterator`]
+ [__Random_Access_Child_Iterator_Tree_Node__]
+ ]
+ [
+ [Immutable child iterator type]
+ [`const_child_iterator`]
+ [__Random_Access_Child_Iterator_Tree_Node__]
+ ]
+ [
+ [Default constructor]
+ [`raw_node();`]
+ [__Default_Constructible__]
+ ]
+ [
+ [Constructor with data]
+ [`explicit raw_node(data_type const&);`]
+ [`raw_node`]
+ ]
+ [
+ [Copy constructor]
+ [`raw_node(raw_node const&);`]
+ [__Copy_Constructible__]
+ ]
+ [
+ [Assignment operator]
+ [`raw_node& operator=(raw_node const&);`]
+ [__Assignable__]
+ ]
+ [
+ [Data access]
+ [`data_type const& get_data() const;`]
+ [__Tree_Node__]
+ ]
+ [
+ [Data access]
+ [`data_type& get_data();`]
+ [__Tree_Node__]
+ ]
+ [
+ [Parent access]
+ [`const_pointer get_parent() const;`]
+ [__Tree_Node__]
+ ]
+ [
+ [Parent access]
+ [`pointer get_parent();`]
+ [__Tree_Node__]
+ ]
+ [
+ [Child creation with data]
+ [`pointer add_child(data_type const&);`]
+ [__Random_Access_Child_Iterator_Tree_Node__]
+ ]
+ [
+ [Child creation]
+ [`pointer add_child();`]
+ [__Random_Access_Child_Iterator_Tree_Node__]
+ ]
+ [
+ [Child copy creation]
+ [`pointer add_child(const_pointer const&);`]
+ [__Random_Access_Child_Iterator_Tree_Node__]
+ ]
+ [
+ [Children range begin access]
+ [`const_child_iterator get_child_begin() const;`]
+ [__Tree_Node__]
+ ]
+ [
+ [Children range begin access]
+ [`child_iterator get_child_begin();`]
+ [__Tree_Node__]
+ ]
+ [
+ [Children range past-the-end access]
+ [`const_child_iterator get_child_end() const;`]
+ [__Tree_Node__]
+ ]
+ [
+ [Children range past-the-end access]
+ [`child_iterator get_child_end();`]
+ [__Tree_Node__]
+ ]
+ [
+ [Remove all children]
+ [`void remove_all_children();`]
+ [__Tree_Node__]
+ ]
+]
+[endsect] [/ Members]
+
+[section Example]
+<__example_raw_node_cpp__>
+[endsect]
+
+[endsect] [/ raw_node]
+

Added: sandbox/tree_node/libs/tree_node/doc/ref_simple_associative_node.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_simple_associative_node.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,240 @@
+[/=============================================================================
+ Copyright (C) 2011 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:simple_associative_node `simple_associative_node`]
+
+[section Synopsis]
+[reference__simple_associative_node]
+[endsect]
+
+[section Description]
+This class template is suitable for classes or algorithms that need to map keys
+to child nodes in a tree node data structure that must be exposed to external
+code. Objects of this type must be stored by
+`simple_associative_node::pointer` and can only be instantiated through
+the `static` creation methods that this class template provides. Their
+children can be accessed by their associated keys for fast lookup.
+
+[important
+ This component depends on __Boost_Type_Traits_Operators__, which has been
+ recently accepted into Boost but is currently not part of an official
+ release. For now, you must perform a Subversion checkout from the
+ __SVN_Trac__.
+]
+
+[important
+ This component depends on __Boost_Utility_ContainerGen__, which is not yet
+ a part of Boost. For now, you must perform a Subversion checkout from the
+ __SVN_Trac__.
+]
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_simple_associative_node_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`Key`]
+ [
+ The type of a key object to be associated with a child of a
+ `raw_associative_node`.
+ ]
+ []
+ []
+ ]
+ [
+ [`Data`]
+ [The type of the object to be stored in a `simple_associative_node`.]
+ []
+ []
+ ]
+ [
+ [`AssociativeContainerSelector`]
+ [
+ The type that determines the internal map types whose mapped types
+ are the same as the pointer type.
+ ]
+ [
+ It must be a type for which __associative_container_gen__ returns
+ a valid container.
+ ]
+ [`mapS`]
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+__Associative_Tree_Node__
+[endsect]
+
+[section:public_bases Public Base Classes]
+__tr1_enable_shared_from_this__
+[endsect]
+
+[section Members]
+[table
+ [[Name][Expression][Description]]
+ [
+ [Data type]
+ [`data_type`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Data type]
+ [`data_type`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Pointer type]
+ [`pointer`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Pointer-to-const type]
+ [`const_pointer`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Child iterator type]
+ [`child_iterator`]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Immutable child iterator type]
+ [`const_child_iterator`]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Node creation with data]
+ [`static pointer create(data_type const&);`]
+ [
+ Creates a `simple_associative_node` object with the specified data
+ and returns a pointer to it.
+ ]
+ ]
+ [
+ [Node creation]
+ [`static pointer create();`]
+ [
+ Creates a `simple_associative_node` object and returns a pointer to
+ it.
+ ]
+ ]
+ [
+ [Node copy creation]
+ [`static pointer create_copy(const_pointer const&);`]
+ [
+ Creates a deep copy of the specified node. Returns a pointer to
+ the new node.
+ ]
+ ]
+ [
+ [Data access]
+ [`data_type const& get_data() const;`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Data access]
+ [`data_type& get_data();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Parent access]
+ [`const_pointer get_parent() const;`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Parent access]
+ [`pointer get_parent();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Child creation with data]
+ [`pointer add_child(key_type const&, data_type const&);`]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Child creation]
+ [`pointer add_child(key_type const&);`]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Child copy creation]
+ [`pointer add_child(key_type const&, const_pointer const&);`]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Children range begin access]
+ [`const_child_iterator get_child_begin() const;`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Children range begin access]
+ [`child_iterator get_child_begin();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Children range past-the-end access]
+ [`const_child_iterator get_child_end() const;`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Children range past-the-end access]
+ [`child_iterator get_child_end();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Child search]
+ [`const_child_iterator find_child(key_type const&) const;`]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Child search]
+ [`child_iterator find_child(key_type const&);`]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Child search range]
+ [
+ [^_std_pair_<Node::const_child_iterator,Node::const_child_iterator>
+ find_children(key_type const&) const;]
+ ]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Child search range]
+ [
+ [^_std_pair_<Node::child_iterator,Node::child_iterator>
+ find_children(key_type const&);]
+ ]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Remove children]
+ [`std::size_t remove_children(key_type const&);`]
+ [Defined by the __Associative_Tree_Node__ concept.]
+ ]
+ [
+ [Remove all children]
+ [`void remove_all_children();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+]
+[endsect] [/ Members]
+
+[section Example]
+<__example_simple_associative_node_cpp__>
+[endsect]
+
+[endsect] [/ simple_associative_node]
+

Added: sandbox/tree_node/libs/tree_node/doc/ref_simple_node.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_simple_node.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,167 @@
+[/=============================================================================
+ Copyright (C) 2011 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:simple_node `simple_node`]
+
+[section Synopsis]
+[reference__simple_node]
+[endsect]
+
+[section Description]
+This class template is suitable for classes or algorithms that require a tree
+node data structure that must be exposed to external code. Objects of this
+type must be stored by `simple_node::pointer` and can only be instantiated
+through the `static` creation methods that this class template provides. Their
+children can be accessed by offsetting the start of the range with a numerical
+index for fast lookup.
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_simple_node_hpp__>
+``
+[endsect]
+
+[section:tpl_param Template Parameters]
+[table
+ [[Parameter][Description][Requirements][Default]]
+ [
+ [`T`]
+ [The type of the object to be stored in a `simple_node`.]
+ []
+ []
+ ]
+]
+[endsect]
+
+[section:model_of Model of]
+__Random_Access_Child_Iterator_Tree_Node__
+[endsect]
+
+[section:public_bases Public Base Classes]
+__tr1_enable_shared_from_this__
+[endsect]
+
+[section Members]
+[table
+ [[Name][Expression][Description]]
+ [
+ [Data type]
+ [`data_type`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Pointer type]
+ [`pointer`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Pointer-to-const type]
+ [`const_pointer`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Child iterator type]
+ [`child_iterator`]
+ [Defined by the __Random_Access_Child_Iterator_Tree_Node__ concept.]
+ ]
+ [
+ [Immutable child iterator type]
+ [`const_child_iterator`]
+ [Defined by the __Random_Access_Child_Iterator_Tree_Node__ concept.]
+ ]
+ [
+ [Node creation with data]
+ [`static pointer create(data_type const&);`]
+ [
+ Creates a `simple_node` object with the specified data and returns
+ a pointer to it.
+ ]
+ ]
+ [
+ [Node creation]
+ [`static pointer create();`]
+ [Creates a `simple_node` object and returns a pointer to it.]
+ ]
+ [
+ [Node copy creation]
+ [`static pointer create_copy(const_pointer const&);`]
+ [
+ Creates a deep copy of the specified node. Returns a pointer to
+ the new node.
+ ]
+ ]
+ [
+ [Data access]
+ [`data_type const& get_data() const;`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Data access]
+ [`data_type& get_data();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Parent access]
+ [`const_pointer get_parent() const;`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Parent access]
+ [`pointer get_parent();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Child creation with data]
+ [`pointer add_child(data_type const&);`]
+ [Defined by the __Random_Access_Child_Iterator_Tree_Node__ concept.]
+ ]
+ [
+ [Child creation]
+ [`pointer add_child();`]
+ [Defined by the __Random_Access_Child_Iterator_Tree_Node__ concept.]
+ ]
+ [
+ [Child copy creation]
+ [`pointer add_child(const_pointer const&);`]
+ [Defined by the __Random_Access_Child_Iterator_Tree_Node__ concept.]
+ ]
+ [
+ [Children range begin access]
+ [`const_child_iterator get_child_begin() const;`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Children range begin access]
+ [`child_iterator get_child_begin();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Children range past-the-end access]
+ [`const_child_iterator get_child_end() const;`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Children range past-the-end access]
+ [`child_iterator get_child_end();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+ [
+ [Remove all children]
+ [`void remove_all_children();`]
+ [Defined by the __Tree_Node__ concept.]
+ ]
+]
+[endsect] [/ Members]
+
+[section Example]
+<__example_simple_node_cpp__>
+[endsect]
+
+[endsect] [/ simple_node]
+

Added: sandbox/tree_node/libs/tree_node/doc/ref_traversal_state.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/ref_traversal_state.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,33 @@
+[/=============================================================================
+ Copyright (C) 2011 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:traversal_state `traversal_state`]
+
+[section Synopsis]
+[reference__traversal_state]
+[endsect]
+
+[section Description]
+This enumeration type is the return type of the dereferenceability expression
+defined by each iterator type that this library provides. The `no_traversal`
+value corresponds to `false` in a boolean context, enabling the iterator types
+to fulfill their runtime requirements for dereferenceability. The
+`pre_order_traversal` and `post_order_traversal` values are significant because
+the __depth_first_iterator__ traverses each node twice, so algorithms must be
+able to distinguish which state the iterator is in when it traverses a tree
+node. The `breadth_first_traversal` value is defined for completeness.
+[endsect]
+
+[section:definition Where defined]
+``
+#include <__boost_tree_node_traversal_state_hpp__>
+``
+[endsect]
+
+[endsect] [/ traversal_state]
+

Added: sandbox/tree_node/libs/tree_node/doc/reference.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/reference.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,32 @@
+[/=============================================================================
+ Copyright (C) 2011 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 Reference]
+
+[include ref_raw_node.qbk]
+[include ref_simple_node.qbk]
+[include ref_raw_associative_node.qbk]
+[include ref_simple_associative_node.qbk]
+[include ref_breadth_first_iterator.qbk]
+[include ref_pre_order_iterator.qbk]
+[include ref_post_order_iterator.qbk]
+[include ref_depth_first_iterator.qbk]
+[include ref_traversal_state.qbk]
+
+ * __raw_node__
+ * __simple_node__
+ * __raw_associative_node__
+ * __simple_associative_node__
+ * __breadth_first_iterator__
+ * __pre_order_iterator__
+ * __post_order_iterator__
+ * __depth_first_iterator__
+ * __traversal_state__
+
+[endsect] [/ Reference]
+

Added: sandbox/tree_node/libs/tree_node/doc/tree_node.qbk
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/doc/tree_node.qbk 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,147 @@
+[library tree_node
+ [quickbook 1.5]
+ [version 0.1]
+ [authors [Enage, Cromwell D.]]
+ [copyright 2011 Cromwell D. Enage]
+ [purpose Low-level tree node framework]
+ [license
+ 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])
+ ]
+]
+
+[/ General links.]
+[def __Runtime_Complexity__ [@http://en.wikipedia.org/wiki/Amortized_analysis Runtime Complexity]]
+
+[/ General concept links.]
+[def __Default_Constructible__ [@http://www.sgi.com/tech/stl/DefaultConstructible.html [*Default Constructible]]]
+[def __Trivial_Iterator__ [@http://www.sgi.com/tech/stl/trivial.html [*Trivial Iterator]]]
+[def __Input_Iterator__ [@http://www.sgi.com/tech/stl/InputIterator.html [*Input Iterator]]]
+[def __Forward_Iterator__ [@http://www.sgi.com/tech/stl/ForwardIterator.html [*Forward Iterator]]]
+[def __Random_Access_Iterator__ [@http://www.sgi.com/tech/stl/RandomAccessIterator.html [*Random Access Iterator]]]
+[def __Container__ [@http://www.sgi.com/tech/stl/Container.html [*Container]]]
+[def __Unary_Function__ [@http://www.sgi.com/tech/stl/UnaryFunction.html [*Unary Function]]]
+
+[/ STL reference links.]
+[def __std_pair__ [@http://www.sgi.com/tech/stl/pair.html `std::pair`]]
+[def _std_pair_ [@http://www.sgi.com/tech/stl/pair.html std::pair]]
+
+[/ Boost library and installation links.]
+[def __Build__ [@boost:more/getting_started.html Build]]
+[def __build__ [@boost:more/getting_started.html build]]
+[def __Boost_Test__ [@boost:libs/test/doc/index.html [*Boost.Test]]]
+[def __SVN_Trac__ [@http://svn.boost.org/ SVN Trac]]
+[def __Boost_Type_Traits_Operators__ [@http://svn.boost.org/svn/boost/sandbox/type_traits/libs/type_traits/doc/html/index.html [*Boost.TypeTraitsOperators]]]
+[def __Boost_Utility_ContainerGen__ [@http://svn.boost.org/svn/boost/sandbox/utility-container_gen/libs/utility/container_gen/doc/html/index.html [*Boost.Utility.ContainerGen]]]
+
+[/ Boost concept links.]
+[def __Copy_Constructible__ [@boost:libs/utility/CopyConstructible.html [*Copy Constructible]]]
+[def __Assignable__ [@boost:libs/utility/Assignable.html [*Assignable]]]
+[def __Boolean_Integral_Constant__ [@boost:libs/mpl/doc/refmanual/integral-constant.html [*Boolean Integral Constant]]]
+
+[/ Boost reference links in text.]
+
+[/ Boost reference links in code.]
+[def __tr1_enable_shared_from_this__ [@boost:libs/smart_ptr/enable_shared_from_this.html `std::tr1::enable_shared_from_this`]]
+[def __mpl_true__ [@boost:libs/mpl/doc/refmanual/bool.html `boost::mpl::true_`]]
+[def _mpl_true_ [@boost:libs/mpl/doc/refmanual/bool.html boost::mpl::true_]]
+[def __mpl_false__ [@boost:libs/mpl/doc/refmanual/bool.html `boost::mpl::false_`]]
+[def _mpl_false_ [@boost:libs/mpl/doc/refmanual/bool.html boost::mpl::false_]]
+[def _mpl_equal_to_ [@boost:libs/mpl/doc/refmanual/equal_to.html boost::mpl::equal_to]]
+[def _enable_if_ [@boost:libs/utility/enable_if.html `enable_if`]]
+[def __associative_container_gen__ [@http://svn.boost.org/svn/boost/sandbox/utility-container_gen/libs/utility/container_gen/doc/html/container_gen/reference/associative_container_gen.html `associative_container_gen`]]
+
+[/ Boost.TreeNode tutorial source file links.]
+[def __example_raw_node_cpp__ [@../../example/raw_node.cpp example/raw_node.cpp]]
+[def __example_simple_node_cpp__ [@../../example/simple_node.cpp example/simple_node.cpp]]
+[def __example_raw_associative_node_cpp__ [@../../example/raw_associative_node.cpp example/raw_associative_node.cpp]]
+[def __example_simple_associative_node_cpp__ [@../../example/simple_associative_node.cpp example/simple_associative_node.cpp]]
+
+[/ Boost.TreeNode reference header file links.]
+[def __boost_tree_node_raw_node_hpp__ [@../../../../boost/tree_node/raw_node.hpp boost/tree_node/raw_node.hpp]]
+[def __boost_tree_node_simple_node_hpp__ [@../../../../boost/tree_node/simple_node.hpp boost/tree_node/simple_node.hpp]]
+[def __boost_tree_node_raw_associative_node_hpp__ [@../../../../boost/tree_node/raw_associative_node.hpp boost/tree_node/raw_associative_node.hpp]]
+[def __boost_tree_node_simple_associative_node_hpp__ [@../../../../boost/tree_node/simple_associative_node.hpp boost/tree_node/simple_associative_node.hpp]]
+[def __boost_tree_node_breadth_first_iterator_hpp__ [@../../../../boost/tree_node/breadth_first_iterator.hpp boost/tree_node/breadth_first_iterator.hpp]]
+[def __boost_tree_node_pre_order_iterator_hpp__ [@../../../../boost/tree_node/pre_order_iterator.hpp boost/tree_node/pre_order_iterator.hpp]]
+[def __boost_tree_node_post_order_iterator_hpp__ [@../../../../boost/tree_node/post_order_iterator.hpp boost/tree_node/post_order_iterator.hpp]]
+[def __boost_tree_node_depth_first_iterator_hpp__ [@../../../../boost/tree_node/depth_first_iterator.hpp boost/tree_node/depth_first_iterator.hpp]]
+[def __boost_tree_node_traversal_state_hpp__ [@../../../../boost/tree_node/traversal_state.hpp boost/tree_node/traversal_state.hpp]]
+[def __example_raw_node_cpp__ [@../../example/raw_node.cpp example/raw_node.cpp]]
+[def __example_simple_node_cpp__ [@../../example/simple_node.cpp example/simple_node.cpp]]
+[def __example_raw_associative_node_cpp__ [@../../example/raw_associative_node.cpp example/raw_associative_node.cpp]]
+[def __example_simple_associative_node_cpp__ [@../../example/simple_associative_node.cpp example/simple_associative_node.cpp]]
+
+[/ Boost.TreeNode concept links.]
+[def __Tree_Node__ [link tree_node.concepts.tree_node [*Tree Node]]]
+[def __Random_Access_Child_Iterator_Tree_Node__ [link tree_node.concepts.raci_tree_node [*Random Access Child Iterator Tree Node]]]
+[def __Associative_Tree_Node__ [link tree_node.concepts.associative_tree_node [*Associative Tree Node]]]
+[def __Tree_Node_Iterator__ [link tree_node.concepts.tree_node_iterator [*Tree Node Iterator]]]
+[def __Full_Tree_Node_Iterator__ [link tree_node.concepts.full_tree_node_iterator [*Full Tree Node Iterator]]]
+[def __Tree_Node_Descendant_Iterator__ [link tree_node.concepts.tree_node_desc_iterator [*Tree Node Descendant Iterator]]]
+
+[/ Boost.TreeNode reference links.]
+[def __raw_node__ [link tree_node.reference.raw_node `raw_node`]]
+[def _raw_node_ [link tree_node.reference.raw_node raw_node]]
+[def __simple_node__ [link tree_node.reference.simple_node `simple_node`]]
+[def _simple_node_ [link tree_node.reference.simple_node simple_node]]
+[def __raw_associative_node__ [link tree_node.reference.raw_associative_node `raw_associative_node`]]
+[def _raw_associative_node_ [link tree_node.reference.raw_associative_node raw_associative_node]]
+[def __simple_associative_node__ [link tree_node.reference.simple_associative_node `simple_associative_node`]]
+[def _simple_associative_node_ [link tree_node.reference.simple_associative_node simple_associative_node]]
+[def __breadth_first_iterator__ [link tree_node.reference.breadth_first_iterator `breadth_first_iterator`]]
+[def __make_breadth_first_iterator__ [link tree_node.reference.breadth_first_iterator `make_breadth_first_iterator()`]]
+[def __make_breadth_first_descendant_iterator__ [link tree_node.reference.breadth_first_iterator `make_breadth_first_descendant_iterator()`]]
+[def _breadth_first_iterator_ [link tree_node.reference.breadth_first_iterator breadth_first_iterator]]
+[def __pre_order_iterator__ [link tree_node.reference.pre_order_iterator `pre_order_iterator`]]
+[def __make_pre_order_iterator__ [link tree_node.reference.pre_order_iterator `make_pre_order_iterator()`]]
+[def __make_pre_order_descendant_iterator__ [link tree_node.reference.pre_order_iterator `make_pre_order_descendant_iterator()`]]
+[def _pre_order_iterator_ [link tree_node.reference.pre_order_iterator pre_order_iterator]]
+[def __post_order_iterator__ [link tree_node.reference.post_order_iterator `post_order_iterator`]]
+[def __make_post_order_iterator__ [link tree_node.reference.post_order_iterator `make_post_order_iterator()`]]
+[def __make_post_order_descendant_iterator__ [link tree_node.reference.post_order_iterator `make_post_order_descendant_iterator()`]]
+[def _post_order_iterator_ [link tree_node.reference.post_order_iterator post_order_iterator]]
+[def __depth_first_iterator__ [link tree_node.reference.depth_first_iterator `depth_first_iterator`]]
+[def __make_depth_first_iterator__ [link tree_node.reference.depth_first_iterator `make_depth_first_iterator()`]]
+[def __make_depth_first_descendant_iterator__ [link tree_node.reference.depth_first_iterator `make_depth_first_descendant_iterator()`]]
+[def _depth_first_iterator_ [link tree_node.reference.depth_first_iterator depth_first_iterator]]
+[def __traversal_state__ [link tree_node.reference.traversal_state `traversal_state`]]
+[def _traversal_state_ [link tree_node.reference.traversal_state traversal_state]]
+
+[/ Autogenerate concept and reference documentation directly from code.]
+[/ Bypass Doxygen.]
+[import ../../../boost/tree_node/raw_node.hpp]
+[import ../../../boost/tree_node/simple_node.hpp]
+[import ../../../boost/tree_node/raw_associative_node.hpp]
+[import ../../../boost/tree_node/simple_associative_node.hpp]
+[import ../../../boost/tree_node/breadth_first_iterator.hpp]
+[import ../../../boost/tree_node/pre_order_iterator.hpp]
+[import ../../../boost/tree_node/post_order_iterator.hpp]
+[import ../../../boost/tree_node/depth_first_iterator.hpp]
+[import ../../../boost/tree_node/traversal_state.hpp]
+[import ../example/default_unconstructible_type.hpp] [/ example__default_unconstructible_type]
+[import ../example/default_unconstructible_type.cpp] [/ example__default_unconstructible_type__definitions]
+[import ../example/raw_node.cpp]
+[import ../example/simple_node.cpp]
+[import ../example/raw_associative_node.cpp]
+[import ../example/simple_associative_node.cpp]
+
+[/ index.html Start]
+
+[heading Rationale]
+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.
+
+[/ index.html End]
+
+[include concepts.qbk]
+[include reference.qbk]
+

Added: sandbox/tree_node/libs/tree_node/example/default_unconstructible_type.cpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/default_unconstructible_type.cpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,20 @@
+// Copyright (C) 2011 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)
+
+#include "default_unconstructible_type.hpp"
+
+//[example__default_unconstructible_type__definitions
+default_unconstructible_example_type::default_unconstructible_example_type()
+{
+}
+
+default_unconstructible_example_type create_instance(std::size_t n)
+{
+ default_unconstructible_example_type instance;
+ instance.number = n;
+ return instance;
+}
+//]
+

Added: sandbox/tree_node/libs/tree_node/example/default_unconstructible_type.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/default_unconstructible_type.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,27 @@
+// Copyright (C) 2011 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)
+
+#ifndef LIBS_TREE_NODE_EXAMPLE_DEFAULT_UNCONSTRUCTIBLE_TYPE_HPP_INCLUDED
+#define LIBS_TREE_NODE_EXAMPLE_DEFAULT_UNCONSTRUCTIBLE_TYPE_HPP_INCLUDED
+
+#include <vector>
+
+//[example__default_unconstructible_type
+class default_unconstructible_example_type
+{
+ default_unconstructible_example_type();
+
+ friend default_unconstructible_example_type
+ create_instance(std::size_t n);
+
+ public:
+ std::size_t number;
+};
+//]
+
+default_unconstructible_example_type create_instance(std::size_t n);
+
+#endif // LIBS_TREE_NODE_EXAMPLE_DEFAULT_UNCONSTRUCTIBLE_TYPE_HPP_INCLUDED
+

Added: sandbox/tree_node/libs/tree_node/example/raw_associative_node.cpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/raw_associative_node.cpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,234 @@
+// Copyright (C) 2011 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)
+
+#include <iostream>
+#include <boost/assert.hpp>
+#include <boost/tr1/tuple.hpp>
+#include <boost/tree_node/typeof.hpp>
+#include "default_unconstructible_type.hpp"
+#include "show_functions.hpp"
+#include "showcase_descendant_iterators.hpp"
+
+typedef boost::tree_node::raw_associative_node<
+ char const*
+ , default_unconstructible_example_type
+ , boost::multimapS
+ >
+ DNode;
+typedef boost::tree_node::raw_associative_node<
+ char const*
+ , char*
+ , boost::hash_multimapS
+ >
+ ANode;
+
+int main()
+{
+ char const* names[] = {"able", "baker", "charlie", "dog", "easy", "fox"};
+ DNode d_root(create_instance(5));
+ ANode a_root;
+
+ BOOST_ASSERT(
+ !d_root.get_parent()
+ && "Parent member uninitialized."
+ );
+ BOOST_ASSERT(
+ !a_root.get_data()
+ && "Data member not default-constructed."
+ );
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_breadth_first_iterator(&d_root)
+ );
+ itr;
+ ++itr
+ )
+ {
+ std::size_t const count = (*itr)->get_data().number;
+
+ if (1 < count)
+ {
+ for (std::size_t i = 0; i < count; ++i)
+ {
+ for (std::size_t j = 0; j + i < count; ++j)
+ {
+ DNode::pointer child(
+ (*itr)->add_child(names[j], create_instance(i))
+ );
+ DNode::const_pointer const_child(child);
+
+ BOOST_ASSERT(
+ (child->get_parent() == *itr)
+ && "Ctor not linking child to parent."
+ );
+ BOOST_ASSERT(
+ (child->get_parent() == const_child->get_parent())
+ && "Why are these pointers different?"
+ );
+ }
+ }
+ }
+ }
+
+ {
+ boost::tree_node::depth_first_iterate(&d_root, show_number_tree());
+ std::cout << std::endl;
+ }
+
+ std::cout << "After d_root tree construction," << std::endl;
+ showcase_descendant_iterators(
+ DNode::const_pointer(&d_root)
+ , show_key_and_number<char const*,DNode::const_pointer>
+ , show_key_and_number_tree()
+ );
+
+ {
+ DNode::pointer d_child = d_root.find_child(
+ names[2]
+ )->second->add_child_copy(names[5], &d_root);
+
+ std::cout << "After add_child_copy call," << std::endl;
+ showcase_descendant_iterators(
+ DNode::const_pointer(&d_root)
+ , show_key_and_number<char const*,DNode::const_pointer>
+ , show_key_and_number_tree()
+ );
+
+ d_root = *d_child;
+ std::cout << "After assignment to descendant," << std::endl;
+ showcase_descendant_iterators(
+ DNode::const_pointer(&d_root)
+ , show_key_and_number<char const*,DNode::const_pointer>
+ , show_key_and_number_tree()
+ );
+ }
+
+ *(d_root.find_child(names[4])->second) = d_root;
+ std::cout << "After assignment to ancestor," << std::endl;
+ showcase_descendant_iterators(
+ DNode::const_pointer(&d_root)
+ , show_key_and_number<char const*,DNode::const_pointer>
+ , show_key_and_number_tree()
+ );
+
+ {
+ char* root_data = new char[2];
+
+ root_data[0] = '5';
+ root_data[1] = '\0';
+ a_root.get_data() = root_data;
+ }
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_breadth_first_iterator(&a_root)
+ );
+ itr;
+ ++itr
+ )
+ {
+ char digit = (*itr)->get_data()[0];
+
+ if ('1' < digit)
+ {
+ char numchar = digit;
+
+ while (numchar != '0')
+ {
+ --numchar;
+
+ for (char j = 0; numchar + j < digit; ++j)
+ {
+ ANode::pointer child((*itr)->add_child(names[j]));
+ char*& data = child->get_data();
+
+ BOOST_ASSERT(
+ !data
+ && "Data member not default-constructed."
+ );
+ data = new char[2];
+ data[0] = numchar;
+ data[1] = '\0';
+ BOOST_ASSERT(
+ (child->get_parent() == *itr)
+ && "Ctor not linking child to parent."
+ );
+ }
+ }
+ }
+ }
+
+ std::cout << "After a_root tree construction," << std::endl;
+ showcase_descendant_iterators(
+ ANode::const_pointer(&a_root)
+ , show_key_and_data<char const*,ANode::const_pointer>
+ , show_key_and_data_tree()
+ );
+
+ {
+ ANode::pointer a_child(
+ a_root.find_child(names[2])->second->add_child(names[5])
+ );
+
+ a_child->get_data() = new char[2];
+ a_child->get_data()[0] = '7';
+ a_child->get_data()[1] = '\0';
+ std::cout << "After a_child construction," << std::endl;
+ showcase_descendant_iterators(
+ ANode::const_pointer(&a_root)
+ , show_key_and_data<char const*,ANode::const_pointer>
+ , show_key_and_data_tree()
+ );
+ }
+
+ {
+ ANode::pointer to_be_pruned = a_root.get_child_begin()->second;
+ ANode::child_iterator c_itr, c_end;
+
+ for (
+ std::tr1::tie(c_itr, c_end) = to_be_pruned->find_children(
+ names[1]
+ );
+ c_itr != c_end;
+ ++c_itr
+ )
+ {
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_pre_order_iterator(c_itr->second)
+ );
+ itr;
+ ++itr
+ )
+ {
+ delete[] (*itr)->get_data();
+ }
+ }
+
+ to_be_pruned->remove_children(names[1]);
+ std::cout << "After remove_children call," << std::endl;
+ showcase_descendant_iterators(
+ ANode::const_pointer(&a_root)
+ , show_key_and_data<char const*,ANode::const_pointer>
+ , show_key_and_data_tree()
+ );
+ }
+
+ for (
+ BOOST_AUTO(itr, boost::tree_node::make_post_order_iterator(&a_root));
+ itr;
+ ++itr
+ )
+ {
+ delete[] (*itr)->get_data();
+ }
+
+ return 0;
+}
+

Added: sandbox/tree_node/libs/tree_node/example/raw_node.cpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/raw_node.cpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,206 @@
+// Copyright (C) 2011 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)
+
+#include <iostream>
+#include <boost/assert.hpp>
+#include <boost/tree_node/typeof.hpp>
+#include "default_unconstructible_type.hpp"
+#include "show_functions.hpp"
+#include "showcase_iterators.hpp"
+
+typedef boost::tree_node::raw_node<default_unconstructible_example_type> DNode;
+typedef boost::tree_node::raw_node<char*> ANode;
+
+int main()
+{
+ DNode d_root(create_instance(5));
+ ANode a_root;
+
+ BOOST_ASSERT(
+ !d_root.get_parent()
+ && "Parent member uninitialized."
+ );
+ BOOST_ASSERT(
+ !a_root.get_data()
+ && "Data member not default-constructed."
+ );
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_breadth_first_iterator(&d_root)
+ );
+ itr;
+ ++itr
+ )
+ {
+ std::size_t const count = (*itr)->get_data().number;
+
+ if (1 < count)
+ {
+ for (std::size_t i = 0; i < count; ++i)
+ {
+ DNode::pointer child((*itr)->add_child(create_instance(i)));
+ DNode::const_pointer const_child(child);
+
+ BOOST_ASSERT(
+ (child->get_parent() == *itr)
+ && "Ctor not linking child to parent."
+ );
+ BOOST_ASSERT(
+ (child == *((*itr)->get_child_begin() + i))
+ && "Ctor not linking parent to child."
+ );
+ BOOST_ASSERT(
+ (child->get_parent() == const_child->get_parent())
+ && "Why are these pointers different?"
+ );
+ }
+ }
+ }
+
+ std::cout << "After d_root tree construction," << std::endl;
+ showcase_iterators(
+ DNode::const_pointer(&d_root)
+ , show_number<DNode::const_pointer>
+ , show_number_tree()
+ );
+
+ {
+ DNode::pointer d_child = (
+ *(d_root.get_child_begin() + 2)
+ )->add_child_copy(&d_root);
+
+ std::cout << "After add_child_copy call," << std::endl;
+ showcase_iterators(
+ DNode::const_pointer(&d_root)
+ , show_number<DNode::const_pointer>
+ , show_number_tree()
+ );
+
+ d_root = *d_child;
+ std::cout << "After assignment to descendant," << std::endl;
+ showcase_iterators(
+ DNode::const_pointer(&d_root)
+ , show_number<DNode::const_pointer>
+ , show_number_tree()
+ );
+ }
+
+ *(*(d_root.get_child_begin() + 4)) = d_root;
+ std::cout << "After assignment to ancestor," << std::endl;
+ showcase_iterators(
+ DNode::const_pointer(&d_root)
+ , show_number<DNode::const_pointer>
+ , show_number_tree()
+ );
+
+ char* root_data = new char[2];
+
+ root_data[0] = '5';
+ root_data[1] = '\0';
+ a_root.get_data() = root_data;
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_breadth_first_iterator(&a_root)
+ );
+ itr;
+ ++itr
+ )
+ {
+ char digit = (*itr)->get_data()[0];
+
+ if ('1' < digit)
+ {
+ char numchar = digit;
+
+ while (numchar != '0')
+ {
+ ANode::pointer child((*itr)->add_child());
+ char*& data = child->get_data();
+
+ BOOST_ASSERT(
+ !data
+ && "Data member not default-constructed."
+ );
+ data = new char[2];
+ data[0] = --numchar;
+ data[1] = '\0';
+ BOOST_ASSERT(
+ (child->get_parent() == *itr)
+ && "Ctor not linking child to parent."
+ );
+ BOOST_ASSERT(
+ (
+ child
+ == *((*itr)->get_child_begin() + (digit - (numchar + 1)))
+ )
+ && "Ctor not linking parent to child."
+ );
+ }
+ }
+ }
+
+ std::cout << "After a_root tree construction," << std::endl;
+ showcase_iterators(
+ ANode::const_pointer(&a_root)
+ , show_data<ANode::const_pointer>
+ , show_data_tree()
+ );
+
+ {
+ ANode::pointer a_child(
+ (*(a_root.get_child_begin() + 2))->add_child()
+ );
+
+ a_child->get_data() = new char[2];
+ a_child->get_data()[0] = '7';
+ a_child->get_data()[1] = '\0';
+ std::cout << "After a_child construction," << std::endl;
+ showcase_iterators(
+ ANode::const_pointer(&a_root)
+ , show_data<ANode::const_pointer>
+ , show_data_tree()
+ );
+ }
+
+ {
+ ANode::pointer leaf = *a_root.get_child_begin();
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_pre_order_descendant_iterator(leaf)
+ );
+ itr;
+ ++itr
+ )
+ {
+ delete[] (*itr)->get_data();
+ }
+
+ leaf->remove_all_children();
+ std::cout << "After remove_all_children call," << std::endl;
+ showcase_iterators(
+ ANode::const_pointer(&a_root)
+ , show_data<ANode::const_pointer>
+ , show_data_tree()
+ );
+ }
+
+ for (
+ BOOST_AUTO(itr, boost::tree_node::make_post_order_iterator(&a_root));
+ itr;
+ ++itr
+ )
+ {
+ delete[] (*itr)->get_data();
+ }
+
+ return 0;
+}
+

Added: sandbox/tree_node/libs/tree_node/example/show_functions.cpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/show_functions.cpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,60 @@
+// Copyright (C) 2011 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)
+
+#include "show_functions.hpp"
+
+//[example__show_tabs
+void
+ show_tabs(
+ boost::tree_node::traversal_state state
+ , unsigned int& depth_limit
+ )
+{
+ switch (state)
+ {
+ case boost::tree_node::pre_order_traversal:
+ {
+ ++depth_limit;
+
+ for (unsigned int depth = 0; depth < depth_limit; ++depth)
+ {
+ std::cout << " ";
+ }
+
+ std::cout << "Pre-order: ";
+ break;
+ }
+
+ case boost::tree_node::post_order_traversal:
+ {
+ for (unsigned int depth = 0; depth < depth_limit; ++depth)
+ {
+ std::cout << " ";
+ }
+
+ std::cout << "Post-order: ";
+ --depth_limit;
+ break;
+ }
+ }
+}
+//]
+
+show_number_tree::show_number_tree() : depth_limit(1)
+{
+}
+
+show_key_and_number_tree::show_key_and_number_tree() : depth_limit(1)
+{
+}
+
+show_data_tree::show_data_tree() : depth_limit(1)
+{
+}
+
+show_key_and_data_tree::show_key_and_data_tree() : depth_limit(1)
+{
+}
+

Added: sandbox/tree_node/libs/tree_node/example/show_functions.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/show_functions.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,137 @@
+// Copyright (C) 2011 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)
+
+#ifndef LIBS_TREE_NODE_EXAMPLE_SHOW_FUNCTIONS_HPP_INCLUDED
+#define LIBS_TREE_NODE_EXAMPLE_SHOW_FUNCTIONS_HPP_INCLUDED
+
+#include <iostream>
+#include <boost/tree_node/traversal_state.hpp>
+
+void
+ show_tabs(
+ boost::tree_node::traversal_state state
+ , unsigned int& depth_limit
+ );
+
+//[example__show_number
+template <typename NodePointer>
+void show_number(NodePointer const& node)
+{
+ std::cout << ' ' << node->get_data().number;
+}
+//]
+
+//[example__show_number_tree
+class show_number_tree
+{
+ unsigned int depth_limit;
+
+ public:
+ show_number_tree();
+
+ template <typename NodePointer>
+ void
+ operator()(
+ NodePointer const& node
+ , boost::tree_node::traversal_state state
+ )
+ {
+ show_tabs(state, depth_limit);
+ std::cout << node->get_data().number << std::endl;
+ }
+};
+//]
+
+//[example__show_key_and_number
+template <typename Key, typename NodePointer>
+void show_key_and_number(Key const& key, NodePointer const& node)
+{
+ std::cout << " [" << key << ", " << node->get_data().number << ']';
+}
+//]
+
+//[example__show_key_and_number_tree
+class show_key_and_number_tree
+{
+ unsigned int depth_limit;
+
+ public:
+ show_key_and_number_tree();
+
+ template <typename Iterator>
+ void
+ operator()(
+ Iterator const& itr
+ , boost::tree_node::traversal_state state
+ )
+ {
+ show_tabs(state, depth_limit);
+ show_key_and_number(itr->first, itr->second);
+ std::cout << std::endl;
+ }
+};
+//]
+
+//[example__show_data
+template <typename NodePointer>
+void show_data(NodePointer const& node)
+{
+ std::cout << ' ' << node->get_data();
+}
+//]
+
+//[example__show_data_tree
+class show_data_tree
+{
+ unsigned int depth_limit;
+
+ public:
+ show_data_tree();
+
+ template <typename NodePointer>
+ void
+ operator()(
+ NodePointer const& node
+ , boost::tree_node::traversal_state state
+ )
+ {
+ show_tabs(state, depth_limit);
+ std::cout << node->get_data() << std::endl;
+ }
+};
+//]
+
+//[example__show_key_and_data
+template <typename Key, typename NodePointer>
+void show_key_and_data(Key const& key, NodePointer const& node)
+{
+ std::cout << " [" << key << ", " << node->get_data() << ']';
+}
+//]
+
+//[example__show_key_and_data_tree
+class show_key_and_data_tree
+{
+ unsigned int depth_limit;
+
+ public:
+ show_key_and_data_tree();
+
+ template <typename Iterator>
+ void
+ operator()(
+ Iterator const& itr
+ , boost::tree_node::traversal_state state
+ )
+ {
+ show_tabs(state, depth_limit);
+ show_key_and_data(itr->first, itr->second);
+ std::cout << std::endl;
+ }
+};
+//]
+
+#endif // LIBS_TREE_NODE_EXAMPLE_SHOW_FUNCTIONS_HPP_INCLUDED
+

Added: sandbox/tree_node/libs/tree_node/example/showcase_descendant_iterators.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/showcase_descendant_iterators.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,82 @@
+// Copyright (C) 2011 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)
+
+#ifndef LIBS_TREE_NODE_EXAMPLE_SHOWCASE_DESCENDANT_ITERATORS_HPP_INCLUDED
+#define LIBS_TREE_NODE_EXAMPLE_SHOWCASE_DESCENDANT_ITERATORS_HPP_INCLUDED
+
+#include <iostream>
+#include <boost/tree_node/typeof.hpp>
+
+//[example__showcase_descendant_iterators
+template <typename NodePointer, typename Function1, typename Function2>
+void
+ showcase_descendant_iterators(
+ NodePointer const& root
+ , Function1 show1
+ , Function2 show2
+ )
+{
+ std::cout << " Breadth-first traversal:";
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_breadth_first_descendant_iterator(root)
+ );
+ itr;
+ ++itr
+ )
+ {
+ show1(itr->first, itr->second);
+ }
+
+ std::cout << std::endl << " Pre-order traversal:";
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_pre_order_descendant_iterator(root)
+ );
+ itr;
+ ++itr
+ )
+ {
+ show1(itr->first, itr->second);
+ }
+
+ std::cout << std::endl << " Post-order traversal:";
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_post_order_descendant_iterator(root)
+ );
+ itr;
+ ++itr
+ )
+ {
+ show1(itr->first, itr->second);
+ }
+
+ std::cout << std::endl << " Depth-first traversal:" << std::endl;
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_depth_first_descendant_iterator(root)
+ );
+ itr;
+ ++itr
+ )
+ {
+ show2(itr, boost::tree_node::traversal_state(itr));
+ }
+
+ std::cout << std::endl;
+}
+//]
+
+#endif // LIBS_TREE_NODE_EXAMPLE_SHOWCASE_DESCENDANT_ITERATORS_HPP_INCLUDED
+

Added: sandbox/tree_node/libs/tree_node/example/showcase_iterators.hpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/showcase_iterators.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,45 @@
+// Copyright (C) 2011 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)
+
+#ifndef LIBS_TREE_NODE_EXAMPLE_SHOWCASE_ITERATORS_HPP_INCLUDED
+#define LIBS_TREE_NODE_EXAMPLE_SHOWCASE_ITERATORS_HPP_INCLUDED
+
+#include <iostream>
+#include <boost/tree_node/breadth_first_iterator.hpp>
+#include <boost/tree_node/pre_order_iterator.hpp>
+#include <boost/tree_node/post_order_iterator.hpp>
+#include <boost/tree_node/depth_first_iterator.hpp>
+
+//[example__showcase_iterators
+template <typename NodePointer, typename Function1, typename Function2>
+void
+ showcase_iterators(
+ NodePointer const& root
+ , Function1 show1
+ , Function2 show2
+ )
+{
+ std::cout << " Breadth-first: ";
+ boost::tree_node::breadth_first_iterate(root, show1);
+ std::cout << std::endl << " sans root: ";
+ boost::tree_node::breadth_first_iterate_descendants(root, show1);
+ std::cout << std::endl << " Pre-order: ";
+ boost::tree_node::pre_order_iterate(root, show1);
+ std::cout << std::endl << " sans root: ";
+ boost::tree_node::pre_order_iterate_descendants(root, show1);
+ std::cout << std::endl << " Post-order: ";
+ boost::tree_node::post_order_iterate(root, show1);
+ std::cout << std::endl << " sans root: ";
+ boost::tree_node::post_order_iterate_descendants(root, show1);
+ std::cout << std::endl << " Depth-first:" << std::endl;
+ boost::tree_node::depth_first_iterate(root, show2);
+ std::cout << std::endl << " sans root:" << std::endl;
+ boost::tree_node::depth_first_iterate_descendants(root, show2);
+ std::cout << std::endl;
+}
+//]
+
+#endif // LIBS_TREE_NODE_EXAMPLE_SHOWCASE_ITERATORS_HPP_INCLUDED
+

Added: sandbox/tree_node/libs/tree_node/example/simple_associative_node.cpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/simple_associative_node.cpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,211 @@
+// Copyright (C) 2011 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)
+
+#include <iostream>
+#include <boost/assert.hpp>
+#include <boost/tr1/tuple.hpp>
+#include <boost/tree_node/typeof.hpp>
+#include "default_unconstructible_type.hpp"
+#include "show_functions.hpp"
+#include "showcase_descendant_iterators.hpp"
+
+typedef boost::tree_node::simple_associative_node<
+ char const*
+ , default_unconstructible_example_type
+ , boost::multimapS
+ >
+ DNode;
+typedef boost::tree_node::simple_associative_node<
+ char const*
+ , char*
+ , boost::hash_multimapS
+ >
+ ANode;
+
+int main()
+{
+ char const* names[] = {"able", "baker", "charlie", "dog", "easy", "fox"};
+ DNode::pointer d_root(DNode::create(create_instance(5)));
+ ANode::pointer a_root(ANode::create());
+
+ BOOST_ASSERT(
+ !d_root->get_parent()
+ && "Parent member uninitialized."
+ );
+ BOOST_ASSERT(
+ !a_root->get_data()
+ && "Data member not default-constructed."
+ );
+
+ for (
+ BOOST_AUTO(itr, boost::tree_node::make_breadth_first_iterator(d_root));
+ itr;
+ ++itr
+ )
+ {
+ std::size_t const count = (*itr)->get_data().number;
+
+ if (1 < count)
+ {
+ for (std::size_t i = 0; i < count; ++i)
+ {
+ for (std::size_t j = 0; j + i < count; ++j)
+ {
+ DNode::pointer child(
+ (*itr)->add_child(names[j], create_instance(i))
+ );
+ DNode::const_pointer const_child(child);
+
+ BOOST_ASSERT(
+ (child->get_parent() == *itr)
+ && "Ctor not linking child to parent."
+ );
+ BOOST_ASSERT(
+ (child->get_parent() == const_child->get_parent())
+ && "Why are these pointers different?"
+ );
+ }
+ }
+ }
+ }
+
+ {
+ boost::tree_node::depth_first_iterate(d_root, show_number_tree());
+ std::cout << std::endl;
+ }
+
+ std::cout << "After d_root tree construction," << std::endl;
+ showcase_descendant_iterators(
+ DNode::const_pointer(d_root)
+ , show_key_and_number<char const*,DNode::const_pointer>
+ , show_key_and_number_tree()
+ );
+
+ {
+ d_root->find_child(
+ names[2]
+ )->second->add_child_copy(names[5], d_root);
+ std::cout << "After add_child_copy call," << std::endl;
+ showcase_descendant_iterators(
+ DNode::const_pointer(d_root)
+ , show_key_and_number<char const*,DNode::const_pointer>
+ , show_key_and_number_tree()
+ );
+ }
+
+ {
+ char* root_data = new char[2];
+
+ root_data[0] = '5';
+ root_data[1] = '\0';
+ a_root->get_data() = root_data;
+ }
+
+ for (
+ BOOST_AUTO(itr, boost::tree_node::make_breadth_first_iterator(a_root));
+ itr;
+ ++itr
+ )
+ {
+ char digit = (*itr)->get_data()[0];
+
+ if ('1' < digit)
+ {
+ char numchar = digit;
+
+ while (numchar != '0')
+ {
+ --numchar;
+
+ for (char j = 0; numchar + j < digit; ++j)
+ {
+ ANode::pointer child((*itr)->add_child(names[j]));
+ char*& data = child->get_data();
+
+ BOOST_ASSERT(
+ !data
+ && "Data member not default-constructed."
+ );
+ data = new char[2];
+ data[0] = numchar;
+ data[1] = '\0';
+ BOOST_ASSERT(
+ (child->get_parent() == *itr)
+ && "Ctor not linking child to parent."
+ );
+ }
+ }
+ }
+ }
+
+ std::cout << "After a_root tree construction," << std::endl;
+ showcase_descendant_iterators(
+ ANode::const_pointer(a_root)
+ , show_key_and_data<char const*,ANode::const_pointer>
+ , show_key_and_data_tree()
+ );
+
+ {
+ ANode::pointer a_child(
+ a_root->find_child(names[2])->second->add_child(names[5])
+ );
+
+ a_child->get_data() = new char[2];
+ a_child->get_data()[0] = '7';
+ a_child->get_data()[1] = '\0';
+ std::cout << "After a_child construction," << std::endl;
+ showcase_descendant_iterators(
+ ANode::const_pointer(a_root)
+ , show_key_and_data<char const*,ANode::const_pointer>
+ , show_key_and_data_tree()
+ );
+ }
+
+ {
+ ANode::pointer to_be_pruned = a_root->get_child_begin()->second;
+ ANode::child_iterator c_itr, c_end;
+
+ for (
+ std::tr1::tie(c_itr, c_end) = to_be_pruned->find_children(
+ names[1]
+ );
+ c_itr != c_end;
+ ++c_itr
+ )
+ {
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_pre_order_iterator(c_itr->second)
+ );
+ itr;
+ ++itr
+ )
+ {
+ delete[] (*itr)->get_data();
+ }
+ }
+
+ to_be_pruned->remove_children(names[1]);
+ std::cout << "After remove_children call," << std::endl;
+ showcase_descendant_iterators(
+ ANode::const_pointer(a_root)
+ , show_key_and_data<char const*,ANode::const_pointer>
+ , show_key_and_data_tree()
+ );
+ }
+
+ for (
+ BOOST_AUTO(itr, boost::tree_node::make_post_order_iterator(a_root));
+ itr;
+ ++itr
+ )
+ {
+ delete[] (*itr)->get_data();
+ }
+
+ return 0;
+}
+

Added: sandbox/tree_node/libs/tree_node/example/simple_node.cpp
==============================================================================
--- (empty file)
+++ sandbox/tree_node/libs/tree_node/example/simple_node.cpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,191 @@
+// Copyright (C) 2011 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)
+
+#include <iostream>
+#include <boost/assert.hpp>
+#include <boost/tree_node/typeof.hpp>
+#include "default_unconstructible_type.hpp"
+#include "show_functions.hpp"
+#include "showcase_iterators.hpp"
+
+typedef boost::tree_node::simple_node<default_unconstructible_example_type>
+ DNode;
+typedef boost::tree_node::simple_node<char*>
+ ANode;
+
+int main()
+{
+ DNode::pointer d_root(DNode::create(create_instance(5)));
+ ANode::pointer a_root(ANode::create());
+
+ BOOST_ASSERT(
+ !d_root->get_parent()
+ && "Parent member uninitialized."
+ );
+ BOOST_ASSERT(
+ !a_root->get_data()
+ && "Data member not default-constructed."
+ );
+
+ for (
+ BOOST_AUTO(itr, boost::tree_node::make_breadth_first_iterator(d_root));
+ itr;
+ ++itr
+ )
+ {
+ std::size_t const count = (*itr)->get_data().number;
+
+ if (1 < count)
+ {
+ for (std::size_t i = 0; i < count; ++i)
+ {
+ DNode::pointer child((*itr)->add_child(create_instance(i)));
+ DNode::const_pointer const_child(child);
+
+ BOOST_ASSERT(
+ (child->get_parent() == *itr)
+ && "Ctor not linking child to parent."
+ );
+ BOOST_ASSERT(
+ (child == *((*itr)->get_child_begin() + i))
+ && "Ctor not linking parent to child."
+ );
+ BOOST_ASSERT(
+ (child->get_parent() == const_child->get_parent())
+ && "Why are these pointers different?"
+ );
+ }
+ }
+ }
+
+ std::cout << "After d_root tree construction," << std::endl;
+ showcase_iterators(
+ DNode::const_pointer(d_root)
+ , show_number<DNode::const_pointer>
+ , show_number_tree()
+ );
+
+ {
+ (*(d_root->get_child_begin() + 2))->add_child_copy(d_root);
+ std::cout << "After add_child_copy call," << std::endl;
+ showcase_iterators(
+ DNode::const_pointer(d_root)
+ , show_number<DNode::const_pointer>
+ , show_number_tree()
+ );
+ }
+
+ (*(d_root->get_child_begin() + 4))->remove_all_children();
+ std::cout << "After remove_all_children call," << std::endl;
+ showcase_iterators(
+ DNode::const_pointer(d_root)
+ , show_number<DNode::const_pointer>
+ , show_number_tree()
+ );
+
+ char* root_data = new char[2];
+
+ root_data[0] = '5';
+ root_data[1] = '\0';
+ a_root->get_data() = root_data;
+
+ for (
+ BOOST_AUTO(itr, boost::tree_node::make_breadth_first_iterator(a_root));
+ itr;
+ ++itr
+ )
+ {
+ char digit = (*itr)->get_data()[0];
+
+ if ('1' < digit)
+ {
+ char numchar = digit;
+
+ while (numchar != '0')
+ {
+ ANode::pointer child((*itr)->add_child());
+ char*& data = child->get_data();
+
+ BOOST_ASSERT(
+ !data
+ && "Data member not default-constructed."
+ );
+ data = new char[2];
+ data[0] = --numchar;
+ data[1] = '\0';
+ BOOST_ASSERT(
+ (child->get_parent() == *itr)
+ && "Ctor not linking child to parent."
+ );
+ BOOST_ASSERT(
+ (
+ child
+ == *((*itr)->get_child_begin() + (digit - (numchar + 1)))
+ )
+ && "Ctor not linking parent to child."
+ );
+ }
+ }
+ }
+
+ std::cout << "After a_root tree construction," << std::endl;
+ showcase_iterators(
+ ANode::const_pointer(a_root)
+ , show_data<ANode::const_pointer>
+ , show_data_tree()
+ );
+
+ {
+ ANode::pointer a_child(
+ (*(a_root->get_child_begin() + 2))->add_child()
+ );
+
+ a_child->get_data() = new char[2];
+ a_child->get_data()[0] = '7';
+ a_child->get_data()[1] = '\0';
+ std::cout << "After a_child construction," << std::endl;
+ showcase_iterators(
+ ANode::const_pointer(a_root)
+ , show_data<ANode::const_pointer>
+ , show_data_tree()
+ );
+ }
+
+ {
+ ANode::pointer leaf = *a_root->get_child_begin();
+
+ for (
+ BOOST_AUTO(
+ itr
+ , boost::tree_node::make_pre_order_descendant_iterator(leaf)
+ );
+ itr;
+ ++itr
+ )
+ {
+ delete[] (*itr)->get_data();
+ }
+
+ leaf->remove_all_children();
+ std::cout << "After remove_all_children call," << std::endl;
+ showcase_iterators(
+ ANode::const_pointer(a_root)
+ , show_data<ANode::const_pointer>
+ , show_data_tree()
+ );
+ }
+
+ for (
+ BOOST_AUTO(itr, boost::tree_node::make_post_order_iterator(a_root));
+ itr;
+ ++itr
+ )
+ {
+ delete[] (*itr)->get_data();
+ }
+
+ return 0;
+}
+

Added: sandbox/utility-container_gen/LICENSE_1_0.txt
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/LICENSE_1_0.txt 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,23 @@
+Boost Software License - Version 1.0 - August 17th, 2003
+
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.

Added: sandbox/utility-container_gen/boost.png
==============================================================================
Binary file. No diff available.

Added: sandbox/utility-container_gen/boost/detail/function/range_equal.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/function/range_equal.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,24 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_FUNCTION_RANGE_EQUAL_HPP_INCLUDED
+#define BOOST_DETAIL_FUNCTION_RANGE_EQUAL_HPP_INCLUDED
+
+#include <boost/range/algorithm/equal.hpp>
+
+namespace boost { namespace detail {
+
+ struct range_equal
+ {
+ template <typename R1, typename R2>
+ inline bool operator()(R1 const& r1, R2 const& r2) const
+ {
+ return ::boost::range::equal(r1, r2);
+ }
+ };
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_FUNCTION_RANGE_EQUAL_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/function/range_less.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/function/range_less.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,24 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_FUNCTION_RANGE_LESS_HPP_INCLUDED
+#define BOOST_DETAIL_FUNCTION_RANGE_LESS_HPP_INCLUDED
+
+#include <boost/range/algorithm/lexicographical_compare.hpp>
+
+namespace boost { namespace detail {
+
+ struct range_less
+ {
+ template <typename R1, typename R2>
+ inline bool operator()(R1 const& r1, R2 const& r2) const
+ {
+ return ::boost::range::lexicographical_compare(r1, r2);
+ }
+ };
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_FUNCTION_RANGE_LESS_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/has_const_iterator.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/has_const_iterator.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,19 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_HAS_CONST_ITERATOR_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_HAS_CONST_ITERATOR_HPP_INCLUDED
+
+#include <boost/mpl/has_xxx.hpp>
+
+namespace boost { namespace detail {
+
+ // The has_const_iterator metafunction will determine whether or not the
+ // specified type has a nested 'const_iterator' type definition.
+ BOOST_MPL_HAS_XXX_TRAIT_DEF(const_iterator)
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_HAS_CONST_ITERATOR_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/has_const_pointer.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/has_const_pointer.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,19 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_HAS_CONST_POINTER_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_HAS_CONST_POINTER_HPP_INCLUDED
+
+#include <boost/mpl/has_xxx.hpp>
+
+namespace boost { namespace detail {
+
+ // The has_const_pointer metafunction will determine whether or not the
+ // specified type has a nested 'const_pointer' type definition.
+ BOOST_MPL_HAS_XXX_TRAIT_DEF(const_pointer)
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_HAS_CONST_POINTER_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/has_const_reference.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/has_const_reference.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,19 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_HAS_CONST_REFERENCE_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_HAS_CONST_REFERENCE_HPP_INCLUDED
+
+#include <boost/mpl/has_xxx.hpp>
+
+namespace boost { namespace detail {
+
+ // The has_const_reference metafunction will determine whether or not the
+ // specified type has a nested 'const_reference' type definition.
+ BOOST_MPL_HAS_XXX_TRAIT_DEF(const_reference)
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_HAS_CONST_REFERENCE_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/has_difference_type.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/has_difference_type.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,19 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_HAS_DIFFERENCE_TYPE_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_HAS_DIFFERENCE_TYPE_HPP_INCLUDED
+
+#include <boost/mpl/has_xxx.hpp>
+
+namespace boost { namespace detail {
+
+ // The has_difference_type metafunction will determine whether or not the
+ // specified type has a nested 'difference_type' type definition.
+ BOOST_MPL_HAS_XXX_TRAIT_DEF(difference_type)
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_HAS_DIFFERENCE_TYPE_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/has_pointer.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/has_pointer.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,19 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_HAS_POINTER_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_HAS_POINTER_HPP_INCLUDED
+
+#include <boost/mpl/has_xxx.hpp>
+
+namespace boost { namespace detail {
+
+ // The has_pointer metafunction will determine whether or not the
+ // specified type has a nested 'pointer' type definition.
+ BOOST_MPL_HAS_XXX_TRAIT_DEF(pointer)
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_HAS_POINTER_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/has_reference.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/has_reference.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,19 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_HAS_REFERENCE_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_HAS_REFERENCE_HPP_INCLUDED
+
+#include <boost/mpl/has_xxx.hpp>
+
+namespace boost { namespace detail {
+
+ // The has_reference metafunction will determine whether or not the
+ // specified type has a nested 'reference' type definition.
+ BOOST_MPL_HAS_XXX_TRAIT_DEF(reference)
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_HAS_REFERENCE_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/has_size_type.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/has_size_type.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,19 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_HAS_SIZE_TYPE_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_HAS_SIZE_TYPE_HPP_INCLUDED
+
+#include <boost/mpl/has_xxx.hpp>
+
+namespace boost { namespace detail {
+
+ // The has_size_type metafunction will determine whether or not the
+ // specified type has a nested 'size_type' type definition.
+ BOOST_MPL_HAS_XXX_TRAIT_DEF(size_type)
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_HAS_SIZE_TYPE_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/has_value_type.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/has_value_type.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,19 @@
+// Copyright (C) 2007-2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_HAS_VALUE_TYPE_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_HAS_VALUE_TYPE_HPP_INCLUDED
+
+#include <boost/mpl/has_xxx.hpp>
+
+namespace boost { namespace detail {
+
+ // The has_value_type metafunction will determine whether or not the
+ // specified type has a nested 'value_type' type definition.
+ BOOST_MPL_HAS_XXX_TRAIT_DEF(value_type)
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_HAS_VALUE_TYPE_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/is_container.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/is_container.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,53 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_IS_CONTAINER_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_IS_CONTAINER_HPP_INCLUDED
+
+#include <boost/mpl/bool.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/mpl/and.hpp>
+#include <boost/mpl/aux_/lambda_support.hpp>
+#include <boost/detail/metafunction/has_value_type.hpp>
+#include <boost/detail/metafunction/has_difference_type.hpp>
+#include <boost/detail/metafunction/has_size_type.hpp>
+#include <boost/detail/metafunction/has_const_iterator.hpp>
+#include <boost/detail/metafunction/has_const_pointer.hpp>
+#include <boost/detail/metafunction/has_const_reference.hpp>
+#include <boost/detail/metafunction/is_input_iterator.hpp>
+
+namespace boost { namespace detail {
+
+ template <typename T>
+ struct is_container_impl
+ : is_input_iterator<typename T::const_iterator>
+ {
+ };
+
+ template <typename T>
+ struct is_container
+ : ::boost::mpl::if_<
+ ::boost::mpl::and_<
+ ::boost::mpl::and_<
+ typename has_value_type<T>::type
+ , typename has_difference_type<T>::type
+ , typename has_size_type<T>::type
+ >
+ , ::boost::mpl::and_<
+ typename has_const_iterator<T>::type
+ , typename has_const_pointer<T>::type
+ , typename has_const_reference<T>::type
+ >
+ >
+ , is_container_impl<T>
+ , ::boost::mpl::false_
+ >::type
+ {
+ BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_container,(T))
+ };
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_IS_CONTAINER_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/detail/metafunction/is_input_iterator.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/detail/metafunction/is_input_iterator.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,55 @@
+// Copyright (C) 2011 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)
+
+#ifndef BOOST_DETAIL_METAFUNCTION_IS_INPUT_ITERATOR_HPP_INCLUDED
+#define BOOST_DETAIL_METAFUNCTION_IS_INPUT_ITERATOR_HPP_INCLUDED
+
+#include <boost/type_traits/is_signed.hpp>
+#include <boost/type_traits/can_call_equal.hpp>
+#include <boost/type_traits/can_call_dereference.hpp>
+#include <boost/type_traits/can_call_pre_increment.hpp>
+#include <boost/type_traits/can_call_post_increment.hpp>
+#include <boost/mpl/bool.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/mpl/and.hpp>
+#include <boost/mpl/aux_/lambda_support.hpp>
+#include <boost/detail/metafunction/has_value_type.hpp>
+#include <boost/detail/metafunction/has_difference_type.hpp>
+#include <boost/detail/metafunction/has_pointer.hpp>
+#include <boost/detail/metafunction/has_reference.hpp>
+
+namespace boost { namespace detail {
+
+ template <typename T>
+ struct is_input_iterator_impl
+ : ::boost::is_signed<typename T::difference_type>
+ {
+ };
+
+ template <typename T>
+ struct is_input_iterator
+ : ::boost::mpl::if_<
+ ::boost::mpl::and_<
+ typename has_value_type<T>::type
+ , typename has_difference_type<T>::type
+ , typename has_pointer<T>::type
+ , typename has_reference<T>::type
+ >
+ , ::boost::mpl::and_<
+ ::boost::can_call_equal<T>
+ , ::boost::can_call_dereference<T>
+ , ::boost::can_call_pre_increment<T>
+ , ::boost::can_call_post_increment<T>
+ , is_input_iterator_impl<T>
+ >
+ , ::boost::mpl::false_
+ >::type
+ {
+ BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_input_iterator,(T))
+ };
+}} // namespace boost::detail
+
+#endif // BOOST_DETAIL_METAFUNCTION_IS_INPUT_ITERATOR_HPP_INCLUDED
+

Added: sandbox/utility-container_gen/boost/graph/adjacency_list.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/graph/adjacency_list.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,376 @@
+//=======================================================================
+// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
+// Copyright 2010 Thomas Claveirole
+// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek, Thomas Claveirole
+//
+// 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)
+//=======================================================================
+
+#ifndef BOOST_GRAPH_ADJACENCY_LIST_HPP
+#define BOOST_GRAPH_ADJACENCY_LIST_HPP
+
+#include <boost/config.hpp>
+#include <boost/scoped_ptr.hpp>
+#include <boost/graph/graph_traits.hpp>
+#include <boost/graph/graph_mutability_traits.hpp>
+#include <boost/graph/graph_selectors.hpp>
+#include <boost/property_map/property_map.hpp>
+#include <boost/mpl/if.hpp>
+#include <boost/mpl/and.hpp>
+#include <boost/mpl/not.hpp>
+#include <boost/mpl/bool.hpp>
+#include <boost/graph/detail/edge.hpp>
+#include <boost/type_traits/is_same.hpp>
+#include <boost/detail/workaround.hpp>
+#include <boost/graph/properties.hpp>
+#include <boost/graph/named_graph.hpp>
+#include <boost/utility/is_random_access_selector.hpp>
+#include <boost/utility/is_unique_assoc_selector.hpp>
+#include <boost/utility/container_gen.hpp>
+
+namespace boost {
+
+ template <typename StorageSelector>
+ struct parallel_edge_traits
+ {
+ typedef typename mpl::if_<is_unique_associative_selector<StorageSelector>,
+ disallow_parallel_edge_tag,allow_parallel_edge_tag
+ >::type type;
+ };
+
+ //===========================================================================
+ // The adjacency_list_traits class, which provides a way to access
+ // some of the associated types of an adjacency_list type without
+ // having to first create the adjacency_list type. This is useful
+ // when trying to create interior vertex or edge properties who's
+ // value type is a vertex or edge descriptor.
+
+ template <class OutEdgeListS = vecS,
+ class VertexListS = vecS,
+ class DirectedS = directedS,
+ class EdgeListS = listS>
+ struct adjacency_list_traits
+ {
+ typedef typename is_random_access_selector<VertexListS>::type
+ is_rand_access;
+ typedef typename DirectedS::is_bidir_t is_bidir;
+ typedef typename DirectedS::is_directed_t is_directed;
+
+ typedef typename mpl::if_<is_bidir,
+ bidirectional_tag,
+ typename mpl::if_<is_directed,
+ directed_tag, undirected_tag
+ >::type
+ >::type directed_category;
+
+ typedef typename parallel_edge_traits<OutEdgeListS>::type
+ edge_parallel_category;
+
+ typedef std::size_t vertices_size_type;
+ typedef void* vertex_ptr;
+ typedef typename mpl::if_<is_rand_access,
+ vertices_size_type, vertex_ptr>::type vertex_descriptor;
+ typedef detail::edge_desc_impl<directed_category, vertex_descriptor>
+ edge_descriptor;
+
+ private:
+ // Logic to figure out the edges_size_type
+ struct dummy {};
+ typedef typename container_gen<EdgeListS, dummy>::type EdgeContainer;
+ typedef typename DirectedS::is_bidir_t BidirectionalT;
+ typedef typename DirectedS::is_directed_t DirectedT;
+ typedef typename mpl::and_<DirectedT,
+ typename mpl::not_<BidirectionalT>::type >::type on_edge_storage;
+ public:
+ typedef typename mpl::if_<on_edge_storage,
+ std::size_t, typename EdgeContainer::size_type
+ >::type edges_size_type;
+
+ };
+
+} // namespace boost
+
+#include <boost/graph/detail/adjacency_list.hpp>
+
+namespace boost {
+
+ //===========================================================================
+ // The adjacency_list class.
+ //
+
+ template <class OutEdgeListS = vecS, // a Sequence or an AssociativeContainer
+ class VertexListS = vecS, // a Sequence or a RandomAccessContainer
+ class DirectedS = directedS,
+ class VertexProperty = no_property,
+ class EdgeProperty = no_property,
+ class GraphProperty = no_property,
+ class EdgeListS = listS>
+ class adjacency_list
+ : public detail::adj_list_gen<
+ adjacency_list<OutEdgeListS,VertexListS,DirectedS,
+ VertexProperty,EdgeProperty,GraphProperty,EdgeListS>,
+ VertexListS, OutEdgeListS, DirectedS,
+#if !defined(BOOST_GRAPH_NO_BUNDLED_PROPERTIES)
+ typename detail::retag_property_list<vertex_bundle_t,
+ VertexProperty>::type,
+ typename detail::retag_property_list<edge_bundle_t, EdgeProperty>::type,
+#else
+ VertexProperty, EdgeProperty,
+#endif
+ GraphProperty, EdgeListS>::type,
+ // Support for named vertices
+ public graph::maybe_named_graph<
+ adjacency_list<OutEdgeListS,VertexListS,DirectedS,
+ VertexProperty,EdgeProperty,GraphProperty,EdgeListS>,
+ typename adjacency_list_traits<OutEdgeListS, VertexListS, DirectedS,
+ EdgeListS>::vertex_descriptor,
+ VertexProperty>
+ {
+ public:
+#if !defined(BOOST_GRAPH_NO_BUNDLED_PROPERTIES)
+ typedef typename graph_detail::graph_prop<GraphProperty>::property graph_property_type;
+ typedef typename graph_detail::graph_prop<GraphProperty>::bundle graph_bundled;
+
+ typedef typename graph_detail::vertex_prop<VertexProperty>::property vertex_property_type;
+ typedef typename graph_detail::vertex_prop<VertexProperty>::bundle vertex_bundled;
+
+ typedef typename graph_detail::edge_prop<EdgeProperty>::property edge_property_type;
+ typedef typename graph_detail::edge_prop<EdgeProperty>::bundle edge_bundled;
+#else
+ typedef GraphProperty graph_property_type;
+ typedef no_graph_bundle graph_bundled;
+
+ typedef VertexProperty vertex_property_type;
+ typedef no_vertex_bundle vertex_bundled;
+
+ typedef EdgeProperty edge_property_type;
+ typedef no_edge_bundle edge_bundled;
+#endif
+
+ private:
+ typedef adjacency_list self;
+ typedef typename detail::adj_list_gen<
+ self, VertexListS, OutEdgeListS, DirectedS,
+ vertex_property_type, edge_property_type, GraphProperty, EdgeListS
+ >::type Base;
+
+ public:
+ typedef typename Base::stored_vertex stored_vertex;
+ typedef typename Base::vertices_size_type vertices_size_type;
+ typedef typename Base::edges_size_type edges_size_type;
+ typedef typename Base::degree_size_type degree_size_type;
+ typedef typename Base::vertex_descriptor vertex_descriptor;
+ typedef typename Base::edge_descriptor edge_descriptor;
+ typedef OutEdgeListS out_edge_list_selector;
+ typedef VertexListS vertex_list_selector;
+ typedef DirectedS directed_selector;
+ typedef EdgeListS edge_list_selector;
+
+
+ adjacency_list(const GraphProperty& p = GraphProperty())
+ : m_property(new graph_property_type(p))
+ { }
+
+ adjacency_list(const adjacency_list& x)
+ : Base(x), m_property(new graph_property_type(*x.m_property))
+ { }
+
+ adjacency_list& operator=(const adjacency_list& x) {
+ // TBD: probably should give the strong guarantee
+ if (&x != this) {
+ Base::operator=(x);
+
+ // Copy/swap the ptr since we can't just assign it...
+ property_ptr p(new graph_property_type(*x.m_property));
+ m_property.swap(p);
+ }
+ return *this;
+ }
+
+ // Required by Mutable Graph
+ adjacency_list(vertices_size_type num_vertices,
+ const GraphProperty& p = GraphProperty())
+ : Base(num_vertices), m_property(new graph_property_type(p))
+ { }
+
+#if !defined(BOOST_MSVC) || BOOST_MSVC >= 1300
+ // Required by Iterator Constructible Graph
+ template <class EdgeIterator>
+ adjacency_list(EdgeIterator first, EdgeIterator last,
+ vertices_size_type n,
+ edges_size_type = 0,
+ const GraphProperty& p = GraphProperty())
+ : Base(n, first, last), m_property(new graph_property_type(p))
+ { }
+
+ template <class EdgeIterator, class EdgePropertyIterator>
+ adjacency_list(EdgeIterator first, EdgeIterator last,
+ EdgePropertyIterator ep_iter,
+ vertices_size_type n,
+ edges_size_type = 0,
+ const GraphProperty& p = GraphProperty())
+ : Base(n, first, last, ep_iter), m_property(new graph_property_type(p))
+ { }
+#endif
+
+ void swap(adjacency_list& x) {
+ // Is there a more efficient way to do this?
+ adjacency_list tmp(x);
+ x = *this;
+ *this = tmp;
+ }
+
+ void clear()
+ {
+ this->clearing_graph();
+ Base::clear();
+ }
+
+#ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES
+ // Directly access a vertex or edge bundle
+ vertex_bundled& operator[](vertex_descriptor v)
+ { return get(vertex_bundle, *this)[v]; }
+
+ const vertex_bundled& operator[](vertex_descriptor v) const
+ { return get(vertex_bundle, *this)[v]; }
+
+ edge_bundled& operator[](edge_descriptor e)
+ { return get(edge_bundle, *this)[e]; }
+
+ const edge_bundled& operator[](edge_descriptor e) const
+ { return get(edge_bundle, *this)[e]; }
+
+ graph_bundled& operator[](graph_bundle_t)
+ { return get_property(*this); }
+
+ graph_bundled const& operator[](graph_bundle_t) const
+ { return get_property(*this); }
+#endif
+
+ // protected: (would be protected if friends were more portable)
+ typedef scoped_ptr<graph_property_type> property_ptr;
+ property_ptr m_property;
+ };
+
+#define ADJLIST_PARAMS \
+ typename OEL, typename VL, typename D, typename VP, typename EP, \
+ typename GP, typename EL
+#define ADJLIST adjacency_list<OEL,VL,D,VP,EP,GP,EL>
+
+ template<ADJLIST_PARAMS, typename Tag, typename Value>
+ inline void set_property(ADJLIST& g, Tag, Value const& value) {
+ get_property_value(*g.m_property, Tag()) = value;
+ }
+
+ template<ADJLIST_PARAMS, typename Tag>
+ inline typename graph_property<ADJLIST, Tag>::type&
+ get_property(ADJLIST& g, Tag) {
+ return get_property_value(*g.m_property, Tag());
+ }
+
+ template<ADJLIST_PARAMS, typename Tag>
+ inline typename graph_property<ADJLIST, Tag>::type const&
+ get_property(ADJLIST const& g, Tag) {
+ return get_property_value(*g.m_property, Tag());
+ }
+
+ // dwa 09/25/00 - needed to be more explicit so reverse_graph would work.
+ template <class Directed, class Vertex,
+ class OutEdgeListS,
+ class VertexListS,
+ class DirectedS,
+ class VertexProperty,
+ class EdgeProperty,
+ class GraphProperty, class EdgeListS>
+ inline Vertex
+ source(const detail::edge_base<Directed,Vertex>& e,
+ const adjacency_list<OutEdgeListS, VertexListS, DirectedS,
+ VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&)
+ {
+ return e.m_source;
+ }
+
+ template <class Directed, class Vertex, class OutEdgeListS,
+ class VertexListS, class DirectedS, class VertexProperty,
+ class EdgeProperty, class GraphProperty, class EdgeListS>
+ inline Vertex
+ target(const detail::edge_base<Directed,Vertex>& e,
+ const adjacency_list<OutEdgeListS, VertexListS, DirectedS,
+ VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&)
+ {
+ return e.m_target;
+ }
+
+ // Support for bundled properties
+#ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES
+ template<typename OutEdgeListS, typename VertexListS, typename DirectedS, typename VertexProperty,
+ typename EdgeProperty, typename GraphProperty, typename EdgeListS, typename T, typename Bundle>
+ inline
+ typename property_map<adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty,
+ GraphProperty, EdgeListS>, T Bundle::*>::type
+ get(T Bundle::* p, adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty,
+ GraphProperty, EdgeListS>& g)
+ {
+ typedef typename property_map<adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty,
+ EdgeProperty, GraphProperty, EdgeListS>, T Bundle::*>::type
+ result_type;
+ return result_type(&g, p);
+ }
+
+ template<typename OutEdgeListS, typename VertexListS, typename DirectedS, typename VertexProperty,
+ typename EdgeProperty, typename GraphProperty, typename EdgeListS, typename T, typename Bundle>
+ inline
+ typename property_map<adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty,
+ GraphProperty, EdgeListS>, T Bundle::*>::const_type
+ get(T Bundle::* p, adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty,
+ GraphProperty, EdgeListS> const & g)
+ {
+ typedef typename property_map<adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty,
+ EdgeProperty, GraphProperty, EdgeListS>, T Bundle::*>::const_type
+ result_type;
+ return result_type(&g, p);
+ }
+
+ template<typename OutEdgeListS, typename VertexListS, typename DirectedS, typename VertexProperty,
+ typename EdgeProperty, typename GraphProperty, typename EdgeListS, typename T, typename Bundle,
+ typename Key>
+ inline T
+ get(T Bundle::* p, adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty,
+ GraphProperty, EdgeListS> const & g, const Key& key)
+ {
+ return get(get(p, g), key);
+ }
+
+ template<typename OutEdgeListS, typename VertexListS, typename DirectedS, typename VertexProperty,
+ typename EdgeProperty, typename GraphProperty, typename EdgeListS, typename T, typename Bundle,
+ typename Key>
+ inline void
+ put(T Bundle::* p, adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty,
+ GraphProperty, EdgeListS>& g, const Key& key, const T& value)
+ {
+ put(get(p, g), key, value);
+ }
+
+#endif
+
+// Mutability Traits
+template <ADJLIST_PARAMS>
+struct graph_mutability_traits<ADJLIST> {
+ typedef mutable_property_graph_tag category;
+};
+
+// Can't remove vertices from adjacency lists with VL==vecS
+template <typename OEL, typename D, typename VP, typename EP, typename GP, typename EL>
+struct graph_mutability_traits< adjacency_list<OEL,vecS,D,VP,EP,GP,EL> > {
+ typedef add_only_property_graph_tag category;
+};
+#undef ADJLIST_PARAMS
+#undef ADJLIST
+
+
+} // namespace boost
+
+
+#endif // BOOST_GRAPH_ADJACENCY_LIST_HPP

Added: sandbox/utility-container_gen/boost/graph/detail/adjacency_list.hpp
==============================================================================
--- (empty file)
+++ sandbox/utility-container_gen/boost/graph/detail/adjacency_list.hpp 2011-09-16 04:21:36 EDT (Fri, 16 Sep 2011)
@@ -0,0 +1,2838 @@
+// -*- c++ -*-
+//=======================================================================
+// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
+// Copyright 2010 Thomas Claveirole
+// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek, Thomas Claveirole
+//
+// 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)
+//=======================================================================
+
+#ifndef BOOST_GRAPH_DETAIL_ADJACENCY_LIST_HPP
+#define BOOST_GRAPH_DETAIL_ADJACENCY_LIST_HPP
+
+#include <map> // for vertex_map in copy_impl
+#include <boost/config.hpp>
+#include <boost/detail/workaround.hpp>
+#include <boost/operators.hpp>
+#include <boost/property_map/property_map.hpp>
+#include <boost/range/irange.hpp>
+#include <boost/graph/graph_traits.hpp>
+#include <memory>
+#include <algorithm>
+#include <boost/limits.hpp>
+
+#include <boost/iterator/iterator_adaptor.hpp>
+
+#include <boost/mpl/if.hpp>
+#include <boost/mpl/not.hpp>
+#include <boost/mpl/and.hpp>
+#include <boost/graph/graph_concepts.hpp>
+#include <boost/pending/container_traits.hpp>
+#include <boost/graph/detail/adj_list_edge_iterator.hpp>
+#include <boost/graph/properties.hpp>
+#include <boost/pending/property.hpp>
+#include <boost/graph/adjacency_iterator.hpp>
+#include <boost/static_assert.hpp>
+#include <boost/assert.hpp>
+
+// Symbol truncation problems with MSVC, trying to shorten names.
+#define stored_edge se_
+#define stored_edge_property sep_
+#define stored_edge_iter sei_
+
+/*
+ Outline for this file:
+
+ out_edge_iterator and in_edge_iterator implementation
+ edge_iterator for undirected graph
+ stored edge types (these object live in the out-edge/in-edge lists)
+ directed edges helper class
+ directed graph helper class
+ undirected graph helper class
+ bidirectional graph helper class
+ bidirectional graph helper class (without edge properties)
+ bidirectional graph helper class (with edge properties)
+ adjacency_list helper class
+ adj_list_impl class
+ vec_adj_list_impl class
+ adj_list_gen class
+ vertex property map
+ edge property map
+
+
+ Note: it would be nice to merge some of the undirected and
+ bidirectional code... it is awful similar.
+ */
+
+
+#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
+// Stay out of the way of the concept checking class
+# define Graph Graph_
+#endif
+
+namespace boost {
+
+ namespace detail {
+
+ template <typename DirectedS>
+ struct directed_category_traits {
+ typedef directed_tag directed_category;
+ };
+
+ template <>
+ struct directed_category_traits<directedS> {
+ typedef directed_tag directed_category;
+ };
+ template <>
+ struct directed_category_traits<undirectedS> {
+ typedef undirected_tag directed_category;
+ };
+ template <>
+ struct directed_category_traits<bidirectionalS> {
+ typedef bidirectional_tag directed_category;
+ };
+
+ template <class Vertex>
+ struct target_is {
+ target_is(const Vertex& v) : m_target(v) { }
+ template <class StoredEdge>
+ bool operator()(const StoredEdge& e) const {
+ return e.get_target() == m_target;
+ }
+ Vertex m_target;
+ };
+
+ // O(E/V)
+ template <class EdgeList, class vertex_descriptor>
+ void erase_from_incidence_list(EdgeList& el, vertex_descriptor v,
+ allow_parallel_edge_tag)
+ {
+ boost::graph_detail::erase_if(el, detail::target_is<vertex_descriptor>(v));
+ }
+ // O(log(E/V))
+ template <class EdgeList, class vertex_descriptor>
+ void erase_from_incidence_list(EdgeList& el, vertex_descriptor v,
+ disallow_parallel_edge_tag)
+ {
+ typedef typename EdgeList::value_type StoredEdge;
+ el.erase(StoredEdge(v));
+ }
+
+ //=========================================================================
+ // Out-Edge and In-Edge Iterator Implementation
+
+ template <class BaseIter, class VertexDescriptor, class EdgeDescriptor, class Difference>
+ struct out_edge_iter
+ : iterator_adaptor<
+ out_edge_iter<BaseIter, VertexDescriptor, EdgeDescriptor, Difference>
+ , BaseIter
+ , EdgeDescriptor
+ , use_default
+ , EdgeDescriptor
+ , Difference
+ >
+ {
+ typedef iterator_adaptor<
+ out_edge_iter<BaseIter, VertexDescriptor, EdgeDescriptor, Difference>
+ , BaseIter
+ , EdgeDescriptor
+ , use_default
+ , EdgeDescriptor
+ , Difference
+ > super_t;
+
+ inline out_edge_iter() { }
+ inline out_edge_iter(const BaseIter& i, const VertexDescriptor& src)
+ : super_t(i), m_src(src) { }
+
+ inline EdgeDescriptor
+ dereference() const
+ {
+ return EdgeDescriptor(m_src, (*this->base()).get_target(),
+ &(*this->base()).get_property());
+ }
+ VertexDescriptor m_src;
+ };
+
+ template <class BaseIter, class VertexDescriptor, class EdgeDescriptor, class Difference>
+ struct in_edge_iter
+ : iterator_adaptor<
+ in_edge_iter<BaseIter, VertexDescriptor, EdgeDescriptor, Difference>
+ , BaseIter
+ , EdgeDescriptor
+ , use_default
+ , EdgeDescriptor
+ , Difference
+ >
+ {
+ typedef iterator_adaptor<
+ in_edge_iter<BaseIter, VertexDescriptor, EdgeDescriptor, Difference>
+ , BaseIter
+ , EdgeDescriptor
+ , use_default
+ , EdgeDescriptor
+ , Difference
+ > super_t;
+
+ inline in_edge_iter() { }
+ inline in_edge_iter(const BaseIter& i, const VertexDescriptor& src)
+ : super_t(i), m_src(src) { }
+
+ inline EdgeDescriptor
+ dereference() const
+ {
+ return EdgeDescriptor((*this->base()).get_target(), m_src,
+ &this->base()->get_property());
+ }
+ VertexDescriptor m_src;
+ };
+
+ //=========================================================================
+ // Undirected Edge Iterator Implementation
+
+ template <class EdgeIter, class EdgeDescriptor, class Difference>
+ struct undirected_edge_iter
+ : iterator_adaptor<
+ undirected_edge_iter<EdgeIter, EdgeDescriptor, Difference>
+ , EdgeIter
+ , EdgeDescriptor
+ , use_default
+ , EdgeDescriptor
+ , Difference
+ >
+ {
+ typedef iterator_adaptor<
+ undirected_edge_iter<EdgeIter, EdgeDescriptor, Difference>
+ , EdgeIter
+ , EdgeDescriptor
+ , use_default
+ , EdgeDescriptor
+ , Difference
+ > super_t;
+
+ undirected_edge_iter() {}
+
+ explicit undirected_edge_iter(EdgeIter i)
+ : super_t(i) {}
+
+ inline EdgeDescriptor
+ dereference() const {
+ return EdgeDescriptor(
+ (*this->base()).m_source
+ , (*this->base()).m_target
+ , &this->base()->get_property());
+ }
+ };
+
+ //=========================================================================
+ // Edge Storage Types (stored in the out-edge/in-edge lists)
+
+ template <class Vertex>
+ class stored_edge
+ : public boost::equality_comparable1< stored_edge<Vertex>,
+ boost::less_than_comparable1< stored_edge<Vertex> > >
+ {
+ public:
+ typedef no_property property_type;
+ inline stored_edge() { }
+ inline stored_edge(Vertex target, const no_property& = no_property())
+ : m_target(target) { }
+ // Need to write this explicitly so stored_edge_property can
+ // invoke Base::operator= (at least, for SGI MIPSPro compiler)
+ inline stored_edge& operator=(const stored_edge& x) {
+ m_target = x.m_target;
+ return *this;
+ }
+ inline Vertex& get_target() const { return m_target; }
+ inline const no_property& get_property() const { return s_prop; }
+ inline bool operator==(const stored_edge& x) const
+ { return m_target == x.get_target(); }
+ inline bool operator<(const stored_edge& x) const
+ { return m_target < x.get_target(); }
+ //protected: need to add hash<> as a friend
+ static no_property s_prop;
+ // Sometimes target not used as key in the set, and in that case
+ // it is ok to change the target.
+ mutable Vertex m_target;
+ };
+ template <class Vertex>
+ no_property stored_edge<Vertex>::s_prop;
+
+ template <class Vertex, class Property>
+ class stored_edge_property : public stored_edge<Vertex> {
+ typedef stored_edge_property self;
+ typedef stored_edge<Vertex> Base;
+ public:
+ typedef Property property_type;
+ inline stored_edge_property() { }
+ inline stored_edge_property(Vertex target,
+ const Property& p = Property())
+ : stored_edge<Vertex>(target), m_property(new Property(p)) { }
+ stored_edge_property(const self& x)
+ : Base(x), m_property(const_cast<self&>(x).m_property) { }
+ self& operator=(const self& x) {
+ Base::operator=(x);
+ m_property = const_cast<self&>(x).m_property;
+ return *this;
+ }
+ inline Property& get_property() { return *m_property; }
+ inline const Property& get_property() const { return *m_property; }
+ protected:
+ // Holding the property by-value causes edge-descriptor
+ // invalidation for add_edge() with EdgeList=vecS. Instead we
+ // hold a pointer to the property. std::auto_ptr is not
+ // a perfect fit for the job, but it is darn close.
+ std::auto_ptr<Property> m_property;
+ };
+
+
+ template <class Vertex, class Iter, class Property>
+ class stored_edge_iter
+ : public stored_edge<Vertex>
+ {
+ public:
+ typedef Property property_type;
+ inline stored_edge_iter() { }
+ inline stored_edge_iter(Vertex v)
+ : stored_edge<Vertex>(v) { }
+ inline stored_edge_iter(Vertex v, Iter i, void* = 0)
+ : stored_edge<Vertex>(v), m_iter(i) { }
+ inline Property& get_property() { return m_iter->get_property(); }
+ inline const Property& get_property() const {
+ return m_iter->get_property();
+ }
+ inline Iter get_iter() const { return m_iter; }
+ protected:
+ Iter m_iter;
+ };
+
+ // For when the EdgeList is a std::vector.
+ // Want to make the iterator stable, so use an offset
+ // instead of an iterator into a std::vector
+ template <class Vertex, class EdgeVec, class Property>
+ class stored_ra_edge_iter
+ : public stored_edge<Vertex>
+ {
+ typedef typename EdgeVec::iterator Iter;
+ public:
+ typedef Property property_type;
+ inline stored_ra_edge_iter() { }
+ inline stored_ra_edge_iter(Vertex v, Iter i = Iter(),
+ EdgeVec* edge_vec = 0)
+ : stored_edge<Vertex>(v), m_i(i - edge_vec->begin()), m_vec(edge_vec){ }
+ inline Property& get_property() { return (*m_vec)[m_i].get_property(); }
+ inline const Property& get_property() const {
+ return (*m_vec)[m_i].get_property();
+ }
+ inline Iter get_iter() const { return m_vec->begin() + m_i; }
+ protected:
+ std::size_t m_i;
+ EdgeVec* m_vec;
+ };
+
+ } // namespace detail
+
+ template <class Tag, class Vertex, class Property>
+ const typename property_value<Property,Tag>::type&
+ get(Tag property_tag,
+ const detail::stored_edge_property<Vertex, Property>& e)
+ {
+ return get_property_value(e.get_property(), property_tag);
+ }
+
+ template <class Tag, class Vertex, class Iter, class Property>
+ const typename property_value<Property,Tag>::type&
+ get(Tag property_tag,
+ const detail::stored_edge_iter<Vertex, Iter, Property>& e)
+ {
+ return get_property_value(e.get_property(), property_tag);
+ }
+
+ template <class Tag, class Vertex, class EdgeVec, class Property>
+ const typename property_value<Property,Tag>::type&
+ get(Tag property_tag,
+ const detail::stored_ra_edge_iter<Vertex, EdgeVec, Property>& e)
+ {
+ return get_property_value(e.get_property(), property_tag);
+ }
+
+ //=========================================================================
+ // Directed Edges Helper Class
+
+ namespace detail {
+
+ // O(E/V)
+ template <class edge_descriptor, class EdgeList, class StoredProperty>
+ inline void
+ remove_directed_edge_dispatch(edge_descriptor, EdgeList& el,
+ StoredProperty& p)
+ {
+ for (typename EdgeList::iterator i = el.begin();
+ i != el.end(); ++i)
+ if (&(*i).get_property() == &p) {
+ el.erase(i);
+ return;
+ }
+ }
+
+ template <class incidence_iterator, class EdgeList, class Predicate>
+ inline void
+ remove_directed_edge_if_dispatch(incidence_iterator first,
+ incidence_iterator last,
+ EdgeList& el, Predicate pred,
+ boost::allow_parallel_edge_tag)
+ {
+ // remove_if
+ while (first != last && !pred(*first))
+ ++first;
+ incidence_iterator i = first;
+ if (first != last)
+ for (++i; i != last; ++i)
+ if (!pred(*i)) {
+ *first.base() = *i.base();
+ ++first;
+ }
+ el.erase(first.base(), el.end());
+ }
+ template <class incidence_iterator, class EdgeList, class Predicate>
+ inline void
+ remove_directed_edge_if_dispatch(incidence_iterator first,
+ incidence_iterator last,
+ EdgeList& el,
+ Predicate pred,
+ boost::disallow_parallel_edge_tag)
+ {
+ for (incidence_iterator next = first;
+ first != last; first = next) {
+ ++next;
+ if (pred(*first))
+ el.erase( first.base() );
+ }
+ }
+
+ template <class PropT, class Graph, class incidence_iterator,
+ class EdgeList, class Predicate>
+ inline void
+ undirected_remove_out_edge_if_dispatch(Graph& g,
+ incidence_iterator first,
+ incidence_iterator last,
+ EdgeList& el, Predicate pred,
+ boost::allow_parallel_edge_tag)
+ {
+ typedef typename Graph::global_edgelist_selector EdgeListS;
+ BOOST_STATIC_ASSERT((!is_same<EdgeListS, vecS>::value));
+
+ // remove_if
+ while (first != last && !pred(*first))
+ ++first;
+ incidence_iterator i = first;
+ bool self_loop_removed = false;
+ if (first != last)
+ for (; i != last; ++i) {
+ if (self_loop_removed) {
+ /* With self loops, the descriptor will show up
+ * twice. The first time it will be removed, and now it
+ * will be skipped.
+ */
+ self_loop_removed = false;
+ }
+ else if (!pred(*i)) {
+ *first.base() = *i.base();
+ ++first;
+ } else {
+ if (source(*i, g) == target(*i, g)) self_loop_removed = true;
+ else {
+ // Remove the edge from the target
+ detail::remove_directed_edge_dispatch
+ (*i,
+ g.out_edge_list(target(*i, g)),
+ *(PropT*)(*i).get_property());
+ }
+
+ // Erase the edge property
+ g.m_edges.erase( (*i.base()).get_iter() );
+ }
+ }
+ el.erase(first.base(), el.end());
+ }
+ template <class PropT, class Graph, class incidence_iterator,
+ class EdgeList, class Predicate>
+ inline void
+ undirected_remove_out_edge_if_dispatch(Graph& g,
+ incidence_iterator first,
+ incidence_iterator last,
+ EdgeList& el,
+ Predicate pred,
+ boost::disallow_parallel_edge_tag)
+ {
+ typedef typename Graph::global_edgelist_selector EdgeListS;
+ BOOST_STATIC_ASSERT((!is_same<EdgeListS, vecS>::value));
+
+ for (incidence_iterator next = first;
+ first != last; first = next) {
+ ++next;
+ if (pred(*first)) {
+ if (source(*first, g) != target(*first, g)) {
+ // Remove the edge from the target
+ detail::remove_directed_edge_dispatch
+ (*first,
+ g.out_edge_list(target(*first, g)),
+ *(PropT*)(*first).get_property());
+ }
+
+ // Erase the edge property
+ g.m_edges.erase( (*first.base()).get_iter() );
+
+ // Erase the edge in the source
+ el.erase( first.base() );
+ }
+ }
+ }
+
+ // O(E/V)
+ template <class edge_descriptor, class EdgeList, class StoredProperty>
+ inline void
+ remove_directed_edge_dispatch(edge_descriptor e, EdgeList& el,
+ no_property&)
+ {
+ for (typename EdgeList::iterator i = el.begin();
+ i != el.end(); ++i)
+ if ((*i).get_target() == e.m_target) {
+ el.erase(i);
+ return;
+ }
+ }
+
+ } // namespace detail
+
+ template <class Config>
+ struct directed_edges_helper {
+
+ // Placement of these overloaded remove_edge() functions
+ // inside the class avoids a VC++ bug.
+
+ // O(E/V)
+ inline void
+ remove_edge(typename Config::edge_descriptor e)
+ {
+ typedef typename Config::graph_type graph_type;
+ graph_type& g = static_cast<graph_type&>(*this);
+ typename Config::OutEdgeList& el = g.out_edge_list(source(e, g));
+ typedef typename Config::OutEdgeList::value_type::property_type PType;
+ detail::remove_directed_edge_dispatch(e, el,
+ *(PType*)e.get_property());
+ }
+
+ // O(1)
+ inline void
+ remove_edge(typename Config::out_edge_iterator iter)
+ {
+ typedef typename Config::graph_type graph_type;
+ graph_type& g = static_cast<graph_type&>(*this);
+ typename Config::edge_descriptor e = *iter;
+ typename Config::OutEdgeList& el = g.out_edge_list(source(e, g));
+ el.erase(iter.base());
+ }
+
+ };
+
+ // O(1)
+ template <class Config>
+ inline std::pair<typename Config::edge_iterator,
+ typename Config::edge_iterator>
+ edges(const directed_edges_helper<Config>& g_)
+ {
+ typedef typename Config::graph_type graph_type;
+ typedef typename Config::edge_iterator edge_iterator;
+ const graph_type& cg = static_cast<const graph_type&>(g_);
+ graph_type& g = const_cast<graph_type&>(cg);
+ return std::make_pair( edge_iterator(g.vertex_set().begin(),
+ g.vertex_set().begin(),
+ g.vertex_set().end(), g),
+ edge_iterator(g.vertex_set().begin(),
+ g.vertex_set().end(),
+ g.vertex_set().end(), g) );
+ }
+
+ //=========================================================================
+ // Directed Graph Helper Class
+
+ struct adj_list_dir_traversal_tag :
+ public virtual vertex_list_graph_tag,
+ public virtual incidence_graph_tag,
+ public virtual adjacency_graph_tag,
+ public virtual edge_list_graph_tag { };
+
+ template <class Config>
+ struct directed_graph_helper
+ : public directed_edges_helper<Config> {
+ typedef typename Config::edge_descriptor edge_descriptor;
+ typedef adj_list_dir_traversal_tag traversal_category;
+ };
+
+ // O(E/V)
+ template <class Config>
+ inline void
+ remove_edge(typename Config::vertex_descriptor u,
+ typename Config::vertex_descriptor v,
+ directed_graph_helper<Config>& g_)
+ {
+ typedef typename Config::graph_type graph_type;
+ typedef typename Config::edge_parallel_category Cat;
+ graph_type& g = static_cast<graph_type&>(g_);
+ detail::erase_from_incidence_list(g.out_edge_list(u), v, Cat());
+ }
+
+ template <class Config, class Predicate>
+ inline void
+ remove_out_edge_if(typename Config::vertex_descriptor u, Predicate pred,
+ directed_graph_helper<Config>& g_)
+ {
+ typedef typename Config::graph_type graph_type;
+ graph_type& g = static_cast<graph_type&>(g_);
+ typename Config::out_edge_iterator first, last;
+ boost::tie(first, last) = out_edges(u, g);
+ typedef typename Config::edge_parallel_category edge_parallel_category;
+ detail::remove_directed_edge_if_dispatch
+ (first, last, g.out_edge_list(u), pred, edge_parallel_category());
+ }
+
+ template <class Config, class Predicate>
+ inline void
+ remove_edge_if(Predicate pred, directed_graph_helper<Config>& g_)
+ {
+ typedef typename Config::graph_type graph_type;
+ graph_type& g = static_cast<graph_type&>(g_);
+
+ typename Config::vertex_iterator vi, vi_end;
+ for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
+ remove_out_edge_if(*vi, pred, g);
+ }
+
+ template <class EdgeOrIter, class Config>
+ inline void
+ remove_edge(EdgeOrIter e_or_iter, directed_graph_helper<Config>& g_)
+ {
+ g_.remove_edge(e_or_iter);
+ }
+
+ // O(V + E) for allow_parallel_edges
+ // O(V * log(E/V)) for disallow_parallel_edges
+ template <class Config>
+ inline void
+ clear_vertex(typename Config::vertex_descriptor u,
+ directed_graph_helper<Config>& g_)
+ {
+ typedef typename Config::graph_type graph_type;
+ typedef typename Config::edge_parallel_category Cat;
+ graph_type& g = static_cast<graph_type&>(g_);
+ typename Config::vertex_iterator vi, viend;
+ for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi)
+ detail::erase_from_incidence_list(g.out_edge_list(*vi), u, Cat());
+ g.out_edge_list(u).clear();
+ // clear() should be a req of Sequence and AssociativeContainer,
+ // or maybe just Container
+ }
+
+ template <class Config>
+ inline void
+ clear_out_edges(typename Config::vertex_descriptor u,
+ directed_graph_helper<Config>& g_)
+ {
+ typedef typename Config::graph_type graph_type;
+ typedef typename Config::edge_parallel_category Cat; <