libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005-2014 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 pairing_heap_/split_join_fn_imps.hpp
  38  * Contains an implementation class for a pairing 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
  52   if (base_type::empty())
  53     {
  54       PB_DS_ASSERT_VALID((*this))
  55       PB_DS_ASSERT_VALID(other)
  56       return;
  57     }
  58
  59   base_type::to_linked_list();
  60   node_pointer p_out = base_type::prune(pred);
  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       p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = 0;
  68
  69       other.push_imp(p_out);
  70       p_out = p_next;
  71     }
  72
  73   PB_DS_ASSERT_VALID(other)
  74   node_pointer p_cur = base_type::m_p_root;
  75   base_type::m_p_root = 0;
  76   while (p_cur != 0)
  77     {
  78       node_pointer p_next = p_cur->m_p_next_sibling;
  79       p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = 0;
  80
  81       push_imp(p_cur);
  82       p_cur = p_next;
  83     }
  84
  85   PB_DS_ASSERT_VALID((*this))
  86   PB_DS_ASSERT_VALID(other)
  87 }
  88
  89 PB_DS_CLASS_T_DEC
  90 inline void
  91 PB_DS_CLASS_C_DEC::
  92 join(PB_DS_CLASS_C_DEC& other)
  93 {
  94   PB_DS_ASSERT_VALID((*this))
  95   PB_DS_ASSERT_VALID(other)
  96
  97   if (other.m_p_root == 0)
  98     {
  99       PB_DS_ASSERT_VALID((*this))
 100       PB_DS_ASSERT_VALID(other)
 101       return;
 102     }
 103
 104   if (base_type::m_p_root == 0)
 105     base_type::m_p_root = other.m_p_root;
 106   else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, other.m_p_root->m_value))
 107     {
 108       base_type::make_child_of(base_type::m_p_root, other.m_p_root);
 109       PB_DS_ASSERT_NODE_CONSISTENT(other.m_p_root, false)
 110       base_type::m_p_root = other.m_p_root;
 111     }
 112   else
 113     {
 114       base_type::make_child_of(other.m_p_root, base_type::m_p_root);
 115       PB_DS_ASSERT_NODE_CONSISTENT(base_type::m_p_root, false)
 116     }
 117
 118   base_type::m_size += other.m_size;
 119   other.m_p_root = 0;
 120   other.m_size = 0;
 121   PB_DS_ASSERT_VALID((*this))
 122   PB_DS_ASSERT_VALID(other)
 123 }