R
Alpha
ROIRIWW
AdjunctUsage
RWS
scalaz
RWST
scalaz
RWState
AdjunctUsage
Ran
scalaz
RandomReader
FreeUsage
Ranked
Heap
Read
Console
Reader
scalaz
ReaderT
scalaz
ReaderWriterState
scalaz
ReaderWriterStateT
scalaz
ReaderWriterStateTFunctions
scalaz
ReaderWriterStateTInstances
scalaz
ReaderWriterStateTInstances0
scalaz
ReaderWriterStateTUsage
example
ReduceState
LaunchburyInterpreter
Reducer
scalaz
ReducerInstances
scalaz
ReducerLaw
Reducer
ReducerOps
syntax
RefCountedFinalizer
effect
RefCountedFinalizers
effect
RegionT
effect
RegionTHoist
RegionTInstances1
RegionTInstances
effect
RegionTInstances1
effect
RegionTLiftIO
RegionTInstances1
effect
RegionTMonad
RegionTInstances1
effect
Representable
scalaz
RepresentableInstances
scalaz
RepresentableLaw
Representable
Resource
effect
ResourceOps
effect
ResourceSyntax
effect
ReverseListReducer
ReducerInstances
ReverseNonEmptyListReducer
ReducerInstances
Right3
scalaz
Rng
FreeUsage
RngOp
FreeUsage
RngOps
FreeUsage
RunInBase
IO
RunLength
CABRunLengthEncoder
RunLengthConfig
CABRunLengthEncoder
RunLengthState
CABRunLengthEncoder
r
IterateeUsage
raiseError
ApplicativeError
IsomorphismApplicativeError
MonadErrorIdOps
raisedErrorsHandled
ApplicativeErrorLaws
applicativeError
ranFunctor
Ran
ranToAdjoint
Ran
range
EphemeralStream
rank
Ranked
read
IORef
STArray
STRef
Console
readLn
IO
IterateeUsage
readToken
CABRunLengthEncoder
readToken2
CABRunLengthEncoder
readerRepresentable
RepresentableInstances
reassociateIso
Associative
reassociateLeft
Associative
IsomorphismAssociative
AssociativeOps
reassociateRight
Associative
IsomorphismAssociative
AssociativeOps
recItem
ContravariantCoyonedaUsage
recItemOrd
ContravariantCoyonedaUsage
recover
\/
ApplicativeErrorOps
recoverWith
\/
reduceLeftOption
IList
reduceRightOption
IList
reduceTo
FingerTree
UnfoldTo
reduceToOpt
UnfoldTo
reduceUnordered
Nondeterminism
reduced
EnumeratorT
reducer
ReducerInstances
ScalazProperties
Syntaxes
reducerLaw
Reducer
refCountedFinalizer
RefCountedFinalizers
refcount
RefCountedFinalizer
refl
Isomorphisms
Leibniz
LeibnizF
Liskov
LiskovF
NaturalTransformations
reflexive
EqualLaw
equal
reflexiveInjectInstance
InjectInstances
regionT
RegionT
regionTMonadIO
MonadIO
rep
Codensity
Representable
repUnrep
RepresentableLaw
repeat
Semigroup
EnumeratorTFunctions
repeatBuild
IterateeFunctions
repeating
AdjunctUsage
TraverseUsage
repeats
AdjunctUsage
replace
IndSeq
replicate
DList
Heap
replicateM
Applicative
ApplicativeOps
replicateM_
Applicative
ApplicativeOps
representable
Adjunction
representableLaw
Representable
res1
AdjunctUsage
TraverseUsage
res2
AdjunctUsage
TraverseUsage
reset
Cord
Free
IndexedContsTFunctions
WriterT
resource
Resource
CodensityUsage
EffectSyntaxes
resourceFromAutoCloseable
Resource
resourceFromCloseable
Resource
resourceSyntax
Resource
result
ApplyUsage
FunctorUsage
TraverseUsage
result2
ApplyUsage
resultAppend
WriterUsage
resultFappend
WriterUsage
resultPrepend
WriterUsage
resume
Free
FreeT
resumeC
Free
FreeT
retention
LensLaw
lens
retract
FreeAp
returnST
ST
return_
Free
rev
ArrowUsage
IListUsage
reverse
Dequeue
EphemeralStream
IList
IStream
NonEmptyList
Traverse
TraverseOps
reverseIterator
FingerTree
Finger
Four
Node
One
Three
Two
reverseMap
IList
reverseOrder
Order
reverse_:::
IList
reversed
IterateeFunctions
rhead
Finger
Four
One
Three
Two
right
:+:
Coproduct
EitherT
IsomorphismProChoice
NullArgument
NullResult
ProChoice
TreeLoc
\/
N
EitherOps
right3
Either3
rightAdjunct
Adjunction
rightAs
BifunctorOps
rightF
BifunctorUsage
rightFM1Consistent
Foldable1Law
foldable1
rightFMConsistent
BifoldableLaw
FoldableLaw
bifoldable
foldable
rightFoldable
Bifoldable
rightFunctor
Bifunctor
rightIdentity
CategoryLaw
DivisibleLaw
MonadLaw
MonoidLaw
category
divisible
monad
monoid
rightInjectInstance
InjectInstances
rightLeft
AssociativeLaw
associative
rightMap
Bifunctor
BifunctorOps
rightOr
Either3
rightPLens
PLensFunctions
rightPLensFamily
PLensFamilyFunctions
rightPlusIdentity
EmptyLaw
plusEmpty
rightT
EitherT
rightTraverse
Bitraverse
rightU
EitherT
rightZero
StrongMonadPlusLaw
monadPlus
rightc
Coproduct
rights
MonadPlus
TreeLoc
Zipper
MonadPlusOps
rle
CABRunLengthEncoder
roll
Free
FreeT
root
TreeLoc
rootLabel
StrictTree
Tree
rotL
FingerTree
rotR
FingerTree
rtail
Finger
Four
One
Three
Two
run
Bitraversal
Cokleisli
ContravariantCoyoneda
Coproduct
Coyoneda
Distribution
EitherT
Endo
EndoByName
Endomorphic
Free
IdT
IndexedContsT
IndexedReaderWriterStateT
IndexedStateT
IndexedStoreT
Kleisli
LazyEitherT
LazyOptionT
LensFamily
ListT
MaybeT
OneOr
OptionT
PLensFamily
TheseT
TracedT
Traversal
UnwriterT
WriterT
Yoneda
SafeApp
EnumerateeT
IterateeT
run2RWState
AdjunctUsage
runBitraverseS
Bitraverse
runDensity
Density
runM
Free
FreeT
runQuickSort
TrampolineUsage
runRec
IndexedStateT
runRecM
Free
runRegionT
IO
runRng
FreeUsage
runST
ST
runStreamT
StreamT
runT
RegionT
runTraverseS
Traverse
TraverseOps
runZero
IndexedReaderWriterStateT
IndexedStateT
runZeroRec
IndexedStateT
run_
IndexedContsT
runc
SafeApp
CodensityUsage
runl
SafeApp
rwst
IndexedStateT
Kleisli
WriterT
rwstBind
IndexedReaderWriterStateTInstances0
rwstBindRec
IndexedReaderWriterStateTInstances
rwstContravariantR
ReaderWriterStateTInstances
rwstContravariantS1
ReaderWriterStateTInstances
rwstHoist
ReaderWriterStateTInstances
rwstMonad
ReaderWriterStateTInstances0
rwstMonadError
IndexedReaderWriterStateTInstances
rwstMonadPlus
ReaderWriterStateTInstances