3 // Copyright (c) 2006-2007 Matias Capeletto
5 // Distributed under the Boost Software License, Version 1.0.
6 // (See accompanying file LICENSE_1_0.txt or copy at
7 // http://www.boost.org/LICENSE_1_0.txt)
9 // VC++ 8.0 warns on usage of certain Standard Library and API functions that
10 // can be cause buffer overruns or other possible security issues if misused.
11 // See https://web.archive.org/web/20071014014301/http://msdn.microsoft.com/msdnmag/issues/05/05/SafeCandC/default.aspx
12 // But the wording of the warning is misleading and unsettling, there are no
13 // portable alternative functions, and VC++ 8.0's own libraries use the
14 // functions in question. So turn off the warnings.
15 #define _CRT_SECURE_NO_DEPRECATE
16 #define _SCL_SECURE_NO_DEPRECATE
18 #include <boost/config.hpp>
21 #include <boost/test/minimal.hpp>
24 #include <boost/bimap/support/lambda.hpp>
25 #include <boost/bimap/bimap.hpp>
29 void test_bimap_modify()
31 using namespace boost::bimaps;
33 typedef bimap<int,long> bm;
36 b.insert( bm::value_type(2,200) );
38 BOOST_CHECK( b.left.at(2) == 200 );
43 //----------------------------------------------------------------------
45 // successful replace in left map view
47 bm::left_iterator i = b.left.begin();
49 result = b.left.replace( i, bm::left_value_type(1,100) );
51 BOOST_CHECK( result );
52 BOOST_CHECK( b.size() == 1 );
53 BOOST_CHECK( i->first == 1 && i->second == 100 );
54 BOOST_CHECK( b.left.at(1) == 100 );
56 result = b.left.replace_key( i, 2 );
58 BOOST_CHECK( result );
59 BOOST_CHECK( b.size() == 1 );
60 BOOST_CHECK( i->first == 2 && i->second == 100 );
61 BOOST_CHECK( b.left.at(2) == 100 );
63 result = b.left.replace_data( i, 200 );
65 BOOST_CHECK( result );
66 BOOST_CHECK( b.size() == 1 );
67 BOOST_CHECK( i->first == 2 && i->second == 200 );
68 BOOST_CHECK( b.left.at(2) == 200 );
71 // successful replace in right map view
73 bm::right_iterator i = b.right.begin();
75 result = b.right.replace( i, bm::right_value_type(100,1) );
77 BOOST_CHECK( result );
78 BOOST_CHECK( b.size() == 1 );
79 BOOST_CHECK( i->first == 100 && i->second == 1 );
80 BOOST_CHECK( b.right.at(100) == 1 );
82 result = b.right.replace_key( i, 200 );
84 BOOST_CHECK( result );
85 BOOST_CHECK( b.size() == 1 );
86 BOOST_CHECK( i->first == 200 && i->second == 1 );
87 BOOST_CHECK( b.right.at(200) == 1 );
89 result = b.right.replace_data( i, 2 );
91 BOOST_CHECK( result );
92 BOOST_CHECK( b.size() == 1 );
93 BOOST_CHECK( i->first == 200 && i->second == 2 );
94 BOOST_CHECK( b.right.at(200) == 2 );
97 // successful replace in set of relations view
99 bm::iterator i = b.begin();
101 result = b.replace( i, bm::value_type(1,100) );
103 BOOST_CHECK( result );
104 BOOST_CHECK( b.size() == 1 );
105 BOOST_CHECK( i->left == 1 && i->right == 100 );
106 BOOST_CHECK( b.left.at(1) == 100 );
108 result = b.replace_left( i, 2 );
110 BOOST_CHECK( result );
111 BOOST_CHECK( b.size() == 1 );
112 BOOST_CHECK( i->left == 2 && i->right == 100 );
113 BOOST_CHECK( b.left.at(2) == 100 );
115 result = b.replace_right( b.begin(), 200 );
117 BOOST_CHECK( result );
118 BOOST_CHECK( b.size() == 1 );
119 BOOST_CHECK( i->left == 2 && i->right == 200 );
120 BOOST_CHECK( b.left.at(2) == 200 );
125 b.insert( bm::value_type(1,100) );
126 b.insert( bm::value_type(2,200) );
128 // fail to replace in left map view
130 bm::left_iterator i = b.left.begin();
132 result = b.left.replace( i, bm::left_value_type(2,100) );
134 BOOST_CHECK( ! result );
135 BOOST_CHECK( b.size() == 2 );
136 BOOST_CHECK( i->first == 1 && i->second == 100 );
137 BOOST_CHECK( b.left.at(1) == 100 );
138 BOOST_CHECK( b.left.at(2) == 200 );
141 // Add checks for replace_key and replace_data
144 // Add checks for fail to replace in right map view
146 // Add checks for fail to replace in set of relations view
150 // ----------------------------------------------------------------------
153 b.insert( bm::value_type(1,100) );
155 // successful modify in left map view
157 result = b.left.modify_key( b.left.begin(), _key = 2 );
159 BOOST_CHECK( result );
160 BOOST_CHECK( b.size() == 1 );
161 BOOST_CHECK( b.left.at(2) == 100 );
163 result = b.left.modify_data( b.left.begin() , _data = 200 );
165 BOOST_CHECK( result );
166 BOOST_CHECK( b.size() == 1 );
167 BOOST_CHECK( b.left.at(2) == 200 );
170 // Add checks for successful modify in right map view
172 // Add checks for fails to modify in left map view
177 void test_bimap_replace_with_info()
179 using namespace boost::bimaps;
180 typedef bimap<int,long,with_info<int> > bm;
183 b.insert( bm::value_type(2,200,-2) );
185 BOOST_CHECK( b.left.at(2) == 200 );
186 BOOST_CHECK( b.left.info_at(2) == -2 );
190 bm::iterator i = b.begin();
192 bool result = b.replace( i, bm::value_type(1,100,-1) );
194 BOOST_CHECK( result );
195 BOOST_CHECK( b.size() == 1 );
196 BOOST_CHECK( i->left == 1 && i->right == 100 );
197 BOOST_CHECK( i->info == -1 );
199 result = b.replace_left( i, 2 );
201 BOOST_CHECK( result );
202 BOOST_CHECK( b.size() == 1 );
203 BOOST_CHECK( i->left == 2 && i->right == 100 );
204 BOOST_CHECK( i->info == -1 );
206 result = b.replace_right( i, 200 );
208 BOOST_CHECK( result );
209 BOOST_CHECK( b.size() == 1 );
210 BOOST_CHECK( i->left == 2 && i->right == 200 );
211 BOOST_CHECK( i->info == -1 );
216 bm::left_iterator i = b.left.begin();
218 bool result = b.left.replace( i, bm::left_value_type(1,100,-1) );
220 BOOST_CHECK( result );
221 BOOST_CHECK( b.left.size() == 1 );
222 BOOST_CHECK( i->first == 1 && i->second == 100 );
223 BOOST_CHECK( i->info == -1 );
225 result = b.left.replace_key( i, 2 );
227 BOOST_CHECK( result );
228 BOOST_CHECK( b.left.size() == 1 );
229 BOOST_CHECK( i->first == 2 && i->second == 100 );
230 BOOST_CHECK( i->info == -1 );
232 result = b.left.replace_data( i, 200 );
234 BOOST_CHECK( result );
235 BOOST_CHECK( b.left.size() == 1 );
236 BOOST_CHECK( i->first == 2 && i->second == 200 );
237 BOOST_CHECK( i->info == -1 );
241 int test_main( int, char* [] )
245 test_bimap_replace_with_info();