@mlightcad/geometry-engine 3.0.2 → 3.0.4
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/package.json +3 -3
- package/dist/geometry-engine.js +0 -10702
- package/dist/geometry-engine.umd.cjs +0 -4
- package/lib/geometry/AcGeArea2d.d.ts +0 -61
- package/lib/geometry/AcGeArea2d.d.ts.map +0 -1
- package/lib/geometry/AcGeArea2d.js +0 -174
- package/lib/geometry/AcGeArea2d.js.map +0 -1
- package/lib/geometry/AcGeCatmullRomCurve3d.d.ts +0 -146
- package/lib/geometry/AcGeCatmullRomCurve3d.d.ts.map +0 -1
- package/lib/geometry/AcGeCatmullRomCurve3d.js +0 -358
- package/lib/geometry/AcGeCatmullRomCurve3d.js.map +0 -1
- package/lib/geometry/AcGeCircArc2d.d.ts +0 -132
- package/lib/geometry/AcGeCircArc2d.d.ts.map +0 -1
- package/lib/geometry/AcGeCircArc2d.js +0 -473
- package/lib/geometry/AcGeCircArc2d.js.map +0 -1
- package/lib/geometry/AcGeCircArc3d.d.ts +0 -138
- package/lib/geometry/AcGeCircArc3d.d.ts.map +0 -1
- package/lib/geometry/AcGeCircArc3d.js +0 -447
- package/lib/geometry/AcGeCircArc3d.js.map +0 -1
- package/lib/geometry/AcGeCurve2d.d.ts +0 -85
- package/lib/geometry/AcGeCurve2d.d.ts.map +0 -1
- package/lib/geometry/AcGeCurve2d.js +0 -213
- package/lib/geometry/AcGeCurve2d.js.map +0 -1
- package/lib/geometry/AcGeCurve3d.d.ts +0 -27
- package/lib/geometry/AcGeCurve3d.d.ts.map +0 -1
- package/lib/geometry/AcGeCurve3d.js +0 -29
- package/lib/geometry/AcGeCurve3d.js.map +0 -1
- package/lib/geometry/AcGeEllipseArc2d.d.ts +0 -105
- package/lib/geometry/AcGeEllipseArc2d.d.ts.map +0 -1
- package/lib/geometry/AcGeEllipseArc2d.js +0 -292
- package/lib/geometry/AcGeEllipseArc2d.js.map +0 -1
- package/lib/geometry/AcGeEllipseArc3d.d.ts +0 -142
- package/lib/geometry/AcGeEllipseArc3d.d.ts.map +0 -1
- package/lib/geometry/AcGeEllipseArc3d.js +0 -459
- package/lib/geometry/AcGeEllipseArc3d.js.map +0 -1
- package/lib/geometry/AcGeLine2d.d.ts +0 -56
- package/lib/geometry/AcGeLine2d.d.ts.map +0 -1
- package/lib/geometry/AcGeLine2d.js +0 -125
- package/lib/geometry/AcGeLine2d.js.map +0 -1
- package/lib/geometry/AcGeLine3d.d.ts +0 -134
- package/lib/geometry/AcGeLine3d.d.ts.map +0 -1
- package/lib/geometry/AcGeLine3d.js +0 -291
- package/lib/geometry/AcGeLine3d.js.map +0 -1
- package/lib/geometry/AcGeLoop2d.d.ts +0 -59
- package/lib/geometry/AcGeLoop2d.d.ts.map +0 -1
- package/lib/geometry/AcGeLoop2d.js +0 -141
- package/lib/geometry/AcGeLoop2d.js.map +0 -1
- package/lib/geometry/AcGeNurbsCurve.d.ts +0 -73
- package/lib/geometry/AcGeNurbsCurve.d.ts.map +0 -1
- package/lib/geometry/AcGeNurbsCurve.js +0 -172
- package/lib/geometry/AcGeNurbsCurve.js.map +0 -1
- package/lib/geometry/AcGePolyline2d.d.ts +0 -90
- package/lib/geometry/AcGePolyline2d.d.ts.map +0 -1
- package/lib/geometry/AcGePolyline2d.js +0 -224
- package/lib/geometry/AcGePolyline2d.js.map +0 -1
- package/lib/geometry/AcGeShape.d.ts +0 -12
- package/lib/geometry/AcGeShape.d.ts.map +0 -1
- package/lib/geometry/AcGeShape.js +0 -22
- package/lib/geometry/AcGeShape.js.map +0 -1
- package/lib/geometry/AcGeShape2d.d.ts +0 -31
- package/lib/geometry/AcGeShape2d.d.ts.map +0 -1
- package/lib/geometry/AcGeShape2d.js +0 -51
- package/lib/geometry/AcGeShape2d.js.map +0 -1
- package/lib/geometry/AcGeShape3d.d.ts +0 -33
- package/lib/geometry/AcGeShape3d.d.ts.map +0 -1
- package/lib/geometry/AcGeShape3d.js +0 -52
- package/lib/geometry/AcGeShape3d.js.map +0 -1
- package/lib/geometry/AcGeSpline3d.d.ts +0 -99
- package/lib/geometry/AcGeSpline3d.d.ts.map +0 -1
- package/lib/geometry/AcGeSpline3d.js +0 -350
- package/lib/geometry/AcGeSpline3d.js.map +0 -1
- package/lib/geometry/index.d.ts +0 -15
- package/lib/geometry/index.d.ts.map +0 -1
- package/lib/geometry/index.js +0 -15
- package/lib/geometry/index.js.map +0 -1
- package/lib/index.d.ts +0 -4
- package/lib/index.d.ts.map +0 -1
- package/lib/index.js +0 -4
- package/lib/index.js.map +0 -1
- package/lib/math/AcGeBox2d.d.ts +0 -173
- package/lib/math/AcGeBox2d.d.ts.map +0 -1
- package/lib/math/AcGeBox2d.js +0 -289
- package/lib/math/AcGeBox2d.js.map +0 -1
- package/lib/math/AcGeBox3d.d.ts +0 -195
- package/lib/math/AcGeBox3d.d.ts.map +0 -1
- package/lib/math/AcGeBox3d.js +0 -378
- package/lib/math/AcGeBox3d.js.map +0 -1
- package/lib/math/AcGeEuler.d.ts +0 -133
- package/lib/math/AcGeEuler.d.ts.map +0 -1
- package/lib/math/AcGeEuler.js +0 -358
- package/lib/math/AcGeEuler.js.map +0 -1
- package/lib/math/AcGeMatrix2d.d.ts +0 -203
- package/lib/math/AcGeMatrix2d.d.ts.map +0 -1
- package/lib/math/AcGeMatrix2d.js +0 -393
- package/lib/math/AcGeMatrix2d.js.map +0 -1
- package/lib/math/AcGeMatrix3d.d.ts +0 -279
- package/lib/math/AcGeMatrix3d.d.ts.map +0 -1
- package/lib/math/AcGeMatrix3d.js +0 -1037
- package/lib/math/AcGeMatrix3d.js.map +0 -1
- package/lib/math/AcGePlane.d.ts +0 -131
- package/lib/math/AcGePlane.d.ts.map +0 -1
- package/lib/math/AcGePlane.js +0 -218
- package/lib/math/AcGePlane.js.map +0 -1
- package/lib/math/AcGePoint.d.ts +0 -4
- package/lib/math/AcGePoint.d.ts.map +0 -1
- package/lib/math/AcGePoint.js +0 -2
- package/lib/math/AcGePoint.js.map +0 -1
- package/lib/math/AcGePoint2d.d.ts +0 -17
- package/lib/math/AcGePoint2d.d.ts.map +0 -1
- package/lib/math/AcGePoint2d.js +0 -40
- package/lib/math/AcGePoint2d.js.map +0 -1
- package/lib/math/AcGePoint3d.d.ts +0 -18
- package/lib/math/AcGePoint3d.d.ts.map +0 -1
- package/lib/math/AcGePoint3d.js +0 -43
- package/lib/math/AcGePoint3d.js.map +0 -1
- package/lib/math/AcGeQuaternion.d.ts +0 -230
- package/lib/math/AcGeQuaternion.d.ts.map +0 -1
- package/lib/math/AcGeQuaternion.js +0 -666
- package/lib/math/AcGeQuaternion.js.map +0 -1
- package/lib/math/AcGeVector.d.ts +0 -9
- package/lib/math/AcGeVector.d.ts.map +0 -1
- package/lib/math/AcGeVector.js +0 -2
- package/lib/math/AcGeVector.js.map +0 -1
- package/lib/math/AcGeVector2d.d.ts +0 -361
- package/lib/math/AcGeVector2d.d.ts.map +0 -1
- package/lib/math/AcGeVector2d.js +0 -622
- package/lib/math/AcGeVector2d.js.map +0 -1
- package/lib/math/AcGeVector3d.d.ts +0 -493
- package/lib/math/AcGeVector3d.d.ts.map +0 -1
- package/lib/math/AcGeVector3d.js +0 -868
- package/lib/math/AcGeVector3d.js.map +0 -1
- package/lib/math/index.d.ts +0 -14
- package/lib/math/index.d.ts.map +0 -1
- package/lib/math/index.js +0 -14
- package/lib/math/index.js.map +0 -1
- package/lib/util/AcGeConstants.d.ts +0 -19
- package/lib/util/AcGeConstants.d.ts.map +0 -1
- package/lib/util/AcGeConstants.js +0 -25
- package/lib/util/AcGeConstants.js.map +0 -1
- package/lib/util/AcGeGeometryUtil.d.ts +0 -16
- package/lib/util/AcGeGeometryUtil.d.ts.map +0 -1
- package/lib/util/AcGeGeometryUtil.js +0 -56
- package/lib/util/AcGeGeometryUtil.js.map +0 -1
- package/lib/util/AcGeMathUtil.d.ts +0 -203
- package/lib/util/AcGeMathUtil.d.ts.map +0 -1
- package/lib/util/AcGeMathUtil.js +0 -585
- package/lib/util/AcGeMathUtil.js.map +0 -1
- package/lib/util/AcGeNurbsUtil.d.ts +0 -34
- package/lib/util/AcGeNurbsUtil.d.ts.map +0 -1
- package/lib/util/AcGeNurbsUtil.js +0 -218
- package/lib/util/AcGeNurbsUtil.js.map +0 -1
- package/lib/util/AcGeTol.d.ts +0 -91
- package/lib/util/AcGeTol.d.ts.map +0 -1
- package/lib/util/AcGeTol.js +0 -83
- package/lib/util/AcGeTol.js.map +0 -1
- package/lib/util/index.d.ts +0 -6
- package/lib/util/index.d.ts.map +0 -1
- package/lib/util/index.js +0 -6
- package/lib/util/index.js.map +0 -1
|
@@ -1,218 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* NURBS utility functions for spline calculations
|
|
3
|
-
*/
|
|
4
|
-
var __read = (this && this.__read) || function (o, n) {
|
|
5
|
-
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
|
6
|
-
if (!m) return o;
|
|
7
|
-
var i = m.call(o), r, ar = [], e;
|
|
8
|
-
try {
|
|
9
|
-
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
|
10
|
-
}
|
|
11
|
-
catch (error) { e = { error: error }; }
|
|
12
|
-
finally {
|
|
13
|
-
try {
|
|
14
|
-
if (r && !r.done && (m = i["return"])) m.call(i);
|
|
15
|
-
}
|
|
16
|
-
finally { if (e) throw e.error; }
|
|
17
|
-
}
|
|
18
|
-
return ar;
|
|
19
|
-
};
|
|
20
|
-
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
|
|
21
|
-
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
|
22
|
-
if (ar || !(i in from)) {
|
|
23
|
-
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
|
24
|
-
ar[i] = from[i];
|
|
25
|
-
}
|
|
26
|
-
}
|
|
27
|
-
return to.concat(ar || Array.prototype.slice.call(from));
|
|
28
|
-
};
|
|
29
|
-
/**
|
|
30
|
-
* Generate uniform knot vector
|
|
31
|
-
*/
|
|
32
|
-
export function generateUniformKnots(degree, numControlPoints) {
|
|
33
|
-
var knots = [];
|
|
34
|
-
var n = numControlPoints - 1;
|
|
35
|
-
var p = degree;
|
|
36
|
-
// First p+1 knots are 0
|
|
37
|
-
for (var i = 0; i <= p; i++) {
|
|
38
|
-
knots.push(0);
|
|
39
|
-
}
|
|
40
|
-
// Middle knots are uniform
|
|
41
|
-
for (var i = 1; i <= n - p; i++) {
|
|
42
|
-
knots.push(i);
|
|
43
|
-
}
|
|
44
|
-
// Last p+1 knots are n-p+1
|
|
45
|
-
for (var i = 0; i <= p; i++) {
|
|
46
|
-
knots.push(n - p + 1);
|
|
47
|
-
}
|
|
48
|
-
return knots;
|
|
49
|
-
}
|
|
50
|
-
/**
|
|
51
|
-
* Generate chord-length parameterized knots
|
|
52
|
-
*/
|
|
53
|
-
export function generateChordKnots(degree, points) {
|
|
54
|
-
var n = points.length - 1;
|
|
55
|
-
var p = degree;
|
|
56
|
-
// Calculate chord lengths
|
|
57
|
-
var chordLengths = [0];
|
|
58
|
-
var totalLength = 0;
|
|
59
|
-
for (var i = 1; i <= n; i++) {
|
|
60
|
-
var dx = points[i][0] - points[i - 1][0];
|
|
61
|
-
var dy = points[i][1] - points[i - 1][1];
|
|
62
|
-
var dz = points[i][2] - points[i - 1][2];
|
|
63
|
-
var length_1 = Math.sqrt(dx * dx + dy * dy + dz * dz);
|
|
64
|
-
totalLength += length_1;
|
|
65
|
-
chordLengths.push(totalLength);
|
|
66
|
-
}
|
|
67
|
-
// Generate knots based on chord lengths
|
|
68
|
-
var knots = [];
|
|
69
|
-
// First p+1 knots are 0
|
|
70
|
-
for (var i = 0; i <= p; i++) {
|
|
71
|
-
knots.push(0);
|
|
72
|
-
}
|
|
73
|
-
// Middle knots based on chord lengths
|
|
74
|
-
for (var i = 1; i <= n - p; i++) {
|
|
75
|
-
var t = chordLengths[i] / totalLength;
|
|
76
|
-
knots.push(t * (n - p + 1));
|
|
77
|
-
}
|
|
78
|
-
// Last p+1 knots are n-p+1
|
|
79
|
-
for (var i = 0; i <= p; i++) {
|
|
80
|
-
knots.push(n - p + 1);
|
|
81
|
-
}
|
|
82
|
-
return knots;
|
|
83
|
-
}
|
|
84
|
-
/**
|
|
85
|
-
* Generate sqrt-chord parameterized knots
|
|
86
|
-
*/
|
|
87
|
-
export function generateSqrtChordKnots(degree, points) {
|
|
88
|
-
var n = points.length - 1;
|
|
89
|
-
var p = degree;
|
|
90
|
-
// Calculate sqrt chord lengths
|
|
91
|
-
var sqrtChordLengths = [0];
|
|
92
|
-
var totalSqrtLength = 0;
|
|
93
|
-
for (var i = 1; i <= n; i++) {
|
|
94
|
-
var dx = points[i][0] - points[i - 1][0];
|
|
95
|
-
var dy = points[i][1] - points[i - 1][1];
|
|
96
|
-
var dz = points[i][2] - points[i - 1][2];
|
|
97
|
-
var length_2 = Math.sqrt(dx * dx + dy * dy + dz * dz);
|
|
98
|
-
var sqrtLength = Math.sqrt(length_2);
|
|
99
|
-
totalSqrtLength += sqrtLength;
|
|
100
|
-
sqrtChordLengths.push(totalSqrtLength);
|
|
101
|
-
}
|
|
102
|
-
// Generate knots based on sqrt chord lengths
|
|
103
|
-
var knots = [];
|
|
104
|
-
// First p+1 knots are 0
|
|
105
|
-
for (var i = 0; i <= p; i++) {
|
|
106
|
-
knots.push(0);
|
|
107
|
-
}
|
|
108
|
-
// Middle knots based on sqrt chord lengths
|
|
109
|
-
for (var i = 1; i <= n - p; i++) {
|
|
110
|
-
var t = sqrtChordLengths[i] / totalSqrtLength;
|
|
111
|
-
knots.push(t * (n - p + 1));
|
|
112
|
-
}
|
|
113
|
-
// Last p+1 knots are n-p+1
|
|
114
|
-
for (var i = 0; i <= p; i++) {
|
|
115
|
-
knots.push(n - p + 1);
|
|
116
|
-
}
|
|
117
|
-
return knots;
|
|
118
|
-
}
|
|
119
|
-
/**
|
|
120
|
-
* Calculate basis function value for NURBS
|
|
121
|
-
*/
|
|
122
|
-
export function basisFunction(i, k, u, knots) {
|
|
123
|
-
if (k === 0) {
|
|
124
|
-
return u >= knots[i] && u < knots[i + 1] ? 1.0 : 0.0;
|
|
125
|
-
}
|
|
126
|
-
var d1 = knots[i + k] - knots[i];
|
|
127
|
-
var d2 = knots[i + k + 1] - knots[i + 1];
|
|
128
|
-
var c1 = d1 > 1e-10 ? (u - knots[i]) / d1 : 0.0;
|
|
129
|
-
var c2 = d2 > 1e-10 ? (knots[i + k + 1] - u) / d2 : 0.0;
|
|
130
|
-
return (c1 * basisFunction(i, k - 1, u, knots) +
|
|
131
|
-
c2 * basisFunction(i + 1, k - 1, u, knots));
|
|
132
|
-
}
|
|
133
|
-
/**
|
|
134
|
-
* Calculate point on NURBS curve
|
|
135
|
-
*/
|
|
136
|
-
export function evaluateNurbsPoint(u, degree, knots, controlPoints, weights) {
|
|
137
|
-
var n = controlPoints.length - 1;
|
|
138
|
-
var p = degree;
|
|
139
|
-
// Clamp parameter to valid range
|
|
140
|
-
u = Math.max(knots[p], Math.min(knots[n + 1], u));
|
|
141
|
-
// If u is very close to the end, return the last control point
|
|
142
|
-
if (Math.abs(u - knots[n + 1]) < 1e-8) {
|
|
143
|
-
return __spreadArray([], __read(controlPoints[n]), false);
|
|
144
|
-
}
|
|
145
|
-
// If u is very close to the start, return the first control point
|
|
146
|
-
if (Math.abs(u - knots[p]) < 1e-8) {
|
|
147
|
-
return __spreadArray([], __read(controlPoints[0]), false);
|
|
148
|
-
}
|
|
149
|
-
var point = [0, 0, 0];
|
|
150
|
-
var weight = 0;
|
|
151
|
-
for (var i = 0; i <= n; i++) {
|
|
152
|
-
var basis = basisFunction(i, p, u, knots);
|
|
153
|
-
var w = weights[i] * basis;
|
|
154
|
-
point[0] += controlPoints[i][0] * w;
|
|
155
|
-
point[1] += controlPoints[i][1] * w;
|
|
156
|
-
point[2] += controlPoints[i][2] * w;
|
|
157
|
-
weight += w;
|
|
158
|
-
}
|
|
159
|
-
// If weight is very small (all basis functions are zero),
|
|
160
|
-
// check if we're at the end and return the last control point
|
|
161
|
-
if (weight < 1e-10) {
|
|
162
|
-
// Check if we're at the end of the domain
|
|
163
|
-
var endParam = knots[knots.length - p - 1];
|
|
164
|
-
if (Math.abs(u - endParam) < 1e-8) {
|
|
165
|
-
return __spreadArray([], __read(controlPoints[n]), false);
|
|
166
|
-
}
|
|
167
|
-
// Check if we're at the start of the domain
|
|
168
|
-
if (Math.abs(u - knots[p]) < 1e-8) {
|
|
169
|
-
return __spreadArray([], __read(controlPoints[0]), false);
|
|
170
|
-
}
|
|
171
|
-
}
|
|
172
|
-
if (weight > 1e-10) {
|
|
173
|
-
point[0] /= weight;
|
|
174
|
-
point[1] /= weight;
|
|
175
|
-
point[2] /= weight;
|
|
176
|
-
}
|
|
177
|
-
return point;
|
|
178
|
-
}
|
|
179
|
-
/**
|
|
180
|
-
* Calculate curve length using numerical integration
|
|
181
|
-
*/
|
|
182
|
-
export function calculateCurveLength(degree, knots, controlPoints, weights) {
|
|
183
|
-
var p = degree;
|
|
184
|
-
var startParam = knots[p];
|
|
185
|
-
var endParam = knots[knots.length - p - 1];
|
|
186
|
-
var length = 0;
|
|
187
|
-
var steps = 1000;
|
|
188
|
-
var step = (endParam - startParam) / steps;
|
|
189
|
-
var prevPoint = evaluateNurbsPoint(startParam, degree, knots, controlPoints, weights);
|
|
190
|
-
for (var i = 1; i <= steps; i++) {
|
|
191
|
-
var u = startParam + i * step;
|
|
192
|
-
var point = evaluateNurbsPoint(u, degree, knots, controlPoints, weights);
|
|
193
|
-
var dx_1 = point[0] - prevPoint[0];
|
|
194
|
-
var dy_1 = point[1] - prevPoint[1];
|
|
195
|
-
var dz_1 = point[2] - prevPoint[2];
|
|
196
|
-
length += Math.sqrt(dx_1 * dx_1 + dy_1 * dy_1 + dz_1 * dz_1);
|
|
197
|
-
prevPoint = point;
|
|
198
|
-
}
|
|
199
|
-
// Add the final segment to the end point
|
|
200
|
-
var finalPoint = evaluateNurbsPoint(endParam, degree, knots, controlPoints, weights);
|
|
201
|
-
var dx = finalPoint[0] - prevPoint[0];
|
|
202
|
-
var dy = finalPoint[1] - prevPoint[1];
|
|
203
|
-
var dz = finalPoint[2] - prevPoint[2];
|
|
204
|
-
length += Math.sqrt(dx * dx + dy * dy + dz * dz);
|
|
205
|
-
return length;
|
|
206
|
-
}
|
|
207
|
-
/**
|
|
208
|
-
* Generate control points from fit points using interpolation
|
|
209
|
-
* This is a simplified implementation - for production use, you might want
|
|
210
|
-
* to implement a more sophisticated interpolation algorithm
|
|
211
|
-
*/
|
|
212
|
-
export function interpolateControlPoints(fitPoints) {
|
|
213
|
-
// For now, use fit points as control points
|
|
214
|
-
// In a full implementation, you would solve the interpolation system
|
|
215
|
-
// by setting up and solving a linear system of equations
|
|
216
|
-
return fitPoints.map(function (p) { return __spreadArray([], __read(p), false); });
|
|
217
|
-
}
|
|
218
|
-
//# sourceMappingURL=AcGeNurbsUtil.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"AcGeNurbsUtil.js","sourceRoot":"","sources":["../../src/util/AcGeNurbsUtil.ts"],"names":[],"mappings":"AAAA;;GAEG;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAc,EACd,gBAAwB;IAExB,IAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAM,CAAC,GAAG,gBAAgB,GAAG,CAAC,CAAA;IAC9B,IAAM,CAAC,GAAG,MAAM,CAAA;IAEhB,wBAAwB;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,2BAA2B;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,2BAA2B;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IACvB,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAc,EACd,MAAkB;IAElB,IAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;IAC3B,IAAM,CAAC,GAAG,MAAM,CAAA;IAEhB,0BAA0B;IAC1B,IAAM,YAAY,GAAa,CAAC,CAAC,CAAC,CAAA;IAClC,IAAI,WAAW,GAAG,CAAC,CAAA;IAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1C,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1C,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1C,IAAM,QAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;QACrD,WAAW,IAAI,QAAM,CAAA;QACrB,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;IAChC,CAAC;IAED,wCAAwC;IACxC,IAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,wBAAwB;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,sCAAsC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,WAAW,CAAA;QACvC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC7B,CAAC;IAED,2BAA2B;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IACvB,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAc,EACd,MAAkB;IAElB,IAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;IAC3B,IAAM,CAAC,GAAG,MAAM,CAAA;IAEhB,+BAA+B;IAC/B,IAAM,gBAAgB,GAAa,CAAC,CAAC,CAAC,CAAA;IACtC,IAAI,eAAe,GAAG,CAAC,CAAA;IAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1C,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1C,IAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1C,IAAM,QAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;QACrD,IAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAM,CAAC,CAAA;QACpC,eAAe,IAAI,UAAU,CAAA;QAC7B,gBAAgB,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;IACxC,CAAC;IAED,6CAA6C;IAC7C,IAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,wBAAwB;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,2CAA2C;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAM,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,eAAe,CAAA;QAC/C,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC7B,CAAC;IAED,2BAA2B;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IACvB,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAC3B,CAAS,EACT,CAAS,EACT,CAAS,EACT,KAAe;IAEf,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAA;IACtD,CAAC;IAED,IAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IAClC,IAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAE1C,IAAM,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA;IACjD,IAAM,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA;IAEzD,OAAO,CACL,EAAE,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;QACtC,EAAE,GAAG,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAC3C,CAAA;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,CAAS,EACT,MAAc,EACd,KAAe,EACf,aAAyB,EACzB,OAAiB;IAEjB,IAAM,CAAC,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,CAAA;IAClC,IAAM,CAAC,GAAG,MAAM,CAAA;IAEhB,iCAAiC;IACjC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAEjD,+DAA+D;IAC/D,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;QACtC,gCAAW,aAAa,CAAC,CAAC,CAAC,UAAC;IAC9B,CAAC;IAED,kEAAkE;IAClE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;QAClC,gCAAW,aAAa,CAAC,CAAC,CAAC,UAAC;IAC9B,CAAC;IAED,IAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACvB,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAM,KAAK,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;QAC3C,IAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;QAE5B,KAAK,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACnC,KAAK,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACnC,KAAK,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACnC,MAAM,IAAI,CAAC,CAAA;IACb,CAAC;IAED,0DAA0D;IAC1D,8DAA8D;IAC9D,IAAI,MAAM,GAAG,KAAK,EAAE,CAAC;QACnB,0CAA0C;QAC1C,IAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC5C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,IAAI,EAAE,CAAC;YAClC,gCAAW,aAAa,CAAC,CAAC,CAAC,UAAC;QAC9B,CAAC;QACD,4CAA4C;QAC5C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;YAClC,gCAAW,aAAa,CAAC,CAAC,CAAC,UAAC;QAC9B,CAAC;IACH,CAAC;IAED,IAAI,MAAM,GAAG,KAAK,EAAE,CAAC;QACnB,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;QAClB,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;QAClB,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAA;IACpB,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAc,EACd,KAAe,EACf,aAAyB,EACzB,OAAiB;IAEjB,IAAM,CAAC,GAAG,MAAM,CAAA;IAChB,IAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;IAC3B,IAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IAE5C,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,IAAM,KAAK,GAAG,IAAI,CAAA;IAClB,IAAM,IAAI,GAAG,CAAC,QAAQ,GAAG,UAAU,CAAC,GAAG,KAAK,CAAA;IAE5C,IAAI,SAAS,GAAG,kBAAkB,CAChC,UAAU,EACV,MAAM,EACN,KAAK,EACL,aAAa,EACb,OAAO,CACR,CAAA;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAM,CAAC,GAAG,UAAU,GAAG,CAAC,GAAG,IAAI,CAAA;QAC/B,IAAM,KAAK,GAAG,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,OAAO,CAAC,CAAA;QAE1E,IAAM,IAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;QAClC,IAAM,IAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;QAClC,IAAM,IAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;QAElC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAE,GAAG,IAAE,GAAG,IAAE,GAAG,IAAE,GAAG,IAAE,GAAG,IAAE,CAAC,CAAA;QAChD,SAAS,GAAG,KAAK,CAAA;IACnB,CAAC;IAED,yCAAyC;IACzC,IAAM,UAAU,GAAG,kBAAkB,CACnC,QAAQ,EACR,MAAM,EACN,KAAK,EACL,aAAa,EACb,OAAO,CACR,CAAA;IACD,IAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IACvC,IAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IACvC,IAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IACvC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;IAEhD,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CAAC,SAAqB;IAC5D,4CAA4C;IAC5C,qEAAqE;IACrE,yDAAyD;IACzD,OAAO,SAAS,CAAC,GAAG,CAAC,UAAA,CAAC,IAAI,gCAAI,CAAC,WAAL,CAAM,CAAC,CAAA;AACnC,CAAC"}
|
package/lib/util/AcGeTol.d.ts
DELETED
|
@@ -1,91 +0,0 @@
|
|
|
1
|
-
import { AcGePoint2dLike, AcGePoint3dLike } from '../math';
|
|
2
|
-
/**
|
|
3
|
-
* The class used to store some tolerance values.
|
|
4
|
-
*/
|
|
5
|
-
export declare class AcGeTol {
|
|
6
|
-
/**
|
|
7
|
-
* Tolerance value to check whether two points are equal. Two points, p1 and p2, are equal if
|
|
8
|
-
* <pre>
|
|
9
|
-
* (p1 - p2).length() <= equalPointTol
|
|
10
|
-
* </pre
|
|
11
|
-
*/
|
|
12
|
-
equalPointTol: number;
|
|
13
|
-
/**
|
|
14
|
-
* Tolerance value to compare two vectors.
|
|
15
|
-
*
|
|
16
|
-
* 1. Two vectors, v1 and v2, are equal if
|
|
17
|
-
* <pre>
|
|
18
|
-
* (p1 - p2).length() <= equalPoint
|
|
19
|
-
* </pre>
|
|
20
|
-
*
|
|
21
|
-
* 2. Two vectors, v1 and v2, are parallel if
|
|
22
|
-
* <pre>
|
|
23
|
-
* (v1/v1.length() - v2/v2.length() ).length() < equalVectorTol
|
|
24
|
-
* </pre>
|
|
25
|
-
* 或
|
|
26
|
-
* <pre>
|
|
27
|
-
* (v1/v1.length() + v2/v2.length() ).length() < equalVectorTol
|
|
28
|
-
* </pre>
|
|
29
|
-
*
|
|
30
|
-
* 3. Two vectors, v1 and v2, are perpendicular if
|
|
31
|
-
* <pre>
|
|
32
|
-
* abs((v1.dotProduct(v2))/(v1.length()*v2.length())) <= equalVectorTol
|
|
33
|
-
* </pre>
|
|
34
|
-
*/
|
|
35
|
-
equalVectorTol: number;
|
|
36
|
-
/**
|
|
37
|
-
* Create tolerance class with default tolerance values
|
|
38
|
-
*/
|
|
39
|
-
constructor();
|
|
40
|
-
/**
|
|
41
|
-
* Return true if two points are equal with the specified tolerance.
|
|
42
|
-
* @param p1 Input the first 2d point
|
|
43
|
-
* @param p2 Input the second 2d point
|
|
44
|
-
* @returns Return true if two poitns are equal with the specified tolerance.
|
|
45
|
-
*/
|
|
46
|
-
equalPoint2d(p1: AcGePoint2dLike, p2: AcGePoint2dLike): boolean;
|
|
47
|
-
/**
|
|
48
|
-
* Return true if two points are equal with the specified tolerance.
|
|
49
|
-
* @param p1 Input the first 2d point
|
|
50
|
-
* @param p2 Input the second 2d point
|
|
51
|
-
* @returns Return true if two poitns are equal with the specified tolerance.
|
|
52
|
-
*/
|
|
53
|
-
equalPoint3d(p1: AcGePoint3dLike, p2: AcGePoint3dLike): boolean;
|
|
54
|
-
/**
|
|
55
|
-
* Return true if the value is equal to zero with the specified tolerance.
|
|
56
|
-
*/
|
|
57
|
-
static equalToZero(x: number, tol?: number): boolean;
|
|
58
|
-
/**
|
|
59
|
-
* Return true if two values are equal with the sepcified tolerance.
|
|
60
|
-
*
|
|
61
|
-
* @param value1 Input the first value
|
|
62
|
-
* @param value2 Input the second value
|
|
63
|
-
* @param tol Input the tolerance value
|
|
64
|
-
* @returns Return true if two values are equal with the sepcified tolerance
|
|
65
|
-
*/
|
|
66
|
-
static equal(value1: number, value2: number, tol?: number): boolean;
|
|
67
|
-
/**
|
|
68
|
-
* Return true if the first argument are greater than the second argument with the sepcified
|
|
69
|
-
* tolerance.
|
|
70
|
-
*
|
|
71
|
-
* @param value1 Input the first value
|
|
72
|
-
* @param value2 Input the second value
|
|
73
|
-
* @param tol Input the tolerance value
|
|
74
|
-
* @returns Return true if the first argument are greater than the second argument with the
|
|
75
|
-
* sepcified tolerance.
|
|
76
|
-
*/
|
|
77
|
-
static great(value1: number, value2: number, tol?: number): boolean;
|
|
78
|
-
/**
|
|
79
|
-
* Return true if the first argument less than the second argument with the specified tolerance
|
|
80
|
-
* value
|
|
81
|
-
*
|
|
82
|
-
* @param value1 Input the first value
|
|
83
|
-
* @param value2 Input the second value
|
|
84
|
-
* @param tol Input the tolerance value
|
|
85
|
-
* @returns Return *true* if the first argument less than the second argument with the specified
|
|
86
|
-
* tolerance value
|
|
87
|
-
*/
|
|
88
|
-
static less(value1: number, value2: number, tol?: number): boolean;
|
|
89
|
-
}
|
|
90
|
-
export declare const DEFAULT_TOL: AcGeTol;
|
|
91
|
-
//# sourceMappingURL=AcGeTol.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"AcGeTol.d.ts","sourceRoot":"","sources":["../../src/util/AcGeTol.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,EACf,eAAe,EAGhB,MAAM,SAAS,CAAA;AAGhB;;GAEG;AACH,qBAAa,OAAO;IAClB;;;;;OAKG;IACH,aAAa,EAAE,MAAM,CAAA;IACrB;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,cAAc,EAAE,MAAM,CAAA;IAEtB;;OAEG;;IAMH;;;;;OAKG;IACH,YAAY,CAAC,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,eAAe;IAIrD;;;;;OAKG;IACH,YAAY,CAAC,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,eAAe;IAIrD;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB;IAIrD;;;;;;;OAOG;IACH,MAAM,CAAC,KAAK,CACV,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,GAAG,GAAE,MAAkB,GACtB,OAAO;IAIV;;;;;;;;;OASG;IACH,MAAM,CAAC,KAAK,CACV,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,GAAG,GAAE,MAAkB,GACtB,OAAO;IAIV;;;;;;;;;OASG;IACH,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,GAAE,MAAkB;CAGpE;AAED,eAAO,MAAM,WAAW,SAAgB,CAAA"}
|
package/lib/util/AcGeTol.js
DELETED
|
@@ -1,83 +0,0 @@
|
|
|
1
|
-
import { AcGeVector2d, AcGeVector3d } from '../math';
|
|
2
|
-
import { FLOAT_TOL } from './AcGeConstants';
|
|
3
|
-
/**
|
|
4
|
-
* The class used to store some tolerance values.
|
|
5
|
-
*/
|
|
6
|
-
var AcGeTol = /** @class */ (function () {
|
|
7
|
-
/**
|
|
8
|
-
* Create tolerance class with default tolerance values
|
|
9
|
-
*/
|
|
10
|
-
function AcGeTol() {
|
|
11
|
-
this.equalPointTol = FLOAT_TOL;
|
|
12
|
-
this.equalVectorTol = FLOAT_TOL;
|
|
13
|
-
}
|
|
14
|
-
/**
|
|
15
|
-
* Return true if two points are equal with the specified tolerance.
|
|
16
|
-
* @param p1 Input the first 2d point
|
|
17
|
-
* @param p2 Input the second 2d point
|
|
18
|
-
* @returns Return true if two poitns are equal with the specified tolerance.
|
|
19
|
-
*/
|
|
20
|
-
AcGeTol.prototype.equalPoint2d = function (p1, p2) {
|
|
21
|
-
return new AcGeVector2d(p1).sub(p2).length() < this.equalPointTol;
|
|
22
|
-
};
|
|
23
|
-
/**
|
|
24
|
-
* Return true if two points are equal with the specified tolerance.
|
|
25
|
-
* @param p1 Input the first 2d point
|
|
26
|
-
* @param p2 Input the second 2d point
|
|
27
|
-
* @returns Return true if two poitns are equal with the specified tolerance.
|
|
28
|
-
*/
|
|
29
|
-
AcGeTol.prototype.equalPoint3d = function (p1, p2) {
|
|
30
|
-
return new AcGeVector3d(p1).sub(p2).length() < this.equalPointTol;
|
|
31
|
-
};
|
|
32
|
-
/**
|
|
33
|
-
* Return true if the value is equal to zero with the specified tolerance.
|
|
34
|
-
*/
|
|
35
|
-
AcGeTol.equalToZero = function (x, tol) {
|
|
36
|
-
if (tol === void 0) { tol = FLOAT_TOL; }
|
|
37
|
-
return x < tol && x > -tol;
|
|
38
|
-
};
|
|
39
|
-
/**
|
|
40
|
-
* Return true if two values are equal with the sepcified tolerance.
|
|
41
|
-
*
|
|
42
|
-
* @param value1 Input the first value
|
|
43
|
-
* @param value2 Input the second value
|
|
44
|
-
* @param tol Input the tolerance value
|
|
45
|
-
* @returns Return true if two values are equal with the sepcified tolerance
|
|
46
|
-
*/
|
|
47
|
-
AcGeTol.equal = function (value1, value2, tol) {
|
|
48
|
-
if (tol === void 0) { tol = FLOAT_TOL; }
|
|
49
|
-
return Math.abs(value1 - value2) < tol;
|
|
50
|
-
};
|
|
51
|
-
/**
|
|
52
|
-
* Return true if the first argument are greater than the second argument with the sepcified
|
|
53
|
-
* tolerance.
|
|
54
|
-
*
|
|
55
|
-
* @param value1 Input the first value
|
|
56
|
-
* @param value2 Input the second value
|
|
57
|
-
* @param tol Input the tolerance value
|
|
58
|
-
* @returns Return true if the first argument are greater than the second argument with the
|
|
59
|
-
* sepcified tolerance.
|
|
60
|
-
*/
|
|
61
|
-
AcGeTol.great = function (value1, value2, tol) {
|
|
62
|
-
if (tol === void 0) { tol = FLOAT_TOL; }
|
|
63
|
-
return value1 - value2 > tol;
|
|
64
|
-
};
|
|
65
|
-
/**
|
|
66
|
-
* Return true if the first argument less than the second argument with the specified tolerance
|
|
67
|
-
* value
|
|
68
|
-
*
|
|
69
|
-
* @param value1 Input the first value
|
|
70
|
-
* @param value2 Input the second value
|
|
71
|
-
* @param tol Input the tolerance value
|
|
72
|
-
* @returns Return *true* if the first argument less than the second argument with the specified
|
|
73
|
-
* tolerance value
|
|
74
|
-
*/
|
|
75
|
-
AcGeTol.less = function (value1, value2, tol) {
|
|
76
|
-
if (tol === void 0) { tol = FLOAT_TOL; }
|
|
77
|
-
return value1 - value2 < tol;
|
|
78
|
-
};
|
|
79
|
-
return AcGeTol;
|
|
80
|
-
}());
|
|
81
|
-
export { AcGeTol };
|
|
82
|
-
export var DEFAULT_TOL = new AcGeTol();
|
|
83
|
-
//# sourceMappingURL=AcGeTol.js.map
|
package/lib/util/AcGeTol.js.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"AcGeTol.js","sourceRoot":"","sources":["../../src/util/AcGeTol.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,YAAY,EACZ,YAAY,EACb,MAAM,SAAS,CAAA;AAChB,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAA;AAE3C;;GAEG;AACH;IAgCE;;OAEG;IACH;QACE,IAAI,CAAC,aAAa,GAAG,SAAS,CAAA;QAC9B,IAAI,CAAC,cAAc,GAAG,SAAS,CAAA;IACjC,CAAC;IAED;;;;;OAKG;IACH,8BAAY,GAAZ,UAAa,EAAmB,EAAE,EAAmB;QACnD,OAAO,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAA;IACnE,CAAC;IAED;;;;;OAKG;IACH,8BAAY,GAAZ,UAAa,EAAmB,EAAE,EAAmB;QACnD,OAAO,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAA;IACnE,CAAC;IAED;;OAEG;IACI,mBAAW,GAAlB,UAAmB,CAAS,EAAE,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QACnD,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAA;IAC5B,CAAC;IAED;;;;;;;OAOG;IACI,aAAK,GAAZ,UACE,MAAc,EACd,MAAc,EACd,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QAEvB,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,GAAG,CAAA;IACxC,CAAC;IAED;;;;;;;;;OASG;IACI,aAAK,GAAZ,UACE,MAAc,EACd,MAAc,EACd,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QAEvB,OAAO,MAAM,GAAG,MAAM,GAAG,GAAG,CAAA;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACI,YAAI,GAAX,UAAY,MAAc,EAAE,MAAc,EAAE,GAAuB;QAAvB,oBAAA,EAAA,eAAuB;QACjE,OAAO,MAAM,GAAG,MAAM,GAAG,GAAG,CAAA;IAC9B,CAAC;IACH,cAAC;AAAD,CAAC,AAlHD,IAkHC;;AAED,MAAM,CAAC,IAAM,WAAW,GAAG,IAAI,OAAO,EAAE,CAAA"}
|
package/lib/util/index.d.ts
DELETED
package/lib/util/index.d.ts.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAA;AAC/B,cAAc,oBAAoB,CAAA;AAClC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,iBAAiB,CAAA;AAC/B,cAAc,WAAW,CAAA"}
|
package/lib/util/index.js
DELETED
package/lib/util/index.js.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/util/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAA;AAC/B,cAAc,oBAAoB,CAAA;AAClC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,iBAAiB,CAAA;AAC/B,cAAc,WAAW,CAAA"}
|