Safe Haskell | Safe-Inferred |
---|---|
Language | GHC2021 |
Synopsis
- newtype Vendor up down action = Vendor {}
- data Referral up down action product = Referral {}
- alterVendor :: (forall x. Effect up action x -> Job up' action' x) -> Vendor up down action -> Vendor up' down action'
- alterReferral :: (forall x. Effect up action x -> Job up' action' x) -> Referral up down action product -> Referral up' down action' product
Types
data Referral up down action product Source #
The conclusion of a vendor's handling of a client request
Instances
Foldable (Referral up down action) Source # | |
Defined in SupplyChain.Core.VendorAndReferral fold :: Monoid m => Referral up down action m -> m # foldMap :: Monoid m => (a -> m) -> Referral up down action a -> m # foldMap' :: Monoid m => (a -> m) -> Referral up down action a -> m # foldr :: (a -> b -> b) -> b -> Referral up down action a -> b # foldr' :: (a -> b -> b) -> b -> Referral up down action a -> b # foldl :: (b -> a -> b) -> b -> Referral up down action a -> b # foldl' :: (b -> a -> b) -> b -> Referral up down action a -> b # foldr1 :: (a -> a -> a) -> Referral up down action a -> a # foldl1 :: (a -> a -> a) -> Referral up down action a -> a # toList :: Referral up down action a -> [a] # null :: Referral up down action a -> Bool # length :: Referral up down action a -> Int # elem :: Eq a => a -> Referral up down action a -> Bool # maximum :: Ord a => Referral up down action a -> a # minimum :: Ord a => Referral up down action a -> a # | |
Traversable (Referral up down action) Source # | |
Defined in SupplyChain.Core.VendorAndReferral traverse :: Applicative f => (a -> f b) -> Referral up down action a -> f (Referral up down action b) # sequenceA :: Applicative f => Referral up down action (f a) -> f (Referral up down action a) # mapM :: Monad m => (a -> m b) -> Referral up down action a -> m (Referral up down action b) # sequence :: Monad m => Referral up down action (m a) -> m (Referral up down action a) # | |
Functor (Referral up down action) Source # | |