X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2FCube.hs;h=41d406031313ca71057aad85e81fb9df0f310856;hb=8c9954ffb0d636ee383e00242a1c8214d28f8461;hp=54fda14a08d078baea20c00f8898e18a2d7a924b;hpb=7a0d15a1fcdd00ae94b2a1b135ed095033667108;p=spline3.git

diff --git a/src/Cube.hs b/src/Cube.hs
index 54fda14..41d4060 100644
--- a/src/Cube.hs
+++ b/src/Cube.hs
@@ -620,4 +620,6 @@ find_containing_tetrahedron c p =
     -- sqrt(). So, "distances" below really means "distances squared."
     distances = V.map ((dot p) . center) candidates
     shortest_distance = V.minimum distances
-    lucky_idx = V.findIndex (\t -> (center t) `dot` p == shortest_distance)
+    lucky_idx = V.findIndex
+                  (\t -> (center t) `dot` p == shortest_distance)
+                  candidates