I remembered about foldl1 !

diff --git a/advent03/src/advent03.hs b/advent03/src/advent03.hs
index ea2645ef7b4d9a3b82434b8913ac882006896808..a863ffef9ca2a09ac081a321c6bbc8f1f2c539a1 100644 (file)
--- a/advent03/src/advent03.hs
+++ b/advent03/src/advent03.hs
@@ -8,7 +8,7 @@ import Text.Megaparsec.Char
 import qualified Text.Megaparsec.Char.Lexer as L
 import qualified Control.Applicative as CA
 
-import Data.List (foldl')
+import Data.List (foldl', foldl1')
 import qualified Data.Map as M
 import Data.Map ((!))
 
@@ -56,9 +56,7 @@ shortestPaths crossings = minimum $ M.elems  crossings
 
 crossovers :: [Path] -> Visited
 crossovers travelledPaths = 
-      foldl' (M.intersectionWith (+))
-             (_visited $ head travelledPaths)
-             (map _visited $ drop 1 travelledPaths)
+      foldl1' (M.intersectionWith (+)) $ map _visited travelledPaths
 
 travelAllPaths :: [[Segment]] -> [Path]
 travelAllPaths = map travelPath

diff --git a/advent03/src/advent03part1.hs b/advent03/src/advent03part1.hs
index 370294337291358c8a86b55bb9b110b5f316e7f0..e2beb38e974e5da7e3a7bcfdebc0bf397fb650e4 100644 (file)
--- a/advent03/src/advent03part1.hs
+++ b/advent03/src/advent03part1.hs
@@ -8,7 +8,7 @@ import Text.Megaparsec.Char
 import qualified Text.Megaparsec.Char.Lexer as L
 import qualified Control.Applicative as CA
 
-import Data.List (foldl')
+import Data.List (foldl', foldl1')
 import qualified Data.Set as S
 
 import Linear (V2(..), (^+^), (^-^), (*^), (*^))
@@ -46,9 +46,7 @@ closest points = S.findMin $ S.map manhattan points
 
 crossovers :: [Path] -> Visited
 crossovers travelledPaths = 
-      foldl' S.intersection
-             (_visited $ head travelledPaths)
-             (map _visited $ drop 1 travelledPaths)
+      foldl1' S.intersection $ map _visited travelledPaths
 
 travelAllPaths :: [[Segment]] -> [Path]
 travelAllPaths = map travelPath