libstdc++: split_join_fn_imps.hpp Source File

libstdc++

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