libstdc++: split_join_fn_imps.hpp Source File

libstdc++

thin_heap_/split_join_fn_imps.hpp
Go to the documentation of this file.
1// -*- C++ -*-
2
3// Copyright (C) 2005-2026 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 thin_heap_/split_join_fn_imps.hpp
38 * Contains an implementation for thin_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 if (base_type::empty())
54 {
55 PB_DS_ASSERT_VALID((*this))
56 PB_DS_ASSERT_VALID(other)
57 return;
58 }
59
60 base_type::to_linked_list();
61 node_pointer p_out = base_type::prune(pred);
62
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 other.make_root_and_link(p_out);
70 p_out = p_next;
71 }
72
73 PB_DS_ASSERT_VALID(other)
74 node_pointer p_cur = base_type::m_p_root;
75 m_p_max = 0;
76 base_type::m_p_root = 0;
77 while (p_cur != 0)
78 {
79 node_pointer p_next = p_cur->m_p_next_sibling;
80 make_root_and_link(p_cur);
81 p_cur = p_next;
82 }
83
84 PB_DS_ASSERT_VALID((*this))
85 PB_DS_ASSERT_VALID(other)
86}
87
88PB_DS_CLASS_T_DEC
89inline void
90PB_DS_CLASS_C_DEC::
91join(PB_DS_CLASS_C_DEC& other)
92{
93 PB_DS_ASSERT_VALID((*this))
94 PB_DS_ASSERT_VALID(other)
95
96 node_pointer p_other = other.m_p_root;
97 while (p_other != 0)
98 {
99 node_pointer p_next = p_other->m_p_next_sibling;
100 make_root_and_link(p_other);
101 p_other = p_next;
102 }
103 base_type::m_size += other.m_size;
104 other.m_p_root = 0;
105 other.m_size = 0;
106 other.m_p_max = 0;
107
108 PB_DS_ASSERT_VALID((*this))
109 PB_DS_ASSERT_VALID(other)
110}
111#endif