1// -*- C++ -*- 2 3// Copyright (C) 2005-2022 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 splay_tree_/split_join_fn_imps.hpp 38 * Contains an implementation class for splay_tree_. 39 */ 40 41#ifdef PB_DS_CLASS_C_DEC 42 43PB_DS_CLASS_T_DEC 44inline void 45PB_DS_CLASS_C_DEC:: 46join(PB_DS_CLASS_C_DEC& other) 47{ 48 PB_DS_ASSERT_VALID((*this)) 49 PB_DS_ASSERT_VALID(other) 50 if (base_type::join_prep(other) == false) 51 { 52 PB_DS_ASSERT_VALID((*this)) 53 PB_DS_ASSERT_VALID(other) 54 return; 55 } 56 57 node_pointer p_target_r = other.leftmost(other.m_p_head); 58 _GLIBCXX_DEBUG_ASSERT(p_target_r != 0); 59 other.splay(p_target_r); 60 61 _GLIBCXX_DEBUG_ASSERT(p_target_r == other.m_p_head->m_p_parent); 62 _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_left == 0); 63 64 p_target_r->m_p_left = base_type::m_p_head->m_p_parent; 65 66 _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_left != 0); 67 p_target_r->m_p_left->m_p_parent = p_target_r; 68 69 base_type::m_p_head->m_p_parent = p_target_r; 70 p_target_r->m_p_parent = base_type::m_p_head; 71 72 this->apply_update(p_target_r, (node_update*)this); 73 base_type::join_finish(other); 74 75 PB_DS_ASSERT_VALID((*this)) 76 PB_DS_ASSERT_VALID(other) 77} 78 79PB_DS_CLASS_T_DEC 80void 81PB_DS_CLASS_C_DEC:: 82split(key_const_reference r_key, PB_DS_CLASS_C_DEC& other) 83{ 84 PB_DS_ASSERT_VALID((*this)) 85 PB_DS_ASSERT_VALID(other) 86 87 if (base_type::split_prep(r_key, other) == false) 88 { 89 PB_DS_ASSERT_VALID((*this)) 90 PB_DS_ASSERT_VALID(other) 91 return; 92 } 93 94 node_pointer p_upper_bound = this->upper_bound(r_key).m_p_nd; 95 _GLIBCXX_DEBUG_ASSERT(p_upper_bound != 0); 96 97 splay(p_upper_bound); 98 _GLIBCXX_DEBUG_ASSERT(p_upper_bound->m_p_parent == this->m_p_head); 99 100 node_pointer p_new_root = p_upper_bound->m_p_left; 101 _GLIBCXX_DEBUG_ASSERT(p_new_root != 0); 102 103 base_type::m_p_head->m_p_parent = p_new_root; 104 p_new_root->m_p_parent = base_type::m_p_head; 105 other.m_p_head->m_p_parent = p_upper_bound; 106 p_upper_bound->m_p_parent = other.m_p_head; 107 p_upper_bound->m_p_left = 0; 108 this->apply_update(p_upper_bound, (node_update*)this); 109 base_type::split_finish(other); 110 111 PB_DS_ASSERT_VALID((*this)) 112 PB_DS_ASSERT_VALID(other) 113} 114 115#endif 116