]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
3 | // Copyright (C) 2005, 2006 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 2, 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 | // You should have received a copy of the GNU General Public License | |
17 | // along with this library; see the file COPYING. If not, write to | |
18 | // the Free Software Foundation, 59 Temple Place - Suite 330, Boston, | |
19 | // MA 02111-1307, USA. | |
20 | ||
21 | // As a special exception, you may use this file as part of a free | |
22 | // software library without restriction. Specifically, if other files | |
23 | // instantiate templates or use macros or inline functions from this | |
24 | // file, or you compile this file and link it with other files to | |
25 | // produce an executable, this file does not by itself cause the | |
26 | // resulting executable to be covered by the GNU General Public | |
27 | // License. This exception does not however invalidate any other | |
28 | // reasons why the executable file might be covered by the GNU General | |
29 | // Public License. | |
30 | ||
31 | // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. | |
32 | ||
33 | // Permission to use, copy, modify, sell, and distribute this software | |
34 | // is hereby granted without fee, provided that the above copyright | |
35 | // notice appears in all copies, and that both that copyright notice | |
36 | // and this permission notice appear in supporting documentation. None | |
37 | // of the above authors, nor IBM Haifa Research Laboratories, make any | |
38 | // representation about the suitability of this software for any | |
39 | // purpose. It is provided "as is" without express or implied | |
40 | // warranty. | |
41 | ||
42 | /** | |
43 | * @file debug_fn_imps.hpp | |
44 | * Contains an implementation class for ov_tree_. | |
45 | */ | |
46 | ||
47 | #ifdef PB_DS_OV_TREE_DEBUG_ | |
48 | ||
49 | PB_DS_CLASS_T_DEC | |
50 | void | |
51 | PB_DS_CLASS_C_DEC:: | |
52 | assert_valid() const | |
53 | { | |
54 | std::cout << "av1" << std::endl; | |
55 | ||
56 | if (m_a_values == NULL || m_end_it == NULL || m_size == 0) | |
57 | PB_DS_DBG_ASSERT(m_a_values == NULL&& m_end_it == NULL&& | |
58 | m_size == 0); | |
59 | ||
60 | std::cout << "av2" << std::endl; | |
61 | ||
62 | assert_iterators(); | |
63 | ||
64 | std::cout << "av3" << std::endl; | |
65 | } | |
66 | ||
67 | PB_DS_CLASS_T_DEC | |
68 | void | |
69 | PB_DS_CLASS_C_DEC:: | |
70 | assert_iterators() const | |
71 | { | |
72 | map_debug_base::check_size(m_size); | |
73 | ||
74 | size_type iterated_num = 0; | |
75 | ||
76 | const_iterator prev_it = end(); | |
77 | ||
78 | PB_DS_DBG_ASSERT( m_end_it == m_a_values + m_size); | |
79 | ||
80 | for (const_iterator it = begin(); it != end(); ++it) | |
81 | { | |
82 | ++iterated_num; | |
83 | ||
84 | PB_DS_DBG_ONLY(map_debug_base::check_key_exists( | |
85 | PB_DS_V2F(*it));) | |
86 | ||
87 | PB_DS_DBG_ASSERT(lower_bound( | |
88 | PB_DS_V2F(*it)) == it); | |
89 | ||
90 | const_iterator upper_bound_it = upper_bound( | |
91 | PB_DS_V2F(*it)); | |
92 | ||
93 | --upper_bound_it; | |
94 | ||
95 | PB_DS_DBG_ASSERT(upper_bound_it == it); | |
96 | ||
97 | if (prev_it != end()) | |
98 | PB_DS_DBG_ASSERT(Cmp_Fn::operator()( | |
99 | PB_DS_V2F(*prev_it), | |
100 | PB_DS_V2F(*it))); | |
101 | ||
102 | prev_it = it; | |
103 | } | |
104 | ||
105 | PB_DS_DBG_ASSERT(iterated_num == m_size); | |
106 | } | |
107 | ||
108 | #endif // #ifdef PB_DS_OV_TREE_DEBUG_ | |
109 |