]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
748086b7 | 3 | // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc. |
4569a895 AT |
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 | |
748086b7 | 8 | // Foundation; either version 3, or (at your option) any later |
4569a895 AT |
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 | ||
748086b7 JJ |
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/>. | |
4569a895 AT |
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 debug_fn_imps.hpp | |
38 | * Contains an implementation class for left_child_next_sibling_heap_. | |
39 | */ | |
40 | ||
47bea7b8 | 41 | #ifdef _GLIBCXX_DEBUG |
4569a895 AT |
42 | |
43 | PB_DS_CLASS_T_DEC | |
44 | void | |
45 | PB_DS_CLASS_C_DEC:: | |
46 | assert_valid() const | |
47 | { | |
8fc81078 | 48 | _GLIBCXX_DEBUG_ASSERT(m_p_root == 0 || m_p_root->m_p_prev_or_parent == 0); |
4569a895 | 49 | |
8fc81078 | 50 | if (m_p_root != 0) |
4569a895 | 51 | assert_node_consistent(m_p_root, Single_Link_Roots); |
4569a895 | 52 | assert_size(); |
4569a895 AT |
53 | assert_iterators(); |
54 | } | |
55 | ||
56 | PB_DS_CLASS_T_DEC | |
57 | void | |
58 | PB_DS_CLASS_C_DEC:: | |
59 | assert_node_consistent(const_node_pointer p_nd, bool single_link) const | |
60 | { | |
8fc81078 | 61 | if (p_nd == 0) |
4569a895 AT |
62 | return; |
63 | ||
64 | assert_node_consistent(p_nd->m_p_l_child, false); | |
65 | assert_node_consistent(p_nd->m_p_next_sibling, single_link); | |
66 | ||
67 | if (single_link) | |
8fc81078 PC |
68 | _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_prev_or_parent == 0); |
69 | else if (p_nd->m_p_next_sibling != 0) | |
47bea7b8 | 70 | _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd); |
4569a895 | 71 | |
8fc81078 | 72 | if (p_nd->m_p_l_child == 0) |
4569a895 AT |
73 | return; |
74 | ||
75 | const_node_pointer p_child = p_nd->m_p_l_child; | |
8fc81078 | 76 | while (p_child != 0) |
4569a895 AT |
77 | { |
78 | const_node_pointer p_next_child = p_child->m_p_next_sibling; | |
47bea7b8 | 79 | _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(p_nd->m_value, p_child->m_value)); |
4569a895 AT |
80 | p_child = p_next_child; |
81 | } | |
47bea7b8 | 82 | _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child->m_p_prev_or_parent == p_nd); |
4569a895 AT |
83 | } |
84 | ||
85 | PB_DS_CLASS_T_DEC | |
86 | void | |
87 | PB_DS_CLASS_C_DEC:: | |
88 | assert_iterators() const | |
89 | { | |
90 | const size_type calc_size = std::distance(begin(), end()); | |
4569a895 AT |
91 | if (calc_size == size()) |
92 | return; | |
47bea7b8 | 93 | _GLIBCXX_DEBUG_ASSERT(0); |
4569a895 AT |
94 | } |
95 | ||
96 | PB_DS_CLASS_T_DEC | |
97 | void | |
98 | PB_DS_CLASS_C_DEC:: | |
99 | assert_size() const | |
100 | { | |
101 | if (size_from_node(m_p_root) == m_size) | |
102 | return; | |
47bea7b8 | 103 | _GLIBCXX_DEBUG_ASSERT(0); |
4569a895 AT |
104 | } |
105 | ||
106 | PB_DS_CLASS_T_DEC | |
107 | typename PB_DS_CLASS_C_DEC::size_type | |
108 | PB_DS_CLASS_C_DEC:: | |
109 | size_under_node(const_node_pointer p_nd) | |
47bea7b8 | 110 | { return 1 + size_from_node(p_nd->m_p_l_child); } |
4569a895 AT |
111 | |
112 | PB_DS_CLASS_T_DEC | |
113 | typename PB_DS_CLASS_C_DEC::size_type | |
114 | PB_DS_CLASS_C_DEC:: | |
115 | size_from_node(const_node_pointer p_nd) | |
116 | { | |
117 | size_type ret = 0; | |
8fc81078 | 118 | while (p_nd != 0) |
4569a895 AT |
119 | { |
120 | ret += 1 + size_from_node(p_nd->m_p_l_child); | |
4569a895 AT |
121 | p_nd = p_nd->m_p_next_sibling; |
122 | } | |
4569a895 AT |
123 | return ret; |
124 | } | |
125 | ||
126 | PB_DS_CLASS_T_DEC | |
127 | typename PB_DS_CLASS_C_DEC::size_type | |
128 | PB_DS_CLASS_C_DEC:: | |
129 | degree(const_node_pointer p_nd) | |
130 | { | |
131 | size_type ret = 0; | |
4569a895 | 132 | const_node_pointer p_child = p_nd->m_p_l_child; |
8fc81078 | 133 | while (p_child != 0) |
4569a895 AT |
134 | { |
135 | ++ret; | |
4569a895 AT |
136 | p_child = p_child->m_p_next_sibling; |
137 | } | |
4569a895 AT |
138 | return ret; |
139 | } | |
140 | ||
47bea7b8 | 141 | #endif |