]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
3 | // Copyright (C) 2005, 2006 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 2, 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 | // You should have received a copy of the GNU General Public License | |
17 | // along with this library; see the file COPYING. If not, write to | |
18 | // the Free Software Foundation, 59 Temple Place - Suite 330, Boston, | |
19 | // MA 02111-1307, USA. | |
20 | ||
21 | // As a special exception, you may use this file as part of a free | |
22 | // software library without restriction. Specifically, if other files | |
23 | // instantiate templates or use macros or inline functions from this | |
24 | // file, or you compile this file and link it with other files to | |
25 | // produce an executable, this file does not by itself cause the | |
26 | // resulting executable to be covered by the GNU General Public | |
27 | // License. This exception does not however invalidate any other | |
28 | // reasons why the executable file might be covered by the GNU General | |
29 | // Public License. | |
30 | ||
31 | // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. | |
32 | ||
33 | // Permission to use, copy, modify, sell, and distribute this software | |
34 | // is hereby granted without fee, provided that the above copyright | |
35 | // notice appears in all copies, and that both that copyright notice | |
36 | // and this permission notice appear in supporting documentation. None | |
37 | // of the above authors, nor IBM Haifa Research Laboratories, make any | |
38 | // representation about the suitability of this software for any | |
39 | // purpose. It is provided "as is" without express or implied | |
40 | // warranty. | |
41 | ||
42 | /** | |
43 | * @file split_join_fn_imps.hpp | |
44 | * Contains an implementation class for splay_tree_. | |
45 | */ | |
46 | ||
47 | PB_DS_CLASS_T_DEC | |
48 | inline void | |
49 | PB_DS_CLASS_C_DEC:: | |
50 | join(PB_DS_CLASS_C_DEC& other) | |
51 | { | |
52 | PB_DS_DBG_ONLY(assert_valid();) | |
53 | PB_DS_DBG_ONLY(other.assert_valid();) | |
54 | ||
55 | if (PB_DS_BASE_C_DEC::join_prep(other) == false) | |
56 | { | |
57 | PB_DS_DBG_ONLY(assert_valid();) | |
58 | PB_DS_DBG_ONLY(other.assert_valid();) | |
59 | ||
60 | return; | |
61 | } | |
62 | ||
63 | node_pointer p_target_r = other.leftmost(other.m_p_head); | |
64 | ||
65 | PB_DS_DBG_ASSERT(p_target_r != NULL); | |
66 | ||
67 | other.splay(p_target_r); | |
68 | ||
69 | PB_DS_DBG_ASSERT(p_target_r == other.m_p_head->m_p_parent); | |
70 | PB_DS_DBG_ASSERT(p_target_r->m_p_left == NULL); | |
71 | ||
72 | p_target_r->m_p_left = PB_DS_BASE_C_DEC::m_p_head->m_p_parent; | |
73 | ||
74 | PB_DS_DBG_ASSERT(p_target_r->m_p_left != NULL); | |
75 | p_target_r->m_p_left->m_p_parent = p_target_r; | |
76 | ||
77 | PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_target_r; | |
78 | p_target_r->m_p_parent = PB_DS_BASE_C_DEC::m_p_head; | |
79 | ||
80 | apply_update(p_target_r, (node_update* )this); | |
81 | ||
82 | PB_DS_BASE_C_DEC::join_finish(other); | |
83 | ||
84 | PB_DS_DBG_ONLY(assert_valid();) | |
85 | PB_DS_DBG_ONLY(other.assert_valid();) | |
86 | } | |
87 | ||
88 | PB_DS_CLASS_T_DEC | |
89 | void | |
90 | PB_DS_CLASS_C_DEC:: | |
91 | split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other) | |
92 | { | |
93 | PB_DS_DBG_ONLY(assert_valid()); | |
94 | PB_DS_DBG_ONLY(other.assert_valid()); | |
95 | ||
96 | if (PB_DS_BASE_C_DEC::split_prep(r_key, other) == false) | |
97 | { | |
98 | PB_DS_DBG_ONLY(assert_valid()); | |
99 | PB_DS_DBG_ONLY(other.assert_valid()); | |
100 | ||
101 | return; | |
102 | } | |
103 | ||
104 | node_pointer p_upper_bound = upper_bound(r_key).m_p_nd; | |
105 | PB_DS_DBG_ASSERT(p_upper_bound != NULL); | |
106 | ||
107 | splay(p_upper_bound); | |
108 | PB_DS_DBG_ASSERT(p_upper_bound->m_p_parent == this->m_p_head); | |
109 | ||
110 | node_pointer p_new_root = p_upper_bound->m_p_left; | |
111 | PB_DS_DBG_ASSERT(p_new_root != NULL); | |
112 | ||
113 | PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_new_root; | |
114 | p_new_root->m_p_parent = PB_DS_BASE_C_DEC::m_p_head; | |
115 | ||
116 | other.m_p_head->m_p_parent = p_upper_bound; | |
117 | p_upper_bound->m_p_parent = other.m_p_head; | |
118 | p_upper_bound->m_p_left = NULL; | |
119 | ||
120 | apply_update(p_upper_bound, (node_update* )this); | |
121 | ||
122 | PB_DS_BASE_C_DEC::split_finish(other); | |
123 | ||
124 | PB_DS_DBG_ONLY(assert_valid()); | |
125 | PB_DS_DBG_ONLY(other.assert_valid()); | |
126 | } | |
127 |