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 class for a base of binomial heaps. 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(true);) 53169691Skan 54169691Skan node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 55169691Skan 56169691Skan insert_node(p_nd); 57169691Skan 58169691Skan m_p_max = NULL; 59169691Skan 60169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 61169691Skan 62169691Skan return point_iterator(p_nd); 63169691Skan} 64169691Skan 65169691SkanPB_DS_CLASS_T_DEC 66169691Skaninline void 67169691SkanPB_DS_CLASS_C_DEC:: 68169691Skaninsert_node(node_pointer p_nd) 69169691Skan{ 70169691Skan if (base_type::m_p_root == NULL) 71169691Skan { 72169691Skan p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 73169691Skan p_nd->m_p_l_child = NULL; 74169691Skan 75169691Skan p_nd->m_metadata = 0; 76169691Skan 77169691Skan base_type::m_p_root = p_nd; 78169691Skan 79169691Skan return; 80169691Skan } 81169691Skan 82169691Skan if (base_type::m_p_root->m_metadata > 0) 83169691Skan { 84169691Skan p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL; 85169691Skan 86169691Skan p_nd->m_p_next_sibling = base_type::m_p_root; 87169691Skan 88169691Skan base_type::m_p_root->m_p_prev_or_parent = p_nd; 89169691Skan 90169691Skan base_type::m_p_root = p_nd; 91169691Skan 92169691Skan p_nd->m_metadata = 0; 93169691Skan 94169691Skan return; 95169691Skan } 96169691Skan 97169691Skan if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) 98169691Skan { 99169691Skan p_nd->m_p_next_sibling = base_type::m_p_root->m_p_next_sibling; 100169691Skan 101169691Skan p_nd->m_p_prev_or_parent = NULL; 102169691Skan 103169691Skan p_nd->m_metadata = 1; 104169691Skan 105169691Skan p_nd->m_p_l_child = base_type::m_p_root; 106169691Skan 107169691Skan base_type::m_p_root->m_p_prev_or_parent = p_nd; 108169691Skan 109169691Skan base_type::m_p_root->m_p_next_sibling = NULL; 110169691Skan 111169691Skan base_type::m_p_root = p_nd; 112169691Skan } 113169691Skan else 114169691Skan { 115169691Skan p_nd->m_p_next_sibling = NULL; 116169691Skan 117169691Skan p_nd->m_p_l_child = NULL; 118169691Skan 119169691Skan p_nd->m_p_prev_or_parent = base_type::m_p_root; 120169691Skan 121169691Skan p_nd->m_metadata = 0; 122169691Skan 123169691Skan _GLIBCXX_DEBUG_ASSERT(base_type::m_p_root->m_p_l_child == 0); 124169691Skan base_type::m_p_root->m_p_l_child = p_nd; 125169691Skan 126169691Skan base_type::m_p_root->m_metadata = 1; 127169691Skan } 128169691Skan 129169691Skan base_type::m_p_root = fix(base_type::m_p_root); 130169691Skan} 131169691Skan 132169691SkanPB_DS_CLASS_T_DEC 133169691Skaninline typename PB_DS_CLASS_C_DEC::node_pointer 134169691SkanPB_DS_CLASS_C_DEC:: 135169691Skanfix(node_pointer p_nd) const 136169691Skan{ 137169691Skan while (p_nd->m_p_next_sibling != NULL&& 138169691Skan p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata) 139169691Skan { 140169691Skan node_pointer p_next = p_nd->m_p_next_sibling; 141169691Skan 142169691Skan if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) 143169691Skan { 144169691Skan p_next->m_p_prev_or_parent = 145169691Skan p_nd->m_p_prev_or_parent; 146169691Skan 147169691Skan if (p_nd->m_p_prev_or_parent != NULL) 148169691Skan p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next; 149169691Skan 150169691Skan base_type::make_child_of(p_nd, p_next); 151169691Skan 152169691Skan ++p_next->m_metadata; 153169691Skan 154169691Skan p_nd = p_next; 155169691Skan } 156169691Skan else 157169691Skan { 158169691Skan p_nd->m_p_next_sibling = p_next->m_p_next_sibling; 159169691Skan 160169691Skan if (p_nd->m_p_next_sibling != NULL) 161169691Skan p_next->m_p_next_sibling = NULL; 162169691Skan 163169691Skan base_type::make_child_of(p_next, p_nd); 164169691Skan 165169691Skan ++p_nd->m_metadata; 166169691Skan } 167169691Skan } 168169691Skan 169169691Skan if (p_nd->m_p_next_sibling != NULL) 170169691Skan p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd; 171169691Skan 172169691Skan return p_nd; 173169691Skan} 174169691Skan 175169691SkanPB_DS_CLASS_T_DEC 176169691Skanvoid 177169691SkanPB_DS_CLASS_C_DEC:: 178169691Skanmodify(point_iterator it, const_reference r_new_val) 179169691Skan{ 180169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 181169691Skan node_pointer p_nd = it.m_p_nd; 182169691Skan 183169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd != NULL); 184169691Skan _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd, false);) 185169691Skan 186169691Skan const bool bubble_up = Cmp_Fn::operator()(p_nd->m_value, r_new_val); 187169691Skan 188169691Skan p_nd->m_value = r_new_val; 189169691Skan 190169691Skan if (bubble_up) 191169691Skan { 192169691Skan node_pointer p_parent = base_type::parent(p_nd); 193169691Skan 194169691Skan while (p_parent != NULL&& 195169691Skan Cmp_Fn::operator()(p_parent->m_value, p_nd->m_value)) 196169691Skan { 197169691Skan base_type::swap_with_parent(p_nd, p_parent); 198169691Skan 199169691Skan p_parent = base_type::parent(p_nd); 200169691Skan } 201169691Skan 202169691Skan if (p_nd->m_p_prev_or_parent == NULL) 203169691Skan base_type::m_p_root = p_nd; 204169691Skan 205169691Skan m_p_max = NULL; 206169691Skan 207169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 208169691Skan 209169691Skan return; 210169691Skan } 211169691Skan 212169691Skan base_type::bubble_to_top(p_nd); 213169691Skan 214169691Skan remove_parentless_node(p_nd); 215169691Skan 216169691Skan insert_node(p_nd); 217169691Skan 218169691Skan m_p_max = NULL; 219169691Skan 220169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid(true);) 221169691Skan } 222169691Skan 223