1 |
19 |
jlechner |
// -*- C++ -*-
|
2 |
|
|
|
3 |
|
|
// Copyright (C) 2005 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
|
7 |
|
|
// terms of the GNU General Public License as published by the
|
8 |
|
|
// Free Software Foundation; either version 2, or (at your option)
|
9 |
|
|
// any later version.
|
10 |
|
|
|
11 |
|
|
// This library is distributed in the hope that it will be useful,
|
12 |
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
13 |
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
14 |
|
|
// GNU General Public License for more details.
|
15 |
|
|
|
16 |
|
|
// You should have received a copy of the GNU General Public License along
|
17 |
|
|
// with this library; see the file COPYING. If not, write to the Free
|
18 |
|
|
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
19 |
|
|
// USA.
|
20 |
|
|
|
21 |
|
|
// As a special exception, you may use this file as part of a free software
|
22 |
|
|
// library without restriction. Specifically, if other files instantiate
|
23 |
|
|
// templates or use macros or inline functions from this file, or you compile
|
24 |
|
|
// this file and link it with other files to produce an executable, this
|
25 |
|
|
// file does not by itself cause the resulting executable to be covered by
|
26 |
|
|
// the GNU General Public License. This exception does not however
|
27 |
|
|
// invalidate any other reasons why the executable file might be covered by
|
28 |
|
|
// the GNU General Public License.
|
29 |
|
|
|
30 |
|
|
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
|
31 |
|
|
|
32 |
|
|
// Permission to use, copy, modify, sell, and distribute this software
|
33 |
|
|
// is hereby granted without fee, provided that the above copyright
|
34 |
|
|
// notice appears in all copies, and that both that copyright notice and
|
35 |
|
|
// this permission notice appear in supporting documentation. None of
|
36 |
|
|
// the above authors, nor IBM Haifa Research Laboratories, make any
|
37 |
|
|
// representation about the suitability of this software for any
|
38 |
|
|
// purpose. It is provided "as is" without express or implied warranty.
|
39 |
|
|
|
40 |
|
|
/**
|
41 |
|
|
* @file splay_tree_map_order_statistics_example.cpp
|
42 |
|
|
* An example showing how to augment a splay tree to support order statistics.
|
43 |
|
|
*/
|
44 |
|
|
|
45 |
|
|
// For trees.
|
46 |
|
|
#include <ext/pb_assoc/assoc_cntnr.hpp>
|
47 |
|
|
// For order_statistics_key
|
48 |
|
|
#include <ext/pb_assoc/tree_policy.hpp>
|
49 |
|
|
// For assert
|
50 |
|
|
#include <cassert>
|
51 |
|
|
|
52 |
|
|
/**
|
53 |
|
|
* A splay tree table mapping ints to chars and storing the ints order statistics.
|
54 |
|
|
*/
|
55 |
|
|
typedef
|
56 |
|
|
pb_assoc::tree_assoc_cntnr<
|
57 |
|
|
pb_assoc::order_statistics_key<int>,
|
58 |
|
|
char,
|
59 |
|
|
pb_assoc::order_statistics_key_cmp<std::less<int> >,
|
60 |
|
|
pb_assoc::splay_tree_ds_tag,
|
61 |
|
|
pb_assoc::order_statistics_node_updator<int> >
|
62 |
|
|
map_type;
|
63 |
|
|
|
64 |
|
|
int
|
65 |
|
|
main()
|
66 |
|
|
{
|
67 |
|
|
typedef pb_assoc::order_statistics_key< int> int_order_statistics_key;
|
68 |
|
|
|
69 |
|
|
map_type s0;
|
70 |
|
|
|
71 |
|
|
// Insert some entries into s0.
|
72 |
|
|
|
73 |
|
|
s0.insert(make_pair(int_order_statistics_key(12), 'a'));
|
74 |
|
|
s0.insert(make_pair(int_order_statistics_key(505), 'b'));
|
75 |
|
|
s0.insert(make_pair(int_order_statistics_key(30), 'c'));
|
76 |
|
|
|
77 |
|
|
// The order of the keys should be: 12, 30, 505.
|
78 |
|
|
|
79 |
|
|
pb_assoc::find_by_order<map_type> by_order;
|
80 |
|
|
|
81 |
|
|
assert(by_order(s0, 0)->first == 12);
|
82 |
|
|
assert(by_order(s0, 1)->first == 30);
|
83 |
|
|
assert(by_order(s0, 2)->first == 505);
|
84 |
|
|
|
85 |
|
|
map_type s1;
|
86 |
|
|
|
87 |
|
|
// Insert some entries into s1.
|
88 |
|
|
|
89 |
|
|
s1.insert(make_pair(int_order_statistics_key(506), 'a'));
|
90 |
|
|
s1.insert(make_pair(int_order_statistics_key(1222), 'b'));
|
91 |
|
|
s1.insert(make_pair(int_order_statistics_key(3004), 'c'));
|
92 |
|
|
|
93 |
|
|
// Now join s0 and s1.
|
94 |
|
|
|
95 |
|
|
s0.join(s1);
|
96 |
|
|
|
97 |
|
|
// The order of the keys should be: 12, 30, 505.
|
98 |
|
|
|
99 |
|
|
assert(by_order(s0, 0)->first == 12);
|
100 |
|
|
assert(by_order(s0, 1)->first == 30);
|
101 |
|
|
assert(by_order(s0, 2)->first == 505);
|
102 |
|
|
assert(by_order(s0, 3)->first == 506);
|
103 |
|
|
assert(by_order(s0, 4)->first == 1222);
|
104 |
|
|
assert(by_order(s0, 5)->first == 3004);
|
105 |
|
|
}
|
106 |
|
|
|