1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
// -*- C++ -*-
// Copyright (C) 2005 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING. If not, write to the Free
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
// USA.
// As a special exception, you may use this file as part of a free software
// library without restriction. Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the GNU General Public License. This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the GNU General Public License.
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
// Permission to use, copy, modify, sell, and distribute this software
// is hereby granted without fee, provided that the above copyright
// notice appears in all copies, and that both that copyright notice and
// this permission notice appear in supporting documentation. None of
// the above authors, nor IBM Haifa Research Laboratories, make any
// representation about the suitability of this software for any
// purpose. It is provided "as is" without express or implied warranty.
/**
* @file split_join_fn_imps.hpp
* Contains an implementation class for splay_tree_.
*/
PB_ASSOC_CLASS_T_DEC
inline void
PB_ASSOC_CLASS_C_DEC::
join(PB_ASSOC_CLASS_C_DEC& r_other)
{
PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
if (PB_ASSOC_BASE_C_DEC::join_prep(r_other) == false)
{
PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
return;
}
node_pointer p_target_r = r_other.leftmost(r_other.m_p_head);
PB_ASSOC_DBG_ASSERT(p_target_r != NULL);
r_other.splay(p_target_r);
PB_ASSOC_DBG_ASSERT(p_target_r == r_other.m_p_head->m_p_parent);
PB_ASSOC_DBG_ASSERT(p_target_r->m_p_left == NULL);
p_target_r->m_p_left = PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent;
PB_ASSOC_DBG_ASSERT(p_target_r->m_p_left != NULL);
p_target_r->m_p_left->m_p_parent = p_target_r;
PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_target_r;
p_target_r->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
apply_update(p_target_r, (Node_Updator* )this);
PB_ASSOC_BASE_C_DEC::join_finish(r_other);
PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
}
PB_ASSOC_CLASS_T_DEC
void
PB_ASSOC_CLASS_C_DEC::
split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other)
{
PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
if (PB_ASSOC_BASE_C_DEC::split_prep(r_key, r_other) == false)
{
PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
return;
}
node_pointer p_upper_bound = upper_bound(r_key).m_p_nd;
PB_ASSOC_DBG_ASSERT(p_upper_bound != NULL);
PB_ASSOC_DBG_ASSERT(p_upper_bound->m_p_parent ==
PB_ASSOC_BASE_C_DEC::m_p_head);
node_pointer p_new_root = p_upper_bound->m_p_left;
PB_ASSOC_DBG_ASSERT(p_new_root != NULL);
PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_new_root;
p_new_root->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
r_other.m_p_head->m_p_parent = p_upper_bound;
p_upper_bound->m_p_parent = r_other.m_p_head;
p_upper_bound->m_p_left = NULL;
apply_update(p_upper_bound, (Node_Updator* )this);
PB_ASSOC_BASE_C_DEC::split_finish(r_other);
PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
}
|
