From 187273146eee203027cff025985449d3db33a0d5 Mon Sep 17 00:00:00 2001 From: Ian Lynagh Date: Fri, 27 Mar 2009 23:21:18 +0000 Subject: [PATCH] Add another Data.List.intersect example from Christian Maeder --- Data/List.hs | 3 +++ 1 file changed, 3 insertions(+) diff --git a/Data/List.hs b/Data/List.hs index bd4e14c..ebee0f1 100644 --- a/Data/List.hs +++ b/Data/List.hs @@ -399,6 +399,9 @@ unionBy eq xs ys = xs ++ foldl (flip (deleteBy eq)) (nubBy eq ys) xs -- > [1,2,3,4] `intersect` [2,4,6,8] == [2,4] -- -- If the first list contains duplicates, so will the result. +-- +-- > [1,2,2,3,4] `intersect` [6,4,4,2] == [2,2,4] +-- -- It is a special case of 'intersectBy', which allows the programmer to -- supply their own equality test. -- 1.7.10.4