1// 2004-07-26 Matt Austern <austern@apple.com> 2// 3// Copyright (C) 2003 Free Software Foundation, Inc. 4// 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) 9// any later version. 10// 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. 15// 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, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, 19// USA. 20// 21// As a special exception, you may use this file as part of a free software 22// library without restriction. Specifically, if other files instantiate 23// templates or use macros or inline functions from this file, or you compile 24// this file and link it with other files to produce an executable, this 25// file does not by itself cause the resulting executable to be covered by 26// the GNU General Public License. This exception does not however 27// invalidate any other reasons why the executable file might be covered by 28// the GNU General Public License. 29 30#include <list> 31#include <iterator> 32#include <testsuite_allocator.h> 33 34using namespace __gnu_test; 35 36int main() 37{ 38 typedef std::list<int, tracker_alloc<int> > Container; 39 const int arr10[10] = { 2, 4, 1, 7, 3, 8, 10, 5, 9, 6 }; 40 bool ok = true; 41 42 allocation_tracker::resetCounts(); 43 { 44 Container c; 45 ok = check_construct_destroy("empty container", 0, 0) && ok; 46 } 47 ok = check_construct_destroy("empty container", 0, 0) && ok; 48 49 50 allocation_tracker::resetCounts(); 51 { 52 Container c(arr10, arr10 + 10); 53 ok = check_construct_destroy("Construct from range", 10, 0) && ok; 54 } 55 ok = check_construct_destroy("Construct from range", 10, 10) && ok; 56 57 { 58 Container c(arr10, arr10 + 10); 59 allocation_tracker::resetCounts(); 60 c.insert(c.begin(), arr10[0]); 61 ok = check_construct_destroy("Insert element", 1, 0) && ok; 62 } 63 ok = check_construct_destroy("Insert element", 1, 11) && ok; 64 65 { 66 Container c(arr10, arr10 + 10); 67 allocation_tracker::resetCounts(); 68 Container::iterator i5 = c.begin(); 69 std::advance(i5, 5); 70 c.insert(i5, arr10, arr10+3); 71 ok = check_construct_destroy("Insert short range", 3, 0) && ok; 72 } 73 ok = check_construct_destroy("Insert short range", 3, 13) && ok; 74 75 { 76 Container c(arr10, arr10 + 10); 77 allocation_tracker::resetCounts(); 78 Container::iterator i7 = c.begin(); 79 std::advance(i7, 5); 80 c.insert(i7, arr10, arr10+10); 81 ok = check_construct_destroy("Insert long range", 10, 0) && ok; 82 } 83 ok = check_construct_destroy("Insert long range", 10, 20) && ok; 84 85 return ok ? 0 : 1; 86} 87 88