• Home
  • History
  • Annotate
  • Line#
  • Navigate
  • Raw
  • Download
  • only in /asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-armeabi-2011.09/arm-none-eabi/include/c++/4.6.1/ext/pb_ds/detail/thin_heap_/
1// -*- C++ -*-
2
3// Copyright (C) 2005, 2006, 2009, 2010 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 split_join_fn_imps.hpp
38 * Contains an implementation for thin_heap_.
39 */
40
41PB_DS_CLASS_T_DEC
42template<typename Pred>
43void
44PB_DS_CLASS_C_DEC::
45split(Pred pred, PB_DS_CLASS_C_DEC& other)
46{
47  _GLIBCXX_DEBUG_ONLY(assert_valid();)
48    _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
49
50    other.clear();
51
52  if (base_type::empty())
53    {
54      _GLIBCXX_DEBUG_ONLY(assert_valid();)
55        _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
56
57        return;
58    }
59
60  base_type::to_linked_list();
61
62  node_pointer p_out = base_type::prune(pred);
63
64  while (p_out != 0)
65    {
66      _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0);
67      --base_type::m_size;
68
69      ++other.m_size;
70
71      node_pointer p_next = p_out->m_p_next_sibling;
72
73      other.make_root_and_link(p_out);
74
75      p_out = p_next;
76    }
77
78  _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
79
80    node_pointer p_cur = base_type::m_p_root;
81
82  m_p_max = 0;
83
84  base_type::m_p_root = 0;
85
86  while (p_cur != 0)
87    {
88      node_pointer p_next = p_cur->m_p_next_sibling;
89
90      make_root_and_link(p_cur);
91
92      p_cur = p_next;
93    }
94
95  _GLIBCXX_DEBUG_ONLY(assert_valid();)
96    _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
97    }
98
99PB_DS_CLASS_T_DEC
100inline void
101PB_DS_CLASS_C_DEC::
102join(PB_DS_CLASS_C_DEC& other)
103{
104  _GLIBCXX_DEBUG_ONLY(assert_valid();)
105    _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
106
107    node_pointer p_other = other.m_p_root;
108
109  while (p_other != 0)
110    {
111      node_pointer p_next = p_other->m_p_next_sibling;
112
113      make_root_and_link(p_other);
114
115      p_other = p_next;
116    }
117
118  base_type::m_size += other.m_size;
119
120  other.m_p_root = 0;
121  other.m_size = 0;
122  other.m_p_max = 0;
123
124  _GLIBCXX_DEBUG_ONLY(assert_valid();)
125    _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
126    }
127