libstdc++
pat_trie_/debug_fn_imps.hpp
Go to the documentation of this file.
00001 // -*- C++ -*-
00002 
00003 // Copyright (C) 2005, 2006, 2009, 2010, 2011 Free Software Foundation, Inc.
00004 //
00005 // This file is part of the GNU ISO C++ Library.  This library is free
00006 // software; you can redistribute it and/or modify it under the terms
00007 // of the GNU General Public License as published by the Free Software
00008 // Foundation; either version 3, or (at your option) any later
00009 // version.
00010 
00011 // This library is distributed in the hope that it will be useful, but
00012 // WITHOUT ANY WARRANTY; without even the implied warranty of
00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00014 // General Public License for more details.
00015 
00016 // Under Section 7 of GPL version 3, you are granted additional
00017 // permissions described in the GCC Runtime Library Exception, version
00018 // 3.1, as published by the Free Software Foundation.
00019 
00020 // You should have received a copy of the GNU General Public License and
00021 // a copy of the GCC Runtime Library Exception along with this program;
00022 // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
00023 // <http://www.gnu.org/licenses/>.
00024 
00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
00026 
00027 // Permission to use, copy, modify, sell, and distribute this software
00028 // is hereby granted without fee, provided that the above copyright
00029 // notice appears in all copies, and that both that copyright notice
00030 // and this permission notice appear in supporting documentation. None
00031 // of the above authors, nor IBM Haifa Research Laboratories, make any
00032 // representation about the suitability of this software for any
00033 // purpose. It is provided "as is" without express or implied
00034 // warranty.
00035 
00036 /**
00037  * @file pat_trie_/debug_fn_imps.hpp
00038  * Contains an implementation class for pat_trie_.
00039  */
00040 
00041 #ifdef _GLIBCXX_DEBUG
00042 
00043 PB_DS_CLASS_T_DEC
00044 void
00045 PB_DS_CLASS_C_DEC::
00046 assert_valid(const char* __file, int __line) const
00047 {
00048   if (m_p_head->m_p_parent != 0)
00049     m_p_head->m_p_parent->assert_valid(this, __file, __line);
00050   assert_iterators(__file, __line);
00051   assert_reverse_iterators(__file, __line);
00052   if (m_p_head->m_p_parent == 0)
00053     {
00054       PB_DS_DEBUG_VERIFY(m_p_head->m_p_min == m_p_head);
00055       PB_DS_DEBUG_VERIFY(m_p_head->m_p_max == m_p_head);
00056       PB_DS_DEBUG_VERIFY(empty());
00057       return;
00058     }
00059 
00060   PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node);
00061   PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node);
00062   PB_DS_DEBUG_VERIFY(!empty());
00063 }
00064 
00065 PB_DS_CLASS_T_DEC
00066 void
00067 PB_DS_CLASS_C_DEC::
00068 assert_iterators(const char* __file, int __line) const
00069 {
00070   size_type calc_size = 0;
00071   for (const_iterator it = begin(); it != end(); ++it)
00072     {
00073       ++calc_size;
00074       debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line);
00075       PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);
00076       PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it);
00077     }
00078   PB_DS_DEBUG_VERIFY(calc_size == m_size);
00079 }
00080 
00081 PB_DS_CLASS_T_DEC
00082 void
00083 PB_DS_CLASS_C_DEC::
00084 assert_reverse_iterators(const char* __file, int __line) const
00085 {
00086   size_type calc_size = 0;
00087   for (const_reverse_iterator it = rbegin(); it != rend(); ++it)
00088     {
00089       ++calc_size;
00090       node_const_pointer p_nd =
00091     const_cast<PB_DS_CLASS_C_DEC*>(this)->find_imp(PB_DS_V2F(*it));
00092       PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd);
00093     }
00094   PB_DS_DEBUG_VERIFY(calc_size == m_size);
00095 }
00096 
00097 PB_DS_CLASS_T_DEC
00098 typename PB_DS_CLASS_C_DEC::size_type
00099 PB_DS_CLASS_C_DEC::
00100 recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line)
00101 {
00102   if (p_nd == 0)
00103     return (0);
00104   if (p_nd->m_type == leaf_node)
00105     return (1);
00106   PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node);
00107   size_type ret = 0;
00108   for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin();
00109        it != static_cast<inode_const_pointer>(p_nd)->end();
00110        ++it)
00111     ret += recursive_count_leafs(*it, __file, __line);
00112   return ret;
00113 }
00114 
00115 #endif