diff options
Diffstat (limited to 'libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp')
| -rw-r--r-- | libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp | 144 |
1 files changed, 144 insertions, 0 deletions
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp new file mode 100644 index 00000000000..1345913a5ae --- /dev/null +++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp @@ -0,0 +1,144 @@ +// -*- C++ -*- + +// Copyright (C) 2005, 2006 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the terms +// of the GNU General Public License as published by the Free Software +// Foundation; either version 2, or (at your option) any later +// version. + +// This library is distributed in the hope that it will be useful, but +// WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +// General Public License for more details. + +// You should have received a copy of the GNU General Public License +// along with this library; see the file COPYING. If not, write to +// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, +// MA 02111-1307, USA. + +// As a special exception, you may use this file as part of a free +// software library without restriction. Specifically, if other files +// instantiate templates or use macros or inline functions from this +// file, or you compile this file and link it with other files to +// produce an executable, this file does not by itself cause the +// resulting executable to be covered by the GNU General Public +// License. This exception does not however invalidate any other +// reasons why the executable file might be covered by the GNU General +// Public License. + +// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. + +// Permission to use, copy, modify, sell, and distribute this software +// is hereby granted without fee, provided that the above copyright +// notice appears in all copies, and that both that copyright notice +// and this permission notice appear in supporting documentation. None +// of the above authors, nor IBM Haifa Research Laboratories, make any +// representation about the suitability of this software for any +// purpose. It is provided "as is" without express or implied +// warranty. + +/** + * @file debug_fn_imps.hpp + * Contains an implementation class for pat_trie_. + */ + +#ifdef PB_DS_PAT_TRIE_DEBUG_ + +PB_DS_CLASS_T_DEC +void +PB_DS_CLASS_C_DEC:: +assert_valid() const +{ + if (m_p_head->m_p_parent != NULL) + m_p_head->m_p_parent->assert_valid(this); + + assert_iterators(); + + assert_reverse_iterators(); + + if (m_p_head->m_p_parent == NULL) + { + PB_DS_DBG_ASSERT(m_p_head->m_p_min == m_p_head); + PB_DS_DBG_ASSERT(m_p_head->m_p_max == m_p_head); + + PB_DS_DBG_ASSERT(empty()); + + return; + } + + PB_DS_DBG_ASSERT(m_p_head->m_p_min->m_type == pat_trie_leaf_node_type); + PB_DS_DBG_ASSERT(m_p_head->m_p_max->m_type == pat_trie_leaf_node_type); + + PB_DS_DBG_ASSERT(!empty()); +} + +PB_DS_CLASS_T_DEC +void +PB_DS_CLASS_C_DEC:: +assert_iterators() const +{ + size_type calc_size = 0; + + for (const_iterator it = begin(); it != end(); ++it) + { + ++calc_size; + + map_debug_base::check_key_exists(PB_DS_V2F(*it)); + + PB_DS_DBG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it); + + PB_DS_DBG_ASSERT(--upper_bound(PB_DS_V2F(*it)) == it); + } + + PB_DS_DBG_ASSERT(calc_size == m_size); +} + +PB_DS_CLASS_T_DEC +void +PB_DS_CLASS_C_DEC:: +assert_reverse_iterators() const +{ + size_type calc_size = 0; + + for (const_reverse_iterator it = rbegin(); it != rend(); ++it) + { + ++calc_size; + + const_node_pointer p_nd = + const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp( + PB_DS_V2F(*it)); + + PB_DS_DBG_ASSERT(p_nd == it.m_p_nd); + } + + PB_DS_DBG_ASSERT(calc_size == m_size); +} + +PB_DS_CLASS_T_DEC +typename PB_DS_CLASS_C_DEC::size_type +PB_DS_CLASS_C_DEC:: +recursive_count_leafs(const_node_pointer p_nd) +{ + if (p_nd == NULL) + return (0); + + if (p_nd->m_type == pat_trie_leaf_node_type) + return (1); + + PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_internal_node_type); + + size_type ret = 0; + + for (typename internal_node::const_iterator it = + static_cast<const_internal_node_pointer>(p_nd)->begin(); + it != static_cast<const_internal_node_pointer>(p_nd)->end(); + ++it) + ret += recursive_count_leafs(*it); + + return (ret); +} + +#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_ + |