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
|
/**
* \file
* \brief Performance test for Boolops
*//*
* Authors:
* Krzysztof Kosiński <tweenk.pl@gmail.com>
*
* Copyright 2015 Authors
*
* This library is free software; you can redistribute it and/or
* modify it either under the terms of the GNU Lesser General Public
* License version 2.1 as published by the Free Software Foundation
* (the "LGPL") or, at your option, under the terms of the Mozilla
* Public License Version 1.1 (the "MPL"). If you do not alter this
* notice, a recipient may use your version of this file under either
* the MPL or the LGPL.
*
* You should have received a copy of the LGPL along with this library
* in the file COPYING-LGPL-2.1; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
* You should have received a copy of the MPL along with this library
* in the file COPYING-MPL-1.1
*
* The contents of this file are subject to the Mozilla Public License
* Version 1.1 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY
* OF ANY KIND, either express or implied. See the LGPL or the MPL for
* the specific language governing rights and limitations.
*/
#include <2geom/intersection-graph.h>
#include <2geom/svg-path-parser.h>
#include <iostream>
#include <glib.h>
using namespace Geom;
int main(int argc, char **argv)
{
if (argc != 4) {
std::cout << "boolops: wrong number of arguments; no tests run!" << std::endl;
exit(0); // TODO: add suitable arguments in CMake target / actually do some tests here
}
PathVector a = read_svgd(argv[2]);
PathVector b = read_svgd(argv[3]);
unsigned const ops = atoi(argv[1]);
OptRect abox = a.boundsExact();
OptRect bbox = a.boundsExact();
if (!abox) {
std::cout << argv[1] << " contains an empty path" << std::endl;
std::exit(1);
}
if (!bbox) {
std::cout << argv[2] << " contains an empty path" << std::endl;
std::exit(1);
}
a *= Translate(-abox->corner(0));
b *= Translate(-bbox->corner(0));
long num_intersections = 0;
long num_outcv = 0;
// for reproducibility.
g_random_set_seed(1234);
for (unsigned i = 0; i < ops; ++i) {
Point delta;
delta[X] = g_random_double_range(-bbox->width(), abox->width());
delta[Y] = g_random_double_range(-bbox->height(), abox->height());
PathVector bt = b * Translate(delta);
PathIntersectionGraph pig(a, bt);
PathVector x = pig.getIntersection();
num_intersections += pig.intersectionPoints().size();
num_outcv += x.curveCount();
}
std::cout << "Completed " << ops << " operations.\n"
<< "Total intersections: " << num_intersections << "\n"
<< "Total output curves: " << num_outcv << std::endl;
return 0;
}
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:fileencoding=utf-8:textwidth=99 :
|
