• Home
  • History
  • Annotate
  • Line#
  • Navigate
  • Raw
  • Download
  • only in /asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-arm-linux-2.6.36-uclibc-4.5.3/arm-brcm-linux-uclibcgnueabi/include/c++/4.5.3/ext/pb_ds/detail/pat_trie_/
1// -*- C++ -*-
2
3// Copyright (C) 2005, 2006, 2009 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 iterators_fn_imps.hpp
38 * Contains an implementation class for bin_search_tree_.
39 */
40
41PB_DS_CLASS_T_DEC
42inline typename PB_DS_CLASS_C_DEC::iterator
43PB_DS_CLASS_C_DEC::
44begin()
45{ return iterator(m_p_head->m_p_min); }
46
47PB_DS_CLASS_T_DEC
48inline typename PB_DS_CLASS_C_DEC::const_iterator
49PB_DS_CLASS_C_DEC::
50begin() const
51{ return const_iterator(m_p_head->m_p_min); }
52
53PB_DS_CLASS_T_DEC
54inline typename PB_DS_CLASS_C_DEC::iterator
55PB_DS_CLASS_C_DEC::
56end()
57{ return iterator(m_p_head); }
58
59PB_DS_CLASS_T_DEC
60inline typename PB_DS_CLASS_C_DEC::const_iterator
61PB_DS_CLASS_C_DEC::
62end() const
63{ return const_iterator(m_p_head); }
64
65PB_DS_CLASS_T_DEC
66inline typename PB_DS_CLASS_C_DEC::const_reverse_iterator
67PB_DS_CLASS_C_DEC::
68rbegin() const
69{
70  if (empty())
71    return rend();
72  return --end();
73}
74
75PB_DS_CLASS_T_DEC
76inline typename PB_DS_CLASS_C_DEC::reverse_iterator
77PB_DS_CLASS_C_DEC::
78rbegin()
79{
80  if (empty())
81    return rend();
82  return --end();
83}
84
85PB_DS_CLASS_T_DEC
86inline typename PB_DS_CLASS_C_DEC::reverse_iterator
87PB_DS_CLASS_C_DEC::
88rend()
89{ return reverse_iterator(m_p_head); }
90
91PB_DS_CLASS_T_DEC
92inline typename PB_DS_CLASS_C_DEC::const_reverse_iterator
93PB_DS_CLASS_C_DEC::
94rend() const
95{ return const_reverse_iterator(m_p_head); }
96
97PB_DS_CLASS_T_DEC
98inline typename PB_DS_CLASS_C_DEC::const_node_iterator
99PB_DS_CLASS_C_DEC::
100node_begin() const
101{ return const_node_iterator(m_p_head->m_p_parent, this); }
102
103PB_DS_CLASS_T_DEC
104inline typename PB_DS_CLASS_C_DEC::node_iterator
105PB_DS_CLASS_C_DEC::
106node_begin()
107{ return node_iterator(m_p_head->m_p_parent, this); }
108
109PB_DS_CLASS_T_DEC
110inline typename PB_DS_CLASS_C_DEC::const_node_iterator
111PB_DS_CLASS_C_DEC::
112node_end() const
113{ return const_node_iterator(NULL, this); }
114
115PB_DS_CLASS_T_DEC
116inline typename PB_DS_CLASS_C_DEC::node_iterator
117PB_DS_CLASS_C_DEC::
118node_end()
119{ return node_iterator(NULL, this); }
120
121