3 // Copyright (C) 2005, 2006, 2009, 2010 Free Software Foundation, Inc.
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
8 // Foundation; either version 3, or (at your option) any later
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.
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.
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/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
37 * @file left_child_next_sibling_heap_/const_iterator.hpp
38 * Contains an iterator class returned by the table's const find and insert
42 #ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_CONST_ITERATOR_HPP
43 #define PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_CONST_ITERATOR_HPP
45 #include <ext/pb_ds/detail/left_child_next_sibling_heap_/point_const_iterator.hpp>
46 #include <debug/debug.h>
52 #define PB_DS_CLASS_C_DEC \
53 left_child_next_sibling_heap_const_iterator_<Node, _Alloc>
55 #define PB_DS_BASIC_HEAP_CIT_BASE \
56 left_child_next_sibling_heap_node_point_const_iterator_<Node, _Alloc>
58 /// Const point-type iterator.
59 template<typename Node, typename _Alloc>
60 class left_child_next_sibling_heap_const_iterator_
61 : public PB_DS_BASIC_HEAP_CIT_BASE
64 typedef PB_DS_BASIC_HEAP_CIT_BASE base_type;
65 typedef typename base_type::node_pointer node_pointer;
69 typedef std::forward_iterator_tag iterator_category;
72 typedef typename _Alloc::difference_type difference_type;
74 // Iterator's value type.
75 typedef typename base_type::value_type value_type;
77 // Iterator's pointer type.
78 typedef typename base_type::pointer pointer;
80 // Iterator's const pointer type.
81 typedef typename base_type::const_pointer const_pointer;
83 // Iterator's reference type.
84 typedef typename base_type::reference reference;
86 // Iterator's const reference type.
87 typedef typename base_type::const_reference const_reference;
90 left_child_next_sibling_heap_const_iterator_(node_pointer p_nd)
94 // Default constructor.
96 left_child_next_sibling_heap_const_iterator_()
101 left_child_next_sibling_heap_const_iterator_(const PB_DS_CLASS_C_DEC& other) : base_type(other)
104 // Compares content to a different iterator object.
106 operator==(const PB_DS_CLASS_C_DEC& other) const
107 { return (base_type::m_p_nd == other.m_p_nd); }
109 // Compares content (negatively) to a different iterator object.
111 operator!=(const PB_DS_CLASS_C_DEC& other) const
112 { return (base_type::m_p_nd != other.m_p_nd); }
114 inline PB_DS_CLASS_C_DEC&
117 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd != 0);
122 inline PB_DS_CLASS_C_DEC
125 PB_DS_CLASS_C_DEC ret_it(base_type::m_p_nd);
134 if (base_type::m_p_nd->m_p_next_sibling != 0)
136 base_type::m_p_nd = base_type::m_p_nd->m_p_next_sibling;
137 while (base_type::m_p_nd->m_p_l_child != 0)
138 base_type::m_p_nd = base_type::m_p_nd->m_p_l_child;
144 node_pointer p_next = base_type::m_p_nd;
145 base_type::m_p_nd = base_type::m_p_nd->m_p_prev_or_parent;
146 if (base_type::m_p_nd == 0
147 || base_type::m_p_nd->m_p_l_child == p_next)
153 #undef PB_DS_CLASS_C_DEC
154 #undef PB_DS_BASIC_HEAP_CIT_BASE
156 } // namespace detail
157 } // namespace __gnu_pbds