[thirdparty/gcc.git] / libstdc++-v3 / include / ext / pb_ds / detail / bin_search_tree_ / point_iterators.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 point_iterators.hpp
 * Contains an implementation class for bin_search_tree_.
 */

#ifndef PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP
#define PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP

#include <ext/pb_ds/tag_and_trait.hpp>
#include <debug/debug.h>

namespace __gnu_pbds
{
  namespace detail
  {

#define PB_DS_TREE_CONST_IT_C_DEC					\
    bin_search_tree_const_it_<						\
						Node_Pointer,		\
						Value_Type,		\
						Pointer,		\
						Const_Pointer,		\
						Reference,		\
						Const_Reference,	\
						Is_Forward_Iterator,	\
						Allocator>

#define PB_DS_TREE_CONST_ODIR_IT_C_DEC					\
    bin_search_tree_const_it_<						\
						Node_Pointer,		\
						Value_Type,		\
						Pointer,		\
						Const_Pointer,		\
						Reference,		\
						Const_Reference,	\
						!Is_Forward_Iterator,	\
						Allocator>

#define PB_DS_TREE_IT_C_DEC						\
    bin_search_tree_it_<						\
						Node_Pointer,		\
						Value_Type,		\
						Pointer,		\
						Const_Pointer,		\
						Reference,		\
						Const_Reference,	\
						Is_Forward_Iterator,	\
						Allocator>

#define PB_DS_TREE_ODIR_IT_C_DEC					\
    bin_search_tree_it_<						\
							Node_Pointer,	\
							Value_Type,	\
							Pointer,	\
							Const_Pointer,	\
							Reference,	\
							Const_Reference, \
							!Is_Forward_Iterator, \
							Allocator>

    // Const iterator.
    template<typename Node_Pointer,
	     typename Value_Type,
	     typename Pointer,
	     typename Const_Pointer,
	     typename Reference,
	     typename Const_Reference,
	     bool Is_Forward_Iterator,
	     class Allocator>
    class bin_search_tree_const_it_
    {

    public:

      typedef std::bidirectional_iterator_tag iterator_category;

      typedef typename Allocator::difference_type difference_type;

      typedef Value_Type value_type;

      typedef Pointer pointer;

      typedef Const_Pointer const_pointer;

      typedef Reference reference;

      typedef Const_Reference const_reference;

    public:

      inline
      bin_search_tree_const_it_(const Node_Pointer p_nd = 0) 
      : m_p_nd(const_cast<Node_Pointer>(p_nd))
      { }

      inline
      bin_search_tree_const_it_(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& other) 
      : m_p_nd(other.m_p_nd)
      { }

      inline
      PB_DS_TREE_CONST_IT_C_DEC& 
      operator=(const PB_DS_TREE_CONST_IT_C_DEC& other)
      {
	m_p_nd = other.m_p_nd;
	return *this;
      }

      inline
      PB_DS_TREE_CONST_IT_C_DEC& 
      operator=(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& other)
      {
	m_p_nd = other.m_p_nd;
	return *this;
      }

      inline const_pointer
      operator->() const
      {
	_GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
	return &m_p_nd->m_value;
      }

      inline const_reference
      operator*() const
      {
	_GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
	return m_p_nd->m_value;
      }

      inline bool
      operator==(const PB_DS_TREE_CONST_IT_C_DEC & other) const
      { return m_p_nd == other.m_p_nd; }

      inline bool
      operator==(const PB_DS_TREE_CONST_ODIR_IT_C_DEC & other) const
      { return m_p_nd == other.m_p_nd; }

      inline bool
      operator!=(const PB_DS_TREE_CONST_IT_C_DEC& other) const
      { return m_p_nd != other.m_p_nd; }

      inline bool
      operator!=(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& other) const
      { return m_p_nd != other.m_p_nd; }

      inline PB_DS_TREE_CONST_IT_C_DEC& 
      operator++()
      {
	_GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
	inc(integral_constant<int,Is_Forward_Iterator>());
	return *this;
      }

      inline PB_DS_TREE_CONST_IT_C_DEC
      operator++(int)
      {
	PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
	operator++();
	return ret_it;
      }

      inline PB_DS_TREE_CONST_IT_C_DEC& 
      operator--()
      {
	dec(integral_constant<int,Is_Forward_Iterator>());
	return *this;
      }

      inline PB_DS_TREE_CONST_IT_C_DEC
      operator--(int)
      {
	PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
	operator--();
	return ret_it;
      }

    protected:
      inline void
      inc(false_type)
      { dec(true_type()); }

      void
      inc(true_type)
      {
	if (m_p_nd->special()&& 
	    m_p_nd->m_p_parent->m_p_parent == m_p_nd)
	  {
	    m_p_nd = m_p_nd->m_p_left;
	    return;
	  }

	if (m_p_nd->m_p_right != 0)
	  {
	    m_p_nd = m_p_nd->m_p_right;
	    while (m_p_nd->m_p_left != 0)
	      m_p_nd = m_p_nd->m_p_left;
	    return;
	  }

	Node_Pointer p_y = m_p_nd->m_p_parent;
	while (m_p_nd == p_y->m_p_right)
	  {
	    m_p_nd = p_y;
	    p_y = p_y->m_p_parent;
	  }

	if (m_p_nd->m_p_right != p_y)
	  m_p_nd = p_y;
      }

      inline void
      dec(false_type)
      { inc(true_type()); }

      void
      dec(true_type)
      {
	if (m_p_nd->special() && m_p_nd->m_p_parent->m_p_parent == m_p_nd)
	  {
	    m_p_nd = m_p_nd->m_p_right;
	    return;
	  }

	if (m_p_nd->m_p_left != 0)
	  {
	    Node_Pointer p_y = m_p_nd->m_p_left;
	    while (p_y->m_p_right != 0)
	      p_y = p_y->m_p_right;
	    m_p_nd = p_y;
	    return;
	  }

	Node_Pointer p_y = m_p_nd->m_p_parent;
	while (m_p_nd == p_y->m_p_left)
	  {
	    m_p_nd = p_y;
	    p_y = p_y->m_p_parent;
	  }
	if (m_p_nd->m_p_left != p_y)
	  m_p_nd = p_y;
      }

    public:
      Node_Pointer m_p_nd;
    };

    // Iterator.
    template<typename Node_Pointer,
	     typename Value_Type,
	     typename Pointer,
	     typename Const_Pointer,
	     typename Reference,
	     typename Const_Reference,
	     bool Is_Forward_Iterator,
	     class Allocator>
    class bin_search_tree_it_ : 
      public PB_DS_TREE_CONST_IT_C_DEC

    {

    public:

      inline
      bin_search_tree_it_(const Node_Pointer p_nd = 0) 
      : PB_DS_TREE_CONST_IT_C_DEC((Node_Pointer)p_nd)
      { }

      inline
      bin_search_tree_it_(const PB_DS_TREE_ODIR_IT_C_DEC& other) 
      : PB_DS_TREE_CONST_IT_C_DEC(other.m_p_nd)
      { }

      inline
      PB_DS_TREE_IT_C_DEC& 
      operator=(const PB_DS_TREE_IT_C_DEC& other)
      {
	base_it_type::m_p_nd = other.m_p_nd;
	return *this;
      }

      inline
      PB_DS_TREE_IT_C_DEC& 
      operator=(const PB_DS_TREE_ODIR_IT_C_DEC& other)
      {
	base_it_type::m_p_nd = other.m_p_nd;
	return *this;
      }

      inline typename PB_DS_TREE_CONST_IT_C_DEC::pointer
      operator->() const
      {
	_GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != 0);
	return &base_it_type::m_p_nd->m_value;
      }

      inline typename PB_DS_TREE_CONST_IT_C_DEC::reference
      operator*() const
      {
	_GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != 0);
	return base_it_type::m_p_nd->m_value;
      }

      inline PB_DS_TREE_IT_C_DEC& 
      operator++()
      {
	PB_DS_TREE_CONST_IT_C_DEC:: operator++();
	return *this;
      }

      inline PB_DS_TREE_IT_C_DEC
      operator++(int)
      {
	PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);
	operator++();
	return ret_it;
      }

      inline PB_DS_TREE_IT_C_DEC& 
      operator--()
      {
	PB_DS_TREE_CONST_IT_C_DEC:: operator--();
	return *this;
      }

      inline PB_DS_TREE_IT_C_DEC
      operator--(int)
      {
	PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);
	operator--();
	return ret_it;
      }

    protected:
      typedef PB_DS_TREE_CONST_IT_C_DEC base_it_type;
    };

#undef PB_DS_TREE_CONST_IT_C_DEC
#undef PB_DS_TREE_CONST_ODIR_IT_C_DEC
#undef PB_DS_TREE_IT_C_DEC
#undef PB_DS_TREE_ODIR_IT_C_DEC

  } // namespace detail
} // namespace __gnu_pbds

#endif
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.
	19
	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 point_iterators.hpp
	38	* Contains an implementation class for bin_search_tree_.
	39	*/
	40
	41	#ifndef PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP
	42	#define PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP
	43
4569a895	44	#include <ext/pb_ds/tag_and_trait.hpp>
47bea7b8	45	#include <debug/debug.h>
4569a895	46
5e11f978	47	namespace __gnu_pbds
4569a895 AT	48	{
	49	namespace detail
	50	{
	51
	52	#define PB_DS_TREE_CONST_IT_C_DEC \
	53	bin_search_tree_const_it_< \
	54	Node_Pointer, \
	55	Value_Type, \
	56	Pointer, \
	57	Const_Pointer, \
	58	Reference, \
	59	Const_Reference, \
	60	Is_Forward_Iterator, \
	61	Allocator>
	62
	63	#define PB_DS_TREE_CONST_ODIR_IT_C_DEC \
	64	bin_search_tree_const_it_< \
	65	Node_Pointer, \
	66	Value_Type, \
	67	Pointer, \
	68	Const_Pointer, \
	69	Reference, \
	70	Const_Reference, \
	71	!Is_Forward_Iterator, \
	72	Allocator>
	73
	74	#define PB_DS_TREE_IT_C_DEC \
	75	bin_search_tree_it_< \
	76	Node_Pointer, \
	77	Value_Type, \
	78	Pointer, \
	79	Const_Pointer, \
	80	Reference, \
	81	Const_Reference, \
	82	Is_Forward_Iterator, \
	83	Allocator>
	84
	85	#define PB_DS_TREE_ODIR_IT_C_DEC \
	86	bin_search_tree_it_< \
	87	Node_Pointer, \
	88	Value_Type, \
	89	Pointer, \
	90	Const_Pointer, \
	91	Reference, \
	92	Const_Reference, \
	93	!Is_Forward_Iterator, \
	94	Allocator>
	95
4569a895 AT	96	// Const iterator.
	97	template<typename Node_Pointer,
	98	typename Value_Type,
	99	typename Pointer,
	100	typename Const_Pointer,
	101	typename Reference,
	102	typename Const_Reference,
	103	bool Is_Forward_Iterator,
	104	class Allocator>
	105	class bin_search_tree_const_it_
	106	{
	107
	108	public:
	109
	110	typedef std::bidirectional_iterator_tag iterator_category;
	111
	112	typedef typename Allocator::difference_type difference_type;
	113
	114	typedef Value_Type value_type;
	115
	116	typedef Pointer pointer;
	117
	118	typedef Const_Pointer const_pointer;
	119
	120	typedef Reference reference;
	121
	122	typedef Const_Reference const_reference;
	123
	124	public:
	125
	126	inline
8fc81078	127	bin_search_tree_const_it_(const Node_Pointer p_nd = 0)
47bea7b8	128	: m_p_nd(const_cast<Node_Pointer>(p_nd))
4569a895 AT	129	{ }
	130
	131	inline
47bea7b8 BK	132	bin_search_tree_const_it_(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& other)
47bea7b8 BK	133	: m_p_nd(other.m_p_nd)
4569a895 AT	134	{ }
	135
	136	inline
	137	PB_DS_TREE_CONST_IT_C_DEC&
47bea7b8	138	operator=(const PB_DS_TREE_CONST_IT_C_DEC& other)
4569a895 AT	139	{
4569a895 AT	140	m_p_nd = other.m_p_nd;
47bea7b8	141	return *this;
4569a895 AT	142	}
	143
	144	inline
	145	PB_DS_TREE_CONST_IT_C_DEC&
47bea7b8	146	operator=(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& other)
4569a895 AT	147	{
4569a895 AT	148	m_p_nd = other.m_p_nd;
47bea7b8	149	return *this;
4569a895 AT	150	}
	151
	152	inline const_pointer
	153	operator->() const
	154	{
8fc81078	155	_GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
47bea7b8	156	return &m_p_nd->m_value;
4569a895 AT	157	}
	158
	159	inline const_reference
	160	operator*() const
	161	{
8fc81078	162	_GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
47bea7b8	163	return m_p_nd->m_value;
4569a895 AT	164	}
	165
	166	inline bool
47bea7b8 BK	167	operator==(const PB_DS_TREE_CONST_IT_C_DEC & other) const
47bea7b8 BK	168	{ return m_p_nd == other.m_p_nd; }
4569a895 AT	169
4569a895 AT	170	inline bool
47bea7b8 BK	171	operator==(const PB_DS_TREE_CONST_ODIR_IT_C_DEC & other) const
47bea7b8 BK	172	{ return m_p_nd == other.m_p_nd; }
4569a895 AT	173
4569a895 AT	174	inline bool
47bea7b8 BK	175	operator!=(const PB_DS_TREE_CONST_IT_C_DEC& other) const
47bea7b8 BK	176	{ return m_p_nd != other.m_p_nd; }
4569a895 AT	177
4569a895 AT	178	inline bool
47bea7b8 BK	179	operator!=(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& other) const
47bea7b8 BK	180	{ return m_p_nd != other.m_p_nd; }
4569a895 AT	181
	182	inline PB_DS_TREE_CONST_IT_C_DEC&
	183	operator++()
	184	{
8fc81078	185	_GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
4569a895	186	inc(integral_constant<int,Is_Forward_Iterator>());
47bea7b8	187	return *this;
4569a895 AT	188	}
	189
	190	inline PB_DS_TREE_CONST_IT_C_DEC
	191	operator++(int)
	192	{
47bea7b8	193	PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
4569a895	194	operator++();
47bea7b8	195	return ret_it;
4569a895 AT	196	}
	197
	198	inline PB_DS_TREE_CONST_IT_C_DEC&
	199	operator--()
	200	{
	201	dec(integral_constant<int,Is_Forward_Iterator>());
47bea7b8	202	return *this;
4569a895 AT	203	}
	204
	205	inline PB_DS_TREE_CONST_IT_C_DEC
	206	operator--(int)
	207	{
47bea7b8	208	PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
4569a895	209	operator--();
47bea7b8	210	return ret_it;
4569a895 AT	211	}
	212
	213	protected:
	214	inline void
	215	inc(false_type)
47bea7b8	216	{ dec(true_type()); }
4569a895 AT	217
	218	void
	219	inc(true_type)
	220	{
	221	if (m_p_nd->special()&&
	222	m_p_nd->m_p_parent->m_p_parent == m_p_nd)
	223	{
	224	m_p_nd = m_p_nd->m_p_left;
4569a895 AT	225	return;
	226	}
	227
8fc81078	228	if (m_p_nd->m_p_right != 0)
4569a895 AT	229	{
4569a895 AT	230	m_p_nd = m_p_nd->m_p_right;
8fc81078	231	while (m_p_nd->m_p_left != 0)
4569a895	232	m_p_nd = m_p_nd->m_p_left;
4569a895 AT	233	return;
	234	}
	235
	236	Node_Pointer p_y = m_p_nd->m_p_parent;
4569a895 AT	237	while (m_p_nd == p_y->m_p_right)
	238	{
	239	m_p_nd = p_y;
4569a895 AT	240	p_y = p_y->m_p_parent;
	241	}
	242
	243	if (m_p_nd->m_p_right != p_y)
	244	m_p_nd = p_y;
	245	}
	246
	247	inline void
	248	dec(false_type)
47bea7b8	249	{ inc(true_type()); }
4569a895 AT	250
	251	void
	252	dec(true_type)
	253	{
47bea7b8	254	if (m_p_nd->special() && m_p_nd->m_p_parent->m_p_parent == m_p_nd)
4569a895 AT	255	{
4569a895 AT	256	m_p_nd = m_p_nd->m_p_right;
4569a895 AT	257	return;
	258	}
	259
8fc81078	260	if (m_p_nd->m_p_left != 0)
4569a895 AT	261	{
4569a895 AT	262	Node_Pointer p_y = m_p_nd->m_p_left;
8fc81078	263	while (p_y->m_p_right != 0)
4569a895	264	p_y = p_y->m_p_right;
4569a895	265	m_p_nd = p_y;
4569a895 AT	266	return;
	267	}
	268
	269	Node_Pointer p_y = m_p_nd->m_p_parent;
4569a895 AT	270	while (m_p_nd == p_y->m_p_left)
	271	{
	272	m_p_nd = p_y;
4569a895 AT	273	p_y = p_y->m_p_parent;
4569a895 AT	274	}
4569a895 AT	275	if (m_p_nd->m_p_left != p_y)
	276	m_p_nd = p_y;
	277	}
	278
	279	public:
	280	Node_Pointer m_p_nd;
	281	};
	282
	283	// Iterator.
	284	template<typename Node_Pointer,
	285	typename Value_Type,
	286	typename Pointer,
	287	typename Const_Pointer,
	288	typename Reference,
	289	typename Const_Reference,
	290	bool Is_Forward_Iterator,
	291	class Allocator>
	292	class bin_search_tree_it_ :
	293	public PB_DS_TREE_CONST_IT_C_DEC
	294
	295	{
	296
	297	public:
	298
	299	inline
8fc81078	300	bin_search_tree_it_(const Node_Pointer p_nd = 0)
47bea7b8	301	: PB_DS_TREE_CONST_IT_C_DEC((Node_Pointer)p_nd)
4569a895 AT	302	{ }
	303
	304	inline
47bea7b8 BK	305	bin_search_tree_it_(const PB_DS_TREE_ODIR_IT_C_DEC& other)
47bea7b8 BK	306	: PB_DS_TREE_CONST_IT_C_DEC(other.m_p_nd)
4569a895 AT	307	{ }
	308
	309	inline
	310	PB_DS_TREE_IT_C_DEC&
	311	operator=(const PB_DS_TREE_IT_C_DEC& other)
	312	{
	313	base_it_type::m_p_nd = other.m_p_nd;
47bea7b8	314	return *this;
4569a895 AT	315	}
	316
	317	inline
	318	PB_DS_TREE_IT_C_DEC&
	319	operator=(const PB_DS_TREE_ODIR_IT_C_DEC& other)
	320	{
	321	base_it_type::m_p_nd = other.m_p_nd;
47bea7b8	322	return *this;
4569a895 AT	323	}
	324
	325	inline typename PB_DS_TREE_CONST_IT_C_DEC::pointer
	326	operator->() const
	327	{
8fc81078	328	_GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != 0);
47bea7b8	329	return &base_it_type::m_p_nd->m_value;
4569a895 AT	330	}
	331
	332	inline typename PB_DS_TREE_CONST_IT_C_DEC::reference
	333	operator*() const
	334	{
8fc81078	335	_GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != 0);
47bea7b8	336	return base_it_type::m_p_nd->m_value;
4569a895 AT	337	}
	338
	339	inline PB_DS_TREE_IT_C_DEC&
	340	operator++()
	341	{
47bea7b8 BK	342	PB_DS_TREE_CONST_IT_C_DEC:: operator++();
47bea7b8 BK	343	return *this;
4569a895 AT	344	}
	345
	346	inline PB_DS_TREE_IT_C_DEC
	347	operator++(int)
	348	{
47bea7b8	349	PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);
4569a895	350	operator++();
47bea7b8	351	return ret_it;
4569a895 AT	352	}
	353
	354	inline PB_DS_TREE_IT_C_DEC&
	355	operator--()
	356	{
47bea7b8 BK	357	PB_DS_TREE_CONST_IT_C_DEC:: operator--();
47bea7b8 BK	358	return *this;
4569a895 AT	359	}
	360
	361	inline PB_DS_TREE_IT_C_DEC
	362	operator--(int)
	363	{
47bea7b8	364	PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);
4569a895	365	operator--();
47bea7b8	366	return ret_it;
4569a895 AT	367	}
	368
	369	protected:
	370	typedef PB_DS_TREE_CONST_IT_C_DEC base_it_type;
	371	};
	372
	373	#undef PB_DS_TREE_CONST_IT_C_DEC
4569a895	374	#undef PB_DS_TREE_CONST_ODIR_IT_C_DEC
4569a895	375	#undef PB_DS_TREE_IT_C_DEC
4569a895 AT	376	#undef PB_DS_TREE_ODIR_IT_C_DEC
4569a895 AT	377
4569a895	378	} // namespace detail
5e11f978	379	} // namespace __gnu_pbds
4569a895	380
47bea7b8	381	#endif