Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
newtype FlipAp (g :: k) (v :: k -> *) Source #
Instances
Eq (v g) => Eq (FlipAp g v) Source # | |
Ord (v g) => Ord (FlipAp g v) Source # | |
Show (v g) => Show (FlipAp g v) Source # | |
Semigroup (v g) => Semigroup (FlipAp g v) Source # | |
Monoid (v g) => Monoid (FlipAp g v) Source # | |
Group (v g) => Group (FlipAp g v) Source # | |
Additive (v g) => Additive (FlipAp g v) Source # | |
Defined in Data.Vessel.Internal |
data VSum (k :: ((* -> *) -> *) -> *) (g :: * -> *) Source #
(k v) :~> (v g) |
alignWithKeyMaybeDMap :: GCompare k => (forall a. k a -> These (f a) (g a) -> Maybe (h a)) -> DMap k f -> DMap k g -> DMap k h Source #
alignWithKeyDMap :: GCompare k => (forall a. k a -> These (f a) (g a) -> h a) -> DMap k f -> DMap k g -> DMap k h Source #
dtheseToThese :: DThese f g a -> These (f a) (g a) Source #
theseToDThese :: These (f a) (g a) -> DThese f g a Source #
unalignProperly :: Filterable f => f (These a b) -> (f a, f b) Source #
None | |
One k a | |
Split k (MonoidalMap k a) (MonoidalMap k a) |
unionDistinctAsc :: Ord k => MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a Source #
splitLT :: Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a) Source #
condenseD' :: (GCompare k, Foldable t, Filterable t) => DMap k g -> t (MonoidalDMap k g) -> MonoidalDMap k (Compose t g) Source #
unionDistinctAscD :: GCompare k => MonoidalDMap k g -> MonoidalDMap k g -> MonoidalDMap k g Source #
splitLTD :: GCompare k => k v -> MonoidalDMap k g -> (MonoidalDMap k g, MonoidalDMap k g) Source #
alignWithKeyMonoidalDMap :: GCompare k => (forall a. k a -> These (f a) (g a) -> h a) -> MonoidalDMap k f -> MonoidalDMap k g -> MonoidalDMap k h Source #
alignWithKeyMaybeMonoidalDMap :: GCompare k => (forall a. k a -> These (f a) (g a) -> Maybe (h a)) -> MonoidalDMap k f -> MonoidalDMap k g -> MonoidalDMap k h Source #
splitD :: (GCompare k, Filterable t) => k x -> t (MonoidalDMap k g) -> (t (MonoidalDMap k g), t (MonoidalDMap k g)) Source #
splitOneD :: GCompare k => k v -> MonoidalDMap k g -> Maybe (These (MonoidalDMap k g) (MonoidalDMap k g)) Source #
curryMMap :: (Ord a, Ord b) => MonoidalMap (a, b) c -> MonoidalMap a (MonoidalMap b c) Source #
uncurryMMap :: (Ord a, Ord b) => MonoidalMap a (MonoidalMap b c) -> MonoidalMap (a, b) c Source #
leftOuterJoin :: Ord k => (a -> c) -> (a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c Source #
leftOuterJoin_ :: Ord k => a -> Set k -> MonoidalMap k a -> MonoidalMap k a Source #
Orphan instances
(Has' Group f g, Has' Semigroup f g, GCompare f) => Group (MonoidalDMap f g) Source # | |
negateG :: MonoidalDMap f g -> MonoidalDMap f g # (~~) :: MonoidalDMap f g -> MonoidalDMap f g -> MonoidalDMap f g # | |
(Has' Group f g, Has' Semigroup f g, GCompare f) => Additive (MonoidalDMap f g) Source # | |
Semigroup (f (g a)) => Semigroup (Compose f g a) Source # | |
Monoid (f (g a)) => Monoid (Compose f g a) Source # | |
Group (f (g x)) => Group (Compose f g x) Source # | |
Additive (f (g a)) => Additive (Compose f g a) Source # | |