libstdc++
ov_tree_map_/split_join_fn_imps.hpp
Go to the documentation of this file.
1 // -*- C++ -*-
2 
3 // Copyright (C) 2005, 2006, 2009, 2011 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 ov_tree_map_/split_join_fn_imps.hpp
38  * Contains an implementation class for ov_tree_.
39  */
40 
41 PB_DS_CLASS_T_DEC
42 void
43 PB_DS_CLASS_C_DEC::
44 split(key_const_reference r_key, PB_DS_CLASS_C_DEC& other)
45 {
46  PB_DS_ASSERT_VALID((*this))
47  PB_DS_ASSERT_VALID(other)
48 
49  if (m_size == 0)
50  {
51  other.clear();
52  return;
53  }
54 
55  if (Cmp_Fn::operator()(r_key, PB_DS_V2F(*begin())))
56  {
57  value_swap(other);
58  PB_DS_ASSERT_VALID((*this))
59  PB_DS_ASSERT_VALID(other)
60  return;
61  }
62 
63  if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(*(end() - 1))))
64  {
65  return;
66  }
67 
68  if (m_size == 1)
69  {
70  value_swap(other);
71  PB_DS_ASSERT_VALID((*this))
72  PB_DS_ASSERT_VALID(other)
73  return;
74  }
75 
76  iterator it = upper_bound(r_key);
77  PB_DS_CLASS_C_DEC new_other(other, other);
78  new_other.copy_from_ordered_range(it, end());
79  PB_DS_CLASS_C_DEC new_this(*this, *this);
80  new_this.copy_from_ordered_range(begin(), it);
81 
82  // No exceptions from this point.
83  other.update(other.node_begin(), (node_update*)(&other));
84  update(node_begin(), (node_update*)this);
85  other.value_swap(new_other);
86  value_swap(new_this);
87  PB_DS_ASSERT_VALID((*this))
88  PB_DS_ASSERT_VALID(other)
89 }
90 
91 PB_DS_CLASS_T_DEC
92 void
93 PB_DS_CLASS_C_DEC::
94 join(PB_DS_CLASS_C_DEC& other)
95 {
96  PB_DS_ASSERT_VALID((*this))
97  PB_DS_ASSERT_VALID(other)
98  if (other.m_size == 0)
99  return;
100 
101  if (m_size == 0)
102  {
103  value_swap(other);
104  PB_DS_ASSERT_VALID((*this))
105  PB_DS_ASSERT_VALID(other)
106  return;
107  }
108 
109  const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)),
110  PB_DS_V2F(*other.begin()));
111 
112  const bool lesser = Cmp_Fn::operator()(PB_DS_V2F(*(other.end() - 1)),
113  PB_DS_V2F(*begin()));
114 
115  if (!greater && !lesser)
116  __throw_join_error();
117 
118  PB_DS_CLASS_C_DEC new_this(*this, *this);
119 
120  if (greater)
121  new_this.copy_from_ordered_range(begin(), end(),
122  other.begin(), other.end());
123  else
124  new_this.copy_from_ordered_range(other.begin(), other.end(),
125  begin(), end());
126 
127  // No exceptions from this point.
128  value_swap(new_this);
129  other.clear();
130  PB_DS_ASSERT_VALID((*this))
131  PB_DS_ASSERT_VALID(other)
132 }