3 // Copyright (C) 2005 Free Software Foundation, Inc.
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)
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.
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,
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.
30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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.
41 * @file tree_join_example.cpp.cpp
42 * An example showing how to join splay_tree_map objects.
43 * The code in the example is relevant to red-black trees as well.
46 // For tree_assoc_cntnr
47 #include <ext/pb_assoc/assoc_cntnr.hpp>
48 // For cannot_join exception.
49 #include <ext/pb_assoc/exception.hpp>
57 * A splay tree table mapping ints to chars.
60 pb_assoc::tree_assoc_cntnr
<
65 pb_assoc::splay_tree_ds_tag
>
71 // Insert some values into the first table.
72 for (int i0
= 0; i0
< 100; ++i0
)
73 h0
.insert(std::make_pair(i0
, 'a'));
75 // Insert some values into the second table.
76 for (int i1
= 0; i1
< 100; ++i1
)
77 h1
.insert(std::make_pair(1000 + i1
, 'b'));
80 * Since all the elements in h0 are smaller than those in h1,
81 * it is possible to join the two tables. This is exception free.
86 // h0 should now contain all entries, and h1 should be empty.
88 assert(h0
.size() == 200);
91 // Now perform an illegal join.
93 // Two other map_t objects.
102 * It is not true that all elements in h2 are smaller than those
103 * in h3, nor is it true that they are all larger. Hence, attempting
104 * to join h2, and h3 should result in an exception.
107 bool exception_thrown
= false;
113 catch(pb_assoc::cannot_join
& )
115 exception_thrown
= true;
118 assert(exception_thrown
);
120 // Since the operation was not performed, the tables should be unaltered.
122 assert(h2
.size() == 2);
123 assert(h3
[2] == 'b');