]>
Commit | Line | Data |
---|---|---|
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. | |
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/>. | |
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 left_child_next_sibling_heap_/debug_fn_imps.hpp |
36fed23c | 38 | * Contains an implementation class for left_child_next_sibling_heap_. |
39 | */ | |
40 | ||
2b31bec4 | 41 | #ifdef _GLIBCXX_DEBUG |
36fed23c | 42 | |
43 | PB_DS_CLASS_T_DEC | |
44 | void | |
45 | PB_DS_CLASS_C_DEC:: | |
2548203e | 46 | assert_valid(const char* __file, int __line) const |
36fed23c | 47 | { |
2548203e | 48 | PB_DS_DEBUG_VERIFY(m_p_root == 0 || m_p_root->m_p_prev_or_parent == 0); |
36fed23c | 49 | |
e4bb1925 | 50 | if (m_p_root != 0) |
2548203e | 51 | assert_node_consistent(m_p_root, Single_Link_Roots, __file, __line); |
52 | assert_size(__file, __line); | |
53 | assert_iterators(__file, __line); | |
36fed23c | 54 | } |
55 | ||
56 | PB_DS_CLASS_T_DEC | |
57 | void | |
58 | PB_DS_CLASS_C_DEC:: | |
4f4a327e | 59 | assert_node_consistent(node_const_pointer p_nd, bool single_link, |
2548203e | 60 | const char* __file, int __line) const |
36fed23c | 61 | { |
e4bb1925 | 62 | if (p_nd == 0) |
36fed23c | 63 | return; |
64 | ||
2548203e | 65 | assert_node_consistent(p_nd->m_p_l_child, false, __file, __line); |
66 | assert_node_consistent(p_nd->m_p_next_sibling, single_link, __file, __line); | |
36fed23c | 67 | |
68 | if (single_link) | |
2548203e | 69 | PB_DS_DEBUG_VERIFY(p_nd->m_p_prev_or_parent == 0); |
e4bb1925 | 70 | else if (p_nd->m_p_next_sibling != 0) |
2548203e | 71 | PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd); |
36fed23c | 72 | |
e4bb1925 | 73 | if (p_nd->m_p_l_child == 0) |
36fed23c | 74 | return; |
75 | ||
4f4a327e | 76 | node_const_pointer p_child = p_nd->m_p_l_child; |
e4bb1925 | 77 | while (p_child != 0) |
36fed23c | 78 | { |
4f4a327e | 79 | node_const_pointer p_next_child = p_child->m_p_next_sibling; |
2548203e | 80 | PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(p_nd->m_value, p_child->m_value)); |
36fed23c | 81 | p_child = p_next_child; |
82 | } | |
2548203e | 83 | PB_DS_DEBUG_VERIFY(p_nd->m_p_l_child->m_p_prev_or_parent == p_nd); |
36fed23c | 84 | } |
85 | ||
86 | PB_DS_CLASS_T_DEC | |
87 | void | |
88 | PB_DS_CLASS_C_DEC:: | |
2548203e | 89 | assert_iterators(const char* __file, int __line) const |
36fed23c | 90 | { |
2548203e | 91 | PB_DS_DEBUG_VERIFY(std::distance(begin(), end()) == size()); |
36fed23c | 92 | } |
93 | ||
94 | PB_DS_CLASS_T_DEC | |
95 | void | |
96 | PB_DS_CLASS_C_DEC:: | |
2548203e | 97 | assert_size(const char* __file, int __line) const |
36fed23c | 98 | { |
2548203e | 99 | PB_DS_DEBUG_VERIFY(size_from_node(m_p_root) == m_size); |
36fed23c | 100 | } |
101 | ||
102 | PB_DS_CLASS_T_DEC | |
103 | typename PB_DS_CLASS_C_DEC::size_type | |
104 | PB_DS_CLASS_C_DEC:: | |
4f4a327e | 105 | size_under_node(node_const_pointer p_nd) |
2b31bec4 | 106 | { return 1 + size_from_node(p_nd->m_p_l_child); } |
36fed23c | 107 | |
108 | PB_DS_CLASS_T_DEC | |
109 | typename PB_DS_CLASS_C_DEC::size_type | |
110 | PB_DS_CLASS_C_DEC:: | |
4f4a327e | 111 | size_from_node(node_const_pointer p_nd) |
36fed23c | 112 | { |
113 | size_type ret = 0; | |
e4bb1925 | 114 | while (p_nd != 0) |
36fed23c | 115 | { |
116 | ret += 1 + size_from_node(p_nd->m_p_l_child); | |
36fed23c | 117 | p_nd = p_nd->m_p_next_sibling; |
118 | } | |
36fed23c | 119 | return ret; |
120 | } | |
121 | ||
122 | PB_DS_CLASS_T_DEC | |
123 | typename PB_DS_CLASS_C_DEC::size_type | |
124 | PB_DS_CLASS_C_DEC:: | |
4f4a327e | 125 | degree(node_const_pointer p_nd) |
36fed23c | 126 | { |
127 | size_type ret = 0; | |
4f4a327e | 128 | node_const_pointer p_child = p_nd->m_p_l_child; |
e4bb1925 | 129 | while (p_child != 0) |
36fed23c | 130 | { |
131 | ++ret; | |
36fed23c | 132 | p_child = p_child->m_p_next_sibling; |
133 | } | |
36fed23c | 134 | return ret; |
135 | } | |
136 | ||
2b31bec4 | 137 | #endif |