3 // Copyright (C) 2005, 2006, 2009 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 node_iterators.hpp
38 * Contains an implementation class for bin_search_tree_.
41 #ifndef PB_DS_BIN_SEARCH_TREE_NODE_ITERATORS_HPP
42 #define PB_DS_BIN_SEARCH_TREE_NODE_ITERATORS_HPP
44 #include <ext/pb_ds/tag_and_trait.hpp>
51 #define PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC \
52 bin_search_tree_const_node_it_< \
58 // Const node iterator.
59 template<typename Node,
63 class bin_search_tree_const_node_it_
69 typename Allocator::template rebind<
76 typedef trivial_iterator_tag iterator_category;
79 typedef trivial_iterator_difference_type difference_type;
81 // __Iterator's value type.
82 typedef Const_Iterator value_type;
84 // __Iterator's reference type.
85 typedef Const_Iterator reference;
87 // __Iterator's __const reference type.
88 typedef Const_Iterator const_reference;
91 typedef typename Node::metadata_type metadata_type;
93 // Const metadata reference type.
95 typename Allocator::template rebind<
96 metadata_type>::other::const_reference
97 const_metadata_reference;
101 // Default constructor.
104 bin_search_tree_const_node_it_()
108 bin_search_tree_const_node_it_(const node_pointer p_nd = NULL) : m_p_nd(const_cast<node_pointer>(p_nd))
112 inline const_reference
115 return (Const_Iterator(m_p_nd));
119 inline const_metadata_reference
122 return (m_p_nd->get_metadata());
125 // Returns the __const node iterator associated with the left node.
126 inline PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC
129 return (PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(m_p_nd->m_p_left));
132 // Returns the __const node iterator associated with the right node.
133 inline PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC
136 return (PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(m_p_nd->m_p_right));
139 // Compares to a different iterator object.
141 operator==(const PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC& other) const
143 return (m_p_nd == other.m_p_nd);
146 // Compares (negatively) to a different iterator object.
148 operator!=(const PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC& other) const
150 return (m_p_nd != other.m_p_nd);
157 #define PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC \
158 bin_search_tree_node_it_< \
165 template<typename Node,
166 class Const_Iterator,
169 class bin_search_tree_node_it_ :
170 public PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC
176 typename Allocator::template rebind<
177 Node>::other::pointer
182 // __Iterator's value type.
183 typedef Iterator value_type;
185 // __Iterator's reference type.
186 typedef Iterator reference;
188 // __Iterator's __const reference type.
189 typedef Iterator const_reference;
193 // Default constructor.
196 bin_search_tree_node_it_();
200 bin_search_tree_node_it_(const node_pointer p_nd = NULL) : PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(
201 const_cast<node_pointer>(p_nd))
208 return (Iterator(PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC::m_p_nd));
211 // Returns the node iterator associated with the left node.
212 inline PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC
215 return (PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC(
216 PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC::m_p_nd->m_p_left));
219 // Returns the node iterator associated with the right node.
220 inline PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC
223 return (PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC(
224 PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC::m_p_nd->m_p_right));
229 #undef PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC
231 #undef PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC
233 } // namespace detail
234 } // namespace __gnu_pbds
236 #endif // #ifndef PB_DS_BIN_SEARCH_TREE_NODE_ITERATORS_HPP