Safe Haskell	None
Language	Haskell2010

Data.Monoid.Synchronisation

Synopsis

newtype FirstToFinish m a = FirstToFinish {
- runFirstToFinish :: m a
}
newtype LastToFinish m a = LastToFinish {
- runLastToFinish :: m a
}
firstToLast :: FirstToFinish m a -> LastToFinish m a
lastToFirst :: LastToFinish m a -> FirstToFinish m a
newtype LastToFinishM m a = LastToFinishM {
- runLastToFinishM :: m a
}
firstToLastM :: FirstToFinish m a -> LastToFinishM m a
lastToFirstM :: LastToFinishM m a -> FirstToFinish m a

Documentation

newtype FirstToFinish m a Source #

First-to-finish synchronisation. Like Alt it is a monoid under <|> . First-to-finish is the additive monoid of near-semiring for which multiplication is given by LastToFinish .

-- | Return first available value.
--
readFirstMVar :: [TMVar a] -> STM a
readFirstMVar = runFirstToFinish
              . foldMap (FirstToFinish . readTMVar)

Constructors

FirstToFinish
Fields runFirstToFinish :: m a

Instances

Instances details

Monad m => Monad ( FirstToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods (>>=) :: FirstToFinish m a -> (a -> FirstToFinish m b) -> FirstToFinish m b Source # (>>) :: FirstToFinish m a -> FirstToFinish m b -> FirstToFinish m b Source # return :: a -> FirstToFinish m a Source #
Functor m => Functor ( FirstToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods fmap :: (a -> b) -> FirstToFinish m a -> FirstToFinish m b Source # (<$) :: a -> FirstToFinish m b -> FirstToFinish m a Source #
Applicative m => Applicative ( FirstToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods pure :: a -> FirstToFinish m a Source # (<>) :: FirstToFinish m (a -> b) -> FirstToFinish m a -> FirstToFinish m b Source # liftA2 :: (a -> b -> c) -> FirstToFinish m a -> FirstToFinish m b -> FirstToFinish m c Source # (>) :: FirstToFinish m a -> FirstToFinish m b -> FirstToFinish m b Source # (<*) :: FirstToFinish m a -> FirstToFinish m b -> FirstToFinish m a Source #
Foldable m => Foldable ( FirstToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods fold :: Monoid m0 => FirstToFinish m m0 -> m0 Source # foldMap :: Monoid m0 => (a -> m0) -> FirstToFinish m a -> m0 Source # foldMap' :: Monoid m0 => (a -> m0) -> FirstToFinish m a -> m0 Source # foldr :: (a -> b -> b) -> b -> FirstToFinish m a -> b Source # foldr' :: (a -> b -> b) -> b -> FirstToFinish m a -> b Source # foldl :: (b -> a -> b) -> b -> FirstToFinish m a -> b Source # foldl' :: (b -> a -> b) -> b -> FirstToFinish m a -> b Source # foldr1 :: (a -> a -> a) -> FirstToFinish m a -> a Source # foldl1 :: (a -> a -> a) -> FirstToFinish m a -> a Source # toList :: FirstToFinish m a -> [a] Source # null :: FirstToFinish m a -> Bool Source # length :: FirstToFinish m a -> Int Source # elem :: Eq a => a -> FirstToFinish m a -> Bool Source # maximum :: Ord a => FirstToFinish m a -> a Source # minimum :: Ord a => FirstToFinish m a -> a Source # sum :: Num a => FirstToFinish m a -> a Source # product :: Num a => FirstToFinish m a -> a Source #
Traversable m => Traversable ( FirstToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods traverse :: Applicative f => (a -> f b) -> FirstToFinish m a -> f ( FirstToFinish m b) Source # sequenceA :: Applicative f => FirstToFinish m (f a) -> f ( FirstToFinish m a) Source # mapM :: Monad m0 => (a -> m0 b) -> FirstToFinish m a -> m0 ( FirstToFinish m b) Source # sequence :: Monad m0 => FirstToFinish m (m0 a) -> m0 ( FirstToFinish m a) Source #
Contravariant m => Contravariant ( FirstToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods contramap :: (a -> b) -> FirstToFinish m b -> FirstToFinish m a Source # (>$) :: b -> FirstToFinish m b -> FirstToFinish m a Source #
Alternative m => Alternative ( FirstToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods empty :: FirstToFinish m a Source # (<\|>) :: FirstToFinish m a -> FirstToFinish m a -> FirstToFinish m a Source # some :: FirstToFinish m a -> FirstToFinish m [a] Source # many :: FirstToFinish m a -> FirstToFinish m [a] Source #
MonadPlus m => MonadPlus ( FirstToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods mzero :: FirstToFinish m a Source # mplus :: FirstToFinish m a -> FirstToFinish m a -> FirstToFinish m a Source #
Generic1 ( FirstToFinish m :: Type -> Type ) Source #
Instance details Defined in Data.Monoid.Synchronisation Associated Types type Rep1 ( FirstToFinish m) :: k -> Type Source # Methods from1 :: forall (a :: k). FirstToFinish m a -> Rep1 ( FirstToFinish m) a Source # to1 :: forall (a :: k). Rep1 ( FirstToFinish m) a -> FirstToFinish m a Source #
Generic ( FirstToFinish m a) Source #
Instance details Defined in Data.Monoid.Synchronisation Associated Types type Rep ( FirstToFinish m a) :: Type -> Type Source # Methods from :: FirstToFinish m a -> Rep ( FirstToFinish m a) x Source # to :: Rep ( FirstToFinish m a) x -> FirstToFinish m a Source #
Alternative m => Semigroup ( FirstToFinish m a) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods (<>) :: FirstToFinish m a -> FirstToFinish m a -> FirstToFinish m a Source # sconcat :: NonEmpty ( FirstToFinish m a) -> FirstToFinish m a Source # stimes :: Integral b => b -> FirstToFinish m a -> FirstToFinish m a Source #
Alternative m => Monoid ( FirstToFinish m a) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods mempty :: FirstToFinish m a Source # mappend :: FirstToFinish m a -> FirstToFinish m a -> FirstToFinish m a Source # mconcat :: [ FirstToFinish m a] -> FirstToFinish m a Source #
type Rep1 ( FirstToFinish m :: Type -> Type ) Source #
Instance details Defined in Data.Monoid.Synchronisation type Rep1 ( FirstToFinish m :: Type -> Type ) = D1 (' MetaData "FirstToFinish" "Data.Monoid.Synchronisation" "monoidal-synchronisation-0.1.0.1-DikVxJZKIrcFnSuUOiLlPL" ' True ) ( C1 (' MetaCons "FirstToFinish" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "runFirstToFinish") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec1 m)))
type Rep ( FirstToFinish m a) Source #
Instance details Defined in Data.Monoid.Synchronisation type Rep ( FirstToFinish m a) = D1 (' MetaData "FirstToFinish" "Data.Monoid.Synchronisation" "monoidal-synchronisation-0.1.0.1-DikVxJZKIrcFnSuUOiLlPL" ' True ) ( C1 (' MetaCons "FirstToFinish" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "runFirstToFinish") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec0 (m a))))

newtype LastToFinish m a Source #

Last-to-finish synchronisation. It is the multiplicative semigroup of the near-semiring for which addition is given by FirstToFinish .

This is similar to Ap (see LastToFinishM ) in the sense that it will wait for all monadic effects, but unlike Ap it will not combine all results using a monoid instance, but rather it will return the last one. Also unlike Ap it does not have a monoidal unit.

-- | Read all 'TMVar's and return the one that was filled last.
--
readAllTMVars :: Monoid a => NonEmpty (TMVar a) -> STM a
readAllTMVars = runLastToFinish
              . foldMap1 (LastToFinish . readTMVar)
                -- from 'semigroupoids' package or use 'foldr1' and 'fmap'
                -- from 'base'

Constructors

LastToFinish
Fields runLastToFinish :: m a

Instances

Instances details

Monad m => Monad ( LastToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods (>>=) :: LastToFinish m a -> (a -> LastToFinish m b) -> LastToFinish m b Source # (>>) :: LastToFinish m a -> LastToFinish m b -> LastToFinish m b Source # return :: a -> LastToFinish m a Source #
Functor m => Functor ( LastToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods fmap :: (a -> b) -> LastToFinish m a -> LastToFinish m b Source # (<$) :: a -> LastToFinish m b -> LastToFinish m a Source #
Applicative m => Applicative ( LastToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods pure :: a -> LastToFinish m a Source # (<>) :: LastToFinish m (a -> b) -> LastToFinish m a -> LastToFinish m b Source # liftA2 :: (a -> b -> c) -> LastToFinish m a -> LastToFinish m b -> LastToFinish m c Source # (>) :: LastToFinish m a -> LastToFinish m b -> LastToFinish m b Source # (<*) :: LastToFinish m a -> LastToFinish m b -> LastToFinish m a Source #
Foldable m => Foldable ( LastToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods fold :: Monoid m0 => LastToFinish m m0 -> m0 Source # foldMap :: Monoid m0 => (a -> m0) -> LastToFinish m a -> m0 Source # foldMap' :: Monoid m0 => (a -> m0) -> LastToFinish m a -> m0 Source # foldr :: (a -> b -> b) -> b -> LastToFinish m a -> b Source # foldr' :: (a -> b -> b) -> b -> LastToFinish m a -> b Source # foldl :: (b -> a -> b) -> b -> LastToFinish m a -> b Source # foldl' :: (b -> a -> b) -> b -> LastToFinish m a -> b Source # foldr1 :: (a -> a -> a) -> LastToFinish m a -> a Source # foldl1 :: (a -> a -> a) -> LastToFinish m a -> a Source # toList :: LastToFinish m a -> [a] Source # null :: LastToFinish m a -> Bool Source # length :: LastToFinish m a -> Int Source # elem :: Eq a => a -> LastToFinish m a -> Bool Source # maximum :: Ord a => LastToFinish m a -> a Source # minimum :: Ord a => LastToFinish m a -> a Source # sum :: Num a => LastToFinish m a -> a Source # product :: Num a => LastToFinish m a -> a Source #
Traversable m => Traversable ( LastToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods traverse :: Applicative f => (a -> f b) -> LastToFinish m a -> f ( LastToFinish m b) Source # sequenceA :: Applicative f => LastToFinish m (f a) -> f ( LastToFinish m a) Source # mapM :: Monad m0 => (a -> m0 b) -> LastToFinish m a -> m0 ( LastToFinish m b) Source # sequence :: Monad m0 => LastToFinish m (m0 a) -> m0 ( LastToFinish m a) Source #
Alternative m => Alternative ( LastToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods empty :: LastToFinish m a Source # (<\|>) :: LastToFinish m a -> LastToFinish m a -> LastToFinish m a Source # some :: LastToFinish m a -> LastToFinish m [a] Source # many :: LastToFinish m a -> LastToFinish m [a] Source #
MonadPlus m => MonadPlus ( LastToFinish m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods mzero :: LastToFinish m a Source # mplus :: LastToFinish m a -> LastToFinish m a -> LastToFinish m a Source #
Generic1 ( LastToFinish m :: Type -> Type ) Source #
Instance details Defined in Data.Monoid.Synchronisation Associated Types type Rep1 ( LastToFinish m) :: k -> Type Source # Methods from1 :: forall (a :: k). LastToFinish m a -> Rep1 ( LastToFinish m) a Source # to1 :: forall (a :: k). Rep1 ( LastToFinish m) a -> LastToFinish m a Source #
Generic ( LastToFinish m a) Source #
Instance details Defined in Data.Monoid.Synchronisation Associated Types type Rep ( LastToFinish m a) :: Type -> Type Source # Methods from :: LastToFinish m a -> Rep ( LastToFinish m a) x Source # to :: Rep ( LastToFinish m a) x -> LastToFinish m a Source #
MonadPlus m => Semigroup ( LastToFinish m a) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods (<>) :: LastToFinish m a -> LastToFinish m a -> LastToFinish m a Source # sconcat :: NonEmpty ( LastToFinish m a) -> LastToFinish m a Source # stimes :: Integral b => b -> LastToFinish m a -> LastToFinish m a Source #
type Rep1 ( LastToFinish m :: Type -> Type ) Source #
Instance details Defined in Data.Monoid.Synchronisation type Rep1 ( LastToFinish m :: Type -> Type ) = D1 (' MetaData "LastToFinish" "Data.Monoid.Synchronisation" "monoidal-synchronisation-0.1.0.1-DikVxJZKIrcFnSuUOiLlPL" ' True ) ( C1 (' MetaCons "LastToFinish" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "runLastToFinish") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec1 m)))
type Rep ( LastToFinish m a) Source #
Instance details Defined in Data.Monoid.Synchronisation type Rep ( LastToFinish m a) = D1 (' MetaData "LastToFinish" "Data.Monoid.Synchronisation" "monoidal-synchronisation-0.1.0.1-DikVxJZKIrcFnSuUOiLlPL" ' True ) ( C1 (' MetaCons "LastToFinish" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "runLastToFinish") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec0 (m a))))

firstToLast :: FirstToFinish m a -> LastToFinish m a Source #

lastToFirst :: LastToFinish m a -> FirstToFinish m a Source #

newtype LastToFinishM m a Source #

Last-to-finish synchronisation. Like Ap it is a monoid under <*> . The advantage over LastToFinish is that it has a Monoid instance, but a must be a Monoid as well. LastToFinishM and FirstToFinish form a unitial near-ring when m ~ STM .

-- | Read all 'TMVar's and combine the result using 'Monoid' instance.
--
readAllTMVars :: Monoid a => [TMVar a] -> STM a
readAllTMVars = runLastToFinish
              . foldMap (LastToFinish . readTMVar)

Constructors

LastToFinishM
Fields runLastToFinishM :: m a

Instances

Instances details

Monad m => Monad ( LastToFinishM m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods (>>=) :: LastToFinishM m a -> (a -> LastToFinishM m b) -> LastToFinishM m b Source # (>>) :: LastToFinishM m a -> LastToFinishM m b -> LastToFinishM m b Source # return :: a -> LastToFinishM m a Source #
Functor m => Functor ( LastToFinishM m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods fmap :: (a -> b) -> LastToFinishM m a -> LastToFinishM m b Source # (<$) :: a -> LastToFinishM m b -> LastToFinishM m a Source #
Applicative m => Applicative ( LastToFinishM m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods pure :: a -> LastToFinishM m a Source # (<>) :: LastToFinishM m (a -> b) -> LastToFinishM m a -> LastToFinishM m b Source # liftA2 :: (a -> b -> c) -> LastToFinishM m a -> LastToFinishM m b -> LastToFinishM m c Source # (>) :: LastToFinishM m a -> LastToFinishM m b -> LastToFinishM m b Source # (<*) :: LastToFinishM m a -> LastToFinishM m b -> LastToFinishM m a Source #
Foldable m => Foldable ( LastToFinishM m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods fold :: Monoid m0 => LastToFinishM m m0 -> m0 Source # foldMap :: Monoid m0 => (a -> m0) -> LastToFinishM m a -> m0 Source # foldMap' :: Monoid m0 => (a -> m0) -> LastToFinishM m a -> m0 Source # foldr :: (a -> b -> b) -> b -> LastToFinishM m a -> b Source # foldr' :: (a -> b -> b) -> b -> LastToFinishM m a -> b Source # foldl :: (b -> a -> b) -> b -> LastToFinishM m a -> b Source # foldl' :: (b -> a -> b) -> b -> LastToFinishM m a -> b Source # foldr1 :: (a -> a -> a) -> LastToFinishM m a -> a Source # foldl1 :: (a -> a -> a) -> LastToFinishM m a -> a Source # toList :: LastToFinishM m a -> [a] Source # null :: LastToFinishM m a -> Bool Source # length :: LastToFinishM m a -> Int Source # elem :: Eq a => a -> LastToFinishM m a -> Bool Source # maximum :: Ord a => LastToFinishM m a -> a Source # minimum :: Ord a => LastToFinishM m a -> a Source # sum :: Num a => LastToFinishM m a -> a Source # product :: Num a => LastToFinishM m a -> a Source #
Traversable m => Traversable ( LastToFinishM m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods traverse :: Applicative f => (a -> f b) -> LastToFinishM m a -> f ( LastToFinishM m b) Source # sequenceA :: Applicative f => LastToFinishM m (f a) -> f ( LastToFinishM m a) Source # mapM :: Monad m0 => (a -> m0 b) -> LastToFinishM m a -> m0 ( LastToFinishM m b) Source # sequence :: Monad m0 => LastToFinishM m (m0 a) -> m0 ( LastToFinishM m a) Source #
Alternative m => Alternative ( LastToFinishM m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods empty :: LastToFinishM m a Source # (<\|>) :: LastToFinishM m a -> LastToFinishM m a -> LastToFinishM m a Source # some :: LastToFinishM m a -> LastToFinishM m [a] Source # many :: LastToFinishM m a -> LastToFinishM m [a] Source #
MonadPlus m => MonadPlus ( LastToFinishM m) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods mzero :: LastToFinishM m a Source # mplus :: LastToFinishM m a -> LastToFinishM m a -> LastToFinishM m a Source #
Generic1 ( LastToFinishM m :: Type -> Type ) Source #
Instance details Defined in Data.Monoid.Synchronisation Associated Types type Rep1 ( LastToFinishM m) :: k -> Type Source # Methods from1 :: forall (a :: k). LastToFinishM m a -> Rep1 ( LastToFinishM m) a Source # to1 :: forall (a :: k). Rep1 ( LastToFinishM m) a -> LastToFinishM m a Source #
Generic ( LastToFinishM m a) Source #
Instance details Defined in Data.Monoid.Synchronisation Associated Types type Rep ( LastToFinishM m a) :: Type -> Type Source # Methods from :: LastToFinishM m a -> Rep ( LastToFinishM m a) x Source # to :: Rep ( LastToFinishM m a) x -> LastToFinishM m a Source #
( Applicative m, Semigroup a) => Semigroup ( LastToFinishM m a) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods (<>) :: LastToFinishM m a -> LastToFinishM m a -> LastToFinishM m a Source # sconcat :: NonEmpty ( LastToFinishM m a) -> LastToFinishM m a Source # stimes :: Integral b => b -> LastToFinishM m a -> LastToFinishM m a Source #
( Applicative m, Monoid a) => Monoid ( LastToFinishM m a) Source #
Instance details Defined in Data.Monoid.Synchronisation Methods mempty :: LastToFinishM m a Source # mappend :: LastToFinishM m a -> LastToFinishM m a -> LastToFinishM m a Source # mconcat :: [ LastToFinishM m a] -> LastToFinishM m a Source #
type Rep1 ( LastToFinishM m :: Type -> Type ) Source #
Instance details Defined in Data.Monoid.Synchronisation type Rep1 ( LastToFinishM m :: Type -> Type ) = D1 (' MetaData "LastToFinishM" "Data.Monoid.Synchronisation" "monoidal-synchronisation-0.1.0.1-DikVxJZKIrcFnSuUOiLlPL" ' True ) ( C1 (' MetaCons "LastToFinishM" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "runLastToFinishM") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec1 m)))
type Rep ( LastToFinishM m a) Source #
Instance details Defined in Data.Monoid.Synchronisation type Rep ( LastToFinishM m a) = D1 (' MetaData "LastToFinishM" "Data.Monoid.Synchronisation" "monoidal-synchronisation-0.1.0.1-DikVxJZKIrcFnSuUOiLlPL" ' True ) ( C1 (' MetaCons "LastToFinishM" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "runLastToFinishM") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec0 (m a))))

firstToLastM :: FirstToFinish m a -> LastToFinishM m a Source #

lastToFirstM :: LastToFinishM m a -> FirstToFinish m a Source #