| // { dg-options "-std=gnu++0x" } |
| |
| // Copyright (C) 2005, 2007 Free Software Foundation, Inc. |
| // |
| // This file is part of the GNU ISO C++ Library. This library is free |
| // software; you can redistribute it and/or modify it under the |
| // terms of the GNU General Public License as published by the |
| // Free Software Foundation; either version 2, or (at your option) |
| // any later version. |
| |
| // This library is distributed in the hope that it will be useful, |
| // but WITHOUT ANY WARRANTY; without even the implied warranty of |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| // GNU General Public License for more details. |
| |
| // You should have received a copy of the GNU General Public License along |
| // with this library; see the file COPYING. If not, write to the Free |
| // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, |
| // USA. |
| |
| // As a special exception, you may use this file as part of a free software |
| // library without restriction. Specifically, if other files instantiate |
| // templates or use macros or inline functions from this file, or you compile |
| // this file and link it with other files to produce an executable, this |
| // file does not by itself cause the resulting executable to be covered by |
| // the GNU General Public License. This exception does not however |
| // invalidate any other reasons why the executable file might be covered by |
| // the GNU General Public License. |
| |
| #include <vector> |
| #include <testsuite_hooks.h> |
| #include <testsuite_rvalref.h> |
| |
| using namespace __gnu_test; |
| |
| // Test vector::push_back makes no unneeded copies. |
| void |
| test01() |
| { |
| bool test __attribute__((unused)) = true; |
| |
| std::vector<copycounter> a; |
| copycounter c(1); |
| copycounter::copycount = 0; |
| for(int i = 0; i < 10; ++i) |
| a.push_back(c); |
| VERIFY(copycounter::copycount == 10); |
| |
| for(int i = 0; i < 100; ++i) |
| a.insert(a.begin() + i, c); |
| VERIFY(copycounter::copycount == 110); |
| |
| for(int i = 0; i < 1000; ++i) |
| a.insert(a.end(), c); |
| VERIFY(copycounter::copycount == 1110); |
| } |
| |
| // Test vector::insert(iterator, iterator, iterator) makes no unneeded copies |
| // when it has to also reallocate the vector's internal buffer. |
| void |
| test02() |
| { |
| bool test __attribute__((unused)) = true; |
| |
| copycounter c(1); |
| std::vector<copycounter> a(10, c), b(100, c); |
| copycounter::copycount = 0; |
| a.insert(a.begin(), b.begin(), b.begin() + 20); |
| VERIFY(copycounter::copycount == 20); |
| a.insert(a.end(), b.begin(), b.begin() + 50); |
| VERIFY(copycounter::copycount == 70); |
| a.insert(a.begin() + 50, b.begin(), b.end()); |
| VERIFY(copycounter::copycount == 170); |
| } |
| |
| // Test vector::insert(iterator, iterator, iterator) makes no unneeded copies |
| // when it doesn't have to reallocate the vector's internal buffer. |
| void |
| test03() |
| { |
| bool test __attribute__((unused)) = true; |
| |
| copycounter c(1); |
| std::vector<copycounter> a(10, c), b(100, c); |
| copycounter::copycount = 0; |
| a.reserve(1000); |
| VERIFY(copycounter::copycount == 0); |
| a.insert(a.begin(), b.begin(), b.begin() + 20); |
| VERIFY(copycounter::copycount == 20); |
| a.insert(a.end(), b.begin(), b.begin() + 50); |
| VERIFY(copycounter::copycount == 70); |
| a.insert(a.begin() + 50, b.begin(), b.end()); |
| VERIFY(copycounter::copycount == 170); |
| } |
| |
| // Test vector::insert(iterator, count, value) makes no unneeded copies |
| // when it has to also reallocate the vector's internal buffer. |
| void |
| test04() |
| { |
| bool test __attribute__((unused)) = true; |
| |
| copycounter c(1); |
| std::vector<copycounter> a(10, c); |
| copycounter::copycount = 0; |
| a.insert(a.begin(), 20, c); |
| VERIFY(copycounter::copycount == 20 + 1); |
| a.insert(a.end(), 50, c); |
| VERIFY(copycounter::copycount == 70 + 2); |
| a.insert(a.begin() + 50, 100, c); |
| VERIFY(copycounter::copycount == 170 + 3); |
| } |
| |
| // Test vector::insert(iterator, count, value) makes no unneeded copies |
| // when it doesn't have to reallocate the vector's internal buffer. |
| void |
| test05() |
| { |
| bool test __attribute__((unused)) = true; |
| |
| copycounter c(1); |
| std::vector<copycounter> a(10, c); |
| copycounter::copycount = 0; |
| a.reserve(1000); |
| a.insert(a.begin(), 20, c); |
| // NOTE : These values are each one higher than might be expected, as |
| // vector::insert(iterator, count, value) copies the value it is given |
| // when it doesn't reallocate the buffer. |
| VERIFY(copycounter::copycount == 20 + 1); |
| a.insert(a.end(), 50, c); |
| VERIFY(copycounter::copycount == 70 + 2); |
| a.insert(a.begin() + 50, 100, c); |
| VERIFY(copycounter::copycount == 170 + 3); |
| } |
| |
| |
| |
| int main() |
| { |
| test01(); |
| test02(); |
| test03(); |
| test04(); |
| test05(); |
| return 0; |
| } |