3 // Copyright (C) 2005, 2006 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 2, 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 // 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.
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
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
43 * @file find_fn_imps.hpp
44 * Contains an implementation class for bin_search_tree_.
48 inline typename PB_DS_CLASS_C_DEC::const_point_iterator
50 lower_bound(const_key_reference r_key) const
52 node_pointer p_pot = m_p_head;
53 node_pointer p_nd = m_p_head->m_p_parent;
56 if (Cmp_Fn::operator()(
57 PB_DS_V2F(p_nd->m_value),
59 p_nd = p_nd->m_p_right;
64 p_nd = p_nd->m_p_left;
67 return (iterator(p_pot));
71 inline typename PB_DS_CLASS_C_DEC::point_iterator
73 lower_bound(const_key_reference r_key)
75 node_pointer p_pot = m_p_head;
76 node_pointer p_nd = m_p_head->m_p_parent;
79 if (Cmp_Fn::operator()(
80 PB_DS_V2F(p_nd->m_value),
82 p_nd = p_nd->m_p_right;
87 p_nd = p_nd->m_p_left;
90 return (iterator(p_pot));
94 inline typename PB_DS_CLASS_C_DEC::const_point_iterator
96 upper_bound(const_key_reference r_key) const
98 node_pointer p_pot = m_p_head;
99 node_pointer p_nd = m_p_head->m_p_parent;
102 if (Cmp_Fn::operator()(r_key,
103 PB_DS_V2F(p_nd->m_value)))
107 p_nd = p_nd->m_p_left;
110 p_nd = p_nd->m_p_right;
112 return (const_iterator(p_pot));
116 inline typename PB_DS_CLASS_C_DEC::point_iterator
118 upper_bound(const_key_reference r_key)
120 node_pointer p_pot = m_p_head;
121 node_pointer p_nd = m_p_head->m_p_parent;
124 if (Cmp_Fn::operator()(r_key,
125 PB_DS_V2F(p_nd->m_value)))
129 p_nd = p_nd->m_p_left;
132 p_nd = p_nd->m_p_right;
134 return (point_iterator(p_pot));
138 inline typename PB_DS_CLASS_C_DEC::point_iterator
140 find(const_key_reference r_key)
142 _GLIBCXX_DEBUG_ONLY(structure_only_assert_valid();)
144 node_pointer p_pot = m_p_head;
145 node_pointer p_nd = m_p_head->m_p_parent;
148 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
152 p_nd = p_nd->m_p_left;
155 p_nd = p_nd->m_p_right;
157 return point_iterator((p_pot != m_p_head&& Cmp_Fn::operator()(
159 PB_DS_V2F(p_pot->m_value)))?
164 inline typename PB_DS_CLASS_C_DEC::const_point_iterator
166 find(const_key_reference r_key) const
168 _GLIBCXX_DEBUG_ONLY(structure_only_assert_valid();)
170 node_pointer p_pot = m_p_head;
171 node_pointer p_nd = m_p_head->m_p_parent;
174 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
178 p_nd = p_nd->m_p_left;
181 p_nd = p_nd->m_p_right;
183 return const_point_iterator((p_pot != m_p_head&& Cmp_Fn::operator()(
185 PB_DS_V2F(p_pot->m_value)))?