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
|
/**
* \file
* \brief Template concepts used by 2Geom
*//*
* Copyright 2007 Michael Sloan <mgsloan@gmail.com>
*
* 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, output 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 LIB2GEOM_SEEN_CONCEPTS_H
#define LIB2GEOM_SEEN_CONCEPTS_H
#include <2geom/sbasis.h>
#include <2geom/interval.h>
#include <2geom/point.h>
#include <2geom/rect.h>
#include <2geom/intersection.h>
#include <vector>
#include <boost/concept/assert.hpp>
#include <2geom/forward.h>
#include <2geom/transforms.h>
namespace Geom {
//forward decls
template <typename T> struct ResultTraits;
template <> struct ResultTraits<double> {
typedef OptInterval bounds_type;
typedef SBasis sb_type;
};
template <> struct ResultTraits<Point> {
typedef OptRect bounds_type;
typedef D2<SBasis> sb_type;
};
//A concept for one-dimensional functions defined on [0,1]
template <typename T>
struct FragmentConcept {
typedef typename T::output_type OutputType;
typedef typename ResultTraits<OutputType>::bounds_type BoundsType;
typedef typename ResultTraits<OutputType>::sb_type SbType;
T t;
double d;
OutputType o;
bool b;
BoundsType i;
Interval dom;
std::vector<OutputType> v;
unsigned u;
SbType sb;
void constraints() {
t = T(o);
b = t.isZero(d);
b = t.isConstant(d);
b = t.isFinite();
o = t.at0();
o = t.at1();
t.at0() = o;
t.at1() = o;
o = t.valueAt(d);
o = t(d);
v = t.valueAndDerivatives(d, u-1);
//Is a pure derivative (ignoring others) accessor ever much faster?
//u = number of values returned. first val is value.
sb = t.toSBasis();
t = reverse(t);
i = bounds_fast(t);
i = bounds_exact(t);
i = bounds_local(t, dom);
/*With portion, Interval makes some sense, but instead I'm opting for
doubles, for the following reasons:
A) This way a reversed portion may be specified
B) Performance might be a bit better for piecewise and such
C) Interval version provided below
*/
t = portion(t, d, d);
}
};
template <typename T>
struct ShapeConcept {
typedef typename ShapeTraits<T>::TimeType Time;
typedef typename ShapeTraits<T>::IntervalType Interval;
typedef typename ShapeTraits<T>::AffineClosureType AffineClosure;
typedef typename ShapeTraits<T>::IntersectionType Isect;
T shape, other;
Time t;
Point p;
AffineClosure ac;
Affine m;
Translate tr;
Coord c;
bool bool_;
std::vector<Isect> ivec;
void constraints() {
p = shape.pointAt(t);
c = shape.valueAt(t, X);
ivec = shape.intersect(other);
t = shape.nearestTime(p);
shape *= tr;
ac = shape;
ac *= m;
bool_ = (shape == shape);
bool_ = (shape != other);
bool_ = shape.isDegenerate();
//bool_ = are_near(shape, other, c);
}
};
template <typename T>
inline T portion(const T& t, const Interval& i) { return portion(t, i.min(), i.max()); }
template <typename T>
struct EqualityComparableConcept {
T a, b;
bool bool_;
void constraints() {
bool_ = (a == b);
bool_ = (a != b);
}
};
template <typename T>
struct NearConcept {
T a, b;
double tol;
bool res;
void constraints() {
res = are_near(a, b, tol);
}
};
template <typename T>
struct OffsetableConcept {
T t;
typename T::output_type d;
void constraints() {
t = t + d; t += d;
t = t - d; t -= d;
}
};
template <typename T>
struct ScalableConcept {
T t;
typename T::output_type d;
void constraints() {
t = -t;
t = t * d; t *= d;
t = t / d; t /= d;
}
};
template <typename T>
struct AddableConcept {
T i, j;
void constraints() {
i += j; i = i + j;
i -= j; i = i - j;
}
};
template <typename T>
struct MultiplicableConcept {
T i, j;
void constraints() {
i *= j; i = i * j;
}
};
} // end namespace Geom
#endif // LIB2GEOM_SEEN_CONCEPTS_H
/*
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 :
|
