debug.h (_GLIBCXX_DEBUG_ONLY): New.
[gcc.git] / libstdc++-v3 / include / ext / pb_ds / detail / bin_search_tree_ / find_fn_imps.hpp
1 // -*- C++ -*-
2
3 // Copyright (C) 2005, 2006 Free Software Foundation, Inc.
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
8 // Foundation; either version 2, or (at your option) any later
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
16 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19 // MA 02111-1307, USA.
20
21 // As a special exception, you may use this file as part of a free
22 // software library without restriction. Specifically, if other files
23 // instantiate templates or use macros or inline functions from this
24 // file, or you compile this file and link it with other files to
25 // produce an executable, this file does not by itself cause the
26 // resulting executable to be covered by the GNU General Public
27 // License. This exception does not however invalidate any other
28 // reasons why the executable file might be covered by the GNU General
29 // Public License.
30
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32
33 // Permission to use, copy, modify, sell, and distribute this software
34 // is hereby granted without fee, provided that the above copyright
35 // notice appears in all copies, and that both that copyright notice
36 // and this permission notice appear in supporting documentation. None
37 // of the above authors, nor IBM Haifa Research Laboratories, make any
38 // representation about the suitability of this software for any
39 // purpose. It is provided "as is" without express or implied
40 // warranty.
41
42 /**
43 * @file find_fn_imps.hpp
44 * Contains an implementation class for bin_search_tree_.
45 */
46
47 PB_DS_CLASS_T_DEC
48 inline typename PB_DS_CLASS_C_DEC::const_point_iterator
49 PB_DS_CLASS_C_DEC::
50 lower_bound(const_key_reference r_key) const
51 {
52 node_pointer p_pot = m_p_head;
53 node_pointer p_nd = m_p_head->m_p_parent;
54
55 while (p_nd != NULL)
56 if (Cmp_Fn::operator()(
57 PB_DS_V2F(p_nd->m_value),
58 r_key))
59 p_nd = p_nd->m_p_right;
60 else
61 {
62 p_pot = p_nd;
63
64 p_nd = p_nd->m_p_left;
65 }
66
67 return (iterator(p_pot));
68 }
69
70 PB_DS_CLASS_T_DEC
71 inline typename PB_DS_CLASS_C_DEC::point_iterator
72 PB_DS_CLASS_C_DEC::
73 lower_bound(const_key_reference r_key)
74 {
75 node_pointer p_pot = m_p_head;
76 node_pointer p_nd = m_p_head->m_p_parent;
77
78 while (p_nd != NULL)
79 if (Cmp_Fn::operator()(
80 PB_DS_V2F(p_nd->m_value),
81 r_key))
82 p_nd = p_nd->m_p_right;
83 else
84 {
85 p_pot = p_nd;
86
87 p_nd = p_nd->m_p_left;
88 }
89
90 return (iterator(p_pot));
91 }
92
93 PB_DS_CLASS_T_DEC
94 inline typename PB_DS_CLASS_C_DEC::const_point_iterator
95 PB_DS_CLASS_C_DEC::
96 upper_bound(const_key_reference r_key) const
97 {
98 node_pointer p_pot = m_p_head;
99 node_pointer p_nd = m_p_head->m_p_parent;
100
101 while (p_nd != NULL)
102 if (Cmp_Fn::operator()(r_key,
103 PB_DS_V2F(p_nd->m_value)))
104 {
105 p_pot = p_nd,
106
107 p_nd = p_nd->m_p_left;
108 }
109 else
110 p_nd = p_nd->m_p_right;
111
112 return (const_iterator(p_pot));
113 }
114
115 PB_DS_CLASS_T_DEC
116 inline typename PB_DS_CLASS_C_DEC::point_iterator
117 PB_DS_CLASS_C_DEC::
118 upper_bound(const_key_reference r_key)
119 {
120 node_pointer p_pot = m_p_head;
121 node_pointer p_nd = m_p_head->m_p_parent;
122
123 while (p_nd != NULL)
124 if (Cmp_Fn::operator()(r_key,
125 PB_DS_V2F(p_nd->m_value)))
126 {
127 p_pot = p_nd,
128
129 p_nd = p_nd->m_p_left;
130 }
131 else
132 p_nd = p_nd->m_p_right;
133
134 return (point_iterator(p_pot));
135 }
136
137 PB_DS_CLASS_T_DEC
138 inline typename PB_DS_CLASS_C_DEC::point_iterator
139 PB_DS_CLASS_C_DEC::
140 find(const_key_reference r_key)
141 {
142 _GLIBCXX_DEBUG_ONLY(structure_only_assert_valid();)
143
144 node_pointer p_pot = m_p_head;
145 node_pointer p_nd = m_p_head->m_p_parent;
146
147 while (p_nd != NULL)
148 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
149 {
150 p_pot = p_nd;
151
152 p_nd = p_nd->m_p_left;
153 }
154 else
155 p_nd = p_nd->m_p_right;
156
157 return point_iterator((p_pot != m_p_head&& Cmp_Fn::operator()(
158 r_key,
159 PB_DS_V2F(p_pot->m_value)))?
160 m_p_head : p_pot);
161 }
162
163 PB_DS_CLASS_T_DEC
164 inline typename PB_DS_CLASS_C_DEC::const_point_iterator
165 PB_DS_CLASS_C_DEC::
166 find(const_key_reference r_key) const
167 {
168 _GLIBCXX_DEBUG_ONLY(structure_only_assert_valid();)
169
170 node_pointer p_pot = m_p_head;
171 node_pointer p_nd = m_p_head->m_p_parent;
172
173 while (p_nd != NULL)
174 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
175 {
176 p_pot = p_nd;
177
178 p_nd = p_nd->m_p_left;
179 }
180 else
181 p_nd = p_nd->m_p_right;
182
183 return const_point_iterator((p_pot != m_p_head&& Cmp_Fn::operator()(
184 r_key,
185 PB_DS_V2F(p_pot->m_value)))?
186 m_p_head : p_pot);
187 }
188