Install gcc-4.4.0-tdm-1-core-2.tar.gz
[msysgit.git] / mingw / lib / gcc / mingw32 / 4.3.3 / include / c++ / ext / pb_ds / detail / pat_trie_ / debug_fn_imps.hpp
blobd0cef7a3a6e986d17339b74f95a16fcafcf81aef
1 // -*- C++ -*-
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.
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 // 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.
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.
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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.
42 /**
43 * @file debug_fn_imps.hpp
44 * Contains an implementation class for pat_trie_.
47 #ifdef _GLIBCXX_DEBUG
49 PB_DS_CLASS_T_DEC
50 void
51 PB_DS_CLASS_C_DEC::
52 assert_valid() const
54 if (m_p_head->m_p_parent != NULL)
55 m_p_head->m_p_parent->assert_valid(this);
56 assert_iterators();
57 assert_reverse_iterators();
58 if (m_p_head->m_p_parent == NULL)
60 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min == m_p_head);
61 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max == m_p_head);
62 _GLIBCXX_DEBUG_ASSERT(empty());
63 return;
66 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min->m_type == pat_trie_leaf_node_type);
67 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max->m_type == pat_trie_leaf_node_type);
68 _GLIBCXX_DEBUG_ASSERT(!empty());
71 PB_DS_CLASS_T_DEC
72 void
73 PB_DS_CLASS_C_DEC::
74 assert_iterators() const
76 size_type calc_size = 0;
77 for (const_iterator it = begin(); it != end(); ++it)
79 ++calc_size;
80 debug_base::check_key_exists(PB_DS_V2F(*it));
81 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it);
82 _GLIBCXX_DEBUG_ASSERT(--upper_bound(PB_DS_V2F(*it)) == it);
84 _GLIBCXX_DEBUG_ASSERT(calc_size == m_size);
87 PB_DS_CLASS_T_DEC
88 void
89 PB_DS_CLASS_C_DEC::
90 assert_reverse_iterators() const
92 size_type calc_size = 0;
93 for (const_reverse_iterator it = rbegin(); it != rend(); ++it)
95 ++calc_size;
96 const_node_pointer p_nd =
97 const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(PB_DS_V2F(*it));
98 _GLIBCXX_DEBUG_ASSERT(p_nd == it.m_p_nd);
100 _GLIBCXX_DEBUG_ASSERT(calc_size == m_size);
103 PB_DS_CLASS_T_DEC
104 typename PB_DS_CLASS_C_DEC::size_type
105 PB_DS_CLASS_C_DEC::
106 recursive_count_leafs(const_node_pointer p_nd)
108 if (p_nd == NULL)
109 return (0);
110 if (p_nd->m_type == pat_trie_leaf_node_type)
111 return (1);
112 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
113 size_type ret = 0;
114 for (typename internal_node::const_iterator it =
115 static_cast<const_internal_node_pointer>(p_nd)->begin();
116 it != static_cast<const_internal_node_pointer>(p_nd)->end();
117 ++it)
118 ret += recursive_count_leafs(*it);
119 return ret;
122 #endif