-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Provides with the functionality like unix "uniq" utility
--   
@package Unique
@version 0.1.0.1


module Data.List.Unique

-- | <a>sortUniq</a> sorts the list and removes the duplicates of elements.
--   Example:
--   
--   sortUniq "foo bar" == " abfor"
sortUniq :: Ord a => [a] -> [a]

-- | <a>repeated</a> finds only the elements that are present more than
--   once in the list. Example:
--   
--   repeated "foo bar" == "o"
repeated :: Ord a => [a] -> [a]

-- | <a>unique</a> gets only unique elements, those that do not have
--   duplicates. It sorts them. Example:
--   
--   unique "foo bar" == " abfr"
unique :: Ord a => [a] -> [a]

-- | <a>count</a> the elements in the list, sorts by keys (elements).
--   Example:
--   
--   count "foo bar" == [('
--   ',1),(<tt>a</tt>,1),(<tt>b</tt>,1),(<tt>f</tt>,1),(<tt>o</tt>,2),(<tt>r</tt>,1)]
count :: Ord a => [a] -> [(a, Int)]

-- | <a>count_</a> the elements in the list, sorts by values. Example:
--   
--   count_ "foo bar" == [('
--   ',1),(<tt>a</tt>,1),(<tt>b</tt>,1),(<tt>f</tt>,1),(<tt>r</tt>,1),(<tt>o</tt>,2)]
count_ :: Ord a => [a] -> [(a, Int)]

-- | <a>countElem</a> gets the amount of occurrences of the specified
--   element. Example:
--   
--   countElem <tt>o</tt> "foo bar" == Just 2
countElem :: Ord a => a -> [a] -> Maybe Int