libstdc++
ov_tree_map_/iterators_fn_imps.hpp
Go to the documentation of this file.
1// -*- C++ -*-
2
3// Copyright (C) 2005-2021 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#ifdef PB_DS_CLASS_C_DEC
42
43PB_DS_CLASS_T_DEC
44inline typename PB_DS_CLASS_C_DEC::node_const_iterator
45PB_DS_CLASS_C_DEC::
46node_begin() const
47{ return PB_DS_node_begin_imp(); }
48
49PB_DS_CLASS_T_DEC
50inline typename PB_DS_CLASS_C_DEC::node_const_iterator
51PB_DS_CLASS_C_DEC::
52node_end() const
53{ return PB_DS_node_end_imp(); }
54
55PB_DS_CLASS_T_DEC
56inline typename PB_DS_CLASS_C_DEC::node_iterator
57PB_DS_CLASS_C_DEC::
58node_begin()
59{ return PB_DS_node_begin_imp(); }
60
61PB_DS_CLASS_T_DEC
62inline typename PB_DS_CLASS_C_DEC::node_iterator
63PB_DS_CLASS_C_DEC::
64node_end()
65{ return PB_DS_node_end_imp(); }
66
67PB_DS_CLASS_T_DEC
68inline typename PB_DS_CLASS_C_DEC::node_const_iterator
69PB_DS_CLASS_C_DEC::
70PB_DS_node_begin_imp() const
71{
72 return node_const_iterator(const_cast<pointer>(mid_pointer(begin(), end())),
73 const_cast<pointer>(begin()),
74 const_cast<pointer>(end()),(m_a_metadata == 0)?
75 0 :
76 mid_pointer(m_a_metadata, m_a_metadata + m_size));
77}
78
79PB_DS_CLASS_T_DEC
80inline typename PB_DS_CLASS_C_DEC::node_const_iterator
81PB_DS_CLASS_C_DEC::
82PB_DS_node_end_imp() const
83{
84 return node_const_iterator(end(), end(), end(),
85 (m_a_metadata == 0) ? 0 : m_a_metadata + m_size);
86}
87
88PB_DS_CLASS_T_DEC
89inline typename PB_DS_CLASS_C_DEC::node_iterator
90PB_DS_CLASS_C_DEC::
91PB_DS_node_begin_imp()
92{
93 return node_iterator(mid_pointer(begin(), end()), begin(), end(),
94 (m_a_metadata == 0) ? 0 : mid_pointer(m_a_metadata, m_a_metadata + m_size));
95}
96
97PB_DS_CLASS_T_DEC
98inline typename PB_DS_CLASS_C_DEC::node_iterator
99PB_DS_CLASS_C_DEC::
100PB_DS_node_end_imp()
101{
102 return node_iterator(end(), end(),
103 end(),(m_a_metadata == 0) ? 0 : m_a_metadata + m_size);
104}
105
106#endif
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
Definition: valarray:1239
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
Definition: valarray:1217