A B C D E F G H I J K L M N O P Q R S T U V W X Y Z _

A

ap(M<A>, M<F<A, B>>) - Method in Monad
Sequence computations and combine their results.
append(A, A) - Method in Semigroup
(<>) :: a -> a -> a
Applicative - Class in com.github.mperry.fg.typeclass
Created by MarkPerry on 9/04/2014.
apply(App<F<A, B>>, App<A>) - Method in Applicative
Sequence computations and combine their results (<*>) :: f (a -> b) -> f a -> f b
apply(List<F<A, B>>, List<A>) - Method in ListApplicative
apply(M<F<A, B>>, M<A>) - Method in Monad
Implements Applicative.apply using Monad combinators (<*>) :: f (a -> b) -> f a -> f b
apply(Option<F<A, B>>, Option<A>) - Method in OptionApplicative

B

C

Comonad - Class in com.github.mperry.fg.typeclass
Created by MarkPerry on 28/12/2014.
compose(F<B, M<C>>, F<A, M<B>>) - Method in Monad
Right-to-left Kleisli composition of monads. (>=>), with the arguments flipped http://hackage.haskell.org/package/base-4.6.0.1/docs/Control-Monad.html#v:-60--61--60-

D

defaultSet() - Method in SetMonad
duplicate(CM<A>) - Method in Comonad
duplicate :: w a -> w (w a)

E

extend() - Method in Comonad
extract(CM<A>) - Method in Comonad
extract :: w a -> a

F

filterM(List<A>, F<A, M<Boolean>>) - Method in Monad
This generalizes the list-based filter function.
flatMap(IO<A>, F<A, IO<B>>) - Method in IOMonad
flatMap(List<A>, F<A, List<B>>) - Method in ListMonad
flatMap() - Method in Monad
flatMap(T<M, A>, Monad<M>, F<A, T<M, B>>) - Method in MonadTrans
flatMap(Option<A>, F<A, Option<B>>) - Method in OptionMonad
flatMap(OptionT<M, A>, Monad<M>, F<A, OptionT<M, B>>) - Method in OptionMonadTrans
flatMap(F<A, OptionT<M, B>>) - Method in OptionT
flatMap(SafeIO<A>, F<A, SafeIO<B>>) - Method in SafeIOMonad
flatMap(Set<A>, F<A, Set<B>>) - Method in SetMonad
flatMap(F<A, StateInt<B>>) - Method in StateInt
flatMap(StateInt<A>, F<A, StateInt<B>>) - Method in StateIntMonad
foldM_(List<A>, B, F2<B, A, M<B>>) - Method in Monad
foldM(List<A>, B, F2<B, A, M<B>>) - Method in Monad
Functor - Interface in com.github.mperry.fg.typeclass
Created by MarkPerry on 9/04/2014.

G

H

I

IOMonad - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 15/07/2014.

J

join(M<M<A>>) - Method in Monad
The join function is the conventional monad join operator.

K

L

left(App<A>, App<B>) - Method in Applicative
(<*) :: f a -> f b -> f a
leftShift(F<CM<B>, C>, F<CM<A>, B>, CM<A>) - Method in Comonad
(=<=) :: Comonad w => (w b -> c) -> (w a -> b) -> w a -> c Right-to-left Cokleisli composition
liftA2_() - Method in Applicative
liftA2(F2<A, B, C>, App<A>, App<B>) - Method in Applicative
liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c
liftA3(F3<A, B, C, D>, App<A>, App<B>, App<C>) - Method in Applicative
liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
liftA(F<A, B>, App<A>) - Method in Applicative
liftA :: Applicative f => (a -> b) -> f a -> f b
liftM2(M<A>, M<B>, F2<A, B, R>) - Method in Monad
Promote a function to a monad, scanning the monadic arguments from left to right.
liftM3(M<A>, M<B>, M<C>, F3<A, B, C, R>) - Method in Monad
Promote a function to a monad, scanning the monadic arguments from left to right (cf. liftM2).
liftM(M<A>, F<A, B>) - Method in Monad
Promote a function to a monad.
liftW(CM<A>, F<A, B>) - Method in Comonad
liftW :: Comonad w => (a -> b) -> w a -> w b
ListApplicative - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 10/04/2014.
ListFunctor - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 10/04/2014.
ListMonad - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 10/04/2014.

M

map2(M<A>, M<B>, F2<A, B, C>) - Method in Monad
map(CM<A>, F<A, B>) - Method in Comonad
map(T<A>, F<A, B>) - Method in Functor
map :: (a -> b) -> f a -> f b order of first and second parameters reversed here to fit Groovy style
map(List<A>, F<A, B>) - Method in ListApplicative
map(List<A>, F<A, B>) - Method in ListFunctor
map(M<A>, F<A, B>) - Method in Monad
Implements Functor interface using Monad combinators fmap :: (a -> b) -> f a -> f b
map(Option<A>, F<A, B>) - Method in OptionApplicative
map(Option<A>, F<A, B>) - Method in OptionFunctor
map(F<A, B>) - Method in OptionT
mappend(A, A) - Method in Monoid
mappend :: a -> a -> a
mempty() - Method in Monoid
mempty :: a
Monad - Class in com.github.mperry.fg.typeclass
Created by MarkPerry on 30/12/13.
MonadPlus - Class in com.github.mperry.fg.typeclass
Created by MarkPerry on 12/04/2014.
MonadTrans - Class in com.github.mperry.fg.typeclass
Created by MarkPerry on 27/12/2014.
Monoid - Interface in com.github.mperry.fg.typeclass
Created by MarkPerry on 9/04/2014.

N

O

OptionApplicative - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 10/04/2014.
OptionFunctor - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 10/04/2014.
OptionMonad - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 10/04/2014.
OptionMonadTrans - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 27/12/2014.
OptionT - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 27/12/2014.
OptionT(M<Option<A>>, Monad<M>) - Constructor in OptionT

P

point(M<Option<A>>, Monad<M>) - Method in OptionT
pure(A) - Method in Applicative
lift value into Applicative pure :: a -> f a
pure(A) - Method in ListApplicative
pure(A) - Method in Monad
Implements Applicative.pure using Monad combinators pure :: a -> f a
pure(A) - Method in OptionApplicative

Q

R

replicateM(Integer, M<A>) - Method in Monad
replicateM n act performs the action n times, gathering the results.
right(App<A>, App<B>) - Method in Applicative
(*>) :: f a -> f b -> f b
rightShift(F<CM<A>, B>, F<CM<B>, C>, CM<A>) - Method in Comonad
(=>=) :: Comonad w => (w a -> b) -> (w b -> c) -> w a -> c Left-to-right Cokleisli composition

S

SafeIOMonad - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 7/09/2014.
Semigroup - Interface in com.github.mperry.fg.typeclass
Created by MarkPerry on 9/04/2014.
sequence(List<M<A>>) - Method in Monad
Evaluate each action in the sequence from left to right, and collect the results.
sequenceA(List<App<A>>) - Method in Applicative
SetMonad - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 10/04/2014.
skip(M<A>) - Method in Monad
StateInt - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 15/10/2014.
StateInt(F<Integer, P2<Integer, A>>) - Constructor in StateInt
StateIntMonad - Class in com.github.mperry.fg.typeclass.concrete
Created by MarkPerry on 15/10/2014.

T

to(M<A>, B) - Method in Monad
traverse(List<A>, F<A, M<B>>) - Method in Monad
Map each element of a structure to an action, evaluate these actions from left to right and collect the results.

U

unit(A) - Method in IOMonad
unit(A) - Method in ListMonad
unit() - Method in Monad
Returns a function representing unit
unit(M<A>, Monad<M>) - Method in MonadTrans
unit(A) - Method in OptionMonad
unit(M<A>, Monad<M>) - Method in OptionMonadTrans
unit(A) - Method in SafeIOMonad
unit(A) - Method in SetMonad
unit(F<Integer, P2<Integer, A>>) - Method in StateInt
unit(A) - Method in StateIntMonad
unless(Boolean, M<Unit>) - Method in Monad
The reverse of when.

V

W

wfix() - Method in Comonad
when(Boolean, M<Unit>) - Method in Monad
Conditional execution of monadic expressions.

X

Y

Z

_

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z _