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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Form a census of splitting surface signatures of given order *
* *
* Copyright (c) 2013-2025, Ben Burton *
* For further details contact Ben Burton (bab@debian.org). *
* *
* 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 2 of the *
* License, or (at your option) any later version. *
* *
* As an exception, when this program is distributed through (i) the *
* App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or *
* (iii) Google Play by Google Inc., then that store may impose any *
* digital rights management, device limits and/or redistribution *
* restrictions that are required by its terms of service. *
* *
* 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 <https://www.gnu.org/licenses/>. *
* *
**************************************************************************/
#include <cstdlib>
#include <cstring>
#include <packet/packet.h>
void usage(const char* program) {
std::cerr << "Load a (typically large) file into memory." << std::endl;
std::cerr << std::endl;
std::cerr << "Usage: " << program << " [-t] <file>" << std::endl;
std::cerr << std::endl;
std::cerr << " -t : additionally traverse the tree" << std::endl;
::exit(1);
}
int main(int argc, char* argv[]) {
if (argc < 2 || argc > 3)
usage(argv[0]);
bool traverse;
const char* file = nullptr;
if (argc == 2) {
traverse = false;
file = argv[1];
} else if (strcmp(argv[1], "-t") != 0)
usage(argv[0]);
else {
traverse = true;
file = argv[2];
}
std::cout << "Loading..." << std::endl;
std::shared_ptr<regina::Packet> tree = regina::open(file);
if (! tree) {
std::cerr << "ERROR: Could not load file: " << file << std::endl;
return 1;
}
if (traverse) {
std::cout << "Traversing..." << std::endl;
for (auto p = tree; p; p = p->nextTreePacket())
;
}
std::cout << "Done." << std::endl;
return 0;
}
|
