Home | History | Annotate | Download | only in rc_binomial_heap_
      1 // -*- C++ -*-
      2 
      3 // Copyright (C) 2005, 2006, 2009 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 debug_fn_imps.hpp
     38  * Contains an implementation for rc_binomial_heap_.
     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
     47 {
     48   base_type::assert_valid(false);
     49   if (!base_type::empty())
     50     {
     51       _GLIBCXX_DEBUG_ASSERT(base_type::m_p_max != NULL);
     52       base_type::assert_max();
     53     }
     54 
     55   m_rc.assert_valid();
     56 
     57   if (m_rc.empty())
     58     {
     59       base_type::assert_valid(true);
     60       _GLIBCXX_DEBUG_ASSERT(next_2_pointer(base_type::m_p_root) == NULL);
     61       return;
     62     }
     63 
     64   const_node_pointer p_nd = next_2_pointer(base_type::m_p_root);
     65   typename rc_t::const_iterator it = m_rc.end();
     66   --it;
     67 
     68   while (p_nd != NULL)
     69     {
     70       _GLIBCXX_DEBUG_ASSERT(*it == p_nd);
     71       const_node_pointer p_next = p_nd->m_p_next_sibling;
     72       _GLIBCXX_DEBUG_ASSERT(p_next != NULL);
     73       _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_next->m_metadata);
     74       _GLIBCXX_DEBUG_ASSERT(p_next->m_p_next_sibling == NULL ||
     75 		       p_next->m_metadata < p_next->m_p_next_sibling->m_metadata);
     76 
     77       --it;
     78       p_nd = next_2_pointer(next_after_0_pointer(p_nd));
     79     }
     80   _GLIBCXX_DEBUG_ASSERT(it + 1 == m_rc.begin());
     81 }
     82 
     83 PB_DS_CLASS_T_DEC
     84 typename PB_DS_CLASS_C_DEC::const_node_pointer
     85 PB_DS_CLASS_C_DEC::
     86 next_2_pointer(const_node_pointer p_nd)
     87 {
     88   if (p_nd == NULL)
     89     return NULL;
     90 
     91   node_pointer p_next = p_nd->m_p_next_sibling;
     92 
     93   if (p_next == NULL)
     94     return NULL;
     95 
     96   if (p_nd->m_metadata == p_next->m_metadata)
     97     return p_nd;
     98 
     99   return next_2_pointer(p_next);
    100 }
    101 
    102 PB_DS_CLASS_T_DEC
    103 typename PB_DS_CLASS_C_DEC::const_node_pointer
    104 PB_DS_CLASS_C_DEC::
    105 next_after_0_pointer(const_node_pointer p_nd)
    106 {
    107   if (p_nd == NULL)
    108     return NULL;
    109 
    110   node_pointer p_next = p_nd->m_p_next_sibling;
    111 
    112   if (p_next == NULL)
    113     return NULL;
    114 
    115   if (p_nd->m_metadata < p_next->m_metadata)
    116     return p_next;
    117 
    118   return next_after_0_pointer(p_next);
    119 }
    120 
    121 #endif
    122