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 left_child_next_sibling_heap_.
45 */
46
47 #ifdef _GLIBCXX_DEBUG
48
49 PB_DS_CLASS_T_DEC
50 void
51 PB_DS_CLASS_C_DEC::
assert_valid() const52 assert_valid() const
53 {
54 _GLIBCXX_DEBUG_ASSERT(m_p_root == NULL || m_p_root->m_p_prev_or_parent == NULL);
55
56 if (m_p_root != NULL)
57 assert_node_consistent(m_p_root, Single_Link_Roots);
58 assert_size();
59 assert_iterators();
60 }
61
62 PB_DS_CLASS_T_DEC
63 void
64 PB_DS_CLASS_C_DEC::
assert_node_consistent(const_node_pointer p_nd,bool single_link) const65 assert_node_consistent(const_node_pointer p_nd, bool single_link) const
66 {
67 if (p_nd == NULL)
68 return;
69
70 assert_node_consistent(p_nd->m_p_l_child, false);
71 assert_node_consistent(p_nd->m_p_next_sibling, single_link);
72
73 if (single_link)
74 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_prev_or_parent == NULL);
75 else if (p_nd->m_p_next_sibling != NULL)
76 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd);
77
78 if (p_nd->m_p_l_child == NULL)
79 return;
80
81 const_node_pointer p_child = p_nd->m_p_l_child;
82 while (p_child != NULL)
83 {
84 const_node_pointer p_next_child = p_child->m_p_next_sibling;
85 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(p_nd->m_value, p_child->m_value));
86 p_child = p_next_child;
87 }
88 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child->m_p_prev_or_parent == p_nd);
89 }
90
91 PB_DS_CLASS_T_DEC
92 void
93 PB_DS_CLASS_C_DEC::
assert_iterators() const94 assert_iterators() const
95 {
96 const size_type calc_size = std::distance(begin(), end());
97 if (calc_size == size())
98 return;
99 _GLIBCXX_DEBUG_ASSERT(0);
100 }
101
102 PB_DS_CLASS_T_DEC
103 void
104 PB_DS_CLASS_C_DEC::
assert_size() const105 assert_size() const
106 {
107 if (size_from_node(m_p_root) == m_size)
108 return;
109 _GLIBCXX_DEBUG_ASSERT(0);
110 }
111
112 PB_DS_CLASS_T_DEC
113 typename PB_DS_CLASS_C_DEC::size_type
114 PB_DS_CLASS_C_DEC::
size_under_node(const_node_pointer p_nd)115 size_under_node(const_node_pointer p_nd)
116 { return 1 + size_from_node(p_nd->m_p_l_child); }
117
118 PB_DS_CLASS_T_DEC
119 typename PB_DS_CLASS_C_DEC::size_type
120 PB_DS_CLASS_C_DEC::
size_from_node(const_node_pointer p_nd)121 size_from_node(const_node_pointer p_nd)
122 {
123 size_type ret = 0;
124 while (p_nd != NULL)
125 {
126 ret += 1 + size_from_node(p_nd->m_p_l_child);
127 p_nd = p_nd->m_p_next_sibling;
128 }
129 return ret;
130 }
131
132 PB_DS_CLASS_T_DEC
133 typename PB_DS_CLASS_C_DEC::size_type
134 PB_DS_CLASS_C_DEC::
degree(const_node_pointer p_nd)135 degree(const_node_pointer p_nd)
136 {
137 size_type ret = 0;
138 const_node_pointer p_child = p_nd->m_p_l_child;
139 while (p_child != NULL)
140 {
141 ++ret;
142 p_child = p_child->m_p_next_sibling;
143 }
144 return ret;
145 }
146
147 #endif
148