1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/***************************************************************************
* tests/containers/test_deque.cpp
*
* Part of the STXXL. See http://stxxl.sourceforge.net
*
* Copyright (C) 2006 Roman Dementiev <dementiev@ira.uka.de>
* Copyright (C) 2009 Andreas Beckmann <beckmann@cs.uni-frankfurt.de>
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
**************************************************************************/
#include <iterator>
#include <stxxl/deque>
int main(int argc, char* argv[])
{
if (argc != 2) {
STXXL_MSG("Usage: " << argv[0] << " #ops");
return -1;
}
stxxl::deque<int> Deque;
stxxl::deque<int>::const_iterator b = Deque.begin();
stxxl::deque<int>::const_iterator e = Deque.end();
STXXL_CHECK(b == e);
Deque.push_front(1);
Deque.push_front(2);
Deque.push_front(3);
b = Deque.begin();
STXXL_CHECK(b != e);
Deque.push_back(5);
std::copy(Deque.begin(), Deque.end(), std::ostream_iterator<int>(std::cout, " "));
stxxl::random_number32 rand;
stxxl::deque<int> XXLDeque;
std::deque<int> STDDeque;
stxxl::uint64 ops = stxxl::atouint64(argv[1]);
for (stxxl::uint64 i = 0; i < ops; ++i)
{
unsigned curOP = rand() % 6;
unsigned value = rand();
switch (curOP)
{
case 0:
case 1:
XXLDeque.push_front(value);
STDDeque.push_front(value);
break;
case 2:
XXLDeque.push_back(value);
STDDeque.push_back(value);
break;
case 3:
if (!XXLDeque.empty())
{
XXLDeque.pop_front();
STDDeque.pop_front();
}
break;
case 4:
if (!XXLDeque.empty())
{
XXLDeque.pop_back();
STDDeque.pop_back();
}
break;
case 5:
if (XXLDeque.size() > 0)
{
stxxl::deque<int>::iterator XXLI = XXLDeque.begin() + (value % XXLDeque.size());
std::deque<int>::iterator STDI = STDDeque.begin() + (value % STDDeque.size());
*XXLI = value;
*STDI = value;
unsigned value1 = rand();
if (XXLI - XXLDeque.begin() == 0)
break;
XXLI = XXLI - (value1 % (XXLI - XXLDeque.begin()));
STDI = STDI - (value1 % (STDI - STDDeque.begin()));
*XXLI = value1;
*STDI = value1;
}
break;
}
STXXL_CHECK(XXLDeque.empty() == STDDeque.empty());
STXXL_CHECK(XXLDeque.size() == STDDeque.size());
STXXL_CHECK(XXLDeque.end() - XXLDeque.begin() == STDDeque.end() - STDDeque.begin());
//STXXL_CHECK(std::equal(XXLDeque.begin(),XXLDeque.end(),STDDeque.begin() _STXXL_FORCE_SEQUENTIAL));
if (XXLDeque.size() > 0)
{
STXXL_CHECK(XXLDeque.back() == STDDeque.back());
STXXL_CHECK(XXLDeque.front() == STDDeque.front());
}
if (!(i % 100000))
{
STXXL_CHECK(std::equal(XXLDeque.begin(), XXLDeque.end(), STDDeque.begin() _STXXL_FORCE_SEQUENTIAL));
STXXL_MSG("Operations done: " << i << " size: " << STDDeque.size());
}
}
return 0;
}
// forced instantiation
template class stxxl::deque<int>;
typedef stxxl::deque<int> deque_type;
template class stxxl::deque_iterator<deque_type>;
template class stxxl::const_deque_iterator<deque_type>;
|
