libstdc++
ov_tree_map_/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 ov_tree_map_/iterators_fn_imps.hpp
38  * Contains an implementation class for ov_tree_.
39  */
40 
41 PB_DS_CLASS_T_DEC
42 inline typename PB_DS_CLASS_C_DEC::node_const_iterator
43 PB_DS_CLASS_C_DEC::
44 node_begin() const
45 { return PB_DS_node_begin_imp(); }
46 
47 PB_DS_CLASS_T_DEC
48 inline typename PB_DS_CLASS_C_DEC::node_const_iterator
49 PB_DS_CLASS_C_DEC::
50 node_end() const
51 { return PB_DS_node_end_imp(); }
52 
53 PB_DS_CLASS_T_DEC
54 inline typename PB_DS_CLASS_C_DEC::node_iterator
55 PB_DS_CLASS_C_DEC::
56 node_begin()
57 { return PB_DS_node_begin_imp(); }
58 
59 PB_DS_CLASS_T_DEC
60 inline typename PB_DS_CLASS_C_DEC::node_iterator
61 PB_DS_CLASS_C_DEC::
62 node_end()
63 { return PB_DS_node_end_imp(); }
64 
65 PB_DS_CLASS_T_DEC
66 inline typename PB_DS_CLASS_C_DEC::node_const_iterator
67 PB_DS_CLASS_C_DEC::
68 PB_DS_node_begin_imp() const
69 {
70  return node_const_iterator(const_cast<pointer>(mid_pointer(begin(), end())),
71  const_cast<pointer>(begin()),
72  const_cast<pointer>(end()),(m_a_metadata == 0)?
73  0 :
74  mid_pointer(m_a_metadata, m_a_metadata + m_size));
75 }
76 
77 PB_DS_CLASS_T_DEC
78 inline typename PB_DS_CLASS_C_DEC::node_const_iterator
79 PB_DS_CLASS_C_DEC::
80 PB_DS_node_end_imp() const
81 {
82  return node_const_iterator(end(), end(), end(),
83  (m_a_metadata == 0) ? 0 : m_a_metadata + m_size);
84 }
85 
86 PB_DS_CLASS_T_DEC
87 inline typename PB_DS_CLASS_C_DEC::node_iterator
88 PB_DS_CLASS_C_DEC::
89 PB_DS_node_begin_imp()
90 {
91  return node_iterator(mid_pointer(begin(), end()), begin(), end(),
92  (m_a_metadata == 0) ? 0 : mid_pointer(m_a_metadata, m_a_metadata + m_size));
93 }
94 
95 PB_DS_CLASS_T_DEC
96 inline typename PB_DS_CLASS_C_DEC::node_iterator
97 PB_DS_CLASS_C_DEC::
98 PB_DS_node_end_imp()
99 {
100  return node_iterator(end(), end(),
101  end(),(m_a_metadata == 0) ? 0 : m_a_metadata + m_size);
102 }
103 
std::end
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
std::begin
auto begin(_Container &__cont) -> decltype(__cont.begin())
Return an iterator pointing to the first element of the container.
Definition: range_access.h:48