Backup_Repos/jsketcher
1
0
Fork 0
mirror of https://github.com/xibyte/jsketcher synced 2025-12-22 16:33:38 +01:00
Code Issues Projects Releases Wiki Activity

clean up unused code in boolean algorithm

Browse source
This commit is contained in:
Val Erastov 2018-02-15 21:34:29 -08:00
parent c1e7e134a4
commit 1995be6910
1 changed files with 0 additions and 17 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

17
web/app/brep/operations/boolean.js
View file

@ -65,13 +65,8 @@ export function invert( shell ) {
}
}
let EDGE_REPLACE = [];
export function BooleanAlgorithm( shellA, shellB, type ) {
//fixme
EDGE_REPLACE = [];
BREP_DEBUG.startBooleanSession(shellA, shellB, type);
shellA = prepareWorkingCopy(shellA);
@ -97,8 +92,6 @@ export function BooleanAlgorithm( shellA, shellB, type ) {
intersectFaces(shellA, shellB, type);
replaceEdges();
replaceMergedFaces(facesData, mergedFaces);
for (let faceData of facesData) {
faceData.initGraph();
@ -160,12 +153,6 @@ function removeInvalidLoops(facesData) {
}
}
function replaceEdges() {
for (let {from, to} of EDGE_REPLACE) {
from.replace(to);
}
}
function replaceMergedFaces(facesData, mergedFaces) {
function addDecayed(he, out) {
let decayed = EdgeSolveData.get(he).decayed;
@ -447,10 +434,6 @@ function mergeFaces(facesA, facesB, opType) {
};
}
function markEdgeToReplace(from, to) {
EDGE_REPLACE.push({from, to});
}
export function mergeVertices(shell1, shell2) {
const toSwap = new Map();
for (let v1 of shell1.vertices) {