| 5134 |
serge |
1 |
// -*- C++ -*- |
|
|
2 |
|
|
|
3 |
// Copyright (C) 2005-2013 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 |
// . |
|
|
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 splay_tree_/split_join_fn_imps.hpp |
|
|
38 |
* Contains an implementation class for splay_tree_. |
|
|
39 |
*/ |
|
|
40 |
|
|
|
41 |
PB_DS_CLASS_T_DEC |
|
|
42 |
inline void |
|
|
43 |
PB_DS_CLASS_C_DEC:: |
|
|
44 |
join(PB_DS_CLASS_C_DEC& other) |
|
|
45 |
{ |
|
|
46 |
PB_DS_ASSERT_VALID((*this)) |
|
|
47 |
PB_DS_ASSERT_VALID(other) |
|
|
48 |
if (base_type::join_prep(other) == false) |
|
|
49 |
{ |
|
|
50 |
PB_DS_ASSERT_VALID((*this)) |
|
|
51 |
PB_DS_ASSERT_VALID(other) |
|
|
52 |
return; |
|
|
53 |
} |
|
|
54 |
|
|
|
55 |
node_pointer p_target_r = other.leftmost(other.m_p_head); |
|
|
56 |
_GLIBCXX_DEBUG_ASSERT(p_target_r != 0); |
|
|
57 |
other.splay(p_target_r); |
|
|
58 |
|
|
|
59 |
_GLIBCXX_DEBUG_ASSERT(p_target_r == other.m_p_head->m_p_parent); |
|
|
60 |
_GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_left == 0); |
|
|
61 |
|
|
|
62 |
p_target_r->m_p_left = base_type::m_p_head->m_p_parent; |
|
|
63 |
|
|
|
64 |
_GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_left != 0); |
|
|
65 |
p_target_r->m_p_left->m_p_parent = p_target_r; |
|
|
66 |
|
|
|
67 |
base_type::m_p_head->m_p_parent = p_target_r; |
|
|
68 |
p_target_r->m_p_parent = base_type::m_p_head; |
|
|
69 |
|
|
|
70 |
this->apply_update(p_target_r, (node_update*)this); |
|
|
71 |
base_type::join_finish(other); |
|
|
72 |
|
|
|
73 |
PB_DS_ASSERT_VALID((*this)) |
|
|
74 |
PB_DS_ASSERT_VALID(other) |
|
|
75 |
} |
|
|
76 |
|
|
|
77 |
PB_DS_CLASS_T_DEC |
|
|
78 |
void |
|
|
79 |
PB_DS_CLASS_C_DEC:: |
|
|
80 |
split(key_const_reference r_key, PB_DS_CLASS_C_DEC& other) |
|
|
81 |
{ |
|
|
82 |
PB_DS_ASSERT_VALID((*this)) |
|
|
83 |
PB_DS_ASSERT_VALID(other) |
|
|
84 |
|
|
|
85 |
if (base_type::split_prep(r_key, other) == false) |
|
|
86 |
{ |
|
|
87 |
PB_DS_ASSERT_VALID((*this)) |
|
|
88 |
PB_DS_ASSERT_VALID(other) |
|
|
89 |
return; |
|
|
90 |
} |
|
|
91 |
|
|
|
92 |
node_pointer p_upper_bound = this->upper_bound(r_key).m_p_nd; |
|
|
93 |
_GLIBCXX_DEBUG_ASSERT(p_upper_bound != 0); |
|
|
94 |
|
|
|
95 |
splay(p_upper_bound); |
|
|
96 |
_GLIBCXX_DEBUG_ASSERT(p_upper_bound->m_p_parent == this->m_p_head); |
|
|
97 |
|
|
|
98 |
node_pointer p_new_root = p_upper_bound->m_p_left; |
|
|
99 |
_GLIBCXX_DEBUG_ASSERT(p_new_root != 0); |
|
|
100 |
|
|
|
101 |
base_type::m_p_head->m_p_parent = p_new_root; |
|
|
102 |
p_new_root->m_p_parent = base_type::m_p_head; |
|
|
103 |
other.m_p_head->m_p_parent = p_upper_bound; |
|
|
104 |
p_upper_bound->m_p_parent = other.m_p_head; |
|
|
105 |
p_upper_bound->m_p_left = 0; |
|
|
106 |
this->apply_update(p_upper_bound, (node_update*)this); |
|
|
107 |
base_type::split_finish(other); |
|
|
108 |
|
|
|
109 |
PB_DS_ASSERT_VALID((*this)) |
|
|
110 |
PB_DS_ASSERT_VALID(other) |
|
|
111 |
} |
|
|
112 |
|