Where Online Learning is simpler!
The C and C++ Include Header Files
/usr/include/c++/13/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp
$ cat -n /usr/include/c++/13/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp 1 // -*- C++ -*- 2 3 // Copyright (C) 2005-2023 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 //
. 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 rc_binomial_heap_/erase_fn_imps.hpp 38 * Contains an implementation for rc_binomial_heap_. 39 */ 40 41 #ifdef PB_DS_CLASS_C_DEC 42 43 PB_DS_CLASS_T_DEC 44 inline void 45 PB_DS_CLASS_C_DEC:: 46 pop() 47 { 48 make_binomial_heap(); 49 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 50 base_type::pop(); 51 base_type::find_max(); 52 } 53 54 PB_DS_CLASS_T_DEC 55 void 56 PB_DS_CLASS_C_DEC:: 57 clear() 58 { 59 base_type::clear(); 60 m_rc.clear(); 61 } 62 63 PB_DS_CLASS_T_DEC 64 void 65 PB_DS_CLASS_C_DEC:: 66 make_binomial_heap() 67 { 68 node_pointer p_nd = base_type::m_p_root; 69 while (p_nd != 0) 70 { 71 node_pointer p_next = p_nd->m_p_next_sibling; 72 if (p_next == 0) 73 p_nd = p_next; 74 else if (p_nd->m_metadata == p_next->m_metadata) 75 p_nd = link_with_next_sibling(p_nd); 76 else if (p_nd->m_metadata < p_next->m_metadata) 77 p_nd = p_next; 78 #ifdef _GLIBCXX_DEBUG 79 else 80 _GLIBCXX_DEBUG_ASSERT(0); 81 #endif 82 } 83 84 m_rc.clear(); 85 } 86 87 PB_DS_CLASS_T_DEC 88 template
89 typename PB_DS_CLASS_C_DEC::size_type 90 PB_DS_CLASS_C_DEC:: 91 erase_if(Pred pred) 92 { 93 make_binomial_heap(); 94 const size_type ersd = base_type::erase_if(pred); 95 base_type::find_max(); 96 PB_DS_ASSERT_VALID((*this)) 97 return ersd; 98 } 99 100 PB_DS_CLASS_T_DEC 101 void 102 PB_DS_CLASS_C_DEC:: 103 erase(point_iterator it) 104 { 105 make_binomial_heap(); 106 base_type::erase(it); 107 base_type::find_max(); 108 } 109 110 #endif
Contact us
|
About us
|
Term of use
|
Copyright © 2000-2025 MyWebUniversity.com ™