1// -*- C++ -*-
2
3// Copyright (C) 2005-2020 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#ifdef PB_DS_CLASS_C_DEC
42
43PB_DS_CLASS_T_DEC
44template<typename Pred>
45void
46PB_DS_CLASS_C_DEC::
47split(Pred pred, PB_DS_CLASS_C_DEC& other)
48{
49  PB_DS_ASSERT_VALID((*this))
50  PB_DS_ASSERT_VALID(other)
51
52  other.clear();
53
54  if (base_type::empty())
55    {
56      PB_DS_ASSERT_VALID((*this))
57      PB_DS_ASSERT_VALID(other)
58      return;
59    }
60
61  base_type::to_linked_list();
62  node_pointer p_out = base_type::prune(pred);
63  while (p_out != 0)
64    {
65      _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0);
66      --base_type::m_size;
67      ++other.m_size;
68      node_pointer p_next = p_out->m_p_next_sibling;
69      p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = 0;
70
71      other.push_imp(p_out);
72      p_out = p_next;
73    }
74
75  PB_DS_ASSERT_VALID(other)
76  node_pointer p_cur = base_type::m_p_root;
77  base_type::m_p_root = 0;
78  while (p_cur != 0)
79    {
80      node_pointer p_next = p_cur->m_p_next_sibling;
81      p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = 0;
82
83      push_imp(p_cur);
84      p_cur = p_next;
85    }
86
87  PB_DS_ASSERT_VALID((*this))
88  PB_DS_ASSERT_VALID(other)
89}
90
91PB_DS_CLASS_T_DEC
92inline void
93PB_DS_CLASS_C_DEC::
94join(PB_DS_CLASS_C_DEC& other)
95{
96  PB_DS_ASSERT_VALID((*this))
97  PB_DS_ASSERT_VALID(other)
98
99  if (other.m_p_root == 0)
100    {
101      PB_DS_ASSERT_VALID((*this))
102      PB_DS_ASSERT_VALID(other)
103      return;
104    }
105
106  if (base_type::m_p_root == 0)
107    base_type::m_p_root = other.m_p_root;
108  else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, other.m_p_root->m_value))
109    {
110      base_type::make_child_of(base_type::m_p_root, other.m_p_root);
111      PB_DS_ASSERT_NODE_CONSISTENT(other.m_p_root, false)
112      base_type::m_p_root = other.m_p_root;
113    }
114  else
115    {
116      base_type::make_child_of(other.m_p_root, base_type::m_p_root);
117      PB_DS_ASSERT_NODE_CONSISTENT(base_type::m_p_root, false)
118    }
119
120  base_type::m_size += other.m_size;
121  other.m_p_root = 0;
122  other.m_size = 0;
123  PB_DS_ASSERT_VALID((*this))
124  PB_DS_ASSERT_VALID(other)
125}
126#endif
127