libstdc++
|
00001 // -*- C++ -*- 00002 00003 // Copyright (C) 2005, 2006, 2009, 2010 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 left_child_next_sibling_heap_/iterators_fn_imps.hpp 00038 * Contains an implementation class for left_child_next_sibling_heap_. 00039 */ 00040 00041 PB_DS_CLASS_T_DEC 00042 inline typename PB_DS_CLASS_C_DEC::iterator 00043 PB_DS_CLASS_C_DEC:: 00044 begin() 00045 { 00046 node_pointer p_nd = m_p_root; 00047 00048 if (p_nd == 0) 00049 return (iterator(0)); 00050 00051 while (p_nd->m_p_l_child != 0) 00052 p_nd = p_nd->m_p_l_child; 00053 00054 return (iterator(p_nd)); 00055 } 00056 00057 PB_DS_CLASS_T_DEC 00058 inline typename PB_DS_CLASS_C_DEC::const_iterator 00059 PB_DS_CLASS_C_DEC:: 00060 begin() const 00061 { 00062 node_pointer p_nd = m_p_root; 00063 00064 if (p_nd == 0) 00065 return (const_iterator(0)); 00066 00067 while (p_nd->m_p_l_child != 0) 00068 p_nd = p_nd->m_p_l_child; 00069 00070 return (const_iterator(p_nd)); 00071 } 00072 00073 PB_DS_CLASS_T_DEC 00074 inline typename PB_DS_CLASS_C_DEC::iterator 00075 PB_DS_CLASS_C_DEC:: 00076 end() 00077 { 00078 return (iterator(0)); 00079 } 00080 00081 PB_DS_CLASS_T_DEC 00082 inline typename PB_DS_CLASS_C_DEC::const_iterator 00083 PB_DS_CLASS_C_DEC:: 00084 end() const 00085 { 00086 return (const_iterator(0)); 00087 } 00088