libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005, 2006, 2009, 2010 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 insert_fn_imps.hpp
  38  * Contains an implementation class for a base of binomial heaps.
  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   _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
  47
  48     node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
  49
  50   insert_node(p_nd);
  51
  52   m_p_max = 0;
  53
  54   _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
  55
  56     return point_iterator(p_nd);
  57 }
  58
  59 PB_DS_CLASS_T_DEC
  60 inline void
  61 PB_DS_CLASS_C_DEC::
  62 insert_node(node_pointer p_nd)
  63 {
  64   if (base_type::m_p_root == 0)
  65     {
  66       p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
  67         p_nd->m_p_l_child = 0;
  68
  69       p_nd->m_metadata = 0;
  70
  71       base_type::m_p_root = p_nd;
  72
  73       return;
  74     }
  75
  76   if (base_type::m_p_root->m_metadata > 0)
  77     {
  78       p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0;
  79
  80       p_nd->m_p_next_sibling = base_type::m_p_root;
  81
  82       base_type::m_p_root->m_p_prev_or_parent = p_nd;
  83
  84       base_type::m_p_root = p_nd;
  85
  86       p_nd->m_metadata = 0;
  87
  88       return;
  89     }
  90
  91   if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
  92     {
  93       p_nd->m_p_next_sibling = base_type::m_p_root->m_p_next_sibling;
  94
  95       p_nd->m_p_prev_or_parent = 0;
  96
  97       p_nd->m_metadata = 1;
  98
  99       p_nd->m_p_l_child = base_type::m_p_root;
 100
 101       base_type::m_p_root->m_p_prev_or_parent = p_nd;
 102
 103       base_type::m_p_root->m_p_next_sibling = 0;
 104
 105       base_type::m_p_root = p_nd;
 106     }
 107   else
 108     {
 109       p_nd->m_p_next_sibling = 0;
 110
 111       p_nd->m_p_l_child = 0;
 112
 113       p_nd->m_p_prev_or_parent = base_type::m_p_root;
 114
 115       p_nd->m_metadata = 0;
 116
 117       _GLIBCXX_DEBUG_ASSERT(base_type::m_p_root->m_p_l_child == 0);
 118       base_type::m_p_root->m_p_l_child = p_nd;
 119
 120       base_type::m_p_root->m_metadata = 1;
 121     }
 122
 123   base_type::m_p_root = fix(base_type::m_p_root);
 124 }
 125
 126 PB_DS_CLASS_T_DEC
 127 inline typename PB_DS_CLASS_C_DEC::node_pointer
 128 PB_DS_CLASS_C_DEC::
 129 fix(node_pointer p_nd) const
 130 {
 131   while (p_nd->m_p_next_sibling != 0&&
 132          p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata)
 133     {
 134       node_pointer p_next = p_nd->m_p_next_sibling;
 135
 136       if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
 137         {
 138           p_next->m_p_prev_or_parent =
 139             p_nd->m_p_prev_or_parent;
 140
 141           if (p_nd->m_p_prev_or_parent != 0)
 142             p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next;
 143
 144           base_type::make_child_of(p_nd, p_next);
 145
 146           ++p_next->m_metadata;
 147
 148           p_nd = p_next;
 149         }
 150       else
 151         {
 152           p_nd->m_p_next_sibling = p_next->m_p_next_sibling;
 153
 154           if (p_nd->m_p_next_sibling != 0)
 155             p_next->m_p_next_sibling = 0;
 156
 157           base_type::make_child_of(p_next, p_nd);
 158
 159           ++p_nd->m_metadata;
 160         }
 161     }
 162
 163   if (p_nd->m_p_next_sibling != 0)
 164     p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd;
 165
 166   return p_nd;
 167 }
 168
 169 PB_DS_CLASS_T_DEC
 170 void
 171 PB_DS_CLASS_C_DEC::
 172 modify(point_iterator it, const_reference r_new_val)
 173 {
 174   _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 175     node_pointer p_nd = it.m_p_nd;
 176
 177   _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
 178   _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd, false);)
 179
 180     const bool bubble_up = Cmp_Fn::operator()(p_nd->m_value, r_new_val);
 181
 182   p_nd->m_value = r_new_val;
 183
 184   if (bubble_up)
 185     {
 186       node_pointer p_parent = base_type::parent(p_nd);
 187
 188       while (p_parent != 0&&
 189              Cmp_Fn::operator()(p_parent->m_value, p_nd->m_value))
 190         {
 191           base_type::swap_with_parent(p_nd, p_parent);
 192
 193           p_parent = base_type::parent(p_nd);
 194         }
 195
 196       if (p_nd->m_p_prev_or_parent == 0)
 197         base_type::m_p_root = p_nd;
 198
 199       m_p_max = 0;
 200
 201       _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 202
 203         return;
 204     }
 205
 206   base_type::bubble_to_top(p_nd);
 207
 208   remove_parentless_node(p_nd);
 209
 210   insert_node(p_nd);
 211
 212   m_p_max = 0;
 213
 214   _GLIBCXX_DEBUG_ONLY(assert_valid(true);)
 215     }
 216