Search results

sequence :: forall a m t. Traversable t => Applicative m => t (m a) -> m (t a)

sequence1 :: forall b f t. Traversable1 t => Apply f => t (f b) -> f (t b)

sequence1Default :: forall t a m. Traversable1 t => Apply m => t (m a) -> m (t a)

A default implementation of sequence1 using traverse1.

sequenceDefault :: forall t a m. Traversable t => Applicative m => t (m a) -> m (t a)

A default implementation of sequence using traverse.

distribute :: forall a g f. Distributive f => Functor g => g (f a) -> f (g a)

distributeDefault :: forall a f g. Distributive f => Functor g => g (f a) -> f (g a)

A default implementation of distribute, based on collect.

parSequence :: forall a t m f. Parallel f m => Traversable t => t (m a) -> m (t a)

sequence :: forall a b c. HasApply b => HasMap b => HasTraverse a => HasPure b => a (b c) -> b (a c)

Sequences actions and collects the results.

sequence [Just 1, Just 2] -- Just [1, 2]

oneOf :: forall f g a. Foldable f => Plus g => f (g a) -> g a

Combines a collection of elements using the Alt operation.

oneOf :: forall m f a. MonadGen m => Foldable1 f => f (m a) -> m a

Creates a generator that outputs a value chosen from a selection of existing generators with uniform probability.

parOneOf :: forall a t m f. Parallel f m => Alternative f => Foldable t => Functor t => t (m a) -> m a

Race a collection in parallel.

unwrapCofree :: forall a w f. ComonadCofree f w => w a -> f (w a)

wrapFree :: forall a m f. MonadFree f m => f (m a) -> m a

choice :: forall f g a. Foldable f => Alt g => Plus g => f (g a) -> g a

oneOf :: forall f m a. Foldable f => Alternative m => f (m a) -> m a

restoreM :: forall a stM m base. MonadBaseControl base m stM => base (stM a) -> m a

join :: forall a m. Bind m => m (m a) -> m a

Collapse two applications of a monadic type constructor into one.

duplicate :: forall a w. Extend w => w a -> w (w a)

Duplicate a comonadic context.

duplicate is dual to Control.Bind.join.

keepLatest :: forall a event. IsEvent event => event (event a) -> event a

flatten :: forall a b. HasChain a => a (a b) -> a b

Removes a level of nesting from a container.

flatten [[1, 2], [3, 4]] -- [1, 2, 3, 4]

warbler :: forall a m. Bind m => m (m a) -> m a

W combinator - warbler - omega

MM

Λ a b . (a → a → b) → a → b

λ f x . f x x

unfoldable :: forall m f a. MonadRec m => MonadGen m => Unfoldable f => m a -> m (f a)

Creates a generator that produces unfoldable structures based on an existing generator for the elements.

The size of the unfoldable will be determined by the current size state for the generator. To generate an unfoldable structure of a particular size, use the resize function from the MonadGen class first.

fork :: forall a m f. MonadFork f m => m a -> m (f a)

suspend :: forall a m f. MonadFork f m => m a -> m (f a)

integrateM :: forall base m stM a. Applicative base => MonadBaseControl base m stM => m (stM a) -> m a

Pack a state belonging to m back into it, instead of throwing it away

lift :: forall f g a. Applicative f => Applicative g => a -> f (g a)

elements :: forall m f a. MonadGen m => Foldable1 f => f a -> m a

Creates a generator that outputs a value chosen from a selection with uniform probability.

inj :: forall a g f. Inject f g => f a -> g a

join :: forall a m f. MonadFork f m => f a -> m a

liftBase :: forall a m b. MonadBase b m => b a -> m a

inj :: forall a g f. Inject f g => f a -> g a

forever :: forall m a b. MonadRec m => m a -> m b

forever runs an action indefinitely, using the MonadRec instance to ensure constant stack usage.

For example:

main = forever $ trace "Hello, World!"

coerce :: forall f a b. Contravariant f => Functor f => f a -> f b

uninterruptible :: forall a m f e. MonadBracket e f m => m a -> m a

cleared :: forall f a b. Filterable f => f a -> f b

Filter out all values.

folded :: forall event a. IsEvent event => Monoid a => event a -> event a

Combine subsequent events using a Monoid.

sort :: forall f a. Functor f => Foldable f => Unfoldable f => Ord a => f a -> f a

Sort any structure (which has Foldable, Unfoldable, and Functor instances) by converting to an OrdSeq and back again. I am fairly sure this is usually O(n*log(n)), although of course this depends on the Unfoldable and Foldable instances.

lookAhead :: forall a m. LookAheadParsing m => m a -> m a

once :: forall m a. MonadLogic m => m a -> m a

try :: forall a m. Parsing m => m a -> m a

pure :: forall a f. Applicative f => a -> f a

extract :: forall a w. Comonad w => w a -> a

and :: forall a f. Foldable f => HeytingAlgebra a => f a -> a

The conjunction of all the values in a data structure. When specialized to Boolean, this function will test whether all of the values in a data structure are true.

fold :: forall f m. Foldable f => Monoid m => f m -> m

Fold a data structure, accumulating values in some Monoid.

fold1 :: forall m t. Foldable1 t => Semigroup m => t m -> m

fold1Default :: forall t m. Foldable1 t => Semigroup m => t m -> m

A default implementation of fold1 using foldMap1.

length :: forall a b f. Foldable f => Semiring b => f a -> b

Returns the size/length of a finite structure. Optimized for structures that are similar to cons-lists, because there is no general way to do better.

maximum :: forall f a. Ord a => Foldable1 f => f a -> a

minimum :: forall f a. Ord a => Foldable1 f => f a -> a

or :: forall a f. Foldable f => HeytingAlgebra a => f a -> a

The disjunction of all the values in a data structure. When specialized to Boolean, this function will test whether any of the values in a data structure is true.