úÎ;M9Ù     (c) Volodymyr YaschenkoBSD3ualinuxcn@gmail.comUnstableportableSafeThe  function behaves just like 4, except it uses a user-supplied equality predicate. 2repeatedBy (>2) "This is the test line" == " stei"N finds only the elements that are present more than once in the list. Example:  repeated "foo bar" == "o"8 gets only unique elements, that do not have duplicates. unique "foo bar" == " abrf"& 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)]A 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)](c) Volodymyr YaschenkoBSD3ualinuxcn@gmail.comUnstableportableSafeThe X function behaves just like repeated, except it uses a user-supplied equality predicate. 2repeatedBy (>2) "This is the test line" == " eist"N finds only the elements that are present more than once in the list. Example: repeated "foo bar" == "o"Q gets only unique elements, that do not have duplicates. It sorts them. Example: unique "foo bar" == " abfr"C 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)]  A 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)]    (c) Volodymyr YaschenkoBSD3ualinuxcn@gmail.comUnstableportableSafe  @ sorts the list and removes the duplicates of elements. Example: sortUniq "foo bar" == " abfor"  N finds only the elements that are present more than once in the list. Example: repeated "foo bar" == "o" fThe repeatedBy function behaves just like repeated, except it uses a user-supplied equality predicate. 2repeatedBy (>2) "This is the test line" == " eist"  Q gets only unique elements, that do not have duplicates. It sorts them. Example: unique "foo bar" == " abfr"C 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)]A 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)]B gets the number of occurrences of the specified element. Example: countElem 'o' "foo bar" == 2D 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 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.4M 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 is a reverse function to  Since 0.4.5            #Unique-0.4.5-7nSmYXF9p76DLQGED9mv5VData.List.UniqueUnsortedData.List.UniqueStrictData.List.Unique repeatedByrepeateduniquecountcount_sortUniq countElemcomplex occurrencesisUnique isRepeatedcountMapsgfilterByLengthlhtripletmerge