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

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005-2022 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_/insert_fn_imps.hpp
  38  * Contains an implementation class for a pairing heap.
  39  */
  40
  41 #ifdef PB_DS_CLASS_C_DEC
  42
  43 PB_DS_CLASS_T_DEC
  44 inline typename PB_DS_CLASS_C_DEC::point_iterator
  45 PB_DS_CLASS_C_DEC::
  46 push(const_reference r_val)
  47 {
  48   PB_DS_ASSERT_VALID((*this))
  49   node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val);
  50   push_imp(p_new_nd);
  51   PB_DS_ASSERT_VALID((*this))
  52   return point_iterator(p_new_nd);
  53 }
  54
  55 PB_DS_CLASS_T_DEC
  56 inline void
  57 PB_DS_CLASS_C_DEC::
  58 push_imp(node_pointer p_nd)
  59 {
  60   p_nd->m_p_l_child = 0;
  61   if (base_type::m_p_root == 0)
  62     {
  63       p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0;
  64       base_type::m_p_root = p_nd;
  65     }
  66   else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
  67     {
  68       p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0;
  69       base_type::make_child_of(base_type::m_p_root, p_nd);
  70       PB_DS_ASSERT_NODE_CONSISTENT(p_nd, false)
  71       base_type::m_p_root = p_nd;
  72     }
  73   else
  74     {
  75       base_type::make_child_of(p_nd, base_type::m_p_root);
  76       PB_DS_ASSERT_NODE_CONSISTENT(base_type::m_p_root, false)
  77     }
  78 }
  79
  80 PB_DS_CLASS_T_DEC
  81 void
  82 PB_DS_CLASS_C_DEC::
  83 modify(point_iterator it, const_reference r_new_val)
  84 {
  85   PB_DS_ASSERT_VALID((*this))
  86   remove_node(it.m_p_nd);
  87   it.m_p_nd->m_value = r_new_val;
  88   push_imp(it.m_p_nd);
  89   PB_DS_ASSERT_VALID((*this))
  90 }
  91 #endif