Code clean-up

Removed unnecessary test functions and debug / @info / @show statements

Author: Liameloy

src/marching.jl

@@ -35,8 +35,6 @@ function tet_x_plane!(
         tol = 0.0
     )
 
-    debug = false
-
     # If all nodes lie on one side of the plane, no intersection
     @fastmath if (
             mapreduce(a -> a < -tol, *, planeq_values) ||
@@ -48,7 +46,6 @@ function tet_x_plane!(
     # evaluation of the plane equation
     intersection_counter = 0
     prohibited_list = @MArray zeros(Bool, 4)
-    debug && @info node_indices
     @inbounds @simd for n1 in 1:3
         N1 = node_indices[n1]
         @inbounds @fastmath @simd for n2 in (n1 + 1):4
@@ -65,11 +62,9 @@ function tet_x_plane!(
                 ixcoord[2, intersection_counter] = pointlist[2, N1] + t * (pointlist[2, N2] - pointlist[2, N1])
                 ixcoord[3, intersection_counter] = pointlist[3, N1] + t * (pointlist[3, N2] - pointlist[3, N1])
                 ixvalues[intersection_counter] = function_values[N1] + t * (function_values[N2] - function_values[N1])
-                debug && @show ixcoord
             end
         end
     end
-    debug && @info "amount of intersections: " intersection_counter
     return intersection_counter
 end
 
@@ -418,28 +413,3 @@ function marching_triangles(
     end
     return points, adjacencies, values
 end
-
-
-"""
-Function to estimate amount of intersections of plane and tetrahedron
-This was used as a testing function and is not used otherwise
-"""
-
-function getAmountOfIntersections(planeq_values, tol)
-    prohibitedList = @MArray zeros(Bool, 4)
-    amountOfIntersections = 0
-    for i in 1:(length(planeq_values) - 1)
-        for j in (i + 1):length(planeq_values)
-            #=if planeq_values[n1] != planeq_values[n2] &&
-                planeq_values[n1] * planeq_values[n2] < tol && 
-                abs(planeq_values[n2]) > tol =#
-            if abs(planeq_values[i] - planeq_values[j]) > tol && prohibitedList[i] == false && prohibitedList[j] == false
-                amountOfIntersections += 1
-                if planeq_values[j] == 0
-                    prohibitedList[j] = true
-                end
-            end
-        end
-    end
-    return amountOfIntersections
-end