enummapset 0.5.2.1 → 0.5.2.2
raw patch · 3 files changed
+7/−3 lines, 3 filesdep +semigroupsdep ~basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies added: semigroups
Dependency ranges changed: base
API changes (from Hackage documentation)
- Data.EnumSet: instance (Enum k, Read k) => Read (EnumSet k)
- Data.EnumSet: instance (Enum k, Show k) => Show (EnumSet k)
- Data.EnumSet: instance Eq (EnumSet k)
- Data.EnumSet: instance Monoid (EnumSet k)
- Data.EnumSet: instance NFData (EnumSet k)
- Data.EnumSet: instance Ord (EnumSet k)
- Data.EnumSet: instance Typeable EnumSet
+ Data.EnumSet: instance (GHC.Enum.Enum k, GHC.Read.Read k) => GHC.Read.Read (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance (GHC.Enum.Enum k, GHC.Show.Show k) => GHC.Show.Show (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance Control.DeepSeq.NFData (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance Data.Semigroup.Semigroup (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance GHC.Base.Monoid (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance GHC.Classes.Eq (Data.EnumSet.EnumSet k)
+ Data.EnumSet: instance GHC.Classes.Ord (Data.EnumSet.EnumSet k)
- Data.EnumMap: foldWithKey :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
+ Data.EnumMap: foldWithKey :: (Enum k) => (k -> a -> b -> b) -> b -> EnumMap k a -> b
- Data.EnumMap: insertWith' :: Enum k => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap: insertWith' :: (Enum k) => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
- Data.EnumMap: insertWithKey' :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap: insertWithKey' :: (Enum k) => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: (!) :: Enum k => EnumMap k a -> k -> a
+ Data.EnumMap.Lazy: (!) :: (Enum k) => EnumMap k a -> k -> a
- Data.EnumMap.Lazy: adjust :: Enum k => (a -> a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: adjust :: (Enum k) => (a -> a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: adjustWithKey :: Enum k => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: adjustWithKey :: (Enum k) => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: alter :: Enum k => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: alter :: (Enum k) => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: assocs :: Enum k => EnumMap k a -> [(k, a)]
+ Data.EnumMap.Lazy: assocs :: (Enum k) => EnumMap k a -> [(k, a)]
- Data.EnumMap.Lazy: delete :: Enum k => k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: delete :: (Enum k) => k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: deleteFindMax :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)
+ Data.EnumMap.Lazy: deleteFindMax :: (Enum k) => EnumMap k a -> ((k, a), EnumMap k a)
- Data.EnumMap.Lazy: deleteFindMin :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)
+ Data.EnumMap.Lazy: deleteFindMin :: (Enum k) => EnumMap k a -> ((k, a), EnumMap k a)
- Data.EnumMap.Lazy: differenceWithKey :: Enum k => (k -> a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a
+ Data.EnumMap.Lazy: differenceWithKey :: (Enum k) => (k -> a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a
- Data.EnumMap.Lazy: filterWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: filterWithKey :: (Enum k) => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: findMax :: Enum k => EnumMap k a -> (k, a)
+ Data.EnumMap.Lazy: findMax :: (Enum k) => EnumMap k a -> (k, a)
- Data.EnumMap.Lazy: findMin :: Enum k => EnumMap k a -> (k, a)
+ Data.EnumMap.Lazy: findMin :: (Enum k) => EnumMap k a -> (k, a)
- Data.EnumMap.Lazy: findWithDefault :: Enum k => a -> k -> EnumMap k a -> a
+ Data.EnumMap.Lazy: findWithDefault :: (Enum k) => a -> k -> EnumMap k a -> a
- Data.EnumMap.Lazy: foldlWithKey :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a
+ Data.EnumMap.Lazy: foldlWithKey :: (Enum k) => (a -> k -> b -> a) -> a -> EnumMap k b -> a
- Data.EnumMap.Lazy: foldlWithKey' :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a
+ Data.EnumMap.Lazy: foldlWithKey' :: (Enum k) => (a -> k -> b -> a) -> a -> EnumMap k b -> a
- Data.EnumMap.Lazy: foldrWithKey :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
+ Data.EnumMap.Lazy: foldrWithKey :: (Enum k) => (k -> a -> b -> b) -> b -> EnumMap k a -> b
- Data.EnumMap.Lazy: foldrWithKey' :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
+ Data.EnumMap.Lazy: foldrWithKey' :: (Enum k) => (k -> a -> b -> b) -> b -> EnumMap k a -> b
- Data.EnumMap.Lazy: fromAscList :: Enum k => [(k, a)] -> EnumMap k a
+ Data.EnumMap.Lazy: fromAscList :: (Enum k) => [(k, a)] -> EnumMap k a
- Data.EnumMap.Lazy: fromAscListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a
+ Data.EnumMap.Lazy: fromAscListWith :: (Enum k) => (a -> a -> a) -> [(k, a)] -> EnumMap k a
- Data.EnumMap.Lazy: fromAscListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
+ Data.EnumMap.Lazy: fromAscListWithKey :: (Enum k) => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
- Data.EnumMap.Lazy: fromDistinctAscList :: Enum k => [(k, a)] -> EnumMap k a
+ Data.EnumMap.Lazy: fromDistinctAscList :: (Enum k) => [(k, a)] -> EnumMap k a
- Data.EnumMap.Lazy: fromList :: Enum k => [(k, a)] -> EnumMap k a
+ Data.EnumMap.Lazy: fromList :: (Enum k) => [(k, a)] -> EnumMap k a
- Data.EnumMap.Lazy: fromListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a
+ Data.EnumMap.Lazy: fromListWith :: (Enum k) => (a -> a -> a) -> [(k, a)] -> EnumMap k a
- Data.EnumMap.Lazy: fromListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
+ Data.EnumMap.Lazy: fromListWithKey :: (Enum k) => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
- Data.EnumMap.Lazy: fromSet :: Enum k => (k -> a) -> EnumSet k -> EnumMap k a
+ Data.EnumMap.Lazy: fromSet :: (Enum k) => (k -> a) -> EnumSet k -> EnumMap k a
- Data.EnumMap.Lazy: insert :: Enum k => k -> a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: insert :: (Enum k) => k -> a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: insertLookupWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> (Maybe a, EnumMap k a)
+ Data.EnumMap.Lazy: insertLookupWithKey :: (Enum k) => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> (Maybe a, EnumMap k a)
- Data.EnumMap.Lazy: insertWith :: Enum k => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: insertWith :: (Enum k) => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: insertWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: insertWithKey :: (Enum k) => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: intersectionWithKey :: Enum k => (k -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
+ Data.EnumMap.Lazy: intersectionWithKey :: (Enum k) => (k -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
- Data.EnumMap.Lazy: isProperSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool
+ Data.EnumMap.Lazy: isProperSubmapOf :: (Eq a) => EnumMap k a -> EnumMap k a -> Bool
- Data.EnumMap.Lazy: keys :: Enum k => EnumMap k a -> [k]
+ Data.EnumMap.Lazy: keys :: (Enum k) => EnumMap k a -> [k]
- Data.EnumMap.Lazy: keysSet :: Enum k => EnumMap k a -> EnumSet k
+ Data.EnumMap.Lazy: keysSet :: (Enum k) => EnumMap k a -> EnumSet k
- Data.EnumMap.Lazy: lookup :: Enum k => k -> EnumMap k a -> Maybe a
+ Data.EnumMap.Lazy: lookup :: (Enum k) => k -> EnumMap k a -> Maybe a
- Data.EnumMap.Lazy: lookupGE :: Enum k => k -> EnumMap k a -> Maybe (k, a)
+ Data.EnumMap.Lazy: lookupGE :: (Enum k) => k -> EnumMap k a -> Maybe (k, a)
- Data.EnumMap.Lazy: lookupGT :: Enum k => k -> EnumMap k a -> Maybe (k, a)
+ Data.EnumMap.Lazy: lookupGT :: (Enum k) => k -> EnumMap k a -> Maybe (k, a)
- Data.EnumMap.Lazy: lookupLE :: Enum k => k -> EnumMap k a -> Maybe (k, a)
+ Data.EnumMap.Lazy: lookupLE :: (Enum k) => k -> EnumMap k a -> Maybe (k, a)
- Data.EnumMap.Lazy: lookupLT :: Enum k => k -> EnumMap k a -> Maybe (k, a)
+ Data.EnumMap.Lazy: lookupLT :: (Enum k) => k -> EnumMap k a -> Maybe (k, a)
- Data.EnumMap.Lazy: mapAccumRWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
+ Data.EnumMap.Lazy: mapAccumRWithKey :: (Enum k) => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
- Data.EnumMap.Lazy: mapAccumWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
+ Data.EnumMap.Lazy: mapAccumWithKey :: (Enum k) => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
- Data.EnumMap.Lazy: mapEitherWithKey :: Enum k => (k -> a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)
+ Data.EnumMap.Lazy: mapEitherWithKey :: (Enum k) => (k -> a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)
- Data.EnumMap.Lazy: mapKeys :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: mapKeys :: (Enum k) => (k -> k) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: mapKeysMonotonic :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: mapKeysMonotonic :: (Enum k) => (k -> k) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: mapKeysWith :: Enum k => (a -> a -> a) -> (k -> k) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: mapKeysWith :: (Enum k) => (a -> a -> a) -> (k -> k) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: mapMaybeWithKey :: Enum k => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b
+ Data.EnumMap.Lazy: mapMaybeWithKey :: (Enum k) => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b
- Data.EnumMap.Lazy: mapWithKey :: Enum k => (k -> a -> b) -> EnumMap k a -> EnumMap k b
+ Data.EnumMap.Lazy: mapWithKey :: (Enum k) => (k -> a -> b) -> EnumMap k a -> EnumMap k b
- Data.EnumMap.Lazy: maxViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)
+ Data.EnumMap.Lazy: maxViewWithKey :: (Enum k) => EnumMap k a -> Maybe ((k, a), EnumMap k a)
- Data.EnumMap.Lazy: member :: Enum k => k -> EnumMap k a -> Bool
+ Data.EnumMap.Lazy: member :: (Enum k) => k -> EnumMap k a -> Bool
- Data.EnumMap.Lazy: mergeWithKey :: Enum k => (k -> a -> b -> Maybe c) -> (EnumMap k a -> EnumMap k c) -> (EnumMap k b -> EnumMap k c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
+ Data.EnumMap.Lazy: mergeWithKey :: (Enum k) => (k -> a -> b -> Maybe c) -> (EnumMap k a -> EnumMap k c) -> (EnumMap k b -> EnumMap k c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
- Data.EnumMap.Lazy: minViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)
+ Data.EnumMap.Lazy: minViewWithKey :: (Enum k) => EnumMap k a -> Maybe ((k, a), EnumMap k a)
- Data.EnumMap.Lazy: notMember :: Enum k => k -> EnumMap k a -> Bool
+ Data.EnumMap.Lazy: notMember :: (Enum k) => k -> EnumMap k a -> Bool
- Data.EnumMap.Lazy: partitionWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)
+ Data.EnumMap.Lazy: partitionWithKey :: (Enum k) => (k -> a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)
- Data.EnumMap.Lazy: singleton :: Enum k => k -> a -> EnumMap k a
+ Data.EnumMap.Lazy: singleton :: (Enum k) => k -> a -> EnumMap k a
- Data.EnumMap.Lazy: split :: Enum k => k -> EnumMap k a -> (EnumMap k a, EnumMap k a)
+ Data.EnumMap.Lazy: split :: (Enum k) => k -> EnumMap k a -> (EnumMap k a, EnumMap k a)
- Data.EnumMap.Lazy: splitLookup :: Enum k => k -> EnumMap k a -> (EnumMap k a, Maybe a, EnumMap k a)
+ Data.EnumMap.Lazy: splitLookup :: (Enum k) => k -> EnumMap k a -> (EnumMap k a, Maybe a, EnumMap k a)
- Data.EnumMap.Lazy: toAscList :: Enum k => EnumMap k a -> [(k, a)]
+ Data.EnumMap.Lazy: toAscList :: (Enum k) => EnumMap k a -> [(k, a)]
- Data.EnumMap.Lazy: toDescList :: Enum k => EnumMap k a -> [(k, a)]
+ Data.EnumMap.Lazy: toDescList :: (Enum k) => EnumMap k a -> [(k, a)]
- Data.EnumMap.Lazy: toList :: Enum k => EnumMap k a -> [(k, a)]
+ Data.EnumMap.Lazy: toList :: (Enum k) => EnumMap k a -> [(k, a)]
- Data.EnumMap.Lazy: unionWithKey :: Enum k => (k -> a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: unionWithKey :: (Enum k) => (k -> a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: update :: Enum k => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: update :: (Enum k) => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: updateLookupWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> (Maybe a, EnumMap k a)
+ Data.EnumMap.Lazy: updateLookupWithKey :: (Enum k) => (k -> a -> Maybe a) -> k -> EnumMap k a -> (Maybe a, EnumMap k a)
- Data.EnumMap.Lazy: updateMaxWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: updateMaxWithKey :: (Enum k) => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: updateMinWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: updateMinWithKey :: (Enum k) => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Lazy: updateWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Lazy: updateWithKey :: (Enum k) => (k -> a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: (!) :: Enum k => EnumMap k a -> k -> a
+ Data.EnumMap.Strict: (!) :: (Enum k) => EnumMap k a -> k -> a
- Data.EnumMap.Strict: adjust :: Enum k => (a -> a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: adjust :: (Enum k) => (a -> a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: adjustWithKey :: Enum k => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: adjustWithKey :: (Enum k) => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: alter :: Enum k => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: alter :: (Enum k) => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: assocs :: Enum k => EnumMap k a -> [(k, a)]
+ Data.EnumMap.Strict: assocs :: (Enum k) => EnumMap k a -> [(k, a)]
- Data.EnumMap.Strict: delete :: Enum k => k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: delete :: (Enum k) => k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: deleteFindMax :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)
+ Data.EnumMap.Strict: deleteFindMax :: (Enum k) => EnumMap k a -> ((k, a), EnumMap k a)
- Data.EnumMap.Strict: deleteFindMin :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)
+ Data.EnumMap.Strict: deleteFindMin :: (Enum k) => EnumMap k a -> ((k, a), EnumMap k a)
- Data.EnumMap.Strict: differenceWithKey :: Enum k => (k -> a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a
+ Data.EnumMap.Strict: differenceWithKey :: (Enum k) => (k -> a -> b -> Maybe a) -> EnumMap k a -> EnumMap k b -> EnumMap k a
- Data.EnumMap.Strict: filterWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: filterWithKey :: (Enum k) => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: findMax :: Enum k => EnumMap k a -> (k, a)
+ Data.EnumMap.Strict: findMax :: (Enum k) => EnumMap k a -> (k, a)
- Data.EnumMap.Strict: findMin :: Enum k => EnumMap k a -> (k, a)
+ Data.EnumMap.Strict: findMin :: (Enum k) => EnumMap k a -> (k, a)
- Data.EnumMap.Strict: findWithDefault :: Enum k => a -> k -> EnumMap k a -> a
+ Data.EnumMap.Strict: findWithDefault :: (Enum k) => a -> k -> EnumMap k a -> a
- Data.EnumMap.Strict: foldlWithKey :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a
+ Data.EnumMap.Strict: foldlWithKey :: (Enum k) => (a -> k -> b -> a) -> a -> EnumMap k b -> a
- Data.EnumMap.Strict: foldlWithKey' :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a
+ Data.EnumMap.Strict: foldlWithKey' :: (Enum k) => (a -> k -> b -> a) -> a -> EnumMap k b -> a
- Data.EnumMap.Strict: foldrWithKey :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
+ Data.EnumMap.Strict: foldrWithKey :: (Enum k) => (k -> a -> b -> b) -> b -> EnumMap k a -> b
- Data.EnumMap.Strict: foldrWithKey' :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b
+ Data.EnumMap.Strict: foldrWithKey' :: (Enum k) => (k -> a -> b -> b) -> b -> EnumMap k a -> b
- Data.EnumMap.Strict: fromAscList :: Enum k => [(k, a)] -> EnumMap k a
+ Data.EnumMap.Strict: fromAscList :: (Enum k) => [(k, a)] -> EnumMap k a
- Data.EnumMap.Strict: fromAscListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a
+ Data.EnumMap.Strict: fromAscListWith :: (Enum k) => (a -> a -> a) -> [(k, a)] -> EnumMap k a
- Data.EnumMap.Strict: fromAscListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
+ Data.EnumMap.Strict: fromAscListWithKey :: (Enum k) => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
- Data.EnumMap.Strict: fromDistinctAscList :: Enum k => [(k, a)] -> EnumMap k a
+ Data.EnumMap.Strict: fromDistinctAscList :: (Enum k) => [(k, a)] -> EnumMap k a
- Data.EnumMap.Strict: fromList :: Enum k => [(k, a)] -> EnumMap k a
+ Data.EnumMap.Strict: fromList :: (Enum k) => [(k, a)] -> EnumMap k a
- Data.EnumMap.Strict: fromListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a
+ Data.EnumMap.Strict: fromListWith :: (Enum k) => (a -> a -> a) -> [(k, a)] -> EnumMap k a
- Data.EnumMap.Strict: fromListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
+ Data.EnumMap.Strict: fromListWithKey :: (Enum k) => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a
- Data.EnumMap.Strict: fromSet :: Enum k => (k -> a) -> EnumSet k -> EnumMap k a
+ Data.EnumMap.Strict: fromSet :: (Enum k) => (k -> a) -> EnumSet k -> EnumMap k a
- Data.EnumMap.Strict: insert :: Enum k => k -> a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: insert :: (Enum k) => k -> a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: insertLookupWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> (Maybe a, EnumMap k a)
+ Data.EnumMap.Strict: insertLookupWithKey :: (Enum k) => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> (Maybe a, EnumMap k a)
- Data.EnumMap.Strict: insertWith :: Enum k => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: insertWith :: (Enum k) => (a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: insertWithKey :: Enum k => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: insertWithKey :: (Enum k) => (k -> a -> a -> a) -> k -> a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: intersectionWithKey :: Enum k => (k -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
+ Data.EnumMap.Strict: intersectionWithKey :: (Enum k) => (k -> a -> b -> c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
- Data.EnumMap.Strict: isProperSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool
+ Data.EnumMap.Strict: isProperSubmapOf :: (Eq a) => EnumMap k a -> EnumMap k a -> Bool
- Data.EnumMap.Strict: keys :: Enum k => EnumMap k a -> [k]
+ Data.EnumMap.Strict: keys :: (Enum k) => EnumMap k a -> [k]
- Data.EnumMap.Strict: keysSet :: Enum k => EnumMap k a -> EnumSet k
+ Data.EnumMap.Strict: keysSet :: (Enum k) => EnumMap k a -> EnumSet k
- Data.EnumMap.Strict: lookup :: Enum k => k -> EnumMap k a -> Maybe a
+ Data.EnumMap.Strict: lookup :: (Enum k) => k -> EnumMap k a -> Maybe a
- Data.EnumMap.Strict: lookupGE :: Enum k => k -> EnumMap k a -> Maybe (k, a)
+ Data.EnumMap.Strict: lookupGE :: (Enum k) => k -> EnumMap k a -> Maybe (k, a)
- Data.EnumMap.Strict: lookupGT :: Enum k => k -> EnumMap k a -> Maybe (k, a)
+ Data.EnumMap.Strict: lookupGT :: (Enum k) => k -> EnumMap k a -> Maybe (k, a)
- Data.EnumMap.Strict: lookupLE :: Enum k => k -> EnumMap k a -> Maybe (k, a)
+ Data.EnumMap.Strict: lookupLE :: (Enum k) => k -> EnumMap k a -> Maybe (k, a)
- Data.EnumMap.Strict: lookupLT :: Enum k => k -> EnumMap k a -> Maybe (k, a)
+ Data.EnumMap.Strict: lookupLT :: (Enum k) => k -> EnumMap k a -> Maybe (k, a)
- Data.EnumMap.Strict: mapAccumRWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
+ Data.EnumMap.Strict: mapAccumRWithKey :: (Enum k) => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
- Data.EnumMap.Strict: mapAccumWithKey :: Enum k => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
+ Data.EnumMap.Strict: mapAccumWithKey :: (Enum k) => (a -> k -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)
- Data.EnumMap.Strict: mapEitherWithKey :: Enum k => (k -> a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)
+ Data.EnumMap.Strict: mapEitherWithKey :: (Enum k) => (k -> a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)
- Data.EnumMap.Strict: mapKeys :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: mapKeys :: (Enum k) => (k -> k) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: mapKeysMonotonic :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: mapKeysMonotonic :: (Enum k) => (k -> k) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: mapKeysWith :: Enum k => (a -> a -> a) -> (k -> k) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: mapKeysWith :: (Enum k) => (a -> a -> a) -> (k -> k) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: mapMaybeWithKey :: Enum k => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b
+ Data.EnumMap.Strict: mapMaybeWithKey :: (Enum k) => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b
- Data.EnumMap.Strict: mapWithKey :: Enum k => (k -> a -> b) -> EnumMap k a -> EnumMap k b
+ Data.EnumMap.Strict: mapWithKey :: (Enum k) => (k -> a -> b) -> EnumMap k a -> EnumMap k b
- Data.EnumMap.Strict: maxViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)
+ Data.EnumMap.Strict: maxViewWithKey :: (Enum k) => EnumMap k a -> Maybe ((k, a), EnumMap k a)
- Data.EnumMap.Strict: member :: Enum k => k -> EnumMap k a -> Bool
+ Data.EnumMap.Strict: member :: (Enum k) => k -> EnumMap k a -> Bool
- Data.EnumMap.Strict: mergeWithKey :: Enum k => (k -> a -> b -> Maybe c) -> (EnumMap k a -> EnumMap k c) -> (EnumMap k b -> EnumMap k c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
+ Data.EnumMap.Strict: mergeWithKey :: (Enum k) => (k -> a -> b -> Maybe c) -> (EnumMap k a -> EnumMap k c) -> (EnumMap k b -> EnumMap k c) -> EnumMap k a -> EnumMap k b -> EnumMap k c
- Data.EnumMap.Strict: minViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)
+ Data.EnumMap.Strict: minViewWithKey :: (Enum k) => EnumMap k a -> Maybe ((k, a), EnumMap k a)
- Data.EnumMap.Strict: notMember :: Enum k => k -> EnumMap k a -> Bool
+ Data.EnumMap.Strict: notMember :: (Enum k) => k -> EnumMap k a -> Bool
- Data.EnumMap.Strict: partitionWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)
+ Data.EnumMap.Strict: partitionWithKey :: (Enum k) => (k -> a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)
- Data.EnumMap.Strict: singleton :: Enum k => k -> a -> EnumMap k a
+ Data.EnumMap.Strict: singleton :: (Enum k) => k -> a -> EnumMap k a
- Data.EnumMap.Strict: split :: Enum k => k -> EnumMap k a -> (EnumMap k a, EnumMap k a)
+ Data.EnumMap.Strict: split :: (Enum k) => k -> EnumMap k a -> (EnumMap k a, EnumMap k a)
- Data.EnumMap.Strict: splitLookup :: Enum k => k -> EnumMap k a -> (EnumMap k a, Maybe a, EnumMap k a)
+ Data.EnumMap.Strict: splitLookup :: (Enum k) => k -> EnumMap k a -> (EnumMap k a, Maybe a, EnumMap k a)
- Data.EnumMap.Strict: toAscList :: Enum k => EnumMap k a -> [(k, a)]
+ Data.EnumMap.Strict: toAscList :: (Enum k) => EnumMap k a -> [(k, a)]
- Data.EnumMap.Strict: toDescList :: Enum k => EnumMap k a -> [(k, a)]
+ Data.EnumMap.Strict: toDescList :: (Enum k) => EnumMap k a -> [(k, a)]
- Data.EnumMap.Strict: toList :: Enum k => EnumMap k a -> [(k, a)]
+ Data.EnumMap.Strict: toList :: (Enum k) => EnumMap k a -> [(k, a)]
- Data.EnumMap.Strict: unionWithKey :: Enum k => (k -> a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: unionWithKey :: (Enum k) => (k -> a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: update :: Enum k => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: update :: (Enum k) => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: updateLookupWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> (Maybe a, EnumMap k a)
+ Data.EnumMap.Strict: updateLookupWithKey :: (Enum k) => (k -> a -> Maybe a) -> k -> EnumMap k a -> (Maybe a, EnumMap k a)
- Data.EnumMap.Strict: updateMaxWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: updateMaxWithKey :: (Enum k) => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: updateMinWithKey :: Enum k => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: updateMinWithKey :: (Enum k) => (k -> a -> Maybe a) -> EnumMap k a -> EnumMap k a
- Data.EnumMap.Strict: updateWithKey :: Enum k => (k -> a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
+ Data.EnumMap.Strict: updateWithKey :: (Enum k) => (k -> a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a
- Data.EnumSet: delete :: Enum k => k -> EnumSet k -> EnumSet k
+ Data.EnumSet: delete :: (Enum k) => k -> EnumSet k -> EnumSet k
- Data.EnumSet: deleteFindMax :: Enum k => EnumSet k -> (k, EnumSet k)
+ Data.EnumSet: deleteFindMax :: (Enum k) => EnumSet k -> (k, EnumSet k)
- Data.EnumSet: deleteFindMin :: Enum k => EnumSet k -> (k, EnumSet k)
+ Data.EnumSet: deleteFindMin :: (Enum k) => EnumSet k -> (k, EnumSet k)
- Data.EnumSet: elems :: Enum k => EnumSet k -> [k]
+ Data.EnumSet: elems :: (Enum k) => EnumSet k -> [k]
- Data.EnumSet: filter :: Enum k => (k -> Bool) -> EnumSet k -> EnumSet k
+ Data.EnumSet: filter :: (Enum k) => (k -> Bool) -> EnumSet k -> EnumSet k
- Data.EnumSet: findMax :: Enum k => EnumSet k -> k
+ Data.EnumSet: findMax :: (Enum k) => EnumSet k -> k
- Data.EnumSet: findMin :: Enum k => EnumSet k -> k
+ Data.EnumSet: findMin :: (Enum k) => EnumSet k -> k
- Data.EnumSet: fold :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
+ Data.EnumSet: fold :: (Enum k) => (k -> b -> b) -> b -> EnumSet k -> b
- Data.EnumSet: foldl :: Enum k => (a -> k -> a) -> a -> EnumSet k -> a
+ Data.EnumSet: foldl :: (Enum k) => (a -> k -> a) -> a -> EnumSet k -> a
- Data.EnumSet: foldl' :: Enum k => (a -> k -> a) -> a -> EnumSet k -> a
+ Data.EnumSet: foldl' :: (Enum k) => (a -> k -> a) -> a -> EnumSet k -> a
- Data.EnumSet: foldr :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
+ Data.EnumSet: foldr :: (Enum k) => (k -> b -> b) -> b -> EnumSet k -> b
- Data.EnumSet: foldr' :: Enum k => (k -> b -> b) -> b -> EnumSet k -> b
+ Data.EnumSet: foldr' :: (Enum k) => (k -> b -> b) -> b -> EnumSet k -> b
- Data.EnumSet: fromAscList :: Enum k => [k] -> EnumSet k
+ Data.EnumSet: fromAscList :: (Enum k) => [k] -> EnumSet k
- Data.EnumSet: fromDistinctAscList :: Enum k => [k] -> EnumSet k
+ Data.EnumSet: fromDistinctAscList :: (Enum k) => [k] -> EnumSet k
- Data.EnumSet: fromList :: Enum k => [k] -> EnumSet k
+ Data.EnumSet: fromList :: (Enum k) => [k] -> EnumSet k
- Data.EnumSet: insert :: Enum k => k -> EnumSet k -> EnumSet k
+ Data.EnumSet: insert :: (Enum k) => k -> EnumSet k -> EnumSet k
- Data.EnumSet: lookupGE :: Enum k => k -> EnumSet k -> Maybe k
+ Data.EnumSet: lookupGE :: (Enum k) => k -> EnumSet k -> Maybe k
- Data.EnumSet: lookupGT :: Enum k => k -> EnumSet k -> Maybe k
+ Data.EnumSet: lookupGT :: (Enum k) => k -> EnumSet k -> Maybe k
- Data.EnumSet: lookupLE :: Enum k => k -> EnumSet k -> Maybe k
+ Data.EnumSet: lookupLE :: (Enum k) => k -> EnumSet k -> Maybe k
- Data.EnumSet: lookupLT :: Enum k => k -> EnumSet k -> Maybe k
+ Data.EnumSet: lookupLT :: (Enum k) => k -> EnumSet k -> Maybe k
- Data.EnumSet: map :: Enum k => (k -> k) -> EnumSet k -> EnumSet k
+ Data.EnumSet: map :: (Enum k) => (k -> k) -> EnumSet k -> EnumSet k
- Data.EnumSet: maxView :: Enum k => EnumSet k -> Maybe (k, EnumSet k)
+ Data.EnumSet: maxView :: (Enum k) => EnumSet k -> Maybe (k, EnumSet k)
- Data.EnumSet: member :: Enum k => k -> EnumSet k -> Bool
+ Data.EnumSet: member :: (Enum k) => k -> EnumSet k -> Bool
- Data.EnumSet: minView :: Enum k => EnumSet k -> Maybe (k, EnumSet k)
+ Data.EnumSet: minView :: (Enum k) => EnumSet k -> Maybe (k, EnumSet k)
- Data.EnumSet: notMember :: Enum k => k -> EnumSet k -> Bool
+ Data.EnumSet: notMember :: (Enum k) => k -> EnumSet k -> Bool
- Data.EnumSet: partition :: Enum k => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k)
+ Data.EnumSet: partition :: (Enum k) => (k -> Bool) -> EnumSet k -> (EnumSet k, EnumSet k)
- Data.EnumSet: singleton :: Enum k => k -> EnumSet k
+ Data.EnumSet: singleton :: (Enum k) => k -> EnumSet k
- Data.EnumSet: split :: Enum k => k -> EnumSet k -> (EnumSet k, EnumSet k)
+ Data.EnumSet: split :: (Enum k) => k -> EnumSet k -> (EnumSet k, EnumSet k)
- Data.EnumSet: splitMember :: Enum k => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k)
+ Data.EnumSet: splitMember :: (Enum k) => k -> EnumSet k -> (EnumSet k, Bool, EnumSet k)
- Data.EnumSet: toAscList :: Enum k => EnumSet k -> [k]
+ Data.EnumSet: toAscList :: (Enum k) => EnumSet k -> [k]
- Data.EnumSet: toDescList :: Enum k => EnumSet k -> [k]
+ Data.EnumSet: toDescList :: (Enum k) => EnumSet k -> [k]
- Data.EnumSet: toList :: Enum k => EnumSet k -> [k]
+ Data.EnumSet: toList :: (Enum k) => EnumSet k -> [k]
Files
- Data/EnumMap/Base.hs +3/−1
- Data/EnumSet.hs +2/−1
- enummapset.cabal +2/−1
Data/EnumMap/Base.hs view
@@ -171,6 +171,7 @@ import Control.DeepSeq ( NFData ) import Data.Foldable ( Foldable ) import Data.Monoid ( Monoid )+import Data.Semigroup ( Semigroup ) import Data.Traversable ( Traversable ) import Data.Typeable ( Typeable ) @@ -178,7 +179,8 @@ -- | Wrapper for 'IntMap' with 'Enum' keys. newtype EnumMap k a = EnumMap { unWrap :: IntMap a }- deriving (Eq, Foldable, Functor, Ord, Monoid, Traversable, Typeable, NFData)+ deriving (Eq, Foldable, Functor, Ord, Semigroup, Monoid,+ Traversable, Typeable, NFData) instance (Enum k, Show k, Show a) => Show (EnumMap k a) where showsPrec p em = showParen (p > 10) $
Data/EnumSet.hs view
@@ -102,13 +102,14 @@ import Control.Arrow ( (***) ) import Control.DeepSeq ( NFData ) import Data.Monoid ( Monoid )+import Data.Semigroup ( Semigroup ) import Data.Typeable ( Typeable ) import Text.Read -- | Wrapper for 'IntSet' with 'Enum' elements. newtype EnumSet k = EnumSet { unWrap :: IntSet }- deriving (Eq, Monoid, Ord, Typeable, NFData)+ deriving (Eq, Semigroup, Monoid, Ord, Typeable, NFData) instance (Enum k, Show k) => Show (EnumSet k) where showsPrec p ks = showParen (p > 10) $
enummapset.cabal view
@@ -1,5 +1,5 @@ name: enummapset-version: 0.5.2.1+version: 0.5.2.2 synopsis: IntMap and IntSet with Enum keys/elements. description: This package contains simple wrappers around 'Data.IntMap' and 'Data.IntSet' with 'Enum' keys and elements respectively.@@ -38,6 +38,7 @@ build-depends: base < 5, containers >= 0.5.2 && < 0.6,+ semigroups >=0.1 && <1.0, deepseq if flag(debug)