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 insert_fn_imps.hpp
38 * Contains an implementation class for bin_search_tree_.
42 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
44 insert_leaf(const_reference r_value)
46 _GLIBCXX_DEBUG_ONLY(structure_only_assert_valid();)
49 return (std::make_pair(
50 insert_imp_empty(r_value),
53 node_pointer p_nd = m_p_head->m_p_parent;
54 node_pointer p_pot = m_p_head;
57 if (!Cmp_Fn::operator()(
58 PB_DS_V2F(p_nd->m_value),
63 p_nd = p_nd->m_p_left;
66 p_nd = p_nd->m_p_right;
68 if (p_pot == m_p_head)
69 return (std::make_pair(
70 insert_leaf_new(r_value, m_p_head->m_p_right, false),
73 if (!Cmp_Fn::operator()(
75 PB_DS_V2F(p_pot->m_value)))
77 _GLIBCXX_DEBUG_ONLY(structure_only_assert_valid();)
79 _GLIBCXX_DEBUG_ONLY(debug_base::check_key_exists(
82 return (std::make_pair(p_pot, false));
85 _GLIBCXX_DEBUG_ONLY(debug_base::check_key_does_not_exist(
88 p_nd = p_pot->m_p_left;
90 return (std::make_pair(
91 insert_leaf_new(r_value, p_pot, true),
94 while (p_nd->m_p_right != NULL)
95 p_nd = p_nd->m_p_right;
97 return (std::make_pair(
98 insert_leaf_new(r_value, p_nd, false),
103 inline typename PB_DS_CLASS_C_DEC::iterator
105 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd)
107 node_pointer p_new_nd =
108 get_new_node_for_leaf_insert( r_value, traits_base::m_no_throw_copies_indicator);
112 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == NULL);
113 _GLIBCXX_DEBUG_ASSERT(Cmp_Fn::operator()(
115 PB_DS_V2F(p_nd->m_value)));
117 p_nd->m_p_left = p_new_nd;
119 if (m_p_head->m_p_left == p_nd)
120 m_p_head->m_p_left = p_new_nd;
124 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_right == NULL);
125 _GLIBCXX_DEBUG_ASSERT(Cmp_Fn::operator()(
126 PB_DS_V2F(p_nd->m_value),
127 PB_DS_V2F(r_value)));
129 p_nd->m_p_right = p_new_nd;
131 if (m_p_head->m_p_right == p_nd)
132 m_p_head->m_p_right = p_new_nd;
135 p_new_nd->m_p_parent = p_nd;
137 p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
139 _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_nd));
141 update_to_top(p_new_nd, (node_update* )this);
143 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(
144 PB_DS_V2F(r_value)));
146 return (iterator(p_new_nd));
150 inline typename PB_DS_CLASS_C_DEC::iterator
152 insert_imp_empty(const_reference r_value)
154 node_pointer p_new_node =
155 get_new_node_for_leaf_insert( r_value, traits_base::m_no_throw_copies_indicator);
157 m_p_head->m_p_left = m_p_head->m_p_right =
158 m_p_head->m_p_parent = p_new_node;
160 p_new_node->m_p_parent = m_p_head;
162 p_new_node->m_p_left = p_new_node->m_p_right = NULL;
164 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(
165 PB_DS_V2F(r_value)));
167 update_to_top(m_p_head->m_p_parent, (node_update* )this);
169 return (iterator(p_new_node));
173 inline typename PB_DS_CLASS_C_DEC::node_pointer
175 get_new_node_for_leaf_insert(const_reference r_val, false_type)
177 node_pointer p_new_nd = s_node_allocator.allocate(1);
179 cond_dealtor_t cond(p_new_nd);
181 new (const_cast<void* >(
182 static_cast<const void* >(&p_new_nd->m_value)))
183 typename node::value_type(r_val);
185 cond.set_no_action();
187 p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
195 inline typename PB_DS_CLASS_C_DEC::node_pointer
197 get_new_node_for_leaf_insert(const_reference r_val, true_type)
199 node_pointer p_new_nd = s_node_allocator.allocate(1);
201 new (const_cast<void* >(
202 static_cast<const void* >(&p_new_nd->m_value)))
203 typename node::value_type(r_val);
205 p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;