Grisette.Unified.Lib.Data.Foldable

Documentation

symElem :: forall mode t a. (Foldable t, EvalMode mode, UnifiedSymEq mode a) => a -> t a -> GetBool mode

elem with symbolic equality.

symMaximum :: forall mode a t. (Foldable t, Mergeable a, UnifiedSymOrd mode a, UnifiedITEOp mode a, EvalMode mode) => t a -> a

maximum with result merged with ITEOp.

mrgMaximum :: forall mode a t m. (Foldable t, MonadWithMode mode m, Mergeable a, UnifiedSymOrd mode a) => t a -> m a

maximum with unified comparison.

symMinimum :: forall mode a t. (Foldable t, Mergeable a, UnifiedSymOrd mode a, UnifiedITEOp mode a, EvalMode mode) => t a -> a

maximum with result merged with ITEOp.

mrgMinimum :: forall mode a t m. (Foldable t, MonadWithMode mode m, Mergeable a, UnifiedSymOrd mode a) => t a -> m a

minimum with MergingStrategy knowledge propagation.

Special biased folds

mrgFoldrM :: (MonadTryMerge m, Mergeable b, Foldable t) => (a -> b -> m b) -> b -> t a -> m b

foldrM with MergingStrategy knowledge propagation.

mrgFoldlM :: (MonadTryMerge m, Mergeable b, Foldable t) => (b -> a -> m b) -> b -> t a -> m b

foldlM with MergingStrategy knowledge propagation.

Folding actions

Applicative actions

mrgTraverse_ :: (Applicative m, TryMerge m, Foldable t) => (a -> m b) -> t a -> m ()

traverse_ with MergingStrategy knowledge propagation.

mrgFor_ :: (Applicative m, TryMerge m, Foldable t) => t a -> (a -> m b) -> m ()

for_ with MergingStrategy knowledge propagation.

mrgSequenceA_ :: (Foldable t, TryMerge m, Applicative m) => t (m a) -> m ()

sequence_ with MergingStrategy knowledge propagation.

mrgAsum :: (Alternative f, TryMerge f, Mergeable a, Foldable t) => t (f a) -> f a

asum with MergingStrategy knowledge propagation.

Monadic actions

mrgMapM_ :: (MonadTryMerge m, Foldable t) => (a -> m b) -> t a -> m ()

mapM_ with MergingStrategy knowledge propagation.

mrgForM_ :: (MonadTryMerge m, Foldable t) => t a -> (a -> m b) -> m ()

forM_ with MergingStrategy knowledge propagation.

mrgSequence_ :: (Foldable t, MonadTryMerge m) => t (m a) -> m ()

sequence_ with MergingStrategy knowledge propagation.

mrgMsum :: (MonadTryMerge m, Mergeable a, MonadPlus m, Foldable t) => t (m a) -> m a

msum with MergingStrategy knowledge propagation.

Folding actions

symAnd :: (EvalMode mode, Foldable t) => t (GetBool mode) -> GetBool mode

and on unified boolean.

symOr :: (EvalMode mode, Foldable t) => t (GetBool mode) -> GetBool mode

or on unified boolean.

symAny :: (EvalMode mode, Foldable t) => (a -> GetBool mode) -> t a -> GetBool mode

any on unified boolean.

symAll :: (EvalMode mode, Foldable t) => (a -> GetBool mode) -> t a -> GetBool mode

all on unified boolean.

symMaximumBy :: forall mode t a. (Foldable t, Mergeable a, UnifiedITEOp mode a, EvalMode mode) => (a -> a -> BaseMonad mode Ordering) -> t a -> a

maximumBy with result merged with ITEOp.

mrgMaximumBy :: forall mode t a m. (Foldable t, Mergeable a, MonadWithMode mode m) => (a -> a -> BaseMonad mode Ordering) -> t a -> m a

maximumBy with MergingStrategy knowledge propagation.

symMinimumBy :: forall mode t a. (Foldable t, Mergeable a, UnifiedITEOp mode a, EvalMode mode) => (a -> a -> BaseMonad mode Ordering) -> t a -> a

minimumBy with result merged with ITEOp.

mrgMinimumBy :: forall mode t a m. (Foldable t, Mergeable a, MonadWithMode mode m) => (a -> a -> BaseMonad mode Ordering) -> t a -> m a

minimumBy with MergingStrategy knowledge propagation.

Searches

symNotElem :: (Foldable t, UnifiedSymEq mode a, EvalMode mode) => a -> t a -> GetBool mode

elem with symbolic equality.

mrgFind :: (Foldable t, MonadWithMode mode m, Mergeable a) => (a -> GetBool mode) -> t a -> m (Maybe a)

elem with symbolic equality and MergingStrategy knowledge propagation.