libstdc++
left_child_next_sibling_heap_/iterators_fn_imps.hpp
Go to the documentation of this file.
1 // -*- C++ -*-
2 
3 // Copyright (C) 2005-2014 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 left_child_next_sibling_heap_/iterators_fn_imps.hpp
38  * Contains an implementation class for left_child_next_sibling_heap_.
39  */
40 
41 PB_DS_CLASS_T_DEC
42 inline typename PB_DS_CLASS_C_DEC::iterator
44 begin()
45 {
46  node_pointer p_nd = m_p_root;
47 
48  if (p_nd == 0)
49  return (iterator(0));
50 
51  while (p_nd->m_p_l_child != 0)
52  p_nd = p_nd->m_p_l_child;
53 
54  return (iterator(p_nd));
55 }
56 
57 PB_DS_CLASS_T_DEC
58 inline typename PB_DS_CLASS_C_DEC::const_iterator
60 begin() const
61 {
62  node_pointer p_nd = m_p_root;
63 
64  if (p_nd == 0)
65  return (const_iterator(0));
66 
67  while (p_nd->m_p_l_child != 0)
68  p_nd = p_nd->m_p_l_child;
69 
70  return (const_iterator(p_nd));
71 }
72 
73 PB_DS_CLASS_T_DEC
74 inline typename PB_DS_CLASS_C_DEC::iterator
76 end()
77 {
78  return (iterator(0));
79 }
80 
81 PB_DS_CLASS_T_DEC
82 inline typename PB_DS_CLASS_C_DEC::const_iterator
84 end() const
85 {
86  return (const_iterator(0));
87 }
88 
auto end(_Container &__cont) -> decltype(__cont.end())
Return an iterator pointing to one past the last element of the container.
Definition: range_access.h:68
auto begin(_Container &__cont) -> decltype(__cont.begin())
Return an iterator pointing to the first element of the container.
Definition: range_access.h:48