]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
f5886803 | 3 | // Copyright (C) 2005, 2006, 2009, 2010, 2011 Free Software Foundation, Inc. |
4569a895 AT |
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 | |
748086b7 | 8 | // Foundation; either version 3, or (at your option) any later |
4569a895 AT |
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 | ||
748086b7 JJ |
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/>. | |
4569a895 AT |
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 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 | { | |
f5886803 FD |
46 | PB_DS_ASSERT_VALID((*this)) |
47 | PB_DS_ASSERT_VALID(other) | |
1b24692f BK |
48 | if (base_type::join_prep(other) == false) |
49 | { | |
f5886803 FD |
50 | PB_DS_ASSERT_VALID((*this)) |
51 | PB_DS_ASSERT_VALID(other) | |
1b24692f BK |
52 | return; |
53 | } | |
4569a895 AT |
54 | |
55 | node_pointer p_target_r = other.leftmost(other.m_p_head); | |
8fc81078 | 56 | _GLIBCXX_DEBUG_ASSERT(p_target_r != 0); |
4569a895 AT |
57 | other.splay(p_target_r); |
58 | ||
47bea7b8 | 59 | _GLIBCXX_DEBUG_ASSERT(p_target_r == other.m_p_head->m_p_parent); |
8fc81078 | 60 | _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_left == 0); |
4569a895 | 61 | |
1b24692f | 62 | p_target_r->m_p_left = base_type::m_p_head->m_p_parent; |
4569a895 | 63 | |
8fc81078 | 64 | _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_left != 0); |
4569a895 AT |
65 | p_target_r->m_p_left->m_p_parent = p_target_r; |
66 | ||
1b24692f BK |
67 | base_type::m_p_head->m_p_parent = p_target_r; |
68 | p_target_r->m_p_parent = base_type::m_p_head; | |
94df301f | 69 | this->apply_update(p_target_r, (node_update* )this); |
4569a895 | 70 | |
1b24692f | 71 | base_type::join_finish(other); |
4569a895 | 72 | |
f5886803 FD |
73 | PB_DS_ASSERT_VALID((*this)) |
74 | PB_DS_ASSERT_VALID(other) | |
1b24692f | 75 | } |
4569a895 AT |
76 | |
77 | PB_DS_CLASS_T_DEC | |
78 | void | |
79 | PB_DS_CLASS_C_DEC:: | |
80 | split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other) | |
81 | { | |
f5886803 FD |
82 | PB_DS_ASSERT_VALID((*this)) |
83 | PB_DS_ASSERT_VALID(other) | |
4569a895 | 84 | |
1b24692f | 85 | if (base_type::split_prep(r_key, other) == false) |
4569a895 | 86 | { |
f5886803 FD |
87 | PB_DS_ASSERT_VALID((*this)) |
88 | PB_DS_ASSERT_VALID(other) | |
4569a895 AT |
89 | return; |
90 | } | |
91 | ||
94df301f | 92 | node_pointer p_upper_bound = this->upper_bound(r_key).m_p_nd; |
8fc81078 | 93 | _GLIBCXX_DEBUG_ASSERT(p_upper_bound != 0); |
4569a895 AT |
94 | |
95 | splay(p_upper_bound); | |
47bea7b8 | 96 | _GLIBCXX_DEBUG_ASSERT(p_upper_bound->m_p_parent == this->m_p_head); |
4569a895 AT |
97 | |
98 | node_pointer p_new_root = p_upper_bound->m_p_left; | |
8fc81078 | 99 | _GLIBCXX_DEBUG_ASSERT(p_new_root != 0); |
4569a895 | 100 | |
1b24692f BK |
101 | base_type::m_p_head->m_p_parent = p_new_root; |
102 | p_new_root->m_p_parent = base_type::m_p_head; | |
4569a895 AT |
103 | other.m_p_head->m_p_parent = p_upper_bound; |
104 | p_upper_bound->m_p_parent = other.m_p_head; | |
8fc81078 | 105 | p_upper_bound->m_p_left = 0; |
94df301f | 106 | this->apply_update(p_upper_bound, (node_update* )this); |
1b24692f | 107 | base_type::split_finish(other); |
4569a895 | 108 | |
f5886803 FD |
109 | PB_DS_ASSERT_VALID((*this)) |
110 | PB_DS_ASSERT_VALID(other) | |
4569a895 AT |
111 | } |
112 |