The C and C++ Include Header Files

/usr/include/c++/11/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp


$ cat -n /usr/include/c++/11/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp

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