]> git.ipfire.org Git - thirdparty/gcc.git/blame - libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / include / ext / pb_ds / detail / bin_search_tree_ / debug_fn_imps.hpp
CommitLineData
36fed23c 1// -*- C++ -*-
2
fbd26352 3// Copyright (C) 2005-2019 Free Software Foundation, Inc.
36fed23c 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
6bc9506f 8// Foundation; either version 3, or (at your option) any later
36fed23c 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
6bc9506f 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.
36fed23c 19
6bc9506f 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/>.
36fed23c 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/**
4f4a327e 37 * @file bin_search_tree_/debug_fn_imps.hpp
36fed23c 38 * Contains an implementation class for bin_search_tree_.
39 */
40
2b31bec4 41#ifdef _GLIBCXX_DEBUG
36fed23c 42
43PB_DS_CLASS_T_DEC
44void
45PB_DS_CLASS_C_DEC::
2548203e 46assert_valid(const char* __file, int __line) const
36fed23c 47{
2548203e 48 structure_only_assert_valid(__file, __line);
49 assert_consistent_with_debug_base(__file, __line);
50 assert_size(__file, __line);
51 assert_iterators(__file, __line);
e4bb1925 52 if (m_p_head->m_p_parent == 0)
36fed23c 53 {
2548203e 54 PB_DS_DEBUG_VERIFY(m_size == 0);
36fed23c 55 }
56 else
57 {
2548203e 58 PB_DS_DEBUG_VERIFY(m_size > 0);
36fed23c 59 }
60}
61
62PB_DS_CLASS_T_DEC
63void
64PB_DS_CLASS_C_DEC::
2548203e 65structure_only_assert_valid(const char* __file, int __line) const
36fed23c 66{
2548203e 67 PB_DS_DEBUG_VERIFY(m_p_head != 0);
e4bb1925 68 if (m_p_head->m_p_parent == 0)
36fed23c 69 {
2548203e 70 PB_DS_DEBUG_VERIFY(m_p_head->m_p_left == m_p_head);
71 PB_DS_DEBUG_VERIFY(m_p_head->m_p_right == m_p_head);
36fed23c 72 }
73 else
74 {
2548203e 75 PB_DS_DEBUG_VERIFY(m_p_head->m_p_parent->m_p_parent == m_p_head);
76 PB_DS_DEBUG_VERIFY(m_p_head->m_p_left != m_p_head);
77 PB_DS_DEBUG_VERIFY(m_p_head->m_p_right != m_p_head);
36fed23c 78 }
79
e4bb1925 80 if (m_p_head->m_p_parent != 0)
2548203e 81 assert_node_consistent(m_p_head->m_p_parent, __file, __line);
82 assert_min(__file, __line);
83 assert_max(__file, __line);
36fed23c 84}
85
86PB_DS_CLASS_T_DEC
87void
88PB_DS_CLASS_C_DEC::
2548203e 89assert_node_consistent(const node_pointer p_nd,
90 const char* __file, int __line) const
36fed23c 91{
2548203e 92 assert_node_consistent_(p_nd, __file, __line);
36fed23c 93}
94
95PB_DS_CLASS_T_DEC
96typename PB_DS_CLASS_C_DEC::node_consistent_t
97PB_DS_CLASS_C_DEC::
2548203e 98assert_node_consistent_(const node_pointer p_nd,
99 const char* __file, int __line) const
36fed23c 100{
e4bb1925 101 if (p_nd == 0)
102 return (std::make_pair((const_pointer)0,(const_pointer)0));
36fed23c 103
2548203e 104 assert_node_consistent_with_left(p_nd, __file, __line);
105 assert_node_consistent_with_right(p_nd, __file, __line);
36fed23c 106
107 const std::pair<const_pointer, const_pointer>
2548203e 108 l_range = assert_node_consistent_(p_nd->m_p_left, __file, __line);
36fed23c 109
e4bb1925 110 if (l_range.second != 0)
2548203e 111 PB_DS_DEBUG_VERIFY(Cmp_Fn::operator()(PB_DS_V2F(*l_range.second),
112 PB_DS_V2F(p_nd->m_value)));
36fed23c 113
114 const std::pair<const_pointer, const_pointer>
2548203e 115 r_range = assert_node_consistent_(p_nd->m_p_right, __file, __line);
36fed23c 116
e4bb1925 117 if (r_range.first != 0)
2548203e 118 PB_DS_DEBUG_VERIFY(Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value),
2b31bec4 119 PB_DS_V2F(*r_range.first)));
36fed23c 120
2548203e 121 return std::make_pair((l_range.first != 0) ? l_range.first : &p_nd->m_value,
122 (r_range.second != 0)? r_range.second : &p_nd->m_value);
36fed23c 123}
124
125PB_DS_CLASS_T_DEC
126void
127PB_DS_CLASS_C_DEC::
2548203e 128assert_node_consistent_with_left(const node_pointer p_nd,
129 const char* __file, int __line) const
36fed23c 130{
e4bb1925 131 if (p_nd->m_p_left == 0)
36fed23c 132 return;
2548203e 133 PB_DS_DEBUG_VERIFY(p_nd->m_p_left->m_p_parent == p_nd);
134 PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value),
135 PB_DS_V2F(p_nd->m_p_left->m_value)));
36fed23c 136}
137
138PB_DS_CLASS_T_DEC
139void
140PB_DS_CLASS_C_DEC::
2548203e 141assert_node_consistent_with_right(const node_pointer p_nd,
142 const char* __file, int __line) const
36fed23c 143{
e4bb1925 144 if (p_nd->m_p_right == 0)
36fed23c 145 return;
2548203e 146 PB_DS_DEBUG_VERIFY(p_nd->m_p_right->m_p_parent == p_nd);
147 PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_p_right->m_value),
148 PB_DS_V2F(p_nd->m_value)));
36fed23c 149}
150
151PB_DS_CLASS_T_DEC
152void
153PB_DS_CLASS_C_DEC::
2548203e 154assert_min(const char* __file, int __line) const
36fed23c 155{
2548203e 156 assert_min_imp(m_p_head->m_p_parent, __file, __line);
36fed23c 157}
158
159PB_DS_CLASS_T_DEC
160void
161PB_DS_CLASS_C_DEC::
2548203e 162assert_min_imp(const node_pointer p_nd, const char* __file, int __line) const
36fed23c 163{
e4bb1925 164 if (p_nd == 0)
36fed23c 165 {
2548203e 166 PB_DS_DEBUG_VERIFY(m_p_head->m_p_left == m_p_head);
36fed23c 167 return;
168 }
169
e4bb1925 170 if (p_nd->m_p_left == 0)
36fed23c 171 {
2548203e 172 PB_DS_DEBUG_VERIFY(p_nd == m_p_head->m_p_left);
36fed23c 173 return;
174 }
2548203e 175 assert_min_imp(p_nd->m_p_left, __file, __line);
36fed23c 176}
177
178PB_DS_CLASS_T_DEC
179void
180PB_DS_CLASS_C_DEC::
2548203e 181assert_max(const char* __file, int __line) const
36fed23c 182{
2548203e 183 assert_max_imp(m_p_head->m_p_parent, __file, __line);
36fed23c 184}
185
186PB_DS_CLASS_T_DEC
187void
188PB_DS_CLASS_C_DEC::
2548203e 189assert_max_imp(const node_pointer p_nd,
190 const char* __file, int __line) const
36fed23c 191{
e4bb1925 192 if (p_nd == 0)
36fed23c 193 {
2548203e 194 PB_DS_DEBUG_VERIFY(m_p_head->m_p_right == m_p_head);
36fed23c 195 return;
196 }
197
e4bb1925 198 if (p_nd->m_p_right == 0)
36fed23c 199 {
2548203e 200 PB_DS_DEBUG_VERIFY(p_nd == m_p_head->m_p_right);
36fed23c 201 return;
202 }
203
2548203e 204 assert_max_imp(p_nd->m_p_right, __file, __line);
36fed23c 205}
206
207PB_DS_CLASS_T_DEC
208void
209PB_DS_CLASS_C_DEC::
2548203e 210assert_iterators(const char* __file, int __line) const
36fed23c 211{
212 size_type iterated_num = 0;
36fed23c 213 const_iterator prev_it = end();
36fed23c 214 for (const_iterator it = begin(); it != end(); ++it)
215 {
216 ++iterated_num;
2548203e 217 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)).m_p_nd == it.m_p_nd);
2b31bec4 218 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
36fed23c 219 --upper_bound_it;
2548203e 220 PB_DS_DEBUG_VERIFY(upper_bound_it.m_p_nd == it.m_p_nd);
36fed23c 221
222 if (prev_it != end())
2548203e 223 PB_DS_DEBUG_VERIFY(Cmp_Fn::operator()(PB_DS_V2F(*prev_it),
224 PB_DS_V2F(*it)));
36fed23c 225 prev_it = it;
226 }
227
2548203e 228 PB_DS_DEBUG_VERIFY(iterated_num == m_size);
36fed23c 229 size_type reverse_iterated_num = 0;
36fed23c 230 const_reverse_iterator reverse_prev_it = rend();
36fed23c 231 for (const_reverse_iterator reverse_it = rbegin(); reverse_it != rend();
232 ++reverse_it)
233 {
234 ++reverse_iterated_num;
2548203e 235 PB_DS_DEBUG_VERIFY(lower_bound(
36fed23c 236 PB_DS_V2F(*reverse_it)).m_p_nd == reverse_it.m_p_nd);
237
2b31bec4 238 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*reverse_it));
36fed23c 239 --upper_bound_it;
2548203e 240 PB_DS_DEBUG_VERIFY(upper_bound_it.m_p_nd == reverse_it.m_p_nd);
36fed23c 241 if (reverse_prev_it != rend())
2548203e 242 PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(PB_DS_V2F(*reverse_prev_it),
243 PB_DS_V2F(*reverse_it)));
36fed23c 244 reverse_prev_it = reverse_it;
245 }
2548203e 246 PB_DS_DEBUG_VERIFY(reverse_iterated_num == m_size);
36fed23c 247}
248
249PB_DS_CLASS_T_DEC
250void
251PB_DS_CLASS_C_DEC::
2548203e 252assert_consistent_with_debug_base(const char* __file, int __line) const
36fed23c 253{
2548203e 254 debug_base::check_size(m_size, __file, __line);
255 assert_consistent_with_debug_base(m_p_head->m_p_parent, __file, __line);
36fed23c 256}
257
258PB_DS_CLASS_T_DEC
259void
260PB_DS_CLASS_C_DEC::
2548203e 261assert_consistent_with_debug_base(const node_pointer p_nd,
262 const char* __file, int __line) const
36fed23c 263{
e4bb1925 264 if (p_nd == 0)
36fed23c 265 return;
2548203e 266 debug_base::check_key_exists(PB_DS_V2F(p_nd->m_value), __file, __line);
267 assert_consistent_with_debug_base(p_nd->m_p_left, __file, __line);
268 assert_consistent_with_debug_base(p_nd->m_p_right, __file, __line);
36fed23c 269}
270
271PB_DS_CLASS_T_DEC
272void
273PB_DS_CLASS_C_DEC::
2548203e 274assert_size(const char* __file, int __line) const
4f4a327e 275{ PB_DS_DEBUG_VERIFY(recursive_count(m_p_head->m_p_parent) == m_size); }
36fed23c 276
2548203e 277#endif