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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
// -*- C++ -*-
// Copyright (C) 2005, 2006, 2009 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 3, 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.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
// 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 order_statistics_imp.hpp
* Contains forward declarations for order_statistics_key
*/
PB_DS_CLASS_T_DEC
inline typename PB_DS_CLASS_C_DEC::iterator
PB_DS_CLASS_C_DEC::
find_by_order(size_type order)
{
node_iterator it = node_begin();
node_iterator end_it = node_end();
while (it != end_it)
{
node_iterator l_it = it.get_l_child();
const size_type o = (l_it == end_it)?
0 :
l_it.get_metadata();
if (order == o)
return (*it);
else if (order < o)
it = l_it;
else
{
order -= o + 1;
it = it.get_r_child();
}
}
return (PB_DS_BASE_C_DEC::end_iterator());
}
PB_DS_CLASS_T_DEC
inline typename PB_DS_CLASS_C_DEC::const_iterator
PB_DS_CLASS_C_DEC::
find_by_order(size_type order) const
{
return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
}
PB_DS_CLASS_T_DEC
inline typename PB_DS_CLASS_C_DEC::size_type
PB_DS_CLASS_C_DEC::
order_of_key(const_key_reference r_key) const
{
const_node_iterator it = node_begin();
const_node_iterator end_it = node_end();
const cmp_fn& r_cmp_fn =
const_cast<PB_DS_CLASS_C_DEC* >(this)->get_cmp_fn();
size_type ord = 0;
while (it != end_it)
{
const_node_iterator l_it = it.get_l_child();
if (r_cmp_fn(r_key, extract_key(*(*it))))
it = l_it;
else if (r_cmp_fn(extract_key(*(*it)), r_key))
{
ord += (l_it == end_it)?
1 :
1 + l_it.get_metadata();
it = it.get_r_child();
}
else
{
ord += (l_it == end_it)?
0 :
l_it.get_metadata();
it = end_it;
}
}
return (ord);
}
PB_DS_CLASS_T_DEC
inline void
PB_DS_CLASS_C_DEC::
operator()(node_iterator node_it, const_node_iterator end_nd_it) const
{
node_iterator l_child_it = node_it.get_l_child();
const size_type l_rank =(l_child_it == end_nd_it)? 0 : l_child_it.get_metadata();
node_iterator r_child_it = node_it.get_r_child();
const size_type r_rank =(r_child_it == end_nd_it)? 0 : r_child_it.get_metadata();
const_cast<metadata_reference>(node_it.get_metadata())=
1 + l_rank + r_rank;
}
PB_DS_CLASS_T_DEC
PB_DS_CLASS_C_DEC::
~tree_order_statistics_node_update()
{ }
|
