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
|
/**
* \file
* \brief callback interface for SVG path data
*//*
* Copyright 2007 MenTaLguY <mental@rydia.net>
*
* 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.
*
*/
#ifndef SEEN_SVG_PATH_H
#define SEEN_SVG_PATH_H
#include <2geom/pathvector.h>
#include <2geom/curves.h>
#include <iterator>
namespace Geom {
/** @brief Callback interface for processing path data.
*
* PathSink provides an interface that allows one to easily write
* code which processes path data, for instance when converting
* between path formats used by different graphics libraries.
*
* To store a path in a new format, implement the virtual methods
* for segments in a derived class and call path() or pathvector().
*/
class PathSink {
public:
/** Move to a different point without creating a segment.
* Usually starts a new subpath. */
virtual void moveTo(Point const &p) = 0;
/// Output a horizontal line segment. Only the X coordinate of the final point is given.
virtual void hlineTo(Coord v) = 0;
/// Output a vertical line segment. Only the Y coordinate of the final point is given.
virtual void vlineTo(Coord v) = 0;
/// Output a line segment.
virtual void lineTo(Point const &p) = 0;
/// Output a quadratic Bezier segment.
virtual void curveTo(Point const &c0, Point const &c1, Point const &p) = 0;
/// Output a cubic Bezier segment.
virtual void quadTo(Point const &c, Point const &p) = 0;
/** Output an elliptical arc segment.
* See the EllipticalArc class for the documentation of parameters. */
virtual void arcTo(double rx, double ry, double angle,
bool large_arc, bool sweep, Point const &p) = 0;
/// Close the current path with a line segment.
virtual void closePath() = 0;
/** Flush any internal state of the generator.
*
* This call should implicitly finish the current subpath.
* Calling this method should be idempotent, because the default
* implementations of path() and pathvector() will be call it
* multiple times in a row. */
virtual void flush() = 0;
/** Undo the last segment.
* This method is optional.
* @return true true if a segment was erased, false otherwise. */
virtual bool backspace() { return false; }
// these have a default implementation
/** Output a subpath.
* Calls the appropriate segment methods according to the contents
* of the passed subpath. You can override this function. */
virtual void path(Path const &p);
/** Output a path.
* Calls the appropriate segment methods according to the contents
* of the passed path. You can override this function. */
virtual void pathvector(PathVector const &v);
virtual ~PathSink() {}
};
template <typename OutputIterator>
class PathIteratorSink : public PathSink {
public:
explicit PathIteratorSink(OutputIterator out)
: _in_path(false), _out(out) {}
void moveTo(Point const &p) {
flush();
_path.start(p);
_start_p = p;
_in_path = true;
}
//TODO: what if _in_path = false?
void hlineTo(Coord v) {
// check for implicit moveto, like in: "M 1,1 L 2,2 z l 2,2 z"
if (!_in_path) {
moveTo(_start_p);
}
_path.template appendNew<HLineSegment>(Point(v, _path.finalPoint()[Y]));
}
void vlineTo(Coord v) {
// check for implicit moveto, like in: "M 1,1 L 2,2 z l 2,2 z"
if (!_in_path) {
moveTo(_start_p);
}
_path.template appendNew<VLineSegment>(Point(_path.finalPoint()[X], v));
}
void lineTo(Point const &p) {
// check for implicit moveto, like in: "M 1,1 L 2,2 z l 2,2 z"
if (!_in_path) {
moveTo(_start_p);
}
_path.template appendNew<LineSegment>(p);
}
void quadTo(Point const &c, Point const &p) {
// check for implicit moveto, like in: "M 1,1 L 2,2 z l 2,2 z"
if (!_in_path) {
moveTo(_start_p);
}
_path.template appendNew<QuadraticBezier>(c, p);
}
void curveTo(Point const &c0, Point const &c1, Point const &p) {
// check for implicit moveto, like in: "M 1,1 L 2,2 z l 2,2 z"
if (!_in_path) {
moveTo(_start_p);
}
_path.template appendNew<CubicBezier>(c0, c1, p);
}
void arcTo(double rx, double ry, double angle,
bool large_arc, bool sweep, Point const &p)
{
// check for implicit moveto, like in: "M 1,1 L 2,2 z l 2,2 z"
if (!_in_path) {
moveTo(_start_p);
}
_path.template appendNew<SVGEllipticalArc>(rx, ry, angle,
large_arc, sweep, p);
}
bool backspace()
{
if (_in_path && _path.size() > 0) {
_path.erase_last();
return true;
}
return false;
}
void append(Path const &other, Path::Stitching stitching = Path::NO_STITCHING)
{
if (!_in_path) {
moveTo(other.initialPoint());
}
_path.append(other, stitching);
}
void closePath() {
_path.close();
flush();
}
void flush() {
if (_in_path) {
_in_path = false;
*_out++ = _path;
_path.clear();
_path.close(false);
}
}
void path(Path const &other)
{
flush();
*_out++ = other;
}
protected:
bool _in_path;
OutputIterator _out;
Path _path;
Point _start_p;
};
typedef std::back_insert_iterator<std::vector<Path> > iter;
class PathBuilder : public PathIteratorSink<iter> {
private:
std::vector<Path> _pathset;
public:
PathBuilder() : PathIteratorSink<iter>(iter(_pathset)) {}
std::vector<Path> const &peek() const {return _pathset;}
};
}
#endif
/*
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 :
|
