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

Boolean: Some code and comment cleanup.

Browse source
This commit is contained in:
Jürg Lehni 2017-02-26 01:11:33 +01:00
parent 5c86330d6e
commit 32db1eb005
1 changed files with 7 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

17
src/path/PathItem.Boolean.js
View file

@ -754,7 +754,6 @@ PathItem.inject(new function() {
*/
function tracePaths(segments, operator) {
var paths = [],
branches = [],
starts;
function isValid(seg) {
@ -863,6 +862,7 @@ PathItem.inject(new function() {
path = null,
finished = false,
closed = true,
branches = [],
branch,
visited,
handleIn;
@ -928,8 +928,8 @@ PathItem.inject(new function() {
if (cross)
seg = other;
// If an invalid segment is encountered, go back to the last
// crossing and try the other direction by not crossing at the
// intersection.
// crossing and try other possible crossings, as well as not
// crossing at the branch's root.
if (!isValid(seg)) {
// Remove the already added segments, and mark them as not
// visited so they become available again as options.
@ -938,11 +938,10 @@ PathItem.inject(new function() {
visited[j]._visited = false;
}
visited.length = 0;
// Go back to the branch's root segment at which the
// crossing happened, and try other crossings.
// NOTE: This also tries the root segment without crossing,
// because it is added to the list of crossings when the
// branch is created above.
// Go back to the branch's root segment where the crossing
// happened, and try other crossings. Note that this also
// tests the root segment without crossing as it is added to
// the list of crossings when the branch is created above.
do {
seg = branch && branch.crossings.shift();
if (!seg) {
@ -983,8 +982,6 @@ PathItem.inject(new function() {
if (path.getArea() !== 0) {
paths.push(path);
}
// Clear branches.
branches = [];
}
}
return paths;