libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005-2016 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 3, or (at your option) any later
   9 // version.
  10
  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.
  15
  16 // Under Section 7 of GPL version 3, you are granted additional
  17 // permissions described in the GCC Runtime Library Exception, version
  18 // 3.1, as published by the Free Software Foundation.
  19
  20 // You should have received a copy of the GNU General Public License and
  21 // a copy of the GCC Runtime Library Exception along with this program;
  22 // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
  23 // <http://www.gnu.org/licenses/>.
  24
  25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  26
  27 // Permission to use, copy, modify, sell, and distribute this software
  28 // is hereby granted without fee, provided that the above copyright
  29 // notice appears in all copies, and that both that copyright notice
  30 // and this permission notice appear in supporting documentation. None
  31 // of the above authors, nor IBM Haifa Research Laboratories, make any
  32 // representation about the suitability of this software for any
  33 // purpose. It is provided "as is" without express or implied
  34 // warranty.
  35
  36 /**
  37  * @file pat_trie_/debug_fn_imps.hpp
  38  * Contains an implementation class for pat_trie_.
  39  */
  40
  41 #ifdef _GLIBCXX_DEBUG
  42
  43 PB_DS_CLASS_T_DEC
  44 void
  45 PB_DS_CLASS_C_DEC::
  46 assert_valid(const char* __file, int __line) const
  47 {
  48   if (m_p_head->m_p_parent != 0)
  49     m_p_head->m_p_parent->assert_valid(this, __file, __line);
  50   assert_iterators(__file, __line);
  51   assert_reverse_iterators(__file, __line);
  52   if (m_p_head->m_p_parent == 0)
  53     {
  54       PB_DS_DEBUG_VERIFY(m_p_head->m_p_min == m_p_head);
  55       PB_DS_DEBUG_VERIFY(m_p_head->m_p_max == m_p_head);
  56       PB_DS_DEBUG_VERIFY(empty());
  57       return;
  58     }
  59
  60   PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node);
  61   PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node);
  62   PB_DS_DEBUG_VERIFY(!empty());
  63 }
  64
  65 PB_DS_CLASS_T_DEC
  66 void
  67 PB_DS_CLASS_C_DEC::
  68 assert_iterators(const char* __file, int __line) const
  69 {
  70   size_type calc_size = 0;
  71   for (const_iterator it = begin(); it != end(); ++it)
  72     {
  73       ++calc_size;
  74       debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line);
  75       PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);
  76       PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it);
  77     }
  78   PB_DS_DEBUG_VERIFY(calc_size == m_size);
  79 }
  80
  81 PB_DS_CLASS_T_DEC
  82 void
  83 PB_DS_CLASS_C_DEC::
  84 assert_reverse_iterators(const char* __file, int __line) const
  85 {
  86   size_type calc_size = 0;
  87   for (const_reverse_iterator it = rbegin(); it != rend(); ++it)
  88     {
  89       ++calc_size;
  90       node_const_pointer p_nd =
  91         const_cast<PB_DS_CLASS_C_DEC*>(this)->find_imp(PB_DS_V2F(*it));
  92       PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd);
  93     }
  94   PB_DS_DEBUG_VERIFY(calc_size == m_size);
  95 }
  96
  97 PB_DS_CLASS_T_DEC
  98 typename PB_DS_CLASS_C_DEC::size_type
  99 PB_DS_CLASS_C_DEC::
 100 recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line)
 101 {
 102   if (p_nd == 0)
 103     return (0);
 104   if (p_nd->m_type == leaf_node)
 105     return (1);
 106   PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node);
 107   size_type ret = 0;
 108   for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin();
 109        it != static_cast<inode_const_pointer>(p_nd)->end();
 110        ++it)
 111     ret += recursive_count_leafs(*it, __file, __line);
 112   return ret;
 113 }
 114
 115 #endif