Chris@16: // ----------------------------------------------------------------------------
Chris@16: // Copyright (C) 2002-2006 Marcin Kalicinski
Chris@16: // Copyright (C) 2009 Sebastian Redl
Chris@16: //
Chris@16: // Distributed under the Boost Software License, Version 1.0.
Chris@16: // (See accompanying file LICENSE_1_0.txt or copy at
Chris@16: // http://www.boost.org/LICENSE_1_0.txt)
Chris@16: //
Chris@16: // For more information, see www.boost.org
Chris@16: // ----------------------------------------------------------------------------
Chris@16: #ifndef BOOST_PROPERTY_TREE_DETAIL_PTREE_IMPLEMENTATION_HPP_INCLUDED
Chris@16: #define BOOST_PROPERTY_TREE_DETAIL_PTREE_IMPLEMENTATION_HPP_INCLUDED
Chris@16: 
Chris@16: #include <boost/iterator/iterator_adaptor.hpp>
Chris@16: #include <boost/iterator/reverse_iterator.hpp>
Chris@16: #include <boost/assert.hpp>
Chris@16: #include <boost/utility/swap.hpp>
Chris@16: #include <memory>
Chris@16: 
Chris@16: #if (defined(BOOST_MSVC) && \
Chris@16:      (_MSC_FULL_VER >= 160000000 && _MSC_FULL_VER < 170000000)) || \
Chris@16:     (defined(BOOST_INTEL_WIN) && \
Chris@16:      defined(BOOST_DINKUMWARE_STDLIB))
Chris@16: #define BOOST_PROPERTY_TREE_PAIR_BUG
Chris@16: #endif
Chris@16: 
Chris@16: namespace boost { namespace property_tree
Chris@16: {
Chris@16:     template <class K, class D, class C>
Chris@16:     struct basic_ptree<K, D, C>::subs
Chris@16:     {
Chris@16:         struct by_name {};
Chris@16:         // The actual child container.
Chris@16: #if defined(BOOST_PROPERTY_TREE_PAIR_BUG)
Chris@16:         // MSVC 10 has moved std::pair's members to a base
Chris@16:         // class. Unfortunately this does break the interface.
Chris@16:         BOOST_STATIC_CONSTANT(unsigned,
Chris@16:             first_offset = offsetof(value_type, first));
Chris@16: #endif
Chris@16:         typedef multi_index_container<value_type,
Chris@16:             multi_index::indexed_by<
Chris@16:                 multi_index::sequenced<>,
Chris@16:                 multi_index::ordered_non_unique<multi_index::tag<by_name>,
Chris@16: #if defined(BOOST_PROPERTY_TREE_PAIR_BUG)
Chris@16:                     multi_index::member_offset<value_type, const key_type,
Chris@16:                                         first_offset>,
Chris@16: #else
Chris@16:                     multi_index::member<value_type, const key_type,
Chris@16:                                         &value_type::first>,
Chris@16: #endif
Chris@16:                     key_compare
Chris@16:                 >
Chris@16:             >
Chris@16:         > base_container;
Chris@16: 
Chris@16:         // The by-name lookup index.
Chris@16:         typedef typename base_container::template index<by_name>::type
Chris@16:             by_name_index;
Chris@16: 
Chris@16:         // Access functions for getting to the children of a tree.
Chris@16:         static base_container& ch(self_type *s) {
Chris@16:             return *static_cast<base_container*>(s->m_children);
Chris@16:         }
Chris@16:         static const base_container& ch(const self_type *s) {
Chris@16:             return *static_cast<const base_container*>(s->m_children);
Chris@16:         }
Chris@16:         static by_name_index& assoc(self_type *s) {
Chris@16:             return ch(s).BOOST_NESTED_TEMPLATE get<by_name>();
Chris@16:         }
Chris@16:         static const by_name_index& assoc(const self_type *s) {
Chris@16:             return ch(s).BOOST_NESTED_TEMPLATE get<by_name>();
Chris@16:         }
Chris@16:     };
Chris@16:     template <class K, class D, class C>
Chris@16:     class basic_ptree<K, D, C>::iterator : public boost::iterator_adaptor<
Chris@16:         iterator, typename subs::base_container::iterator, value_type>
Chris@16:     {
Chris@16:         friend class boost::iterator_core_access;
Chris@16:         typedef boost::iterator_adaptor<
Chris@16:             iterator, typename subs::base_container::iterator, value_type>
Chris@16:             baset;
Chris@16:     public:
Chris@16:         typedef typename baset::reference reference;
Chris@16:         iterator() {}
Chris@16:         explicit iterator(typename iterator::base_type b)
Chris@16:             : iterator::iterator_adaptor_(b)
Chris@16:         {}
Chris@16:         reference dereference() const
Chris@16:         {
Chris@16:             // multi_index doesn't allow modification of its values, because
Chris@16:             // indexes could sort by anything, and modification screws that up.
Chris@16:             // However, we only sort by the key, and it's protected against
Chris@16:             // modification in the value_type, so this const_cast is safe.
Chris@16:             return const_cast<reference>(*this->base_reference());
Chris@16:         }
Chris@16:     };
Chris@16:     template <class K, class D, class C>
Chris@16:     class basic_ptree<K, D, C>::const_iterator : public boost::iterator_adaptor<
Chris@16:         const_iterator, typename subs::base_container::const_iterator>
Chris@16:     {
Chris@16:     public:
Chris@16:         const_iterator() {}
Chris@16:         explicit const_iterator(typename const_iterator::base_type b)
Chris@16:             : const_iterator::iterator_adaptor_(b)
Chris@16:         {}
Chris@16:         const_iterator(iterator b)
Chris@16:             : const_iterator::iterator_adaptor_(b.base())
Chris@16:         {}
Chris@16:     };
Chris@16:     template <class K, class D, class C>
Chris@16:     class basic_ptree<K, D, C>::reverse_iterator
Chris@16:         : public boost::reverse_iterator<iterator>
Chris@16:     {
Chris@16:     public:
Chris@16:         reverse_iterator() {}
Chris@16:         explicit reverse_iterator(iterator b)
Chris@16:             : boost::reverse_iterator<iterator>(b)
Chris@16:         {}
Chris@16:     };
Chris@16:     template <class K, class D, class C>
Chris@16:     class basic_ptree<K, D, C>::const_reverse_iterator
Chris@16:         : public boost::reverse_iterator<const_iterator>
Chris@16:     {
Chris@16:     public:
Chris@16:         const_reverse_iterator() {}
Chris@16:         explicit const_reverse_iterator(const_iterator b)
Chris@16:             : boost::reverse_iterator<const_iterator>(b)
Chris@16:         {}
Chris@16:         const_reverse_iterator(
Chris@16:             typename basic_ptree<K, D, C>::reverse_iterator b)
Chris@16:             : boost::reverse_iterator<const_iterator>(b)
Chris@16:         {}
Chris@16:     };
Chris@16:     template <class K, class D, class C>
Chris@16:     class basic_ptree<K, D, C>::assoc_iterator
Chris@16:         : public boost::iterator_adaptor<assoc_iterator,
Chris@16:                                          typename subs::by_name_index::iterator,
Chris@16:                                          value_type>
Chris@16:     {
Chris@16:         friend class boost::iterator_core_access;
Chris@16:         typedef boost::iterator_adaptor<assoc_iterator,
Chris@16:                                          typename subs::by_name_index::iterator,
Chris@16:                                          value_type>
Chris@16:             baset;
Chris@16:     public:
Chris@16:         typedef typename baset::reference reference;
Chris@16:         assoc_iterator() {}
Chris@16:         explicit assoc_iterator(typename assoc_iterator::base_type b)
Chris@16:             : assoc_iterator::iterator_adaptor_(b)
Chris@16:         {}
Chris@16:         reference dereference() const
Chris@16:         {
Chris@16:             return const_cast<reference>(*this->base_reference());
Chris@16:         }
Chris@16:     };
Chris@16:     template <class K, class D, class C>
Chris@16:     class basic_ptree<K, D, C>::const_assoc_iterator
Chris@16:         : public boost::iterator_adaptor<const_assoc_iterator,
Chris@16:                                    typename subs::by_name_index::const_iterator>
Chris@16:     {
Chris@16:     public:
Chris@16:         const_assoc_iterator() {}
Chris@16:         explicit const_assoc_iterator(
Chris@16:             typename const_assoc_iterator::base_type b)
Chris@16:             : const_assoc_iterator::iterator_adaptor_(b)
Chris@16:         {}
Chris@16:         const_assoc_iterator(assoc_iterator b)
Chris@16:             : const_assoc_iterator::iterator_adaptor_(b.base())
Chris@16:         {}
Chris@16:     };
Chris@16: 
Chris@16: 
Chris@16:     // Big five
Chris@16: 
Chris@16:     // Perhaps the children collection could be created on-demand only, to
Chris@16:     // reduce heap traffic. But that's a lot more work to implement.
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     basic_ptree<K, D, C>::basic_ptree()
Chris@16:         : m_children(new typename subs::base_container)
Chris@16:     {
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     basic_ptree<K, D, C>::basic_ptree(const data_type &d)
Chris@16:         : m_data(d), m_children(new typename subs::base_container)
Chris@16:     {
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     basic_ptree<K, D, C>::basic_ptree(const basic_ptree<K, D, C> &rhs)
Chris@16:         : m_data(rhs.m_data),
Chris@16:           m_children(new typename subs::base_container(subs::ch(&rhs)))
Chris@16:     {
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     basic_ptree<K, D, C> &
Chris@16:         basic_ptree<K, D, C>::operator =(const basic_ptree<K, D, C> &rhs)
Chris@16:     {
Chris@16:         self_type(rhs).swap(*this);
Chris@16:         return *this;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     basic_ptree<K, D, C>::~basic_ptree()
Chris@16:     {
Chris@16:         delete &subs::ch(this);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     void basic_ptree<K, D, C>::swap(basic_ptree<K, D, C> &rhs)
Chris@16:     {
Chris@16:         boost::swap(m_data, rhs.m_data);
Chris@16:         // Void pointers, no ADL necessary
Chris@16:         std::swap(m_children, rhs.m_children);
Chris@16:     }
Chris@16: 
Chris@16:     // Container view
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::size_type
Chris@16:         basic_ptree<K, D, C>::size() const
Chris@16:     {
Chris@16:         return subs::ch(this).size();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::size_type
Chris@16:         basic_ptree<K, D, C>::max_size() const
Chris@16:     {
Chris@16:         return subs::ch(this).max_size();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     bool basic_ptree<K, D, C>::empty() const
Chris@16:     {
Chris@16:         return subs::ch(this).empty();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::iterator
Chris@16:         basic_ptree<K, D, C>::begin()
Chris@16:     {
Chris@16:         return iterator(subs::ch(this).begin());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::const_iterator
Chris@16:         basic_ptree<K, D, C>::begin() const
Chris@16:     {
Chris@16:         return const_iterator(subs::ch(this).begin());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::iterator
Chris@16:         basic_ptree<K, D, C>::end()
Chris@16:     {
Chris@16:         return iterator(subs::ch(this).end());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::const_iterator
Chris@16:         basic_ptree<K, D, C>::end() const
Chris@16:     {
Chris@16:         return const_iterator(subs::ch(this).end());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::reverse_iterator
Chris@16:         basic_ptree<K, D, C>::rbegin()
Chris@16:     {
Chris@16:         return reverse_iterator(this->end());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::const_reverse_iterator
Chris@16:         basic_ptree<K, D, C>::rbegin() const
Chris@16:     {
Chris@16:         return const_reverse_iterator(this->end());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::reverse_iterator
Chris@16:         basic_ptree<K, D, C>::rend()
Chris@16:     {
Chris@16:         return reverse_iterator(this->begin());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::const_reverse_iterator
Chris@16:         basic_ptree<K, D, C>::rend() const
Chris@16:     {
Chris@16:         return const_reverse_iterator(this->begin());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::value_type &
Chris@16:         basic_ptree<K, D, C>::front()
Chris@16:     {
Chris@16:         return const_cast<value_type&>(subs::ch(this).front());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     const typename basic_ptree<K, D, C>::value_type &
Chris@16:         basic_ptree<K, D, C>::front() const
Chris@16:     {
Chris@16:         return subs::ch(this).front();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::value_type &
Chris@16:         basic_ptree<K, D, C>::back()
Chris@16:     {
Chris@16:         return const_cast<value_type&>(subs::ch(this).back());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     const typename basic_ptree<K, D, C>::value_type &
Chris@16:         basic_ptree<K, D, C>::back() const
Chris@16:     {
Chris@16:         return subs::ch(this).back();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::iterator
Chris@16:     basic_ptree<K, D, C>::insert(iterator where, const value_type &value)
Chris@16:     {
Chris@16:         return iterator(subs::ch(this).insert(where.base(), value).first);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class It> inline
Chris@16:     void basic_ptree<K, D, C>::insert(iterator where, It first, It last)
Chris@16:     {
Chris@16:         subs::ch(this).insert(where.base(), first, last);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::iterator
Chris@16:         basic_ptree<K, D, C>::erase(iterator where)
Chris@16:     {
Chris@16:         return iterator(subs::ch(this).erase(where.base()));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::iterator
Chris@16:         basic_ptree<K, D, C>::erase(iterator first, iterator last)
Chris@16:     {
Chris@16:         return iterator(subs::ch(this).erase(first.base(), last.base()));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::iterator
Chris@16:         basic_ptree<K, D, C>::push_front(const value_type &value)
Chris@16:     {
Chris@16:         return iterator(subs::ch(this).push_front(value).first);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::iterator
Chris@16:         basic_ptree<K, D, C>::push_back(const value_type &value)
Chris@16:     {
Chris@16:         return iterator(subs::ch(this).push_back(value).first);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     void basic_ptree<K, D, C>::pop_front()
Chris@16:     {
Chris@16:         subs::ch(this).pop_front();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     void basic_ptree<K, D, C>::pop_back()
Chris@16:     {
Chris@16:         subs::ch(this).pop_back();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     void basic_ptree<K, D, C>::reverse()
Chris@16:     {
Chris@16:         subs::ch(this).reverse();
Chris@16:     }
Chris@16: 
Chris@16:     namespace impl
Chris@16:     {
Chris@16:         struct by_first
Chris@16:         {
Chris@16:             template <typename P>
Chris@16:             bool operator ()(const P& lhs, const P& rhs) const {
Chris@16:               return lhs.first < rhs.first;
Chris@16:             }
Chris@16:         };
Chris@101: 
Chris@101:         template <typename C>
Chris@101:         struct equal_pred
Chris@101:         {
Chris@101:             template <typename P>
Chris@101:             bool operator ()(const P& lhs, const P& rhs) const {
Chris@101:                 C c;
Chris@101:                 return !c(lhs.first, rhs.first) &&
Chris@101:                        !c(rhs.first, lhs.first) &&
Chris@101:                        lhs.second == rhs.second;
Chris@101:             }
Chris@101:         };
Chris@101: 
Chris@101:         template <typename C, typename MI>
Chris@101:         bool equal_children(const MI& ch1, const MI& ch2) {
Chris@101:             // Assumes ch1.size() == ch2.size()
Chris@101:             return std::equal(ch1.begin(), ch1.end(),
Chris@101:                 ch2.begin(), equal_pred<C>());
Chris@101:         }
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     void basic_ptree<K, D, C>::sort()
Chris@16:     {
Chris@16:         sort(impl::by_first());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Compare> inline
Chris@16:     void basic_ptree<K, D, C>::sort(Compare comp)
Chris@16:     {
Chris@16:         subs::ch(this).sort(comp);
Chris@16:     }
Chris@16: 
Chris@16:     // Equality
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     bool basic_ptree<K, D, C>::operator ==(
Chris@16:                                   const basic_ptree<K, D, C> &rhs) const
Chris@16:     {
Chris@16:         // The size test is cheap, so add it as an optimization
Chris@16:         return size() == rhs.size() && data() == rhs.data() &&
Chris@101:             impl::equal_children<C>(subs::ch(this), subs::ch(&rhs));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     bool basic_ptree<K, D, C>::operator !=(
Chris@16:                                   const basic_ptree<K, D, C> &rhs) const
Chris@16:     {
Chris@16:         return !(*this == rhs);
Chris@16:     }
Chris@16: 
Chris@16:     // Associative view
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::assoc_iterator
Chris@16:         basic_ptree<K, D, C>::ordered_begin()
Chris@16:     {
Chris@16:         return assoc_iterator(subs::assoc(this).begin());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::const_assoc_iterator
Chris@16:         basic_ptree<K, D, C>::ordered_begin() const
Chris@16:     {
Chris@16:         return const_assoc_iterator(subs::assoc(this).begin());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::assoc_iterator
Chris@16:         basic_ptree<K, D, C>::not_found()
Chris@16:     {
Chris@16:         return assoc_iterator(subs::assoc(this).end());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::const_assoc_iterator
Chris@16:         basic_ptree<K, D, C>::not_found() const
Chris@16:     {
Chris@16:         return const_assoc_iterator(subs::assoc(this).end());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::assoc_iterator
Chris@16:         basic_ptree<K, D, C>::find(const key_type &key)
Chris@16:     {
Chris@16:         return assoc_iterator(subs::assoc(this).find(key));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::const_assoc_iterator
Chris@16:         basic_ptree<K, D, C>::find(const key_type &key) const
Chris@16:     {
Chris@16:         return const_assoc_iterator(subs::assoc(this).find(key));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     std::pair<
Chris@16:         typename basic_ptree<K, D, C>::assoc_iterator,
Chris@16:         typename basic_ptree<K, D, C>::assoc_iterator
Chris@16:     > basic_ptree<K, D, C>::equal_range(const key_type &key)
Chris@16:     {
Chris@16:         std::pair<typename subs::by_name_index::iterator,
Chris@16:                   typename subs::by_name_index::iterator> r(
Chris@16:             subs::assoc(this).equal_range(key));
Chris@16:         return std::pair<assoc_iterator, assoc_iterator>(
Chris@16:           assoc_iterator(r.first), assoc_iterator(r.second));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     std::pair<
Chris@16:         typename basic_ptree<K, D, C>::const_assoc_iterator,
Chris@16:         typename basic_ptree<K, D, C>::const_assoc_iterator
Chris@16:     > basic_ptree<K, D, C>::equal_range(const key_type &key) const
Chris@16:     {
Chris@16:         std::pair<typename subs::by_name_index::const_iterator,
Chris@16:                   typename subs::by_name_index::const_iterator> r(
Chris@16:             subs::assoc(this).equal_range(key));
Chris@16:         return std::pair<const_assoc_iterator, const_assoc_iterator>(
Chris@16:             const_assoc_iterator(r.first), const_assoc_iterator(r.second));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::size_type
Chris@16:         basic_ptree<K, D, C>::count(const key_type &key) const
Chris@16:     {
Chris@16:         return subs::assoc(this).count(key);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::size_type
Chris@16:         basic_ptree<K, D, C>::erase(const key_type &key)
Chris@16:     {
Chris@16:         return subs::assoc(this).erase(key);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::iterator
Chris@16:         basic_ptree<K, D, C>::to_iterator(assoc_iterator ai)
Chris@16:     {
Chris@16:         return iterator(subs::ch(this).
Chris@16:             BOOST_NESTED_TEMPLATE project<0>(ai.base()));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::const_iterator
Chris@16:         basic_ptree<K, D, C>::to_iterator(const_assoc_iterator ai) const
Chris@16:     {
Chris@16:         return const_iterator(subs::ch(this).
Chris@16:             BOOST_NESTED_TEMPLATE project<0>(ai.base()));
Chris@16:     }
Chris@16: 
Chris@16:     // Property tree view
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     typename basic_ptree<K, D, C>::data_type &
Chris@16:         basic_ptree<K, D, C>::data()
Chris@16:     {
Chris@16:         return m_data;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     const typename basic_ptree<K, D, C>::data_type &
Chris@16:         basic_ptree<K, D, C>::data() const
Chris@16:     {
Chris@16:         return m_data;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     void basic_ptree<K, D, C>::clear()
Chris@16:     {
Chris@16:         m_data = data_type();
Chris@16:         subs::ch(this).clear();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     basic_ptree<K, D, C> &
Chris@16:         basic_ptree<K, D, C>::get_child(const path_type &path)
Chris@16:     {
Chris@16:         path_type p(path);
Chris@16:         self_type *n = walk_path(p);
Chris@16:         if (!n) {
Chris@16:             BOOST_PROPERTY_TREE_THROW(ptree_bad_path("No such node", path));
Chris@16:         }
Chris@16:         return *n;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     const basic_ptree<K, D, C> &
Chris@16:         basic_ptree<K, D, C>::get_child(const path_type &path) const
Chris@16:     {
Chris@16:         return const_cast<self_type*>(this)->get_child(path);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     basic_ptree<K, D, C> &
Chris@16:         basic_ptree<K, D, C>::get_child(const path_type &path,
Chris@16:                                         self_type &default_value)
Chris@16:     {
Chris@16:         path_type p(path);
Chris@16:         self_type *n = walk_path(p);
Chris@16:         return n ? *n : default_value;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C> inline
Chris@16:     const basic_ptree<K, D, C> &
Chris@16:         basic_ptree<K, D, C>::get_child(const path_type &path,
Chris@16:                                         const self_type &default_value) const
Chris@16:     {
Chris@16:         return const_cast<self_type*>(this)->get_child(path,
Chris@16:             const_cast<self_type&>(default_value));
Chris@16:     }
Chris@16: 
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     optional<basic_ptree<K, D, C> &>
Chris@16:         basic_ptree<K, D, C>::get_child_optional(const path_type &path)
Chris@16:     {
Chris@16:         path_type p(path);
Chris@16:         self_type *n = walk_path(p);
Chris@16:         if (!n) {
Chris@16:             return optional<self_type&>();
Chris@16:         }
Chris@16:         return *n;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     optional<const basic_ptree<K, D, C> &>
Chris@16:         basic_ptree<K, D, C>::get_child_optional(const path_type &path) const
Chris@16:     {
Chris@16:         path_type p(path);
Chris@16:         self_type *n = walk_path(p);
Chris@16:         if (!n) {
Chris@16:             return optional<const self_type&>();
Chris@16:         }
Chris@16:         return *n;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     basic_ptree<K, D, C> &
Chris@16:         basic_ptree<K, D, C>::put_child(const path_type &path,
Chris@16:                                         const self_type &value)
Chris@16:     {
Chris@16:         path_type p(path);
Chris@16:         self_type &parent = force_path(p);
Chris@16:         // Got the parent. Now get the correct child.
Chris@16:         key_type fragment = p.reduce();
Chris@16:         assoc_iterator el = parent.find(fragment);
Chris@16:         // If the new child exists, replace it.
Chris@16:         if(el != parent.not_found()) {
Chris@16:             return el->second = value;
Chris@16:         } else {
Chris@16:             return parent.push_back(value_type(fragment, value))->second;
Chris@16:         }
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     basic_ptree<K, D, C> &
Chris@16:         basic_ptree<K, D, C>::add_child(const path_type &path,
Chris@16:                                         const self_type &value)
Chris@16:     {
Chris@16:         path_type p(path);
Chris@16:         self_type &parent = force_path(p);
Chris@16:         // Got the parent.
Chris@16:         key_type fragment = p.reduce();
Chris@16:         return parent.push_back(value_type(fragment, value))->second;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, class Translator>
Chris@16:     typename boost::enable_if<detail::is_translator<Translator>, Type>::type
Chris@16:     basic_ptree<K, D, C>::get_value(Translator tr) const
Chris@16:     {
Chris@16:         if(boost::optional<Type> o = get_value_optional<Type>(tr)) {
Chris@16:             return *o;
Chris@16:         }
Chris@16:         BOOST_PROPERTY_TREE_THROW(ptree_bad_data(
Chris@16:             std::string("conversion of data to type \"") +
Chris@16:             typeid(Type).name() + "\" failed", data()));
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type> inline
Chris@16:     Type basic_ptree<K, D, C>::get_value() const
Chris@16:     {
Chris@16:         return get_value<Type>(
Chris@16:             typename translator_between<data_type, Type>::type());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, class Translator> inline
Chris@16:     Type basic_ptree<K, D, C>::get_value(const Type &default_value,
Chris@16:                                          Translator tr) const
Chris@16:     {
Chris@16:         return get_value_optional<Type>(tr).get_value_or(default_value);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template <class Ch, class Translator>
Chris@16:     typename boost::enable_if<
Chris@16:         detail::is_character<Ch>,
Chris@16:         std::basic_string<Ch>
Chris@16:     >::type
Chris@16:     basic_ptree<K, D, C>::get_value(const Ch *default_value, Translator tr)const
Chris@16:     {
Chris@16:         return get_value<std::basic_string<Ch>, Translator>(default_value, tr);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type> inline
Chris@16:     typename boost::disable_if<detail::is_translator<Type>, Type>::type
Chris@16:     basic_ptree<K, D, C>::get_value(const Type &default_value) const
Chris@16:     {
Chris@16:         return get_value(default_value,
Chris@16:                          typename translator_between<data_type, Type>::type());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template <class Ch>
Chris@16:     typename boost::enable_if<
Chris@16:         detail::is_character<Ch>,
Chris@16:         std::basic_string<Ch>
Chris@16:     >::type
Chris@16:     basic_ptree<K, D, C>::get_value(const Ch *default_value) const
Chris@16:     {
Chris@16:         return get_value< std::basic_string<Ch> >(default_value);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, class Translator> inline
Chris@16:     optional<Type> basic_ptree<K, D, C>::get_value_optional(
Chris@16:                                                 Translator tr) const
Chris@16:     {
Chris@16:         return tr.get_value(data());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type> inline
Chris@16:     optional<Type> basic_ptree<K, D, C>::get_value_optional() const
Chris@16:     {
Chris@16:         return get_value_optional<Type>(
Chris@16:             typename translator_between<data_type, Type>::type());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, class Translator> inline
Chris@16:     typename boost::enable_if<detail::is_translator<Translator>, Type>::type
Chris@16:     basic_ptree<K, D, C>::get(const path_type &path,
Chris@16:                               Translator tr) const
Chris@16:     {
Chris@16:         return get_child(path).BOOST_NESTED_TEMPLATE get_value<Type>(tr);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type> inline
Chris@16:     Type basic_ptree<K, D, C>::get(const path_type &path) const
Chris@16:     {
Chris@16:         return get_child(path).BOOST_NESTED_TEMPLATE get_value<Type>();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, class Translator> inline
Chris@16:     Type basic_ptree<K, D, C>::get(const path_type &path,
Chris@16:                                    const Type &default_value,
Chris@16:                                    Translator tr) const
Chris@16:     {
Chris@16:         return get_optional<Type>(path, tr).get_value_or(default_value);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template <class Ch, class Translator>
Chris@16:     typename boost::enable_if<
Chris@16:         detail::is_character<Ch>,
Chris@16:         std::basic_string<Ch>
Chris@16:     >::type
Chris@16:     basic_ptree<K, D, C>::get(
Chris@16:         const path_type &path, const Ch *default_value, Translator tr) const
Chris@16:     {
Chris@16:         return get<std::basic_string<Ch>, Translator>(path, default_value, tr);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type> inline
Chris@16:     typename boost::disable_if<detail::is_translator<Type>, Type>::type
Chris@16:     basic_ptree<K, D, C>::get(const path_type &path,
Chris@16:                               const Type &default_value) const
Chris@16:     {
Chris@16:         return get_optional<Type>(path).get_value_or(default_value);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template <class Ch>
Chris@16:     typename boost::enable_if<
Chris@16:         detail::is_character<Ch>,
Chris@16:         std::basic_string<Ch>
Chris@16:     >::type
Chris@16:     basic_ptree<K, D, C>::get(
Chris@16:         const path_type &path, const Ch *default_value) const
Chris@16:     {
Chris@16:         return get< std::basic_string<Ch> >(path, default_value);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, class Translator>
Chris@16:     optional<Type> basic_ptree<K, D, C>::get_optional(const path_type &path,
Chris@16:                                                          Translator tr) const
Chris@16:     {
Chris@16:         if (optional<const self_type&> child = get_child_optional(path))
Chris@16:             return child.get().
Chris@16:                 BOOST_NESTED_TEMPLATE get_value_optional<Type>(tr);
Chris@16:         else
Chris@16:             return optional<Type>();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type>
Chris@16:     optional<Type> basic_ptree<K, D, C>::get_optional(
Chris@16:                                                 const path_type &path) const
Chris@16:     {
Chris@16:         if (optional<const self_type&> child = get_child_optional(path))
Chris@16:             return child.get().BOOST_NESTED_TEMPLATE get_value_optional<Type>();
Chris@16:         else
Chris@16:             return optional<Type>();
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, class Translator>
Chris@16:     void basic_ptree<K, D, C>::put_value(const Type &value, Translator tr)
Chris@16:     {
Chris@16:         if(optional<data_type> o = tr.put_value(value)) {
Chris@16:             data() = *o;
Chris@16:         } else {
Chris@16:             BOOST_PROPERTY_TREE_THROW(ptree_bad_data(
Chris@16:                 std::string("conversion of type \"") + typeid(Type).name() +
Chris@16:                 "\" to data failed", boost::any()));
Chris@16:         }
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type> inline
Chris@16:     void basic_ptree<K, D, C>::put_value(const Type &value)
Chris@16:     {
Chris@16:         put_value(value, typename translator_between<data_type, Type>::type());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, typename Translator>
Chris@16:     basic_ptree<K, D, C> & basic_ptree<K, D, C>::put(
Chris@16:         const path_type &path, const Type &value, Translator tr)
Chris@16:     {
Chris@16:         if(optional<self_type &> child = get_child_optional(path)) {
Chris@16:             child.get().put_value(value, tr);
Chris@16:             return *child;
Chris@16:         } else {
Chris@16:             self_type &child2 = put_child(path, self_type());
Chris@16:             child2.put_value(value, tr);
Chris@16:             return child2;
Chris@16:         }
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type> inline
Chris@16:     basic_ptree<K, D, C> & basic_ptree<K, D, C>::put(
Chris@16:         const path_type &path, const Type &value)
Chris@16:     {
Chris@16:         return put(path, value,
Chris@16:                    typename translator_between<data_type, Type>::type());
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type, typename Translator> inline
Chris@16:     basic_ptree<K, D, C> & basic_ptree<K, D, C>::add(
Chris@16:         const path_type &path, const Type &value, Translator tr)
Chris@16:     {
Chris@16:         self_type &child = add_child(path, self_type());
Chris@16:         child.put_value(value, tr);
Chris@16:         return child;
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     template<class Type> inline
Chris@16:     basic_ptree<K, D, C> & basic_ptree<K, D, C>::add(
Chris@16:         const path_type &path, const Type &value)
Chris@16:     {
Chris@16:         return add(path, value,
Chris@16:                    typename translator_between<data_type, Type>::type());
Chris@16:     }
Chris@16: 
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     basic_ptree<K, D, C> *
Chris@16:     basic_ptree<K, D, C>::walk_path(path_type &p) const
Chris@16:     {
Chris@16:         if(p.empty()) {
Chris@16:             // I'm the child we're looking for.
Chris@16:             return const_cast<basic_ptree*>(this);
Chris@16:         }
Chris@16:         // Recurse down the tree to find the path.
Chris@16:         key_type fragment = p.reduce();
Chris@16:         const_assoc_iterator el = find(fragment);
Chris@16:         if(el == not_found()) {
Chris@16:             // No such child.
Chris@16:             return 0;
Chris@16:         }
Chris@16:         // Not done yet, recurse.
Chris@16:         return el->second.walk_path(p);
Chris@16:     }
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     basic_ptree<K, D, C> & basic_ptree<K, D, C>::force_path(path_type &p)
Chris@16:     {
Chris@16:         BOOST_ASSERT(!p.empty() && "Empty path not allowed for put_child.");
Chris@16:         if(p.single()) {
Chris@16:             // I'm the parent we're looking for.
Chris@16:             return *this;
Chris@16:         }
Chris@16:         key_type fragment = p.reduce();
Chris@16:         assoc_iterator el = find(fragment);
Chris@16:         // If we've found an existing child, go down that path. Else
Chris@16:         // create a new one.
Chris@16:         self_type& child = el == not_found() ?
Chris@16:             push_back(value_type(fragment, self_type()))->second : el->second;
Chris@16:         return child.force_path(p);
Chris@16:     }
Chris@16: 
Chris@16:     // Free functions
Chris@16: 
Chris@16:     template<class K, class D, class C>
Chris@16:     inline void swap(basic_ptree<K, D, C> &pt1, basic_ptree<K, D, C> &pt2)
Chris@16:     {
Chris@16:         pt1.swap(pt2);
Chris@16:     }
Chris@16: 
Chris@16: } }
Chris@16: 
Chris@16: #if defined(BOOST_PROPERTY_TREE_PAIR_BUG)
Chris@16: #undef BOOST_PROPERTY_TREE_PAIR_BUG
Chris@16: #endif
Chris@16: 
Chris@16: #endif