dependent-monoidal-map 0.1.1.3 → 0.1.1.4
raw patch · 3 files changed
+11/−7 lines, 3 filesdep ~aesondep ~basedep ~constraintsPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: aeson, base, constraints
API changes (from Hackage documentation)
- Data.Dependent.Map.Monoidal: FakeDSum :: DSum f g -> FakeDSum f g
+ Data.Dependent.Map.Monoidal: FakeDSum :: DSum f g -> FakeDSum (f :: k -> Type) (g :: k -> Type)
- Data.Dependent.Map.Monoidal: MonoidalDMap :: DMap f g -> MonoidalDMap (f :: k -> *) (g :: k -> *)
+ Data.Dependent.Map.Monoidal: MonoidalDMap :: DMap f g -> MonoidalDMap (f :: k -> Type) (g :: k -> Type)
- Data.Dependent.Map.Monoidal: [unFakeDSum] :: FakeDSum f g -> DSum f g
+ Data.Dependent.Map.Monoidal: [unFakeDSum] :: FakeDSum (f :: k -> Type) (g :: k -> Type) -> DSum f g
- Data.Dependent.Map.Monoidal: [unMonoidalDMap] :: MonoidalDMap (f :: k -> *) (g :: k -> *) -> DMap f g
+ Data.Dependent.Map.Monoidal: [unMonoidalDMap] :: MonoidalDMap (f :: k -> Type) (g :: k -> Type) -> DMap f g
- Data.Dependent.Map.Monoidal: adjust :: GCompare k => (f v -> f v) -> k v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: adjust :: forall {k1} k2 f (v :: k1). GCompare k2 => (f v -> f v) -> k2 v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: adjustWithKey :: GCompare k => (k v -> f v -> f v) -> k v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: adjustWithKey :: forall {k1} k2 (v :: k1) f. GCompare k2 => (k2 v -> f v -> f v) -> k2 v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: adjustWithKey' :: GCompare k => (k v -> f v -> f v) -> k v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: adjustWithKey' :: forall {k1} k2 (v :: k1) f. GCompare k2 => (k2 v -> f v -> f v) -> k2 v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: alter :: forall k f v. GCompare k => (Maybe (f v) -> Maybe (f v)) -> k v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: alter :: forall {k1} k2 f (v :: k1). GCompare k2 => (Maybe (f v) -> Maybe (f v)) -> k2 v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: assocs :: MonoidalDMap k f -> [DSum k f]
+ Data.Dependent.Map.Monoidal: assocs :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> [DSum k2 f]
- Data.Dependent.Map.Monoidal: delete :: forall k f v. GCompare k => k v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: delete :: forall {k1} k2 (f :: k1 -> Type) (v :: k1). GCompare k2 => k2 v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: deleteAt :: Int -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: deleteAt :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). Int -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: deleteFindMax :: MonoidalDMap k f -> (DSum k f, MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: deleteFindMax :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> (DSum k2 f, MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: deleteFindMin :: MonoidalDMap k f -> (DSum k f, MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: deleteFindMin :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> (DSum k2 f, MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: deleteMax :: MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: deleteMax :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: deleteMin :: MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: deleteMin :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: difference :: GCompare k => MonoidalDMap k f -> MonoidalDMap k g -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: difference :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type) (g :: k1 -> Type). GCompare k2 => MonoidalDMap k2 f -> MonoidalDMap k2 g -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: differenceWithKey :: GCompare k => (forall v. k v -> f v -> g v -> Maybe (f v)) -> MonoidalDMap k f -> MonoidalDMap k g -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: differenceWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> g v -> Maybe (f v)) -> MonoidalDMap k2 f -> MonoidalDMap k2 g -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: elemAt :: Int -> MonoidalDMap k f -> DSum k f
+ Data.Dependent.Map.Monoidal: elemAt :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). Int -> MonoidalDMap k2 f -> DSum k2 f
- Data.Dependent.Map.Monoidal: empty :: MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: empty :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: filterWithKey :: GCompare k => (forall v. k v -> f v -> Bool) -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: filterWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> Bool) -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: find :: GCompare k => k v -> MonoidalDMap k f -> f v
+ Data.Dependent.Map.Monoidal: find :: forall {k1} k2 (v :: k1) f. GCompare k2 => k2 v -> MonoidalDMap k2 f -> f v
- Data.Dependent.Map.Monoidal: findIndex :: GCompare k => k v -> MonoidalDMap k f -> Int
+ Data.Dependent.Map.Monoidal: findIndex :: forall {k1} k2 (v :: k1) (f :: k1 -> Type). GCompare k2 => k2 v -> MonoidalDMap k2 f -> Int
- Data.Dependent.Map.Monoidal: findMax :: MonoidalDMap k f -> DSum k f
+ Data.Dependent.Map.Monoidal: findMax :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> DSum k2 f
- Data.Dependent.Map.Monoidal: findMin :: MonoidalDMap k f -> DSum k f
+ Data.Dependent.Map.Monoidal: findMin :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> DSum k2 f
- Data.Dependent.Map.Monoidal: findWithDefault :: GCompare k => f v -> k v -> MonoidalDMap k f -> f v
+ Data.Dependent.Map.Monoidal: findWithDefault :: forall {k1} k2 f (v :: k1). GCompare k2 => f v -> k2 v -> MonoidalDMap k2 f -> f v
- Data.Dependent.Map.Monoidal: foldlWithKey :: (forall v. b -> k v -> f v -> b) -> b -> MonoidalDMap k f -> b
+ Data.Dependent.Map.Monoidal: foldlWithKey :: (forall (v :: k1). () => b -> k2 v -> f v -> b) -> b -> MonoidalDMap k2 f -> b
- Data.Dependent.Map.Monoidal: foldrWithKey :: (forall v. k v -> f v -> b -> b) -> b -> MonoidalDMap k f -> b
+ Data.Dependent.Map.Monoidal: foldrWithKey :: (forall (v :: k1). () => k2 v -> f v -> b -> b) -> b -> MonoidalDMap k2 f -> b
- Data.Dependent.Map.Monoidal: fromAscListWithKey :: GEq k => (forall v. k v -> f v -> f v -> f v) -> [DSum k f] -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: fromAscListWithKey :: GEq k2 => (forall (v :: k1). () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: fromListWithKey :: GCompare k => (forall v. k v -> f v -> f v -> f v) -> [DSum k f] -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: fromListWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: insert :: forall k f v. GCompare k => k v -> f v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: insert :: forall {k1} k2 f (v :: k1). GCompare k2 => k2 v -> f v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: insertLookupWithKey :: forall k f v. GCompare k => (k v -> f v -> f v -> f v) -> k v -> f v -> MonoidalDMap k f -> (Maybe (f v), MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: insertLookupWithKey :: forall {k1} k2 f (v :: k1). GCompare k2 => (k2 v -> f v -> f v -> f v) -> k2 v -> f v -> MonoidalDMap k2 f -> (Maybe (f v), MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: insertLookupWithKey' :: forall k f v. GCompare k => (k v -> f v -> f v -> f v) -> k v -> f v -> MonoidalDMap k f -> (Maybe (f v), MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: insertLookupWithKey' :: forall {k1} k2 f (v :: k1). GCompare k2 => (k2 v -> f v -> f v -> f v) -> k2 v -> f v -> MonoidalDMap k2 f -> (Maybe (f v), MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: insertWith :: GCompare k => (f v -> f v -> f v) -> k v -> f v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: insertWith :: forall {k1} k2 f (v :: k1). GCompare k2 => (f v -> f v -> f v) -> k2 v -> f v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: insertWith' :: GCompare k => (f v -> f v -> f v) -> k v -> f v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: insertWith' :: forall {k1} k2 f (v :: k1). GCompare k2 => (f v -> f v -> f v) -> k2 v -> f v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: insertWithKey :: forall k f v. GCompare k => (k v -> f v -> f v -> f v) -> k v -> f v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: insertWithKey :: forall {k1} k2 f (v :: k1). GCompare k2 => (k2 v -> f v -> f v -> f v) -> k2 v -> f v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: insertWithKey' :: forall k f v. GCompare k => (k v -> f v -> f v -> f v) -> k v -> f v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: insertWithKey' :: forall {k1} k2 f (v :: k1). GCompare k2 => (k2 v -> f v -> f v -> f v) -> k2 v -> f v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: intersectionWithKey :: GCompare k => (forall v. k v -> f v -> g v -> h v) -> MonoidalDMap k f -> MonoidalDMap k g -> MonoidalDMap k h
+ Data.Dependent.Map.Monoidal: intersectionWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> g v -> h v) -> MonoidalDMap k2 f -> MonoidalDMap k2 g -> MonoidalDMap k2 h
- Data.Dependent.Map.Monoidal: isProperSubmapOf :: (GCompare k, Has' Eq k f) => MonoidalDMap k f -> MonoidalDMap k f -> Bool
+ Data.Dependent.Map.Monoidal: isProperSubmapOf :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). (GCompare k2, Has' Eq k2 f) => MonoidalDMap k2 f -> MonoidalDMap k2 f -> Bool
- Data.Dependent.Map.Monoidal: isProperSubmapOfBy :: GCompare k => (forall v. k v -> k v -> f v -> g v -> Bool) -> MonoidalDMap k f -> MonoidalDMap k g -> Bool
+ Data.Dependent.Map.Monoidal: isProperSubmapOfBy :: GCompare k2 => (forall (v :: k1). () => k2 v -> k2 v -> f v -> g v -> Bool) -> MonoidalDMap k2 f -> MonoidalDMap k2 g -> Bool
- Data.Dependent.Map.Monoidal: isSubmapOf :: (GCompare k, Has' Eq k f) => MonoidalDMap k f -> MonoidalDMap k f -> Bool
+ Data.Dependent.Map.Monoidal: isSubmapOf :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). (GCompare k2, Has' Eq k2 f) => MonoidalDMap k2 f -> MonoidalDMap k2 f -> Bool
- Data.Dependent.Map.Monoidal: isSubmapOfBy :: GCompare k => (forall v. k v -> k v -> f v -> g v -> Bool) -> MonoidalDMap k f -> MonoidalDMap k g -> Bool
+ Data.Dependent.Map.Monoidal: isSubmapOfBy :: GCompare k2 => (forall (v :: k1). () => k2 v -> k2 v -> f v -> g v -> Bool) -> MonoidalDMap k2 f -> MonoidalDMap k2 g -> Bool
- Data.Dependent.Map.Monoidal: keys :: MonoidalDMap k f -> [Some k]
+ Data.Dependent.Map.Monoidal: keys :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> [Some k2]
- Data.Dependent.Map.Monoidal: lookup :: forall k f v. GCompare k => k v -> MonoidalDMap k f -> Maybe (f v)
+ Data.Dependent.Map.Monoidal: lookup :: forall {k1} k2 f (v :: k1). GCompare k2 => k2 v -> MonoidalDMap k2 f -> Maybe (f v)
- Data.Dependent.Map.Monoidal: lookupIndex :: forall k f v. GCompare k => k v -> MonoidalDMap k f -> Maybe Int
+ Data.Dependent.Map.Monoidal: lookupIndex :: forall {k1} k2 (f :: k1 -> Type) (v :: k1). GCompare k2 => k2 v -> MonoidalDMap k2 f -> Maybe Int
- Data.Dependent.Map.Monoidal: lookupMax :: MonoidalDMap k f -> Maybe (DSum k f)
+ Data.Dependent.Map.Monoidal: lookupMax :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> Maybe (DSum k2 f)
- Data.Dependent.Map.Monoidal: lookupMin :: MonoidalDMap k f -> Maybe (DSum k f)
+ Data.Dependent.Map.Monoidal: lookupMin :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> Maybe (DSum k2 f)
- Data.Dependent.Map.Monoidal: map :: (forall v. f v -> g v) -> MonoidalDMap k f -> MonoidalDMap k g
+ Data.Dependent.Map.Monoidal: map :: forall {k1} f g (k2 :: k1 -> Type). (forall (v :: k1). () => f v -> g v) -> MonoidalDMap k2 f -> MonoidalDMap k2 g
- Data.Dependent.Map.Monoidal: mapAccumLWithKey :: (forall v. a -> k v -> f v -> (a, g v)) -> a -> MonoidalDMap k f -> (a, MonoidalDMap k g)
+ Data.Dependent.Map.Monoidal: mapAccumLWithKey :: (forall (v :: k1). () => a -> k2 v -> f v -> (a, g v)) -> a -> MonoidalDMap k2 f -> (a, MonoidalDMap k2 g)
- Data.Dependent.Map.Monoidal: mapAccumRWithKey :: (forall v. a -> k v -> f v -> (a, g v)) -> a -> MonoidalDMap k f -> (a, MonoidalDMap k g)
+ Data.Dependent.Map.Monoidal: mapAccumRWithKey :: (forall (v :: k1). () => a -> k2 v -> f v -> (a, g v)) -> a -> MonoidalDMap k2 f -> (a, MonoidalDMap k2 g)
- Data.Dependent.Map.Monoidal: mapEitherWithKey :: GCompare k => (forall v. k v -> f v -> Either (g v) (h v)) -> MonoidalDMap k f -> (MonoidalDMap k g, MonoidalDMap k h)
+ Data.Dependent.Map.Monoidal: mapEitherWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> Either (g v) (h v)) -> MonoidalDMap k2 f -> (MonoidalDMap k2 g, MonoidalDMap k2 h)
- Data.Dependent.Map.Monoidal: mapKeysMonotonic :: (forall v. k1 v -> k2 v) -> MonoidalDMap k1 f -> MonoidalDMap k2 f
+ Data.Dependent.Map.Monoidal: mapKeysMonotonic :: forall {k} k1 k2 (f :: k -> Type). (forall (v :: k). () => k1 v -> k2 v) -> MonoidalDMap k1 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: mapKeysWith :: GCompare k2 => (forall v. k2 v -> f v -> f v -> f v) -> (forall v. k1 v -> k2 v) -> MonoidalDMap k1 f -> MonoidalDMap k2 f
+ Data.Dependent.Map.Monoidal: mapKeysWith :: GCompare k2 => (forall (v :: k). () => k2 v -> f v -> f v -> f v) -> (forall (v :: k). () => k1 v -> k2 v) -> MonoidalDMap k1 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: mapMaybeWithKey :: GCompare k => (forall v. k v -> f v -> Maybe (g v)) -> MonoidalDMap k f -> MonoidalDMap k g
+ Data.Dependent.Map.Monoidal: mapMaybeWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> Maybe (g v)) -> MonoidalDMap k2 f -> MonoidalDMap k2 g
- Data.Dependent.Map.Monoidal: mapWithKey :: (forall v. k v -> f v -> g v) -> MonoidalDMap k f -> MonoidalDMap k g
+ Data.Dependent.Map.Monoidal: mapWithKey :: (forall (v :: k1). () => k2 v -> f v -> g v) -> MonoidalDMap k2 f -> MonoidalDMap k2 g
- Data.Dependent.Map.Monoidal: maxViewWithKey :: forall k f. MonoidalDMap k f -> Maybe (DSum k f, MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: maxViewWithKey :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> Maybe (DSum k2 f, MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: member :: GCompare k => k a -> MonoidalDMap k f -> Bool
+ Data.Dependent.Map.Monoidal: member :: forall {k1} k2 (a :: k1) (f :: k1 -> Type). GCompare k2 => k2 a -> MonoidalDMap k2 f -> Bool
- Data.Dependent.Map.Monoidal: minViewWithKey :: forall k f. MonoidalDMap k f -> Maybe (DSum k f, MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: minViewWithKey :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> Maybe (DSum k2 f, MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: newtype FakeDSum f g
+ Data.Dependent.Map.Monoidal: newtype FakeDSum (f :: k -> Type) (g :: k -> Type)
- Data.Dependent.Map.Monoidal: newtype MonoidalDMap (f :: k -> *) (g :: k -> *)
+ Data.Dependent.Map.Monoidal: newtype MonoidalDMap (f :: k -> Type) (g :: k -> Type)
- Data.Dependent.Map.Monoidal: notMember :: GCompare k => k v -> MonoidalDMap k f -> Bool
+ Data.Dependent.Map.Monoidal: notMember :: forall {k1} k2 (v :: k1) (f :: k1 -> Type). GCompare k2 => k2 v -> MonoidalDMap k2 f -> Bool
- Data.Dependent.Map.Monoidal: null :: MonoidalDMap k f -> Bool
+ Data.Dependent.Map.Monoidal: null :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> Bool
- Data.Dependent.Map.Monoidal: partitionWithKey :: GCompare k => (forall v. k v -> f v -> Bool) -> MonoidalDMap k f -> (MonoidalDMap k f, MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: partitionWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> Bool) -> MonoidalDMap k2 f -> (MonoidalDMap k2 f, MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: showTree :: (GShow k, Has' Show k f) => MonoidalDMap k f -> String
+ Data.Dependent.Map.Monoidal: showTree :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). (GShow k2, Has' Show k2 f) => MonoidalDMap k2 f -> String
- Data.Dependent.Map.Monoidal: showTreeWith :: (forall v. k v -> f v -> String) -> Bool -> Bool -> MonoidalDMap k f -> String
+ Data.Dependent.Map.Monoidal: showTreeWith :: (forall (v :: k1). () => k2 v -> f v -> String) -> Bool -> Bool -> MonoidalDMap k2 f -> String
- Data.Dependent.Map.Monoidal: singleton :: k v -> f v -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: singleton :: forall {k1} k2 (v :: k1) f. k2 v -> f v -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: size :: MonoidalDMap k f -> Int
+ Data.Dependent.Map.Monoidal: size :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> Int
- Data.Dependent.Map.Monoidal: split :: forall k f v. GCompare k => k v -> MonoidalDMap k f -> (MonoidalDMap k f, MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: split :: forall {k1} k2 (f :: k1 -> Type) (v :: k1). GCompare k2 => k2 v -> MonoidalDMap k2 f -> (MonoidalDMap k2 f, MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: splitLookup :: forall k f v. GCompare k => k v -> MonoidalDMap k f -> (MonoidalDMap k f, Maybe (f v), MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: splitLookup :: forall {k1} k2 f (v :: k1). GCompare k2 => k2 v -> MonoidalDMap k2 f -> (MonoidalDMap k2 f, Maybe (f v), MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: toAscList :: MonoidalDMap k f -> [DSum k f]
+ Data.Dependent.Map.Monoidal: toAscList :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> [DSum k2 f]
- Data.Dependent.Map.Monoidal: toDescList :: MonoidalDMap k f -> [DSum k f]
+ Data.Dependent.Map.Monoidal: toDescList :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> [DSum k2 f]
- Data.Dependent.Map.Monoidal: toList :: MonoidalDMap k f -> [DSum k f]
+ Data.Dependent.Map.Monoidal: toList :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). MonoidalDMap k2 f -> [DSum k2 f]
- Data.Dependent.Map.Monoidal: traverseWithKey :: Applicative t => (forall v. k v -> f v -> t (g v)) -> MonoidalDMap k f -> t (MonoidalDMap k g)
+ Data.Dependent.Map.Monoidal: traverseWithKey :: forall {k1} t k2 f g. Applicative t => (forall (v :: k1). () => k2 v -> f v -> t (g v)) -> MonoidalDMap k2 f -> t (MonoidalDMap k2 g)
- Data.Dependent.Map.Monoidal: unionWithKey :: GCompare k => (forall v. k v -> f v -> f v -> f v) -> MonoidalDMap k f -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: unionWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> f v -> f v) -> MonoidalDMap k2 f -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: unionsWithKey :: GCompare k => (forall v. k v -> f v -> f v -> f v) -> [MonoidalDMap k f] -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: unionsWithKey :: GCompare k2 => (forall (v :: k1). () => k2 v -> f v -> f v -> f v) -> [MonoidalDMap k2 f] -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: update :: GCompare k => (f v -> Maybe (f v)) -> k v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: update :: forall {k1} k2 f (v :: k1). GCompare k2 => (f v -> Maybe (f v)) -> k2 v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: updateAt :: (forall v. k v -> f v -> Maybe (f v)) -> Int -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: updateAt :: (forall (v :: k1). () => k2 v -> f v -> Maybe (f v)) -> Int -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: updateLookupWithKey :: forall k f v. GCompare k => (k v -> f v -> Maybe (f v)) -> k v -> MonoidalDMap k f -> (Maybe (f v), MonoidalDMap k f)
+ Data.Dependent.Map.Monoidal: updateLookupWithKey :: forall {k1} k2 f (v :: k1). GCompare k2 => (k2 v -> f v -> Maybe (f v)) -> k2 v -> MonoidalDMap k2 f -> (Maybe (f v), MonoidalDMap k2 f)
- Data.Dependent.Map.Monoidal: updateMaxWithKey :: (forall v. k v -> f v -> Maybe (f v)) -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: updateMaxWithKey :: (forall (v :: k1). () => k2 v -> f v -> Maybe (f v)) -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: updateMinWithKey :: (forall v. k v -> f v -> Maybe (f v)) -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: updateMinWithKey :: (forall (v :: k1). () => k2 v -> f v -> Maybe (f v)) -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: updateWithKey :: forall k f v. GCompare k => (k v -> f v -> Maybe (f v)) -> k v -> MonoidalDMap k f -> MonoidalDMap k f
+ Data.Dependent.Map.Monoidal: updateWithKey :: forall {k1} k2 f (v :: k1). GCompare k2 => (k2 v -> f v -> Maybe (f v)) -> k2 v -> MonoidalDMap k2 f -> MonoidalDMap k2 f
- Data.Dependent.Map.Monoidal: valid :: GCompare k => MonoidalDMap k f -> Bool
+ Data.Dependent.Map.Monoidal: valid :: forall {k1} (k2 :: k1 -> Type) (f :: k1 -> Type). GCompare k2 => MonoidalDMap k2 f -> Bool
Files
ChangeLog.md view
@@ -1,5 +1,9 @@ # Revision history for dependent-monoidal-map +## 0.1.1.4++* Add support for GHC 9.8+ ## 0.1.1.3 * Update dependency version bounds
dependent-monoidal-map.cabal view
@@ -1,5 +1,5 @@ name: dependent-monoidal-map-version: 0.1.1.3+version: 0.1.1.4 description: Data.Dependent.Map variant that appends conflicting entries when merging maps instead of discarding one side of the conflict. @@ -14,14 +14,14 @@ category: Data synopsis: Dependent map that uses semigroup mappend tested-with:- GHC ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.10.2+ GHC ==8.6.5 || ==8.10.7 || ==9.0.2 || ==9.2.8 || ==9.4.8 || ==9.6.3 || ==9.8.1 library exposed-modules: Data.Dependent.Map.Monoidal build-depends:- aeson >=1.4 && <2.2- , base >=4.9 && <4.17- , constraints >=0.10.1 && <0.14+ aeson >=1.4 && <2.3+ , base >=4.9 && <4.20+ , constraints >=0.10.1 && <0.15 , constraints-extras >=0.3.0 && <0.5 , dependent-map >=0.4 && <0.5 , dependent-sum >=0.7 && <0.8
src/Data/Dependent/Map/Monoidal.hs view
@@ -21,6 +21,7 @@ import Data.Dependent.Sum.Orphans () import Data.GADT.Compare import Data.GADT.Show+import Data.Kind (Type) import Data.Maybe import Data.Semigroup import Data.Some hiding (This)@@ -28,7 +29,7 @@ import Text.Read import Prelude hiding (lookup, map) -newtype MonoidalDMap (f :: k -> *) (g :: k -> *) = MonoidalDMap { unMonoidalDMap :: DMap f g }+newtype MonoidalDMap (f :: k -> Type) (g :: k -> Type) = MonoidalDMap { unMonoidalDMap :: DMap f g } -- Temporary shim to avoid making changes to dependent-sum and dependent-map. -- TODO: Finalise constraints-extras and optionally get it upstreamed into constraints.@@ -95,7 +96,6 @@ instance (Has' Semigroup f g, GCompare f) => Monoid (MonoidalDMap f g) where mempty = empty- mappend m n = m <> n deriving instance (FromJSON (DMap f g)) => FromJSON (MonoidalDMap f g)