Unique 0.4.7.6 → 0.4.7.7
raw patch · 2 files changed
+16/−7 lines, 2 filesdep ~QuickCheckdep ~hashablePVP: minor bump suggested
API additions: PVP suggests at least a minor version bump
Dependency ranges changed: QuickCheck, hashable
API changes (from Hackage documentation)
+ Data.List.Unique: uniq :: Eq b => [b] -> [b]
Files
- Data/List/Unique.hs +9/−2
- Unique.cabal +7/−5
Data/List/Unique.hs view
@@ -11,8 +11,8 @@ -- Library provides the functions to find unique and duplicate elements in the list module Data.List.Unique- (- complex+ ( uniq+ , complex , isUnique , isRepeated , sortUniq@@ -34,6 +34,13 @@ import Data.Function (on) import Data.List.Extra (nubOrd) import Data.Tuple (swap)++-- | 'uniq' behaves the same as unix 'uniq' utility does (without cli additional options)+--+-- > uniq "1121331" == "12131"++uniq :: Eq b => [b] -> [b]+uniq = map head . group -- | 'sortUniq' sorts the list and removes the duplicates of elements. Example: --
Unique.cabal view
@@ -1,6 +1,6 @@ name: Unique -version: 0.4.7.6+version: 0.4.7.7 synopsis: It provides the functionality like unix "uniq" utility description: Library provides the functions to find unique and duplicate elements in the list@@ -11,7 +11,9 @@ category: Data build-type: Simple cabal-version: >=1.10-tested-with: GHC == 8.4+tested-with: GHC == 8.8+ , GHC == 8.6+ , GHC == 8.4 , GHC == 8.2 , GHC == 8.0 , GHC == 7.8@@ -30,7 +32,7 @@ build-depends: base >= 4.0 && < 5 , containers >= 0.5.0 && < 0.7 , extra >= 1.6.2 && < 1.7- , hashable >= 1.2.6 && < 1.3+ , hashable >= 1.2.6 && < 1.4 , unordered-containers >= 0.2.8 && < 0.3 default-language: Haskell2010@@ -60,7 +62,7 @@ build-depends: base >= 4.0 && < 5 , hspec , containers >= 0.5.0 && < 0.7- , QuickCheck >= 2.10 && <2.13+ , QuickCheck >= 2.10 && <2.15 , Unique default-language: Haskell2010@@ -74,7 +76,7 @@ build-depends: base >= 4.0 && < 5 , Unique , criterion- , QuickCheck >= 2.10 && <2.13+ , QuickCheck >= 2.10 && <2.15 , quickcheck-instances , bytestring , hashable