logic cleanup

Author: sjkelly

src/decompositions.jl

@@ -49,24 +49,24 @@ end
 function tet_to_edges!(pair::Vector, pair_set::Set, t)
     empty!(pair_set)
     length(pair) < length(t)*6 && resize!(pair, length(t)*6)
-    num_pair = 1
+    num_pair = 0
     @inbounds for i in eachindex(t)
         for ep in 1:6
             p1 = t[i][tetpairs[ep][1]]
             p2 = t[i][tetpairs[ep][2]]
             elt = p1 > p2 ? (p2,p1) : (p1,p2)
             if !in(elt, pair_set)
                 push!(pair_set, elt)
-                pair[num_pair] = elt
                 num_pair += 1
+                pair[num_pair] = elt
             end
         end
     end
 
     # sort the edge pairs for better point lookup
-    sort!(view(pair, 1:(num_pair-1)))
+    sort!(view(pair, 1:num_pair))
 
-    return num_pair - 1 # return the number of pairs
+    return num_pair # return the number of pairs
 end
 
 function bitpack(xi,yi)

src/distmeshnd.jl

@@ -107,9 +107,11 @@ function distmesh(fdist::Function,
             num_pairs = tet_to_edges!(pair, pair_set, result.tetrahedra) # Describe each edge by a unique pair of nodes
 
             # resize arrays for new pair count
-            length(bars) < num_pairs && resize!(bars, num_pairs)
-            length(L) < num_pairs && resize!(L, num_pairs)
-            non_uniform && length(L0) < num_pairs && resize!(L0, num_pairs)
+            if length(L) < num_pairs
+                resize!(bars, num_pairs)
+                resize!(L, num_pairs)
+                non_uniform && resize!(L0, num_pairs)
+            end
 
             triangulationcount += 1
             stats && push!(result.stats.retriangulations, lcount)