multiset 0.2 → 0.2.1
raw patch · 3 files changed
+9/−7 lines, 3 filesdep ~basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base
API changes (from Hackage documentation)
- Data.MultiSet: instance (Eq a) => Eq (MultiSet a)
- Data.MultiSet: instance (Ord a) => Monoid (MultiSet a)
- Data.MultiSet: instance (Ord a) => Ord (MultiSet a)
- Data.MultiSet: instance (Show a) => Show (MultiSet a)
+ Data.MultiSet: instance Eq a => Eq (MultiSet a)
+ Data.MultiSet: instance Ord a => Monoid (MultiSet a)
+ Data.MultiSet: instance Ord a => Ord (MultiSet a)
+ Data.MultiSet: instance Show a => Show (MultiSet a)
- Data.IntMultiSet: maxView :: (Monad m) => IntMultiSet -> m (Key, IntMultiSet)
+ Data.IntMultiSet: maxView :: Monad m => IntMultiSet -> m (Key, IntMultiSet)
- Data.IntMultiSet: minView :: (Monad m) => IntMultiSet -> m (Key, IntMultiSet)
+ Data.IntMultiSet: minView :: Monad m => IntMultiSet -> m (Key, IntMultiSet)
- Data.MultiSet: (\\) :: (Ord a) => MultiSet a -> MultiSet a -> MultiSet a
+ Data.MultiSet: (\\) :: Ord a => MultiSet a -> MultiSet a -> MultiSet a
- Data.MultiSet: delete :: (Ord a) => a -> MultiSet a -> MultiSet a
+ Data.MultiSet: delete :: Ord a => a -> MultiSet a -> MultiSet a
- Data.MultiSet: deleteAll :: (Ord a) => a -> MultiSet a -> MultiSet a
+ Data.MultiSet: deleteAll :: Ord a => a -> MultiSet a -> MultiSet a
- Data.MultiSet: deleteMany :: (Ord a) => a -> Occur -> MultiSet a -> MultiSet a
+ Data.MultiSet: deleteMany :: Ord a => a -> Occur -> MultiSet a -> MultiSet a
- Data.MultiSet: difference :: (Ord a) => MultiSet a -> MultiSet a -> MultiSet a
+ Data.MultiSet: difference :: Ord a => MultiSet a -> MultiSet a -> MultiSet a
- Data.MultiSet: filter :: (Ord a) => (a -> Bool) -> MultiSet a -> MultiSet a
+ Data.MultiSet: filter :: Ord a => (a -> Bool) -> MultiSet a -> MultiSet a
- Data.MultiSet: fromAscList :: (Eq a) => [a] -> MultiSet a
+ Data.MultiSet: fromAscList :: Eq a => [a] -> MultiSet a
- Data.MultiSet: fromAscOccurList :: (Eq a) => [(a, Occur)] -> MultiSet a
+ Data.MultiSet: fromAscOccurList :: Eq a => [(a, Occur)] -> MultiSet a
- Data.MultiSet: fromList :: (Ord a) => [a] -> MultiSet a
+ Data.MultiSet: fromList :: Ord a => [a] -> MultiSet a
- Data.MultiSet: fromMap :: (Ord a) => Map a Occur -> MultiSet a
+ Data.MultiSet: fromMap :: Ord a => Map a Occur -> MultiSet a
- Data.MultiSet: fromOccurList :: (Ord a) => [(a, Occur)] -> MultiSet a
+ Data.MultiSet: fromOccurList :: Ord a => [(a, Occur)] -> MultiSet a
- Data.MultiSet: insert :: (Ord a) => a -> MultiSet a -> MultiSet a
+ Data.MultiSet: insert :: Ord a => a -> MultiSet a -> MultiSet a
- Data.MultiSet: insertMany :: (Ord a) => a -> Occur -> MultiSet a -> MultiSet a
+ Data.MultiSet: insertMany :: Ord a => a -> Occur -> MultiSet a -> MultiSet a
- Data.MultiSet: intersection :: (Ord a) => MultiSet a -> MultiSet a -> MultiSet a
+ Data.MultiSet: intersection :: Ord a => MultiSet a -> MultiSet a -> MultiSet a
- Data.MultiSet: isProperSubsetOf :: (Ord a) => MultiSet a -> MultiSet a -> Bool
+ Data.MultiSet: isProperSubsetOf :: Ord a => MultiSet a -> MultiSet a -> Bool
- Data.MultiSet: isSubsetOf :: (Ord a) => MultiSet a -> MultiSet a -> Bool
+ Data.MultiSet: isSubsetOf :: Ord a => MultiSet a -> MultiSet a -> Bool
- Data.MultiSet: join :: (Ord a) => MultiSet (MultiSet a) -> MultiSet a
+ Data.MultiSet: join :: Ord a => MultiSet (MultiSet a) -> MultiSet a
- Data.MultiSet: maxUnion :: (Ord a) => MultiSet a -> MultiSet a -> MultiSet a
+ Data.MultiSet: maxUnion :: Ord a => MultiSet a -> MultiSet a -> MultiSet a
- Data.MultiSet: maxView :: (Monad m) => MultiSet a -> m (a, MultiSet a)
+ Data.MultiSet: maxView :: Monad m => MultiSet a -> m (a, MultiSet a)
- Data.MultiSet: member :: (Ord a) => a -> MultiSet a -> Bool
+ Data.MultiSet: member :: Ord a => a -> MultiSet a -> Bool
- Data.MultiSet: minView :: (Monad m) => MultiSet a -> m (a, MultiSet a)
+ Data.MultiSet: minView :: Monad m => MultiSet a -> m (a, MultiSet a)
- Data.MultiSet: notMember :: (Ord a) => a -> MultiSet a -> Bool
+ Data.MultiSet: notMember :: Ord a => a -> MultiSet a -> Bool
- Data.MultiSet: occur :: (Ord a) => a -> MultiSet a -> Occur
+ Data.MultiSet: occur :: Ord a => a -> MultiSet a -> Occur
- Data.MultiSet: partition :: (Ord a) => (a -> Bool) -> MultiSet a -> (MultiSet a, MultiSet a)
+ Data.MultiSet: partition :: Ord a => (a -> Bool) -> MultiSet a -> (MultiSet a, MultiSet a)
- Data.MultiSet: showTree :: (Show a) => MultiSet a -> String
+ Data.MultiSet: showTree :: Show a => MultiSet a -> String
- Data.MultiSet: showTreeWith :: (Show a) => Bool -> Bool -> MultiSet a -> String
+ Data.MultiSet: showTreeWith :: Show a => Bool -> Bool -> MultiSet a -> String
- Data.MultiSet: split :: (Ord a) => a -> MultiSet a -> (MultiSet a, MultiSet a)
+ Data.MultiSet: split :: Ord a => a -> MultiSet a -> (MultiSet a, MultiSet a)
- Data.MultiSet: splitOccur :: (Ord a) => a -> MultiSet a -> (MultiSet a, Occur, MultiSet a)
+ Data.MultiSet: splitOccur :: Ord a => a -> MultiSet a -> (MultiSet a, Occur, MultiSet a)
- Data.MultiSet: union :: (Ord a) => MultiSet a -> MultiSet a -> MultiSet a
+ Data.MultiSet: union :: Ord a => MultiSet a -> MultiSet a -> MultiSet a
- Data.MultiSet: unions :: (Ord a) => [MultiSet a] -> MultiSet a
+ Data.MultiSet: unions :: Ord a => [MultiSet a] -> MultiSet a
- Data.MultiSet: valid :: (Ord a) => MultiSet a -> Bool
+ Data.MultiSet: valid :: Ord a => MultiSet a -> Bool
Files
- Data/IntMultiSet.hs +2/−2
- Data/MultiSet.hs +2/−2
- multiset.cabal +5/−3
Data/IntMultiSet.hs view
@@ -147,7 +147,7 @@ import Data.Typeable #if __GLASGOW_HASKELL__ import Text.Read-import Data.Data (Data(..), mkNorepType)+import Data.Data (Data(..), mkNoRepType) #endif {--------------------------------------------------------------------@@ -191,7 +191,7 @@ gfoldl f z set = z fromList `f` (toList set) toConstr _ = error "toConstr" gunfold _ _ = error "gunfold"- dataTypeOf _ = mkNorepType "Data.IntMultiSet.IntMultiSet"+ dataTypeOf _ = mkNoRepType "Data.IntMultiSet.IntMultiSet" #endif
Data/MultiSet.hs view
@@ -152,7 +152,7 @@ import Data.Typeable #if __GLASGOW_HASKELL__ import Text.Read-import Data.Data (Data(..), mkNorepType)+import Data.Data (Data(..), mkNoRepType) #endif {--------------------------------------------------------------------@@ -197,7 +197,7 @@ gfoldl f z set = z fromList `f` (toList set) toConstr _ = error "toConstr" gunfold _ _ = error "gunfold"- dataTypeOf _ = mkNorepType "Data.MultiSet.MultiSet"+ dataTypeOf _ = mkNoRepType "Data.MultiSet.MultiSet" dataCast1 f = gcast1 f #endif
multiset.cabal view
@@ -1,10 +1,12 @@ name: multiset-version: 0.2+version: 0.2.1 author: Twan van Laarhoven maintainer: twanvl@gmail.com category: Data Structures synopsis: The Data.MultiSet container type-description: A variation of Data.Set. Multisets, sometimes also called bags, can contain multiple copies of the same key.+description:+ A variation of Data.Set.+ Multisets, sometimes also called bags, can contain multiple copies of the same key. license: BSD3 license-file: LICENSE build-type: Simple@@ -17,4 +19,4 @@ include-dirs: include extensions: CPP ghc-options: -Wall- build-depends: containers, base >= 2 && < 5+ build-depends: containers, base >= 4 && < 5