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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Computational Engine *
* *
* Copyright (c) 1999-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 <vector>
#include "file/xml/xmlanglestructreader.h"
#include "file/xml/xmltreeresolver.h"
#include "triangulation/dim3.h"
#include "utilities/stringutils.h"
namespace regina {
void XMLAngleStructureReader::startElement(const std::string&,
const regina::xml::XMLPropertyDict& props,
XMLElementReader*) {
if (! valueOf(props.lookup("len"), vecLen))
vecLen = -1;
}
void XMLAngleStructureReader::initialChars(const std::string& chars) {
if (vecLen < 0)
return;
std::vector<std::string> tokens = basicTokenise(chars);
if (tokens.size() % 2 != 0)
return;
// Create a new vector and read all non-zero entries.
VectorInt vec(vecLen);
long pos;
Integer value;
for (size_t i = 0; i < tokens.size(); i += 2) {
if (! valueOf(tokens[i], pos))
return;
if (pos < 0 || pos >= vecLen)
return;
try {
vec[pos] = tokens[i + 1];
} catch (const regina::InvalidArgument&) {
return;
}
}
angles_ = AngleStructure(tri_, std::move(vec));
}
XMLAngleStructuresReader::XMLAngleStructuresReader(XMLTreeResolver& res,
std::shared_ptr<Packet> parent, bool anon, std::string label,
std::string id, const regina::xml::XMLPropertyDict& props) :
XMLPacketReader(res, std::move(parent), anon, std::move(label),
std::move(id)),
list_(nullptr), tri_(resolver_.resolveTri3(props.lookup("tri"))) {
if (! tri_)
return;
// Extract the list parameters from the attributes.
// We will (unnecessarily) allow the algorithm to be missing.
bool tautOnly;
if (! valueOf(props.lookup("tautonly"), tautOnly))
return;
int algorithm;
if (! valueOf(props.lookup("algorithm"), algorithm))
algorithm = static_cast<int>(AngleAlg::Legacy);
list_ = make_packet<AngleStructures>(std::in_place, tautOnly,
Flags<AngleAlg>::fromInt(algorithm), *tri_);
}
XMLElementReader* XMLAngleStructuresReader::startContentSubElement(
const std::string& subTagName,
const regina::xml::XMLPropertyDict& props) {
if (! list_) {
// We are ignoring this <angles> element because it was missing the
// required attributes.
return new XMLElementReader();
}
if (subTagName == "struct")
return new XMLAngleStructureReader(list_->triangulation_);
bool b;
if (subTagName == "spanstrict") {
if (valueOf(props.lookup("value"), b))
list_->doesSpanStrict_ = b;
} else if (subTagName == "spantaut") {
if (valueOf(props.lookup("value"), b))
list_->doesSpanTaut_ = b;
}
return new XMLElementReader();
}
void XMLAngleStructuresReader::endContentSubElement(
const std::string& subTagName,
XMLElementReader* subReader) {
if (list_ && subTagName == "struct")
if (auto& s = static_cast<XMLAngleStructureReader*>(subReader)->
structure())
list_->structures_.push_back(std::move(*s));
}
XMLElementReader* XMLLegacyAngleStructuresReader::startContentSubElement(
const std::string& subTagName,
const regina::xml::XMLPropertyDict& props) {
if (list_) {
bool b;
// The angle structure list has already been created.
if (subTagName == "struct") {
return new XMLAngleStructureReader(list_->triangulation_);
} else if (subTagName == "spanstrict") {
if (valueOf(props.lookup("value"), b))
list_->doesSpanStrict_ = b;
} else if (subTagName == "spantaut") {
if (valueOf(props.lookup("value"), b))
list_->doesSpanTaut_ = b;
} else if (subTagName == "allowstrict") {
if (valueOf(props.lookup("value"), b))
list_->doesSpanStrict_ = b;
} else if (subTagName == "allowtaut") {
if (valueOf(props.lookup("value"), b))
list_->doesSpanTaut_ = b;
}
} else {
// The angle structure list has not yet been created.
if (subTagName == "angleparams") {
// All of these parameters are optional, to support older
// file formats.
bool tautOnly;
int algorithm;
if (! valueOf(props.lookup("tautonly"), tautOnly))
tautOnly = false;
if (! valueOf(props.lookup("algorithm"), algorithm))
algorithm = static_cast<int>(AngleAlg::Legacy);
list_ = make_packet<AngleStructures>(std::in_place, tautOnly,
Flags<AngleAlg>::fromInt(algorithm), tri_);
} else if (subTagName == "struct") {
// Eep, we are getting angle structures but no parameters were
// ever specified. This was how data files looked in
// Regina 4.6 and earlier, when there were no parameters to select.
// Set up a new list containing all default values, before
// reading the first angle structure that we just bumped into.
list_ = make_packet<AngleStructures>(std::in_place, false,
AngleAlg::Legacy, tri_);
return new XMLAngleStructureReader(list_->triangulation_);
}
// If the file format is old *and* the list is empty, we could
// conceivably jump straight to a property (spansstrict, etc.),
// which means we would see them here, before the list is created.
// However, we silently ignore such properties in this case, since
// they are trivial to recreate (given that the list is empty).
}
return new XMLElementReader();
}
void XMLLegacyAngleStructuresReader::endContentSubElement(
const std::string& subTagName,
XMLElementReader* subReader) {
if (list_ && subTagName == "struct")
if (auto& s = static_cast<XMLAngleStructureReader*>(subReader)->
structure())
list_->structures_.push_back(std::move(*s));
}
void XMLLegacyAngleStructuresReader::endElement() {
// If we have an empty angle structure list and the file was saved
// in an ancient version of Regina, the XML content for the packet
// could legitimately contain no content at all - technically,
// everything in this XML element is optional.
if (! list_)
list_ = make_packet<AngleStructures>(std::in_place, false,
AngleAlg::Legacy, tri_);
XMLPacketReader::endElement();
}
} // namespace regina
|
