-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvectormap.cpp
More file actions
75 lines (62 loc) · 2.1 KB
/
Copy pathvectormap.cpp
File metadata and controls
75 lines (62 loc) · 2.1 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
// Copyright (C) 2025 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 <argparser.hpp>
#include "vectormap.hpp"
#include "utils.h"
int main()
{
vectorMap<int, int, 4> mymap;
std::vector<std::pair<int, int>> reference = {{8, 16},
{4, 8},
{10, 20},
{2, 4},
{3, 6},
{7, 14},
{5, 10}};
std::cout << "Init some values from reference" << std::endl;
for (auto &[k, v] : reference) {
std::cout << "init[" << k << "] = " << v << std::endl;
mymap[k] = v;
}
std::cout << "\nIterate over the chunks to see internal storage" << std::endl;
mymap.traverse_chunks(
[](int key, const auto &chunk)
{
std::cout << key << ": " ;
for (size_t i = 0; i < chunk.size(); ++i) {
if (chunk[i].has_value()) {
// I only use a pair here to use the overloaded operator<<
std::cout << std::pair(key + i, chunk[i].value()) << ", ";
myassert(2 * (key + i) == (size_t)chunk[i].value());
}
}
std::cout << std::endl;
}
);
std::cout << "\nCompare some values from reference" << std::endl;
for (auto &[k, v] : reference) {
myassert(mymap[k] == v);
}
std::cout << "\nIterate non-recursive" << std::endl;
mymap.traverse(
[](const std::pair<int, int>& p)
{
std::cout << p.first << " -> " << p.second << std::endl;
myassert(2 * p.first == p.second);
}
);
// std::cout << "\nIterate with iterator" << std::endl;
// for (const auto& it : mymap) {
// std::cout << it << std::endl;
// }
return 0;
}