contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005-2018 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 rc_binomial_heap_/insert_fn_imps.hpp
  38  * Contains an implementation for rc_binomial_heap_.
  39  */
  40
  41 PB_DS_CLASS_T_DEC
  42 inline typename PB_DS_CLASS_C_DEC::point_iterator
  43 PB_DS_CLASS_C_DEC::
  44 push(const_reference r_val)
  45 {
  46   PB_DS_ASSERT_VALID((*this))
  47
  48   make_0_exposed();
  49
  50   PB_DS_ASSERT_VALID((*this))
  51
  52   node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
  53
  54   p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = 0;
  55   p_nd->m_metadata = 0;
  56
  57   if (base_type::m_p_max == 0 || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val))
  58     base_type::m_p_max = p_nd;
  59
  60   p_nd->m_p_next_sibling = base_type::m_p_root;
  61
  62   if (base_type::m_p_root != 0)
  63     base_type::m_p_root->m_p_prev_or_parent = p_nd;
  64
  65   base_type::m_p_root = p_nd;
  66
  67   if (p_nd->m_p_next_sibling != 0&&  p_nd->m_p_next_sibling->m_metadata == 0)
  68     m_rc.push(p_nd);
  69
  70   PB_DS_ASSERT_VALID((*this))
  71
  72   return point_iterator(p_nd);
  73 }
  74
  75 PB_DS_CLASS_T_DEC
  76 void
  77 PB_DS_CLASS_C_DEC::
  78 modify(point_iterator it, const_reference r_new_val)
  79 {
  80   PB_DS_ASSERT_VALID((*this))
  81
  82   make_binomial_heap();
  83
  84   base_type::modify(it, r_new_val);
  85
  86   base_type::find_max();
  87
  88   PB_DS_ASSERT_VALID((*this))
  89 }
  90
  91 PB_DS_CLASS_T_DEC
  92 inline typename PB_DS_CLASS_C_DEC::node_pointer
  93 PB_DS_CLASS_C_DEC::
  94 link_with_next_sibling(node_pointer p_nd)
  95 {
  96   node_pointer p_next = p_nd->m_p_next_sibling;
  97
  98   _GLIBCXX_DEBUG_ASSERT(p_next != 0);
  99   _GLIBCXX_DEBUG_ASSERT(p_next->m_p_prev_or_parent == p_nd);
 100
 101   if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
 102     {
 103       p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
 104
 105       if (p_next->m_p_prev_or_parent == 0)
 106         base_type::m_p_root = p_next;
 107       else
 108         p_next->m_p_prev_or_parent->m_p_next_sibling = p_next;
 109
 110       if (base_type::m_p_max == p_nd)
 111         base_type::m_p_max = p_next;
 112
 113       base_type::make_child_of(p_nd, p_next);
 114
 115       ++p_next->m_metadata;
 116
 117       return p_next;
 118     }
 119
 120   p_nd->m_p_next_sibling = p_next->m_p_next_sibling;
 121
 122   if (p_nd->m_p_next_sibling != 0)
 123     p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd;
 124
 125   if (base_type::m_p_max == p_next)
 126     base_type::m_p_max = p_nd;
 127
 128   base_type::make_child_of(p_next, p_nd);
 129
 130   ++p_nd->m_metadata;
 131
 132   return p_nd;
 133 }
 134
 135 PB_DS_CLASS_T_DEC
 136 void
 137 PB_DS_CLASS_C_DEC::
 138 make_0_exposed()
 139 {
 140   if (m_rc.empty())
 141     return;
 142
 143   node_pointer p_nd = m_rc.top();
 144
 145   m_rc.pop();
 146
 147   _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling != 0);
 148   _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata);
 149
 150   node_pointer p_res = link_with_next_sibling(p_nd);
 151
 152   if (p_res->m_p_next_sibling != 0&&  p_res->m_metadata == p_res->m_p_next_sibling->m_metadata)
 153     m_rc.push(p_res);
 154 }