3 // Copyright (C) 2005, 2006 Free Software Foundation, Inc.
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 2, or (at your option) any later
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.
16 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19 // MA 02111-1307, USA.
21 // As a special exception, you may use this file as part of a free
22 // software library without restriction. Specifically, if other files
23 // instantiate templates or use macros or inline functions from this
24 // file, or you compile this file and link it with other files to
25 // produce an executable, this file does not by itself cause the
26 // resulting executable to be covered by the GNU General Public
27 // License. This exception does not however invalidate any other
28 // reasons why the executable file might be covered by the GNU General
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
33 // Permission to use, copy, modify, sell, and distribute this software
34 // is hereby granted without fee, provided that the above copyright
35 // notice appears in all copies, and that both that copyright notice
36 // and this permission notice appear in supporting documentation. None
37 // of the above authors, nor IBM Haifa Research Laboratories, make any
38 // representation about the suitability of this software for any
39 // purpose. It is provided "as is" without express or implied
43 * @file split_join_fn_imps.hpp
44 * Contains an implementation for thin_heap_.
48 template<typename Pred
>
51 split(Pred pred
, PB_DS_CLASS_C_DEC
& other
)
53 _GLIBCXX_DEBUG_ONLY(assert_valid();)
54 _GLIBCXX_DEBUG_ONLY(other
.assert_valid();)
58 if (base_type::empty())
60 _GLIBCXX_DEBUG_ONLY(assert_valid();)
61 _GLIBCXX_DEBUG_ONLY(other
.assert_valid();)
66 base_type::to_linked_list();
68 node_pointer p_out
= base_type::prune(pred
);
72 _GLIBCXX_DEBUG_ASSERT(base_type::m_size
> 0);
77 node_pointer p_next
= p_out
->m_p_next_sibling
;
79 other
.make_root_and_link(p_out
);
84 _GLIBCXX_DEBUG_ONLY(other
.assert_valid();)
86 node_pointer p_cur
= base_type::m_p_root
;
90 base_type::m_p_root
= NULL
;
94 node_pointer p_next
= p_cur
->m_p_next_sibling
;
96 make_root_and_link(p_cur
);
101 _GLIBCXX_DEBUG_ONLY(assert_valid();)
102 _GLIBCXX_DEBUG_ONLY(other
.assert_valid();)
108 join(PB_DS_CLASS_C_DEC
& other
)
110 _GLIBCXX_DEBUG_ONLY(assert_valid();)
111 _GLIBCXX_DEBUG_ONLY(other
.assert_valid();)
113 node_pointer p_other
= other
.m_p_root
;
115 while (p_other
!= NULL
)
117 node_pointer p_next
= p_other
->m_p_next_sibling
;
119 make_root_and_link(p_other
);
124 base_type::m_size
+= other
.m_size
;
126 other
.m_p_root
= NULL
;
128 other
.m_p_max
= NULL
;
130 _GLIBCXX_DEBUG_ONLY(assert_valid();)
131 _GLIBCXX_DEBUG_ONLY(other
.assert_valid();)