[thirdparty/gcc.git] / libstdc++-v3 / include / ext / pb_ds / detail / ov_tree_map_ / ov_tree_map_.hpp

// -*- C++ -*-

// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the terms
// of the GNU General Public License as published by the Free Software
// Foundation; either version 3, or (at your option) any later
// version.

// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.

// Permission to use, copy, modify, sell, and distribute this software
// is hereby granted without fee, provided that the above copyright
// notice appears in all copies, and that both that copyright notice
// and this permission notice appear in supporting documentation. None
// of the above authors, nor IBM Haifa Research Laboratories, make any
// representation about the suitability of this software for any
// purpose. It is provided "as is" without express or implied
// warranty.

/**
 * @file ov_tree_map_.hpp
 * Contains an implementation class for ov_tree_.
 */

#include <map>
#include <set>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/eq_fn/eq_by_less.hpp>
#include <ext/pb_ds/detail/types_traits.hpp>
#include <ext/pb_ds/detail/debug_map_base.hpp>
#include <ext/pb_ds/detail/type_utils.hpp>
#include <ext/pb_ds/exception.hpp>
#include <ext/pb_ds/detail/tree_trace_base.hpp>
#include <utility>
#include <functional>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <debug/debug.h>

namespace __gnu_pbds
{
  namespace detail
  {
#define PB_DS_CLASS_T_DEC \
    template<typename Key, typename Mapped, class Cmp_Fn, \
	     class Node_And_It_Traits, class Allocator>

#ifdef PB_DS_DATA_TRUE_INDICATOR
#define PB_DS_OV_TREE_CLASS_NAME ov_tree_data_
#endif 

#ifdef PB_DS_DATA_FALSE_INDICATOR
#define PB_DS_OV_TREE_CLASS_NAME ov_tree_no_data_
#endif 

#ifdef PB_DS_DATA_TRUE_INDICATOR
#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_const_node_iterator_data_
#else 
#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_const_node_iterator_no_data_
#endif 

#define PB_DS_CLASS_C_DEC \
   PB_DS_OV_TREE_CLASS_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, Allocator>

#define PB_DS_TYPES_TRAITS_C_DEC \
    types_traits<Key, Mapped, Allocator, false>

#ifdef _GLIBCXX_DEBUG
#define PB_DS_DEBUG_MAP_BASE_C_DEC \
    debug_map_base<Key, eq_by_less<Key, Cmp_Fn>, \
       	typename Allocator::template rebind<Key>::other::const_reference>
#endif 

#ifdef PB_DS_DATA_TRUE_INDICATOR
#define PB_DS_V2F(X) (X).first
#define PB_DS_V2S(X) (X).second
#define PB_DS_EP2VP(X)& ((X)->m_value)
#endif 

#ifdef PB_DS_DATA_FALSE_INDICATOR
#define PB_DS_V2F(X) (X)
#define PB_DS_V2S(X) Mapped_Data()
#define PB_DS_EP2VP(X)& ((X)->m_value.first)
#endif 

#ifdef PB_DS_TREE_TRACE
#define PB_DS_TREE_TRACE_BASE_C_DEC \
    tree_trace_base<typename Node_And_It_Traits::const_node_iterator, \
		    typename Node_And_It_Traits::node_iterator, \
		    Cmp_Fn, false, Allocator>
#endif 

    // Ordered-vector tree associative-container.
    template<typename Key, typename Mapped, class Cmp_Fn,
	     class Node_And_It_Traits, class Allocator>
    class PB_DS_OV_TREE_CLASS_NAME :
#ifdef _GLIBCXX_DEBUG
      protected PB_DS_DEBUG_MAP_BASE_C_DEC,
#endif 
#ifdef PB_DS_TREE_TRACE
      public PB_DS_TREE_TRACE_BASE_C_DEC,
#endif 
      public Cmp_Fn,
      public Node_And_It_Traits::node_update,
      public PB_DS_TYPES_TRAITS_C_DEC
    {
    private:
      typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;

      typedef typename remove_const<typename traits_base::value_type>::type non_const_value_type;

      typedef typename Allocator::template rebind<non_const_value_type>::other value_allocator;
      typedef typename value_allocator::pointer value_vector;


      typedef Cmp_Fn cmp_fn_base;

#ifdef _GLIBCXX_DEBUG
      typedef PB_DS_DEBUG_MAP_BASE_C_DEC debug_base;
#endif 

      typedef typename traits_base::pointer mapped_pointer_;
      typedef typename traits_base::const_pointer const_mapped_pointer_;

      typedef typename Node_And_It_Traits::metadata_type metadata_type;

      typedef typename Allocator::template rebind<metadata_type>::other metadata_allocator;
      typedef typename metadata_allocator::pointer metadata_pointer;
      typedef typename metadata_allocator::const_reference const_metadata_reference;
      typedef typename metadata_allocator::reference metadata_reference;

      typedef
      typename Node_And_It_Traits::null_node_update_pointer
      null_node_update_pointer;

    public:

      typedef Allocator allocator_type;
      typedef typename Allocator::size_type size_type;
      typedef typename Allocator::difference_type difference_type;

      typedef Cmp_Fn cmp_fn;

      typedef typename Node_And_It_Traits::node_update node_update;

      typedef typename traits_base::key_type key_type;
      typedef typename traits_base::key_pointer key_pointer;
      typedef typename traits_base::const_key_pointer const_key_pointer;
      typedef typename traits_base::key_reference key_reference;
      typedef typename traits_base::const_key_reference const_key_reference;
      typedef typename traits_base::mapped_type mapped_type;
      typedef typename traits_base::mapped_pointer mapped_pointer;
      typedef typename traits_base::const_mapped_pointer const_mapped_pointer;
      typedef typename traits_base::mapped_reference mapped_reference;
      typedef typename traits_base::const_mapped_reference const_mapped_reference;
      typedef typename traits_base::value_type value_type;
      typedef typename traits_base::pointer pointer;
      typedef typename traits_base::const_pointer const_pointer;
      typedef typename traits_base::reference reference;
      typedef typename traits_base::const_reference const_reference;

      typedef const_pointer const_point_iterator;

#ifdef PB_DS_DATA_TRUE_INDICATOR
      typedef pointer point_iterator;
#else 
      typedef const_point_iterator point_iterator;
#endif 

      typedef const_point_iterator const_iterator;

      typedef point_iterator iterator;

#include <ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp>

      typedef
      typename Node_And_It_Traits::const_node_iterator
      const_node_iterator;

      typedef typename Node_And_It_Traits::node_iterator node_iterator;

    public:

      PB_DS_OV_TREE_CLASS_NAME();

      PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn&);

      PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn&, const node_update&);

      PB_DS_OV_TREE_CLASS_NAME(const PB_DS_CLASS_C_DEC&);

      ~PB_DS_OV_TREE_CLASS_NAME();

      void
      swap(PB_DS_CLASS_C_DEC&);

      template<typename It>
      void
      copy_from_range(It, It);

      inline size_type
      max_size() const;

      inline bool
      empty() const;

      inline size_type
      size() const;

      Cmp_Fn& 
      get_cmp_fn();

      const Cmp_Fn& 
      get_cmp_fn() const;

      inline mapped_reference
      operator[](const_key_reference r_key)
      {
#ifdef PB_DS_DATA_TRUE_INDICATOR
	_GLIBCXX_DEBUG_ONLY(assert_valid();)
	point_iterator it = lower_bound(r_key);
	if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
	  {
	    _GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(r_key));
	    _GLIBCXX_DEBUG_ONLY(assert_valid();)
	     return it->second;
	  }

	_GLIBCXX_DEBUG_ONLY(assert_valid();)
	return (insert_new_val(it, std::make_pair(r_key, mapped_type()))->second);
#else 
	insert(r_key);
	return traits_base::s_null_mapped;
#endif 
      }

      inline std::pair<point_iterator, bool>
      insert(const_reference r_value)
      {
	_GLIBCXX_DEBUG_ONLY(assert_valid();)
	const_key_reference r_key = PB_DS_V2F(r_value);
	point_iterator it = lower_bound(r_key);

	if (it != end()&&  !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
	  {
	    _GLIBCXX_DEBUG_ONLY(assert_valid();)
	    _GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(r_key));
	    return std::make_pair(it, false);
	  }

	_GLIBCXX_DEBUG_ONLY(assert_valid();)
	return std::make_pair(insert_new_val(it, r_value), true);
      }

      inline point_iterator
      lower_bound(const_key_reference r_key)
      {
	pointer it = m_a_values;
	pointer e_it = m_a_values + m_size;
	while (it != e_it)
	  {
	    pointer mid_it = it + ((e_it - it) >> 1);
	    if (cmp_fn_base::operator()(PB_DS_V2F(*mid_it), r_key))
	      it = ++mid_it;
	    else
	      e_it = mid_it;
	  }
	return it;
      }

      inline const_point_iterator
      lower_bound(const_key_reference r_key) const
      { return const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key); }

      inline point_iterator
      upper_bound(const_key_reference r_key)
      {
	iterator pot_it = lower_bound(r_key);
	if (pot_it != end()&&  !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
	  {
	    _GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(r_key));
	    return ++pot_it;
	  }

	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(r_key));
	return pot_it;
      }

      inline const_point_iterator
      upper_bound(const_key_reference r_key) const
      { return const_cast<PB_DS_CLASS_C_DEC&>(*this).upper_bound(r_key); }

      inline point_iterator
      find(const_key_reference r_key)
      {
	_GLIBCXX_DEBUG_ONLY(assert_valid();)
	iterator pot_it = lower_bound(r_key);
	if (pot_it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
	  {
	    _GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(r_key));
	    return pot_it;
	  }

	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(r_key));
	return end();
      }

      inline const_point_iterator
      find(const_key_reference r_key) const
      { return (const_cast<PB_DS_CLASS_C_DEC& >(*this).find(r_key)); }

      bool
      erase(const_key_reference);

      template<typename Pred>
      inline size_type
      erase_if(Pred);

      inline iterator
      erase(iterator it)
      { return erase_imp<iterator>(it); }

      void
      clear();

      void
      join(PB_DS_CLASS_C_DEC&);

      void
      split(const_key_reference, PB_DS_CLASS_C_DEC&);

      inline iterator
      begin()
      { return m_a_values; }

      inline const_iterator
      begin() const
      { return m_a_values; }

      inline iterator
      end()
      { return m_end_it; }

      inline const_iterator
      end() const
      { return m_end_it; }

      inline const_node_iterator
      node_begin() const;

      inline const_node_iterator
      node_end() const;

      inline node_iterator
      node_begin();

      inline node_iterator
      node_end();

    private:

      inline void
      update(node_iterator /*it*/, null_node_update_pointer);

      template<typename Node_Update>
      void
      update(node_iterator, Node_Update*);

      void
      reallocate_metadata(null_node_update_pointer, size_type);

      template<typename Node_Update_>
      void
      reallocate_metadata(Node_Update_*, size_type);

      template<typename It>
      void
      copy_from_ordered_range(It, It);

      void
      value_swap(PB_DS_CLASS_C_DEC&);

      template<typename It>
      void
      copy_from_ordered_range(It, It, It, It);

      template<typename Ptr>
      inline static Ptr
      mid_pointer(Ptr p_begin, Ptr p_end)
      {
	_GLIBCXX_DEBUG_ASSERT(p_end >= p_begin);
	return (p_begin + (p_end - p_begin) / 2);
      }

      inline iterator
      insert_new_val(iterator it, const_reference r_value)
      {
	_GLIBCXX_DEBUG_ONLY(assert_valid();)
#ifdef PB_DS_REGRESSION
	  typename Allocator::group_adjustor adjust(m_size);
#endif 

	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(PB_DS_V2F(r_value)));

	value_vector a_values = s_value_alloc.allocate(m_size + 1);

	iterator source_it = begin();
	iterator source_end_it = end();
	iterator target_it = a_values;
	iterator ret_it;

	cond_dtor<size_type> cd(a_values, target_it, m_size + 1);
	while (source_it != it)
	  {
	    new (const_cast<void* >(static_cast<const void* >(target_it)))
	      value_type(*source_it++);
	    ++target_it;
	  }

	new (const_cast<void* >(static_cast<const void* >(ret_it = target_it)))
	  value_type(r_value);
	++target_it;

	while (source_it != source_end_it)
	  {
	    new (const_cast<void* >(static_cast<const void* >(target_it)))
	      value_type(*source_it++);
	    ++target_it;
	  }

	reallocate_metadata((node_update* )this, m_size + 1);
	cd.set_no_action();
	if (m_size != 0)
	  {
	    cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size);
	  }

	++m_size;
	m_a_values = a_values;
	m_end_it = m_a_values + m_size;
	_GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_value)));
	update(node_begin(), (node_update* )this);
	_GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
	return ret_it;
      }

#ifdef _GLIBCXX_DEBUG
      void
      assert_valid() const;

      void
      assert_iterators() const;
#endif 

      template<typename It>
      It
      erase_imp(It it);

      inline const_node_iterator
      PB_DS_node_begin_imp() const;

      inline const_node_iterator
      PB_DS_node_end_imp() const;

      inline node_iterator
      PB_DS_node_begin_imp();

      inline node_iterator
      PB_DS_node_end_imp();

    private:
      static value_allocator s_value_alloc;
      static metadata_allocator s_metadata_alloc;

      value_vector m_a_values;
      metadata_pointer m_a_metadata;
      iterator m_end_it;
      size_type m_size;
    };

#include <ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp>
#include <ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp>
#include <ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp>
#include <ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp>
#include <ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp>
#include <ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp>
#include <ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp>
#include <ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp>

#undef PB_DS_CLASS_C_DEC
#undef PB_DS_CLASS_T_DEC
#undef PB_DS_OV_TREE_CLASS_NAME
#undef PB_DS_TYPES_TRAITS_C_DEC
#undef PB_DS_DEBUG_MAP_BASE_C_DEC
#ifdef PB_DS_TREE_TRACE
#undef PB_DS_TREE_TRACE_BASE_C_DEC
#endif 

#undef PB_DS_V2F
#undef PB_DS_EP2VP
#undef PB_DS_V2S
#undef PB_DS_CONST_NODE_ITERATOR_NAME

  } // namespace detail
} // namespace __gnu_pbds
Commit	Line	Data
4569a895 AT	1	// -- C++ --
4569a895 AT	2
748086b7	3	// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
4569a895 AT	4	//
	5	// This file is part of the GNU ISO C++ Library. This library is free
	6	// software; you can redistribute it and/or modify it under the terms
	7	// of the GNU General Public License as published by the Free Software
748086b7	8	// Foundation; either version 3, or (at your option) any later
4569a895 AT	9	// version.
	10
	11	// This library is distributed in the hope that it will be useful, but
	12	// WITHOUT ANY WARRANTY; without even the implied warranty of
	13	// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	14	// General Public License for more details.
	15
748086b7 JJ	16	// Under Section 7 of GPL version 3, you are granted additional
	17	// permissions described in the GCC Runtime Library Exception, version
	18	// 3.1, as published by the Free Software Foundation.
4569a895	19
748086b7 JJ	20	// You should have received a copy of the GNU General Public License and
	21	// a copy of the GCC Runtime Library Exception along with this program;
	22	// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
	23	// <http://www.gnu.org/licenses/>.
4569a895 AT	24
	25	// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
	26
	27	// Permission to use, copy, modify, sell, and distribute this software
	28	// is hereby granted without fee, provided that the above copyright
	29	// notice appears in all copies, and that both that copyright notice
	30	// and this permission notice appear in supporting documentation. None
	31	// of the above authors, nor IBM Haifa Research Laboratories, make any
	32	// representation about the suitability of this software for any
	33	// purpose. It is provided "as is" without express or implied
	34	// warranty.
	35
	36	/**
	37	* @file ov_tree_map_.hpp
	38	* Contains an implementation class for ov_tree_.
	39	*/
	40
	41	#include <map>
	42	#include <set>
	43	#include <ext/pb_ds/tree_policy.hpp>
	44	#include <ext/pb_ds/detail/eq_fn/eq_by_less.hpp>
	45	#include <ext/pb_ds/detail/types_traits.hpp>
551fe1a2	46	#include <ext/pb_ds/detail/debug_map_base.hpp>
4569a895 AT	47	#include <ext/pb_ds/detail/type_utils.hpp>
	48	#include <ext/pb_ds/exception.hpp>
	49	#include <ext/pb_ds/detail/tree_trace_base.hpp>
	50	#include <utility>
	51	#include <functional>
	52	#include <algorithm>
	53	#include <vector>
	54	#include <assert.h>
47bea7b8	55	#include <debug/debug.h>
4569a895	56
5e11f978	57	namespace __gnu_pbds
4569a895 AT	58	{
	59	namespace detail
	60	{
47bea7b8 BK	61	#define PB_DS_CLASS_T_DEC \
	62	template<typename Key, typename Mapped, class Cmp_Fn, \
	63	class Node_And_It_Traits, class Allocator>
4569a895 AT	64
4569a895 AT	65	#ifdef PB_DS_DATA_TRUE_INDICATOR
47bea7b8 BK	66	#define PB_DS_OV_TREE_CLASS_NAME ov_tree_data_
47bea7b8 BK	67	#endif
4569a895 AT	68
4569a895 AT	69	#ifdef PB_DS_DATA_FALSE_INDICATOR
47bea7b8 BK	70	#define PB_DS_OV_TREE_CLASS_NAME ov_tree_no_data_
47bea7b8 BK	71	#endif
4569a895 AT	72
	73	#ifdef PB_DS_DATA_TRUE_INDICATOR
	74	#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_const_node_iterator_data_
47bea7b8	75	#else
4569a895	76	#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_const_node_iterator_no_data_
47bea7b8 BK	77	#endif
	78
	79	#define PB_DS_CLASS_C_DEC \
	80	PB_DS_OV_TREE_CLASS_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, Allocator>
	81
	82	#define PB_DS_TYPES_TRAITS_C_DEC \
	83	types_traits<Key, Mapped, Allocator, false>
	84
	85	#ifdef _GLIBCXX_DEBUG
551fe1a2 BK	86	#define PB_DS_DEBUG_MAP_BASE_C_DEC \
551fe1a2 BK	87	debug_map_base<Key, eq_by_less<Key, Cmp_Fn>, \
47bea7b8 BK	88	typename Allocator::template rebind<Key>::other::const_reference>
47bea7b8 BK	89	#endif
4569a895 AT	90
	91	#ifdef PB_DS_DATA_TRUE_INDICATOR
	92	#define PB_DS_V2F(X) (X).first
	93	#define PB_DS_V2S(X) (X).second
	94	#define PB_DS_EP2VP(X)& ((X)->m_value)
47bea7b8	95	#endif
4569a895 AT	96
	97	#ifdef PB_DS_DATA_FALSE_INDICATOR
	98	#define PB_DS_V2F(X) (X)
	99	#define PB_DS_V2S(X) Mapped_Data()
	100	#define PB_DS_EP2VP(X)& ((X)->m_value.first)
47bea7b8	101	#endif
4569a895 AT	102
4569a895 AT	103	#ifdef PB_DS_TREE_TRACE
47bea7b8 BK	104	#define PB_DS_TREE_TRACE_BASE_C_DEC \
	105	tree_trace_base<typename Node_And_It_Traits::const_node_iterator, \
	106	typename Node_And_It_Traits::node_iterator, \
	107	Cmp_Fn, false, Allocator>
	108	#endif
4569a895 AT	109
4569a895 AT	110	// Ordered-vector tree associative-container.
47bea7b8 BK	111	template<typename Key, typename Mapped, class Cmp_Fn,
47bea7b8 BK	112	class Node_And_It_Traits, class Allocator>
4569a895	113	class PB_DS_OV_TREE_CLASS_NAME :
47bea7b8	114	#ifdef _GLIBCXX_DEBUG
551fe1a2	115	protected PB_DS_DEBUG_MAP_BASE_C_DEC,
47bea7b8	116	#endif
4569a895 AT	117	#ifdef PB_DS_TREE_TRACE
4569a895 AT	118	public PB_DS_TREE_TRACE_BASE_C_DEC,
47bea7b8	119	#endif
4569a895 AT	120	public Cmp_Fn,
	121	public Node_And_It_Traits::node_update,
	122	public PB_DS_TYPES_TRAITS_C_DEC
	123	{
4569a895	124	private:
1b24692f	125	typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;
4569a895	126
1b24692f	127	typedef typename remove_const<typename traits_base::value_type>::type non_const_value_type;
4569a895	128
1b24692f	129	typedef typename Allocator::template rebind<non_const_value_type>::other value_allocator;
4569a895 AT	130	typedef typename value_allocator::pointer value_vector;
4569a895 AT	131
4569a895 AT	132
	133	typedef Cmp_Fn cmp_fn_base;
	134
47bea7b8	135	#ifdef _GLIBCXX_DEBUG
551fe1a2	136	typedef PB_DS_DEBUG_MAP_BASE_C_DEC debug_base;
47bea7b8	137	#endif
4569a895	138
1b24692f BK	139	typedef typename traits_base::pointer mapped_pointer_;
1b24692f BK	140	typedef typename traits_base::const_pointer const_mapped_pointer_;
4569a895 AT	141
	142	typedef typename Node_And_It_Traits::metadata_type metadata_type;
	143
1b24692f	144	typedef typename Allocator::template rebind<metadata_type>::other metadata_allocator;
4569a895	145	typedef typename metadata_allocator::pointer metadata_pointer;
1b24692f	146	typedef typename metadata_allocator::const_reference const_metadata_reference;
4569a895 AT	147	typedef typename metadata_allocator::reference metadata_reference;
	148
	149	typedef
	150	typename Node_And_It_Traits::null_node_update_pointer
	151	null_node_update_pointer;
	152
	153	public:
	154
b67758fe	155	typedef Allocator allocator_type;
4569a895	156	typedef typename Allocator::size_type size_type;
4569a895 AT	157	typedef typename Allocator::difference_type difference_type;
	158
	159	typedef Cmp_Fn cmp_fn;
	160
	161	typedef typename Node_And_It_Traits::node_update node_update;
	162
1b24692f BK	163	typedef typename traits_base::key_type key_type;
	164	typedef typename traits_base::key_pointer key_pointer;
	165	typedef typename traits_base::const_key_pointer const_key_pointer;
	166	typedef typename traits_base::key_reference key_reference;
	167	typedef typename traits_base::const_key_reference const_key_reference;
	168	typedef typename traits_base::mapped_type mapped_type;
	169	typedef typename traits_base::mapped_pointer mapped_pointer;
	170	typedef typename traits_base::const_mapped_pointer const_mapped_pointer;
	171	typedef typename traits_base::mapped_reference mapped_reference;
	172	typedef typename traits_base::const_mapped_reference const_mapped_reference;
	173	typedef typename traits_base::value_type value_type;
	174	typedef typename traits_base::pointer pointer;
	175	typedef typename traits_base::const_pointer const_pointer;
	176	typedef typename traits_base::reference reference;
	177	typedef typename traits_base::const_reference const_reference;
4569a895 AT	178
	179	typedef const_pointer const_point_iterator;
	180
	181	#ifdef PB_DS_DATA_TRUE_INDICATOR
	182	typedef pointer point_iterator;
47bea7b8	183	#else
4569a895	184	typedef const_point_iterator point_iterator;
47bea7b8	185	#endif
4569a895 AT	186
	187	typedef const_point_iterator const_iterator;
	188
	189	typedef point_iterator iterator;
	190
	191	#include <ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp>
	192
	193	typedef
	194	typename Node_And_It_Traits::const_node_iterator
	195	const_node_iterator;
	196
	197	typedef typename Node_And_It_Traits::node_iterator node_iterator;
	198
	199	public:
	200
	201	PB_DS_OV_TREE_CLASS_NAME();
	202
1b24692f	203	PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn&);
4569a895	204
1b24692f	205	PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn&, const node_update&);
4569a895	206
1b24692f	207	PB_DS_OV_TREE_CLASS_NAME(const PB_DS_CLASS_C_DEC&);
4569a895 AT	208
	209	~PB_DS_OV_TREE_CLASS_NAME();
	210
	211	void
1b24692f	212	swap(PB_DS_CLASS_C_DEC&);
4569a895 AT	213
	214	template<typename It>
	215	void
1b24692f	216	copy_from_range(It, It);
4569a895 AT	217
	218	inline size_type
	219	max_size() const;
	220
	221	inline bool
	222	empty() const;
	223
	224	inline size_type
	225	size() const;
	226
	227	Cmp_Fn&
	228	get_cmp_fn();
	229
	230	const Cmp_Fn&
	231	get_cmp_fn() const;
	232
	233	inline mapped_reference
	234	operator[](const_key_reference r_key)
	235	{
	236	#ifdef PB_DS_DATA_TRUE_INDICATOR
47bea7b8 BK	237	_GLIBCXX_DEBUG_ONLY(assert_valid();)
	238	point_iterator it = lower_bound(r_key);
	239	if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
4569a895	240	{
551fe1a2	241	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(r_key));
47bea7b8 BK	242	_GLIBCXX_DEBUG_ONLY(assert_valid();)
47bea7b8 BK	243	return it->second;
4569a895 AT	244	}
4569a895 AT	245
47bea7b8 BK	246	_GLIBCXX_DEBUG_ONLY(assert_valid();)
	247	return (insert_new_val(it, std::make_pair(r_key, mapped_type()))->second);
	248	#else
4569a895	249	insert(r_key);
47bea7b8 BK	250	return traits_base::s_null_mapped;
47bea7b8 BK	251	#endif
4569a895 AT	252	}
	253
	254	inline std::pair<point_iterator, bool>
	255	insert(const_reference r_value)
	256	{
47bea7b8 BK	257	_GLIBCXX_DEBUG_ONLY(assert_valid();)
47bea7b8 BK	258	const_key_reference r_key = PB_DS_V2F(r_value);
4569a895 AT	259	point_iterator it = lower_bound(r_key);
4569a895 AT	260
47bea7b8	261	if (it != end()&& !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
4569a895	262	{
47bea7b8	263	_GLIBCXX_DEBUG_ONLY(assert_valid();)
551fe1a2	264	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(r_key));
47bea7b8	265	return std::make_pair(it, false);
4569a895 AT	266	}
4569a895 AT	267
47bea7b8 BK	268	_GLIBCXX_DEBUG_ONLY(assert_valid();)
47bea7b8 BK	269	return std::make_pair(insert_new_val(it, r_value), true);
4569a895 AT	270	}
	271
	272	inline point_iterator
	273	lower_bound(const_key_reference r_key)
	274	{
	275	pointer it = m_a_values;
4569a895	276	pointer e_it = m_a_values + m_size;
4569a895 AT	277	while (it != e_it)
	278	{
	279	pointer mid_it = it + ((e_it - it) >> 1);
47bea7b8	280	if (cmp_fn_base::operator()(PB_DS_V2F(*mid_it), r_key))
4569a895 AT	281	it = ++mid_it;
	282	else
	283	e_it = mid_it;
	284	}
47bea7b8	285	return it;
4569a895 AT	286	}
	287
	288	inline const_point_iterator
	289	lower_bound(const_key_reference r_key) const
1b24692f	290	{ return const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key); }
4569a895 AT	291
	292	inline point_iterator
	293	upper_bound(const_key_reference r_key)
	294	{
	295	iterator pot_it = lower_bound(r_key);
47bea7b8	296	if (pot_it != end()&& !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
4569a895	297	{
551fe1a2	298	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(r_key));
3441f106	299	return ++pot_it;
4569a895 AT	300	}
4569a895 AT	301
551fe1a2	302	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(r_key));
47bea7b8	303	return pot_it;
4569a895 AT	304	}
	305
	306	inline const_point_iterator
	307	upper_bound(const_key_reference r_key) const
3441f106	308	{ return const_cast<PB_DS_CLASS_C_DEC&>(*this).upper_bound(r_key); }
4569a895 AT	309
	310	inline point_iterator
	311	find(const_key_reference r_key)
	312	{
47bea7b8 BK	313	_GLIBCXX_DEBUG_ONLY(assert_valid();)
47bea7b8 BK	314	iterator pot_it = lower_bound(r_key);
3441f106	315	if (pot_it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
4569a895	316	{
551fe1a2	317	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(r_key));
3441f106	318	return pot_it;
4569a895 AT	319	}
4569a895 AT	320
551fe1a2	321	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(r_key));
47bea7b8	322	return end();
4569a895 AT	323	}
	324
	325	inline const_point_iterator
	326	find(const_key_reference r_key) const
47bea7b8	327	{ return (const_cast<PB_DS_CLASS_C_DEC& >(*this).find(r_key)); }
4569a895 AT	328
4569a895 AT	329	bool
1b24692f	330	erase(const_key_reference);
4569a895 AT	331
	332	template<typename Pred>
	333	inline size_type
1b24692f	334	erase_if(Pred);
4569a895 AT	335
	336	inline iterator
	337	erase(iterator it)
47bea7b8	338	{ return erase_imp<iterator>(it); }
4569a895 AT	339
	340	void
	341	clear();
	342
	343	void
1b24692f	344	join(PB_DS_CLASS_C_DEC&);
4569a895 AT	345
4569a895 AT	346	void
1b24692f	347	split(const_key_reference, PB_DS_CLASS_C_DEC&);
4569a895 AT	348
	349	inline iterator
	350	begin()
47bea7b8	351	{ return m_a_values; }
4569a895 AT	352
	353	inline const_iterator
	354	begin() const
47bea7b8	355	{ return m_a_values; }
4569a895 AT	356
	357	inline iterator
	358	end()
47bea7b8	359	{ return m_end_it; }
4569a895 AT	360
	361	inline const_iterator
	362	end() const
47bea7b8	363	{ return m_end_it; }
4569a895 AT	364
	365	inline const_node_iterator
	366	node_begin() const;
	367
	368	inline const_node_iterator
	369	node_end() const;
	370
	371	inline node_iterator
	372	node_begin();
	373
	374	inline node_iterator
	375	node_end();
	376
	377	private:
	378
	379	inline void
	380	update(node_iterator /it/, null_node_update_pointer);
	381
	382	template<typename Node_Update>
	383	void
1b24692f	384	update(node_iterator, Node_Update*);
4569a895 AT	385
	386	void
	387	reallocate_metadata(null_node_update_pointer, size_type);
	388
	389	template<typename Node_Update_>
	390	void
1b24692f	391	reallocate_metadata(Node_Update_*, size_type);
4569a895 AT	392
	393	template<typename It>
	394	void
1b24692f	395	copy_from_ordered_range(It, It);
4569a895 AT	396
4569a895 AT	397	void
1b24692f	398	value_swap(PB_DS_CLASS_C_DEC&);
4569a895 AT	399
	400	template<typename It>
	401	void
1b24692f	402	copy_from_ordered_range(It, It, It, It);
4569a895 AT	403
	404	template<typename Ptr>
	405	inline static Ptr
	406	mid_pointer(Ptr p_begin, Ptr p_end)
	407	{
47bea7b8	408	_GLIBCXX_DEBUG_ASSERT(p_end >= p_begin);
4569a895 AT	409	return (p_begin + (p_end - p_begin) / 2);
	410	}
	411
	412	inline iterator
	413	insert_new_val(iterator it, const_reference r_value)
	414	{
47bea7b8	415	_GLIBCXX_DEBUG_ONLY(assert_valid();)
4569a895	416	#ifdef PB_DS_REGRESSION
5580c6e7	417	typename Allocator::group_adjustor adjust(m_size);
47bea7b8	418	#endif
4569a895	419
551fe1a2	420	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(PB_DS_V2F(r_value)));
4569a895 AT	421
	422	value_vector a_values = s_value_alloc.allocate(m_size + 1);
	423
	424	iterator source_it = begin();
	425	iterator source_end_it = end();
	426	iterator target_it = a_values;
	427	iterator ret_it;
	428
	429	cond_dtor<size_type> cd(a_values, target_it, m_size + 1);
4569a895 AT	430	while (source_it != it)
4569a895 AT	431	{
47bea7b8	432	new (const_cast<void* >(static_cast<const void* >(target_it)))
4569a895	433	value_type(*source_it++);
4569a895 AT	434	++target_it;
	435	}
	436
47bea7b8	437	new (const_cast<void* >(static_cast<const void* >(ret_it = target_it)))
4569a895	438	value_type(r_value);
4569a895 AT	439	++target_it;
	440
	441	while (source_it != source_end_it)
	442	{
47bea7b8	443	new (const_cast<void* >(static_cast<const void* >(target_it)))
4569a895	444	value_type(*source_it++);
4569a895 AT	445	++target_it;
	446	}
	447
	448	reallocate_metadata((node_update* )this, m_size + 1);
4569a895	449	cd.set_no_action();
4569a895 AT	450	if (m_size != 0)
	451	{
	452	cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size);
	453	}
	454
	455	++m_size;
4569a895	456	m_a_values = a_values;
4569a895	457	m_end_it = m_a_values + m_size;
551fe1a2	458	_GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_value)));
4569a895	459	update(node_begin(), (node_update* )this);
47bea7b8 BK	460	_GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
47bea7b8 BK	461	return ret_it;
4569a895 AT	462	}
4569a895 AT	463
47bea7b8	464	#ifdef _GLIBCXX_DEBUG
4569a895 AT	465	void
	466	assert_valid() const;
	467
	468	void
	469	assert_iterators() const;
47bea7b8	470	#endif
4569a895 AT	471
	472	template<typename It>
	473	It
	474	erase_imp(It it);
	475
	476	inline const_node_iterator
	477	PB_DS_node_begin_imp() const;
	478
	479	inline const_node_iterator
	480	PB_DS_node_end_imp() const;
	481
	482	inline node_iterator
	483	PB_DS_node_begin_imp();
	484
	485	inline node_iterator
	486	PB_DS_node_end_imp();
	487
	488	private:
4569a895	489	static value_allocator s_value_alloc;
4569a895 AT	490	static metadata_allocator s_metadata_alloc;
4569a895 AT	491
1b24692f BK	492	value_vector m_a_values;
1b24692f BK	493	metadata_pointer m_a_metadata;
4569a895	494	iterator m_end_it;
4569a895 AT	495	size_type m_size;
	496	};
	497
	498	#include <ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp>
	499	#include <ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp>
	500	#include <ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp>
	501	#include <ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp>
	502	#include <ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp>
	503	#include <ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp>
	504	#include <ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp>
	505	#include <ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp>
	506
	507	#undef PB_DS_CLASS_C_DEC
4569a895	508	#undef PB_DS_CLASS_T_DEC
4569a895	509	#undef PB_DS_OV_TREE_CLASS_NAME
4569a895	510	#undef PB_DS_TYPES_TRAITS_C_DEC
551fe1a2	511	#undef PB_DS_DEBUG_MAP_BASE_C_DEC
4569a895 AT	512	#ifdef PB_DS_TREE_TRACE
4569a895 AT	513	#undef PB_DS_TREE_TRACE_BASE_C_DEC
47bea7b8	514	#endif
4569a895 AT	515
	516	#undef PB_DS_V2F
	517	#undef PB_DS_EP2VP
	518	#undef PB_DS_V2S
4569a895 AT	519	#undef PB_DS_CONST_NODE_ITERATOR_NAME
	520
	521	} // namespace detail
5e11f978	522	} // namespace __gnu_pbds