Subversion Repositories Kolibri OS

Rev

Go to most recent revision | Blame | Last modification | View Log | RSS feed

  1. // -*- C++ -*-
  2.  
  3. // Copyright (C) 2005-2013 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 binomial_heap_base_/debug_fn_imps.hpp
  38.  * Contains an implementation class for a base of binomial heaps.
  39.  */
  40.  
  41. #ifdef _GLIBCXX_DEBUG
  42.  
  43. PB_DS_CLASS_T_DEC
  44. void
  45. PB_DS_CLASS_C_DEC::
  46. assert_valid(bool strictly_binomial, const char* __file, int __line) const
  47. {
  48.   base_type::assert_valid(__file, __line);
  49.   assert_node_consistent(base_type::m_p_root, strictly_binomial, true,
  50.                          __file, __line);
  51.   assert_max(__file, __line);
  52. }
  53.  
  54. PB_DS_CLASS_T_DEC
  55. void
  56. PB_DS_CLASS_C_DEC::
  57. assert_max(const char* __file, int __line) const
  58. {
  59.   if (m_p_max == 0)
  60.     return;
  61.   PB_DS_DEBUG_VERIFY(base_type::parent(m_p_max) == 0);
  62.   for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
  63.     PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(m_p_max->m_value,
  64.                                            it.m_p_nd->m_value));
  65. }
  66.  
  67. PB_DS_CLASS_T_DEC
  68. void
  69. PB_DS_CLASS_C_DEC::
  70. assert_node_consistent(node_const_pointer p_nd, bool strictly_binomial,
  71.                        bool increasing, const char* __file, int __line) const
  72. {
  73.   PB_DS_DEBUG_VERIFY(increasing || strictly_binomial);
  74.   base_type::assert_node_consistent(p_nd, false, __file, __line);
  75.   if (p_nd == 0)
  76.     return;
  77.   PB_DS_DEBUG_VERIFY(p_nd->m_metadata == base_type::degree(p_nd));
  78.   PB_DS_DEBUG_VERIFY(base_type::size_under_node(p_nd) ==
  79.                    static_cast<size_type>(1 << p_nd->m_metadata));
  80.   assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing,
  81.                          __file, __line);
  82.   assert_node_consistent(p_nd->m_p_l_child, true, false, __file, __line);
  83.   if (p_nd->m_p_next_sibling != 0)
  84.     {
  85.       if (increasing)
  86.         {
  87.           if (strictly_binomial)
  88.             PB_DS_DEBUG_VERIFY(p_nd->m_metadata
  89.                                   < p_nd->m_p_next_sibling->m_metadata);
  90.           else
  91.             PB_DS_DEBUG_VERIFY(p_nd->m_metadata
  92.                                   <= p_nd->m_p_next_sibling->m_metadata);
  93.         }
  94.       else
  95.         PB_DS_DEBUG_VERIFY(p_nd->m_metadata
  96.                               > p_nd->m_p_next_sibling->m_metadata);
  97.     }
  98. }
  99.  
  100. #endif
  101.