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
|
/**
* \file
* \brief Linear fragment function class
*
* Authors:
* Nathan Hurst <njh@mail.csse.monash.edu.au>
* Michael Sloan <mgsloan@gmail.com>
*
* Copyright (C) 2006-2007 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.
*/
#ifndef SEEN_LINEAR_H
#define SEEN_LINEAR_H
#include <2geom/interval.h>
#include <2geom/isnan.h>
//#define USE_SBASIS_OF
#ifdef USE_SBASIS_OF
#include "linear-of.h"
#else
namespace Geom{
inline double lerp(double t, double a, double b) { return a*(1-t) + b*t; }
class SBasis;
class Linear{
public:
double a[2];
Linear() {}
Linear(double aa, double b) {a[0] = aa; a[1] = b;}
Linear(double aa) {a[0] = aa; a[1] = aa;}
double operator[](const int i) const {
assert(i >= 0);
assert(i < 2);
return a[i];
}
double& operator[](const int i) {
assert(i >= 0);
assert(i < 2);
return a[i];
}
//IMPL: FragmentConcept
typedef double output_type;
inline bool isZero() const { return a[0] == 0 && a[1] == 0; }
inline bool isConstant() const { return a[0] == a[1]; }
inline bool isFinite() const { return IS_FINITE(a[0]) && IS_FINITE(a[1]); }
inline double at0() const { return a[0]; }
inline double at1() const { return a[1]; }
inline double valueAt(double t) const { return lerp(t, a[0], a[1]); }
inline double operator()(double t) const { return valueAt(t); }
//defined in sbasis.h
inline SBasis toSBasis() const;
inline OptInterval bounds_exact() const { return Interval(a[0], a[1]); }
inline OptInterval bounds_fast() const { return bounds_exact(); }
inline OptInterval bounds_local(double u, double v) const { return Interval(valueAt(u), valueAt(v)); }
double tri() const {
return a[1] - a[0];
}
double hat() const {
return (a[1] + a[0])/2;
}
};
inline Linear reverse(Linear const &a) { return Linear(a[1], a[0]); }
//IMPL: AddableConcept
inline Linear operator+(Linear const & a, Linear const & b) {
return Linear(a[0] + b[0], a[1] + b[1]);
}
inline Linear operator-(Linear const & a, Linear const & b) {
return Linear(a[0] - b[0], a[1] - b[1]);
}
inline Linear& operator+=(Linear & a, Linear const & b) {
a[0] += b[0]; a[1] += b[1];
return a;
}
inline Linear& operator-=(Linear & a, Linear const & b) {
a[0] -= b[0]; a[1] -= b[1];
return a;
}
//IMPL: OffsetableConcept
inline Linear operator+(Linear const & a, double b) {
return Linear(a[0] + b, a[1] + b);
}
inline Linear operator-(Linear const & a, double b) {
return Linear(a[0] - b, a[1] - b);
}
inline Linear& operator+=(Linear & a, double b) {
a[0] += b; a[1] += b;
return a;
}
inline Linear& operator-=(Linear & a, double b) {
a[0] -= b; a[1] -= b;
return a;
}
//IMPL: boost::EqualityComparableConcept
inline bool operator==(Linear const & a, Linear const & b) {
return a[0] == b[0] && a[1] == b[1];
}
inline bool operator!=(Linear const & a, Linear const & b) {
return a[0] != b[0] || a[1] != b[1];
}
//IMPL: ScalableConcept
inline Linear operator-(Linear const &a) {
return Linear(-a[0], -a[1]);
}
inline Linear operator*(Linear const & a, double b) {
return Linear(a[0]*b, a[1]*b);
}
inline Linear operator/(Linear const & a, double b) {
return Linear(a[0]/b, a[1]/b);
}
inline Linear operator*=(Linear & a, double b) {
a[0] *= b; a[1] *= b;
return a;
}
inline Linear operator/=(Linear & a, double b) {
a[0] /= b; a[1] /= b;
return a;
}
}
#endif
#endif //SEEN_LINEAR_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:encoding=utf-8:textwidth=99 :
|