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 split_fn_imps.hpp 44169691Skan * Contains an implementation class for bin_search_tree_. 45169691Skan */ 46169691Skan 47169691SkanPB_DS_CLASS_T_DEC 48169691Skanvoid 49169691SkanPB_DS_CLASS_C_DEC:: 50169691Skansplit(const_key_reference r_key, PB_DS_CLASS_C_DEC& other) 51169691Skan{ 52169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();); 53169691Skan _GLIBCXX_DEBUG_ONLY(other.assert_valid();); 54169691Skan split_join_branch_bag bag; 55169691Skan leaf_pointer p_split_lf = split_prep(r_key, other, bag); 56169691Skan if (p_split_lf == NULL) 57169691Skan { 58169691Skan _GLIBCXX_DEBUG_ASSERT(bag.empty()); 59169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();) 60169691Skan _GLIBCXX_DEBUG_ONLY(other.assert_valid();) 61169691Skan return; 62169691Skan } 63169691Skan 64169691Skan _GLIBCXX_DEBUG_ASSERT(!bag.empty()); 65169691Skan other.clear(); 66169691Skan m_p_head->m_p_parent = rec_split(m_p_head->m_p_parent, 67169691Skan pref_begin(p_split_lf), 68169691Skan pref_end(p_split_lf), 69169691Skan other, 70169691Skan bag); 71169691Skan 72169691Skan m_p_head->m_p_parent->m_p_parent = m_p_head; 73169691Skan 74169691Skan other.m_p_head->m_p_max = m_p_head->m_p_max; 75169691Skan m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); 76169691Skan other.m_p_head->m_p_min = 77169691Skan other.leftmost_descendant(other.m_p_head->m_p_parent); 78169691Skan 79169691Skan other.m_size = std::distance(other.PB_DS_CLASS_C_DEC::begin(), 80169691Skan other.PB_DS_CLASS_C_DEC::end()); 81169691Skan m_size -= other.m_size; 82169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();); 83169691Skan _GLIBCXX_DEBUG_ONLY(other.assert_valid();); 84169691Skan} 85169691Skan 86169691SkanPB_DS_CLASS_T_DEC 87169691Skantypename PB_DS_CLASS_C_DEC::leaf_pointer 88169691SkanPB_DS_CLASS_C_DEC:: 89169691Skansplit_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag) 90169691Skan{ 91169691Skan _GLIBCXX_DEBUG_ASSERT(r_bag.empty()); 92169691Skan if (m_size == 0) 93169691Skan { 94169691Skan other.clear(); 95169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();); 96169691Skan _GLIBCXX_DEBUG_ONLY(other.assert_valid();); 97169691Skan return (NULL); 98169691Skan } 99169691Skan 100169691Skan if (synth_e_access_traits::cmp_keys(r_key, 101169691Skan PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_min)->value()))) 102169691Skan { 103169691Skan other.clear(); 104169691Skan value_swap(other); 105169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();); 106169691Skan _GLIBCXX_DEBUG_ONLY(other.assert_valid();); 107169691Skan return (NULL); 108169691Skan } 109169691Skan 110169691Skan if (!synth_e_access_traits::cmp_keys(r_key, 111169691Skan PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_max)->value()))) 112169691Skan { 113169691Skan _GLIBCXX_DEBUG_ONLY(assert_valid();); 114169691Skan _GLIBCXX_DEBUG_ONLY(other.assert_valid();); 115169691Skan return (NULL); 116169691Skan } 117169691Skan 118169691Skan iterator it = lower_bound(r_key); 119169691Skan 120169691Skan if (!synth_e_access_traits::equal_keys(PB_DS_V2F(*it), r_key)) 121169691Skan --it; 122169691Skan 123169691Skan node_pointer p_nd = it.m_p_nd; 124169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_leaf_node_type); 125169691Skan leaf_pointer p_ret_l = static_cast<leaf_pointer>(p_nd); 126169691Skan while (p_nd->m_type != pat_trie_head_node_type) 127169691Skan { 128169691Skan r_bag.add_branch(); 129169691Skan p_nd = p_nd->m_p_parent; 130169691Skan } 131169691Skan _GLIBCXX_DEBUG_ONLY(map_debug_base::split(r_key,(synth_e_access_traits& )(*this), other);) 132169691Skan 133169691Skan return (p_ret_l); 134169691Skan} 135169691Skan 136169691SkanPB_DS_CLASS_T_DEC 137169691Skantypename PB_DS_CLASS_C_DEC::node_pointer 138169691SkanPB_DS_CLASS_C_DEC:: 139169691Skanrec_split(node_pointer p_nd, const_e_iterator b_it, const_e_iterator e_it, PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag) 140169691Skan{ 141169691Skan if (p_nd->m_type == pat_trie_leaf_node_type) 142169691Skan { 143169691Skan _GLIBCXX_DEBUG_ASSERT(other.m_p_head->m_p_parent == NULL); 144169691Skan return (p_nd); 145169691Skan } 146169691Skan 147169691Skan _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_internal_node_type); 148169691Skan internal_node_pointer p_internal_nd = static_cast<internal_node_pointer>(p_nd); 149169691Skan 150169691Skan node_pointer p_child_ret = rec_split(p_internal_nd->get_child_node(b_it, e_it, this), b_it, e_it, other, r_bag); 151169691Skan 152169691Skan _GLIBCXX_DEBUG_ONLY(p_child_ret->assert_valid(this);) 153169691Skan p_internal_nd->replace_child(p_child_ret, b_it, e_it, this); 154169691Skan apply_update(p_internal_nd, (node_update* )this); 155169691Skan 156169691Skan typename internal_node::iterator child_it = 157169691Skan p_internal_nd->get_child_it(b_it, e_it, this); 158169691Skan 159169691Skan const size_type lhs_num_children = 160169691Skan std::distance(p_internal_nd->begin(), child_it) + 1; 161169691Skan 162169691Skan _GLIBCXX_DEBUG_ASSERT(lhs_num_children > 0); 163169691Skan 164169691Skan size_type rhs_num_children = 165169691Skan std::distance(p_internal_nd->begin(), p_internal_nd->end()) - 166169691Skan lhs_num_children; 167169691Skan 168169691Skan if (rhs_num_children == 0) 169169691Skan { 170169691Skan apply_update(p_internal_nd, (node_update* )this); 171169691Skan return (p_internal_nd); 172169691Skan } 173169691Skan 174169691Skan ++child_it; 175169691Skan other.split_insert_branch(p_internal_nd->get_e_ind(), 176169691Skan b_it, child_it, rhs_num_children, r_bag); 177169691Skan 178169691Skan child_it = p_internal_nd->get_child_it(b_it, e_it, this); 179169691Skan ++child_it; 180169691Skan while (rhs_num_children != 0) 181169691Skan { 182169691Skan child_it = p_internal_nd->remove_child(child_it); 183169691Skan --rhs_num_children; 184169691Skan } 185169691Skan 186169691Skan apply_update(p_internal_nd, (node_update* )this); 187169691Skan _GLIBCXX_DEBUG_ASSERT(std::distance(p_internal_nd->begin(), 188169691Skan p_internal_nd->end()) >= 1); 189169691Skan 190169691Skan if (std::distance(p_internal_nd->begin(), p_internal_nd->end()) > 1) 191169691Skan { 192169691Skan p_internal_nd->update_prefixes(this); 193169691Skan _GLIBCXX_DEBUG_ONLY(p_internal_nd->assert_valid(this);) 194169691Skan apply_update(p_internal_nd, (node_update* )this); 195169691Skan return (p_internal_nd); 196169691Skan } 197169691Skan 198169691Skan node_pointer p_ret =* p_internal_nd->begin(); 199169691Skan p_internal_nd->~internal_node(); 200169691Skan s_internal_node_allocator.deallocate(p_internal_nd, 1); 201169691Skan apply_update(p_ret, (node_update* )this); 202169691Skan return (p_ret); 203169691Skan} 204169691Skan 205169691SkanPB_DS_CLASS_T_DEC 206169691Skanvoid 207169691SkanPB_DS_CLASS_C_DEC:: 208169691Skansplit_insert_branch(size_type e_ind, const_e_iterator b_it, typename internal_node::iterator child_b_it, size_type num_children, split_join_branch_bag& r_bag) 209169691Skan{ 210169691Skan#ifdef _GLIBCXX_DEBUG 211169691Skan if (m_p_head->m_p_parent != NULL) 212169691Skan m_p_head->m_p_parent->assert_valid(this); 213169691Skan#endif 214169691Skan 215169691Skan const size_type total_num_children =((m_p_head->m_p_parent == NULL)? 0 : 1) + num_children; 216169691Skan 217169691Skan if (total_num_children == 0) 218169691Skan { 219169691Skan _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_parent == NULL); 220169691Skan return; 221169691Skan } 222169691Skan 223169691Skan if (total_num_children == 1) 224169691Skan { 225169691Skan if (m_p_head->m_p_parent != NULL) 226169691Skan { 227169691Skan _GLIBCXX_DEBUG_ONLY(m_p_head->m_p_parent->assert_valid(this);) 228169691Skan return; 229169691Skan } 230169691Skan 231169691Skan _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_parent == NULL); 232169691Skan m_p_head->m_p_parent =* child_b_it; 233169691Skan m_p_head->m_p_parent->m_p_parent = m_p_head; 234169691Skan apply_update(m_p_head->m_p_parent, (node_update* )this); 235169691Skan _GLIBCXX_DEBUG_ONLY(m_p_head->m_p_parent->assert_valid(this);) 236169691Skan return; 237169691Skan } 238169691Skan 239169691Skan _GLIBCXX_DEBUG_ASSERT(total_num_children > 1); 240169691Skan internal_node_pointer p_new_root = r_bag.get_branch(); 241169691Skan new (p_new_root) internal_node(e_ind, b_it); 242169691Skan size_type num_inserted = 0; 243169691Skan while (num_inserted++ < num_children) 244169691Skan { 245169691Skan _GLIBCXX_DEBUG_ONLY((*child_b_it)->assert_valid(this);) 246169691Skan p_new_root->add_child(*child_b_it, pref_begin(*child_b_it), 247169691Skan pref_end(*child_b_it), this); 248169691Skan ++child_b_it; 249169691Skan } 250169691Skan 251169691Skan if (m_p_head->m_p_parent != NULL) 252169691Skan p_new_root->add_child(m_p_head->m_p_parent, 253169691Skan pref_begin(m_p_head->m_p_parent), 254169691Skan pref_end(m_p_head->m_p_parent), this); 255169691Skan 256169691Skan m_p_head->m_p_parent = p_new_root; 257169691Skan p_new_root->m_p_parent = m_p_head; 258169691Skan apply_update(m_p_head->m_p_parent, (node_update* )this); 259169691Skan _GLIBCXX_DEBUG_ONLY(m_p_head->m_p_parent->assert_valid(this);) 260169691Skan} 261