1 // -*- C++ -*- 2 3 // Copyright (C) 2005-2013 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 rb_tree_map_/constructors_destructor_fn_imps.hpp 38 * Contains an implementation for rb_tree_. 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 insert(*(first_it++)); 49 } 50 51 PB_DS_CLASS_T_DEC 52 PB_DS_CLASS_C_DEC:: 53 PB_DS_RB_TREE_NAME() 54 { 55 initialize(); 56 PB_DS_ASSERT_VALID((*this)) 57 } 58 59 PB_DS_CLASS_T_DEC 60 PB_DS_CLASS_C_DEC:: 61 PB_DS_RB_TREE_NAME(const Cmp_Fn& r_cmp_fn) : 62 base_type(r_cmp_fn) 63 { 64 initialize(); 65 PB_DS_ASSERT_VALID((*this)) 66 } 67 68 PB_DS_CLASS_T_DEC 69 PB_DS_CLASS_C_DEC:: 70 PB_DS_RB_TREE_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update) : 71 base_type(r_cmp_fn, r_node_update) 72 { 73 initialize(); 74 PB_DS_ASSERT_VALID((*this)) 75 } 76 77 PB_DS_CLASS_T_DEC 78 PB_DS_CLASS_C_DEC:: 79 PB_DS_RB_TREE_NAME(const PB_DS_CLASS_C_DEC& other) : 80 base_type(other) 81 { 82 initialize(); 83 PB_DS_ASSERT_VALID((*this)) 84 } 85 86 PB_DS_CLASS_T_DEC 87 void 88 PB_DS_CLASS_C_DEC:: 89 swap(PB_DS_CLASS_C_DEC& other) 90 { 91 PB_DS_ASSERT_VALID((*this)) 92 base_type::swap(other); 93 PB_DS_ASSERT_VALID((*this)) 94 } 95 96 PB_DS_CLASS_T_DEC 97 void 98 PB_DS_CLASS_C_DEC:: 99 initialize() 100 { base_type::m_p_head->m_red = true; } 101
