From a31e1ff5786693e822df034eb9e957590b5a8945 Mon Sep 17 00:00:00 2001 From: hasufell Date: Wed, 15 Oct 2014 22:50:56 +0200 Subject: [PATCH] ALGO: improve haddock doc --- Algorithms/ConvexHull/GrahamScan.hs | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Algorithms/ConvexHull/GrahamScan.hs b/Algorithms/ConvexHull/GrahamScan.hs index cb1d671..ce3544f 100644 --- a/Algorithms/ConvexHull/GrahamScan.hs +++ b/Algorithms/ConvexHull/GrahamScan.hs @@ -94,8 +94,8 @@ grahamUCH vs = uncurry (\x y -> last . scanH x $ y) -- |This scans only a half of the convex hull, but all steps (the last -- is the end result). -- If it's the upper or lower half depends on the input. --- Also, the first list is reversed since we only care about the last --- 3 elements and want to stay efficient. +-- Also, the first list is expected to be reversed since we only care +-- about the last 3 elements and want to stay efficient. scanH :: [PT] -- ^ the first 3 starting points in reversed order -> [PT] -- ^ the rest of the points -> [[PT]] -- ^ all convex hull points iterations for the half