1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
// -*- C++ -*-
// Copyright (C) 2005 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING. If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.
// As a special exception, you may use this file as part of a free software
// library without restriction. Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the GNU General Public License. This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the GNU General Public License.
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
// Permission to use, copy, modify, sell, and distribute this software
// is hereby granted without fee, provided that the above copyright
// notice appears in all copies, and that both that copyright notice and
// this permission notice appear in supporting documentation. None of
// the above authors, nor IBM Haifa Research Laboratories, make any
// representation about the suitability of this software for any
// purpose. It is provided "as is" without express or implied warranty.
/**
* @file node_iterators.hpp
* Contains an implementation class for ov_tree_.
*/
class const_node_iterator
{
public:
typedef trivial_iterator_tag iterator_category;
typedef trivial_iterator_difference_type difference_type;
typedef const_iterator value_type;
typedef const_iterator* pointer;
typedef const_iterator* const_pointer;
typedef const_iterator& reference;
typedef const iterator& const_reference;
public:
inline
const_node_iterator(value_pointer p_nd = NULL, value_pointer p_begin_nd = NULL, value_pointer p_end_nd = NULL) : m_p_value(p_nd),
m_p_begin_value(p_begin_nd),
m_p_end_value(p_end_nd)
{ }
inline const_iterator
operator*() const
{
return (m_p_value);
}
inline const_node_iterator
l_child() const
{
if (m_p_begin_value == m_p_value)
return (const_node_iterator(m_p_begin_value, m_p_begin_value, m_p_begin_value));
return (const_node_iterator(
mid_pointer(m_p_begin_value, m_p_value),
m_p_begin_value,
m_p_value));
}
inline const_node_iterator
r_child() const
{
if (m_p_value == m_p_end_value)
return (const_node_iterator(m_p_end_value, m_p_end_value, m_p_end_value));
return (const_node_iterator(
mid_pointer(m_p_value + 1, m_p_end_value),
m_p_value + 1,
m_p_end_value));
}
inline bool
operator==(const const_node_iterator& r_other) const
{
const bool is_end = m_p_begin_value == m_p_end_value;
const bool is_other_end = r_other.m_p_begin_value == r_other.m_p_end_value;
if (is_end)
return (is_other_end);
if (is_other_end)
return (is_end);
if (r_other.m_p_begin_value == r_other.m_p_end_value)
return (m_p_begin_value == m_p_end_value);
return (m_p_value == r_other.m_p_value);
}
inline bool
operator!=(const const_node_iterator& r_other) const
{
return (!operator==(r_other));
}
private:
friend class PB_ASSOC_CLASS_C_DEC;
public:
value_pointer m_p_value;
value_pointer m_p_begin_value;
value_pointer m_p_end_value;
};
class node_iterator :
public const_node_iterator
{
public:
inline
node_iterator(value_pointer p_nd = NULL, value_pointer p_begin_nd = NULL, value_pointer p_end_nd = NULL) : const_node_iterator(p_nd, p_begin_nd, p_end_nd)
{ }
inline iterator
operator*() const
{
return (iterator(const_node_iterator::m_p_value));
}
inline node_iterator
l_child() const
{
if (const_node_iterator::m_p_begin_value == const_node_iterator::m_p_value)
return (node_iterator(const_node_iterator::m_p_begin_value, const_node_iterator::m_p_begin_value, const_node_iterator::m_p_begin_value));
return (node_iterator(
mid_pointer(const_node_iterator::m_p_begin_value, const_node_iterator::m_p_value),
const_node_iterator::m_p_begin_value,
const_node_iterator::m_p_value));
}
inline node_iterator
r_child() const
{
if (const_node_iterator::m_p_value == const_node_iterator::m_p_end_value)
return (node_iterator(const_node_iterator::m_p_end_value, const_node_iterator::m_p_end_value, const_node_iterator::m_p_end_value));
return (node_iterator(
mid_pointer(const_node_iterator::m_p_value + 1, const_node_iterator::m_p_end_value),
const_node_iterator::m_p_value + 1,
const_node_iterator::m_p_end_value));
}
private:
friend class PB_ASSOC_CLASS_C_DEC;
};
|
