3 // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
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 3, or (at your option) any later
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.
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.
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/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
37 * @file debug_fn_imps.hpp
38 * Contains an implementation class for left_child_next_sibling_heap_.
48 _GLIBCXX_DEBUG_ASSERT(m_p_root
== NULL
|| m_p_root
->m_p_prev_or_parent
== NULL
);
51 assert_node_consistent(m_p_root
, Single_Link_Roots
);
59 assert_node_consistent(const_node_pointer p_nd
, bool single_link
) const
64 assert_node_consistent(p_nd
->m_p_l_child
, false);
65 assert_node_consistent(p_nd
->m_p_next_sibling
, single_link
);
68 _GLIBCXX_DEBUG_ASSERT(p_nd
->m_p_prev_or_parent
== NULL
);
69 else if (p_nd
->m_p_next_sibling
!= NULL
)
70 _GLIBCXX_DEBUG_ASSERT(p_nd
->m_p_next_sibling
->m_p_prev_or_parent
== p_nd
);
72 if (p_nd
->m_p_l_child
== NULL
)
75 const_node_pointer p_child
= p_nd
->m_p_l_child
;
76 while (p_child
!= NULL
)
78 const_node_pointer p_next_child
= p_child
->m_p_next_sibling
;
79 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(p_nd
->m_value
, p_child
->m_value
));
80 p_child
= p_next_child
;
82 _GLIBCXX_DEBUG_ASSERT(p_nd
->m_p_l_child
->m_p_prev_or_parent
== p_nd
);
88 assert_iterators() const
90 const size_type calc_size
= std::distance(begin(), end());
91 if (calc_size
== size())
93 _GLIBCXX_DEBUG_ASSERT(0);
101 if (size_from_node(m_p_root
) == m_size
)
103 _GLIBCXX_DEBUG_ASSERT(0);
107 typename
PB_DS_CLASS_C_DEC::size_type
109 size_under_node(const_node_pointer p_nd
)
110 { return 1 + size_from_node(p_nd
->m_p_l_child
); }
113 typename
PB_DS_CLASS_C_DEC::size_type
115 size_from_node(const_node_pointer p_nd
)
120 ret
+= 1 + size_from_node(p_nd
->m_p_l_child
);
121 p_nd
= p_nd
->m_p_next_sibling
;
127 typename
PB_DS_CLASS_C_DEC::size_type
129 degree(const_node_pointer p_nd
)
132 const_node_pointer p_child
= p_nd
->m_p_l_child
;
133 while (p_child
!= NULL
)
136 p_child
= p_child
->m_p_next_sibling
;