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 <vector>
31#include <testsuite_allocator.h>
32
33using namespace __gnu_test;
34
35int main()
36{
37  typedef std::vector<int, tracker_alloc<int> > Container;
38  const int arr10[10] = { 2, 4, 1, 7, 3, 8, 10, 5, 9, 6 };
39  bool ok = true;
40
41  allocation_tracker::resetCounts();
42  {
43    Container c;
44    ok = check_construct_destroy("empty container", 0, 0) && ok;
45  }
46  ok = check_construct_destroy("empty container", 0, 0) && ok;
47
48
49  allocation_tracker::resetCounts();
50  {
51    Container c(arr10, arr10 + 10);
52    ok = check_construct_destroy("Construct from range", 10, 0) && ok;
53  }
54  ok = check_construct_destroy("Construct from range", 10, 10) && ok;
55
56  {
57    Container c(arr10, arr10 + 10);
58    c.reserve(100);
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    c.reserve(100);
68    allocation_tracker::resetCounts();
69    c.insert(c.begin() + 5, arr10, arr10+3);
70    ok = check_construct_destroy("Insert short range", 3, 0) && ok;
71  }
72  ok = check_construct_destroy("Insert short range", 3, 13) && ok;
73
74  {
75    Container c(arr10, arr10 + 10);
76    c.reserve(100);
77    allocation_tracker::resetCounts();
78    c.insert(c.begin() + 7, arr10, arr10+10);
79    ok = check_construct_destroy("Insert long range", 10, 0) && ok;
80  }
81  ok = check_construct_destroy("Insert long range", 10, 20) && ok;
82
83  return ok ? 0 : 1;
84}
85
86