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 pat_trie_.
45169691Skan */
46169691Skan
47169691Skan#ifdef _GLIBCXX_DEBUG
48169691Skan
49169691SkanPB_DS_CLASS_T_DEC
50169691Skanvoid
51169691SkanPB_DS_CLASS_C_DEC::
52169691Skanassert_valid() const
53169691Skan{
54169691Skan  if (m_p_head->m_p_parent != NULL)
55169691Skan    m_p_head->m_p_parent->assert_valid(this);
56169691Skan  assert_iterators();
57169691Skan  assert_reverse_iterators();
58169691Skan  if (m_p_head->m_p_parent == NULL)
59169691Skan    {
60169691Skan      _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min == m_p_head);
61169691Skan      _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max == m_p_head);
62169691Skan      _GLIBCXX_DEBUG_ASSERT(empty());
63169691Skan      return;
64169691Skan    }
65169691Skan
66169691Skan  _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min->m_type == pat_trie_leaf_node_type);
67169691Skan  _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max->m_type == pat_trie_leaf_node_type);
68169691Skan  _GLIBCXX_DEBUG_ASSERT(!empty());
69169691Skan}
70169691Skan
71169691SkanPB_DS_CLASS_T_DEC
72169691Skanvoid
73169691SkanPB_DS_CLASS_C_DEC::
74169691Skanassert_iterators() const
75169691Skan{
76169691Skan  size_type calc_size = 0;
77169691Skan  for (const_iterator it = begin(); it != end(); ++it)
78169691Skan    {
79169691Skan      ++calc_size;
80169691Skan      map_debug_base::check_key_exists(PB_DS_V2F(*it));
81169691Skan      _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it);
82169691Skan      _GLIBCXX_DEBUG_ASSERT(--upper_bound(PB_DS_V2F(*it)) == it);
83169691Skan    }
84169691Skan  _GLIBCXX_DEBUG_ASSERT(calc_size == m_size);
85169691Skan}
86169691Skan
87169691SkanPB_DS_CLASS_T_DEC
88169691Skanvoid
89169691SkanPB_DS_CLASS_C_DEC::
90169691Skanassert_reverse_iterators() const
91169691Skan{
92169691Skan  size_type calc_size = 0;
93169691Skan  for (const_reverse_iterator it = rbegin(); it != rend(); ++it)
94169691Skan    {
95169691Skan      ++calc_size;
96169691Skan      const_node_pointer p_nd =
97169691Skan	const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(PB_DS_V2F(*it));
98169691Skan      _GLIBCXX_DEBUG_ASSERT(p_nd == it.m_p_nd);
99169691Skan    }
100169691Skan  _GLIBCXX_DEBUG_ASSERT(calc_size == m_size);
101169691Skan}
102169691Skan
103169691SkanPB_DS_CLASS_T_DEC
104169691Skantypename PB_DS_CLASS_C_DEC::size_type
105169691SkanPB_DS_CLASS_C_DEC::
106169691Skanrecursive_count_leafs(const_node_pointer p_nd)
107169691Skan{
108169691Skan  if (p_nd == NULL)
109169691Skan    return (0);
110169691Skan  if (p_nd->m_type == pat_trie_leaf_node_type)
111169691Skan    return (1);
112169691Skan  _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
113169691Skan  size_type ret = 0;
114169691Skan  for (typename internal_node::const_iterator it =
115169691Skan	 static_cast<const_internal_node_pointer>(p_nd)->begin();
116169691Skan       it != static_cast<const_internal_node_pointer>(p_nd)->end();
117169691Skan       ++it)
118169691Skan    ret += recursive_count_leafs(*it);
119169691Skan  return ret;
120169691Skan}
121169691Skan
122169691Skan#endif
123169691Skan
124