scratchfoundation/paper.js
1
0
Fork 0
mirror of https://github.com/scratchfoundation/paper.js.git synced 2025-01-20 22:39:50 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

Prebuilt module for commit 693898a5b1

Browse source
This commit is contained in:
Paper.js Bot 2016-06-13 10:52:30 +00:00
parent 293a085d61
commit 78e1d6a886
5 changed files with 22 additions and 37 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

17
dist/docs/assets/js/paper.js vendored
View file

@ -9,7 +9,7 @@
*
* All rights reserved.
*
* Date: Mon Jun 13 12:13:42 2016 +0200
* Date: Mon Jun 13 12:49:57 2016 +0200
*
***
*
@ -9757,7 +9757,7 @@ PathItem.inject(new function() {
return seg === start || seg === otherStart;
}
function findBestIntersection(inter, exclude, strict) {
function findBestIntersection(inter, exclude) {
if (!inter._next)
return inter;
while (inter) {
@ -9766,13 +9766,9 @@ PathItem.inject(new function() {
nextInter = nextSeg._intersection;
if (seg !== exclude && (isStart(seg) || isStart(nextSeg)
|| !seg._visited && !nextSeg._visited
&& (!operator
|| isValid(seg)
&& (!(strict && nextInter && nextInter._overlap)
&& isValid(nextSeg)
|| !strict && nextInter
&& isValid(nextInter._segment))
)))
&& (!operator || isValid(seg) && (isValid(nextSeg)
|| nextInter && isValid(nextInter._segment)))
))
return inter;
inter = inter._next;
}
@ -9805,8 +9801,7 @@ PathItem.inject(new function() {
continue;
start = otherStart = null;
while (true) {
inter = inter && (findBestIntersection(inter, seg, true)
|| findBestIntersection(inter, seg, false)) || inter;
inter = inter && findBestIntersection(inter, seg) || inter;
var other = inter && inter._segment;
if (isStart(seg)) {
finished = true;

17
dist/paper-core.js vendored
View file

@ -9,7 +9,7 @@
*
* All rights reserved.
*
* Date: Mon Jun 13 12:13:42 2016 +0200
* Date: Mon Jun 13 12:49:57 2016 +0200
*
***
*
@ -9757,7 +9757,7 @@ PathItem.inject(new function() {
return seg === start || seg === otherStart;
}
function findBestIntersection(inter, exclude, strict) {
function findBestIntersection(inter, exclude) {
if (!inter._next)
return inter;
while (inter) {
@ -9766,13 +9766,9 @@ PathItem.inject(new function() {
nextInter = nextSeg._intersection;
if (seg !== exclude && (isStart(seg) || isStart(nextSeg)
|| !seg._visited && !nextSeg._visited
&& (!operator
|| isValid(seg)
&& (!(strict && nextInter && nextInter._overlap)
&& isValid(nextSeg)
|| !strict && nextInter
&& isValid(nextInter._segment))
)))
&& (!operator || isValid(seg) && (isValid(nextSeg)
|| nextInter && isValid(nextInter._segment)))
))
return inter;
inter = inter._next;
}
@ -9805,8 +9801,7 @@ PathItem.inject(new function() {
continue;
start = otherStart = null;
while (true) {
inter = inter && (findBestIntersection(inter, seg, true)
|| findBestIntersection(inter, seg, false)) || inter;
inter = inter && findBestIntersection(inter, seg) || inter;
var other = inter && inter._segment;
if (isStart(seg)) {
finished = true;

4
dist/paper-core.min.js vendored
View file

File diff suppressed because one or more lines are too long

17
dist/paper-full.js vendored
View file

@ -9,7 +9,7 @@
*
* All rights reserved.
*
* Date: Mon Jun 13 12:13:42 2016 +0200
* Date: Mon Jun 13 12:49:57 2016 +0200
*
***
*
@ -9757,7 +9757,7 @@ PathItem.inject(new function() {
return seg === start || seg === otherStart;
}
function findBestIntersection(inter, exclude, strict) {
function findBestIntersection(inter, exclude) {
if (!inter._next)
return inter;
while (inter) {
@ -9766,13 +9766,9 @@ PathItem.inject(new function() {
nextInter = nextSeg._intersection;
if (seg !== exclude && (isStart(seg) || isStart(nextSeg)
|| !seg._visited && !nextSeg._visited
&& (!operator
|| isValid(seg)
&& (!(strict && nextInter && nextInter._overlap)
&& isValid(nextSeg)
|| !strict && nextInter
&& isValid(nextInter._segment))
)))
&& (!operator || isValid(seg) && (isValid(nextSeg)
|| nextInter && isValid(nextInter._segment)))
))
return inter;
inter = inter._next;
}
@ -9805,8 +9801,7 @@ PathItem.inject(new function() {
continue;
start = otherStart = null;
while (true) {
inter = inter && (findBestIntersection(inter, seg, true)
|| findBestIntersection(inter, seg, false)) || inter;
inter = inter && findBestIntersection(inter, seg) || inter;
var other = inter && inter._segment;
if (isStart(seg)) {
finished = true;

4
dist/paper-full.min.js vendored
View file

File diff suppressed because one or more lines are too long