úÎR    portableUnstableualinuxcn@gmail.com Safe-InferredThe Y function behaves just like repeated, except it uses a user-supplied equality predicate. repeatedBy (>2) This is the test line ==  eist P finds only the elements that are present more than once in the list. Example:  repeated foo bar == o ; gets only unique elements, that do not have duplicates.  It sorts them. Example: unique foo bar ==  abfr E of each element in the list, it sorts by keys (elements). Example: count foo bar == [(' ',1),(a,1),(b,1),(f,1),(o,2),(r,1)] C of each elements in the list, it sorts by their number. Example: count_ foo bar == [(' ',1),(a,1),(b,1),(f,1),(r,1),(o,2)]   portableUnstableualinuxcn@gmail.com Safe-InferredB sorts the list and removes the duplicates of elements. Example:  sortUniq foo bar ==  abfor P finds only the elements that are present more than once in the list. Example:  repeated foo bar == o gThe repeatedBy function behaves just like repeated, except it uses a user-supplied equality predicate. repeatedBy (>2) This is the test line ==  eist ; gets only unique elements, that do not have duplicates.  It sorts them. Example: unique foo bar ==  abfr  E of each element in the list, it sorts by keys (elements). Example: count foo bar == [(' ',1),(a,1),(b,1),(f,1),(o,2),(r,1)]  C of each elements in the list, it sorts by their number. Example: count_ foo bar == [(' ',1),(a,1),(b,1),(f,1),(r,1),(o,2)]  E gets the number of occurrences of the specified element. Example:  countElem o foo bar == 2          Unique-0.3Data.List.UniqueStrictData.List.Unique repeatedByrepeateduniquecountcount_sortUniq countElemcountMapfilterByLength