R
Alpha
RWS
scalaz
RWST
scalaz
Ran
scalaz
Ranked
Heap
Reader
scalaz
ReaderT
scalaz
ReaderWriterState
scalaz
ReaderWriterStateT
scalaz
ReaderWriterStateTFunctions
scalaz
ReaderWriterStateTInstances
scalaz
ReaderWriterStateTInstances0
scalaz
Reducer
scalaz
ReducerInstances
scalaz
ReducerLaw
Reducer
ReducerOps
syntax
Representable
scalaz
RepresentableInstances
scalaz
RepresentableLaw
Representable
ReverseListReducer
ReducerInstances
ReverseNonEmptyListReducer
ReducerInstances
Right3
scalaz
r
\/
raiseError
ApplicativeError
IsomorphismApplicativeError
MonadErrorIdOps
raisedErrorsHandled
ApplicativeErrorLaws
ranFunctor
Ran
ranToAdjoint
Ran
range
EphemeralStream
rank
Ranked
readerRepresentable
RepresentableInstances
reassociateIso
Associative
reassociateLeft
Associative
IsomorphismAssociative
AssociativeOps
reassociateRight
Associative
IsomorphismAssociative
AssociativeOps
recover
\/
ApplicativeErrorOps
recoverWith
\/
reduceLeftOption
IList
reduceRightOption
IList
reduceTo
FingerTree
UnfoldTo
reduceToOpt
UnfoldTo
reduceUnordered
Nondeterminism
reducer
ReducerInstances
Syntaxes
reducerLaw
Reducer
refl
Isomorphisms
Leibniz
LeibnizF
Liskov
LiskovF
NaturalTransformations
reflexive
EqualLaw
reflexiveInjectInstance
InjectInstances
removeByKey
PrioritySearchQueue
rep
Codensity
Representable
repUnrep
RepresentableLaw
repeat
Semigroup
replace
IndSeq
replicate
DList
Heap
replicateM
Applicative
ApplicativeOps
replicateM_
Applicative
ApplicativeOps
representable
Adjunction
representableLaw
Representable
reset
Cord
Free
IndexedContsTFunctions
WriterT
resume
Free
FreeT
resumeC
Free
FreeT
retention
LensLaw
retract
FreeAp
return_
Free
reverse
Dequeue
EphemeralStream
IList
IStream
NonEmptyList
Traverse
TraverseOps
reverseIterator
FingerTree
Finger
Four
Node
One
Three
Two
reverseMap
IList
reverseOrder
Order
reverse_:::
IList
rhead
Finger
Four
One
Three
Two
right
:+:
Coproduct
EitherT
IsomorphismProChoice
NullArgument
NullResult
ProChoice
TreeLoc
\/
EitherOps
right3
Either3
rightAdjunct
Adjunction
rightAs
BifunctorOps
rightFM1Consistent
Foldable1Law
rightFMConsistent
BifoldableLaw
FoldableLaw
rightFoldable
Bifoldable
rightFunctor
Bifunctor
rightIdentity
CategoryLaw
DivisibleLaw
MonadLaw
MonoidLaw
rightInjectInstance
InjectInstances
rightLeft
AssociativeLaw
rightMap
Bifunctor
BifunctorOps
rightOr
Either3
rightPLens
PLensFunctions
rightPLensFamily
PLensFamilyFunctions
rightPlusIdentity
EmptyLaw
rightT
EitherT
rightTraverse
Bitraverse
rightU
EitherT
rightZero
StrongMonadPlusLaw
rightc
Coproduct
rights
MonadPlus
TreeLoc
Zipper
MonadPlusOps
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
SelectT
TheseT
TracedT
Traversal
UnwriterT
WriterT
Yoneda
runBitraverseS
Bitraverse
runDensity
Density
runM
Free
FreeT
runRec
IndexedStateT
runRecM
Free
runStreamT
StreamT
runTraverseS
Traverse
TraverseOps
runZero
IndexedReaderWriterStateT
IndexedStateT
runZeroRec
IndexedStateT
run_
IndexedContsT
rwst
IndexedStateT
Kleisli
WriterT
rwstBind
IndexedReaderWriterStateTInstances0
rwstBindRec
IndexedReaderWriterStateTInstances
rwstContravariantR
ReaderWriterStateTInstances
rwstContravariantS1
ReaderWriterStateTInstances
rwstHoist
ReaderWriterStateTInstances
rwstMonad
ReaderWriterStateTInstances0
rwstMonadError
IndexedReaderWriterStateTInstances
rwstMonadPlus
ReaderWriterStateTInstances