on master help sign in
clean up redundant spaces
5f63dadHeather
libs/base/Data/List.idr+1−1
@@ -39,7 +39,7 @@ isElem x (y :: xs) with (decEq x y)
39
39
40||| The intersectBy function returns the intersect of two lists by user-supplied equality predicate.
40||| The intersectBy function returns the intersect of two lists by user-supplied equality predicate.
41intersectBy : (a -> a -> Bool) -> List a -> List a -> List a
41intersectBy : (a -> a -> Bool) -> List a -> List a -> List a
42−intersectBy eq xs ys = [x | x <- xs, any (eq x) ys]
42+intersectBy eq xs ys = [x | x <- xs, any (eq x) ys]
43
43
44||| Compute the intersection of two lists according to their `Eq` instance.
44||| Compute the intersection of two lists according to their `Eq` instance.
45|||
45|||
libs/prelude/Prelude/List.idr+1−1
@@ -538,7 +538,7 @@ delete = deleteBy (==)
538
538
539||| The unionBy function returns the union of two lists by user-supplied equality predicate.
539||| The unionBy function returns the union of two lists by user-supplied equality predicate.
540unionBy : (a -> a -> Bool) -> List a -> List a -> List a
540unionBy : (a -> a -> Bool) -> List a -> List a -> List a
541−unionBy eq xs ys = xs ++ foldl (flip (deleteBy eq)) (nubBy eq ys) xs
541+unionBy eq xs ys = xs ++ foldl (flip (deleteBy eq)) (nubBy eq ys) xs
542
542
543||| Compute the union of two lists according to their `Eq` instance.
543||| Compute the union of two lists according to their `Eq` instance.
544|||
544|||