From 1995be69106b400d1732ca4f31342db5d0d3e7f1 Mon Sep 17 00:00:00 2001
From: Val Erastov <xibyte@gmail.com>
Date: Thu, 15 Feb 2018 21:34:29 -0800
Subject: [PATCH] clean up unused code in boolean algorithm

---
 web/app/brep/operations/boolean.js | 17 -----------------
 1 file changed, 17 deletions(-)

diff --git a/web/app/brep/operations/boolean.js b/web/app/brep/operations/boolean.js
index b2d0d4dd..cbe0e8a2 100644
--- a/web/app/brep/operations/boolean.js
+++ b/web/app/brep/operations/boolean.js
@@ -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) {