mirror of
https://github.com/scratchfoundation/paper.js.git
synced 2025-01-06 04:42:15 -05:00
Prebuilt module for commit a683486ff5
This commit is contained in:
parent
b78457abc7
commit
c626bbc061
5 changed files with 43 additions and 52 deletions
29
dist/docs/assets/js/paper.js
vendored
29
dist/docs/assets/js/paper.js
vendored
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Wed Jul 20 16:15:10 2016 +0200
|
||||
* Date: Wed Jul 20 16:32:21 2016 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
@ -9606,25 +9606,12 @@ PathItem.inject(new function() {
|
|||
_path2.reverse();
|
||||
var crossings = divideLocations(
|
||||
CurveLocation.expand(_path1.getCrossings(_path2))),
|
||||
segments = [],
|
||||
curves = [],
|
||||
paths1 = _path1._children || [_path1],
|
||||
paths2 = _path2 && (_path2._children || [_path2]),
|
||||
segments = [],
|
||||
curves = [],
|
||||
paths;
|
||||
|
||||
function collect(paths) {
|
||||
for (var i = 0, l = paths.length; i < l; i++) {
|
||||
var path = paths[i];
|
||||
segments.push.apply(segments, path._segments);
|
||||
curves.push.apply(curves, path.getCurves());
|
||||
path._overlapsOnly = path._validOverlapsOnly = true;
|
||||
}
|
||||
}
|
||||
|
||||
function contains(paths1, paths2) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (!crossings.length) {
|
||||
var ok = true;
|
||||
if (paths2) {
|
||||
|
@ -9644,6 +9631,16 @@ PathItem.inject(new function() {
|
|||
: null;
|
||||
}
|
||||
}
|
||||
|
||||
function collect(paths) {
|
||||
for (var i = 0, l = paths.length; i < l; i++) {
|
||||
var path = paths[i];
|
||||
segments.push.apply(segments, path._segments);
|
||||
curves.push.apply(curves, path.getCurves());
|
||||
path._overlapsOnly = path._validOverlapsOnly = true;
|
||||
}
|
||||
}
|
||||
|
||||
if (!paths) {
|
||||
collect(paths1);
|
||||
if (paths2)
|
||||
|
|
29
dist/paper-core.js
vendored
29
dist/paper-core.js
vendored
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Wed Jul 20 16:15:10 2016 +0200
|
||||
* Date: Wed Jul 20 16:32:21 2016 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
@ -9606,25 +9606,12 @@ PathItem.inject(new function() {
|
|||
_path2.reverse();
|
||||
var crossings = divideLocations(
|
||||
CurveLocation.expand(_path1.getCrossings(_path2))),
|
||||
segments = [],
|
||||
curves = [],
|
||||
paths1 = _path1._children || [_path1],
|
||||
paths2 = _path2 && (_path2._children || [_path2]),
|
||||
segments = [],
|
||||
curves = [],
|
||||
paths;
|
||||
|
||||
function collect(paths) {
|
||||
for (var i = 0, l = paths.length; i < l; i++) {
|
||||
var path = paths[i];
|
||||
segments.push.apply(segments, path._segments);
|
||||
curves.push.apply(curves, path.getCurves());
|
||||
path._overlapsOnly = path._validOverlapsOnly = true;
|
||||
}
|
||||
}
|
||||
|
||||
function contains(paths1, paths2) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (!crossings.length) {
|
||||
var ok = true;
|
||||
if (paths2) {
|
||||
|
@ -9644,6 +9631,16 @@ PathItem.inject(new function() {
|
|||
: null;
|
||||
}
|
||||
}
|
||||
|
||||
function collect(paths) {
|
||||
for (var i = 0, l = paths.length; i < l; i++) {
|
||||
var path = paths[i];
|
||||
segments.push.apply(segments, path._segments);
|
||||
curves.push.apply(curves, path.getCurves());
|
||||
path._overlapsOnly = path._validOverlapsOnly = true;
|
||||
}
|
||||
}
|
||||
|
||||
if (!paths) {
|
||||
collect(paths1);
|
||||
if (paths2)
|
||||
|
|
4
dist/paper-core.min.js
vendored
4
dist/paper-core.min.js
vendored
File diff suppressed because one or more lines are too long
29
dist/paper-full.js
vendored
29
dist/paper-full.js
vendored
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Wed Jul 20 16:15:10 2016 +0200
|
||||
* Date: Wed Jul 20 16:32:21 2016 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
@ -9606,25 +9606,12 @@ PathItem.inject(new function() {
|
|||
_path2.reverse();
|
||||
var crossings = divideLocations(
|
||||
CurveLocation.expand(_path1.getCrossings(_path2))),
|
||||
segments = [],
|
||||
curves = [],
|
||||
paths1 = _path1._children || [_path1],
|
||||
paths2 = _path2 && (_path2._children || [_path2]),
|
||||
segments = [],
|
||||
curves = [],
|
||||
paths;
|
||||
|
||||
function collect(paths) {
|
||||
for (var i = 0, l = paths.length; i < l; i++) {
|
||||
var path = paths[i];
|
||||
segments.push.apply(segments, path._segments);
|
||||
curves.push.apply(curves, path.getCurves());
|
||||
path._overlapsOnly = path._validOverlapsOnly = true;
|
||||
}
|
||||
}
|
||||
|
||||
function contains(paths1, paths2) {
|
||||
return false;
|
||||
}
|
||||
|
||||
if (!crossings.length) {
|
||||
var ok = true;
|
||||
if (paths2) {
|
||||
|
@ -9644,6 +9631,16 @@ PathItem.inject(new function() {
|
|||
: null;
|
||||
}
|
||||
}
|
||||
|
||||
function collect(paths) {
|
||||
for (var i = 0, l = paths.length; i < l; i++) {
|
||||
var path = paths[i];
|
||||
segments.push.apply(segments, path._segments);
|
||||
curves.push.apply(curves, path.getCurves());
|
||||
path._overlapsOnly = path._validOverlapsOnly = true;
|
||||
}
|
||||
}
|
||||
|
||||
if (!paths) {
|
||||
collect(paths1);
|
||||
if (paths2)
|
||||
|
|
4
dist/paper-full.min.js
vendored
4
dist/paper-full.min.js
vendored
File diff suppressed because one or more lines are too long
Loading…
Reference in a new issue