paperjs-offset 1.0.7 → 2.0.0
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/LICENSE +2 -2
- package/README.md +683 -41
- package/dist/index.cjs +769 -0
- package/dist/index.cjs.map +1 -0
- package/dist/index.mjs +760 -0
- package/dist/index.mjs.map +1 -0
- package/dist/index.umd.js +773 -392
- package/dist/index.umd.js.map +1 -1
- package/dist/index.umd.min.js +1 -0
- package/dist/types/index.d.ts +22 -15
- package/dist/types/offset_core.d.ts +20 -0
- package/package.json +56 -26
- package/build.js +0 -57
- package/demo/demo.css +0 -16
- package/demo/demo.js +0 -125
- package/demo/index.html +0 -12
- package/demo/paperjs-offset.js +0 -660
- package/demo/paperjs-offset.min.js +0 -1
- package/dist/index.es5.js +0 -391
- package/dist/index.es5.js.map +0 -1
- package/dist/lib/bundle.js +0 -10
- package/dist/lib/bundle.js.map +0 -1
- package/dist/lib/index.js +0 -51
- package/dist/lib/index.js.map +0 -1
- package/dist/lib/offset.js +0 -347
- package/dist/lib/offset.js.map +0 -1
- package/dist/paperjs-offset.js +0 -660
- package/dist/paperjs-offset.min.js +0 -1
- package/dist/types/bundle.d.ts +0 -9
- package/dist/types/offset.d.ts +0 -5
- package/public/preview.jpg +0 -0
- package/src/bundle.ts +0 -18
- package/src/index.ts +0 -56
- package/src/offset.ts +0 -356
- package/tsconfig.json +0 -20
- package/tslint.json +0 -17
|
@@ -1 +0,0 @@
|
|
|
1
|
-
!function(O){"use strict";var v,t;function r(t,r,e){if(void 0===e&&(e=!1),e){var n="function"==typeof r?function(t,e,n){return!r(t,e,n)}:function(t){return t!==r},o=t.filter(n);if(o.length<t.length)return t.splice.apply(t,[0,t.length].concat(o)),!0}else{var i="function"==typeof r?t.findIndex(r):t.indexOf(r);if(-1<i)return t.splice(i,1),!0}return!1}function c(n,r){return 0<n?new Array(n).fill(null).map(function(t,e){return r(e,n)}):[]}function g(t,e,n,r){var o=t.curve===e,i=e.getNormalAtTime(o?0:1).multiply(r),a=t.point.add(i),u=new O.Segment(a),c=o?"handleOut":"handleIn";return u[c]=t[c].add(n.subtract(i).divide(2)),u}function S(t,e){return t.x*e.y-t.y*e.x}function m(t,e,n,r,o,i){var a,u,c,s,f,l,d,h,p,v,g,m,w,y,P=new O.Curve(t[0],t[1]),b=new O.Curve(e[0],e[1]),A=P.getIntersections(b),I=t[1].point.getDistance(e[0].point);if(n.isSmooth())e[0].handleOut=e[0].handleOut.project(n.handleOut),e[0].handleIn=t[1].handleIn.project(n.handleIn),e[0].point=t[1].point.add(e[0].point).divide(2),t.pop();else if(0===A.length)if(I>.1*Math.abs(o))switch(r){case"miter":var M=(d=P.point2,h=P.point2.add(P.getTangentAtTime(1)),p=b.point1,v=b.point1.add(b.getTangentAtTime(0)),g=d.subtract(h),m=p.subtract(v),w=S(d,h),y=S(p,v),new O.Point(w*m.x-g.x*y,w*m.y-g.y*y).divide(S(g,m)));Math.max(M.getDistance(P.point2),M.getDistance(b.point1))<Math.abs(o)*i&&t.push(new O.Segment(M));break;case"round":var k=(a=t[1],u=e[0],c=n.point,s=o,f=a.point.subtract(c).add(u.point.subtract(c)).normalize(Math.abs(s)).add(c),l=new O.Path.Arc({from:a.point,to:u.point,through:f,insert:!1}),a.handleOut=l.firstSegment.handleOut,u.handleIn=l.lastSegment.handleIn,3===l.segments.length?l.segments[1]:null);k&&t.push(k)}else e[0].handleIn=t[1].handleIn,t.pop();else{var x=P.divideAt(A[0]);if(x){M=x.segment1;var C=b.divideAt(b.getIntersections(P)[0]);M.handleOut=C?C.segment1.handleOut:e[0].handleOut,t.pop(),e[0]=M}else e[0].handleIn=t[1].handleIn,t.pop()}}function w(t){return 1===t.children.length&&(t=t.children[0]).remove(),t}function y(t,e){if(void 0===e&&(e=.01),t.closed){var n=Math.abs(t.area*e);if(t.clockwise||t.reverse(),(t=t.unite(t,{insert:!1}))instanceof O.CompoundPath&&(t.children.filter(function(t){return Math.abs(t.area)<n}).forEach(function(t){return t.remove()}),1===t.children.length))return w(t)}return t}function P(t,e){var n=(t.segments[0].location.offset+t.segments[Math.max(1,Math.floor(t.segments.length/2))].location.offset)/3;return e.getNearestLocation(t.getPointAt(n)).offset<e.getNearestLocation(t.getPointAt(2*n)).offset}function b(t,e){var n;((n=t)instanceof O.CompoundPath?v.Flat(n.children.map(function(t){return t.segments})):n.segments).slice().forEach(function(t){e.contains(t.point)||t.remove()})}function h(t,e,n,r){var o,i,a,u,c;u=e,(c=(a=t).clone({insert:!1})).reduce({}),a.clockwise||(c.reverse(),u=-u),e=(o=[c,u])[1];var s,f,l=(i=o[0]).curves.slice(),d=v.Divide(v.Flat(l.map(function(t){return function t(e,n){var r=new O.Curve(e.segment1.handleOut.add(e.segment1.point),new O.Point(0,0),new O.Point(0,0),e.segment2.handleIn.add(e.segment2.point)).getNormalAtTime(.5).multiply(n),o=g(e.segment1,e,r,n),i=g(e.segment2,e,r,n),a=new O.Curve(o,i);if(0===a.getIntersections(a).length){var u=Math.min(Math.abs(n)/10,1),c=a.getPointAtTime(.5).getDistance(e.getPointAtTime(.5));if(Math.abs(c-Math.abs(n))>u){var s=e.divideAtTime(.5);if(null!=s)return t(e,n).concat(t(s,n))}}return[o,i]}(t,e)})),2),h=v.Flat(function(t,e,n,r,o){for(var i=n.segments,a=t[0].slice(),u=0;u<t.length-1;++u)m(t[u],t[u+1],i[u+1],e,r,o);return n.closed&&(m(t[t.length-1],a,i[0],e,r,o),t[0][0]=a[0]),t}(d,n,i,e,r)),p=(s=new O.Path({segments:h,insert:!1,closed:t.closed}),(f=s.unite(s,{insert:!1}))instanceof O.CompoundPath?(f.children.filter(function(t){return!(1<t.segments.length&&P(t,s))}).forEach(function(t){return t.remove()}),w(f)):s);return p.reduce({}),i.closed&&(i.clockwise&&e<0||!i.clockwise&&0<e)&&b(p,t),i.clockwise!==t.clockwise&&p.reverse(),y(p)}function p(t,e,n){var r=t.point.add(e.point).divide(2),o=e.point.subtract(t.point).rotate(-90,new O.Point(0,0)).normalize(n),i=r.add(o);return new O.Path.Arc({from:t.point,to:e.point,through:i,insert:!1}).segments}function l(t,e,n,r,o){var i=h(t,e=t.clockwise?e:-e,n,o),a=h(t,-e,n,o);if(t.closed)return i.subtract(a,{insert:!1});var u=a,c=new Array;a instanceof O.CompoundPath&&((c=a.children.filter(function(t){return t.closed})).forEach(function(t){return t.remove()}),u=a.children[0]),u.reverse();var s=function(t,e,n,r){if(t instanceof O.CompoundPath){var o=t.children.map(function(t){return{c:t,a:Math.abs(t.area)}});t=(o=o.sort(function(t,e){return e.a-t.a}))[0].c}var i=t.segments.slice(),a=e.segments.slice();switch(r){case"round":var u=p(a[a.length-1],i[0],n),c=p(i[i.length-1],a[0],n),s=new O.Path({segments:u.concat(i,c,a),closed:!0,insert:!1});return s.reduce({}),s;default:return new O.Path({segments:i.concat(a),closed:!0,insert:!1})}}(i,u,e,r);if(0<c.length)for(var f=0,l=c;f<l.length;f++){var d=l[f];s=s.subtract(d,{insert:!1})}return s}O=O&&Object.prototype.hasOwnProperty.call(O,"default")?O.default:O,(t=v=v||{}).Delete=r,t.BatchDelete=function(e,t,n){void 0===n&&(n=!1),t.forEach(function(t){r(e,t,n)})},t.Replace=function(t,e,n,r){if(void 0===r&&(r=!1),null==t)return!1;var o=!1;do{var i="function"==typeof e?t.findIndex(e):t.indexOf(e);if(!(-1<i))break;t[i]=n,o=!0}while(r);return o},t.Find=function(t,e){var n=t.findIndex(e);return t[n]},t.IncludeSome=function(e,t){return t.some(function(t){return e.includes(t)})},t.OrderedInsert=function(t,e,n,r){void 0===r&&(r=!1);var o=t.findIndex(function(t){return 0<=n(t,e)});if(-1<o){var i=0===n(t[o],e);return t.splice(o,i&&r?1:0,e),o}return t.push(e),t.length-1},t.InsertBefore=function(t,e,n){var r=t.indexOf(n);t.splice(Math.max(r,0),0,e)},t.InsertAfter=function(t,e,n){var r=t.indexOf(n);-1<r?t.splice(r+1,0,e):t.push(n)},t.ApproximateIndex=function(t,e,n){return void 0===n&&(n=0),t.findIndex(function(t){return Math.abs(t-e)<=n})},t.Approximate=function(t,e,n){void 0===n&&(n=0);var r=t.findIndex(function(t){return Math.abs(t-e)<=n});return t[r]},t.Empty=function(t){return 0<t?new Array(t).fill(null):[]},t.Create=c,t.Repeat=function(e){for(var n=[],t=1;t<arguments.length;t++)n[t-1]=arguments[t];return c(e*n.length,function(t){return n[Math.floor(t/e)]})},t.RepeatSequence=function(t){for(var e=[],n=1;n<arguments.length;n++)e[n-1]=arguments[n];return c(t*e.length,function(t){return e[t%e.length]})},t.AnalyzePeriod=function(t){for(var e=Math.ceil(Math.sqrt(t.length)),n=1;n<=e;++n)if(t.length%n==0){for(var r=t.slice(0,n),o=!0,i=n;i<t.length;++i)if(t[i]!==r[i%n]){o=!1;break}if(o)return r}return t},t.Flat=function(t,e){void 0===e&&(e=!1);var n=Array.prototype.concat.apply([],t);return e?n:n.filter(function(t){return null!=t})},t.Divide=function(t,e){for(var n=[],r=0;r<t.length;r+=e)n.push(t.slice(r,r+e));return n},t.Group=function(r,o){var i={};return r.forEach(function(t,e){var n=o(t,e,r);i[n]||(i[n]=[]),i[n].push(t)}),i},t.Sample=function(e,t,n){if(void 0===n&&(n=!1),t>=e.length)return e;if(n){for(var r=[],o=e.slice(),i=0;i<t;++i){var a=o.splice(Math.round(o.length*Math.random()),1)[0];r.push(a)}return r}var u=e.length/t;return c(t,function(t){return e[Math.round(u*t)]})},t.Union=function(t,e){void 0===e&&(e=!1);var n=Array.prototype.concat.apply([],t);return e?Array.from(new Set(n)):n},t.Intersect=function(n){if(1<n.length){var e=new Map;n[0].forEach(function(t){return e.set(t,1)});for(var t=1;t<n.length;++t)n[t].forEach(function(t){e.has(t)&&e.set(t,e.get(t)+1)});var r=new Array;return e.forEach(function(t,e){t===n.length&&r.push(e)}),r}return n[0]||[]},t.Subtract=function(t,e){if(1<e.length){var n=new Set(Array.prototype.concat.apply([],e));return t.filter(function(t){return!n.has(t)})}return t||[]},t.NonNull=function(t){return t.filter(function(t){return null!=t})};var e,n=(o.offset=function(t,e,n){var r=function(n,r,o,i){var t=n.unite(n,{insert:!1}),e=t;if(t instanceof O.Path)e=h(t,r,o,i);else{var a=v.Flat(t.children.map(function(t){if(1<t.segments.length){P(t,n)||t.reverse();var e=h(t,r,o,i);return(e=y(e)).clockwise!==t.clockwise&&e.reverse(),e instanceof O.CompoundPath?(e.applyMatrix=!0,e.children):e}return null}),!1);e=new O.CompoundPath({children:a,insert:!1})}return e.copyAttributes(t,!1),e.remove(),e}(t,e,(n=n||{}).join||"miter",n.limit||10);return void 0===n.insert&&(n.insert=!0),n.insert&&(t.parent||O.project.activeLayer).addChild(r),r},o.offsetStroke=function(t,e,n){var r,o,i,a,u,c,s,f=(r=t,o=e,i=(n=n||{}).join||"miter",a=n.cap||"butt",u=n.limit||10,c=r.unite(r,{insert:!1}),(s=(s=c)instanceof O.Path?l(c,o,i,a,u):v.Flat(c.children.map(function(t){return l(t,o,i,a,u)})).reduce(function(t,e){return t.unite(e,{insert:!1})})).strokeWidth=0,s.fillColor=c.strokeColor,s.shadowBlur=c.shadowBlur,s.shadowColor=c.shadowColor,s.shadowOffset=c.shadowOffset,s);return void 0===n.insert&&(n.insert=!0),n.insert&&(t.parent||O.project.activeLayer).addChild(f),f},o);function o(){}(e=O).Path.prototype.offset=function(t,e){return n.offset(this,t,e)},e.Path.prototype.offsetStroke=function(t,e){return n.offsetStroke(this,t,e)},e.CompoundPath.prototype.offset=function(t,e){return n.offset(this,t,e)},e.CompoundPath.prototype.offsetStroke=function(t,e){return n.offsetStroke(this,t,e)},window.PaperOffset={offset:n.offset,offsetStroke:n.offsetStroke}}(paper);
|
package/dist/index.es5.js
DELETED
|
@@ -1,391 +0,0 @@
|
|
|
1
|
-
import paper from 'paper';
|
|
2
|
-
import { Arrayex } from 'arrayex';
|
|
3
|
-
|
|
4
|
-
/**
|
|
5
|
-
* Offset the start/terminal segment of a bezier curve
|
|
6
|
-
* @param segment segment to offset
|
|
7
|
-
* @param curve curve to offset
|
|
8
|
-
* @param handleNormal the normal of the the line formed of two handles
|
|
9
|
-
* @param offset offset value
|
|
10
|
-
*/
|
|
11
|
-
function offsetSegment(segment, curve, handleNormal, offset) {
|
|
12
|
-
var isFirst = segment.curve === curve;
|
|
13
|
-
// get offset vector
|
|
14
|
-
var offsetVector = (curve.getNormalAtTime(isFirst ? 0 : 1)).multiply(offset);
|
|
15
|
-
// get offset point
|
|
16
|
-
var point = segment.point.add(offsetVector);
|
|
17
|
-
var newSegment = new paper.Segment(point);
|
|
18
|
-
// handleOut for start segment & handleIn for terminal segment
|
|
19
|
-
var handle = (isFirst ? 'handleOut' : 'handleIn');
|
|
20
|
-
newSegment[handle] = segment[handle].add(handleNormal.subtract(offsetVector).divide(2));
|
|
21
|
-
return newSegment;
|
|
22
|
-
}
|
|
23
|
-
/**
|
|
24
|
-
* Adaptive offset a curve by repeatly apply the approximation proposed by Tiller and Hanson.
|
|
25
|
-
* @param curve curve to offset
|
|
26
|
-
* @param offset offset value
|
|
27
|
-
*/
|
|
28
|
-
function adaptiveOffsetCurve(curve, offset) {
|
|
29
|
-
var hNormal = (new paper.Curve(curve.segment1.handleOut.add(curve.segment1.point), new paper.Point(0, 0), new paper.Point(0, 0), curve.segment2.handleIn.add(curve.segment2.point))).getNormalAtTime(0.5).multiply(offset);
|
|
30
|
-
var segment1 = offsetSegment(curve.segment1, curve, hNormal, offset);
|
|
31
|
-
var segment2 = offsetSegment(curve.segment2, curve, hNormal, offset);
|
|
32
|
-
// divide && re-offset
|
|
33
|
-
var offsetCurve = new paper.Curve(segment1, segment2);
|
|
34
|
-
// if the offset curve is not self intersected, divide it
|
|
35
|
-
if (offsetCurve.getIntersections(offsetCurve).length === 0) {
|
|
36
|
-
var threshold = Math.min(Math.abs(offset) / 10, 1);
|
|
37
|
-
var midOffset = offsetCurve.getPointAtTime(0.5).getDistance(curve.getPointAtTime(0.5));
|
|
38
|
-
if (Math.abs(midOffset - Math.abs(offset)) > threshold) {
|
|
39
|
-
var subCurve = curve.divideAtTime(0.5);
|
|
40
|
-
if (subCurve != null) {
|
|
41
|
-
return adaptiveOffsetCurve(curve, offset).concat(adaptiveOffsetCurve(subCurve, offset));
|
|
42
|
-
}
|
|
43
|
-
}
|
|
44
|
-
}
|
|
45
|
-
return [segment1, segment2];
|
|
46
|
-
}
|
|
47
|
-
/**
|
|
48
|
-
* Create a round join segment between two adjacent segments.
|
|
49
|
-
*/
|
|
50
|
-
function makeRoundJoin(segment1, segment2, originPoint, radius) {
|
|
51
|
-
var through = segment1.point.subtract(originPoint).add(segment2.point.subtract(originPoint))
|
|
52
|
-
.normalize(Math.abs(radius)).add(originPoint);
|
|
53
|
-
var arc = new paper.Path.Arc({ from: segment1.point, to: segment2.point, through: through, insert: false });
|
|
54
|
-
segment1.handleOut = arc.firstSegment.handleOut;
|
|
55
|
-
segment2.handleIn = arc.lastSegment.handleIn;
|
|
56
|
-
return arc.segments.length === 3 ? arc.segments[1] : null;
|
|
57
|
-
}
|
|
58
|
-
function det(p1, p2) {
|
|
59
|
-
return p1.x * p2.y - p1.y * p2.x;
|
|
60
|
-
}
|
|
61
|
-
/**
|
|
62
|
-
* Get the intersection point of point based lines
|
|
63
|
-
*/
|
|
64
|
-
function getPointLineIntersections(p1, p2, p3, p4) {
|
|
65
|
-
var l1 = p1.subtract(p2);
|
|
66
|
-
var l2 = p3.subtract(p4);
|
|
67
|
-
var dl1 = det(p1, p2);
|
|
68
|
-
var dl2 = det(p3, p4);
|
|
69
|
-
return new paper.Point(dl1 * l2.x - l1.x * dl2, dl1 * l2.y - l1.y * dl2).divide(det(l1, l2));
|
|
70
|
-
}
|
|
71
|
-
/**
|
|
72
|
-
* Connect two adjacent bezier curve, each curve is represented by two segments,
|
|
73
|
-
* create different types of joins or simply removal redundant segment.
|
|
74
|
-
*/
|
|
75
|
-
function connectAdjacentBezier(segments1, segments2, origin, joinType, offset, limit) {
|
|
76
|
-
var curve1 = new paper.Curve(segments1[0], segments1[1]);
|
|
77
|
-
var curve2 = new paper.Curve(segments2[0], segments2[1]);
|
|
78
|
-
var intersection = curve1.getIntersections(curve2);
|
|
79
|
-
var distance = segments1[1].point.getDistance(segments2[0].point);
|
|
80
|
-
if (origin.isSmooth()) {
|
|
81
|
-
segments2[0].handleOut = segments2[0].handleOut.project(origin.handleOut);
|
|
82
|
-
segments2[0].handleIn = segments1[1].handleIn.project(origin.handleIn);
|
|
83
|
-
segments2[0].point = segments1[1].point.add(segments2[0].point).divide(2);
|
|
84
|
-
segments1.pop();
|
|
85
|
-
}
|
|
86
|
-
else {
|
|
87
|
-
if (intersection.length === 0) {
|
|
88
|
-
if (distance > Math.abs(offset) * 0.1) {
|
|
89
|
-
// connect
|
|
90
|
-
switch (joinType) {
|
|
91
|
-
case 'miter':
|
|
92
|
-
var join = getPointLineIntersections(curve1.point2, curve1.point2.add(curve1.getTangentAtTime(1)), curve2.point1, curve2.point1.add(curve2.getTangentAtTime(0)));
|
|
93
|
-
// prevent sharp angle
|
|
94
|
-
var joinOffset = Math.max(join.getDistance(curve1.point2), join.getDistance(curve2.point1));
|
|
95
|
-
if (joinOffset < Math.abs(offset) * limit) {
|
|
96
|
-
segments1.push(new paper.Segment(join));
|
|
97
|
-
}
|
|
98
|
-
break;
|
|
99
|
-
case 'round':
|
|
100
|
-
var mid = makeRoundJoin(segments1[1], segments2[0], origin.point, offset);
|
|
101
|
-
if (mid) {
|
|
102
|
-
segments1.push(mid);
|
|
103
|
-
}
|
|
104
|
-
break;
|
|
105
|
-
}
|
|
106
|
-
}
|
|
107
|
-
else {
|
|
108
|
-
segments2[0].handleIn = segments1[1].handleIn;
|
|
109
|
-
segments1.pop();
|
|
110
|
-
}
|
|
111
|
-
}
|
|
112
|
-
else {
|
|
113
|
-
var second1 = curve1.divideAt(intersection[0]);
|
|
114
|
-
if (second1) {
|
|
115
|
-
var join = second1.segment1;
|
|
116
|
-
var second2 = curve2.divideAt(curve2.getIntersections(curve1)[0]);
|
|
117
|
-
join.handleOut = second2 ? second2.segment1.handleOut : segments2[0].handleOut;
|
|
118
|
-
segments1.pop();
|
|
119
|
-
segments2[0] = join;
|
|
120
|
-
}
|
|
121
|
-
else {
|
|
122
|
-
segments2[0].handleIn = segments1[1].handleIn;
|
|
123
|
-
segments1.pop();
|
|
124
|
-
}
|
|
125
|
-
}
|
|
126
|
-
}
|
|
127
|
-
}
|
|
128
|
-
/**
|
|
129
|
-
* Connect all the segments together.
|
|
130
|
-
*/
|
|
131
|
-
function connectBeziers(rawSegments, join, source, offset, limit) {
|
|
132
|
-
var originSegments = source.segments;
|
|
133
|
-
var first = rawSegments[0].slice();
|
|
134
|
-
for (var i = 0; i < rawSegments.length - 1; ++i) {
|
|
135
|
-
connectAdjacentBezier(rawSegments[i], rawSegments[i + 1], originSegments[i + 1], join, offset, limit);
|
|
136
|
-
}
|
|
137
|
-
if (source.closed) {
|
|
138
|
-
connectAdjacentBezier(rawSegments[rawSegments.length - 1], first, originSegments[0], join, offset, limit);
|
|
139
|
-
rawSegments[0][0] = first[0];
|
|
140
|
-
}
|
|
141
|
-
return rawSegments;
|
|
142
|
-
}
|
|
143
|
-
function reduceSingleChildCompoundPath(path) {
|
|
144
|
-
if (path.children.length === 1) {
|
|
145
|
-
path = path.children[0];
|
|
146
|
-
path.remove(); // remove from parent, this is critical, or the style attributes will be ignored
|
|
147
|
-
}
|
|
148
|
-
return path;
|
|
149
|
-
}
|
|
150
|
-
/** Normalize a path, always clockwise, non-self-intersection, ignore really small components, and no one-component compound path. */
|
|
151
|
-
function normalize(path, areaThreshold) {
|
|
152
|
-
if (areaThreshold === void 0) { areaThreshold = 0.01; }
|
|
153
|
-
if (path.closed) {
|
|
154
|
-
var ignoreArea_1 = Math.abs(path.area * areaThreshold);
|
|
155
|
-
if (!path.clockwise) {
|
|
156
|
-
path.reverse();
|
|
157
|
-
}
|
|
158
|
-
path = path.unite(path, { insert: false });
|
|
159
|
-
if (path instanceof paper.CompoundPath) {
|
|
160
|
-
path.children.filter(function (c) { return Math.abs(c.area) < ignoreArea_1; }).forEach(function (c) { return c.remove(); });
|
|
161
|
-
if (path.children.length === 1) {
|
|
162
|
-
return reduceSingleChildCompoundPath(path);
|
|
163
|
-
}
|
|
164
|
-
}
|
|
165
|
-
}
|
|
166
|
-
return path;
|
|
167
|
-
}
|
|
168
|
-
function isSameDirection(partialPath, fullPath) {
|
|
169
|
-
var offset1 = partialPath.segments[0].location.offset;
|
|
170
|
-
var offset2 = partialPath.segments[Math.max(1, Math.floor(partialPath.segments.length / 2))].location.offset;
|
|
171
|
-
var sampleOffset = (offset1 + offset2) / 3;
|
|
172
|
-
var originOffset1 = fullPath.getNearestLocation(partialPath.getPointAt(sampleOffset)).offset;
|
|
173
|
-
var originOffset2 = fullPath.getNearestLocation(partialPath.getPointAt(2 * sampleOffset)).offset;
|
|
174
|
-
return originOffset1 < originOffset2;
|
|
175
|
-
}
|
|
176
|
-
/** Remove self intersection when offset is negative by point direction dectection. */
|
|
177
|
-
function removeIntersection(path) {
|
|
178
|
-
var newPath = path.unite(path, { insert: false });
|
|
179
|
-
if (newPath instanceof paper.CompoundPath) {
|
|
180
|
-
newPath.children.filter(function (c) {
|
|
181
|
-
if (c.segments.length > 1) {
|
|
182
|
-
return !isSameDirection(c, path);
|
|
183
|
-
}
|
|
184
|
-
else {
|
|
185
|
-
return true;
|
|
186
|
-
}
|
|
187
|
-
}).forEach(function (c) { return c.remove(); });
|
|
188
|
-
return reduceSingleChildCompoundPath(newPath);
|
|
189
|
-
}
|
|
190
|
-
return path;
|
|
191
|
-
}
|
|
192
|
-
function getSegments(path) {
|
|
193
|
-
if (path instanceof paper.CompoundPath) {
|
|
194
|
-
return Arrayex.Flat(path.children.map(function (c) { return c.segments; }));
|
|
195
|
-
}
|
|
196
|
-
else {
|
|
197
|
-
return path.segments;
|
|
198
|
-
}
|
|
199
|
-
}
|
|
200
|
-
/**
|
|
201
|
-
* Remove impossible segments in negative offset condition.
|
|
202
|
-
*/
|
|
203
|
-
function removeOutsiders(newPath, path) {
|
|
204
|
-
var segments = getSegments(newPath).slice();
|
|
205
|
-
segments.forEach(function (segment) {
|
|
206
|
-
if (!path.contains(segment.point)) {
|
|
207
|
-
segment.remove();
|
|
208
|
-
}
|
|
209
|
-
});
|
|
210
|
-
}
|
|
211
|
-
function preparePath(path, offset) {
|
|
212
|
-
var source = path.clone({ insert: false });
|
|
213
|
-
source.reduce({});
|
|
214
|
-
if (!path.clockwise) {
|
|
215
|
-
source.reverse();
|
|
216
|
-
offset = -offset;
|
|
217
|
-
}
|
|
218
|
-
return [source, offset];
|
|
219
|
-
}
|
|
220
|
-
function offsetSimpleShape(path, offset, join, limit) {
|
|
221
|
-
var _a;
|
|
222
|
-
var source;
|
|
223
|
-
_a = preparePath(path, offset), source = _a[0], offset = _a[1];
|
|
224
|
-
var curves = source.curves.slice();
|
|
225
|
-
var raws = Arrayex.Divide(Arrayex.Flat(curves.map(function (curve) { return adaptiveOffsetCurve(curve, offset); })), 2);
|
|
226
|
-
var segments = Arrayex.Flat(connectBeziers(raws, join, source, offset, limit));
|
|
227
|
-
var newPath = removeIntersection(new paper.Path({ segments: segments, insert: false, closed: path.closed }));
|
|
228
|
-
newPath.reduce({});
|
|
229
|
-
if (source.closed && ((source.clockwise && offset < 0) || (!source.clockwise && offset > 0))) {
|
|
230
|
-
removeOutsiders(newPath, path);
|
|
231
|
-
}
|
|
232
|
-
// recovery path
|
|
233
|
-
if (source.clockwise !== path.clockwise) {
|
|
234
|
-
newPath.reverse();
|
|
235
|
-
}
|
|
236
|
-
return normalize(newPath);
|
|
237
|
-
}
|
|
238
|
-
function makeRoundCap(from, to, offset) {
|
|
239
|
-
var origin = from.point.add(to.point).divide(2);
|
|
240
|
-
var normal = to.point.subtract(from.point).rotate(-90, new paper.Point(0, 0)).normalize(offset);
|
|
241
|
-
var through = origin.add(normal);
|
|
242
|
-
var arc = new paper.Path.Arc({ from: from.point, to: to.point, through: through, insert: false });
|
|
243
|
-
return arc.segments;
|
|
244
|
-
}
|
|
245
|
-
function connectSide(outer, inner, offset, cap) {
|
|
246
|
-
if (outer instanceof paper.CompoundPath) {
|
|
247
|
-
var cs = outer.children.map(function (c) { return ({ c: c, a: Math.abs(c.area) }); });
|
|
248
|
-
cs = cs.sort(function (c1, c2) { return c2.a - c1.a; });
|
|
249
|
-
outer = cs[0].c;
|
|
250
|
-
}
|
|
251
|
-
var oSegments = outer.segments.slice();
|
|
252
|
-
var iSegments = inner.segments.slice();
|
|
253
|
-
switch (cap) {
|
|
254
|
-
case 'round':
|
|
255
|
-
var heads = makeRoundCap(iSegments[iSegments.length - 1], oSegments[0], offset);
|
|
256
|
-
var tails = makeRoundCap(oSegments[oSegments.length - 1], iSegments[0], offset);
|
|
257
|
-
var result = new paper.Path({ segments: heads.concat(oSegments, tails, iSegments), closed: true, insert: false });
|
|
258
|
-
result.reduce({});
|
|
259
|
-
return result;
|
|
260
|
-
default: return new paper.Path({ segments: oSegments.concat(iSegments), closed: true, insert: false });
|
|
261
|
-
}
|
|
262
|
-
}
|
|
263
|
-
function offsetSimpleStroke(path, offset, join, cap, limit) {
|
|
264
|
-
offset = path.clockwise ? offset : -offset;
|
|
265
|
-
var positiveOffset = offsetSimpleShape(path, offset, join, limit);
|
|
266
|
-
var negativeOffset = offsetSimpleShape(path, -offset, join, limit);
|
|
267
|
-
if (path.closed) {
|
|
268
|
-
return positiveOffset.subtract(negativeOffset, { insert: false });
|
|
269
|
-
}
|
|
270
|
-
else {
|
|
271
|
-
var inner = negativeOffset;
|
|
272
|
-
var holes = new Array();
|
|
273
|
-
if (negativeOffset instanceof paper.CompoundPath) {
|
|
274
|
-
holes = negativeOffset.children.filter(function (c) { return c.closed; });
|
|
275
|
-
holes.forEach(function (h) { return h.remove(); });
|
|
276
|
-
inner = negativeOffset.children[0];
|
|
277
|
-
}
|
|
278
|
-
inner.reverse();
|
|
279
|
-
var final = connectSide(positiveOffset, inner, offset, cap);
|
|
280
|
-
if (holes.length > 0) {
|
|
281
|
-
for (var _i = 0, holes_1 = holes; _i < holes_1.length; _i++) {
|
|
282
|
-
var hole = holes_1[_i];
|
|
283
|
-
final = final.subtract(hole, { insert: false });
|
|
284
|
-
}
|
|
285
|
-
}
|
|
286
|
-
return final;
|
|
287
|
-
}
|
|
288
|
-
}
|
|
289
|
-
function offsetPath(path, offset, join, limit) {
|
|
290
|
-
var nonSIPath = path.unite(path, { insert: false });
|
|
291
|
-
var result = nonSIPath;
|
|
292
|
-
if (nonSIPath instanceof paper.Path) {
|
|
293
|
-
result = offsetSimpleShape(nonSIPath, offset, join, limit);
|
|
294
|
-
}
|
|
295
|
-
else {
|
|
296
|
-
var children = Arrayex.Flat(nonSIPath.children.map(function (c) {
|
|
297
|
-
if (c.segments.length > 1) {
|
|
298
|
-
if (!isSameDirection(c, path)) {
|
|
299
|
-
c.reverse();
|
|
300
|
-
}
|
|
301
|
-
var offseted = offsetSimpleShape(c, offset, join, limit);
|
|
302
|
-
offseted = normalize(offseted);
|
|
303
|
-
if (offseted.clockwise !== c.clockwise) {
|
|
304
|
-
offseted.reverse();
|
|
305
|
-
}
|
|
306
|
-
if (offseted instanceof paper.CompoundPath) {
|
|
307
|
-
offseted.applyMatrix = true;
|
|
308
|
-
return offseted.children;
|
|
309
|
-
}
|
|
310
|
-
else {
|
|
311
|
-
return offseted;
|
|
312
|
-
}
|
|
313
|
-
}
|
|
314
|
-
else {
|
|
315
|
-
return null;
|
|
316
|
-
}
|
|
317
|
-
}), false);
|
|
318
|
-
result = new paper.CompoundPath({ children: children, insert: false });
|
|
319
|
-
}
|
|
320
|
-
result.copyAttributes(nonSIPath, false);
|
|
321
|
-
result.remove();
|
|
322
|
-
return result;
|
|
323
|
-
}
|
|
324
|
-
function offsetStroke(path, offset, join, cap, limit) {
|
|
325
|
-
var nonSIPath = path.unite(path, { insert: false });
|
|
326
|
-
var result = nonSIPath;
|
|
327
|
-
if (nonSIPath instanceof paper.Path) {
|
|
328
|
-
result = offsetSimpleStroke(nonSIPath, offset, join, cap, limit);
|
|
329
|
-
}
|
|
330
|
-
else {
|
|
331
|
-
var children = Arrayex.Flat(nonSIPath.children.map(function (c) {
|
|
332
|
-
return offsetSimpleStroke(c, offset, join, cap, limit);
|
|
333
|
-
}));
|
|
334
|
-
result = children.reduce(function (c1, c2) { return c1.unite(c2, { insert: false }); });
|
|
335
|
-
}
|
|
336
|
-
result.strokeWidth = 0;
|
|
337
|
-
result.fillColor = nonSIPath.strokeColor;
|
|
338
|
-
result.shadowBlur = nonSIPath.shadowBlur;
|
|
339
|
-
result.shadowColor = nonSIPath.shadowColor;
|
|
340
|
-
result.shadowOffset = nonSIPath.shadowOffset;
|
|
341
|
-
return result;
|
|
342
|
-
}
|
|
343
|
-
|
|
344
|
-
var PaperOffset = /** @class */ (function () {
|
|
345
|
-
function PaperOffset() {
|
|
346
|
-
}
|
|
347
|
-
PaperOffset.offset = function (path, offset, options) {
|
|
348
|
-
options = options || {};
|
|
349
|
-
var newPath = offsetPath(path, offset, options.join || 'miter', options.limit || 10);
|
|
350
|
-
if (options.insert === undefined) {
|
|
351
|
-
options.insert = true;
|
|
352
|
-
}
|
|
353
|
-
if (options.insert) {
|
|
354
|
-
(path.parent || paper.project.activeLayer).addChild(newPath);
|
|
355
|
-
}
|
|
356
|
-
return newPath;
|
|
357
|
-
};
|
|
358
|
-
PaperOffset.offsetStroke = function (path, offset, options) {
|
|
359
|
-
options = options || {};
|
|
360
|
-
var newStroke = offsetStroke(path, offset, options.join || 'miter', options.cap || 'butt', options.limit || 10);
|
|
361
|
-
if (options.insert === undefined) {
|
|
362
|
-
options.insert = true;
|
|
363
|
-
}
|
|
364
|
-
if (options.insert) {
|
|
365
|
-
(path.parent || paper.project.activeLayer).addChild(newStroke);
|
|
366
|
-
}
|
|
367
|
-
return newStroke;
|
|
368
|
-
};
|
|
369
|
-
return PaperOffset;
|
|
370
|
-
}());
|
|
371
|
-
/**
|
|
372
|
-
* @deprecated EXTEND existing paper module is not recommend anymore
|
|
373
|
-
*/
|
|
374
|
-
function ExtendPaperJs(paperNs) {
|
|
375
|
-
paperNs.Path.prototype.offset = function (offset, options) {
|
|
376
|
-
return PaperOffset.offset(this, offset, options);
|
|
377
|
-
};
|
|
378
|
-
paperNs.Path.prototype.offsetStroke = function (offset, options) {
|
|
379
|
-
return PaperOffset.offsetStroke(this, offset, options);
|
|
380
|
-
};
|
|
381
|
-
paperNs.CompoundPath.prototype.offset = function (offset, options) {
|
|
382
|
-
return PaperOffset.offset(this, offset, options);
|
|
383
|
-
};
|
|
384
|
-
paperNs.CompoundPath.prototype.offsetStroke = function (offset, options) {
|
|
385
|
-
return PaperOffset.offsetStroke(this, offset, options);
|
|
386
|
-
};
|
|
387
|
-
}
|
|
388
|
-
|
|
389
|
-
export default ExtendPaperJs;
|
|
390
|
-
export { PaperOffset };
|
|
391
|
-
//# sourceMappingURL=index.es5.js.map
|
package/dist/index.es5.js.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"index.es5.js","sources":["../src/offset.ts","../src/index.ts"],"sourcesContent":["import paper from 'paper';\nimport { Arrayex } from 'arrayex';\n\nexport type StrokeJoinType = 'miter' | 'bevel' | 'round';\nexport type StrokeCapType = 'round' | 'butt';\nexport type PathType = paper.Path | paper.CompoundPath;\n\ntype HandleType = 'handleIn' | 'handleOut';\n\n/**\n * Offset the start/terminal segment of a bezier curve\n * @param segment segment to offset\n * @param curve curve to offset\n * @param handleNormal the normal of the the line formed of two handles\n * @param offset offset value\n */\nfunction offsetSegment(segment: paper.Segment, curve: paper.Curve, handleNormal: paper.Point, offset: number) {\n const isFirst = segment.curve === curve;\n // get offset vector\n const offsetVector = (curve.getNormalAtTime(isFirst ? 0 : 1)).multiply(offset);\n // get offset point\n const point = segment.point.add(offsetVector);\n const newSegment = new paper.Segment(point);\n // handleOut for start segment & handleIn for terminal segment\n const handle = (isFirst ? 'handleOut' : 'handleIn') as HandleType;\n newSegment[handle] = segment[handle]!.add(handleNormal.subtract(offsetVector).divide(2));\n return newSegment;\n}\n\n/**\n * Adaptive offset a curve by repeatly apply the approximation proposed by Tiller and Hanson.\n * @param curve curve to offset\n * @param offset offset value\n */\nfunction adaptiveOffsetCurve(curve: paper.Curve, offset: number): paper.Segment[] {\n const hNormal = (new paper.Curve(curve.segment1.handleOut!.add(curve.segment1.point), new paper.Point(0, 0),\n new paper.Point(0, 0), curve.segment2.handleIn!.add(curve.segment2.point))).getNormalAtTime(0.5).multiply(offset);\n const segment1 = offsetSegment(curve.segment1, curve, hNormal, offset);\n const segment2 = offsetSegment(curve.segment2, curve, hNormal, offset);\n // divide && re-offset\n const offsetCurve = new paper.Curve(segment1, segment2);\n // if the offset curve is not self intersected, divide it\n if (offsetCurve.getIntersections(offsetCurve).length === 0) {\n const threshold = Math.min(Math.abs(offset) / 10, 1);\n const midOffset = offsetCurve.getPointAtTime(0.5).getDistance(curve.getPointAtTime(0.5));\n if (Math.abs(midOffset - Math.abs(offset)) > threshold) {\n const subCurve = curve.divideAtTime(0.5);\n if (subCurve != null) {\n return [...adaptiveOffsetCurve(curve, offset), ...adaptiveOffsetCurve(subCurve, offset)];\n }\n }\n }\n return [segment1, segment2];\n}\n\n/**\n * Create a round join segment between two adjacent segments.\n */\nfunction makeRoundJoin(segment1: paper.Segment, segment2: paper.Segment, originPoint: paper.Point, radius: number) {\n const through = segment1.point.subtract(originPoint).add(segment2.point.subtract(originPoint))\n .normalize(Math.abs(radius)).add(originPoint);\n const arc = new paper.Path.Arc({ from: segment1.point, to: segment2.point, through, insert: false });\n segment1.handleOut = arc.firstSegment.handleOut;\n segment2.handleIn = arc.lastSegment.handleIn;\n return arc.segments.length === 3 ? arc.segments[1] : null;\n}\n\nfunction det(p1: paper.Point, p2: paper.Point) {\n return p1.x * p2.y - p1.y * p2.x;\n}\n\n/**\n * Get the intersection point of point based lines\n */\nfunction getPointLineIntersections(p1: paper.Point, p2: paper.Point, p3: paper.Point, p4: paper.Point) {\n const l1 = p1.subtract(p2);\n const l2 = p3.subtract(p4);\n const dl1 = det(p1, p2);\n const dl2 = det(p3, p4);\n return new paper.Point(dl1 * l2.x - l1.x * dl2, dl1 * l2.y - l1.y * dl2).divide(det(l1, l2));\n}\n\n/**\n * Connect two adjacent bezier curve, each curve is represented by two segments,\n * create different types of joins or simply removal redundant segment.\n */\nfunction connectAdjacentBezier(segments1: paper.Segment[], segments2: paper.Segment[], origin: paper.Segment, joinType: StrokeJoinType, offset: number, limit: number) {\n const curve1 = new paper.Curve(segments1[0], segments1[1]);\n const curve2 = new paper.Curve(segments2[0], segments2[1]);\n const intersection = curve1.getIntersections(curve2);\n const distance = segments1[1].point.getDistance(segments2[0].point);\n if (origin.isSmooth()) {\n segments2[0].handleOut = segments2[0].handleOut!.project(origin.handleOut!);\n segments2[0].handleIn = segments1[1].handleIn!.project(origin.handleIn!);\n segments2[0].point = segments1[1].point.add(segments2[0].point).divide(2);\n segments1.pop();\n } else {\n if (intersection.length === 0) {\n if (distance > Math.abs(offset) * 0.1) {\n // connect\n switch (joinType) {\n case 'miter':\n const join = getPointLineIntersections(curve1.point2, curve1.point2.add(curve1.getTangentAtTime(1)),\n curve2.point1, curve2.point1.add(curve2.getTangentAtTime(0)));\n // prevent sharp angle\n const joinOffset = Math.max(join.getDistance(curve1.point2), join.getDistance(curve2.point1));\n if (joinOffset < Math.abs(offset) * limit) {\n segments1.push(new paper.Segment(join));\n }\n break;\n case 'round':\n const mid = makeRoundJoin(segments1[1], segments2[0], origin.point, offset);\n if (mid) {\n segments1.push(mid);\n }\n break;\n default: break;\n }\n } else {\n segments2[0].handleIn = segments1[1].handleIn;\n segments1.pop();\n }\n } else {\n const second1 = curve1.divideAt(intersection[0]);\n if (second1) {\n const join = second1.segment1;\n const second2 = curve2.divideAt(curve2.getIntersections(curve1)[0]);\n join.handleOut = second2 ? second2.segment1.handleOut : segments2[0].handleOut;\n segments1.pop();\n segments2[0] = join;\n } else {\n segments2[0].handleIn = segments1[1].handleIn;\n segments1.pop();\n }\n }\n }\n}\n\n/**\n * Connect all the segments together.\n */\nfunction connectBeziers(rawSegments: paper.Segment[][], join: StrokeJoinType, source: paper.Path, offset: number, limit: number) {\n const originSegments = source.segments;\n const first = rawSegments[0].slice();\n for (let i = 0; i < rawSegments.length - 1; ++i) {\n connectAdjacentBezier(rawSegments[i], rawSegments[i + 1], originSegments[i + 1], join, offset, limit);\n }\n if (source.closed) {\n connectAdjacentBezier(rawSegments[rawSegments.length - 1], first, originSegments[0], join, offset, limit);\n rawSegments[0][0] = first[0];\n }\n return rawSegments;\n}\n\nfunction reduceSingleChildCompoundPath(path: PathType) {\n if (path.children.length === 1) {\n path = path.children[0] as paper.Path;\n path.remove(); // remove from parent, this is critical, or the style attributes will be ignored\n }\n return path;\n}\n\n/** Normalize a path, always clockwise, non-self-intersection, ignore really small components, and no one-component compound path. */\nfunction normalize(path: PathType, areaThreshold = 0.01) {\n if (path.closed) {\n const ignoreArea = Math.abs(path.area * areaThreshold);\n if (!path.clockwise) {\n path.reverse();\n }\n path = path.unite(path, { insert: false }) as PathType;\n if (path instanceof paper.CompoundPath) {\n path.children.filter((c) => Math.abs((c as PathType).area) < ignoreArea).forEach((c) => c.remove());\n if (path.children.length === 1) {\n return reduceSingleChildCompoundPath(path);\n }\n }\n }\n return path;\n}\n\nfunction isSameDirection(partialPath: paper.Path, fullPath: PathType) {\n const offset1 = partialPath.segments[0].location.offset;\n const offset2 = partialPath.segments[Math.max(1, Math.floor(partialPath.segments.length / 2))].location.offset;\n const sampleOffset = (offset1 + offset2) / 3;\n const originOffset1 = fullPath.getNearestLocation(partialPath.getPointAt(sampleOffset)).offset;\n const originOffset2 = fullPath.getNearestLocation(partialPath.getPointAt(2 * sampleOffset)).offset;\n return originOffset1 < originOffset2;\n}\n\n/** Remove self intersection when offset is negative by point direction dectection. */\nfunction removeIntersection(path: PathType) {\n const newPath = path.unite(path, { insert: false }) as PathType;\n if (newPath instanceof paper.CompoundPath) {\n (newPath.children as paper.Path[]).filter((c) => {\n if (c.segments.length > 1) {\n return !isSameDirection(c, path);\n } else {\n return true;\n }\n }).forEach((c) => c.remove());\n return reduceSingleChildCompoundPath(newPath);\n }\n return path;\n}\n\nfunction getSegments(path: PathType) {\n if (path instanceof paper.CompoundPath) {\n return Arrayex.Flat<paper.Segment>(path.children.map((c) => (c as paper.Path).segments));\n } else {\n return (path as paper.Path).segments;\n }\n}\n\n/**\n * Remove impossible segments in negative offset condition.\n */\nfunction removeOutsiders(newPath: PathType, path: PathType) {\n const segments = getSegments(newPath).slice();\n segments.forEach((segment) => {\n if (!path.contains(segment.point)) {\n segment.remove();\n }\n });\n}\n\nfunction preparePath(path: paper.Path, offset: number): [paper.Path, number] {\n const source = path.clone({ insert: false }) as paper.Path;\n source.reduce({});\n if (!path.clockwise) {\n source.reverse();\n offset = -offset;\n }\n return [source, offset];\n}\n\nfunction offsetSimpleShape(path: paper.Path, offset: number, join: StrokeJoinType, limit: number): PathType {\n let source: paper.Path;\n [source, offset] = preparePath(path, offset);\n const curves = source.curves.slice();\n const raws = Arrayex.Divide(Arrayex.Flat<paper.Segment>(curves.map((curve) => adaptiveOffsetCurve(curve, offset))), 2);\n const segments = Arrayex.Flat(connectBeziers(raws, join, source, offset, limit));\n const newPath = removeIntersection(new paper.Path({ segments, insert: false, closed: path.closed }));\n newPath.reduce({});\n if (source.closed && ((source.clockwise && offset < 0) || (!source.clockwise && offset > 0))) {\n removeOutsiders(newPath, path);\n }\n // recovery path\n if (source.clockwise !== path.clockwise) {\n newPath.reverse();\n }\n return normalize(newPath);\n}\n\nfunction makeRoundCap(from: paper.Segment, to: paper.Segment, offset: number) {\n const origin = from.point.add(to.point).divide(2);\n const normal = to.point.subtract(from.point).rotate(-90, new paper.Point(0, 0)).normalize(offset);\n const through = origin.add(normal);\n const arc = new paper.Path.Arc({ from: from.point, to: to.point, through, insert: false });\n return arc.segments;\n}\n\nfunction connectSide(outer: PathType, inner: paper.Path, offset: number, cap: StrokeCapType): paper.Path {\n if (outer instanceof paper.CompoundPath) {\n let cs = outer.children.map((c) => ({ c, a: Math.abs((c as paper.Path).area) }));\n cs = cs.sort((c1, c2) => c2.a - c1.a);\n outer = cs[0].c as paper.Path;\n }\n const oSegments = (outer as paper.Path).segments.slice();\n const iSegments = inner.segments.slice();\n switch (cap) {\n case 'round':\n const heads = makeRoundCap(iSegments[iSegments.length - 1], oSegments[0], offset);\n const tails = makeRoundCap(oSegments[oSegments.length - 1], iSegments[0], offset);\n const result = new paper.Path({ segments: [...heads, ...oSegments, ...tails, ...iSegments], closed: true, insert: false });\n result.reduce({});\n return result;\n default: return new paper.Path({ segments: [...oSegments, ...iSegments], closed: true, insert: false });\n }\n}\n\nfunction offsetSimpleStroke(path: paper.Path, offset: number, join: StrokeJoinType, cap: StrokeCapType, limit: number): PathType {\n offset = path.clockwise ? offset : -offset;\n const positiveOffset = offsetSimpleShape(path, offset, join, limit);\n const negativeOffset = offsetSimpleShape(path, -offset, join, limit);\n if (path.closed) {\n return positiveOffset.subtract(negativeOffset, { insert: false }) as PathType;\n } else {\n let inner = negativeOffset;\n let holes = new Array<paper.Path>();\n if (negativeOffset instanceof paper.CompoundPath) {\n holes = negativeOffset.children.filter((c) => (c as paper.Path).closed) as paper.Path[];\n holes.forEach((h) => h.remove());\n inner = negativeOffset.children[0] as paper.Path;\n }\n inner.reverse();\n let final = connectSide(positiveOffset, inner as paper.Path, offset, cap) as PathType;\n if (holes.length > 0) {\n for (const hole of holes) {\n final = final.subtract(hole, { insert: false }) as PathType;\n }\n }\n return final;\n }\n}\n\nexport function offsetPath(path: PathType, offset: number, join: StrokeJoinType, limit: number): PathType {\n const nonSIPath = path.unite(path, { insert: false }) as PathType;\n let result = nonSIPath;\n if (nonSIPath instanceof paper.Path) {\n result = offsetSimpleShape(nonSIPath, offset, join, limit);\n } else {\n const children = Arrayex.Flat((nonSIPath.children as paper.Path[]).map((c) => {\n if (c.segments.length > 1) {\n if (!isSameDirection(c, path)) {\n c.reverse();\n }\n let offseted = offsetSimpleShape(c, offset, join, limit);\n offseted = normalize(offseted);\n if (offseted.clockwise !== c.clockwise) {\n offseted.reverse();\n }\n if (offseted instanceof paper.CompoundPath) {\n offseted.applyMatrix = true;\n return offseted.children;\n } else {\n return offseted;\n }\n } else {\n return null;\n }\n }), false);\n result = new paper.CompoundPath({ children, insert: false });\n }\n result.copyAttributes(nonSIPath, false);\n result.remove();\n return result;\n}\n\nexport function offsetStroke(path: PathType, offset: number, join: StrokeJoinType, cap: StrokeCapType, limit: number): PathType {\n const nonSIPath = path.unite(path, { insert: false }) as PathType;\n let result = nonSIPath as PathType;\n if (nonSIPath instanceof paper.Path) {\n result = offsetSimpleStroke(nonSIPath, offset, join, cap, limit);\n } else {\n const children = Arrayex.Flat((nonSIPath.children as paper.Path[]).map((c) => {\n return offsetSimpleStroke(c, offset, join, cap, limit);\n }));\n result = children.reduce((c1, c2) => c1.unite(c2, { insert: false }) as PathType);\n }\n result.strokeWidth = 0;\n result.fillColor = nonSIPath.strokeColor;\n result.shadowBlur = nonSIPath.shadowBlur;\n result.shadowColor = nonSIPath.shadowColor;\n result.shadowOffset = nonSIPath.shadowOffset;\n return result;\n}\n","import paper from 'paper';\nimport { StrokeJoinType, PathType, StrokeCapType, offsetPath, offsetStroke } from './offset';\n\nexport interface OffsetOptions {\n join?: StrokeJoinType;\n cap?: StrokeCapType;\n limit?: number;\n insert?: boolean;\n}\n\nexport class PaperOffset {\n public static offset(path: PathType, offset: number, options?: OffsetOptions): PathType {\n options = options || {};\n const newPath = offsetPath(path, offset, options.join || 'miter', options.limit || 10);\n if (options.insert === undefined) {\n options.insert = true;\n }\n if (options.insert) {\n (path.parent || paper.project.activeLayer).addChild(newPath);\n }\n return newPath;\n }\n\n public static offsetStroke(path: PathType, offset: number, options?: OffsetOptions): PathType {\n options = options || {};\n const newStroke = offsetStroke(path, offset, options.join || 'miter', options.cap || 'butt', options.limit || 10);\n if (options.insert === undefined) {\n options.insert = true;\n }\n if (options.insert) {\n (path.parent || paper.project.activeLayer).addChild(newStroke);\n }\n return newStroke;\n }\n}\n\n/**\n * @deprecated EXTEND existing paper module is not recommend anymore\n */\nexport default function ExtendPaperJs(paperNs: any) {\n paperNs.Path.prototype.offset = function(offset: number, options?: OffsetOptions) {\n return PaperOffset.offset(this, offset, options);\n };\n\n paperNs.Path.prototype.offsetStroke = function(offset: number, options?: OffsetOptions) {\n return PaperOffset.offsetStroke(this, offset, options);\n };\n\n paperNs.CompoundPath.prototype.offset = function(offset: number, options?: OffsetOptions) {\n return PaperOffset.offset(this, offset, options);\n };\n\n paperNs.CompoundPath.prototype.offsetStroke = function(offset: number, options?: OffsetOptions) {\n return PaperOffset.offsetStroke(this, offset, options);\n };\n}\n"],"names":[],"mappings":";;;AASA;;;;;;;AAOA,SAAS,aAAa,CAAC,OAAsB,EAAE,KAAkB,EAAE,YAAyB,EAAE,MAAc;IAC1G,IAAM,OAAO,GAAG,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC;;IAExC,IAAM,YAAY,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;;IAE/E,IAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC9C,IAAM,UAAU,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;;IAE5C,IAAM,MAAM,IAAI,OAAO,GAAG,WAAW,GAAG,UAAU,CAAe,CAAC;IAClE,UAAU,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;AAKA,SAAS,mBAAmB,CAAC,KAAkB,EAAE,MAAc;IAC7D,IAAM,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAU,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EACzG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,QAAS,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACpH,IAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IACvE,IAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;;IAEvE,IAAM,WAAW,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;;IAExD,IAAI,WAAW,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;QAC1D,IAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACrD,IAAM,SAAS,GAAG,WAAW,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;QACzF,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,EAAE;YACtD,IAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,QAAQ,IAAI,IAAI,EAAE;gBACpB,OAAW,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC,QAAK,mBAAmB,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE;aAC1F;SACF;KACF;IACD,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED;;;AAGA,SAAS,aAAa,CAAC,QAAuB,EAAE,QAAuB,EAAE,WAAwB,EAAE,MAAc;IAC/G,IAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;SAC3F,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAChD,IAAM,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,KAAK,EAAE,EAAE,EAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,SAAA,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IACrG,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC,YAAY,CAAC,SAAS,CAAC;IAChD,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC;IAC7C,OAAO,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;AAC5D,CAAC;AAED,SAAS,GAAG,CAAC,EAAe,EAAE,EAAe;IAC3C,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACnC,CAAC;AAED;;;AAGA,SAAS,yBAAyB,CAAC,EAAe,EAAE,EAAe,EAAE,EAAe,EAAE,EAAe;IACnG,IAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC3B,IAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC3B,IAAM,GAAG,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACxB,IAAM,GAAG,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACxB,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC/F,CAAC;AAED;;;;AAIA,SAAS,qBAAqB,CAAC,SAA0B,EAAE,SAA0B,EAAE,MAAqB,EAAE,QAAwB,EAAE,MAAc,EAAE,KAAa;IACnK,IAAM,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,IAAM,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,IAAM,YAAY,GAAG,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;IACrD,IAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpE,IAAI,MAAM,CAAC,QAAQ,EAAE,EAAE;QACrB,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,SAAU,CAAC,OAAO,CAAC,MAAM,CAAC,SAAU,CAAC,CAAC;QAC5E,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,QAAS,CAAC,OAAO,CAAC,MAAM,CAAC,QAAS,CAAC,CAAC;QACzE,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1E,SAAS,CAAC,GAAG,EAAE,CAAC;KACjB;SAAM;QACL,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE;YAC7B,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,EAAE;;gBAErC,QAAQ,QAAQ;oBACd,KAAK,OAAO;wBACV,IAAM,IAAI,GAAG,yBAAyB,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EACjG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;wBAEhE,IAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC9F,IAAI,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE;4BACzC,SAAS,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;yBACzC;wBACD,MAAM;oBACR,KAAK,OAAO;wBACV,IAAM,GAAG,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;wBAC5E,IAAI,GAAG,EAAE;4BACP,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBACrB;wBACD,MAAM;iBAET;aACF;iBAAM;gBACL,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAC9C,SAAS,CAAC,GAAG,EAAE,CAAC;aACjB;SACF;aAAM;YACL,IAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,OAAO,EAAE;gBACX,IAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC;gBAC9B,IAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpE,IAAI,CAAC,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC/E,SAAS,CAAC,GAAG,EAAE,CAAC;gBAChB,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;aACrB;iBAAM;gBACL,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAC9C,SAAS,CAAC,GAAG,EAAE,CAAC;aACjB;SACF;KACF;AACH,CAAC;AAED;;;AAGA,SAAS,cAAc,CAAC,WAA8B,EAAE,IAAoB,EAAE,MAAkB,EAAE,MAAc,EAAE,KAAa;IAC7H,IAAM,cAAc,GAAG,MAAM,CAAC,QAAQ,CAAC;IACvC,IAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;QAC/C,qBAAqB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;KACvG;IACD,IAAI,MAAM,CAAC,MAAM,EAAE;QACjB,qBAAqB,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1G,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KAC9B;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAS,6BAA6B,CAAC,IAAc;IACnD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;QAC9B,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAe,CAAC;QACtC,IAAI,CAAC,MAAM,EAAE,CAAC;KACf;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;AACA,SAAS,SAAS,CAAC,IAAc,EAAE,aAAoB;IAApB,8BAAA,EAAA,oBAAoB;IACrD,IAAI,IAAI,CAAC,MAAM,EAAE;QACf,IAAM,YAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC,CAAC;QACvD,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;YACnB,IAAI,CAAC,OAAO,EAAE,CAAC;SAChB;QACD,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAa,CAAC;QACvD,IAAI,IAAI,YAAY,KAAK,CAAC,YAAY,EAAE;YACtC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAC,CAAC,IAAK,OAAA,IAAI,CAAC,GAAG,CAAE,CAAc,CAAC,IAAI,CAAC,GAAG,YAAU,GAAA,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,EAAE,GAAA,CAAC,CAAC;YACpG,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;gBAC9B,OAAO,6BAA6B,CAAC,IAAI,CAAC,CAAC;aAC5C;SACF;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,WAAuB,EAAE,QAAkB;IAClE,IAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;IACxD,IAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC/G,IAAM,YAAY,GAAG,CAAC,OAAO,GAAG,OAAO,IAAI,CAAC,CAAC;IAC7C,IAAM,aAAa,GAAG,QAAQ,CAAC,kBAAkB,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/F,IAAM,aAAa,GAAG,QAAQ,CAAC,kBAAkB,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC;IACnG,OAAO,aAAa,GAAG,aAAa,CAAC;AACvC,CAAC;AAED;AACA,SAAS,kBAAkB,CAAC,IAAc;IACxC,IAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAa,CAAC;IAChE,IAAI,OAAO,YAAY,KAAK,CAAC,YAAY,EAAE;QACxC,OAAO,CAAC,QAAyB,CAAC,MAAM,CAAC,UAAC,CAAC;YAC1C,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;gBACzB,OAAO,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;aAClC;iBAAM;gBACL,OAAO,IAAI,CAAC;aACb;SACF,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,EAAE,GAAA,CAAC,CAAC;QAC9B,OAAO,6BAA6B,CAAC,OAAO,CAAC,CAAC;KAC/C;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAAC,IAAc;IACjC,IAAI,IAAI,YAAY,KAAK,CAAC,YAAY,EAAE;QACtC,OAAO,OAAO,CAAC,IAAI,CAAgB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,OAAC,CAAgB,CAAC,QAAQ,GAAA,CAAC,CAAC,CAAC;KAC1F;SAAM;QACL,OAAQ,IAAmB,CAAC,QAAQ,CAAC;KACtC;AACH,CAAC;AAED;;;AAGA,SAAS,eAAe,CAAC,OAAiB,EAAE,IAAc;IACxD,IAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;IAC9C,QAAQ,CAAC,OAAO,CAAC,UAAC,OAAO;QACvB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACjC,OAAO,CAAC,MAAM,EAAE,CAAC;SAClB;KACF,CAAC,CAAC;AACL,CAAC;AAED,SAAS,WAAW,CAAC,IAAgB,EAAE,MAAc;IACnD,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAe,CAAC;IAC3D,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAClB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;QACnB,MAAM,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,GAAG,CAAC,MAAM,CAAC;KAClB;IACD,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAgB,EAAE,MAAc,EAAE,IAAoB,EAAE,KAAa;;IAC9F,IAAI,MAAkB,CAAC;IACvB,8BAA4C,EAA3C,cAAM,EAAE,cAAM,CAA8B;IAC7C,IAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACrC,IAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAgB,MAAM,CAAC,GAAG,CAAC,UAAC,KAAK,IAAK,OAAA,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC,GAAA,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvH,IAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IACjF,IAAM,OAAO,GAAG,kBAAkB,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,UAAA,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACrG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,SAAS,IAAI,MAAM,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;QAC5F,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;KAChC;;IAED,IAAI,MAAM,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,EAAE;QACvC,OAAO,CAAC,OAAO,EAAE,CAAC;KACnB;IACD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,YAAY,CAAC,IAAmB,EAAE,EAAiB,EAAE,MAAc;IAC1E,IAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClD,IAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAClG,IAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACnC,IAAM,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,OAAO,SAAA,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IAC3F,OAAO,GAAG,CAAC,QAAQ,CAAC;AACtB,CAAC;AAED,SAAS,WAAW,CAAC,KAAe,EAAE,KAAiB,EAAE,MAAc,EAAE,GAAkB;IACzF,IAAI,KAAK,YAAY,KAAK,CAAC,YAAY,EAAE;QACvC,IAAI,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAC,CAAC,IAAK,QAAC,EAAE,CAAC,GAAA,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAE,CAAgB,CAAC,IAAI,CAAC,EAAE,IAAC,CAAC,CAAC;QACjF,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,UAAC,EAAE,EAAE,EAAE,IAAK,OAAA,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAA,CAAC,CAAC;QACtC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAe,CAAC;KAC/B;IACD,IAAM,SAAS,GAAI,KAAoB,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACzD,IAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACzC,QAAQ,GAAG;QACT,KAAK,OAAO;YACV,IAAM,KAAK,GAAG,YAAY,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAClF,IAAM,KAAK,GAAG,YAAY,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAClF,IAAM,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAM,KAAK,QAAK,SAAS,EAAK,KAAK,EAAK,SAAS,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3H,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAClB,OAAO,MAAM,CAAC;QAChB,SAAS,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAM,SAAS,QAAK,SAAS,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;KACzG;AACH,CAAC;AAED,SAAS,kBAAkB,CAAC,IAAgB,EAAE,MAAc,EAAE,IAAoB,EAAE,GAAkB,EAAE,KAAa;IACnH,MAAM,GAAG,IAAI,CAAC,SAAS,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC;IAC3C,IAAM,cAAc,GAAG,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACpE,IAAM,cAAc,GAAG,iBAAiB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACrE,IAAI,IAAI,CAAC,MAAM,EAAE;QACf,OAAO,cAAc,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAa,CAAC;KAC/E;SAAM;QACL,IAAI,KAAK,GAAG,cAAc,CAAC;QAC3B,IAAI,KAAK,GAAG,IAAI,KAAK,EAAc,CAAC;QACpC,IAAI,cAAc,YAAY,KAAK,CAAC,YAAY,EAAE;YAChD,KAAK,GAAG,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAC,CAAC,IAAK,OAAC,CAAgB,CAAC,MAAM,GAAA,CAAiB,CAAC;YACxF,KAAK,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,CAAC,CAAC,MAAM,EAAE,GAAA,CAAC,CAAC;YACjC,KAAK,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAe,CAAC;SAClD;QACD,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,IAAI,KAAK,GAAG,WAAW,CAAC,cAAc,EAAE,KAAmB,EAAE,MAAM,EAAE,GAAG,CAAa,CAAC;QACtF,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACpB,KAAmB,UAAK,EAAL,eAAK,EAAL,mBAAK,EAAL,IAAK,EAAE;gBAArB,IAAM,IAAI,cAAA;gBACb,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAa,CAAC;aAC7D;SACF;QACD,OAAO,KAAK,CAAC;KACd;AACH,CAAC;SAEe,UAAU,CAAC,IAAc,EAAE,MAAc,EAAE,IAAoB,EAAE,KAAa;IAC5F,IAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAa,CAAC;IAClE,IAAI,MAAM,GAAG,SAAS,CAAC;IACvB,IAAI,SAAS,YAAY,KAAK,CAAC,IAAI,EAAE;QACnC,MAAM,GAAG,iBAAiB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;KAC5D;SAAM;QACL,IAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAE,SAAS,CAAC,QAAyB,CAAC,GAAG,CAAC,UAAC,CAAC;YACvE,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;gBACzB,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE;oBAC7B,CAAC,CAAC,OAAO,EAAE,CAAC;iBACb;gBACD,IAAI,QAAQ,GAAG,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;gBACzD,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;gBAC/B,IAAI,QAAQ,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,EAAE;oBACtC,QAAQ,CAAC,OAAO,EAAE,CAAC;iBACpB;gBACD,IAAI,QAAQ,YAAY,KAAK,CAAC,YAAY,EAAE;oBAC1C,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC;oBAC5B,OAAO,QAAQ,CAAC,QAAQ,CAAC;iBAC1B;qBAAM;oBACL,OAAO,QAAQ,CAAC;iBACjB;aACF;iBAAM;gBACL,OAAO,IAAI,CAAC;aACb;SACF,CAAC,EAAE,KAAK,CAAC,CAAC;QACX,MAAM,GAAG,IAAI,KAAK,CAAC,YAAY,CAAC,EAAE,QAAQ,UAAA,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;KAC9D;IACD,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACxC,MAAM,CAAC,MAAM,EAAE,CAAC;IAChB,OAAO,MAAM,CAAC;AAChB,CAAC;SAEe,YAAY,CAAC,IAAc,EAAE,MAAc,EAAE,IAAoB,EAAE,GAAkB,EAAE,KAAa;IAClH,IAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAa,CAAC;IAClE,IAAI,MAAM,GAAG,SAAqB,CAAC;IACnC,IAAI,SAAS,YAAY,KAAK,CAAC,IAAI,EAAE;QACnC,MAAM,GAAG,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;KAClE;SAAM;QACL,IAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAE,SAAS,CAAC,QAAyB,CAAC,GAAG,CAAC,UAAC,CAAC;YACvE,OAAO,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;SACxD,CAAC,CAAC,CAAC;QACJ,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,UAAC,EAAE,EAAE,EAAE,IAAK,OAAA,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAa,GAAA,CAAC,CAAC;KACnF;IACD,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;IACvB,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC,WAAW,CAAC;IACzC,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;IACzC,MAAM,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IAC3C,MAAM,CAAC,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC;IAC7C,OAAO,MAAM,CAAC;AAChB;;;ICzVA;KAwBC;IAvBe,kBAAM,GAApB,UAAqB,IAAc,EAAE,MAAc,EAAE,OAAuB;QAC1E,OAAO,GAAG,OAAO,IAAI,EAAE,CAAC;QACxB,IAAM,OAAO,GAAG,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,OAAO,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QACvF,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE;YAChC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;SACvB;QACD,IAAI,OAAO,CAAC,MAAM,EAAE;YAClB,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;SAC9D;QACD,OAAO,OAAO,CAAC;KAChB;IAEa,wBAAY,GAA1B,UAA2B,IAAc,EAAE,MAAc,EAAE,OAAuB;QAChF,OAAO,GAAG,OAAO,IAAI,EAAE,CAAC;QACxB,IAAM,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,MAAM,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAClH,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE;YAChC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;SACvB;QACD,IAAI,OAAO,CAAC,MAAM,EAAE;YAClB,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;SAChE;QACD,OAAO,SAAS,CAAC;KAClB;IACH,kBAAC;AAAD,CAAC,IAAA;AAED;;;AAGA,SAAwB,aAAa,CAAC,OAAY;IAChD,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,MAAc,EAAE,OAAuB;QAC9E,OAAO,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;KAClD,CAAC;IAEF,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,UAAS,MAAc,EAAE,OAAuB;QACpF,OAAO,WAAW,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;KACxD,CAAC;IAEF,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,MAAc,EAAE,OAAuB;QACtF,OAAO,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;KAClD,CAAC;IAEF,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,YAAY,GAAG,UAAS,MAAc,EAAE,OAAuB;QAC5F,OAAO,WAAW,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;KACxD,CAAC;AACJ,CAAC;;;;;"}
|
package/dist/lib/bundle.js
DELETED
|
@@ -1,10 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
var paper_1 = require("paper");
|
|
4
|
-
var index_1 = require("./index");
|
|
5
|
-
index_1.default(paper_1.default);
|
|
6
|
-
window.PaperOffset = {
|
|
7
|
-
offset: index_1.PaperOffset.offset,
|
|
8
|
-
offsetStroke: index_1.PaperOffset.offsetStroke,
|
|
9
|
-
};
|
|
10
|
-
//# sourceMappingURL=bundle.js.map
|
package/dist/lib/bundle.js.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"bundle.js","sourceRoot":"","sources":["../../src/bundle.ts"],"names":[],"mappings":";;AAAA,+BAA0B;AAC1B,iCAAqD;AAErD,eAAa,CAAC,eAAK,CAAC,CAAC;AAWrB,MAAM,CAAC,WAAW,GAAG;IACnB,MAAM,EAAE,mBAAW,CAAC,MAAM;IAC1B,YAAY,EAAE,mBAAW,CAAC,YAAY;CACvC,CAAC"}
|
package/dist/lib/index.js
DELETED
|
@@ -1,51 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
var paper_1 = require("paper");
|
|
4
|
-
var offset_1 = require("./offset");
|
|
5
|
-
var PaperOffset = /** @class */ (function () {
|
|
6
|
-
function PaperOffset() {
|
|
7
|
-
}
|
|
8
|
-
PaperOffset.offset = function (path, offset, options) {
|
|
9
|
-
options = options || {};
|
|
10
|
-
var newPath = offset_1.offsetPath(path, offset, options.join || 'miter', options.limit || 10);
|
|
11
|
-
if (options.insert === undefined) {
|
|
12
|
-
options.insert = true;
|
|
13
|
-
}
|
|
14
|
-
if (options.insert) {
|
|
15
|
-
(path.parent || paper_1.default.project.activeLayer).addChild(newPath);
|
|
16
|
-
}
|
|
17
|
-
return newPath;
|
|
18
|
-
};
|
|
19
|
-
PaperOffset.offsetStroke = function (path, offset, options) {
|
|
20
|
-
options = options || {};
|
|
21
|
-
var newStroke = offset_1.offsetStroke(path, offset, options.join || 'miter', options.cap || 'butt', options.limit || 10);
|
|
22
|
-
if (options.insert === undefined) {
|
|
23
|
-
options.insert = true;
|
|
24
|
-
}
|
|
25
|
-
if (options.insert) {
|
|
26
|
-
(path.parent || paper_1.default.project.activeLayer).addChild(newStroke);
|
|
27
|
-
}
|
|
28
|
-
return newStroke;
|
|
29
|
-
};
|
|
30
|
-
return PaperOffset;
|
|
31
|
-
}());
|
|
32
|
-
exports.PaperOffset = PaperOffset;
|
|
33
|
-
/**
|
|
34
|
-
* @deprecated EXTEND existing paper module is not recommend anymore
|
|
35
|
-
*/
|
|
36
|
-
function ExtendPaperJs(paperNs) {
|
|
37
|
-
paperNs.Path.prototype.offset = function (offset, options) {
|
|
38
|
-
return PaperOffset.offset(this, offset, options);
|
|
39
|
-
};
|
|
40
|
-
paperNs.Path.prototype.offsetStroke = function (offset, options) {
|
|
41
|
-
return PaperOffset.offsetStroke(this, offset, options);
|
|
42
|
-
};
|
|
43
|
-
paperNs.CompoundPath.prototype.offset = function (offset, options) {
|
|
44
|
-
return PaperOffset.offset(this, offset, options);
|
|
45
|
-
};
|
|
46
|
-
paperNs.CompoundPath.prototype.offsetStroke = function (offset, options) {
|
|
47
|
-
return PaperOffset.offsetStroke(this, offset, options);
|
|
48
|
-
};
|
|
49
|
-
}
|
|
50
|
-
exports.default = ExtendPaperJs;
|
|
51
|
-
//# sourceMappingURL=index.js.map
|
package/dist/lib/index.js.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;AAAA,+BAA0B;AAC1B,mCAA6F;AAS7F;IAAA;IAwBA,CAAC;IAvBe,kBAAM,GAApB,UAAqB,IAAc,EAAE,MAAc,EAAE,OAAuB;QAC1E,OAAO,GAAG,OAAO,IAAI,EAAE,CAAC;QACxB,IAAM,OAAO,GAAG,mBAAU,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,OAAO,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QACvF,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE;YAChC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;SACvB;QACD,IAAI,OAAO,CAAC,MAAM,EAAE;YAClB,CAAC,IAAI,CAAC,MAAM,IAAI,eAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;SAC9D;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEa,wBAAY,GAA1B,UAA2B,IAAc,EAAE,MAAc,EAAE,OAAuB;QAChF,OAAO,GAAG,OAAO,IAAI,EAAE,CAAC;QACxB,IAAM,SAAS,GAAG,qBAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,MAAM,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAClH,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE;YAChC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;SACvB;QACD,IAAI,OAAO,CAAC,MAAM,EAAE;YAClB,CAAC,IAAI,CAAC,MAAM,IAAI,eAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;SAChE;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACH,kBAAC;AAAD,CAAC,AAxBD,IAwBC;AAxBY,kCAAW;AA0BxB;;GAEG;AACH,SAAwB,aAAa,CAAC,OAAY;IAChD,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,MAAc,EAAE,OAAuB;QAC9E,OAAO,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACnD,CAAC,CAAC;IAEF,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,UAAS,MAAc,EAAE,OAAuB;QACpF,OAAO,WAAW,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC,CAAC;IAEF,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,MAAc,EAAE,OAAuB;QACtF,OAAO,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACnD,CAAC,CAAC;IAEF,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,YAAY,GAAG,UAAS,MAAc,EAAE,OAAuB;QAC5F,OAAO,WAAW,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC,CAAC;AACJ,CAAC;AAhBD,gCAgBC"}
|