mirror of
https://github.com/scratchfoundation/paper.js.git
synced 2025-03-13 16:33:28 -04:00
Prebuilt module for commit 999e8fe4d9
This commit is contained in:
parent
fc500dc38e
commit
c7990fe5f3
5 changed files with 20 additions and 23 deletions
9
dist/docs/assets/js/paper.js
vendored
9
dist/docs/assets/js/paper.js
vendored
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Tue May 31 12:35:44 2016 +0200
|
||||
* Date: Fri Jun 10 10:24:19 2016 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
@ -10057,16 +10057,15 @@ Path.inject({
|
|||
for (var i = 0, l = curves.length; i < l; i++) {
|
||||
var values = curves[i].values;
|
||||
if ((curves[i].winding === 1
|
||||
&& y >= values[1] && y <= values[7]
|
||||
|| y >= values[7] && y <= values[1])) {
|
||||
&& y > values[1] && y <= values[7]
|
||||
|| y >= values[7] && y < values[1])) {
|
||||
var count = Curve.solveCubic(values, 1, y, roots, 0, 1);
|
||||
for (var j = count - 1; j >= 0; j--) {
|
||||
intercepts.push(Curve.getPoint(values, roots[j]).x);
|
||||
}
|
||||
}
|
||||
if (intercepts.length > 1)
|
||||
break;
|
||||
}
|
||||
intercepts.sort(function(a, b) {return a - b});
|
||||
point.x = (intercepts[0] + intercepts[1]) / 2;
|
||||
}
|
||||
return point;
|
||||
|
|
9
dist/paper-core.js
vendored
9
dist/paper-core.js
vendored
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Tue May 31 12:35:44 2016 +0200
|
||||
* Date: Fri Jun 10 10:24:19 2016 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
@ -10057,16 +10057,15 @@ Path.inject({
|
|||
for (var i = 0, l = curves.length; i < l; i++) {
|
||||
var values = curves[i].values;
|
||||
if ((curves[i].winding === 1
|
||||
&& y >= values[1] && y <= values[7]
|
||||
|| y >= values[7] && y <= values[1])) {
|
||||
&& y > values[1] && y <= values[7]
|
||||
|| y >= values[7] && y < values[1])) {
|
||||
var count = Curve.solveCubic(values, 1, y, roots, 0, 1);
|
||||
for (var j = count - 1; j >= 0; j--) {
|
||||
intercepts.push(Curve.getPoint(values, roots[j]).x);
|
||||
}
|
||||
}
|
||||
if (intercepts.length > 1)
|
||||
break;
|
||||
}
|
||||
intercepts.sort(function(a, b) {return a - b});
|
||||
point.x = (intercepts[0] + intercepts[1]) / 2;
|
||||
}
|
||||
return point;
|
||||
|
|
12
dist/paper-core.min.js
vendored
12
dist/paper-core.min.js
vendored
File diff suppressed because one or more lines are too long
9
dist/paper-full.js
vendored
9
dist/paper-full.js
vendored
|
@ -9,7 +9,7 @@
|
|||
*
|
||||
* All rights reserved.
|
||||
*
|
||||
* Date: Tue May 31 12:35:44 2016 +0200
|
||||
* Date: Fri Jun 10 10:24:19 2016 +0200
|
||||
*
|
||||
***
|
||||
*
|
||||
|
@ -10057,16 +10057,15 @@ Path.inject({
|
|||
for (var i = 0, l = curves.length; i < l; i++) {
|
||||
var values = curves[i].values;
|
||||
if ((curves[i].winding === 1
|
||||
&& y >= values[1] && y <= values[7]
|
||||
|| y >= values[7] && y <= values[1])) {
|
||||
&& y > values[1] && y <= values[7]
|
||||
|| y >= values[7] && y < values[1])) {
|
||||
var count = Curve.solveCubic(values, 1, y, roots, 0, 1);
|
||||
for (var j = count - 1; j >= 0; j--) {
|
||||
intercepts.push(Curve.getPoint(values, roots[j]).x);
|
||||
}
|
||||
}
|
||||
if (intercepts.length > 1)
|
||||
break;
|
||||
}
|
||||
intercepts.sort(function(a, b) {return a - b});
|
||||
point.x = (intercepts[0] + intercepts[1]) / 2;
|
||||
}
|
||||
return point;
|
||||
|
|
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