]>
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 tree_order_statistics_join_example.cpp | |
44 | * An example showing how to augment a splay tree to support order statistics. | |
45 | */ | |
46 | ||
47 | // This example shows how join operations still maintain node | |
48 | // invariants. Specifically, it shows how the objects of containers | |
49 | // supporting order statistics can be joined into an object supporting | |
50 | // order statistics. | |
51 | // While the example does not show this, the same holds for split operations. | |
52 | ||
53 | #include <cassert> | |
54 | #include <ext/pb_ds/assoc_container.hpp> | |
55 | #include <ext/pb_ds/tree_policy.hpp> | |
56 | ||
57 | using namespace std; | |
5e11f978 | 58 | using namespace __gnu_pbds; |
4569a895 AT |
59 | |
60 | // A splay tree table mapping ints to chars and storing the ints order | |
61 | // statistics. | |
62 | typedef | |
5e11f978 BK |
63 | tree<int, char, less<int>, |
64 | splay_tree_tag, | |
65 | tree_order_statistics_node_update> | |
4569a895 AT |
66 | tree_map_t; |
67 | ||
68 | int main() | |
69 | { | |
70 | // Insert some entries into s0. | |
71 | tree_map_t s0; | |
72 | s0.insert(make_pair(12, 'a')); | |
73 | s0.insert(make_pair(505, 'b')); | |
74 | s0.insert(make_pair(30, 'c')); | |
75 | ||
76 | // The order of the keys should be: 12, 30, 505. | |
77 | assert(s0.find_by_order(0)->first == 12); | |
78 | assert(s0.find_by_order(1)->first == 30); | |
79 | assert(s0.find_by_order(2)->first == 505); | |
80 | ||
81 | // Insert some entries into s1. | |
82 | tree_map_t s1; | |
83 | s1.insert(make_pair(506, 'a')); | |
84 | s1.insert(make_pair(1222, 'b')); | |
85 | s1.insert(make_pair(3004, 'a')); | |
86 | ||
87 | // Now join s0 and s1. | |
88 | s0.join(s1); | |
89 | ||
90 | // The order of the keys should be: 12, 30, 505, 506, 1222, 3004. | |
91 | assert(s0.find_by_order(0)->first == 12); | |
92 | assert(s0.find_by_order(1)->first == 30); | |
93 | assert(s0.find_by_order(2)->first == 505); | |
94 | assert(s0.find_by_order(3)->first == 506); | |
95 | assert(s0.find_by_order(4)->first == 1222); | |
96 | assert(s0.find_by_order(5)->first == 3004); | |
97 | ||
98 | return 0; | |
99 | } | |
100 |