monoids-0.1.2: Lots of Monoids
Source code
Contents
Index
Data.Monoid.Generator.Combinators
Documentation
module
Data.Monoid.Generator
traverse_
:: (
Generator
c,
Applicative
f) => (
Elem
c -> f b) -> c -> f
()
Source
for_
:: (
Generator
c,
Applicative
f) => c -> (
Elem
c -> f b) -> f
()
Source
mapM_
:: (
Generator
c,
Monad
m) => (
Elem
c -> m b) -> c -> m
()
Source
forM_
:: (
Generator
c,
Monad
m) => c -> (
Elem
c -> m b) -> m
()
Source
foldMap'
:: (
Monoid
m,
Generator
c) => (
Elem
c -> m) -> c -> m
Source
concatMap
::
Generator
c => (
Elem
c -> [b]) -> c -> [b]
Source
and
:: (
Generator
c,
Elem
c ~
Bool
) => c ->
Bool
Source
or
:: (
Generator
c,
Elem
c ~
Bool
) => c ->
Bool
Source
any
::
Generator
c => (
Elem
c ->
Bool
) -> c ->
Bool
Source
all
::
Generator
c => (
Elem
c ->
Bool
) -> c ->
Bool
Source
sum
:: (
Generator
c,
Num
(
Elem
c)) => c ->
Elem
c
Source
product
:: (
Generator
c,
Num
(
Elem
c)) => c ->
Elem
c
Source
elem
:: (
Generator
c,
Eq
(
Elem
c)) =>
Elem
c -> c ->
Bool
Source
notElem
:: (
Generator
c,
Eq
(
Elem
c)) =>
Elem
c -> c ->
Bool
Source
filter
:: (
Generator
c,
Reducer
(
Elem
c) m) => (
Elem
c ->
Bool
) -> c -> m
Source
find
::
Generator
c => (
Elem
c ->
Bool
) -> c ->
Maybe
(
Elem
c)
Source
Produced by
Haddock
version 2.4.2