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 for rc_binomial_heap_.
45 */
46
47#ifdef _GLIBCXX_DEBUG
48
49PB_DS_CLASS_T_DEC
50void
51PB_DS_CLASS_C_DEC::
52assert_valid() const
53{
54  base_type::assert_valid(false);
55  if (!base_type::empty())
56    {
57      _GLIBCXX_DEBUG_ASSERT(base_type::m_p_max != NULL);
58      base_type::assert_max();
59    }
60
61  m_rc.assert_valid();
62
63  if (m_rc.empty())
64    {
65      base_type::assert_valid(true);
66      _GLIBCXX_DEBUG_ASSERT(next_2_pointer(base_type::m_p_root) == NULL);
67      return;
68    }
69
70  const_node_pointer p_nd = next_2_pointer(base_type::m_p_root);
71  typename rc_t::const_iterator it = m_rc.end();
72  --it;
73
74  while (p_nd != NULL)
75    {
76      _GLIBCXX_DEBUG_ASSERT(*it == p_nd);
77      const_node_pointer p_next = p_nd->m_p_next_sibling;
78      _GLIBCXX_DEBUG_ASSERT(p_next != NULL);
79      _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_next->m_metadata);
80      _GLIBCXX_DEBUG_ASSERT(p_next->m_p_next_sibling == NULL ||
81		       p_next->m_metadata < p_next->m_p_next_sibling->m_metadata);
82
83      --it;
84      p_nd = next_2_pointer(next_after_0_pointer(p_nd));
85    }
86  _GLIBCXX_DEBUG_ASSERT(it + 1 == m_rc.begin());
87}
88
89PB_DS_CLASS_T_DEC
90typename PB_DS_CLASS_C_DEC::const_node_pointer
91PB_DS_CLASS_C_DEC::
92next_2_pointer(const_node_pointer p_nd)
93{
94  if (p_nd == NULL)
95    return NULL;
96
97  node_pointer p_next = p_nd->m_p_next_sibling;
98
99  if (p_next == NULL)
100    return NULL;
101
102  if (p_nd->m_metadata == p_next->m_metadata)
103    return p_nd;
104
105  return next_2_pointer(p_next);
106}
107
108PB_DS_CLASS_T_DEC
109typename PB_DS_CLASS_C_DEC::const_node_pointer
110PB_DS_CLASS_C_DEC::
111next_after_0_pointer(const_node_pointer p_nd)
112{
113  if (p_nd == NULL)
114    return NULL;
115
116  node_pointer p_next = p_nd->m_p_next_sibling;
117
118  if (p_next == NULL)
119    return NULL;
120
121  if (p_nd->m_metadata < p_next->m_metadata)
122    return p_next;
123
124  return next_after_0_pointer(p_next);
125}
126
127#endif
128