1 |
19 |
jlechner |
// Copyright (C) 2004 Free Software Foundation, Inc.
|
2 |
|
|
//
|
3 |
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
4 |
|
|
// software; you can redistribute it and/or modify it under the
|
5 |
|
|
// terms of the GNU General Public License as published by the
|
6 |
|
|
// Free Software Foundation; either version 2, or (at your option)
|
7 |
|
|
// any later version.
|
8 |
|
|
|
9 |
|
|
// This library is distributed in the hope that it will be useful,
|
10 |
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
11 |
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
12 |
|
|
// GNU General Public License for more details.
|
13 |
|
|
|
14 |
|
|
// You should have received a copy of the GNU General Public License along
|
15 |
|
|
// with this library; see the file COPYING. If not, write to the Free
|
16 |
|
|
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
17 |
|
|
// USA.
|
18 |
|
|
|
19 |
|
|
// As a special exception, you may use this file as part of a free software
|
20 |
|
|
// library without restriction. Specifically, if other files instantiate
|
21 |
|
|
// templates or use macros or inline functions from this file, or you compile
|
22 |
|
|
// this file and link it with other files to produce an executable, this
|
23 |
|
|
// file does not by itself cause the resulting executable to be covered by
|
24 |
|
|
// the GNU General Public License. This exception does not however
|
25 |
|
|
// invalidate any other reasons why the executable file might be covered by
|
26 |
|
|
// the GNU General Public License.
|
27 |
|
|
|
28 |
|
|
#define DISABLE_ITERATOR_DEBUG 1
|
29 |
|
|
|
30 |
|
|
#include<cstdlib>
|
31 |
|
|
#include<vector>
|
32 |
|
|
#include<algorithm>
|
33 |
|
|
|
34 |
|
|
#include<sstream>
|
35 |
|
|
#include<testsuite_performance.h>
|
36 |
|
|
#include<testsuite_iterators.h>
|
37 |
|
|
|
38 |
|
|
using namespace std;
|
39 |
|
|
using namespace __gnu_test;
|
40 |
|
|
|
41 |
|
|
const int length = 10000000;
|
42 |
|
|
const int match_length = 3;
|
43 |
|
|
int array[length];
|
44 |
|
|
|
45 |
|
|
int
|
46 |
|
|
main(void)
|
47 |
|
|
{
|
48 |
|
|
time_counter time;
|
49 |
|
|
resource_counter resource;
|
50 |
|
|
int match = rand() % (match_length - 1);
|
51 |
|
|
for(int i = 0; i < length; i++)
|
52 |
|
|
{
|
53 |
|
|
array[i] = (match != 0) ? 1 : 0;
|
54 |
|
|
if(--match < 0) match = rand() % (match_length - 1);
|
55 |
|
|
}
|
56 |
|
|
test_container<int, forward_iterator_wrapper> fcon(array, array + length);
|
57 |
|
|
start_counters(time, resource);
|
58 |
|
|
for(int i = 0; i < 100; i++)
|
59 |
|
|
search_n(fcon.begin(), fcon.end(), 10, 1);
|
60 |
|
|
stop_counters(time, resource);
|
61 |
|
|
report_performance(__FILE__, "forward iterator", time, resource);
|
62 |
|
|
clear_counters(time, resource);
|
63 |
|
|
|
64 |
|
|
test_container<int, random_access_iterator_wrapper> rcon(array, array + length);
|
65 |
|
|
start_counters(time, resource);
|
66 |
|
|
for(int i = 0; i < 100; i++)
|
67 |
|
|
search_n(rcon.begin(), rcon.end(), 10, 1);
|
68 |
|
|
stop_counters(time, resource);
|
69 |
|
|
report_performance(__FILE__, "random acess iterator", time, resource);
|
70 |
|
|
clear_counters(time, resource);
|
71 |
|
|
}
|
72 |
|
|
|