libstdc++
|
00001 // -*- C++ -*- 00002 00003 // Copyright (C) 2005, 2006, 2009, 2011 Free Software Foundation, Inc. 00004 // 00005 // This file is part of the GNU ISO C++ Library. This library is free 00006 // software; you can redistribute it and/or modify it under the terms 00007 // of the GNU General Public License as published by the Free Software 00008 // Foundation; either version 3, or (at your option) any later 00009 // version. 00010 00011 // This library is distributed in the hope that it will be useful, but 00012 // WITHOUT ANY WARRANTY; without even the implied warranty of 00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00014 // General Public License for more details. 00015 00016 // Under Section 7 of GPL version 3, you are granted additional 00017 // permissions described in the GCC Runtime Library Exception, version 00018 // 3.1, as published by the Free Software Foundation. 00019 00020 // You should have received a copy of the GNU General Public License and 00021 // a copy of the GCC Runtime Library Exception along with this program; 00022 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 00023 // <http://www.gnu.org/licenses/>. 00024 00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 00026 00027 // Permission to use, copy, modify, sell, and distribute this software 00028 // is hereby granted without fee, provided that the above copyright 00029 // notice appears in all copies, and that both that copyright notice 00030 // and this permission notice appear in supporting documentation. None 00031 // of the above authors, nor IBM Haifa Research Laboratories, make any 00032 // representation about the suitability of this software for any 00033 // purpose. It is provided "as is" without express or implied 00034 // warranty. 00035 00036 /** 00037 * @file rb_tree_map_/constructors_destructor_fn_imps.hpp 00038 * Contains an implementation for rb_tree_. 00039 */ 00040 00041 PB_DS_CLASS_T_DEC 00042 template<typename It> 00043 void 00044 PB_DS_CLASS_C_DEC:: 00045 copy_from_range(It first_it, It last_it) 00046 { 00047 while (first_it != last_it) 00048 insert(*(first_it++)); 00049 } 00050 00051 PB_DS_CLASS_T_DEC 00052 PB_DS_CLASS_C_DEC:: 00053 PB_DS_RB_TREE_NAME() 00054 { 00055 initialize(); 00056 PB_DS_ASSERT_VALID((*this)) 00057 } 00058 00059 PB_DS_CLASS_T_DEC 00060 PB_DS_CLASS_C_DEC:: 00061 PB_DS_RB_TREE_NAME(const Cmp_Fn& r_cmp_fn) : 00062 base_type(r_cmp_fn) 00063 { 00064 initialize(); 00065 PB_DS_ASSERT_VALID((*this)) 00066 } 00067 00068 PB_DS_CLASS_T_DEC 00069 PB_DS_CLASS_C_DEC:: 00070 PB_DS_RB_TREE_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update) : 00071 base_type(r_cmp_fn, r_node_update) 00072 { 00073 initialize(); 00074 PB_DS_ASSERT_VALID((*this)) 00075 } 00076 00077 PB_DS_CLASS_T_DEC 00078 PB_DS_CLASS_C_DEC:: 00079 PB_DS_RB_TREE_NAME(const PB_DS_CLASS_C_DEC& other) : 00080 base_type(other) 00081 { 00082 initialize(); 00083 PB_DS_ASSERT_VALID((*this)) 00084 } 00085 00086 PB_DS_CLASS_T_DEC 00087 void 00088 PB_DS_CLASS_C_DEC:: 00089 swap(PB_DS_CLASS_C_DEC& other) 00090 { 00091 PB_DS_ASSERT_VALID((*this)) 00092 base_type::swap(other); 00093 PB_DS_ASSERT_VALID((*this)) 00094 } 00095 00096 PB_DS_CLASS_T_DEC 00097 void 00098 PB_DS_CLASS_C_DEC:: 00099 initialize() 00100 { base_type::m_p_head->m_red = true; }