úÎ!YÂWì!      (c) Volodymyr YashchenkoBSD3ualinuxcn@gmail.comUnstableportableSafe'7 Unique behaves the same as unix . utility does (without cli additional options) uniq "1121331" == "12131"Unique@ sorts the list and removes the duplicates of elements. Example: sortUniq "foo bar" == " abfor"UniqueN finds only the elements that are present more than once in the list. Example: repeated "foo bar" == "o"UniquefThe repeatedBy function behaves just like repeated, except it uses a user-supplied equality predicate. 2repeatedBy (>2) "This is the test line" == " eist"UniqueQ gets only unique elements, that do not have duplicates. It sorts them. Example: unique "foo bar" == " abfr"Unique3 checks whether all elements of the list are unique RallUnique "foo bar" == False allUnique ['a'..'z'] == True allUnique [] == True (!) Since 0.4.7UniqueC of each element in the list, it sorts by keys (elements). Example: Dcount "foo bar" == [(' ',1),('a',1),('b',1),('f',1),('o',2),('r',1)]UniqueA of each elements in the list, it sorts by their number. Example: Ecount_ "foo bar" == [(' ',1),('a',1),('b',1),('f',1),('r',1),('o',2)]UniqueB gets the number of occurrences of the specified element. Example: countElem 'o' "foo bar" == 2 Unique D function is a complex investigation of the list. It returns triple:7the first - all elements with removed duplicates (like  but the result is not sorted)]the second - the elements that are repeated at least once in the list (result is the same as  but not sorted)Sthe third - the unique elements that do not have duplicates (result is the same as  but not sorted) s does not sort the resulted elements of triple as well as it can be used for types that does not have Ord instance.Anyway, it's better to use ,  and  instead of   when type a has Ord instance. ?complex "This is the test line" == ("This teln","is hte","Tln") Since 0.4.4 Unique  like  or 2 but shows the list of elements that occur X times Moccurrences "This is the test line" == [(1,"Tln"),(2,"h"),(3,"eist"),(4," ")] Since 0.4.4 Unique M function is to check whether the given element is unique in the list or not.KIt returns Nothing when the element does not present in the list. Examples: jisUnique 'f' "foo bar" == Just True isUnique 'o' "foo bar" == Just False isUnique '!' "foo bar" == Nothing Since 0.4.5 Unique  is a reverse function to   Since 0.4.5   (c) Volodymyr YashchenkoBSD3ualinuxcn@gmail.comUnstableportableSafe?a Unique M function is to check whether the given element is unique in the list or not.KIt returns Nothing when the element does not present in the list. Examples: jisUnique 'f' "foo bar" == Just True isUnique 'o' "foo bar" == Just False isUnique '!' "foo bar" == Nothing Since 0.4.7.2Unique is a reverse function to   Since 0.4.5Unique@ sorts the list and removes the duplicates of elements. Example: sortUniq "foo bar" == " abfor"UniqueThe X function behaves just like repeated, except it uses a user-supplied equality predicate. 2repeatedBy (>2) "This is the test line" == " eist"UniqueN finds only the elements that are present more than once in the list. Example: repeated "foo bar" == "o"UniqueQ gets only unique elements, that do not have duplicates. It sorts them. Example: unique "foo bar" == " abfr"Unique3 checks whether all elements of the list are unique RallUnique "foo bar" == False allUnique ['a'..'z'] == True allUnique [] == True (!) Since 0.4.7.2UniqueC of each element in the list, it sorts by keys (elements). Example: Dcount "foo bar" == [(' ',1),('a',1),('b',1),('f',1),('o',2),('r',1)]UniqueA of each elements in the list, it sorts by their number. Example: Ecount_ "foo bar" == [(' ',1),('a',1),('b',1),('f',1),('r',1),('o',2)]Unique like  or 2 but shows the list of elements that occur X times Moccurrences "This is the test line" == [(1,"Tln"),(2,"h"),(3,"eist"),(4," ")] Since 0.4.7.5   (c) Volodymyr YashchenkoBSD3ualinuxcn@gmail.comUnstableportableSafeW˜ UniqueM function is to check whether the given element is unique in the list or not.KIt returns Nothing when the element does not present in the list. Examples: jisUnique 'f' "foo bar" == Just True isUnique 'o' "foo bar" == Just False isUnique '!' "foo bar" == Nothing Since 0.4.7.2Unique is a reverse function to  Since 0.4.7.2Unique- removes the duplicates of elements. Example: &removeDuplicates "foo bar" == " abrfo"UniqueThe  function behaves just like 4, except it uses a user-supplied equality predicate. 2repeatedBy (>2) "This is the test line" == " stei"UniqueN finds only the elements that are present more than once in the list. Example:  repeated "foo bar" == "o"Unique8 gets only unique elements, that do not have duplicates. unique "foo bar" == " abrf"Unique3 checks whether all elements of the list are unique RallUnique "foo bar" == False allUnique ['a'..'z'] == True allUnique [] == True (!) Since 0.4.7.2Unique& of each element in the list. Example: jcount "This is the test line" == [(' ',4),('s',3),('T',1),('t',3),('e',3),('h',2),('i',3),('l',1),('n',1)]UniqueA of each elements in the list, it sorts by their number. Example: l count_ "This is the test line" == [('n',1),('l',1),('T',1),('h',2),('i',3),('e',3),('t',3),('s',3),(' ',4)] Unique  like  or 2 but shows the list of elements that occur X times Moccurrences "This is the test line" == [(1,"Tln"),(2,"h"),(3,"eist"),(4," ")] Since 0.4.7.5   !           %Unique-0.4.7.7-8hH1o6tShS4G9GsphMGZMAData.List.UniqueData.List.UniqueStrictData.List.UniqueUnsorteduniqsortUniqrepeated repeatedByunique allUniquecountcount_ countElemcomplex occurrencesisUnique isRepeatedremoveDuplicates