1// -*- C++ -*- 2 3// Copyright (C) 2005-2020 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 bin_search_tree_/split_join_fn_imps.hpp 38 * Contains an implementation class for bin_search_tree_. 39 */ 40 41#ifdef PB_DS_CLASS_C_DEC 42 43PB_DS_CLASS_T_DEC 44bool 45PB_DS_CLASS_C_DEC:: 46join_prep(PB_DS_CLASS_C_DEC& other) 47{ 48 PB_DS_ASSERT_VALID((*this)) 49 PB_DS_ASSERT_VALID(other) 50 if (other.m_size == 0) 51 return false; 52 53 if (m_size == 0) 54 { 55 value_swap(other); 56 return false; 57 } 58 59 const bool greater = 60 Cmp_Fn::operator()(PB_DS_V2F(m_p_head->m_p_right->m_value), 61 PB_DS_V2F(other.m_p_head->m_p_left->m_value)); 62 63 const bool lesser = 64 Cmp_Fn::operator()(PB_DS_V2F(other.m_p_head->m_p_right->m_value), 65 PB_DS_V2F(m_p_head->m_p_left->m_value)); 66 67 if (!greater && !lesser) 68 __throw_join_error(); 69 70 if (lesser) 71 value_swap(other); 72 73 m_size += other.m_size; 74 _GLIBCXX_DEBUG_ONLY(debug_base::join(other);) 75 return true; 76} 77 78PB_DS_CLASS_T_DEC 79void 80PB_DS_CLASS_C_DEC:: 81join_finish(PB_DS_CLASS_C_DEC& other) 82{ 83 initialize_min_max(); 84 other.initialize(); 85} 86 87PB_DS_CLASS_T_DEC 88bool 89PB_DS_CLASS_C_DEC:: 90split_prep(key_const_reference r_key, PB_DS_CLASS_C_DEC& other) 91{ 92 PB_DS_ASSERT_VALID((*this)) 93 PB_DS_ASSERT_VALID(other) 94 other.clear(); 95 96 if (m_size == 0) 97 { 98 PB_DS_ASSERT_VALID((*this)) 99 PB_DS_ASSERT_VALID(other) 100 return false; 101 } 102 103 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value))) 104 { 105 value_swap(other); 106 PB_DS_ASSERT_VALID((*this)) 107 PB_DS_ASSERT_VALID(other) 108 return false; 109 } 110 111 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value))) 112 { 113 PB_DS_ASSERT_VALID((*this)) 114 PB_DS_ASSERT_VALID(other) 115 return false; 116 } 117 118 if (m_size == 1) 119 { 120 value_swap(other); 121 PB_DS_ASSERT_VALID((*this)) 122 PB_DS_ASSERT_VALID(other) 123 return false; 124 } 125 126 _GLIBCXX_DEBUG_ONLY(debug_base::split(r_key,(Cmp_Fn& )(*this), other);) 127 return true; 128} 129 130PB_DS_CLASS_T_DEC 131void 132PB_DS_CLASS_C_DEC:: 133split_finish(PB_DS_CLASS_C_DEC& other) 134{ 135 other.initialize_min_max(); 136 other.m_size = std::distance(other.begin(), other.end()); 137 m_size -= other.m_size; 138 initialize_min_max(); 139 PB_DS_ASSERT_VALID((*this)) 140 PB_DS_ASSERT_VALID(other) 141} 142 143PB_DS_CLASS_T_DEC 144typename PB_DS_CLASS_C_DEC::size_type 145PB_DS_CLASS_C_DEC:: 146recursive_count(node_pointer p) const 147{ 148 if (p == 0) 149 return 0; 150 return 1 + recursive_count(p->m_p_left) + recursive_count(p->m_p_right); 151} 152 153#endif 154