-- Hoogle documentation, generated by Haddock -- See Hoogle, http://www.haskell.org/hoogle/ -- | It provides the functionality like unix "uniq" utility -- @package Unique @version 0.1.0.4 -- | Library provides the functions to find unique and duplicate elements -- in the list module Data.List.Unique -- | sortUniq sorts the list and removes the duplicates of elements. -- Example: -- -- sortUniq "foo bar" == " abfor" sortUniq :: Ord a => [a] -> [a] -- | repeated finds only the elements that are present more than -- once in the list. Example: -- -- repeated "foo bar" == "o" repeated :: Ord a => [a] -> [a] -- | unique gets only unique elements, that do not have duplicates. -- It sorts them. Example: -- -- unique "foo bar" == " abfr" unique :: Ord a => [a] -> [a] -- | count 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)] count :: Ord a => [a] -> [(a, Int)] -- | count_ 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)] count_ :: Ord a => [a] -> [(a, Int)] -- | countElem gets the number of occurrences of the specified -- element. Example: -- -- countElem o "foo bar" == 2 countElem :: Eq a => a -> [a] -> Int