Home | History | Annotate | Download | only in thin_heap_ 
      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 thin_heap_/split_join_fn_imps.hpp
     38  * Contains an implementation for thin_heap_.
     39  */
     40 
     41 PB_DS_CLASS_T_DEC
     42 template<typename Pred>
     43 void
     44 PB_DS_CLASS_C_DEC::
     45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
     46 {
     47   PB_DS_ASSERT_VALID((*this))
     48   PB_DS_ASSERT_VALID(other)
     49 
     50   other.clear();
     51   if (base_type::empty())
     52     {
     53       PB_DS_ASSERT_VALID((*this))
     54       PB_DS_ASSERT_VALID(other)
     55       return;
     56     }
     57 
     58   base_type::to_linked_list();
     59   node_pointer p_out = base_type::prune(pred);
     60 
     61   while (p_out != 0)
     62     {
     63       _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0);
     64       --base_type::m_size;
     65       ++other.m_size;
     66       node_pointer p_next = p_out->m_p_next_sibling;
     67       other.make_root_and_link(p_out);
     68       p_out = p_next;
     69     }
     70 
     71   PB_DS_ASSERT_VALID(other)
     72   node_pointer p_cur = base_type::m_p_root;
     73   m_p_max = 0;
     74   base_type::m_p_root = 0;
     75   while (p_cur != 0)
     76     {
     77       node_pointer p_next = p_cur->m_p_next_sibling;
     78       make_root_and_link(p_cur);
     79       p_cur = p_next;
     80     }
     81 
     82   PB_DS_ASSERT_VALID((*this))
     83   PB_DS_ASSERT_VALID(other)
     84 }
     85 
     86 PB_DS_CLASS_T_DEC
     87 inline void
     88 PB_DS_CLASS_C_DEC::
     89 join(PB_DS_CLASS_C_DEC& other)
     90 {
     91   PB_DS_ASSERT_VALID((*this))
     92   PB_DS_ASSERT_VALID(other)
     93 
     94   node_pointer p_other = other.m_p_root;
     95   while (p_other != 0)
     96     {
     97       node_pointer p_next = p_other->m_p_next_sibling;
     98       make_root_and_link(p_other);
     99       p_other = p_next;
    100     }
    101   base_type::m_size += other.m_size;
    102   other.m_p_root = 0;
    103   other.m_size = 0;
    104   other.m_p_max = 0;
    105 
    106   PB_DS_ASSERT_VALID((*this))
    107   PB_DS_ASSERT_VALID(other)
    108 }
    109