3 // Copyright (C) 2005, 2006 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 2, 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 // 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
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
43 * @file debug_fn_imps.hpp
44 * Contains an implementation class for pat_trie_.
54 if (m_p_head
->m_p_parent
!= NULL
)
55 m_p_head
->m_p_parent
->assert_valid(this);
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());
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());
74 assert_iterators() const
76 size_type calc_size
= 0;
77 for (const_iterator it
= begin(); it
!= end(); ++it
)
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
);
90 assert_reverse_iterators() const
92 size_type calc_size
= 0;
93 for (const_reverse_iterator it
= rbegin(); it
!= rend(); ++it
)
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
);
104 typename
PB_DS_CLASS_C_DEC::size_type
106 recursive_count_leafs(const_node_pointer p_nd
)
110 if (p_nd
->m_type
== pat_trie_leaf_node_type
)
112 _GLIBCXX_DEBUG_ASSERT(p_nd
->m_type
== pat_trie_internal_node_type
);
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();
118 ret
+= recursive_count_leafs(*it
);