1 // 2005-12-20 Paolo Carlini <pcarlini@suse.de>
3 // Copyright (C) 2005, 2009 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 3, 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 COPYING3. If not see
18 // <http://www.gnu.org/licenses/>.
20 // 23.2.2.3 list::swap
22 #include <testsuite_hooks.h>
23 #include <testsuite_allocator.h>
25 // uneq_allocator as a non-empty allocator.
26 template<typename _Tp
>
30 bool test
__attribute__((unused
)) = true;
33 typedef _Tp list_type
;
34 typedef typename
list_type::allocator_type allocator_type
;
35 typedef typename
list_type::size_type size_type
;
37 const char title01
[] = "Rivers of sand";
38 const char title02
[] = "Concret PH";
39 const char title03
[] = "Sonatas and Interludes for Prepared Piano";
40 const char title04
[] = "never as tired as when i'm waking up";
42 const size_t N1
= sizeof(title01
);
43 const size_t N2
= sizeof(title02
);
44 const size_t N3
= sizeof(title03
);
45 const size_t N4
= sizeof(title04
);
47 size_type size01
, size02
;
49 allocator_type
alloc01(1);
51 list_type
lis01(alloc01
);
52 size01
= lis01
.size();
53 list_type
lis02(alloc01
);
54 size02
= lis02
.size();
57 VERIFY( lis01
.size() == size02
);
58 VERIFY( lis01
.empty() );
59 VERIFY( lis02
.size() == size01
);
60 VERIFY( lis02
.empty() );
62 list_type
lis03(alloc01
);
63 size01
= lis03
.size();
64 list_type
lis04(title02
, title02
+ N2
, alloc01
);
65 size02
= lis04
.size();
68 VERIFY( lis03
.size() == size02
);
69 VERIFY( equal(lis03
.begin(), lis03
.end(), title02
) );
70 VERIFY( lis04
.size() == size01
);
71 VERIFY( lis04
.empty() );
73 list_type
lis05(title01
, title01
+ N1
, alloc01
);
74 size01
= lis05
.size();
75 list_type
lis06(title02
, title02
+ N2
, alloc01
);
76 size02
= lis06
.size();
79 VERIFY( lis05
.size() == size02
);
80 VERIFY( equal(lis05
.begin(), lis05
.end(), title02
) );
81 VERIFY( lis06
.size() == size01
);
82 VERIFY( equal(lis06
.begin(), lis06
.end(), title01
) );
84 list_type
lis07(title01
, title01
+ N1
, alloc01
);
85 size01
= lis07
.size();
86 list_type
lis08(title03
, title03
+ N3
, alloc01
);
87 size02
= lis08
.size();
90 VERIFY( lis07
.size() == size02
);
91 VERIFY( equal(lis07
.begin(), lis07
.end(), title03
) );
92 VERIFY( lis08
.size() == size01
);
93 VERIFY( equal(lis08
.begin(), lis08
.end(), title01
) );
95 list_type
lis09(title03
, title03
+ N3
, alloc01
);
96 size01
= lis09
.size();
97 list_type
lis10(title04
, title04
+ N4
, alloc01
);
98 size02
= lis10
.size();
101 VERIFY( lis09
.size() == size02
);
102 VERIFY( equal(lis09
.begin(), lis09
.end(), title04
) );
103 VERIFY( lis10
.size() == size01
);
104 VERIFY( equal(lis10
.begin(), lis10
.end(), title03
) );
106 list_type
lis11(title04
, title04
+ N4
, alloc01
);
107 size01
= lis11
.size();
108 list_type
lis12(title01
, title01
+ N1
, alloc01
);
109 size02
= lis12
.size();
112 VERIFY( lis11
.size() == size02
);
113 VERIFY( equal(lis11
.begin(), lis11
.end(), title01
) );
114 VERIFY( lis12
.size() == size01
);
115 VERIFY( equal(lis12
.begin(), lis12
.end(), title04
) );
117 list_type
lis13(title03
, title03
+ N3
, alloc01
);
118 size01
= lis13
.size();
119 list_type
lis14(title03
, title03
+ N3
, alloc01
);
120 size02
= lis14
.size();
123 VERIFY( lis13
.size() == size02
);
124 VERIFY( equal(lis13
.begin(), lis13
.end(), title03
) );
125 VERIFY( lis14
.size() == size01
);
126 VERIFY( equal(lis14
.begin(), lis14
.end(), title03
) );