1 | /* Boost.MultiIndex test for replace(), modify() and modify_key(). |
2 | * |
3 | * Copyright 2003-2018 Joaquin M Lopez Munoz. |
4 | * Distributed under the Boost Software License, Version 1.0. |
5 | * (See accompanying file LICENSE_1_0.txt or copy at |
6 | * http://www.boost.org/LICENSE_1_0.txt) |
7 | * |
8 | * See http://www.boost.org/libs/multi_index for library home page. |
9 | */ |
10 | |
11 | #include "test_update.hpp" |
12 | |
13 | #include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */ |
14 | #include <algorithm> |
15 | #include <cstddef> |
16 | #include "pre_multi_index.hpp" |
17 | #include "employee.hpp" |
18 | #include "pair_of_ints.hpp" |
19 | #include <boost/detail/lightweight_test.hpp> |
20 | #include <boost/next_prior.hpp> |
21 | |
22 | struct do_nothing |
23 | { |
24 | template<typename T> |
25 | void operator()(const T&)const{} |
26 | }; |
27 | |
28 | struct null_hash |
29 | { |
30 | template<typename T> |
31 | std::size_t operator()(const T&)const{return 0;} |
32 | }; |
33 | |
34 | struct assign_value |
35 | { |
36 | assign_value(int n):n_(n){} |
37 | |
38 | void operator()(int& x)const{x=n_;} |
39 | |
40 | int n_; |
41 | }; |
42 | |
43 | template<class MultiIndexContainer> |
44 | void test_stable_update() |
45 | { |
46 | typedef typename MultiIndexContainer::iterator iterator; |
47 | typedef typename MultiIndexContainer::size_type size_type; |
48 | typedef typename MultiIndexContainer::difference_type difference_type; |
49 | |
50 | MultiIndexContainer c; |
51 | c.insert(0); |
52 | c.insert(1);c.insert(1); |
53 | c.insert(2);c.insert(2);c.insert(2);c.insert(2); |
54 | c.insert(3); |
55 | c.insert(4);c.insert(4);c.insert(4); |
56 | c.insert(5);c.insert(5); |
57 | c.insert(6); |
58 | c.insert(7); |
59 | size_type num_elems= |
60 | c.count(0)+c.count(1)+c.count(2)+c.count(3)+ |
61 | c.count(4)+c.count(5)+c.count(6)+c.count(7); |
62 | |
63 | for(size_type n=c.size();n--;){ |
64 | iterator it=boost::next(c.begin(),(difference_type)n); |
65 | |
66 | c.replace(it,*it); |
67 | BOOST_TEST((size_type)std::distance(c.begin(),it)==n); |
68 | |
69 | c.modify(it,do_nothing()); |
70 | BOOST_TEST((size_type)std::distance(c.begin(),it)==n); |
71 | |
72 | c.modify(it,do_nothing(),do_nothing()); |
73 | BOOST_TEST((size_type)std::distance(c.begin(),it)==n); |
74 | |
75 | for(int i=0;i<=8;++i){ |
76 | MultiIndexContainer cpy(c); |
77 | bool b=c.modify(it,assign_value(i),assign_value(*it)); |
78 | BOOST_TEST(b||(size_type)std::distance(c.begin(),it)==n); |
79 | BOOST_TEST(c.count(0)+c.count(1)+c.count(2)+c.count(3)+c.count(4)+ |
80 | c.count(5)+c.count(6)+c.count(7)+c.count(8)==num_elems); |
81 | if(b){ |
82 | c=cpy; |
83 | it=boost::next(c.begin(),(difference_type)n); |
84 | } |
85 | } |
86 | } |
87 | } |
88 | |
89 | using namespace boost::multi_index; |
90 | |
91 | void test_update() |
92 | { |
93 | employee_set es; |
94 | employee_set_as_inserted& i=get<as_inserted>(m&: es); |
95 | employee_set_randomly& r=get<randomly>(m&: es); |
96 | |
97 | es.insert(x: employee(0,"Joe" ,31,1123)); |
98 | es.insert(x: employee(1,"Robert" ,27,5601)); |
99 | es.insert(x: employee(2,"John" ,40,7889)); |
100 | es.insert(x: employee(3,"Olbert" ,20,9012)); |
101 | es.insert(x: employee(4,"John" ,57,1002)); |
102 | |
103 | employee_set::iterator it=es.find(x: employee(0,"Joe" ,31,1123)); |
104 | employee_set_as_inserted::iterator it1= |
105 | project<as_inserted>(m&: es,it: get<name>(m&: es).find(k: "Olbert" )); |
106 | employee_set_randomly::iterator it2= |
107 | project<randomly>(m&: es,it: get<age>(m&: es).find(x: 57)); |
108 | |
109 | BOOST_TEST(es.replace(it,*it)); |
110 | BOOST_TEST(i.replace(it1,*it1)); |
111 | BOOST_TEST(r.replace(it2,*it2)); |
112 | BOOST_TEST(!es.replace(it,employee(3,"Joe" ,31,1123))&&it->id==0); |
113 | BOOST_TEST(es.replace(it,employee(0,"Joe" ,32,1123))&&it->age==32); |
114 | BOOST_TEST(i.replace(it1,employee(3,"Albert" ,20,9012))&&it1->name== |
115 | "Albert" ); |
116 | BOOST_TEST(!r.replace(it2,employee(4,"John" ,57,5601))); |
117 | |
118 | { |
119 | typedef multi_index_container< |
120 | pair_of_ints, |
121 | indexed_by< |
122 | ordered_unique<BOOST_MULTI_INDEX_MEMBER(pair_of_ints,int,first)>, |
123 | hashed_unique<BOOST_MULTI_INDEX_MEMBER(pair_of_ints,int,second)>, |
124 | sequenced<> > > |
125 | int_int_set; |
126 | |
127 | int_int_set iis; |
128 | nth_index<int_int_set,1>::type& ii1=get<1>(m&: iis); |
129 | nth_index<int_int_set,2>::type& ii2=get<2>(m&: iis); |
130 | iis.insert(x: pair_of_ints(0,0)); |
131 | iis.insert(x: pair_of_ints(5,5)); |
132 | iis.insert(x: pair_of_ints(10,10)); |
133 | |
134 | BOOST_TEST(!iis.replace(iis.begin(),pair_of_ints(5,0))); |
135 | BOOST_TEST(!ii2.replace(ii2.begin(),pair_of_ints(0,5))); |
136 | BOOST_TEST(!ii1.replace(project<1>(iis,iis.begin()),pair_of_ints(5,11))); |
137 | BOOST_TEST(!iis.replace(iis.begin(),pair_of_ints(11,5))); |
138 | BOOST_TEST(!iis.replace(boost::next(iis.begin()),pair_of_ints(10,5))); |
139 | BOOST_TEST(!ii1.replace( |
140 | project<1>(iis,boost::next(iis.begin())),pair_of_ints(5,10))); |
141 | BOOST_TEST(!iis.replace(boost::prior(iis.end()),pair_of_ints(5,10))); |
142 | BOOST_TEST(!ii2.replace(boost::prior(ii2.end()),pair_of_ints(10,5))); |
143 | |
144 | BOOST_TEST(iis.modify(iis.begin(),increment_first)); |
145 | BOOST_TEST(ii2.modify(ii2.begin(),increment_first)); |
146 | BOOST_TEST(ii1.modify(project<1>(iis,iis.begin()),increment_first)); |
147 | BOOST_TEST(ii2.modify(ii2.begin(),increment_first,decrement_first)); |
148 | |
149 | BOOST_TEST(!iis.modify(iis.begin(),increment_first,decrement_first)); |
150 | BOOST_TEST(iis.size()==3); |
151 | |
152 | BOOST_TEST(!iis.modify(iis.begin(),increment_first)); |
153 | BOOST_TEST(iis.size()==2); |
154 | |
155 | iis.insert(x: pair_of_ints(0,0)); |
156 | BOOST_TEST(ii2.modify(boost::prior(ii2.end()),increment_second)); |
157 | BOOST_TEST(iis.modify(iis.begin(),increment_second)); |
158 | BOOST_TEST(ii2.modify(boost::prior(ii2.end()),increment_second)); |
159 | BOOST_TEST(iis.modify(iis.begin(),increment_second,decrement_second)); |
160 | |
161 | BOOST_TEST(!ii2.modify( |
162 | boost::prior(ii2.end()),increment_second,decrement_second)); |
163 | BOOST_TEST(ii2.size()==3); |
164 | |
165 | BOOST_TEST(!ii2.modify(boost::prior(ii2.end()),increment_second)); |
166 | BOOST_TEST(ii2.size()==2); |
167 | |
168 | iis.insert(x: pair_of_ints(0,0)); |
169 | BOOST_TEST(iis.modify_key(iis.begin(),increment_int)); |
170 | BOOST_TEST(iis.modify_key(iis.begin(),increment_int,decrement_int)); |
171 | BOOST_TEST(iis.modify_key(iis.begin(),increment_int)); |
172 | BOOST_TEST(iis.modify_key(iis.begin(),increment_int)); |
173 | |
174 | BOOST_TEST(!iis.modify_key(iis.begin(),increment_int,decrement_int)); |
175 | BOOST_TEST(iis.size()==3); |
176 | |
177 | BOOST_TEST(!iis.modify_key(iis.begin(),increment_int)); |
178 | BOOST_TEST(iis.size()==2); |
179 | |
180 | nth_index_iterator<int_int_set,1>::type it_=ii1.find(k: 5); |
181 | BOOST_TEST(ii1.modify_key(it_,increment_int)); |
182 | BOOST_TEST(ii1.modify_key(it_,increment_int)); |
183 | BOOST_TEST(ii1.modify_key(it_,increment_int,decrement_int)); |
184 | BOOST_TEST(ii1.modify_key(it_,increment_int)); |
185 | |
186 | BOOST_TEST(!ii1.modify_key(it_,increment_int,decrement_int)); |
187 | BOOST_TEST(ii1.size()==2); |
188 | |
189 | BOOST_TEST(!ii1.modify_key(it_,increment_int)); |
190 | BOOST_TEST(ii1.size()==1); |
191 | } |
192 | { |
193 | typedef multi_index_container< |
194 | pair_of_ints, |
195 | indexed_by< |
196 | hashed_unique<BOOST_MULTI_INDEX_MEMBER(pair_of_ints,int,first)>, |
197 | random_access<>, |
198 | ordered_unique<BOOST_MULTI_INDEX_MEMBER(pair_of_ints,int,second)> > > |
199 | int_int_set; |
200 | |
201 | int_int_set iis; |
202 | nth_index<int_int_set,1>::type& ii1=get<1>(m&: iis); |
203 | int_int_set::iterator p1=iis.insert(x: pair_of_ints(0,0)).first; |
204 | int_int_set::iterator p2=iis.insert(x: pair_of_ints(5,5)).first; |
205 | int_int_set::iterator p3=iis.insert(x: pair_of_ints(10,10)).first; |
206 | |
207 | BOOST_TEST(!iis.replace(p1,pair_of_ints(5,0))); |
208 | BOOST_TEST(!ii1.replace(ii1.begin(),pair_of_ints(0,5))); |
209 | BOOST_TEST(!iis.replace(p1,pair_of_ints(5,11))); |
210 | BOOST_TEST(!iis.replace(p1,pair_of_ints(11,5))); |
211 | BOOST_TEST(!iis.replace(p2,pair_of_ints(10,5))); |
212 | BOOST_TEST(!iis.replace(p2,pair_of_ints(5,10))); |
213 | BOOST_TEST(!iis.replace(p3,pair_of_ints(5,10))); |
214 | BOOST_TEST(!ii1.replace(boost::prior(ii1.end()),pair_of_ints(10,5))); |
215 | |
216 | BOOST_TEST(iis.modify(p1,increment_first)); |
217 | BOOST_TEST(ii1.modify(ii1.begin(),increment_first)); |
218 | BOOST_TEST(iis.modify(p1,increment_first)); |
219 | BOOST_TEST(ii1.modify(ii1.begin(),increment_first,decrement_first)); |
220 | |
221 | BOOST_TEST(!iis.modify(p1,increment_first,decrement_first)); |
222 | BOOST_TEST(iis.size()==3); |
223 | |
224 | BOOST_TEST(!iis.modify(p1,increment_first)); |
225 | BOOST_TEST(iis.size()==2); |
226 | |
227 | p1=iis.insert(x: pair_of_ints(0,0)).first; |
228 | BOOST_TEST(ii1.modify(boost::prior(ii1.end()),increment_second)); |
229 | BOOST_TEST(iis.modify(p1,increment_second,decrement_second)); |
230 | BOOST_TEST(ii1.modify(boost::prior(ii1.end()),increment_second)); |
231 | BOOST_TEST(iis.modify(p1,increment_second)); |
232 | |
233 | BOOST_TEST(!ii1.modify( |
234 | boost::prior(ii1.end()),increment_second,decrement_second)); |
235 | BOOST_TEST(ii1.size()==3); |
236 | |
237 | BOOST_TEST(!ii1.modify(boost::prior(ii1.end()),increment_second)); |
238 | BOOST_TEST(ii1.size()==2); |
239 | } |
240 | { |
241 | typedef multi_index_container< |
242 | int, |
243 | indexed_by< |
244 | ordered_non_unique<identity<int> > |
245 | > |
246 | > int_multiset; |
247 | test_stable_update<int_multiset>(); |
248 | |
249 | typedef multi_index_container< |
250 | int, |
251 | indexed_by< |
252 | hashed_unique<identity<int> > |
253 | > |
254 | > int_hashed_set; |
255 | test_stable_update<int_hashed_set>(); |
256 | |
257 | typedef multi_index_container< |
258 | int, |
259 | indexed_by< |
260 | hashed_unique<identity<int> > |
261 | > |
262 | > int_hashed_multiset; |
263 | test_stable_update<int_hashed_multiset>(); |
264 | |
265 | typedef multi_index_container< |
266 | int, |
267 | indexed_by< |
268 | hashed_unique<identity<int>,null_hash> |
269 | > |
270 | > degenerate_int_hashed_set; |
271 | test_stable_update<degenerate_int_hashed_set>(); |
272 | |
273 | typedef multi_index_container< |
274 | int, |
275 | indexed_by< |
276 | hashed_non_unique<identity<int>,null_hash> |
277 | > |
278 | > degenerate_int_hashed_multiset; |
279 | test_stable_update<degenerate_int_hashed_multiset>(); |
280 | } |
281 | } |
282 | |