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

// -*- C++ -*-

// Copyright (C) 2005, 2006, 2009, 2011 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

#define PB_DS_ASSERT_VALID(X)						\
  _GLIBCXX_DEBUG_ONLY(X.assert_valid(__FILE__, __LINE__);)

#define PB_DS_CHECK_KEY_EXISTS(_Key)					\
  _GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(_Key, __FILE__, __LINE__);)

#define PB_DS_CHECK_KEY_DOES_NOT_EXIST(_Key)				\
  _GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(_Key,	\
							   __FILE__, __LINE__);)

    // 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
	PB_DS_ASSERT_VALID((*this))
	point_iterator it = lower_bound(r_key);
	if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
	  {
	    PB_DS_CHECK_KEY_EXISTS(r_key)
	    PB_DS_ASSERT_VALID((*this))
	     return it->second;
	  }

	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)
      {
	PB_DS_ASSERT_VALID((*this))
	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)))
	  {
	    PB_DS_ASSERT_VALID((*this))
	    PB_DS_CHECK_KEY_EXISTS(r_key)
	    return std::make_pair(it, false);
	  }

	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)))
	  {
	    PB_DS_CHECK_KEY_EXISTS(r_key)
	    return ++pot_it;
	  }

	PB_DS_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)
      {
	PB_DS_ASSERT_VALID((*this))
	iterator pot_it = lower_bound(r_key);
	if (pot_it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
	  {
	    PB_DS_CHECK_KEY_EXISTS(r_key)
	    return pot_it;
	  }

	PB_DS_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)
      {
#ifdef PB_DS_REGRESSION
	  typename Allocator::group_adjustor adjust(m_size);
#endif 

	PB_DS_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);
	PB_DS_ASSERT_VALID((*this))
	return ret_it;
      }

#ifdef _GLIBCXX_DEBUG
      void
      assert_valid(const char* file, int line) const;

      void
      assert_iterators(const char* file, int line) 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;
    };

#define PB_DS_DEBUG_VERIFY(_Cond)					\
  _GLIBCXX_DEBUG_VERIFY_AT(_Cond,					\
			   _M_message(#_Cond" assertion from %1;:%2;")	\
			   ._M_string(__FILE__)._M_integer(__LINE__)	\
			   ,__file,__line)

#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_DEBUG_VERIFY
#undef PB_DS_CHECK_KEY_DOES_NOT_EXIST
#undef PB_DS_CHECK_KEY_EXISTS
#undef PB_DS_ASSERT_VALID
#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
f5886803	3	// Copyright (C) 2005, 2006, 2009, 2011 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	104	#define PB_DS_TREE_TRACE_BASE_C_DEC \
f5886803 FD	105	tree_trace_base<typename Node_And_It_Traits::const_node_iterator, \
f5886803 FD	106	typename Node_And_It_Traits::node_iterator, \
47bea7b8	107	Cmp_Fn, false, Allocator>
f5886803 FD	108	#endif
	109
	110	#define PB_DS_ASSERT_VALID(X) \
	111	_GLIBCXX_DEBUG_ONLY(X.assert_valid(__FILE__, __LINE__);)
	112
	113	#define PB_DS_CHECK_KEY_EXISTS(_Key) \
	114	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(_Key, __FILE__, __LINE__);)
	115
	116	#define PB_DS_CHECK_KEY_DOES_NOT_EXIST(_Key) \
	117	_GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(_Key, \
	118	__FILE__, __LINE__);)
4569a895 AT	119
4569a895 AT	120	// Ordered-vector tree associative-container.
47bea7b8 BK	121	template<typename Key, typename Mapped, class Cmp_Fn,
47bea7b8 BK	122	class Node_And_It_Traits, class Allocator>
4569a895	123	class PB_DS_OV_TREE_CLASS_NAME :
47bea7b8	124	#ifdef _GLIBCXX_DEBUG
551fe1a2	125	protected PB_DS_DEBUG_MAP_BASE_C_DEC,
47bea7b8	126	#endif
4569a895 AT	127	#ifdef PB_DS_TREE_TRACE
4569a895 AT	128	public PB_DS_TREE_TRACE_BASE_C_DEC,
47bea7b8	129	#endif
4569a895 AT	130	public Cmp_Fn,
	131	public Node_And_It_Traits::node_update,
	132	public PB_DS_TYPES_TRAITS_C_DEC
	133	{
4569a895	134	private:
1b24692f	135	typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;
4569a895	136
1b24692f	137	typedef typename remove_const<typename traits_base::value_type>::type non_const_value_type;
4569a895	138
1b24692f	139	typedef typename Allocator::template rebind<non_const_value_type>::other value_allocator;
4569a895 AT	140	typedef typename value_allocator::pointer value_vector;
4569a895 AT	141
4569a895 AT	142
	143	typedef Cmp_Fn cmp_fn_base;
	144
47bea7b8	145	#ifdef _GLIBCXX_DEBUG
551fe1a2	146	typedef PB_DS_DEBUG_MAP_BASE_C_DEC debug_base;
47bea7b8	147	#endif
4569a895	148
1b24692f BK	149	typedef typename traits_base::pointer mapped_pointer_;
1b24692f BK	150	typedef typename traits_base::const_pointer const_mapped_pointer_;
4569a895 AT	151
	152	typedef typename Node_And_It_Traits::metadata_type metadata_type;
	153
1b24692f	154	typedef typename Allocator::template rebind<metadata_type>::other metadata_allocator;
4569a895	155	typedef typename metadata_allocator::pointer metadata_pointer;
1b24692f	156	typedef typename metadata_allocator::const_reference const_metadata_reference;
4569a895 AT	157	typedef typename metadata_allocator::reference metadata_reference;
	158
	159	typedef
	160	typename Node_And_It_Traits::null_node_update_pointer
	161	null_node_update_pointer;
	162
	163	public:
	164
b67758fe	165	typedef Allocator allocator_type;
4569a895	166	typedef typename Allocator::size_type size_type;
4569a895 AT	167	typedef typename Allocator::difference_type difference_type;
	168
	169	typedef Cmp_Fn cmp_fn;
	170
	171	typedef typename Node_And_It_Traits::node_update node_update;
	172
1b24692f BK	173	typedef typename traits_base::key_type key_type;
	174	typedef typename traits_base::key_pointer key_pointer;
	175	typedef typename traits_base::const_key_pointer const_key_pointer;
	176	typedef typename traits_base::key_reference key_reference;
	177	typedef typename traits_base::const_key_reference const_key_reference;
	178	typedef typename traits_base::mapped_type mapped_type;
	179	typedef typename traits_base::mapped_pointer mapped_pointer;
	180	typedef typename traits_base::const_mapped_pointer const_mapped_pointer;
	181	typedef typename traits_base::mapped_reference mapped_reference;
	182	typedef typename traits_base::const_mapped_reference const_mapped_reference;
	183	typedef typename traits_base::value_type value_type;
	184	typedef typename traits_base::pointer pointer;
	185	typedef typename traits_base::const_pointer const_pointer;
	186	typedef typename traits_base::reference reference;
	187	typedef typename traits_base::const_reference const_reference;
4569a895 AT	188
	189	typedef const_pointer const_point_iterator;
	190
	191	#ifdef PB_DS_DATA_TRUE_INDICATOR
	192	typedef pointer point_iterator;
47bea7b8	193	#else
4569a895	194	typedef const_point_iterator point_iterator;
47bea7b8	195	#endif
4569a895 AT	196
	197	typedef const_point_iterator const_iterator;
	198
	199	typedef point_iterator iterator;
	200
	201	#include <ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp>
	202
	203	typedef
	204	typename Node_And_It_Traits::const_node_iterator
	205	const_node_iterator;
	206
	207	typedef typename Node_And_It_Traits::node_iterator node_iterator;
	208
	209	public:
	210
	211	PB_DS_OV_TREE_CLASS_NAME();
	212
1b24692f	213	PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn&);
4569a895	214
1b24692f	215	PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn&, const node_update&);
4569a895	216
1b24692f	217	PB_DS_OV_TREE_CLASS_NAME(const PB_DS_CLASS_C_DEC&);
4569a895 AT	218
	219	~PB_DS_OV_TREE_CLASS_NAME();
	220
	221	void
1b24692f	222	swap(PB_DS_CLASS_C_DEC&);
4569a895 AT	223
	224	template<typename It>
	225	void
1b24692f	226	copy_from_range(It, It);
4569a895 AT	227
	228	inline size_type
	229	max_size() const;
	230
	231	inline bool
	232	empty() const;
	233
	234	inline size_type
	235	size() const;
	236
	237	Cmp_Fn&
	238	get_cmp_fn();
	239
	240	const Cmp_Fn&
	241	get_cmp_fn() const;
	242
	243	inline mapped_reference
	244	operator[](const_key_reference r_key)
	245	{
	246	#ifdef PB_DS_DATA_TRUE_INDICATOR
f5886803	247	PB_DS_ASSERT_VALID((*this))
47bea7b8 BK	248	point_iterator it = lower_bound(r_key);
47bea7b8 BK	249	if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
4569a895	250	{
f5886803 FD	251	PB_DS_CHECK_KEY_EXISTS(r_key)
f5886803 FD	252	PB_DS_ASSERT_VALID((*this))
47bea7b8	253	return it->second;
4569a895 AT	254	}
4569a895 AT	255
47bea7b8 BK	256	return (insert_new_val(it, std::make_pair(r_key, mapped_type()))->second);
47bea7b8 BK	257	#else
4569a895	258	insert(r_key);
47bea7b8 BK	259	return traits_base::s_null_mapped;
47bea7b8 BK	260	#endif
4569a895 AT	261	}
	262
	263	inline std::pair<point_iterator, bool>
	264	insert(const_reference r_value)
	265	{
f5886803	266	PB_DS_ASSERT_VALID((*this))
47bea7b8	267	const_key_reference r_key = PB_DS_V2F(r_value);
4569a895 AT	268	point_iterator it = lower_bound(r_key);
4569a895 AT	269
47bea7b8	270	if (it != end()&& !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
4569a895	271	{
f5886803 FD	272	PB_DS_ASSERT_VALID((*this))
f5886803 FD	273	PB_DS_CHECK_KEY_EXISTS(r_key)
47bea7b8	274	return std::make_pair(it, false);
4569a895 AT	275	}
4569a895 AT	276
47bea7b8	277	return std::make_pair(insert_new_val(it, r_value), true);
4569a895 AT	278	}
	279
	280	inline point_iterator
	281	lower_bound(const_key_reference r_key)
	282	{
	283	pointer it = m_a_values;
4569a895	284	pointer e_it = m_a_values + m_size;
4569a895 AT	285	while (it != e_it)
	286	{
	287	pointer mid_it = it + ((e_it - it) >> 1);
47bea7b8	288	if (cmp_fn_base::operator()(PB_DS_V2F(*mid_it), r_key))
4569a895 AT	289	it = ++mid_it;
	290	else
	291	e_it = mid_it;
	292	}
47bea7b8	293	return it;
4569a895 AT	294	}
	295
	296	inline const_point_iterator
	297	lower_bound(const_key_reference r_key) const
1b24692f	298	{ return const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key); }
4569a895 AT	299
	300	inline point_iterator
	301	upper_bound(const_key_reference r_key)
	302	{
	303	iterator pot_it = lower_bound(r_key);
47bea7b8	304	if (pot_it != end()&& !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
4569a895	305	{
f5886803	306	PB_DS_CHECK_KEY_EXISTS(r_key)
3441f106	307	return ++pot_it;
4569a895 AT	308	}
4569a895 AT	309
f5886803	310	PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
47bea7b8	311	return pot_it;
4569a895 AT	312	}
	313
	314	inline const_point_iterator
	315	upper_bound(const_key_reference r_key) const
3441f106	316	{ return const_cast<PB_DS_CLASS_C_DEC&>(*this).upper_bound(r_key); }
4569a895 AT	317
	318	inline point_iterator
	319	find(const_key_reference r_key)
	320	{
f5886803	321	PB_DS_ASSERT_VALID((*this))
47bea7b8	322	iterator pot_it = lower_bound(r_key);
3441f106	323	if (pot_it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
4569a895	324	{
f5886803	325	PB_DS_CHECK_KEY_EXISTS(r_key)
3441f106	326	return pot_it;
4569a895 AT	327	}
4569a895 AT	328
f5886803	329	PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
47bea7b8	330	return end();
4569a895 AT	331	}
	332
	333	inline const_point_iterator
	334	find(const_key_reference r_key) const
47bea7b8	335	{ return (const_cast<PB_DS_CLASS_C_DEC& >(*this).find(r_key)); }
4569a895 AT	336
4569a895 AT	337	bool
1b24692f	338	erase(const_key_reference);
4569a895 AT	339
	340	template<typename Pred>
	341	inline size_type
1b24692f	342	erase_if(Pred);
4569a895 AT	343
	344	inline iterator
	345	erase(iterator it)
47bea7b8	346	{ return erase_imp<iterator>(it); }
4569a895 AT	347
	348	void
	349	clear();
	350
	351	void
1b24692f	352	join(PB_DS_CLASS_C_DEC&);
4569a895 AT	353
4569a895 AT	354	void
1b24692f	355	split(const_key_reference, PB_DS_CLASS_C_DEC&);
4569a895 AT	356
	357	inline iterator
	358	begin()
47bea7b8	359	{ return m_a_values; }
4569a895 AT	360
	361	inline const_iterator
	362	begin() const
47bea7b8	363	{ return m_a_values; }
4569a895 AT	364
	365	inline iterator
	366	end()
47bea7b8	367	{ return m_end_it; }
4569a895 AT	368
	369	inline const_iterator
	370	end() const
47bea7b8	371	{ return m_end_it; }
4569a895 AT	372
	373	inline const_node_iterator
	374	node_begin() const;
	375
	376	inline const_node_iterator
	377	node_end() const;
	378
	379	inline node_iterator
	380	node_begin();
	381
	382	inline node_iterator
	383	node_end();
	384
	385	private:
	386
	387	inline void
	388	update(node_iterator /it/, null_node_update_pointer);
	389
	390	template<typename Node_Update>
	391	void
1b24692f	392	update(node_iterator, Node_Update*);
4569a895 AT	393
	394	void
	395	reallocate_metadata(null_node_update_pointer, size_type);
	396
	397	template<typename Node_Update_>
	398	void
1b24692f	399	reallocate_metadata(Node_Update_*, size_type);
4569a895 AT	400
	401	template<typename It>
	402	void
1b24692f	403	copy_from_ordered_range(It, It);
4569a895 AT	404
4569a895 AT	405	void
1b24692f	406	value_swap(PB_DS_CLASS_C_DEC&);
4569a895 AT	407
	408	template<typename It>
	409	void
1b24692f	410	copy_from_ordered_range(It, It, It, It);
4569a895 AT	411
	412	template<typename Ptr>
	413	inline static Ptr
	414	mid_pointer(Ptr p_begin, Ptr p_end)
	415	{
47bea7b8	416	_GLIBCXX_DEBUG_ASSERT(p_end >= p_begin);
4569a895 AT	417	return (p_begin + (p_end - p_begin) / 2);
	418	}
	419
	420	inline iterator
	421	insert_new_val(iterator it, const_reference r_value)
	422	{
4569a895	423	#ifdef PB_DS_REGRESSION
5580c6e7	424	typename Allocator::group_adjustor adjust(m_size);
47bea7b8	425	#endif
4569a895	426
f5886803	427	PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value))
4569a895 AT	428
	429	value_vector a_values = s_value_alloc.allocate(m_size + 1);
	430
	431	iterator source_it = begin();
	432	iterator source_end_it = end();
	433	iterator target_it = a_values;
	434	iterator ret_it;
	435
	436	cond_dtor<size_type> cd(a_values, target_it, m_size + 1);
4569a895 AT	437	while (source_it != it)
4569a895 AT	438	{
47bea7b8	439	new (const_cast<void* >(static_cast<const void* >(target_it)))
4569a895	440	value_type(*source_it++);
4569a895 AT	441	++target_it;
	442	}
	443
47bea7b8	444	new (const_cast<void* >(static_cast<const void* >(ret_it = target_it)))
4569a895	445	value_type(r_value);
4569a895 AT	446	++target_it;
	447
	448	while (source_it != source_end_it)
	449	{
47bea7b8	450	new (const_cast<void* >(static_cast<const void* >(target_it)))
4569a895	451	value_type(*source_it++);
4569a895 AT	452	++target_it;
	453	}
	454
	455	reallocate_metadata((node_update* )this, m_size + 1);
4569a895	456	cd.set_no_action();
4569a895 AT	457	if (m_size != 0)
	458	{
	459	cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size);
	460	}
	461
	462	++m_size;
4569a895	463	m_a_values = a_values;
4569a895	464	m_end_it = m_a_values + m_size;
551fe1a2	465	_GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_value)));
4569a895	466	update(node_begin(), (node_update* )this);
f5886803	467	PB_DS_ASSERT_VALID((*this))
47bea7b8	468	return ret_it;
4569a895 AT	469	}
4569a895 AT	470
47bea7b8	471	#ifdef _GLIBCXX_DEBUG
4569a895	472	void
f5886803	473	assert_valid(const char* file, int line) const;
4569a895 AT	474
4569a895 AT	475	void
f5886803	476	assert_iterators(const char* file, int line) const;
47bea7b8	477	#endif
4569a895 AT	478
	479	template<typename It>
	480	It
	481	erase_imp(It it);
	482
	483	inline const_node_iterator
	484	PB_DS_node_begin_imp() const;
	485
	486	inline const_node_iterator
	487	PB_DS_node_end_imp() const;
	488
	489	inline node_iterator
	490	PB_DS_node_begin_imp();
	491
	492	inline node_iterator
	493	PB_DS_node_end_imp();
	494
	495	private:
4569a895	496	static value_allocator s_value_alloc;
4569a895 AT	497	static metadata_allocator s_metadata_alloc;
4569a895 AT	498
1b24692f BK	499	value_vector m_a_values;
1b24692f BK	500	metadata_pointer m_a_metadata;
4569a895	501	iterator m_end_it;
4569a895 AT	502	size_type m_size;
	503	};
	504
f5886803 FD	505	#define PB_DS_DEBUG_VERIFY(_Cond) \
	506	_GLIBCXX_DEBUG_VERIFY_AT(_Cond, \
	507	_M_message(#_Cond" assertion from %1;:%2;") \
	508	._M_string(__FILE__)._M_integer(__LINE__) \
	509	,__file,__line)
	510
4569a895 AT	511	#include <ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp>
	512	#include <ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp>
	513	#include <ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp>
	514	#include <ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp>
	515	#include <ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp>
	516	#include <ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp>
	517	#include <ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp>
	518	#include <ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp>
	519
f5886803 FD	520	#undef PB_DS_DEBUG_VERIFY
	521	#undef PB_DS_CHECK_KEY_DOES_NOT_EXIST
	522	#undef PB_DS_CHECK_KEY_EXISTS
	523	#undef PB_DS_ASSERT_VALID
4569a895	524	#undef PB_DS_CLASS_C_DEC
4569a895	525	#undef PB_DS_CLASS_T_DEC
4569a895	526	#undef PB_DS_OV_TREE_CLASS_NAME
4569a895	527	#undef PB_DS_TYPES_TRAITS_C_DEC
551fe1a2	528	#undef PB_DS_DEBUG_MAP_BASE_C_DEC
4569a895 AT	529	#ifdef PB_DS_TREE_TRACE
4569a895 AT	530	#undef PB_DS_TREE_TRACE_BASE_C_DEC
47bea7b8	531	#endif
4569a895 AT	532
	533	#undef PB_DS_V2F
	534	#undef PB_DS_EP2VP
	535	#undef PB_DS_V2S
4569a895 AT	536	#undef PB_DS_CONST_NODE_ITERATOR_NAME
	537
	538	} // namespace detail
5e11f978	539	} // namespace __gnu_pbds