on master help sign in
Merge pull request #175 from madscoaducom/master
ec12925Evan Czaplicki
libraries/Automaton.elm+1−1
@@ -33,7 +33,7 @@ g <<< f = f >>> g
33-- Combine a list of automatons into a single automaton that produces a list.
33-- Combine a list of automatons into a single automaton that produces a list.
34combine : [Automaton a b] -> Automaton a [b]
34combine : [Automaton a b] -> Automaton a [b]
35combine autos =
35combine autos =
36− Step (\a -> let (autos', bs) = unzip $ map (step a) autos
36+ Step (\a -> let (autos', bs) = unzip <| map (step a) autos
37 in (combine autos', bs))
37 in (combine autos', bs))
38
38
39-- Create an automaton with no memory. It just applies the given function to
39-- Create an automaton with no memory. It just applies the given function to
libraries/Dict.elm+1−1
@@ -154,7 +154,7 @@ find k t =
154-- Determine if a key is in a dictionary.
154-- Determine if a key is in a dictionary.
155member : Comparable k -> Dict (Comparable k) v -> Bool
155member : Comparable k -> Dict (Comparable k) v -> Bool
156-- Does t contain k?
156-- Does t contain k?
157−member k t = Maybe.isJust $ lookup k t
157+member k t = Maybe.isJust <| lookup k t
158
158
159rotateLeft : Dict k v -> Dict k v
159rotateLeft : Dict k v -> Dict k v
160rotateLeft t =
160rotateLeft t =