Skip to content
Navigation Menu
{{ message }}
forked from SpaceGroupUCL/depthmapX
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtestsalaprogram.cpp
More file actions
381 lines (322 loc) · 14 KB
/
Copy pathtestsalaprogram.cpp
File metadata and controls
381 lines (322 loc) · 14 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
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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
// Copyright (C) 2017 Petros Koutsolampros
// 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 "../salalib/mapconverter.h"
#include "catch.hpp"
#include "salalib/salaprogram.h"
#include "genlib/p2dpoly.h"
#include "salalib/mgraph.h"
#include "salalib/axialmap.h"
#include <sstream>
// Most of these test cases are adapted from salalib/salascript-tests.txt
// with some added for completeness
TEST_CASE("Trivial scripts") {
std::stringstream script;
SalaObj expected;
SECTION("comment") {
script << "# comment\n";
}
SECTION("single dimension lists") {
script << "x = [1,2]\n"
<< "x[1] = 10\n"
<< "x[1]\n";
expected = SalaObj(10);
}
SECTION("multiple dimension lists") {
script << "x = [[1,2],[3,4]]\n"
<< "x[0][1] = 10\n"
<< "x[0][1]\n";
expected = SalaObj(10);
}
SECTION("range direct access") {
script << "range(5,10)[2]\n";
expected = SalaObj(7);
}
SECTION("list return length") {
script << "x = [1,2,3]\n"
<< "len(x)\n";
expected = SalaObj(3);
}
SECTION("list return list") {
script << "x = [1,2,3]\n"
<< "x\n";
expected = SalaObj(SalaObj::Type::S_LIST, 3);
expected.list_at(0) = SalaObj(1);
expected.list_at(1) = SalaObj(2);
expected.list_at(2) = SalaObj(3);
}
SECTION("2D list return length") {
script << "x = [[1,2],[3,4]]\n"
<< "len(x)\n";
expected = SalaObj(2);
}
SECTION("2D list return list") {
script << "x = [[1,2],[3,4]]\n"
<< "x\n";
expected = SalaObj(SalaObj::Type::S_LIST, 2);
expected.list_at(0) = SalaObj(SalaObj::Type::S_LIST, 2);
expected.list_at(0).list_at(0) = SalaObj(1);
expected.list_at(0).list_at(1) = SalaObj(2);
expected.list_at(1) = SalaObj(SalaObj::Type::S_LIST, 2);
expected.list_at(1).list_at(0) = SalaObj(3);
expected.list_at(1).list_at(1) = SalaObj(4);
}
SECTION("Pythonesque curios: lists by reference") {
script << "x = [1,2,3,4]\n"
<< "y = x\n"
<< "y[3] = 40\n"
<< "x[3]\n";
expected = SalaObj(40);
}
SalaGrf graph;
SalaObj context = SalaObj(SalaObj::S_POINTMAPOBJ, graph);
SalaProgram program(context);
program.parse(script);
SalaObj result = program.evaluate();
REQUIRE(result == expected);
}
TEST_CASE("Trivial errors") {
std::stringstream script;
SECTION("simple for with error: i should be uninitialised") {
script << "x = 0\n"
<< "for i in range(5,10):\n"
<< " x = 1\n"
<< "x = x + i\n";
}
SalaGrf graph;
SalaObj context = SalaObj(SalaObj::S_POINTMAPOBJ, graph);
SalaProgram program(context);
program.parse(script);
REQUIRE_THROWS_WITH(program.evaluate(), "");
}
TEST_CASE("Variables from outer scope are accessible in inner scope") {
std::stringstream script;
SalaObj expected;
SECTION("Access to global scope from within a for loop") {
script << "x = 5\n"
<< "for i in range(0,1):\n"
<< " x = 100\n"
<< "x";
expected = SalaObj(100);
}
SalaGrf graph;
SalaObj context = SalaObj(SalaObj::S_POINTMAPOBJ, graph);
SalaProgram program(context);
program.parse(script);
SalaObj result = program.evaluate();
REQUIRE(result.toInt() == expected.toInt());
}
TEST_CASE("Shapemap scripts") {
const double EPSILON = 0.001;
Point2f line1Start(0,0);
Point2f line1End (3,0);
Point2f line2Start(1,1);
Point2f line2End (1,-1);
Point2f line3Start(2,1);
Point2f line3End (2,-2);
Point2f line4Start(2,1);
Point2f line4End (4,1);
Point2f line5Start(5,3);
Point2f line5End (3,1);
std::unique_ptr<MetaGraph> metaGraph(new MetaGraph("Test SuperSpacePixel"));
metaGraph->m_drawingFiles.push_back(SpacePixelFile("Test SpacePixelGroup"));
metaGraph->m_drawingFiles.back().m_spacePixels.push_back(ShapeMap("Test ShapeMap"));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line1Start, line1End));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line2Start, line2End));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line3Start, line3End));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line4Start, line4End));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line5Start, line5End));
auto shapeGraph = MapConverter::convertDrawingToAxial(0, "Test axial", metaGraph->m_drawingFiles);
std::stringstream script;
std::vector<double> expectedColVals;
SECTION("pass ref to new column") {
script << "value(\"Ref Number\")\n";
expectedColVals.push_back(0.0);
expectedColVals.push_back(1.0);
expectedColVals.push_back(2.0);
expectedColVals.push_back(3.0);
expectedColVals.push_back(4.0);
}
SECTION("if, function of a function on a range") {
script << "x = len(range(1,value(\"Ref Number\")))\n"
<< "if x == 2:\n"
<< " return 5\n"
<< "elif x < 1:\n"
<< " return 10\n"
<< "x\n"
<< "# first two objects should be set to 10, next to 5, and then ref number after that;\n";
expectedColVals.push_back(10.0);
expectedColVals.push_back(10.0);
expectedColVals.push_back(1.0);
expectedColVals.push_back(5.0);
expectedColVals.push_back(3.0);
}
SECTION("simple if") {
script << "if value(\"Ref Number\") < 2:\n"
<< " 0\n"
<< "elif value(\"Ref Number\") == 3:\n"
<< " 5\n"
<< "else\n"
<< " 10\n";
expectedColVals.push_back(0.0);
expectedColVals.push_back(0.0);
expectedColVals.push_back(10.0);
expectedColVals.push_back(5.0);
expectedColVals.push_back(10.0);
}
SECTION("various member functions tests") {
script << "this.value(\"Ref Number\")\n"
<< " len(range(1,this.value(\"Ref Number\")))\n"
<< "elif value(\"Ref Number\") == 3:\n"
<< " range(1,this.value(\"Ref Number\")).length()\n";
expectedColVals.push_back(0.0);
expectedColVals.push_back(0.0);
expectedColVals.push_back(1.0);
expectedColVals.push_back(2.0);
expectedColVals.push_back(3.0);
}
int newCol = shapeGraph->addAttribute("NewCol");
SalaGrf graph;
graph.map.shape = shapeGraph.get();
SalaObj context = SalaObj(SalaObj::S_SHAPEMAPOBJ, graph);
SalaProgram program(context);
program.parse(script);
program.runupdate(newCol);
REQUIRE(shapeGraph->getAttributeTable().getNumRows() == expectedColVals.size());
auto iter = expectedColVals.begin();
auto &attributes = shapeGraph->getAttributeTable();
for (auto rowIter = attributes.begin(); rowIter != attributes.end(); rowIter++) {
REQUIRE(rowIter->getRow().getValue(newCol) == Approx(*iter).epsilon(EPSILON));
iter++;
}
}
TEST_CASE("Shapemap scripts with unexpected results") {
const double EPSILON = 0.001;
Point2f line1Start(0,0);
Point2f line1End (3,0);
Point2f line2Start(1,1);
Point2f line2End (1,-1);
Point2f line3Start(2,1);
Point2f line3End (2,-2);
Point2f line4Start(2,1);
Point2f line4End (4,1);
Point2f line5Start(5,3);
Point2f line5End (3,1);
std::unique_ptr<MetaGraph> metaGraph(new MetaGraph("Test SuperSpacePixel"));
metaGraph->m_drawingFiles.push_back(SpacePixelFile("Test SpacePixelGroup"));
metaGraph->m_drawingFiles.back().m_spacePixels.push_back(ShapeMap("Test ShapeMap"));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line1Start, line1End));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line2Start, line2End));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line3Start, line3End));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line4Start, line4End));
metaGraph->m_drawingFiles.back().m_spacePixels.back().makeLineShape(Line(line5Start, line5End));
auto shapeGraph = MapConverter::convertDrawingToAxial(0, "Test axial", metaGraph->m_drawingFiles);
std::stringstream script;
std::vector<double> expectedColVals;
SECTION("for with else and 0 length ranges") {
script << "int x = 0\n"
<< "for i in range(2,value(\"Ref Number\")):\n"
<< " x = x + i\n"
<< " x\n"
<< "else:\n"
<< " 0\n";
expectedColVals.push_back(0.0);
expectedColVals.push_back(0.0);
expectedColVals.push_back(0.0);
expectedColVals.push_back(2.0);
expectedColVals.push_back(5.0);
}
SECTION("Total Depth Calculation") {
script << "total_depth = 0\n"
<< "depth = 0\n"
<< "pop_list = [this]\n"
<< "push_list = []\n"
<< "setmark(true)\n"
<< "while len(pop_list):\n"
<< " total_depth = total_depth + depth\n"
<< " curs = pop_list.pop()\n"
<< " for i in curs.connections():\n"
<< " if i.mark() is none:\n"
<< " i.setmark(true)\n"
<< " push_list.append(i)\n"
<< " if len(pop_list) == 0:\n"
<< " depth = depth + 1\n"
<< " pop_list = push_list\n"
<< " push_list = []\n"
<< "total_depth\n";
expectedColVals.push_back(7.0);
expectedColVals.push_back(10.0);
expectedColVals.push_back(6.0);
expectedColVals.push_back(7.0);
expectedColVals.push_back(10.0);
}
SECTION("Shortest Cycle") {
script << "push_list = []\n"
<< "pop_list = []\n"
<< "live_paths = []\n"
<< "setmark([-1,0])\n"
<< "depth = 1\n"
<< "path_index = 0\n"
<< "for i in connections():\n"
<< " pop_list.append([path_index,i])\n"
<< " live_paths.append(1)\n"
<< " i.setmark([path_index,depth])\n"
<< " path_index = path_index + 1\n"
<< "if path_index < 2:\n"
<< " return -1 # no cycle possible\n"
<< "live_path_count = path_index\n"
<< "while len(pop_list) and live_path_count > 1:\n"
<< " curs = pop_list.pop()\n"
<< " path_index = curs[0]\n"
<< " this_node = curs[1]\n"
<< " live_paths[path_index] = live_paths[path_index] - 1\n"
<< " for i in this_node.connections():\n"
<< " if i.mark() is none:\n"
<< " i.setmark([path_index,depth+1])\n"
<< " push_list.append([path_index,i])\n"
<< " live_paths[path_index] = live_paths[path_index] + 1\n"
<< " elif i.mark()[0] != path_index and i.mark()[0] != -1:\n"
<< " # found a cycle!\n"
<< " return i.mark()[1] + this_node.mark()[1] + 1\n"
<< " if live_paths[path_index] == 0:\n"
<< " live_path_count = live_path_count - 1\n"
<< " if len(pop_list) == 0:\n"
<< " depth = depth + 1\n"
<< " pop_list = push_list\n"
<< " push_list = []\n"
<< "-1 # no cycle found\n";
expectedColVals.push_back(-1.0);
expectedColVals.push_back(-1.0);
expectedColVals.push_back(-1.0);
expectedColVals.push_back(-1.0);
expectedColVals.push_back(-1.0);
}
int newCol = shapeGraph->addAttribute("NewCol");
SalaGrf graph;
graph.map.shape = shapeGraph.get();
SalaObj context = SalaObj(SalaObj::S_SHAPEMAPOBJ, graph);
SalaProgram program(context);
program.parse(script);
program.runupdate(newCol);
REQUIRE(shapeGraph->getAttributeTable().getNumRows() == expectedColVals.size());
auto iter = expectedColVals.begin();
auto &attributes = shapeGraph->getAttributeTable();
for (auto rowIter = attributes.begin(); rowIter != attributes.end(); rowIter++) {
REQUIRE(rowIter->getRow().getValue(newCol) == Approx(*iter).epsilon(EPSILON));
iter++;
}
}
TEST_CASE("Performance tests") {
//# For a graph with 100000 segments for cpu timing:
//x=value("Angular Connectivity")*value("Angular Step Depth")+value("Axial Line Ref")+value("Connectivity")/value("Segment Length")^value("T1024 Choice R1000 metric")
//y=value("T1024 Choice R3000 metric")*value("T1024 Choice R4000 metric")/value("T1024 Choice R5000 metric")^value("T1024 Total Depth [Segment Length Wgt] R4000 metric")
//y/x
}
You can’t perform that action at this time.