packages feed

monoidal-containers 0.6.5.0 → 0.6.6.0

raw patch · 2 files changed

+10/−5 lines, 2 filesnew-uploaderPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Data.IntMap.Monoidal: (!) :: MonoidalIntMap a -> Int -> a
+ Data.IntMap.Monoidal: (!) :: forall a. MonoidalIntMap a -> Int -> a
- Data.IntMap.Monoidal: (\\) :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
+ Data.IntMap.Monoidal: (\\) :: forall a b. MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
- Data.IntMap.Monoidal: adjust :: (a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: adjust :: forall a. (a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: adjustWithKey :: (Int -> a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: adjustWithKey :: forall a. (Int -> a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: alter :: (Maybe a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: alter :: forall a. (Maybe a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: deleteFindMax :: MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)
+ Data.IntMap.Monoidal: deleteFindMax :: forall a. MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)
- Data.IntMap.Monoidal: deleteFindMin :: MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)
+ Data.IntMap.Monoidal: deleteFindMin :: forall a. MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)
- Data.IntMap.Monoidal: deleteMax :: MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: deleteMax :: forall a. MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: deleteMin :: MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: deleteMin :: forall a. MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: difference :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
+ Data.IntMap.Monoidal: difference :: forall a b. MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
- Data.IntMap.Monoidal: differenceWith :: (a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
+ Data.IntMap.Monoidal: differenceWith :: forall a b. (a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
- Data.IntMap.Monoidal: differenceWithKey :: (Int -> a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
+ Data.IntMap.Monoidal: differenceWithKey :: forall a b. (Int -> a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
- Data.IntMap.Monoidal: empty :: MonoidalIntMap a
+ Data.IntMap.Monoidal: empty :: forall a. MonoidalIntMap a
- Data.IntMap.Monoidal: filter :: (a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: filter :: forall a. (a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: filterWithKey :: (Int -> a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: filterWithKey :: forall a. (Int -> a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: findMax :: MonoidalIntMap a -> (Int, a)
+ Data.IntMap.Monoidal: findMax :: forall a. MonoidalIntMap a -> (Int, a)
- Data.IntMap.Monoidal: findMin :: MonoidalIntMap a -> (Int, a)
+ Data.IntMap.Monoidal: findMin :: forall a. MonoidalIntMap a -> (Int, a)
- Data.IntMap.Monoidal: findWithDefault :: a -> Int -> MonoidalIntMap a -> a
+ Data.IntMap.Monoidal: findWithDefault :: forall a. a -> Int -> MonoidalIntMap a -> a
- Data.IntMap.Monoidal: foldl :: (a -> b -> a) -> a -> MonoidalIntMap b -> a
+ Data.IntMap.Monoidal: foldl :: forall a b. (a -> b -> a) -> a -> MonoidalIntMap b -> a
- Data.IntMap.Monoidal: foldl' :: (a -> b -> a) -> a -> MonoidalIntMap b -> a
+ Data.IntMap.Monoidal: foldl' :: forall a b. (a -> b -> a) -> a -> MonoidalIntMap b -> a
- Data.IntMap.Monoidal: foldlWithKey :: (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a
+ Data.IntMap.Monoidal: foldlWithKey :: forall a b. (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a
- Data.IntMap.Monoidal: foldlWithKey' :: (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a
+ Data.IntMap.Monoidal: foldlWithKey' :: forall a b. (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a
- Data.IntMap.Monoidal: foldr :: (a -> b -> b) -> b -> MonoidalIntMap a -> b
+ Data.IntMap.Monoidal: foldr :: forall a b. (a -> b -> b) -> b -> MonoidalIntMap a -> b
- Data.IntMap.Monoidal: foldr' :: (a -> b -> b) -> b -> MonoidalIntMap a -> b
+ Data.IntMap.Monoidal: foldr' :: forall a b. (a -> b -> b) -> b -> MonoidalIntMap a -> b
- Data.IntMap.Monoidal: foldrWithKey :: (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b
+ Data.IntMap.Monoidal: foldrWithKey :: forall a b. (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b
- Data.IntMap.Monoidal: foldrWithKey' :: (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b
+ Data.IntMap.Monoidal: foldrWithKey' :: forall a b. (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b
- Data.IntMap.Monoidal: fromAscList :: [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromAscList :: forall a. [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal: fromAscListWith :: (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromAscListWith :: forall a. (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal: fromAscListWithKey :: (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromAscListWithKey :: forall a. (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal: fromDistinctAscList :: [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromDistinctAscList :: forall a. [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal: fromDistinctList :: [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromDistinctList :: forall a. [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal: fromList :: [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromList :: forall a. [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal: fromListWith :: (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromListWith :: forall a. (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal: fromListWithKey :: (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromListWithKey :: forall a. (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal: fromSet :: (Int -> a) -> IntSet -> MonoidalIntMap a
+ Data.IntMap.Monoidal: fromSet :: forall a. (Int -> a) -> IntSet -> MonoidalIntMap a
- Data.IntMap.Monoidal: insert :: Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: insert :: forall a. Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: insertLookupWithKey :: (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)
+ Data.IntMap.Monoidal: insertLookupWithKey :: forall a. (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)
- Data.IntMap.Monoidal: insertWith :: (a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: insertWith :: forall a. (a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: insertWithKey :: (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: insertWithKey :: forall a. (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: intersectionWith :: (a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
+ Data.IntMap.Monoidal: intersectionWith :: forall a b c. (a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
- Data.IntMap.Monoidal: intersectionWithKey :: (Int -> a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
+ Data.IntMap.Monoidal: intersectionWithKey :: forall a b c. (Int -> a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
- Data.IntMap.Monoidal: isProperSubmapOf :: Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool
+ Data.IntMap.Monoidal: isProperSubmapOf :: forall a. Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool
- Data.IntMap.Monoidal: isProperSubmapOfBy :: (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool
+ Data.IntMap.Monoidal: isProperSubmapOfBy :: forall a b. (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool
- Data.IntMap.Monoidal: isSubmapOf :: Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool
+ Data.IntMap.Monoidal: isSubmapOf :: forall a. Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool
- Data.IntMap.Monoidal: isSubmapOfBy :: (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool
+ Data.IntMap.Monoidal: isSubmapOfBy :: forall a b. (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool
- Data.IntMap.Monoidal: keysSet :: MonoidalIntMap a -> IntSet
+ Data.IntMap.Monoidal: keysSet :: forall a. MonoidalIntMap a -> IntSet
- Data.IntMap.Monoidal: lookup :: Int -> MonoidalIntMap a -> Maybe a
+ Data.IntMap.Monoidal: lookup :: forall a. Int -> MonoidalIntMap a -> Maybe a
- Data.IntMap.Monoidal: lookupGE :: Int -> MonoidalIntMap a -> Maybe (Int, a)
+ Data.IntMap.Monoidal: lookupGE :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)
- Data.IntMap.Monoidal: lookupGT :: Int -> MonoidalIntMap a -> Maybe (Int, a)
+ Data.IntMap.Monoidal: lookupGT :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)
- Data.IntMap.Monoidal: lookupLE :: Int -> MonoidalIntMap a -> Maybe (Int, a)
+ Data.IntMap.Monoidal: lookupLE :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)
- Data.IntMap.Monoidal: lookupLT :: Int -> MonoidalIntMap a -> Maybe (Int, a)
+ Data.IntMap.Monoidal: lookupLT :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)
- Data.IntMap.Monoidal: mapAccum :: (a -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
+ Data.IntMap.Monoidal: mapAccum :: forall a b c. (a -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
- Data.IntMap.Monoidal: mapAccumRWithKey :: (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
+ Data.IntMap.Monoidal: mapAccumRWithKey :: forall a b c. (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
- Data.IntMap.Monoidal: mapAccumWithKey :: (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
+ Data.IntMap.Monoidal: mapAccumWithKey :: forall a b c. (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
- Data.IntMap.Monoidal: mapEither :: (a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)
+ Data.IntMap.Monoidal: mapEither :: forall a b c. (a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)
- Data.IntMap.Monoidal: mapEitherWithKey :: (Int -> a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)
+ Data.IntMap.Monoidal: mapEitherWithKey :: forall a b c. (Int -> a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)
- Data.IntMap.Monoidal: mapKeys :: (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: mapKeys :: forall a. (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: mapKeysMonotonic :: (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: mapKeysMonotonic :: forall a. (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: mapKeysWith :: (a -> a -> a) -> (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: mapKeysWith :: forall a. (a -> a -> a) -> (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: mapMaybe :: (a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b
+ Data.IntMap.Monoidal: mapMaybe :: forall a b. (a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b
- Data.IntMap.Monoidal: mapMaybeWithKey :: (Int -> a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b
+ Data.IntMap.Monoidal: mapMaybeWithKey :: forall a b. (Int -> a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b
- Data.IntMap.Monoidal: mapWithKey :: (Int -> a -> b) -> MonoidalIntMap a -> MonoidalIntMap b
+ Data.IntMap.Monoidal: mapWithKey :: forall a b. (Int -> a -> b) -> MonoidalIntMap a -> MonoidalIntMap b
- Data.IntMap.Monoidal: maxView :: MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)
+ Data.IntMap.Monoidal: maxView :: forall a. MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)
- Data.IntMap.Monoidal: maxViewWithKey :: MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)
+ Data.IntMap.Monoidal: maxViewWithKey :: forall a. MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)
- Data.IntMap.Monoidal: mergeWithKey :: (Int -> a -> b -> Maybe c) -> (MonoidalIntMap a -> MonoidalIntMap c) -> (MonoidalIntMap b -> MonoidalIntMap c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
+ Data.IntMap.Monoidal: mergeWithKey :: forall a b c. (Int -> a -> b -> Maybe c) -> (MonoidalIntMap a -> MonoidalIntMap c) -> (MonoidalIntMap b -> MonoidalIntMap c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
- Data.IntMap.Monoidal: minView :: MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)
+ Data.IntMap.Monoidal: minView :: forall a. MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)
- Data.IntMap.Monoidal: minViewWithKey :: MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)
+ Data.IntMap.Monoidal: minViewWithKey :: forall a. MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)
- Data.IntMap.Monoidal: null :: MonoidalIntMap a -> Bool
+ Data.IntMap.Monoidal: null :: forall a. MonoidalIntMap a -> Bool
- Data.IntMap.Monoidal: partition :: (a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
+ Data.IntMap.Monoidal: partition :: forall a. (a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
- Data.IntMap.Monoidal: partitionWithKey :: (Int -> a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
+ Data.IntMap.Monoidal: partitionWithKey :: forall a. (Int -> a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
- Data.IntMap.Monoidal: split :: Int -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
+ Data.IntMap.Monoidal: split :: forall a. Int -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
- Data.IntMap.Monoidal: splitLookup :: Int -> MonoidalIntMap a -> (MonoidalIntMap a, Maybe a, MonoidalIntMap a)
+ Data.IntMap.Monoidal: splitLookup :: forall a. Int -> MonoidalIntMap a -> (MonoidalIntMap a, Maybe a, MonoidalIntMap a)
- Data.IntMap.Monoidal: splitRoot :: MonoidalIntMap a -> [MonoidalIntMap a]
+ Data.IntMap.Monoidal: splitRoot :: forall a. MonoidalIntMap a -> [MonoidalIntMap a]
- Data.IntMap.Monoidal: toAscList :: MonoidalIntMap a -> [(Int, a)]
+ Data.IntMap.Monoidal: toAscList :: forall a. MonoidalIntMap a -> [(Int, a)]
- Data.IntMap.Monoidal: toDescList :: MonoidalIntMap a -> [(Int, a)]
+ Data.IntMap.Monoidal: toDescList :: forall a. MonoidalIntMap a -> [(Int, a)]
- Data.IntMap.Monoidal: toList :: MonoidalIntMap a -> [(Int, a)]
+ Data.IntMap.Monoidal: toList :: forall a. MonoidalIntMap a -> [(Int, a)]
- Data.IntMap.Monoidal: unionWith :: (a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: unionWith :: forall a. (a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: unionWithKey :: (Int -> a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: unionWithKey :: forall a. (Int -> a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: unionsWith :: (a -> a -> a) -> [MonoidalIntMap a] -> MonoidalIntMap a
+ Data.IntMap.Monoidal: unionsWith :: forall a. (a -> a -> a) -> [MonoidalIntMap a] -> MonoidalIntMap a
- Data.IntMap.Monoidal: update :: (a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: update :: forall a. (a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: updateLookupWithKey :: (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)
+ Data.IntMap.Monoidal: updateLookupWithKey :: forall a. (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)
- Data.IntMap.Monoidal: updateMax :: (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: updateMax :: forall a. (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: updateMaxWithKey :: (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: updateMaxWithKey :: forall a. (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: updateMin :: (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: updateMin :: forall a. (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: updateMinWithKey :: (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: updateMinWithKey :: forall a. (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal: updateWithKey :: (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal: updateWithKey :: forall a. (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: (!) :: MonoidalIntMap a -> Int -> a
+ Data.IntMap.Monoidal.Strict: (!) :: forall a. MonoidalIntMap a -> Int -> a
- Data.IntMap.Monoidal.Strict: (\\) :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: (\\) :: forall a b. MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: adjust :: (a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: adjust :: forall a. (a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: adjustWithKey :: (Int -> a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: adjustWithKey :: forall a. (Int -> a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: alter :: (Maybe a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: alter :: forall a. (Maybe a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: deleteFindMax :: MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: deleteFindMax :: forall a. MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: deleteFindMin :: MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: deleteFindMin :: forall a. MonoidalIntMap a -> ((Int, a), MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: deleteMax :: MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: deleteMax :: forall a. MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: deleteMin :: MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: deleteMin :: forall a. MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: difference :: MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: difference :: forall a b. MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: differenceWith :: (a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: differenceWith :: forall a b. (a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: differenceWithKey :: (Int -> a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: differenceWithKey :: forall a b. (Int -> a -> b -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: empty :: MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: empty :: forall a. MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: filter :: (a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: filter :: forall a. (a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: filterWithKey :: (Int -> a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: filterWithKey :: forall a. (Int -> a -> Bool) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: findMax :: MonoidalIntMap a -> (Int, a)
+ Data.IntMap.Monoidal.Strict: findMax :: forall a. MonoidalIntMap a -> (Int, a)
- Data.IntMap.Monoidal.Strict: findMin :: MonoidalIntMap a -> (Int, a)
+ Data.IntMap.Monoidal.Strict: findMin :: forall a. MonoidalIntMap a -> (Int, a)
- Data.IntMap.Monoidal.Strict: findWithDefault :: a -> Int -> MonoidalIntMap a -> a
+ Data.IntMap.Monoidal.Strict: findWithDefault :: forall a. a -> Int -> MonoidalIntMap a -> a
- Data.IntMap.Monoidal.Strict: foldl :: (a -> b -> a) -> a -> MonoidalIntMap b -> a
+ Data.IntMap.Monoidal.Strict: foldl :: forall a b. (a -> b -> a) -> a -> MonoidalIntMap b -> a
- Data.IntMap.Monoidal.Strict: foldl' :: (a -> b -> a) -> a -> MonoidalIntMap b -> a
+ Data.IntMap.Monoidal.Strict: foldl' :: forall a b. (a -> b -> a) -> a -> MonoidalIntMap b -> a
- Data.IntMap.Monoidal.Strict: foldlWithKey :: (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a
+ Data.IntMap.Monoidal.Strict: foldlWithKey :: forall a b. (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a
- Data.IntMap.Monoidal.Strict: foldlWithKey' :: (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a
+ Data.IntMap.Monoidal.Strict: foldlWithKey' :: forall a b. (a -> Int -> b -> a) -> a -> MonoidalIntMap b -> a
- Data.IntMap.Monoidal.Strict: foldr :: (a -> b -> b) -> b -> MonoidalIntMap a -> b
+ Data.IntMap.Monoidal.Strict: foldr :: forall a b. (a -> b -> b) -> b -> MonoidalIntMap a -> b
- Data.IntMap.Monoidal.Strict: foldr' :: (a -> b -> b) -> b -> MonoidalIntMap a -> b
+ Data.IntMap.Monoidal.Strict: foldr' :: forall a b. (a -> b -> b) -> b -> MonoidalIntMap a -> b
- Data.IntMap.Monoidal.Strict: foldrWithKey :: (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b
+ Data.IntMap.Monoidal.Strict: foldrWithKey :: forall a b. (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b
- Data.IntMap.Monoidal.Strict: foldrWithKey' :: (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b
+ Data.IntMap.Monoidal.Strict: foldrWithKey' :: forall a b. (Int -> a -> b -> b) -> b -> MonoidalIntMap a -> b
- Data.IntMap.Monoidal.Strict: fromAscList :: [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromAscList :: forall a. [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: fromAscListWith :: (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromAscListWith :: forall a. (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: fromAscListWithKey :: (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromAscListWithKey :: forall a. (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: fromDistinctAscList :: [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromDistinctAscList :: forall a. [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: fromDistinctList :: [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromDistinctList :: forall a. [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: fromList :: [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromList :: forall a. [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: fromListWith :: (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromListWith :: forall a. (a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: fromListWithKey :: (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromListWithKey :: forall a. (Int -> a -> a -> a) -> [(Int, a)] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: fromSet :: (Int -> a) -> IntSet -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: fromSet :: forall a. (Int -> a) -> IntSet -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: insert :: Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: insert :: forall a. Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: insertLookupWithKey :: (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: insertLookupWithKey :: forall a. (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: insertWith :: (a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: insertWith :: forall a. (a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: insertWithKey :: (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: insertWithKey :: forall a. (Int -> a -> a -> a) -> Int -> a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: intersectionWith :: (a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
+ Data.IntMap.Monoidal.Strict: intersectionWith :: forall a b c. (a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
- Data.IntMap.Monoidal.Strict: intersectionWithKey :: (Int -> a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
+ Data.IntMap.Monoidal.Strict: intersectionWithKey :: forall a b c. (Int -> a -> b -> c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
- Data.IntMap.Monoidal.Strict: isProperSubmapOf :: Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool
+ Data.IntMap.Monoidal.Strict: isProperSubmapOf :: forall a. Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool
- Data.IntMap.Monoidal.Strict: isProperSubmapOfBy :: (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool
+ Data.IntMap.Monoidal.Strict: isProperSubmapOfBy :: forall a b. (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool
- Data.IntMap.Monoidal.Strict: isSubmapOf :: Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool
+ Data.IntMap.Monoidal.Strict: isSubmapOf :: forall a. Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool
- Data.IntMap.Monoidal.Strict: isSubmapOfBy :: (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool
+ Data.IntMap.Monoidal.Strict: isSubmapOfBy :: forall a b. (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool
- Data.IntMap.Monoidal.Strict: keysSet :: MonoidalIntMap a -> IntSet
+ Data.IntMap.Monoidal.Strict: keysSet :: forall a. MonoidalIntMap a -> IntSet
- Data.IntMap.Monoidal.Strict: lookup :: Int -> MonoidalIntMap a -> Maybe a
+ Data.IntMap.Monoidal.Strict: lookup :: forall a. Int -> MonoidalIntMap a -> Maybe a
- Data.IntMap.Monoidal.Strict: lookupGE :: Int -> MonoidalIntMap a -> Maybe (Int, a)
+ Data.IntMap.Monoidal.Strict: lookupGE :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)
- Data.IntMap.Monoidal.Strict: lookupGT :: Int -> MonoidalIntMap a -> Maybe (Int, a)
+ Data.IntMap.Monoidal.Strict: lookupGT :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)
- Data.IntMap.Monoidal.Strict: lookupLE :: Int -> MonoidalIntMap a -> Maybe (Int, a)
+ Data.IntMap.Monoidal.Strict: lookupLE :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)
- Data.IntMap.Monoidal.Strict: lookupLT :: Int -> MonoidalIntMap a -> Maybe (Int, a)
+ Data.IntMap.Monoidal.Strict: lookupLT :: forall a. Int -> MonoidalIntMap a -> Maybe (Int, a)
- Data.IntMap.Monoidal.Strict: mapAccum :: (a -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
+ Data.IntMap.Monoidal.Strict: mapAccum :: forall a b c. (a -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
- Data.IntMap.Monoidal.Strict: mapAccumRWithKey :: (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
+ Data.IntMap.Monoidal.Strict: mapAccumRWithKey :: forall a b c. (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
- Data.IntMap.Monoidal.Strict: mapAccumWithKey :: (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
+ Data.IntMap.Monoidal.Strict: mapAccumWithKey :: forall a b c. (a -> Int -> b -> (a, c)) -> a -> MonoidalIntMap b -> (a, MonoidalIntMap c)
- Data.IntMap.Monoidal.Strict: mapEither :: (a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)
+ Data.IntMap.Monoidal.Strict: mapEither :: forall a b c. (a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)
- Data.IntMap.Monoidal.Strict: mapEitherWithKey :: (Int -> a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)
+ Data.IntMap.Monoidal.Strict: mapEitherWithKey :: forall a b c. (Int -> a -> Either b c) -> MonoidalIntMap a -> (MonoidalIntMap b, MonoidalIntMap c)
- Data.IntMap.Monoidal.Strict: mapKeys :: (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: mapKeys :: forall a. (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: mapKeysMonotonic :: (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: mapKeysMonotonic :: forall a. (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: mapKeysWith :: (a -> a -> a) -> (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: mapKeysWith :: forall a. (a -> a -> a) -> (Int -> Int) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: mapMaybe :: (a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b
+ Data.IntMap.Monoidal.Strict: mapMaybe :: forall a b. (a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b
- Data.IntMap.Monoidal.Strict: mapMaybeWithKey :: (Int -> a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b
+ Data.IntMap.Monoidal.Strict: mapMaybeWithKey :: forall a b. (Int -> a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap b
- Data.IntMap.Monoidal.Strict: mapWithKey :: (Int -> a -> b) -> MonoidalIntMap a -> MonoidalIntMap b
+ Data.IntMap.Monoidal.Strict: mapWithKey :: forall a b. (Int -> a -> b) -> MonoidalIntMap a -> MonoidalIntMap b
- Data.IntMap.Monoidal.Strict: maxView :: MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: maxView :: forall a. MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: maxViewWithKey :: MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: maxViewWithKey :: forall a. MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: mergeWithKey :: (Int -> a -> b -> Maybe c) -> (MonoidalIntMap a -> MonoidalIntMap c) -> (MonoidalIntMap b -> MonoidalIntMap c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
+ Data.IntMap.Monoidal.Strict: mergeWithKey :: forall a b c. (Int -> a -> b -> Maybe c) -> (MonoidalIntMap a -> MonoidalIntMap c) -> (MonoidalIntMap b -> MonoidalIntMap c) -> MonoidalIntMap a -> MonoidalIntMap b -> MonoidalIntMap c
- Data.IntMap.Monoidal.Strict: minView :: MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: minView :: forall a. MonoidalIntMap a -> Maybe (a, MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: minViewWithKey :: MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: minViewWithKey :: forall a. MonoidalIntMap a -> Maybe ((Int, a), MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: null :: MonoidalIntMap a -> Bool
+ Data.IntMap.Monoidal.Strict: null :: forall a. MonoidalIntMap a -> Bool
- Data.IntMap.Monoidal.Strict: partition :: (a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: partition :: forall a. (a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: partitionWithKey :: (Int -> a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: partitionWithKey :: forall a. (Int -> a -> Bool) -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: split :: Int -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: split :: forall a. Int -> MonoidalIntMap a -> (MonoidalIntMap a, MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: splitLookup :: Int -> MonoidalIntMap a -> (MonoidalIntMap a, Maybe a, MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: splitLookup :: forall a. Int -> MonoidalIntMap a -> (MonoidalIntMap a, Maybe a, MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: splitRoot :: MonoidalIntMap a -> [MonoidalIntMap a]
+ Data.IntMap.Monoidal.Strict: splitRoot :: forall a. MonoidalIntMap a -> [MonoidalIntMap a]
- Data.IntMap.Monoidal.Strict: toAscList :: MonoidalIntMap a -> [(Int, a)]
+ Data.IntMap.Monoidal.Strict: toAscList :: forall a. MonoidalIntMap a -> [(Int, a)]
- Data.IntMap.Monoidal.Strict: toDescList :: MonoidalIntMap a -> [(Int, a)]
+ Data.IntMap.Monoidal.Strict: toDescList :: forall a. MonoidalIntMap a -> [(Int, a)]
- Data.IntMap.Monoidal.Strict: toList :: MonoidalIntMap a -> [(Int, a)]
+ Data.IntMap.Monoidal.Strict: toList :: forall a. MonoidalIntMap a -> [(Int, a)]
- Data.IntMap.Monoidal.Strict: unionWith :: (a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: unionWith :: forall a. (a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: unionWithKey :: (Int -> a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: unionWithKey :: forall a. (Int -> a -> a -> a) -> MonoidalIntMap a -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: unionsWith :: (a -> a -> a) -> [MonoidalIntMap a] -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: unionsWith :: forall a. (a -> a -> a) -> [MonoidalIntMap a] -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: update :: (a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: update :: forall a. (a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: updateLookupWithKey :: (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)
+ Data.IntMap.Monoidal.Strict: updateLookupWithKey :: forall a. (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> (Maybe a, MonoidalIntMap a)
- Data.IntMap.Monoidal.Strict: updateMax :: (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: updateMax :: forall a. (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: updateMaxWithKey :: (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: updateMaxWithKey :: forall a. (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: updateMin :: (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: updateMin :: forall a. (a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: updateMinWithKey :: (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: updateMinWithKey :: forall a. (Int -> a -> Maybe a) -> MonoidalIntMap a -> MonoidalIntMap a
- Data.IntMap.Monoidal.Strict: updateWithKey :: (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
+ Data.IntMap.Monoidal.Strict: updateWithKey :: forall a. (Int -> a -> Maybe a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a
- Data.Map.Monoidal: (!) :: Ord k => MonoidalMap k a -> k -> a
+ Data.Map.Monoidal: (!) :: forall k a. Ord k => MonoidalMap k a -> k -> a
- Data.Map.Monoidal: (!?) :: Ord k => MonoidalMap k a -> k -> Maybe a
+ Data.Map.Monoidal: (!?) :: forall k a. Ord k => MonoidalMap k a -> k -> Maybe a
- Data.Map.Monoidal: (\\) :: Ord k => MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
+ Data.Map.Monoidal: (\\) :: forall k a b. Ord k => MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
- Data.Map.Monoidal: adjust :: Ord k => (a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: adjust :: forall k a. Ord k => (a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: adjustWithKey :: Ord k => (k -> a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: adjustWithKey :: forall k a. Ord k => (k -> a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: alter :: Ord k => (Maybe a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: alter :: forall k a. Ord k => (Maybe a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: deleteAt :: Int -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: deleteAt :: forall k a. Int -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: deleteFindMax :: MonoidalMap k a -> ((k, a), MonoidalMap k a)
+ Data.Map.Monoidal: deleteFindMax :: forall k a. MonoidalMap k a -> ((k, a), MonoidalMap k a)
- Data.Map.Monoidal: deleteFindMin :: MonoidalMap k a -> ((k, a), MonoidalMap k a)
+ Data.Map.Monoidal: deleteFindMin :: forall k a. MonoidalMap k a -> ((k, a), MonoidalMap k a)
- Data.Map.Monoidal: deleteMax :: MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: deleteMax :: forall k a. MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: deleteMin :: MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: deleteMin :: forall k a. MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: difference :: Ord k => MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
+ Data.Map.Monoidal: difference :: forall k a b. Ord k => MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
- Data.Map.Monoidal: differenceWith :: Ord k => (a -> b -> Maybe a) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
+ Data.Map.Monoidal: differenceWith :: forall k a b. Ord k => (a -> b -> Maybe a) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
- Data.Map.Monoidal: differenceWithKey :: Ord k => (k -> a -> b -> Maybe a) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
+ Data.Map.Monoidal: differenceWithKey :: forall k a b. Ord k => (k -> a -> b -> Maybe a) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
- Data.Map.Monoidal: drop :: Int -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: drop :: forall k a. Int -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: dropWhileAntitone :: (k -> Bool) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: dropWhileAntitone :: forall k a. (k -> Bool) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: elemAt :: Int -> MonoidalMap k a -> (k, a)
+ Data.Map.Monoidal: elemAt :: forall k a. Int -> MonoidalMap k a -> (k, a)
- Data.Map.Monoidal: empty :: MonoidalMap k a
+ Data.Map.Monoidal: empty :: forall k a. MonoidalMap k a
- Data.Map.Monoidal: filterWithKey :: (k -> a -> Bool) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: filterWithKey :: forall k a. (k -> a -> Bool) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: findIndex :: Ord k => k -> MonoidalMap k a -> Int
+ Data.Map.Monoidal: findIndex :: forall k a. Ord k => k -> MonoidalMap k a -> Int
- Data.Map.Monoidal: findMax :: MonoidalMap k a -> (k, a)
+ Data.Map.Monoidal: findMax :: forall k a. MonoidalMap k a -> (k, a)
- Data.Map.Monoidal: findMin :: MonoidalMap k a -> (k, a)
+ Data.Map.Monoidal: findMin :: forall k a. MonoidalMap k a -> (k, a)
- Data.Map.Monoidal: foldrWithKey :: (k -> a -> b -> b) -> b -> MonoidalMap k a -> b
+ Data.Map.Monoidal: foldrWithKey :: forall k a b. (k -> a -> b -> b) -> b -> MonoidalMap k a -> b
- Data.Map.Monoidal: foldrWithKey' :: (k -> a -> b -> b) -> b -> MonoidalMap k a -> b
+ Data.Map.Monoidal: foldrWithKey' :: forall k a b. (k -> a -> b -> b) -> b -> MonoidalMap k a -> b
- Data.Map.Monoidal: fromAscList :: Eq k => [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromAscList :: forall k a. Eq k => [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromAscListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromAscListWith :: forall k a. Eq k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromAscListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromAscListWithKey :: forall k a. Eq k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromDescList :: Eq k => [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromDescList :: forall k a. Eq k => [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromDescListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromDescListWith :: forall k a. Eq k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromDescListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromDescListWithKey :: forall k a. Eq k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromDistinctAscList :: [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromDistinctAscList :: forall k a. [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromDistinctDescList :: [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromDistinctDescList :: forall k a. [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromDistinctList :: Ord k => [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromDistinctList :: forall k a. Ord k => [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromList :: Ord k => [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromList :: forall k a. Ord k => [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromListWith :: Ord k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromListWith :: forall k a. Ord k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromListWithKey :: Ord k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal: fromListWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal: fromSet :: (k -> a) -> Set k -> MonoidalMap k a
+ Data.Map.Monoidal: fromSet :: forall k a. (k -> a) -> Set k -> MonoidalMap k a
- Data.Map.Monoidal: insert :: Ord k => k -> a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: insert :: forall k a. Ord k => k -> a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> MonoidalMap k a -> (Maybe a, MonoidalMap k a)
+ Data.Map.Monoidal: insertLookupWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> k -> a -> MonoidalMap k a -> (Maybe a, MonoidalMap k a)
- Data.Map.Monoidal: insertWith :: Ord k => (a -> a -> a) -> k -> a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: insertWith :: forall k a. Ord k => (a -> a -> a) -> k -> a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: insertWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> k -> a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: intersectionWith :: Ord k => (a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
+ Data.Map.Monoidal: intersectionWith :: forall k a b c. Ord k => (a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
- Data.Map.Monoidal: intersectionWithKey :: Ord k => (k -> a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
+ Data.Map.Monoidal: intersectionWithKey :: forall k a b c. Ord k => (k -> a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
- Data.Map.Monoidal: isProperSubmapOf :: (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool
+ Data.Map.Monoidal: isProperSubmapOf :: forall k a. (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool
- Data.Map.Monoidal: isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool
+ Data.Map.Monoidal: isProperSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool
- Data.Map.Monoidal: isSubmapOf :: (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool
+ Data.Map.Monoidal: isSubmapOf :: forall k a. (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool
- Data.Map.Monoidal: isSubmapOfBy :: Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool
+ Data.Map.Monoidal: isSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool
- Data.Map.Monoidal: keysSet :: MonoidalMap k a -> Set k
+ Data.Map.Monoidal: keysSet :: forall k a. MonoidalMap k a -> Set k
- Data.Map.Monoidal: lookup :: Ord k => k -> MonoidalMap k a -> Maybe a
+ Data.Map.Monoidal: lookup :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe a
- Data.Map.Monoidal: lookupGE :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal: lookupGE :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal: lookupGT :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal: lookupGT :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal: lookupIndex :: Ord k => k -> MonoidalMap k a -> Maybe Int
+ Data.Map.Monoidal: lookupIndex :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe Int
- Data.Map.Monoidal: lookupLE :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal: lookupLE :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal: lookupLT :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal: lookupLT :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal: lookupMax :: MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal: lookupMax :: forall k a. MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal: lookupMin :: MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal: lookupMin :: forall k a. MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal: mapEitherWithKey :: (k -> a -> Either b c) -> MonoidalMap k a -> (MonoidalMap k b, MonoidalMap k c)
+ Data.Map.Monoidal: mapEitherWithKey :: forall k a b c. (k -> a -> Either b c) -> MonoidalMap k a -> (MonoidalMap k b, MonoidalMap k c)
- Data.Map.Monoidal: mapKeysMonotonic :: (k1 -> k2) -> MonoidalMap k1 a -> MonoidalMap k2 a
+ Data.Map.Monoidal: mapKeysMonotonic :: forall k1 k2 a. (k1 -> k2) -> MonoidalMap k1 a -> MonoidalMap k2 a
- Data.Map.Monoidal: mapMaybeWithKey :: (k -> a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b
+ Data.Map.Monoidal: mapMaybeWithKey :: forall k a b. (k -> a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b
- Data.Map.Monoidal: mapWithKey :: (k -> a -> b) -> MonoidalMap k a -> MonoidalMap k b
+ Data.Map.Monoidal: mapWithKey :: forall k a b. (k -> a -> b) -> MonoidalMap k a -> MonoidalMap k b
- Data.Map.Monoidal: maxView :: MonoidalMap k a -> Maybe (a, MonoidalMap k a)
+ Data.Map.Monoidal: maxView :: forall k a. MonoidalMap k a -> Maybe (a, MonoidalMap k a)
- Data.Map.Monoidal: maxViewWithKey :: MonoidalMap k a -> Maybe ((k, a), MonoidalMap k a)
+ Data.Map.Monoidal: maxViewWithKey :: forall k a. MonoidalMap k a -> Maybe ((k, a), MonoidalMap k a)
- Data.Map.Monoidal: mergeWithKey :: Ord k => (k -> a -> b -> Maybe c) -> (MonoidalMap k a -> MonoidalMap k c) -> (MonoidalMap k b -> MonoidalMap k c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
+ Data.Map.Monoidal: mergeWithKey :: forall k a b c. Ord k => (k -> a -> b -> Maybe c) -> (MonoidalMap k a -> MonoidalMap k c) -> (MonoidalMap k b -> MonoidalMap k c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
- Data.Map.Monoidal: minView :: MonoidalMap k a -> Maybe (a, MonoidalMap k a)
+ Data.Map.Monoidal: minView :: forall k a. MonoidalMap k a -> Maybe (a, MonoidalMap k a)
- Data.Map.Monoidal: minViewWithKey :: MonoidalMap k a -> Maybe ((k, a), MonoidalMap k a)
+ Data.Map.Monoidal: minViewWithKey :: forall k a. MonoidalMap k a -> Maybe ((k, a), MonoidalMap k a)
- Data.Map.Monoidal: null :: MonoidalMap k a -> Bool
+ Data.Map.Monoidal: null :: forall k a. MonoidalMap k a -> Bool
- Data.Map.Monoidal: partitionWithKey :: (k -> a -> Bool) -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
+ Data.Map.Monoidal: partitionWithKey :: forall k a. (k -> a -> Bool) -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
- Data.Map.Monoidal: restrictKeys :: Ord k => MonoidalMap k a -> Set k -> MonoidalMap k a
+ Data.Map.Monoidal: restrictKeys :: forall k a. Ord k => MonoidalMap k a -> Set k -> MonoidalMap k a
- Data.Map.Monoidal: spanAntitone :: (k -> Bool) -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
+ Data.Map.Monoidal: spanAntitone :: forall k a. (k -> Bool) -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
- Data.Map.Monoidal: split :: Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
+ Data.Map.Monoidal: split :: forall k a. Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
- Data.Map.Monoidal: splitAt :: Int -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
+ Data.Map.Monoidal: splitAt :: forall k a. Int -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
- Data.Map.Monoidal: splitLookup :: Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, Maybe a, MonoidalMap k a)
+ Data.Map.Monoidal: splitLookup :: forall k a. Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, Maybe a, MonoidalMap k a)
- Data.Map.Monoidal: splitRoot :: MonoidalMap k a -> [MonoidalMap k a]
+ Data.Map.Monoidal: splitRoot :: forall k a. MonoidalMap k a -> [MonoidalMap k a]
- Data.Map.Monoidal: take :: Int -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: take :: forall k a. Int -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: takeWhileAntitone :: (k -> Bool) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: takeWhileAntitone :: forall k a. (k -> Bool) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: toAscList :: MonoidalMap k a -> [(k, a)]
+ Data.Map.Monoidal: toAscList :: forall k a. MonoidalMap k a -> [(k, a)]
- Data.Map.Monoidal: toDescList :: MonoidalMap k a -> [(k, a)]
+ Data.Map.Monoidal: toDescList :: forall k a. MonoidalMap k a -> [(k, a)]
- Data.Map.Monoidal: toList :: MonoidalMap k a -> [(k, a)]
+ Data.Map.Monoidal: toList :: forall k a. MonoidalMap k a -> [(k, a)]
- Data.Map.Monoidal: traverseMaybeWithKey :: Applicative f => (k -> a -> f (Maybe b)) -> MonoidalMap k a -> f (MonoidalMap k b)
+ Data.Map.Monoidal: traverseMaybeWithKey :: forall f k a b. Applicative f => (k -> a -> f (Maybe b)) -> MonoidalMap k a -> f (MonoidalMap k b)
- Data.Map.Monoidal: unionWith :: Ord k => (a -> a -> a) -> MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: unionWith :: forall k a. Ord k => (a -> a -> a) -> MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: unionWithKey :: Ord k => (k -> a -> a -> a) -> MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: unionWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: unionsWith :: Ord k => (a -> a -> a) -> [MonoidalMap k a] -> MonoidalMap k a
+ Data.Map.Monoidal: unionsWith :: forall k a. Ord k => (a -> a -> a) -> [MonoidalMap k a] -> MonoidalMap k a
- Data.Map.Monoidal: update :: Ord k => (a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: update :: forall k a. Ord k => (a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: updateAt :: (k -> a -> Maybe a) -> Int -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: updateAt :: forall k a. (k -> a -> Maybe a) -> Int -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: updateLookupWithKey :: Ord k => (k -> a -> Maybe a) -> k -> MonoidalMap k a -> (Maybe a, MonoidalMap k a)
+ Data.Map.Monoidal: updateLookupWithKey :: forall k a. Ord k => (k -> a -> Maybe a) -> k -> MonoidalMap k a -> (Maybe a, MonoidalMap k a)
- Data.Map.Monoidal: updateMaxWithKey :: (k -> a -> Maybe a) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: updateMaxWithKey :: forall k a. (k -> a -> Maybe a) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: updateMinWithKey :: (k -> a -> Maybe a) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: updateMinWithKey :: forall k a. (k -> a -> Maybe a) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: updateWithKey :: Ord k => (k -> a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal: updateWithKey :: forall k a. Ord k => (k -> a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal: valid :: Ord k => MonoidalMap k a -> Bool
+ Data.Map.Monoidal: valid :: forall k a. Ord k => MonoidalMap k a -> Bool
- Data.Map.Monoidal: withoutKeys :: Ord k => MonoidalMap k a -> Set k -> MonoidalMap k a
+ Data.Map.Monoidal: withoutKeys :: forall k a. Ord k => MonoidalMap k a -> Set k -> MonoidalMap k a
- Data.Map.Monoidal.Strict: (!) :: Ord k => MonoidalMap k a -> k -> a
+ Data.Map.Monoidal.Strict: (!) :: forall k a. Ord k => MonoidalMap k a -> k -> a
- Data.Map.Monoidal.Strict: (!?) :: Ord k => MonoidalMap k a -> k -> Maybe a
+ Data.Map.Monoidal.Strict: (!?) :: forall k a. Ord k => MonoidalMap k a -> k -> Maybe a
- Data.Map.Monoidal.Strict: (\\) :: Ord k => MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: (\\) :: forall k a b. Ord k => MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
- Data.Map.Monoidal.Strict: adjust :: Ord k => (a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: adjust :: forall k a. Ord k => (a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: adjustWithKey :: Ord k => (k -> a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: adjustWithKey :: forall k a. Ord k => (k -> a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: alter :: Ord k => (Maybe a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: alter :: forall k a. Ord k => (Maybe a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: deleteAt :: Int -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: deleteAt :: forall k a. Int -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: deleteFindMax :: MonoidalMap k a -> ((k, a), MonoidalMap k a)
+ Data.Map.Monoidal.Strict: deleteFindMax :: forall k a. MonoidalMap k a -> ((k, a), MonoidalMap k a)
- Data.Map.Monoidal.Strict: deleteFindMin :: MonoidalMap k a -> ((k, a), MonoidalMap k a)
+ Data.Map.Monoidal.Strict: deleteFindMin :: forall k a. MonoidalMap k a -> ((k, a), MonoidalMap k a)
- Data.Map.Monoidal.Strict: deleteMax :: MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: deleteMax :: forall k a. MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: deleteMin :: MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: deleteMin :: forall k a. MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: difference :: Ord k => MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: difference :: forall k a b. Ord k => MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
- Data.Map.Monoidal.Strict: differenceWith :: Ord k => (a -> b -> Maybe a) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: differenceWith :: forall k a b. Ord k => (a -> b -> Maybe a) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
- Data.Map.Monoidal.Strict: differenceWithKey :: Ord k => (k -> a -> b -> Maybe a) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: differenceWithKey :: forall k a b. Ord k => (k -> a -> b -> Maybe a) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k a
- Data.Map.Monoidal.Strict: drop :: Int -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: drop :: forall k a. Int -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: dropWhileAntitone :: (k -> Bool) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: dropWhileAntitone :: forall k a. (k -> Bool) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: elemAt :: Int -> MonoidalMap k a -> (k, a)
+ Data.Map.Monoidal.Strict: elemAt :: forall k a. Int -> MonoidalMap k a -> (k, a)
- Data.Map.Monoidal.Strict: empty :: MonoidalMap k a
+ Data.Map.Monoidal.Strict: empty :: forall k a. MonoidalMap k a
- Data.Map.Monoidal.Strict: filterWithKey :: (k -> a -> Bool) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: filterWithKey :: forall k a. (k -> a -> Bool) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: findIndex :: Ord k => k -> MonoidalMap k a -> Int
+ Data.Map.Monoidal.Strict: findIndex :: forall k a. Ord k => k -> MonoidalMap k a -> Int
- Data.Map.Monoidal.Strict: findMax :: MonoidalMap k a -> (k, a)
+ Data.Map.Monoidal.Strict: findMax :: forall k a. MonoidalMap k a -> (k, a)
- Data.Map.Monoidal.Strict: findMin :: MonoidalMap k a -> (k, a)
+ Data.Map.Monoidal.Strict: findMin :: forall k a. MonoidalMap k a -> (k, a)
- Data.Map.Monoidal.Strict: foldrWithKey :: (k -> a -> b -> b) -> b -> MonoidalMap k a -> b
+ Data.Map.Monoidal.Strict: foldrWithKey :: forall k a b. (k -> a -> b -> b) -> b -> MonoidalMap k a -> b
- Data.Map.Monoidal.Strict: foldrWithKey' :: (k -> a -> b -> b) -> b -> MonoidalMap k a -> b
+ Data.Map.Monoidal.Strict: foldrWithKey' :: forall k a b. (k -> a -> b -> b) -> b -> MonoidalMap k a -> b
- Data.Map.Monoidal.Strict: fromAscList :: Eq k => [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromAscList :: forall k a. Eq k => [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromAscListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromAscListWith :: forall k a. Eq k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromAscListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromAscListWithKey :: forall k a. Eq k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromDescList :: Eq k => [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromDescList :: forall k a. Eq k => [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromDescListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromDescListWith :: forall k a. Eq k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromDescListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromDescListWithKey :: forall k a. Eq k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromDistinctAscList :: [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromDistinctAscList :: forall k a. [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromDistinctDescList :: [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromDistinctDescList :: forall k a. [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromDistinctList :: Ord k => [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromDistinctList :: forall k a. Ord k => [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromList :: Ord k => [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromList :: forall k a. Ord k => [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromListWith :: Ord k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromListWith :: forall k a. Ord k => (a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromListWithKey :: Ord k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromListWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> [(k, a)] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: fromSet :: (k -> a) -> Set k -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: fromSet :: forall k a. (k -> a) -> Set k -> MonoidalMap k a
- Data.Map.Monoidal.Strict: insert :: Ord k => k -> a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: insert :: forall k a. Ord k => k -> a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> MonoidalMap k a -> (Maybe a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: insertLookupWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> k -> a -> MonoidalMap k a -> (Maybe a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: insertWith :: Ord k => (a -> a -> a) -> k -> a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: insertWith :: forall k a. Ord k => (a -> a -> a) -> k -> a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: insertWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> k -> a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: intersectionWith :: Ord k => (a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
+ Data.Map.Monoidal.Strict: intersectionWith :: forall k a b c. Ord k => (a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
- Data.Map.Monoidal.Strict: intersectionWithKey :: Ord k => (k -> a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
+ Data.Map.Monoidal.Strict: intersectionWithKey :: forall k a b c. Ord k => (k -> a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
- Data.Map.Monoidal.Strict: isProperSubmapOf :: (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool
+ Data.Map.Monoidal.Strict: isProperSubmapOf :: forall k a. (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool
- Data.Map.Monoidal.Strict: isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool
+ Data.Map.Monoidal.Strict: isProperSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool
- Data.Map.Monoidal.Strict: isSubmapOf :: (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool
+ Data.Map.Monoidal.Strict: isSubmapOf :: forall k a. (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool
- Data.Map.Monoidal.Strict: isSubmapOfBy :: Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool
+ Data.Map.Monoidal.Strict: isSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool
- Data.Map.Monoidal.Strict: keysSet :: MonoidalMap k a -> Set k
+ Data.Map.Monoidal.Strict: keysSet :: forall k a. MonoidalMap k a -> Set k
- Data.Map.Monoidal.Strict: lookup :: Ord k => k -> MonoidalMap k a -> Maybe a
+ Data.Map.Monoidal.Strict: lookup :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe a
- Data.Map.Monoidal.Strict: lookupGE :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal.Strict: lookupGE :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal.Strict: lookupGT :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal.Strict: lookupGT :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal.Strict: lookupIndex :: Ord k => k -> MonoidalMap k a -> Maybe Int
+ Data.Map.Monoidal.Strict: lookupIndex :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe Int
- Data.Map.Monoidal.Strict: lookupLE :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal.Strict: lookupLE :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal.Strict: lookupLT :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal.Strict: lookupLT :: forall k a. Ord k => k -> MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal.Strict: lookupMax :: MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal.Strict: lookupMax :: forall k a. MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal.Strict: lookupMin :: MonoidalMap k a -> Maybe (k, a)
+ Data.Map.Monoidal.Strict: lookupMin :: forall k a. MonoidalMap k a -> Maybe (k, a)
- Data.Map.Monoidal.Strict: mapEitherWithKey :: (k -> a -> Either b c) -> MonoidalMap k a -> (MonoidalMap k b, MonoidalMap k c)
+ Data.Map.Monoidal.Strict: mapEitherWithKey :: forall k a b c. (k -> a -> Either b c) -> MonoidalMap k a -> (MonoidalMap k b, MonoidalMap k c)
- Data.Map.Monoidal.Strict: mapKeysMonotonic :: (k1 -> k2) -> MonoidalMap k1 a -> MonoidalMap k2 a
+ Data.Map.Monoidal.Strict: mapKeysMonotonic :: forall k1 k2 a. (k1 -> k2) -> MonoidalMap k1 a -> MonoidalMap k2 a
- Data.Map.Monoidal.Strict: mapMaybeWithKey :: (k -> a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b
+ Data.Map.Monoidal.Strict: mapMaybeWithKey :: forall k a b. (k -> a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b
- Data.Map.Monoidal.Strict: mapWithKey :: (k -> a -> b) -> MonoidalMap k a -> MonoidalMap k b
+ Data.Map.Monoidal.Strict: mapWithKey :: forall k a b. (k -> a -> b) -> MonoidalMap k a -> MonoidalMap k b
- Data.Map.Monoidal.Strict: maxView :: MonoidalMap k a -> Maybe (a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: maxView :: forall k a. MonoidalMap k a -> Maybe (a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: maxViewWithKey :: MonoidalMap k a -> Maybe ((k, a), MonoidalMap k a)
+ Data.Map.Monoidal.Strict: maxViewWithKey :: forall k a. MonoidalMap k a -> Maybe ((k, a), MonoidalMap k a)
- Data.Map.Monoidal.Strict: mergeWithKey :: Ord k => (k -> a -> b -> Maybe c) -> (MonoidalMap k a -> MonoidalMap k c) -> (MonoidalMap k b -> MonoidalMap k c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
+ Data.Map.Monoidal.Strict: mergeWithKey :: forall k a b c. Ord k => (k -> a -> b -> Maybe c) -> (MonoidalMap k a -> MonoidalMap k c) -> (MonoidalMap k b -> MonoidalMap k c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c
- Data.Map.Monoidal.Strict: minView :: MonoidalMap k a -> Maybe (a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: minView :: forall k a. MonoidalMap k a -> Maybe (a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: minViewWithKey :: MonoidalMap k a -> Maybe ((k, a), MonoidalMap k a)
+ Data.Map.Monoidal.Strict: minViewWithKey :: forall k a. MonoidalMap k a -> Maybe ((k, a), MonoidalMap k a)
- Data.Map.Monoidal.Strict: null :: MonoidalMap k a -> Bool
+ Data.Map.Monoidal.Strict: null :: forall k a. MonoidalMap k a -> Bool
- Data.Map.Monoidal.Strict: partitionWithKey :: (k -> a -> Bool) -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: partitionWithKey :: forall k a. (k -> a -> Bool) -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: restrictKeys :: Ord k => MonoidalMap k a -> Set k -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: restrictKeys :: forall k a. Ord k => MonoidalMap k a -> Set k -> MonoidalMap k a
- Data.Map.Monoidal.Strict: spanAntitone :: (k -> Bool) -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: spanAntitone :: forall k a. (k -> Bool) -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: split :: Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: split :: forall k a. Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: splitAt :: Int -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: splitAt :: forall k a. Int -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: splitLookup :: Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, Maybe a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: splitLookup :: forall k a. Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, Maybe a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: splitRoot :: MonoidalMap k a -> [MonoidalMap k a]
+ Data.Map.Monoidal.Strict: splitRoot :: forall k a. MonoidalMap k a -> [MonoidalMap k a]
- Data.Map.Monoidal.Strict: take :: Int -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: take :: forall k a. Int -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: takeWhileAntitone :: (k -> Bool) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: takeWhileAntitone :: forall k a. (k -> Bool) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: toAscList :: MonoidalMap k a -> [(k, a)]
+ Data.Map.Monoidal.Strict: toAscList :: forall k a. MonoidalMap k a -> [(k, a)]
- Data.Map.Monoidal.Strict: toDescList :: MonoidalMap k a -> [(k, a)]
+ Data.Map.Monoidal.Strict: toDescList :: forall k a. MonoidalMap k a -> [(k, a)]
- Data.Map.Monoidal.Strict: toList :: MonoidalMap k a -> [(k, a)]
+ Data.Map.Monoidal.Strict: toList :: forall k a. MonoidalMap k a -> [(k, a)]
- Data.Map.Monoidal.Strict: traverseMaybeWithKey :: Applicative f => (k -> a -> f (Maybe b)) -> MonoidalMap k a -> f (MonoidalMap k b)
+ Data.Map.Monoidal.Strict: traverseMaybeWithKey :: forall f k a b. Applicative f => (k -> a -> f (Maybe b)) -> MonoidalMap k a -> f (MonoidalMap k b)
- Data.Map.Monoidal.Strict: unionWith :: Ord k => (a -> a -> a) -> MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: unionWith :: forall k a. Ord k => (a -> a -> a) -> MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: unionWithKey :: Ord k => (k -> a -> a -> a) -> MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: unionWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: unionsWith :: Ord k => (a -> a -> a) -> [MonoidalMap k a] -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: unionsWith :: forall k a. Ord k => (a -> a -> a) -> [MonoidalMap k a] -> MonoidalMap k a
- Data.Map.Monoidal.Strict: update :: Ord k => (a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: update :: forall k a. Ord k => (a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: updateAt :: (k -> a -> Maybe a) -> Int -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: updateAt :: forall k a. (k -> a -> Maybe a) -> Int -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: updateLookupWithKey :: Ord k => (k -> a -> Maybe a) -> k -> MonoidalMap k a -> (Maybe a, MonoidalMap k a)
+ Data.Map.Monoidal.Strict: updateLookupWithKey :: forall k a. Ord k => (k -> a -> Maybe a) -> k -> MonoidalMap k a -> (Maybe a, MonoidalMap k a)
- Data.Map.Monoidal.Strict: updateMaxWithKey :: (k -> a -> Maybe a) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: updateMaxWithKey :: forall k a. (k -> a -> Maybe a) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: updateMinWithKey :: (k -> a -> Maybe a) -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: updateMinWithKey :: forall k a. (k -> a -> Maybe a) -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: updateWithKey :: Ord k => (k -> a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: updateWithKey :: forall k a. Ord k => (k -> a -> Maybe a) -> k -> MonoidalMap k a -> MonoidalMap k a
- Data.Map.Monoidal.Strict: valid :: Ord k => MonoidalMap k a -> Bool
+ Data.Map.Monoidal.Strict: valid :: forall k a. Ord k => MonoidalMap k a -> Bool
- Data.Map.Monoidal.Strict: withoutKeys :: Ord k => MonoidalMap k a -> Set k -> MonoidalMap k a
+ Data.Map.Monoidal.Strict: withoutKeys :: forall k a. Ord k => MonoidalMap k a -> Set k -> MonoidalMap k a

Files

Changelog.md view
@@ -1,5 +1,10 @@ # Monoidal containers +# 0.6.6.0++* [Support ghc 9.12](https://github.com/bgamari/monoidal-containers/pull/108)+* [Allow hashable 1.5](https://github.com/bgamari/monoidal-containers/pull/107]+ # 0.6.5.0  * [Support for GHC 9.10](https://github.com/bgamari/monoidal-containers/pull/105)
monoidal-containers.cabal view
@@ -1,5 +1,5 @@ name:               monoidal-containers-version:            0.6.5.0+version:            0.6.6.0 synopsis:           Containers with monoidal accumulation description:   Containers with merging via monoidal accumulation. The 'Monoid' instances@@ -27,11 +27,11 @@ extra-source-files: Changelog.md tested-with:   GHC ==8.2 || ==8.4 || ==8.6 || ==8.8 || ==8.10 || ==9.0 || ==9.2 || ==9.4-   || ==9.6 || ==9.10+   || ==9.6 || ==9.10 || ==9.12  source-repository head   type:     git-  location: git://github.com/bgamari/monoidal-containers+  location: https://github.com/bgamari/monoidal-containers  flag split-these   description: Use split these/semialign packages@@ -55,10 +55,10 @@    build-depends:       aeson                 >=1.0   && <2.3-    , base                  >=4.7   && <4.21+    , base                  >=4.7   && <4.22     , containers            >=0.5.9 && <0.8     , deepseq               >=1.3   && <1.6-    , hashable              >=1.2   && <1.5+    , hashable              >=1.2   && <1.6     , lens                  >=4.4   && <5.4     , newtype               >=0.2   && <0.3     , unordered-containers  >=0.2   && <0.3