1*38fd1498Szrj // -*- C++ -*- 2*38fd1498Szrj 3*38fd1498Szrj // Copyright (C) 2005-2018 Free Software Foundation, Inc. 4*38fd1498Szrj // 5*38fd1498Szrj // This file is part of the GNU ISO C++ Library. This library is free 6*38fd1498Szrj // software; you can redistribute it and/or modify it under the terms 7*38fd1498Szrj // of the GNU General Public License as published by the Free Software 8*38fd1498Szrj // Foundation; either version 3, or (at your option) any later 9*38fd1498Szrj // version. 10*38fd1498Szrj 11*38fd1498Szrj // This library is distributed in the hope that it will be useful, but 12*38fd1498Szrj // WITHOUT ANY WARRANTY; without even the implied warranty of 13*38fd1498Szrj // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14*38fd1498Szrj // General Public License for more details. 15*38fd1498Szrj 16*38fd1498Szrj // Under Section 7 of GPL version 3, you are granted additional 17*38fd1498Szrj // permissions described in the GCC Runtime Library Exception, version 18*38fd1498Szrj // 3.1, as published by the Free Software Foundation. 19*38fd1498Szrj 20*38fd1498Szrj // You should have received a copy of the GNU General Public License and 21*38fd1498Szrj // a copy of the GCC Runtime Library Exception along with this program; 22*38fd1498Szrj // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 23*38fd1498Szrj // <http://www.gnu.org/licenses/>. 24*38fd1498Szrj 25*38fd1498Szrj // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 26*38fd1498Szrj 27*38fd1498Szrj // Permission to use, copy, modify, sell, and distribute this software 28*38fd1498Szrj // is hereby granted without fee, provided that the above copyright 29*38fd1498Szrj // notice appears in all copies, and that both that copyright notice 30*38fd1498Szrj // and this permission notice appear in supporting documentation. None 31*38fd1498Szrj // of the above authors, nor IBM Haifa Research Laboratories, make any 32*38fd1498Szrj // representation about the suitability of this software for any 33*38fd1498Szrj // purpose. It is provided "as is" without express or implied 34*38fd1498Szrj // warranty. 35*38fd1498Szrj 36*38fd1498Szrj /** 37*38fd1498Szrj * @file thin_heap_/thin_heap_.hpp 38*38fd1498Szrj * Contains an implementation class for a thin heap. 39*38fd1498Szrj */ 40*38fd1498Szrj 41*38fd1498Szrj #ifndef PB_DS_THIN_HEAP_HPP 42*38fd1498Szrj #define PB_DS_THIN_HEAP_HPP 43*38fd1498Szrj 44*38fd1498Szrj #include <algorithm> 45*38fd1498Szrj #include <ext/pb_ds/detail/cond_dealtor.hpp> 46*38fd1498Szrj #include <ext/pb_ds/detail/type_utils.hpp> 47*38fd1498Szrj #include <ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp> 48*38fd1498Szrj #include <debug/debug.h> 49*38fd1498Szrj 50*38fd1498Szrj namespace __gnu_pbds 51*38fd1498Szrj { 52*38fd1498Szrj namespace detail 53*38fd1498Szrj { 54*38fd1498Szrj #define PB_DS_CLASS_T_DEC \ 55*38fd1498Szrj template<typename Value_Type, typename Cmp_Fn, typename _Alloc> 56*38fd1498Szrj 57*38fd1498Szrj #define PB_DS_CLASS_C_DEC \ 58*38fd1498Szrj thin_heap<Value_Type, Cmp_Fn, _Alloc> 59*38fd1498Szrj 60*38fd1498Szrj #ifdef _GLIBCXX_DEBUG 61*38fd1498Szrj #define PB_DS_BASE_T_P \ 62*38fd1498Szrj <Value_Type, Cmp_Fn, typename _Alloc::size_type, _Alloc, true> 63*38fd1498Szrj #else 64*38fd1498Szrj #define PB_DS_BASE_T_P \ 65*38fd1498Szrj <Value_Type, Cmp_Fn, typename _Alloc::size_type, _Alloc> 66*38fd1498Szrj #endif 67*38fd1498Szrj 68*38fd1498Szrj 69*38fd1498Szrj /** 70*38fd1498Szrj * Thin heap. 71*38fd1498Szrj * 72*38fd1498Szrj * @ingroup heap-detail 73*38fd1498Szrj * 74*38fd1498Szrj * See Tarjan and Kaplan. 75*38fd1498Szrj */ 76*38fd1498Szrj template<typename Value_Type, typename Cmp_Fn, typename _Alloc> 77*38fd1498Szrj class thin_heap 78*38fd1498Szrj : public left_child_next_sibling_heap PB_DS_BASE_T_P 79*38fd1498Szrj { 80*38fd1498Szrj private: 81*38fd1498Szrj typedef typename _Alloc::template rebind<Value_Type>::other __rebind_a; 82*38fd1498Szrj typedef left_child_next_sibling_heap PB_DS_BASE_T_P base_type; 83*38fd1498Szrj 84*38fd1498Szrj protected: 85*38fd1498Szrj typedef typename base_type::node node; 86*38fd1498Szrj typedef typename base_type::node_pointer node_pointer; 87*38fd1498Szrj typedef typename base_type::node_const_pointer node_const_pointer; 88*38fd1498Szrj 89*38fd1498Szrj public: 90*38fd1498Szrj typedef Value_Type value_type; 91*38fd1498Szrj typedef Cmp_Fn cmp_fn; 92*38fd1498Szrj typedef _Alloc allocator_type; 93*38fd1498Szrj typedef typename _Alloc::size_type size_type; 94*38fd1498Szrj typedef typename _Alloc::difference_type difference_type; 95*38fd1498Szrj 96*38fd1498Szrj typedef typename __rebind_a::pointer pointer; 97*38fd1498Szrj typedef typename __rebind_a::const_pointer const_pointer; 98*38fd1498Szrj typedef typename __rebind_a::reference reference; 99*38fd1498Szrj typedef typename __rebind_a::const_reference const_reference; 100*38fd1498Szrj 101*38fd1498Szrj typedef typename base_type::point_iterator point_iterator; 102*38fd1498Szrj typedef typename base_type::point_const_iterator point_const_iterator; 103*38fd1498Szrj typedef typename base_type::iterator iterator; 104*38fd1498Szrj typedef typename base_type::const_iterator const_iterator; 105*38fd1498Szrj 106*38fd1498Szrj 107*38fd1498Szrj inline point_iterator 108*38fd1498Szrj push(const_reference); 109*38fd1498Szrj 110*38fd1498Szrj void 111*38fd1498Szrj modify(point_iterator, const_reference); 112*38fd1498Szrj 113*38fd1498Szrj inline const_reference 114*38fd1498Szrj top() const; 115*38fd1498Szrj 116*38fd1498Szrj void 117*38fd1498Szrj pop(); 118*38fd1498Szrj 119*38fd1498Szrj void 120*38fd1498Szrj erase(point_iterator); 121*38fd1498Szrj 122*38fd1498Szrj inline void 123*38fd1498Szrj clear(); 124*38fd1498Szrj 125*38fd1498Szrj template<typename Pred> 126*38fd1498Szrj size_type 127*38fd1498Szrj erase_if(Pred); 128*38fd1498Szrj 129*38fd1498Szrj template<typename Pred> 130*38fd1498Szrj void 131*38fd1498Szrj split(Pred, PB_DS_CLASS_C_DEC&); 132*38fd1498Szrj 133*38fd1498Szrj void 134*38fd1498Szrj join(PB_DS_CLASS_C_DEC&); 135*38fd1498Szrj 136*38fd1498Szrj protected: 137*38fd1498Szrj thin_heap(); 138*38fd1498Szrj 139*38fd1498Szrj thin_heap(const Cmp_Fn&); 140*38fd1498Szrj 141*38fd1498Szrj thin_heap(const PB_DS_CLASS_C_DEC&); 142*38fd1498Szrj 143*38fd1498Szrj void 144*38fd1498Szrj swap(PB_DS_CLASS_C_DEC&); 145*38fd1498Szrj 146*38fd1498Szrj ~thin_heap(); 147*38fd1498Szrj 148*38fd1498Szrj template<typename It> 149*38fd1498Szrj void 150*38fd1498Szrj copy_from_range(It, It); 151*38fd1498Szrj 152*38fd1498Szrj #ifdef _GLIBCXX_DEBUG 153*38fd1498Szrj void 154*38fd1498Szrj assert_valid(const char*, int) const; 155*38fd1498Szrj 156*38fd1498Szrj void 157*38fd1498Szrj assert_max(const char*, int) const; 158*38fd1498Szrj #endif 159*38fd1498Szrj 160*38fd1498Szrj #ifdef PB_DS_THIN_HEAP_TRACE_ 161*38fd1498Szrj void 162*38fd1498Szrj trace() const; 163*38fd1498Szrj #endif 164*38fd1498Szrj 165*38fd1498Szrj private: 166*38fd1498Szrj enum 167*38fd1498Szrj { 168*38fd1498Szrj max_rank = (sizeof(size_type) << 4) + 2 169*38fd1498Szrj }; 170*38fd1498Szrj 171*38fd1498Szrj void 172*38fd1498Szrj initialize(); 173*38fd1498Szrj 174*38fd1498Szrj inline void 175*38fd1498Szrj update_max(node_pointer); 176*38fd1498Szrj 177*38fd1498Szrj inline void 178*38fd1498Szrj fix(node_pointer); 179*38fd1498Szrj 180*38fd1498Szrj inline void 181*38fd1498Szrj fix_root(node_pointer); 182*38fd1498Szrj 183*38fd1498Szrj inline void 184*38fd1498Szrj fix_sibling_rank_1_unmarked(node_pointer); 185*38fd1498Szrj 186*38fd1498Szrj inline void 187*38fd1498Szrj fix_sibling_rank_1_marked(node_pointer); 188*38fd1498Szrj 189*38fd1498Szrj inline void 190*38fd1498Szrj fix_sibling_general_unmarked(node_pointer); 191*38fd1498Szrj 192*38fd1498Szrj inline void 193*38fd1498Szrj fix_sibling_general_marked(node_pointer); 194*38fd1498Szrj 195*38fd1498Szrj inline void 196*38fd1498Szrj fix_child(node_pointer); 197*38fd1498Szrj 198*38fd1498Szrj inline static void 199*38fd1498Szrj make_root(node_pointer); 200*38fd1498Szrj 201*38fd1498Szrj inline void 202*38fd1498Szrj make_root_and_link(node_pointer); 203*38fd1498Szrj 204*38fd1498Szrj inline void 205*38fd1498Szrj remove_max_node(); 206*38fd1498Szrj 207*38fd1498Szrj void 208*38fd1498Szrj to_aux_except_max(); 209*38fd1498Szrj 210*38fd1498Szrj inline void 211*38fd1498Szrj add_to_aux(node_pointer); 212*38fd1498Szrj 213*38fd1498Szrj inline void 214*38fd1498Szrj make_from_aux(); 215*38fd1498Szrj 216*38fd1498Szrj inline size_type 217*38fd1498Szrj rank_bound(); 218*38fd1498Szrj 219*38fd1498Szrj inline void 220*38fd1498Szrj make_child_of(node_pointer, node_pointer); 221*38fd1498Szrj 222*38fd1498Szrj inline void 223*38fd1498Szrj remove_node(node_pointer); 224*38fd1498Szrj 225*38fd1498Szrj inline node_pointer 226*38fd1498Szrj join(node_pointer, node_pointer) const; 227*38fd1498Szrj 228*38fd1498Szrj #ifdef _GLIBCXX_DEBUG 229*38fd1498Szrj void 230*38fd1498Szrj assert_node_consistent(node_const_pointer, bool, const char*, int) const; 231*38fd1498Szrj 232*38fd1498Szrj void 233*38fd1498Szrj assert_aux_null(const char*, int) const; 234*38fd1498Szrj #endif 235*38fd1498Szrj 236*38fd1498Szrj node_pointer m_p_max; 237*38fd1498Szrj node_pointer m_a_aux[max_rank]; 238*38fd1498Szrj }; 239*38fd1498Szrj 240*38fd1498Szrj enum 241*38fd1498Szrj { 242*38fd1498Szrj num_distinct_rank_bounds = 48 243*38fd1498Szrj }; 244*38fd1498Szrj 245*38fd1498Szrj // Taken from the SGI implementation; acknowledged in the docs. 246*38fd1498Szrj static const std::size_t g_a_rank_bounds[num_distinct_rank_bounds] = 247*38fd1498Szrj { 248*38fd1498Szrj /* Dealing cards... */ 249*38fd1498Szrj /* 0 */ 0ul, 250*38fd1498Szrj /* 1 */ 1ul, 251*38fd1498Szrj /* 2 */ 1ul, 252*38fd1498Szrj /* 3 */ 2ul, 253*38fd1498Szrj /* 4 */ 4ul, 254*38fd1498Szrj /* 5 */ 6ul, 255*38fd1498Szrj /* 6 */ 11ul, 256*38fd1498Szrj /* 7 */ 17ul, 257*38fd1498Szrj /* 8 */ 29ul, 258*38fd1498Szrj /* 9 */ 46ul, 259*38fd1498Szrj /* 10 */ 76ul, 260*38fd1498Szrj /* 11 */ 122ul, 261*38fd1498Szrj /* 12 */ 199ul, 262*38fd1498Szrj /* 13 */ 321ul, 263*38fd1498Szrj /* 14 */ 521ul, 264*38fd1498Szrj /* 15 */ 842ul, 265*38fd1498Szrj /* 16 */ 1364ul, 266*38fd1498Szrj /* 17 */ 2206ul, 267*38fd1498Szrj /* 18 */ 3571ul, 268*38fd1498Szrj /* 19 */ 5777ul, 269*38fd1498Szrj /* 20 */ 9349ul, 270*38fd1498Szrj /* 21 */ 15126ul, 271*38fd1498Szrj /* 22 */ 24476ul, 272*38fd1498Szrj /* 23 */ 39602ul, 273*38fd1498Szrj /* 24 */ 64079ul 274*38fd1498Szrj #if __SIZE_MAX__ > 0xfffful 275*38fd1498Szrj , 276*38fd1498Szrj /* 25 */ 103681ul, 277*38fd1498Szrj /* 26 */ 167761ul, 278*38fd1498Szrj /* 27 */ 271442ul, 279*38fd1498Szrj /* 28 */ 439204ul, 280*38fd1498Szrj /* 29 */ 710646ul 281*38fd1498Szrj #if __SIZE_MAX__ > 0xffffful 282*38fd1498Szrj , 283*38fd1498Szrj /* 30 */ 1149851ul, 284*38fd1498Szrj /* 31 */ 1860497ul, 285*38fd1498Szrj /* 32 */ 3010349ul, 286*38fd1498Szrj /* 33 */ 4870846ul, 287*38fd1498Szrj /* 34 */ 7881196ul, 288*38fd1498Szrj /* 35 */ 12752042ul 289*38fd1498Szrj #if __SIZE_MAX__ > 0xfffffful 290*38fd1498Szrj , 291*38fd1498Szrj /* 36 */ 20633239ul, 292*38fd1498Szrj /* 37 */ 33385282ul, 293*38fd1498Szrj /* 38 */ 54018521ul, 294*38fd1498Szrj /* 39 */ 87403803ul, 295*38fd1498Szrj /* 40 */ 141422324ul, 296*38fd1498Szrj /* 41 */ 228826127ul, 297*38fd1498Szrj /* 42 */ 370248451ul, 298*38fd1498Szrj /* 43 */ 599074578ul, 299*38fd1498Szrj /* 44 */ 969323029ul, 300*38fd1498Szrj /* 45 */ 1568397607ul, 301*38fd1498Szrj /* 46 */ 2537720636ul, 302*38fd1498Szrj /* 47 */ 4106118243ul 303*38fd1498Szrj #endif 304*38fd1498Szrj #endif 305*38fd1498Szrj #endif 306*38fd1498Szrj /* Pot's good, let's play */ 307*38fd1498Szrj }; 308*38fd1498Szrj 309*38fd1498Szrj #define PB_DS_ASSERT_NODE_CONSISTENT(_Node, _Bool) \ 310*38fd1498Szrj _GLIBCXX_DEBUG_ONLY(assert_node_consistent(_Node, _Bool, \ 311*38fd1498Szrj __FILE__, __LINE__);) 312*38fd1498Szrj 313*38fd1498Szrj #define PB_DS_ASSERT_AUX_NULL(X) \ 314*38fd1498Szrj _GLIBCXX_DEBUG_ONLY(X.assert_aux_null(__FILE__, __LINE__);) 315*38fd1498Szrj 316*38fd1498Szrj #include <ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp> 317*38fd1498Szrj #include <ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp> 318*38fd1498Szrj #include <ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp> 319*38fd1498Szrj #include <ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp> 320*38fd1498Szrj #include <ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp> 321*38fd1498Szrj #include <ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp> 322*38fd1498Szrj #include <ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp> 323*38fd1498Szrj 324*38fd1498Szrj #undef PB_DS_ASSERT_AUX_NULL 325*38fd1498Szrj #undef PB_DS_ASSERT_NODE_CONSISTENT 326*38fd1498Szrj #undef PB_DS_CLASS_C_DEC 327*38fd1498Szrj #undef PB_DS_CLASS_T_DEC 328*38fd1498Szrj #undef PB_DS_BASE_T_P 329*38fd1498Szrj 330*38fd1498Szrj } // namespace detail 331*38fd1498Szrj } // namespace __gnu_pbds 332*38fd1498Szrj 333*38fd1498Szrj #endif 334