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