Unique 0.2 → 0.3

raw patch · 2 files changed

+73/−6 lines, 2 filesdep +containers

Dependencies added: containers

Files

• Data/List/UniqueStrict.hs +65/−0
• Unique.cabal +8/−6

@@ -0,0 +1,65 @@+-----------------------------------------------------------------------------+-- |+-- Module      :  Data.List.UniqueStrict+-- Copyright   :  (c) Volodymyr Yaschenko+-- License     :  BSD3+-- +-- Maintainer  :  ualinuxcn@gmail.com+-- Stability   :  Unstable+-- Portability :  portable+--+-- Library provides functions to find unique and duplicate elements in the list.+-- Unlike Data.List.Unique this one uses Data.Map.Strict for calculations.+-- So it's much faster and it uses less memory. ++module  Data.List.UniqueStrict +                         ( repeated+                         , repeatedBy+                         , unique+                         , count+                         , count_ ) where ++import qualified Data.Map.Strict as MS (Map (..), fromListWith,toList,filter,keys) +import qualified Data.IntMap.Strict as IM (IntMap (..), fromListWith,toList)+import qualified Data.List as L (sort) ++countMap :: Ord a => [a] -> MS.Map a Int+countMap = MS.fromListWith (+) . flip zip (repeat 1)++-- | The 'repeatedBy' function behaves just like repeated, except it uses a user-supplied equality predicate.+-- +-- repeatedBy (>2) "This is the test line" == " eist"++repeatedBy :: Ord a => (Int -> Bool) -> [a] -> [a]+repeatedBy p = MS.keys . MS.filter p . countMap++-- | 'repeated' finds only the elements that are present more than once in the list. Example: +--+--  repeated  "foo bar" == "o" ++repeated :: Ord a => [a] -> [a]+repeated = repeatedBy (>1)++-- | 'unique' gets only unique elements, that do not have duplicates.  +-- It sorts them. Example: +--+--  unique  "foo bar" == " abfr"++unique :: Ord a => [a] -> [a]+unique = repeatedBy (==1)++-- | '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 = MS.toList . countMap ++-- | '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)]+count_ = fromIntMap . toIntMap . MS.toList . countMap +    where toIntMap = IM.fromListWith (++) . map (\(x,y) -> (y,[x]))+          fromIntMap = concatMap (\(x,y) -> L.sort . zip y $ repeat x) . IM.toList  

@@ -11,7 +11,7 @@ --                   | | +----- non-breaking API additions --                   | | | +--- code changes with no API change --version:             0.2.0.5-version:             0.2+version:             0.3  -- A short (one-line) description of the package. synopsis:           It provides the functionality like unix "uniq" utility@@ -32,9 +32,6 @@ -- patches. maintainer:          ualinuxcn@gmail.com --- A copyright notice.--- copyright:           - category:            Data  build-type:          Simple@@ -46,10 +43,14 @@ -- Constraint on the version of Cabal needed to build this package. cabal-version:       >=1.10 +source-repository head+   type:        darcs+   location:    http://hub.darcs.net/kapral/Unique/  library   -- Modules exported by the library.-  exposed-modules:      Data.List.Unique+  exposed-modules:      Data.List.Unique, +                        Data.List.UniqueStrict      -- Modules included in this library but not exported.   -- other-modules:      @@ -58,7 +59,8 @@   -- other-extensions:          -- Other library packages from which modules are imported.-  build-depends:       base >=4.0 && <= 4.8+  build-depends:       base >=4.0 && <= 4.8, +                       containers >= 0.4 && <= 0.9      -- Directories containing source files.   -- hs-source-dirs: