1 // -*- C++ -*- 2 3 // Copyright (C) 2005, 2006, 2009 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 constructors_destructor_fn_imps.hpp 38 * Contains an implementation class for a base of binomial heaps. 39 */ 40 41 PB_DS_CLASS_T_DEC 42 template<typename It> 43 void 44 PB_DS_CLASS_C_DEC:: 45 copy_from_range(It first_it, It last_it) 46 { 47 while (first_it != last_it) 48 push(*(first_it++)); 49 50 _GLIBCXX_DEBUG_ONLY(assert_valid(false);) 51 } 52 53 PB_DS_CLASS_T_DEC 54 PB_DS_CLASS_C_DEC:: 55 binomial_heap_base_() : 56 m_p_max(NULL) 57 { 58 _GLIBCXX_DEBUG_ONLY(assert_valid(false);) 59 } 60 61 PB_DS_CLASS_T_DEC 62 PB_DS_CLASS_C_DEC:: 63 binomial_heap_base_(const Cmp_Fn& r_cmp_fn) : 64 PB_DS_BASE_C_DEC(r_cmp_fn), 65 m_p_max(NULL) 66 { 67 _GLIBCXX_DEBUG_ONLY(assert_valid(false);) 68 } 69 70 PB_DS_CLASS_T_DEC 71 PB_DS_CLASS_C_DEC:: 72 binomial_heap_base_(const PB_DS_CLASS_C_DEC& other) : 73 PB_DS_BASE_C_DEC(other), 74 m_p_max(NULL) 75 { 76 _GLIBCXX_DEBUG_ONLY(assert_valid(false);) 77 } 78 79 PB_DS_CLASS_T_DEC 80 void 81 PB_DS_CLASS_C_DEC:: 82 swap(PB_DS_CLASS_C_DEC& other) 83 { 84 _GLIBCXX_DEBUG_ONLY(assert_valid(false);) 85 86 base_type::swap(other); 87 88 std::swap(m_p_max, other.m_p_max); 89 90 _GLIBCXX_DEBUG_ONLY(assert_valid(false);) 91 } 92 93 PB_DS_CLASS_T_DEC 94 PB_DS_CLASS_C_DEC:: 95 ~binomial_heap_base_() 96 { } 97 98