1169691Skan// -*- C++ -*-
2169691Skan
3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
4169691Skan//
5169691Skan// This file is part of the GNU ISO C++ Library.  This library is free
6169691Skan// software; you can redistribute it and/or modify it under the terms
7169691Skan// of the GNU General Public License as published by the Free Software
8169691Skan// Foundation; either version 2, or (at your option) any later
9169691Skan// version.
10169691Skan
11169691Skan// This library is distributed in the hope that it will be useful, but
12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of
13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14169691Skan// General Public License for more details.
15169691Skan
16169691Skan// You should have received a copy of the GNU General Public License
17169691Skan// along with this library; see the file COPYING.  If not, write to
18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19169691Skan// MA 02111-1307, USA.
20169691Skan
21169691Skan// As a special exception, you may use this file as part of a free
22169691Skan// software library without restriction.  Specifically, if other files
23169691Skan// instantiate templates or use macros or inline functions from this
24169691Skan// file, or you compile this file and link it with other files to
25169691Skan// produce an executable, this file does not by itself cause the
26169691Skan// resulting executable to be covered by the GNU General Public
27169691Skan// License.  This exception does not however invalidate any other
28169691Skan// reasons why the executable file might be covered by the GNU General
29169691Skan// Public License.
30169691Skan
31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32169691Skan
33169691Skan// Permission to use, copy, modify, sell, and distribute this software
34169691Skan// is hereby granted without fee, provided that the above copyright
35169691Skan// notice appears in all copies, and that both that copyright notice
36169691Skan// and this permission notice appear in supporting documentation. None
37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any
38169691Skan// representation about the suitability of this software for any
39169691Skan// purpose. It is provided "as is" without express or implied
40169691Skan// warranty.
41169691Skan
42169691Skan/**
43169691Skan * @file debug_fn_imps.hpp
44169691Skan * Contains an implementation class for left_child_next_sibling_heap_.
45169691Skan */
46169691Skan
47169691Skan#ifdef _GLIBCXX_DEBUG
48169691Skan
49169691SkanPB_DS_CLASS_T_DEC
50169691Skanvoid
51169691SkanPB_DS_CLASS_C_DEC::
52169691Skanassert_valid() const
53169691Skan{
54169691Skan  _GLIBCXX_DEBUG_ASSERT(m_p_root == NULL || m_p_root->m_p_prev_or_parent == NULL);
55169691Skan
56169691Skan  if (m_p_root != NULL)
57169691Skan    assert_node_consistent(m_p_root, Single_Link_Roots);
58169691Skan  assert_size();
59169691Skan  assert_iterators();
60169691Skan}
61169691Skan
62169691SkanPB_DS_CLASS_T_DEC
63169691Skanvoid
64169691SkanPB_DS_CLASS_C_DEC::
65169691Skanassert_node_consistent(const_node_pointer p_nd, bool single_link) const
66169691Skan{
67169691Skan  if (p_nd == NULL)
68169691Skan    return;
69169691Skan
70169691Skan  assert_node_consistent(p_nd->m_p_l_child, false);
71169691Skan  assert_node_consistent(p_nd->m_p_next_sibling, single_link);
72169691Skan
73169691Skan  if (single_link)
74169691Skan    _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_prev_or_parent == NULL);
75169691Skan  else if (p_nd->m_p_next_sibling != NULL)
76169691Skan    _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd);
77169691Skan
78169691Skan  if (p_nd->m_p_l_child == NULL)
79169691Skan    return;
80169691Skan
81169691Skan  const_node_pointer p_child = p_nd->m_p_l_child;
82169691Skan  while (p_child != NULL)
83169691Skan    {
84169691Skan      const_node_pointer p_next_child = p_child->m_p_next_sibling;
85169691Skan      _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(p_nd->m_value, p_child->m_value));
86169691Skan      p_child = p_next_child;
87169691Skan    }
88169691Skan  _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child->m_p_prev_or_parent == p_nd);
89169691Skan}
90169691Skan
91169691SkanPB_DS_CLASS_T_DEC
92169691Skanvoid
93169691SkanPB_DS_CLASS_C_DEC::
94169691Skanassert_iterators() const
95169691Skan{
96169691Skan  const size_type calc_size = std::distance(begin(), end());
97169691Skan  if (calc_size == size())
98169691Skan    return;
99169691Skan  _GLIBCXX_DEBUG_ASSERT(0);
100169691Skan}
101169691Skan
102169691SkanPB_DS_CLASS_T_DEC
103169691Skanvoid
104169691SkanPB_DS_CLASS_C_DEC::
105169691Skanassert_size() const
106169691Skan{
107169691Skan  if (size_from_node(m_p_root) == m_size)
108169691Skan    return;
109169691Skan  _GLIBCXX_DEBUG_ASSERT(0);
110169691Skan}
111169691Skan
112169691SkanPB_DS_CLASS_T_DEC
113169691Skantypename PB_DS_CLASS_C_DEC::size_type
114169691SkanPB_DS_CLASS_C_DEC::
115169691Skansize_under_node(const_node_pointer p_nd)
116169691Skan{ return 1 + size_from_node(p_nd->m_p_l_child); }
117169691Skan
118169691SkanPB_DS_CLASS_T_DEC
119169691Skantypename PB_DS_CLASS_C_DEC::size_type
120169691SkanPB_DS_CLASS_C_DEC::
121169691Skansize_from_node(const_node_pointer p_nd)
122169691Skan{
123169691Skan  size_type ret = 0;
124169691Skan  while (p_nd != NULL)
125169691Skan    {
126169691Skan      ret += 1 + size_from_node(p_nd->m_p_l_child);
127169691Skan      p_nd = p_nd->m_p_next_sibling;
128169691Skan    }
129169691Skan  return ret;
130169691Skan}
131169691Skan
132169691SkanPB_DS_CLASS_T_DEC
133169691Skantypename PB_DS_CLASS_C_DEC::size_type
134169691SkanPB_DS_CLASS_C_DEC::
135169691Skandegree(const_node_pointer p_nd)
136169691Skan{
137169691Skan  size_type ret = 0;
138169691Skan  const_node_pointer p_child = p_nd->m_p_l_child;
139169691Skan  while (p_child != NULL)
140169691Skan    {
141169691Skan      ++ret;
142169691Skan      p_child = p_child->m_p_next_sibling;
143169691Skan    }
144169691Skan  return ret;
145169691Skan}
146169691Skan
147169691Skan#endif
148