1 // 2005-12-20 Paolo Carlini <pcarlini@suse.de>
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, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
21 // 23.2.1.3 deque::swap
24 #include <testsuite_hooks.h>
25 #include <testsuite_allocator.h>
27 // uneq_allocator as a non-empty allocator.
31 bool test
__attribute__((unused
)) = true;
34 typedef __gnu_test::uneq_allocator
<char> my_alloc
;
35 typedef deque
<char, my_alloc
> my_deque
;
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 my_deque::size_type size01
, size02
;
51 my_deque
deq01(alloc01
);
52 size01
= deq01
.size();
53 my_deque
deq02(alloc01
);
54 size02
= deq02
.size();
57 VERIFY( deq01
.size() == size02
);
58 VERIFY( deq01
.empty() );
59 VERIFY( deq02
.size() == size01
);
60 VERIFY( deq02
.empty() );
62 my_deque
deq03(alloc01
);
63 size01
= deq03
.size();
64 my_deque
deq04(title02
, title02
+ N2
, alloc01
);
65 size02
= deq04
.size();
68 VERIFY( deq03
.size() == size02
);
69 VERIFY( equal(deq03
.begin(), deq03
.end(), title02
) );
70 VERIFY( deq04
.size() == size01
);
71 VERIFY( deq04
.empty() );
73 my_deque
deq05(title01
, title01
+ N1
, alloc01
);
74 size01
= deq05
.size();
75 my_deque
deq06(title02
, title02
+ N2
, alloc01
);
76 size02
= deq06
.size();
79 VERIFY( deq05
.size() == size02
);
80 VERIFY( equal(deq05
.begin(), deq05
.end(), title02
) );
81 VERIFY( deq06
.size() == size01
);
82 VERIFY( equal(deq06
.begin(), deq06
.end(), title01
) );
84 my_deque
deq07(title01
, title01
+ N1
, alloc01
);
85 size01
= deq07
.size();
86 my_deque
deq08(title03
, title03
+ N3
, alloc01
);
87 size02
= deq08
.size();
90 VERIFY( deq07
.size() == size02
);
91 VERIFY( equal(deq07
.begin(), deq07
.end(), title03
) );
92 VERIFY( deq08
.size() == size01
);
93 VERIFY( equal(deq08
.begin(), deq08
.end(), title01
) );
95 my_deque
deq09(title03
, title03
+ N3
, alloc01
);
96 size01
= deq09
.size();
97 my_deque
deq10(title04
, title04
+ N4
, alloc01
);
98 size02
= deq10
.size();
101 VERIFY( deq09
.size() == size02
);
102 VERIFY( equal(deq09
.begin(), deq09
.end(), title04
) );
103 VERIFY( deq10
.size() == size01
);
104 VERIFY( equal(deq10
.begin(), deq10
.end(), title03
) );
106 my_deque
deq11(title04
, title04
+ N4
, alloc01
);
107 size01
= deq11
.size();
108 my_deque
deq12(title01
, title01
+ N1
, alloc01
);
109 size02
= deq12
.size();
112 VERIFY( deq11
.size() == size02
);
113 VERIFY( equal(deq11
.begin(), deq11
.end(), title01
) );
114 VERIFY( deq12
.size() == size01
);
115 VERIFY( equal(deq12
.begin(), deq12
.end(), title04
) );
117 my_deque
deq13(title03
, title03
+ N3
, alloc01
);
118 size01
= deq13
.size();
119 my_deque
deq14(title03
, title03
+ N3
, alloc01
);
120 size02
= deq14
.size();
123 VERIFY( deq13
.size() == size02
);
124 VERIFY( equal(deq13
.begin(), deq13
.end(), title03
) );
125 VERIFY( deq14
.size() == size01
);
126 VERIFY( equal(deq14
.begin(), deq14
.end(), title03
) );