mirror of
https://github.com/scratchfoundation/paper.js.git
synced 2025-01-05 20:32:00 -05:00
Prebuilt module for commit bba70907e7
This commit is contained in:
Paper.js Bot
parent
e93cd31fa5
commit
c6b943b428
6 changed files with 40 additions and 28 deletions
18
dist/docs/assets/js/paper.js
vendored
18
dist/docs/assets/js/paper.js
vendored
|
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Sun Jun 23 04:48:05 2019 +0200
|
||||
* Date: Sun Jun 23 10:27:31 2019 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
|
@ -7705,8 +7705,8 @@ var CurveLocation = Base.extend({
|
|||
|
||||
function isInRange(angle, min, max) {
|
||||
return min < max
|
||||
? angle > min && angle <= max
|
||||
: angle > min || angle <= max;
|
||||
? angle > min && angle < max
|
||||
: angle > min || angle < max;
|
||||
}
|
||||
|
||||
if (!t1Inside) {
|
||||
|
|
@ -7996,7 +7996,7 @@ var PathItem = Item.extend({
|
|||
|
||||
getCrossings: function(path) {
|
||||
return this.getIntersections(path, function(inter) {
|
||||
return inter.hasOverlap() || inter.isCrossing();
|
||||
return inter.isCrossing();
|
||||
});
|
||||
},
|
||||
|
||||
|
|
@ -10090,6 +10090,10 @@ PathItem.inject(new function() {
|
|||
return result;
|
||||
}
|
||||
|
||||
function filterIntersection(inter) {
|
||||
return inter.hasOverlap() || inter.isCrossing();
|
||||
}
|
||||
|
||||
function traceBoolean(path1, path2, operation, options) {
|
||||
if (options && (options.trace == false || options.stroke) &&
|
||||
/^(subtract|intersect)$/.test(operation))
|
||||
|
|
@ -10101,8 +10105,8 @@ PathItem.inject(new function() {
|
|||
if (_path2 && (operator.subtract || operator.exclude)
|
||||
^ (_path2.isClockwise() ^ _path1.isClockwise()))
|
||||
_path2.reverse();
|
||||
var crossings = divideLocations(
|
||||
CurveLocation.expand(_path1.getCrossings(_path2))),
|
||||
var crossings = divideLocations(CurveLocation.expand(
|
||||
_path1.getIntersections(_path2, filterIntersection))),
|
||||
paths1 = getPaths(_path1),
|
||||
paths2 = _path2 && getPaths(_path2),
|
||||
segments = [],
|
||||
|
|
@ -10150,7 +10154,7 @@ PathItem.inject(new function() {
|
|||
function splitBoolean(path1, path2, operation) {
|
||||
var _path1 = preparePath(path1),
|
||||
_path2 = preparePath(path2),
|
||||
crossings = _path1.getCrossings(_path2),
|
||||
crossings = _path1.getIntersections(_path2, filterIntersection),
|
||||
subtract = operation === 'subtract',
|
||||
divide = operation === 'divide',
|
||||
added = {},
|
||||
|
|
|
|||
18
dist/paper-core.js
vendored
18
dist/paper-core.js
vendored
|
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Sun Jun 23 04:48:05 2019 +0200
|
||||
* Date: Sun Jun 23 10:27:31 2019 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
|
@ -7702,8 +7702,8 @@ var CurveLocation = Base.extend({
|
|||
|
||||
function isInRange(angle, min, max) {
|
||||
return min < max
|
||||
? angle > min && angle <= max
|
||||
: angle > min || angle <= max;
|
||||
? angle > min && angle < max
|
||||
: angle > min || angle < max;
|
||||
}
|
||||
|
||||
if (!t1Inside) {
|
||||
|
|
@ -7993,7 +7993,7 @@ var PathItem = Item.extend({
|
|||
|
||||
getCrossings: function(path) {
|
||||
return this.getIntersections(path, function(inter) {
|
||||
return inter.hasOverlap() || inter.isCrossing();
|
||||
return inter.isCrossing();
|
||||
});
|
||||
},
|
||||
|
||||
|
|
@ -10087,6 +10087,10 @@ PathItem.inject(new function() {
|
|||
return result;
|
||||
}
|
||||
|
||||
function filterIntersection(inter) {
|
||||
return inter.hasOverlap() || inter.isCrossing();
|
||||
}
|
||||
|
||||
function traceBoolean(path1, path2, operation, options) {
|
||||
if (options && (options.trace == false || options.stroke) &&
|
||||
/^(subtract|intersect)$/.test(operation))
|
||||
|
|
@ -10098,8 +10102,8 @@ PathItem.inject(new function() {
|
|||
if (_path2 && (operator.subtract || operator.exclude)
|
||||
^ (_path2.isClockwise() ^ _path1.isClockwise()))
|
||||
_path2.reverse();
|
||||
var crossings = divideLocations(
|
||||
CurveLocation.expand(_path1.getCrossings(_path2))),
|
||||
var crossings = divideLocations(CurveLocation.expand(
|
||||
_path1.getIntersections(_path2, filterIntersection))),
|
||||
paths1 = getPaths(_path1),
|
||||
paths2 = _path2 && getPaths(_path2),
|
||||
segments = [],
|
||||
|
|
@ -10147,7 +10151,7 @@ PathItem.inject(new function() {
|
|||
function splitBoolean(path1, path2, operation) {
|
||||
var _path1 = preparePath(path1),
|
||||
_path2 = preparePath(path2),
|
||||
crossings = _path1.getCrossings(_path2),
|
||||
crossings = _path1.getIntersections(_path2, filterIntersection),
|
||||
subtract = operation === 'subtract',
|
||||
divide = operation === 'divide',
|
||||
added = {},
|
||||
|
|
|
|||
6
dist/paper-core.min.js
vendored
6
dist/paper-core.min.js
vendored
File diff suppressed because one or more lines are too long
18
dist/paper-full.js
vendored
18
dist/paper-full.js
vendored
|
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Sun Jun 23 04:48:05 2019 +0200
|
||||
* Date: Sun Jun 23 10:27:31 2019 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
|
@ -7705,8 +7705,8 @@ var CurveLocation = Base.extend({
|
|||
|
||||
function isInRange(angle, min, max) {
|
||||
return min < max
|
||||
? angle > min && angle <= max
|
||||
: angle > min || angle <= max;
|
||||
? angle > min && angle < max
|
||||
: angle > min || angle < max;
|
||||
}
|
||||
|
||||
if (!t1Inside) {
|
||||
|
|
@ -7996,7 +7996,7 @@ var PathItem = Item.extend({
|
|||
|
||||
getCrossings: function(path) {
|
||||
return this.getIntersections(path, function(inter) {
|
||||
return inter.hasOverlap() || inter.isCrossing();
|
||||
return inter.isCrossing();
|
||||
});
|
||||
},
|
||||
|
||||
|
|
@ -10090,6 +10090,10 @@ PathItem.inject(new function() {
|
|||
return result;
|
||||
}
|
||||
|
||||
function filterIntersection(inter) {
|
||||
return inter.hasOverlap() || inter.isCrossing();
|
||||
}
|
||||
|
||||
function traceBoolean(path1, path2, operation, options) {
|
||||
if (options && (options.trace == false || options.stroke) &&
|
||||
/^(subtract|intersect)$/.test(operation))
|
||||
|
|
@ -10101,8 +10105,8 @@ PathItem.inject(new function() {
|
|||
if (_path2 && (operator.subtract || operator.exclude)
|
||||
^ (_path2.isClockwise() ^ _path1.isClockwise()))
|
||||
_path2.reverse();
|
||||
var crossings = divideLocations(
|
||||
CurveLocation.expand(_path1.getCrossings(_path2))),
|
||||
var crossings = divideLocations(CurveLocation.expand(
|
||||
_path1.getIntersections(_path2, filterIntersection))),
|
||||
paths1 = getPaths(_path1),
|
||||
paths2 = _path2 && getPaths(_path2),
|
||||
segments = [],
|
||||
|
|
@ -10150,7 +10154,7 @@ PathItem.inject(new function() {
|
|||
function splitBoolean(path1, path2, operation) {
|
||||
var _path1 = preparePath(path1),
|
||||
_path2 = preparePath(path2),
|
||||
crossings = _path1.getCrossings(_path2),
|
||||
crossings = _path1.getIntersections(_path2, filterIntersection),
|
||||
subtract = operation === 'subtract',
|
||||
divide = operation === 'divide',
|
||||
added = {},
|
||||
|
|
|
|||
6
dist/paper-full.min.js
vendored
6
dist/paper-full.min.js
vendored
File diff suppressed because one or more lines are too long
2
dist/paper.d.ts
vendored
2
dist/paper.d.ts
vendored
|
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Sun Jun 23 04:48:05 2019 +0200
|
||||
* Date: Sun Jun 23 10:27:31 2019 +0200
|
||||
*
|
||||
* This is an auto-generated type definition.
|
||||
*/
|
||||
|
|
|
|||
Loading…
Reference in a new issue