libstdc++: insert_fn_imps.hpp Source File

libstdc++

rb_tree_map_/insert_fn_imps.hpp
Go to the documentation of this file.
1// -*- C++ -*-
2
3// Copyright (C) 2005-2026 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 3, 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// 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.
19
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/>.
24
25// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
26
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
34// warranty.
35
36/**
37 * @file rb_tree_map_/insert_fn_imps.hpp
38 * Contains an implementation for rb_tree_.
39 */
40
41#ifdef PB_DS_CLASS_C_DEC
42
43PB_DS_CLASS_T_DEC
44inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
45PB_DS_CLASS_C_DEC::
46insert(const_reference r_value)
47{
48 PB_DS_ASSERT_VALID((*this))
49 std::pair<point_iterator, bool> ins_pair = base_type::insert_leaf(r_value);
50 if (ins_pair.second == true)
51 {
52 ins_pair.first.m_p_nd->m_red = true;
53 PB_DS_STRUCT_ONLY_ASSERT_VALID((*this))
54 insert_fixup(ins_pair.first.m_p_nd);
55 }
56
57 PB_DS_ASSERT_VALID((*this))
58 return ins_pair;
59}
60
61PB_DS_CLASS_T_DEC
62inline void
63PB_DS_CLASS_C_DEC::
64insert_fixup(node_pointer p_nd)
65{
66 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
67 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
68 {
69 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
70 {
71 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
72 if (p_y != 0 && p_y->m_red)
73 {
74 p_nd->m_p_parent->m_red = false;
75 p_y->m_red = false;
76 p_nd->m_p_parent->m_p_parent->m_red = true;
77 p_nd = p_nd->m_p_parent->m_p_parent;
78 }
79 else
80 {
81 if (p_nd == p_nd->m_p_parent->m_p_right)
82 {
83 p_nd = p_nd->m_p_parent;
84 base_type::rotate_left(p_nd);
85 }
86 p_nd->m_p_parent->m_red = false;
87 p_nd->m_p_parent->m_p_parent->m_red = true;
88 base_type::rotate_right(p_nd->m_p_parent->m_p_parent);
89 }
90 }
91 else
92 {
93 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left;
94 if (p_y != 0 && p_y->m_red)
95 {
96 p_nd->m_p_parent->m_red = false;
97 p_y->m_red = false;
98 p_nd->m_p_parent->m_p_parent->m_red = true;
99 p_nd = p_nd->m_p_parent->m_p_parent;
100 }
101 else
102 {
103 if (p_nd == p_nd->m_p_parent->m_p_left)
104 {
105 p_nd = p_nd->m_p_parent;
106 base_type::rotate_right(p_nd);
107 }
108 p_nd->m_p_parent->m_red = false;
109 p_nd->m_p_parent->m_p_parent->m_red = true;
110 base_type::rotate_left(p_nd->m_p_parent->m_p_parent);
111 }
112 }
113 }
114
115 base_type::update_to_top(p_nd, (node_update* )this);
116 base_type::m_p_head->m_p_parent->m_red = false;
117}
118#endif
std
ISO C++ entities toplevel namespace is std.
std::pair
Struct holding two objects (or references) of arbitrary type.
Definition stl_pair.h:307