1169691Skan// -*- C++ -*- 2169691Skan 3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc. 4169691Skan// 5169691Skan// This file is part of the GNU ISO C++ Library. This library is free 6169691Skan// software; you can redistribute it and/or modify it under the terms 7169691Skan// of the GNU General Public License as published by the Free Software 8169691Skan// Foundation; either version 2, or (at your option) any later 9169691Skan// version. 10169691Skan 11169691Skan// This library is distributed in the hope that it will be useful, but 12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of 13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14169691Skan// General Public License for more details. 15169691Skan 16169691Skan// You should have received a copy of the GNU General Public License 17169691Skan// along with this library; see the file COPYING. If not, write to 18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19169691Skan// MA 02111-1307, USA. 20169691Skan 21169691Skan// As a special exception, you may use this file as part of a free 22169691Skan// software library without restriction. Specifically, if other files 23169691Skan// instantiate templates or use macros or inline functions from this 24169691Skan// file, or you compile this file and link it with other files to 25169691Skan// produce an executable, this file does not by itself cause the 26169691Skan// resulting executable to be covered by the GNU General Public 27169691Skan// License. This exception does not however invalidate any other 28169691Skan// reasons why the executable file might be covered by the GNU General 29169691Skan// Public License. 30169691Skan 31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32169691Skan 33169691Skan// Permission to use, copy, modify, sell, and distribute this software 34169691Skan// is hereby granted without fee, provided that the above copyright 35169691Skan// notice appears in all copies, and that both that copyright notice 36169691Skan// and this permission notice appear in supporting documentation. None 37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any 38169691Skan// representation about the suitability of this software for any 39169691Skan// purpose. It is provided "as is" without express or implied 40169691Skan// warranty. 41169691Skan 42169691Skan/** 43169691Skan * @file insert_fn_imps.hpp 44169691Skan * Contains an implementation for thin_heap_. 45169691Skan */ 46169691Skan 47169691SkanPB_DS_CLASS_T_DEC 48169691Skaninline typename PB_DS_CLASS_C_DEC::point_iterator 49169691SkanPB_DS_CLASS_C_DEC:: 50169691Skanpush(const_reference r_val) 51169691Skan{ 52169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 53169691Skan 54169691Skan node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 55169691Skan 56169691Skan p_nd->m_metadata = 0; 57169691Skan 58169691Skan p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL; 59169691Skan 60169691Skan if (base_type::m_p_root == NULL) 61169691Skan { 62169691Skan p_nd->m_p_next_sibling = NULL; 63169691Skan 64169691Skan m_p_max = base_type::m_p_root = p_nd; 65169691Skan 66169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 67169691Skan 68169691Skan return point_iterator(p_nd); 69169691Skan } 70169691Skan 71169691Skan p_nd->m_p_next_sibling = base_type::m_p_root; 72169691Skan 73169691Skan base_type::m_p_root->m_p_prev_or_parent = NULL; 74169691Skan 75169691Skan base_type::m_p_root = p_nd; 76169691Skan 77169691Skan update_max(p_nd); 78169691Skan 79169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 80169691Skan 81169691Skan return point_iterator(p_nd); 82169691Skan} 83169691Skan 84169691SkanPB_DS_CLASS_T_DEC 85169691Skaninline void 86169691SkanPB_DS_CLASS_C_DEC:: 87169691Skanmake_root(node_pointer p_nd) 88169691Skan{ 89169691Skan p_nd->m_metadata = 90169691Skan p_nd->m_p_l_child == NULL? 91169691Skan 0 : 92169691Skan 1 + p_nd->m_p_l_child->m_metadata; 93169691Skan} 94169691Skan 95169691SkanPB_DS_CLASS_T_DEC 96169691Skaninline void 97169691SkanPB_DS_CLASS_C_DEC:: 98169691Skanmake_root_and_link(node_pointer p_nd) 99169691Skan{ 100169691Skan make_root(p_nd); 101169691Skan 102169691Skan p_nd->m_p_prev_or_parent = NULL; 103169691Skan 104169691Skan p_nd->m_p_next_sibling = base_type::m_p_root; 105169691Skan 106169691Skan if (base_type::m_p_root != NULL) 107169691Skan base_type::m_p_root->m_p_prev_or_parent = NULL; 108169691Skan 109169691Skan base_type::m_p_root = p_nd; 110169691Skan 111169691Skan update_max(p_nd); 112169691Skan} 113169691Skan 114169691SkanPB_DS_CLASS_T_DEC 115169691Skaninline void 116169691SkanPB_DS_CLASS_C_DEC:: 117169691Skanfix(node_pointer p_y) 118169691Skan{ 119169691Skan while (true) 120169691Skan { 121169691Skan if (p_y->m_p_prev_or_parent == NULL) 122169691Skan { 123169691Skan fix_root(p_y); 124169691Skan 125169691Skan return; 126169691Skan } 127169691Skan else if (p_y->m_metadata == 1&& p_y->m_p_next_sibling == NULL) 128169691Skan { 129169691Skan if (p_y->m_p_l_child != NULL) 130169691Skan { 131169691Skan fix_sibling_rank_1_unmarked(p_y); 132169691Skan 133169691Skan return; 134169691Skan } 135169691Skan 136169691Skan fix_sibling_rank_1_marked(p_y); 137169691Skan 138169691Skan p_y = p_y->m_p_prev_or_parent; 139169691Skan } 140169691Skan else if (p_y->m_metadata > p_y->m_p_next_sibling->m_metadata + 1) 141169691Skan { 142169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_l_child != NULL); 143169691Skan 144169691Skan if (p_y->m_metadata != p_y->m_p_l_child->m_metadata + 2) 145169691Skan { 146169691Skan fix_sibling_general_unmarked(p_y); 147169691Skan 148169691Skan return; 149169691Skan } 150169691Skan 151169691Skan fix_sibling_general_marked(p_y); 152169691Skan 153169691Skan p_y = p_y->m_p_prev_or_parent; 154169691Skan } 155169691Skan else if ((p_y->m_p_l_child == NULL&& 156169691Skan p_y->m_metadata == 2) ||(p_y->m_p_l_child != NULL&& 157169691Skan p_y->m_metadata == p_y->m_p_l_child->m_metadata + 3)) 158169691Skan { 159169691Skan node_pointer p_z = p_y->m_p_prev_or_parent; 160169691Skan 161169691Skan fix_child(p_y); 162169691Skan 163169691Skan p_y = p_z; 164169691Skan } 165169691Skan else 166169691Skan return; 167169691Skan } 168169691Skan} 169169691Skan 170169691SkanPB_DS_CLASS_T_DEC 171169691Skaninline void 172169691SkanPB_DS_CLASS_C_DEC:: 173169691Skanfix_root(node_pointer p_y) 174169691Skan{ 175169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent == NULL); 176169691Skan 177169691Skan make_root(p_y); 178169691Skan 179169691Skan _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, true);) 180169691Skan } 181169691Skan 182169691SkanPB_DS_CLASS_T_DEC 183169691Skaninline void 184169691SkanPB_DS_CLASS_C_DEC:: 185169691Skanfix_sibling_rank_1_unmarked(node_pointer p_y) 186169691Skan{ 187169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL); 188169691Skan 189169691Skan _GLIBCXX_DEBUG_ONLY(node_pointer p_w = p_y->m_p_l_child;) 190169691Skan _GLIBCXX_DEBUG_ASSERT(p_w != NULL); 191169691Skan _GLIBCXX_DEBUG_ASSERT(p_w->m_p_next_sibling == NULL); 192169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_next_sibling == NULL); 193169691Skan 194169691Skan p_y->m_p_next_sibling = p_y->m_p_l_child; 195169691Skan 196169691Skan p_y->m_p_next_sibling->m_p_prev_or_parent = p_y; 197169691Skan 198169691Skan p_y->m_p_l_child = NULL; 199169691Skan 200169691Skan _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, false);) 201169691Skan } 202169691Skan 203169691SkanPB_DS_CLASS_T_DEC 204169691Skaninline void 205169691SkanPB_DS_CLASS_C_DEC:: 206169691Skanfix_sibling_rank_1_marked(node_pointer p_y) 207169691Skan{ 208169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL); 209169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_l_child == NULL); 210169691Skan 211169691Skan p_y->m_metadata = 0; 212169691Skan 213169691Skan _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, false);) 214169691Skan } 215169691Skan 216169691SkanPB_DS_CLASS_T_DEC 217169691Skaninline void 218169691SkanPB_DS_CLASS_C_DEC:: 219169691Skanfix_sibling_general_unmarked(node_pointer p_y) 220169691Skan{ 221169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL); 222169691Skan 223169691Skan node_pointer p_w = p_y->m_p_l_child; 224169691Skan _GLIBCXX_DEBUG_ASSERT(p_w != NULL); 225169691Skan _GLIBCXX_DEBUG_ASSERT(p_w->m_p_next_sibling != NULL); 226169691Skan 227169691Skan p_y->m_p_l_child = p_w->m_p_next_sibling; 228169691Skan p_w->m_p_next_sibling->m_p_prev_or_parent = p_y; 229169691Skan 230169691Skan p_w->m_p_next_sibling = p_y->m_p_next_sibling; 231169691Skan _GLIBCXX_DEBUG_ASSERT(p_w->m_p_next_sibling != NULL); 232169691Skan p_w->m_p_next_sibling->m_p_prev_or_parent = p_w; 233169691Skan 234169691Skan p_y->m_p_next_sibling = p_w; 235169691Skan p_w->m_p_prev_or_parent = p_y; 236169691Skan 237169691Skan _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, false);) 238169691Skan } 239169691Skan 240169691SkanPB_DS_CLASS_T_DEC 241169691Skaninline void 242169691SkanPB_DS_CLASS_C_DEC:: 243169691Skanfix_sibling_general_marked(node_pointer p_y) 244169691Skan{ 245169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL); 246169691Skan 247169691Skan --p_y->m_metadata; 248169691Skan 249169691Skan _GLIBCXX_DEBUG_ONLY(assert_node_consistent(p_y, false);) 250169691Skan } 251169691Skan 252169691SkanPB_DS_CLASS_T_DEC 253169691Skaninline void 254169691SkanPB_DS_CLASS_C_DEC:: 255169691Skanfix_child(node_pointer p_y) 256169691Skan{ 257169691Skan _GLIBCXX_DEBUG_ASSERT(p_y->m_p_prev_or_parent != NULL); 258169691Skan 259169691Skan if (p_y->m_p_next_sibling != NULL) 260169691Skan p_y->m_p_next_sibling->m_p_prev_or_parent = p_y->m_p_prev_or_parent; 261169691Skan 262169691Skan if (p_y->m_p_prev_or_parent->m_p_l_child == p_y) 263169691Skan p_y->m_p_prev_or_parent->m_p_l_child = p_y->m_p_next_sibling; 264169691Skan else 265169691Skan p_y->m_p_prev_or_parent->m_p_next_sibling = p_y->m_p_next_sibling; 266169691Skan 267169691Skan make_root_and_link(p_y); 268169691Skan} 269169691Skan 270169691SkanPB_DS_CLASS_T_DEC 271169691Skanvoid 272169691SkanPB_DS_CLASS_C_DEC:: 273169691Skanmodify(point_iterator it, const_reference r_new_val) 274169691Skan{ 275169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 276169691Skan node_pointer p_nd = it.m_p_nd; 277169691Skan 278169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd != NULL); 279169691Skan 280169691Skan const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); 281169691Skan 282169691Skan p_nd->m_value = r_new_val; 283169691Skan 284169691Skan if (smaller) 285169691Skan { 286169691Skan remove_node(p_nd); 287169691Skan 288169691Skan p_nd->m_p_l_child = NULL; 289169691Skan 290169691Skan make_root_and_link(p_nd); 291169691Skan 292169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 293169691Skan 294169691Skan return; 295169691Skan } 296169691Skan 297169691Skan if (p_nd->m_p_prev_or_parent == NULL) 298169691Skan { 299169691Skan update_max(p_nd); 300169691Skan 301169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 302169691Skan 303169691Skan return; 304169691Skan } 305169691Skan 306169691Skan node_pointer p_y = p_nd->m_p_prev_or_parent; 307169691Skan _GLIBCXX_DEBUG_ASSERT(p_y != NULL); 308169691Skan 309169691Skan if (p_nd->m_p_next_sibling != NULL) 310169691Skan p_nd->m_p_next_sibling->m_p_prev_or_parent = p_y; 311169691Skan 312169691Skan if (p_y->m_p_l_child == p_nd) 313169691Skan p_y->m_p_l_child = p_nd->m_p_next_sibling; 314169691Skan else 315169691Skan p_y->m_p_next_sibling = p_nd->m_p_next_sibling; 316169691Skan 317169691Skan fix(p_y); 318169691Skan 319169691Skan make_root_and_link(p_nd); 320169691Skan 321169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 322169691Skan } 323169691Skan 324169691SkanPB_DS_CLASS_T_DEC 325169691Skaninline void 326169691SkanPB_DS_CLASS_C_DEC:: 327169691Skanupdate_max(node_pointer p_nd) 328169691Skan{ 329169691Skan if (m_p_max == NULL || Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value)) 330169691Skan m_p_max = p_nd; 331169691Skan} 332169691Skan 333