-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_ompss_static_vector.cpp
More file actions
80 lines (63 loc) · 2.18 KB
/
test_ompss_static_vector.cpp
File metadata and controls
80 lines (63 loc) · 2.18 KB
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
/*
* Copyright (C) 2019 Jimmy Aguilar Mena
*
* This program 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 3 of the License, or
* (at your option) any later version.
*
* This program 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 program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <iostream>
#include <vector>
#include <cassert>
#include "ompss_static_vector.hpp"
const static int Narray[] = {4, 5, 1, 9, 12, 8, 15};
using namespace std;
int main()
{
vector<int> thevector;
// Fill a vector
for (size_t i = 0; i < sizeof(Narray) / sizeof(int); ++i)
thevector.push_back(Narray[i]);
// Constructor from std::vector
ompss_static_vector<int> ompssvector(thevector);
// test the search algorithm
auto a = thevector.begin();
auto b = ompssvector.begin();
for (; a != thevector.end() && b != ompssvector.end(); ++a, ++b) {
cout << *a << " =? " << *b <<endl;
assert(*a == *b);
}
// Test the size function
cout << "Size before: " << ompssvector.size() << " =? " << thevector.size() << endl;
assert(ompssvector.size() == thevector.size());
const int tmp_array[] = {-1, 2, 10, 18, 4, 5};
cout << "Test insert" << endl;
for (auto &i : tmp_array) {
ompssvector.push_back(i);
thevector.push_back(i);
}
a = thevector.begin();
b= ompssvector.begin();
for (; a != thevector.end() && b != ompssvector.end(); ++a, ++b) {
cout << *a << " =? " << *b <<endl;
assert(*a == *b);
}
// Test the size function
cout << "Size after: " << ompssvector.size() << " =? " << thevector.size() << endl;
assert(ompssvector.size() == thevector.size());
// Test operator []
const size_t lastindex = ompssvector.size();
for (size_t i = 0; i < lastindex; ++i) {
cout << i << ": " << thevector[i] << " =? " << ompssvector[i] <<endl;
assert(thevector[i] == ompssvector[i]);
}
return 0;
}