From 8c9954ffb0d636ee383e00242a1c8214d28f8461 Mon Sep 17 00:00:00 2001
From: Michael Orlitzky <michael@orlitzky.com>
Date: Mon, 5 Sep 2011 18:55:17 -0400
Subject: [PATCH] Add back an accidentally-deleted line.

---
 src/Cube.hs | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

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
-- 
2.43.2