mirror of
https://github.com/scratchfoundation/paper.js.git
synced 2025-01-20 22:39:50 -05:00
Rename variable to be less ambiguous.
This commit is contained in:
parent
63303a59f4
commit
f2cce4c84d
1 changed files with 4 additions and 4 deletions
|
@ -80,7 +80,7 @@ var PathItem = Item.extend(/** @lends PathItem# */{
|
|||
length1 = curves1.length,
|
||||
length2 = self ? length1 : curves2.length,
|
||||
values2 = [],
|
||||
lists = [],
|
||||
arrays = [],
|
||||
locations,
|
||||
path;
|
||||
// Cache values for curves2 as we re-iterate them for each in curves1.
|
||||
|
@ -97,7 +97,7 @@ var PathItem = Item.extend(/** @lends PathItem# */{
|
|||
if (path1 !== path) {
|
||||
path = path1;
|
||||
locations = [];
|
||||
lists.push(locations);
|
||||
arrays.push(locations);
|
||||
}
|
||||
if (self) {
|
||||
// First check for self-intersections within the same curve.
|
||||
|
@ -133,8 +133,8 @@ var PathItem = Item.extend(/** @lends PathItem# */{
|
|||
}
|
||||
// Now flatten the list of location arrays to one array and return it.
|
||||
locations = [];
|
||||
for (var i = 0, l = lists.length; i < l; i++) {
|
||||
locations.push.apply(locations, lists[i]);
|
||||
for (var i = 0, l = arrays.length; i < l; i++) {
|
||||
locations.push.apply(locations, arrays[i]);
|
||||
}
|
||||
return locations;
|
||||
},
|
||||
|
|
Loading…
Reference in a new issue