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 insert_fn_imps.hpp
44 * Contains an implementation for rb_tree_.
45 */
46
47 PB_DS_CLASS_T_DEC
48 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
49 PB_DS_CLASS_C_DEC::
insert(const_reference r_value)50 insert(const_reference r_value)
51 {
52 _GLIBCXX_DEBUG_ONLY(assert_valid();)
53 std::pair<point_iterator, bool> ins_pair = base_type::insert_leaf(r_value);
54 if (ins_pair.second == true)
55 {
56 ins_pair.first.m_p_nd->m_red = true;
57 _GLIBCXX_DEBUG_ONLY(this->structure_only_assert_valid();)
58 insert_fixup(ins_pair.first.m_p_nd);
59 }
60
61 _GLIBCXX_DEBUG_ONLY(assert_valid();)
62 return ins_pair;
63 }
64
65 PB_DS_CLASS_T_DEC
66 inline void
67 PB_DS_CLASS_C_DEC::
insert_fixup(node_pointer p_nd)68 insert_fixup(node_pointer p_nd)
69 {
70 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
71 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
72 {
73 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
74 {
75 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
76 if (p_y != NULL && p_y->m_red)
77 {
78 p_nd->m_p_parent->m_red = false;
79 p_y->m_red = false;
80 p_nd->m_p_parent->m_p_parent->m_red = true;
81 p_nd = p_nd->m_p_parent->m_p_parent;
82 }
83 else
84 {
85 if (p_nd == p_nd->m_p_parent->m_p_right)
86 {
87 p_nd = p_nd->m_p_parent;
88 base_type::rotate_left(p_nd);
89 }
90 p_nd->m_p_parent->m_red = false;
91 p_nd->m_p_parent->m_p_parent->m_red = true;
92 base_type::rotate_right(p_nd->m_p_parent->m_p_parent);
93 }
94 }
95 else
96 {
97 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left;
98 if (p_y != NULL && p_y->m_red)
99 {
100 p_nd->m_p_parent->m_red = false;
101 p_y->m_red = false;
102 p_nd->m_p_parent->m_p_parent->m_red = true;
103 p_nd = p_nd->m_p_parent->m_p_parent;
104 }
105 else
106 {
107 if (p_nd == p_nd->m_p_parent->m_p_left)
108 {
109 p_nd = p_nd->m_p_parent;
110 base_type::rotate_right(p_nd);
111 }
112 p_nd->m_p_parent->m_red = false;
113 p_nd->m_p_parent->m_p_parent->m_red = true;
114 base_type::rotate_left(p_nd->m_p_parent->m_p_parent);
115 }
116 }
117 }
118
119 base_type::update_to_top(p_nd, (node_update* )this);
120 base_type::m_p_head->m_p_parent->m_red = false;
121 }
122