Data.Vessel.Internal

Documentation

newtype FlipAp (g :: k) (v :: k -> *)

Constructors

FlipAp

Fields

• unFlipAp :: v g

Instances

Eq (v g) => Eq (FlipAp g v)

Defined in Data.Vessel.Internal

Methods

(==) :: FlipAp g v -> FlipAp g v -> Bool

(/=) :: FlipAp g v -> FlipAp g v -> Bool

Ord (v g) => Ord (FlipAp g v)

Defined in Data.Vessel.Internal

Methods

compare :: FlipAp g v -> FlipAp g v -> Ordering

(<) :: FlipAp g v -> FlipAp g v -> Bool

(<=) :: FlipAp g v -> FlipAp g v -> Bool

(>) :: FlipAp g v -> FlipAp g v -> Bool

(>=) :: FlipAp g v -> FlipAp g v -> Bool

max :: FlipAp g v -> FlipAp g v -> FlipAp g v

min :: FlipAp g v -> FlipAp g v -> FlipAp g v

Show (v g) => Show (FlipAp g v)

Defined in Data.Vessel.Internal

Methods

showsPrec :: Int -> FlipAp g v -> ShowS

show :: FlipAp g v -> String

showList :: [FlipAp g v] -> ShowS

Semigroup (v g) => Semigroup (FlipAp g v)

Defined in Data.Vessel.Internal

Methods

(<>) :: FlipAp g v -> FlipAp g v -> FlipAp g v

sconcat :: NonEmpty (FlipAp g v) -> FlipAp g v

stimes :: Integral b => b -> FlipAp g v -> FlipAp g v

Monoid (v g) => Monoid (FlipAp g v)

Defined in Data.Vessel.Internal

Methods

mempty :: FlipAp g v

mappend :: FlipAp g v -> FlipAp g v -> FlipAp g v

mconcat :: [FlipAp g v] -> FlipAp g v

Group (v g) => Group (FlipAp g v)

Defined in Data.Vessel.Internal

Methods

negateG :: FlipAp g v -> FlipAp g v

(~~) :: FlipAp g v -> FlipAp g v -> FlipAp g v

Additive (v g) => Additive (FlipAp g v)

Defined in Data.Vessel.Internal

data VSum (k :: ((* -> *) -> *) -> *) (g :: * -> *)

Constructors

forall v. (k v) :~> (v g)

Instances

(ForallF ToJSON k, HasV ToJSON k g) => ToJSON (VSum k g)

Defined in Data.Vessel.Internal

Methods

toJSON :: VSum k g -> Value

toEncoding :: VSum k g -> Encoding

toJSONList :: [VSum k g] -> Value

toEncodingList :: [VSum k g] -> Encoding

(FromJSON (Some k), HasV FromJSON k g) => FromJSON (VSum k g)

Defined in Data.Vessel.Internal

Methods

parseJSON :: Value -> Parser (VSum k g)

parseJSONList :: Value -> Parser [VSum k g]

assocLCompose :: Functor f => Compose f (Compose g h) x -> Compose (Compose f g) h x

assocRCompose :: Functor f => Compose (Compose f g) h x -> Compose f (Compose g h) x

alignWithKeyMaybeDMap :: GCompare k => (forall a. k a -> These (f a) (g a) -> Maybe (h a)) -> DMap k f -> DMap k g -> DMap k h

alignWithKeyDMap :: GCompare k => (forall a. k a -> These (f a) (g a) -> h a) -> DMap k f -> DMap k g -> DMap k h

data DThese f g a

Constructors

DThis (f a)

DThat (g a)

DThese (f a) (g a)

dtheseToThese :: DThese f g a -> These (f a) (g a)

theseToDThese :: These (f a) (g a) -> DThese f g a

unalignProperly :: Filterable f => f (These a b) -> (f a, f b)

data Pivot k a

Constructors

None

One k a

Split k (MonoidalMap k a) (MonoidalMap k a)

Instances

(Eq k, Eq a) => Eq (Pivot k a)

Defined in Data.Vessel.Internal

Methods

(==) :: Pivot k a -> Pivot k a -> Bool

(/=) :: Pivot k a -> Pivot k a -> Bool

(Ord k, Ord a) => Ord (Pivot k a)

Defined in Data.Vessel.Internal

Methods

compare :: Pivot k a -> Pivot k a -> Ordering

(<) :: Pivot k a -> Pivot k a -> Bool

(<=) :: Pivot k a -> Pivot k a -> Bool

(>) :: Pivot k a -> Pivot k a -> Bool

(>=) :: Pivot k a -> Pivot k a -> Bool

max :: Pivot k a -> Pivot k a -> Pivot k a

min :: Pivot k a -> Pivot k a -> Pivot k a

(Show k, Show a) => Show (Pivot k a)

Defined in Data.Vessel.Internal

Methods

showsPrec :: Int -> Pivot k a -> ShowS

show :: Pivot k a -> String

showList :: [Pivot k a] -> ShowS

findPivot :: Ord k => MonoidalMap k a -> Pivot k a

unionDistinctAsc :: Ord k => MonoidalMap k a -> MonoidalMap k a -> MonoidalMap k a

splitLT :: Ord k => k -> MonoidalMap k a -> (MonoidalMap k a, MonoidalMap k a)

data PivotD (k :: l -> *) (g :: l -> *)

Constructors

NoneD

forall v. OneD (k v) (g v)

forall v. SplitD (k v) (DMap k g) (DMap k g)

condenseD' :: (GCompare k, Foldable t, Filterable t) => DMap k g -> t (MonoidalDMap k g) -> MonoidalDMap k (Compose t g)

findPivotD :: GCompare k => DMap k g -> PivotD k g

unionDistinctAscD :: GCompare k => MonoidalDMap k g -> MonoidalDMap k g -> MonoidalDMap k g

splitLTD :: GCompare k => k v -> MonoidalDMap k g -> (MonoidalDMap k g, MonoidalDMap k g)

alignWithKeyMonoidalDMap :: GCompare k => (forall a. k a -> These (f a) (g a) -> h a) -> MonoidalDMap k f -> MonoidalDMap k g -> MonoidalDMap k h

alignWithKeyMaybeMonoidalDMap :: GCompare k => (forall a. k a -> These (f a) (g a) -> Maybe (h a)) -> MonoidalDMap k f -> MonoidalDMap k g -> MonoidalDMap k h

splitD :: (GCompare k, Filterable t) => k x -> t (MonoidalDMap k g) -> (t (MonoidalDMap k g), t (MonoidalDMap k g))

splitOneD :: GCompare k => k v -> MonoidalDMap k g -> Maybe (These (MonoidalDMap k g) (MonoidalDMap k g))

curryMMap :: (Ord a, Ord b) => MonoidalMap (a, b) c -> MonoidalMap a (MonoidalMap b c)

uncurryMMap :: (Ord a, Ord b) => MonoidalMap a (MonoidalMap b c) -> MonoidalMap (a, b) c

leftOuterJoin :: Ord k => (a -> c) -> (a -> b -> c) -> MonoidalMap k a -> MonoidalMap k b -> MonoidalMap k c

leftOuterJoin' :: Ord k => (a -> c) -> (a -> b -> c) -> Map k a -> Map k b -> Map k c

leftOuterJoin_ :: Ord k => a -> Set k -> MonoidalMap k a -> MonoidalMap k a

Orphan instances

(Has' Group f g, Has' Semigroup f g, GCompare f) => Group (MonoidalDMap f g)

Methods

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)

Semigroup (f (g a)) => Semigroup (Compose f g a)

Methods

(<>) :: Compose f g a -> Compose f g a -> Compose f g a

sconcat :: NonEmpty (Compose f g a) -> Compose f g a

stimes :: Integral b => b -> Compose f g a -> Compose f g a

Monoid (f (g a)) => Monoid (Compose f g a)

Methods

mempty :: Compose f g a

mappend :: Compose f g a -> Compose f g a -> Compose f g a

mconcat :: [Compose f g a] -> Compose f g a

Group (f (g x)) => Group (Compose f g x)

Methods

negateG :: Compose f g x -> Compose f g x

(~~) :: Compose f g x -> Compose f g x -> Compose f g x