Prebuilt module for commit 999e8fe4d9

This commit is contained in:
Paper.js Bot 2016-06-10 08:27:38 +00:00
parent fc500dc38e
commit c7990fe5f3
5 changed files with 20 additions and 23 deletions

View file

@ -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
View file

@ -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;

File diff suppressed because one or more lines are too long

9
dist/paper-full.js vendored
View file

@ -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;

File diff suppressed because one or more lines are too long