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

// -*- C++ -*-

// Copyright (C) 2005-2020 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_/ov_tree_map_.hpp
 * Contains an implementation class for ov_tree.
 */

#include <map>
#include <set>
#include <ext/pb_ds/exception.hpp>
#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/type_utils.hpp>
#include <ext/pb_ds/detail/tree_trace_base.hpp>
#ifdef _GLIBCXX_DEBUG
#include <ext/pb_ds/detail/debug_map_base.hpp>
#endif
#include <utility>
#include <functional>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <debug/debug.h>

namespace __gnu_pbds
{
  namespace detail
  {
#ifdef PB_DS_DATA_TRUE_INDICATOR
#define PB_DS_OV_TREE_NAME ov_tree_map
#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_node_const_iterator_map
#endif

#ifdef PB_DS_DATA_FALSE_INDICATOR
#define PB_DS_OV_TREE_NAME ov_tree_set
#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_node_const_iterator_set
#endif

#define PB_DS_CLASS_T_DEC \
    template<typename Key, typename Mapped, typename Cmp_Fn, \
	     typename Node_And_It_Traits, typename _Alloc>

#define PB_DS_CLASS_C_DEC \
   PB_DS_OV_TREE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc>

#define PB_DS_OV_TREE_TRAITS_BASE \
    types_traits<Key, Mapped, _Alloc, false>

#ifdef _GLIBCXX_DEBUG
#define PB_DS_DEBUG_MAP_BASE_C_DEC \
    debug_map_base<Key, eq_by_less<Key, Cmp_Fn>, \
		   typename rebind_traits<_Alloc, Key>::const_reference>
#endif

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

#ifndef PB_DS_CHECK_KEY_EXISTS
#  error Missing definition
#endif

    /**
     *  @brief Ordered-vector tree associative-container.
     *  @ingroup branch-detail
     */
    template<typename Key, typename Mapped, typename Cmp_Fn,
	     typename Node_And_It_Traits, typename _Alloc>
    class PB_DS_OV_TREE_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_OV_TREE_TRAITS_BASE
    {
    private:
      typedef PB_DS_OV_TREE_TRAITS_BASE	       		traits_base;
      typedef Node_And_It_Traits			traits_type;

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

      typedef rebind_traits<_Alloc, non_const_value_type> value_alloc_traits;
      typedef typename value_alloc_traits::allocator_type value_allocator;
      typedef typename value_alloc_traits::pointer	  value_vector;

#ifdef _GLIBCXX_DEBUG
      typedef PB_DS_DEBUG_MAP_BASE_C_DEC 		debug_base;
#endif

#ifdef PB_DS_TREE_TRACE
      typedef PB_DS_TREE_TRACE_BASE_C_DEC 		trace_base;
#endif

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

      typedef typename traits_type::metadata_type 	metadata_type;

      typedef rebind_traits<_Alloc, metadata_type>	metadata_alloc_traits;
      typedef typename metadata_alloc_traits::allocator_type metadata_allocator;
      typedef typename metadata_alloc_traits::pointer	metadata_pointer;
      typedef typename metadata_alloc_traits::const_reference metadata_const_reference;
      typedef typename metadata_alloc_traits::reference	metadata_reference;

      typedef typename traits_type::null_node_update_pointer
      null_node_update_pointer;

    public:
      typedef ov_tree_tag 				container_category;
      typedef _Alloc 					allocator_type;
      typedef typename _Alloc::size_type 		size_type;
      typedef typename _Alloc::difference_type 		difference_type;
      typedef Cmp_Fn 					cmp_fn;

      typedef typename traits_base::key_type 		key_type;
      typedef typename traits_base::key_pointer 	key_pointer;
      typedef typename traits_base::key_const_pointer 	key_const_pointer;
      typedef typename traits_base::key_reference 	key_reference;
      typedef typename traits_base::key_const_reference key_const_reference;
      typedef typename traits_base::mapped_type 	mapped_type;
      typedef typename traits_base::mapped_pointer 	mapped_pointer;
      typedef typename traits_base::mapped_const_pointer mapped_const_pointer;
      typedef typename traits_base::mapped_reference 	mapped_reference;
      typedef typename traits_base::mapped_const_reference mapped_const_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 				point_const_iterator;
#ifdef PB_DS_DATA_TRUE_INDICATOR
      typedef pointer 					point_iterator;
#else
      typedef point_const_iterator 			point_iterator;
#endif

      typedef point_iterator 				iterator;
      typedef point_const_iterator 			const_iterator;

      /// Conditional destructor.
      template<typename Size_Type>
        class cond_dtor
        {
	public:
	  cond_dtor(value_vector a_vec, iterator& r_last_it, 
		    Size_Type total_size) 
	  : m_a_vec(a_vec), m_r_last_it(r_last_it), m_max_size(total_size),
	    m_no_action(false)
	  { }

	  ~cond_dtor()
	  {
	    if (m_no_action)
	      return;
	    iterator it = m_a_vec;
	    while (it != m_r_last_it)
	      {
		it->~value_type();
		++it;
	      }
	    
	    if (m_max_size > 0)
	      value_allocator().deallocate(m_a_vec, m_max_size);
	  }

	  inline void
	  set_no_action()
	  { m_no_action = true; }
	  
	protected:
	  value_vector 		m_a_vec;
	  iterator& 		m_r_last_it;
	  const Size_Type 	m_max_size;
	  bool 			m_no_action;
       };
      
      typedef typename traits_type::node_update 	node_update;
      typedef typename traits_type::node_iterator 	node_iterator;
      typedef typename traits_type::node_const_iterator	node_const_iterator;


      PB_DS_OV_TREE_NAME();

      PB_DS_OV_TREE_NAME(const Cmp_Fn&);

      PB_DS_OV_TREE_NAME(const Cmp_Fn&, const node_update&);

      PB_DS_OV_TREE_NAME(const PB_DS_CLASS_C_DEC&);

      ~PB_DS_OV_TREE_NAME();

      void
      swap(PB_DS_CLASS_C_DEC&);

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

      inline size_type
      max_size() const;

      _GLIBCXX_NODISCARD 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[](key_const_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_type;
#endif
      }

      inline std::pair<point_iterator, bool>
      insert(const_reference r_value)
      {
	PB_DS_ASSERT_VALID((*this))
	key_const_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(key_const_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::operator()(PB_DS_V2F(*mid_it), r_key))
	      it = ++mid_it;
	    else
	      e_it = mid_it;
	  }
	return it;
      }

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

      inline point_iterator
      upper_bound(key_const_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 point_const_iterator
      upper_bound(key_const_reference r_key) const
      { return const_cast<PB_DS_CLASS_C_DEC&>(*this).upper_bound(r_key); }

      inline point_iterator
      find(key_const_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 point_const_iterator
      find(key_const_reference r_key) const
      { return (const_cast<PB_DS_CLASS_C_DEC&>(*this).find(r_key)); }

      bool
      erase(key_const_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(key_const_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; }

      /// Returns a const node_iterator corresponding to the node at the
      /// root of the tree.
      inline node_const_iterator
      node_begin() const;

      /// Returns a node_iterator corresponding to the node at the
      /// root of the tree.
      inline node_iterator
      node_begin();

      /// Returns a const node_iterator corresponding to a node just
      /// after a leaf of the tree.
      inline node_const_iterator
      node_end() const;

      /// Returns a node_iterator corresponding to a node just
      /// after a leaf of the tree.
      inline node_iterator
      node_end();

    private:

      inline void
      update(node_iterator, 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 _Alloc::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*, int) const;

      void
      assert_iterators(const char*, int) const;
#endif

      template<typename It>
      It
      erase_imp(It);

      inline node_const_iterator
      PB_DS_node_begin_imp() const;

      inline node_const_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_NAME
#undef PB_DS_OV_TREE_TRAITS_BASE
#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_CONST_NODE_ITERATOR_NAME
  } // namespace detail
} // namespace __gnu_pbds
Commit	Line	Data
4569a895 AT	1	// -- C++ --
4569a895 AT	2
8d9254fc	3	// Copyright (C) 2005-2020 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	/**
a345e45d	37	* @file ov_tree_map_/ov_tree_map_.hpp
30a96b3b	38	* Contains an implementation class for ov_tree.
4569a895 AT	39	*/
	40
	41	#include <map>
	42	#include <set>
a345e45d	43	#include <ext/pb_ds/exception.hpp>
4569a895 AT	44	#include <ext/pb_ds/tree_policy.hpp>
	45	#include <ext/pb_ds/detail/eq_fn/eq_by_less.hpp>
	46	#include <ext/pb_ds/detail/types_traits.hpp>
4569a895	47	#include <ext/pb_ds/detail/type_utils.hpp>
4569a895	48	#include <ext/pb_ds/detail/tree_trace_base.hpp>
a345e45d BK	49	#ifdef _GLIBCXX_DEBUG
	50	#include <ext/pb_ds/detail/debug_map_base.hpp>
	51	#endif
4569a895 AT	52	#include <utility>
	53	#include <functional>
	54	#include <algorithm>
	55	#include <vector>
	56	#include <assert.h>
47bea7b8	57	#include <debug/debug.h>
4569a895	58
5e11f978	59	namespace __gnu_pbds
4569a895 AT	60	{
	61	namespace detail
	62	{
4569a895	63	#ifdef PB_DS_DATA_TRUE_INDICATOR
a345e45d BK	64	#define PB_DS_OV_TREE_NAME ov_tree_map
	65	#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_node_const_iterator_map
	66	#endif
4569a895 AT	67
4569a895 AT	68	#ifdef PB_DS_DATA_FALSE_INDICATOR
a345e45d BK	69	#define PB_DS_OV_TREE_NAME ov_tree_set
	70	#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_node_const_iterator_set
	71	#endif
4569a895	72
a345e45d BK	73	#define PB_DS_CLASS_T_DEC \
	74	template<typename Key, typename Mapped, typename Cmp_Fn, \
	75	typename Node_And_It_Traits, typename _Alloc>
47bea7b8 BK	76
47bea7b8 BK	77	#define PB_DS_CLASS_C_DEC \
a345e45d	78	PB_DS_OV_TREE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc>
47bea7b8	79
a345e45d BK	80	#define PB_DS_OV_TREE_TRAITS_BASE \
a345e45d BK	81	types_traits<Key, Mapped, _Alloc, false>
47bea7b8 BK	82
47bea7b8 BK	83	#ifdef _GLIBCXX_DEBUG
551fe1a2 BK	84	#define PB_DS_DEBUG_MAP_BASE_C_DEC \
551fe1a2 BK	85	debug_map_base<Key, eq_by_less<Key, Cmp_Fn>, \
ec541f1b	86	typename rebind_traits<_Alloc, Key>::const_reference>
a345e45d	87	#endif
4569a895 AT	88
4569a895 AT	89	#ifdef PB_DS_TREE_TRACE
47bea7b8	90	#define PB_DS_TREE_TRACE_BASE_C_DEC \
a345e45d	91	tree_trace_base<typename Node_And_It_Traits::node_const_iterator, \
f5886803	92	typename Node_And_It_Traits::node_iterator, \
a345e45d	93	Cmp_Fn, false, _Alloc>
f5886803 FD	94	#endif
f5886803 FD	95
cfca3f72 FD	96	#ifndef PB_DS_CHECK_KEY_EXISTS
	97	# error Missing definition
	98	#endif
4569a895	99
30a96b3b BK	100	/**
	101	* @brief Ordered-vector tree associative-container.
	102	* @ingroup branch-detail
	103	*/
a345e45d BK	104	template<typename Key, typename Mapped, typename Cmp_Fn,
	105	typename Node_And_It_Traits, typename _Alloc>
	106	class PB_DS_OV_TREE_NAME :
47bea7b8	107	#ifdef _GLIBCXX_DEBUG
551fe1a2	108	protected PB_DS_DEBUG_MAP_BASE_C_DEC,
a345e45d	109	#endif
4569a895 AT	110	#ifdef PB_DS_TREE_TRACE
4569a895 AT	111	public PB_DS_TREE_TRACE_BASE_C_DEC,
a345e45d	112	#endif
4569a895 AT	113	public Cmp_Fn,
4569a895 AT	114	public Node_And_It_Traits::node_update,
a345e45d	115	public PB_DS_OV_TREE_TRAITS_BASE
4569a895	116	{
4569a895	117	private:
a345e45d BK	118	typedef PB_DS_OV_TREE_TRAITS_BASE traits_base;
a345e45d BK	119	typedef Node_And_It_Traits traits_type;
4569a895	120
1b24692f	121	typedef typename remove_const<typename traits_base::value_type>::type non_const_value_type;
4569a895	122
ec541f1b JW	123	typedef rebind_traits<_Alloc, non_const_value_type> value_alloc_traits;
	124	typedef typename value_alloc_traits::allocator_type value_allocator;
	125	typedef typename value_alloc_traits::pointer value_vector;
4569a895	126
47bea7b8	127	#ifdef _GLIBCXX_DEBUG
a345e45d BK	128	typedef PB_DS_DEBUG_MAP_BASE_C_DEC debug_base;
	129	#endif
	130
	131	#ifdef PB_DS_TREE_TRACE
	132	typedef PB_DS_TREE_TRACE_BASE_C_DEC trace_base;
	133	#endif
4569a895	134
a345e45d BK	135	typedef typename traits_base::pointer mapped_pointer_;
a345e45d BK	136	typedef typename traits_base::const_pointer mapped_const_pointer_;
4569a895	137
a345e45d	138	typedef typename traits_type::metadata_type metadata_type;
4569a895	139
ec541f1b JW	140	typedef rebind_traits<_Alloc, metadata_type> metadata_alloc_traits;
	141	typedef typename metadata_alloc_traits::allocator_type metadata_allocator;
	142	typedef typename metadata_alloc_traits::pointer metadata_pointer;
	143	typedef typename metadata_alloc_traits::const_reference metadata_const_reference;
	144	typedef typename metadata_alloc_traits::reference metadata_reference;
4569a895	145
a345e45d	146	typedef typename traits_type::null_node_update_pointer
4569a895 AT	147	null_node_update_pointer;
	148
	149	public:
ec541f1b	150	typedef ov_tree_tag container_category;
a345e45d BK	151	typedef _Alloc allocator_type;
	152	typedef typename _Alloc::size_type size_type;
	153	typedef typename _Alloc::difference_type difference_type;
	154	typedef Cmp_Fn cmp_fn;
	155
	156	typedef typename traits_base::key_type key_type;
	157	typedef typename traits_base::key_pointer key_pointer;
	158	typedef typename traits_base::key_const_pointer key_const_pointer;
	159	typedef typename traits_base::key_reference key_reference;
	160	typedef typename traits_base::key_const_reference key_const_reference;
	161	typedef typename traits_base::mapped_type mapped_type;
	162	typedef typename traits_base::mapped_pointer mapped_pointer;
	163	typedef typename traits_base::mapped_const_pointer mapped_const_pointer;
	164	typedef typename traits_base::mapped_reference mapped_reference;
	165	typedef typename traits_base::mapped_const_reference mapped_const_reference;
	166	typedef typename traits_base::value_type value_type;
	167	typedef typename traits_base::pointer pointer;
	168	typedef typename traits_base::const_pointer const_pointer;
	169	typedef typename traits_base::reference reference;
	170	typedef typename traits_base::const_reference const_reference;
	171
	172	typedef const_pointer point_const_iterator;
4569a895	173	#ifdef PB_DS_DATA_TRUE_INDICATOR
a345e45d BK	174	typedef pointer point_iterator;
	175	#else
	176	typedef point_const_iterator point_iterator;
	177	#endif
4569a895	178
a345e45d BK	179	typedef point_iterator iterator;
	180	typedef point_const_iterator const_iterator;
	181
	182	/// Conditional destructor.
	183	template<typename Size_Type>
	184	class cond_dtor
	185	{
	186	public:
	187	cond_dtor(value_vector a_vec, iterator& r_last_it,
	188	Size_Type total_size)
	189	: m_a_vec(a_vec), m_r_last_it(r_last_it), m_max_size(total_size),
	190	m_no_action(false)
	191	{ }
	192
	193	~cond_dtor()
	194	{
	195	if (m_no_action)
	196	return;
	197	iterator it = m_a_vec;
	198	while (it != m_r_last_it)
	199	{
	200	it->~value_type();
	201	++it;
	202	}
	203
	204	if (m_max_size > 0)
	205	value_allocator().deallocate(m_a_vec, m_max_size);
	206	}
4569a895	207
a345e45d BK	208	inline void
	209	set_no_action()
	210	{ m_no_action = true; }
	211
	212	protected:
	213	value_vector m_a_vec;
	214	iterator& m_r_last_it;
	215	const Size_Type m_max_size;
	216	bool m_no_action;
	217	};
	218
	219	typedef typename traits_type::node_update node_update;
	220	typedef typename traits_type::node_iterator node_iterator;
	221	typedef typename traits_type::node_const_iterator node_const_iterator;
4569a895	222
4569a895	223
a345e45d	224	PB_DS_OV_TREE_NAME();
4569a895	225
a345e45d	226	PB_DS_OV_TREE_NAME(const Cmp_Fn&);
4569a895	227
a345e45d	228	PB_DS_OV_TREE_NAME(const Cmp_Fn&, const node_update&);
4569a895	229
a345e45d	230	PB_DS_OV_TREE_NAME(const PB_DS_CLASS_C_DEC&);
4569a895	231
a345e45d	232	~PB_DS_OV_TREE_NAME();
4569a895 AT	233
4569a895 AT	234	void
1b24692f	235	swap(PB_DS_CLASS_C_DEC&);
4569a895 AT	236
	237	template<typename It>
	238	void
1b24692f	239	copy_from_range(It, It);
4569a895 AT	240
	241	inline size_type
	242	max_size() const;
	243
d715f554	244	_GLIBCXX_NODISCARD inline bool
4569a895 AT	245	empty() const;
	246
	247	inline size_type
	248	size() const;
	249
a345e45d	250	Cmp_Fn&
4569a895 AT	251	get_cmp_fn();
4569a895 AT	252
a345e45d	253	const Cmp_Fn&
4569a895 AT	254	get_cmp_fn() const;
	255
	256	inline mapped_reference
a345e45d	257	operator[](key_const_reference r_key)
4569a895 AT	258	{
4569a895 AT	259	#ifdef PB_DS_DATA_TRUE_INDICATOR
f5886803	260	PB_DS_ASSERT_VALID((*this))
47bea7b8 BK	261	point_iterator it = lower_bound(r_key);
47bea7b8 BK	262	if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
4569a895	263	{
f5886803 FD	264	PB_DS_CHECK_KEY_EXISTS(r_key)
f5886803 FD	265	PB_DS_ASSERT_VALID((*this))
47bea7b8	266	return it->second;
4569a895	267	}
a345e45d BK	268	return insert_new_val(it, std::make_pair(r_key, mapped_type()))->second;
a345e45d BK	269	#else
4569a895	270	insert(r_key);
a345e45d BK	271	return traits_base::s_null_type;
a345e45d BK	272	#endif
4569a895 AT	273	}
	274
	275	inline std::pair<point_iterator, bool>
	276	insert(const_reference r_value)
	277	{
f5886803	278	PB_DS_ASSERT_VALID((*this))
a345e45d	279	key_const_reference r_key = PB_DS_V2F(r_value);
4569a895 AT	280	point_iterator it = lower_bound(r_key);
4569a895 AT	281
47bea7b8	282	if (it != end()&& !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
4569a895	283	{
f5886803 FD	284	PB_DS_ASSERT_VALID((*this))
f5886803 FD	285	PB_DS_CHECK_KEY_EXISTS(r_key)
47bea7b8	286	return std::make_pair(it, false);
4569a895 AT	287	}
4569a895 AT	288
47bea7b8	289	return std::make_pair(insert_new_val(it, r_value), true);
4569a895 AT	290	}
	291
	292	inline point_iterator
a345e45d	293	lower_bound(key_const_reference r_key)
4569a895 AT	294	{
4569a895 AT	295	pointer it = m_a_values;
4569a895	296	pointer e_it = m_a_values + m_size;
4569a895 AT	297	while (it != e_it)
	298	{
	299	pointer mid_it = it + ((e_it - it) >> 1);
a345e45d	300	if (cmp_fn::operator()(PB_DS_V2F(*mid_it), r_key))
4569a895 AT	301	it = ++mid_it;
	302	else
	303	e_it = mid_it;
	304	}
47bea7b8	305	return it;
4569a895 AT	306	}
4569a895 AT	307
a345e45d BK	308	inline point_const_iterator
a345e45d BK	309	lower_bound(key_const_reference r_key) const
1b24692f	310	{ return const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key); }
4569a895 AT	311
4569a895 AT	312	inline point_iterator
a345e45d	313	upper_bound(key_const_reference r_key)
4569a895 AT	314	{
4569a895 AT	315	iterator pot_it = lower_bound(r_key);
a345e45d	316	if (pot_it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
4569a895	317	{
f5886803	318	PB_DS_CHECK_KEY_EXISTS(r_key)
3441f106	319	return ++pot_it;
4569a895 AT	320	}
4569a895 AT	321
f5886803	322	PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
47bea7b8	323	return pot_it;
4569a895 AT	324	}
4569a895 AT	325
a345e45d BK	326	inline point_const_iterator
a345e45d BK	327	upper_bound(key_const_reference r_key) const
3441f106	328	{ return const_cast<PB_DS_CLASS_C_DEC&>(*this).upper_bound(r_key); }
4569a895 AT	329
4569a895 AT	330	inline point_iterator
a345e45d	331	find(key_const_reference r_key)
4569a895	332	{
f5886803	333	PB_DS_ASSERT_VALID((*this))
47bea7b8	334	iterator pot_it = lower_bound(r_key);
3441f106	335	if (pot_it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*pot_it)))
4569a895	336	{
f5886803	337	PB_DS_CHECK_KEY_EXISTS(r_key)
3441f106	338	return pot_it;
4569a895 AT	339	}
4569a895 AT	340
f5886803	341	PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
47bea7b8	342	return end();
4569a895 AT	343	}
4569a895 AT	344
a345e45d BK	345	inline point_const_iterator
	346	find(key_const_reference r_key) const
	347	{ return (const_cast<PB_DS_CLASS_C_DEC&>(*this).find(r_key)); }
4569a895 AT	348
4569a895 AT	349	bool
a345e45d	350	erase(key_const_reference);
4569a895 AT	351
	352	template<typename Pred>
	353	inline size_type
1b24692f	354	erase_if(Pred);
4569a895 AT	355
	356	inline iterator
	357	erase(iterator it)
47bea7b8	358	{ return erase_imp<iterator>(it); }
4569a895 AT	359
	360	void
	361	clear();
	362
	363	void
1b24692f	364	join(PB_DS_CLASS_C_DEC&);
4569a895 AT	365
4569a895 AT	366	void
a345e45d	367	split(key_const_reference, PB_DS_CLASS_C_DEC&);
4569a895 AT	368
	369	inline iterator
	370	begin()
47bea7b8	371	{ return m_a_values; }
4569a895 AT	372
	373	inline const_iterator
	374	begin() const
47bea7b8	375	{ return m_a_values; }
4569a895 AT	376
	377	inline iterator
	378	end()
47bea7b8	379	{ return m_end_it; }
4569a895 AT	380
	381	inline const_iterator
	382	end() const
47bea7b8	383	{ return m_end_it; }
4569a895	384
30a96b3b BK	385	/// Returns a const node_iterator corresponding to the node at the
30a96b3b BK	386	/// root of the tree.
a345e45d	387	inline node_const_iterator
4569a895 AT	388	node_begin() const;
4569a895 AT	389
30a96b3b BK	390	/// Returns a node_iterator corresponding to the node at the
30a96b3b BK	391	/// root of the tree.
4569a895 AT	392	inline node_iterator
	393	node_begin();
	394
30a96b3b BK	395	/// Returns a const node_iterator corresponding to a node just
	396	/// after a leaf of the tree.
	397	inline node_const_iterator
	398	node_end() const;
	399
	400	/// Returns a node_iterator corresponding to a node just
	401	/// after a leaf of the tree.
4569a895 AT	402	inline node_iterator
	403	node_end();
	404
	405	private:
	406
	407	inline void
a345e45d	408	update(node_iterator, null_node_update_pointer);
4569a895 AT	409
	410	template<typename Node_Update>
	411	void
1b24692f	412	update(node_iterator, Node_Update*);
4569a895 AT	413
	414	void
	415	reallocate_metadata(null_node_update_pointer, size_type);
	416
	417	template<typename Node_Update_>
	418	void
1b24692f	419	reallocate_metadata(Node_Update_*, size_type);
4569a895 AT	420
	421	template<typename It>
	422	void
1b24692f	423	copy_from_ordered_range(It, It);
4569a895 AT	424
4569a895 AT	425	void
1b24692f	426	value_swap(PB_DS_CLASS_C_DEC&);
4569a895 AT	427
	428	template<typename It>
	429	void
1b24692f	430	copy_from_ordered_range(It, It, It, It);
4569a895 AT	431
	432	template<typename Ptr>
	433	inline static Ptr
	434	mid_pointer(Ptr p_begin, Ptr p_end)
	435	{
47bea7b8	436	_GLIBCXX_DEBUG_ASSERT(p_end >= p_begin);
4569a895 AT	437	return (p_begin + (p_end - p_begin) / 2);
	438	}
	439
	440	inline iterator
	441	insert_new_val(iterator it, const_reference r_value)
	442	{
4569a895	443	#ifdef PB_DS_REGRESSION
a345e45d BK	444	typename _Alloc::group_adjustor adjust(m_size);
a345e45d BK	445	#endif
4569a895	446
f5886803	447	PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value))
4569a895 AT	448
	449	value_vector a_values = s_value_alloc.allocate(m_size + 1);
	450
	451	iterator source_it = begin();
	452	iterator source_end_it = end();
	453	iterator target_it = a_values;
	454	iterator ret_it;
	455
	456	cond_dtor<size_type> cd(a_values, target_it, m_size + 1);
4569a895 AT	457	while (source_it != it)
4569a895 AT	458	{
a345e45d	459	new (const_cast<void>(static_cast<const void>(target_it)))
4569a895	460	value_type(*source_it++);
4569a895 AT	461	++target_it;
	462	}
	463
a345e45d	464	new (const_cast<void>(static_cast<const void>(ret_it = target_it)))
4569a895	465	value_type(r_value);
4569a895 AT	466	++target_it;
	467
	468	while (source_it != source_end_it)
	469	{
a345e45d	470	new (const_cast<void>(static_cast<const void>(target_it)))
4569a895	471	value_type(*source_it++);
4569a895 AT	472	++target_it;
	473	}
	474
a345e45d	475	reallocate_metadata((node_update*)this, m_size + 1);
4569a895	476	cd.set_no_action();
4569a895 AT	477	if (m_size != 0)
	478	{
	479	cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size);
	480	}
	481
	482	++m_size;
4569a895	483	m_a_values = a_values;
4569a895	484	m_end_it = m_a_values + m_size;
551fe1a2	485	_GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_value)));
4569a895	486	update(node_begin(), (node_update* )this);
f5886803	487	PB_DS_ASSERT_VALID((*this))
47bea7b8	488	return ret_it;
4569a895 AT	489	}
4569a895 AT	490
47bea7b8	491	#ifdef _GLIBCXX_DEBUG
4569a895	492	void
a345e45d	493	assert_valid(const char*, int) const;
4569a895 AT	494
4569a895 AT	495	void
a345e45d BK	496	assert_iterators(const char*, int) const;
a345e45d BK	497	#endif
4569a895 AT	498
	499	template<typename It>
	500	It
a345e45d	501	erase_imp(It);
4569a895	502
a345e45d	503	inline node_const_iterator
4569a895 AT	504	PB_DS_node_begin_imp() const;
4569a895 AT	505
a345e45d	506	inline node_const_iterator
4569a895 AT	507	PB_DS_node_end_imp() const;
	508
	509	inline node_iterator
	510	PB_DS_node_begin_imp();
	511
	512	inline node_iterator
	513	PB_DS_node_end_imp();
	514
	515	private:
a345e45d	516	static value_allocator s_value_alloc;
4569a895 AT	517	static metadata_allocator s_metadata_alloc;
4569a895 AT	518
a345e45d BK	519	value_vector m_a_values;
	520	metadata_pointer m_a_metadata;
	521	iterator m_end_it;
	522	size_type m_size;
4569a895 AT	523	};
	524
	525	#include <ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp>
	526	#include <ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp>
	527	#include <ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp>
	528	#include <ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp>
	529	#include <ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp>
	530	#include <ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp>
	531	#include <ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp>
	532	#include <ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp>
	533
	534	#undef PB_DS_CLASS_C_DEC
4569a895	535	#undef PB_DS_CLASS_T_DEC
a345e45d BK	536	#undef PB_DS_OV_TREE_NAME
a345e45d BK	537	#undef PB_DS_OV_TREE_TRAITS_BASE
551fe1a2	538	#undef PB_DS_DEBUG_MAP_BASE_C_DEC
4569a895 AT	539	#ifdef PB_DS_TREE_TRACE
4569a895 AT	540	#undef PB_DS_TREE_TRACE_BASE_C_DEC
a345e45d	541	#endif
4569a895	542	#undef PB_DS_CONST_NODE_ITERATOR_NAME
4569a895	543	} // namespace detail
5e11f978	544	} // namespace __gnu_pbds