package example
- Alphabetic
- Public
- Protected
Package Members
- package transformers
Value Members
- case object A extends Token with Product with Serializable
- object AdjunctUsage
- object ApplyUsage
- object ArrowUsage
- case object B extends Token with Product with Serializable
- object BifunctorUsage
A Bifunctor is very similar to a Functor, which you are hopefully already familiar with.
A Bifunctor is very similar to a Functor, which you are hopefully already familiar with. Whereas a Functor operates on a * → * and has a single operation
mapwhich takes a function from A => B to map a F[A] to a F[B], a Bifunctor operates on a *,* → * and has a single operationbimapwhich takes two functions: A => C and a B => D to map a F[A,B] to a F[C,D]:def bimap[A, B, C, D](fab: F[A, B])(f: A => C, g: B => D): F[C, D]
some examples of common types for which we have Bifunctor instances are Either, Validation, \/, Tuple2
- case object C extends Token with Product with Serializable
- object CABRunLengthEncoder
- object CaseInsensitiveUsage
- object CodensityUsage extends SafeApp
- object ContTUsage
- object ContravariantCoyonedaUsage
- object DirectTypeClassUsage
- object DisjunctionUsage
- object DivideExample
- object EndoUsage
- object EnumUsage
- object FibStateExample
- object FingerTreeUsage
- object Foldable1Usage
- object FoldableUsage
- object FreeApUsage
- object FreeMonadsUsage
- object FreeUsage
- object FunctorUsage
A Functor is a ubiquitous typeclass involving type constructors of kind * → *, which is another way of saying types that have a single type variable.
A Functor is a ubiquitous typeclass involving type constructors of kind * → *, which is another way of saying types that have a single type variable. Examples might be Option, List, Future.
The Functor category involves a single operation, named
map:def map[A, B](fa: F[A])(f: A => B): F[B]
This method takes a Function from A => B and turns an F[A] into an F[B]
- object IListUsage
- object IsomorphismUsage
- object IterateeUsage
- object KleisliUsage
- object LaunchburyInterpreter
Simple call-by-need (i.e.
Simple call-by-need (i.e. lazy) interpreter for Lambda Calculus based off of John Launchbury's "A Natural Semantics for Lazy Evaluation" Uses the "Barendregt convention": All variable names are globally unique (i.e. you cannot shadow variable names), and renames variables after substitution to maintain this invariant.
- object MixedBag
- object MonadTransUsage
- object NameNeedValueUsage
- object NewTypeUsage
- object PartiallyApplied
- object ReaderWriterStateTUsage
- object STUsage
- object StringUsage
- object StrongUsage
- object SyntaxUsage
- object TagUsage
scalaz contains a way to simulate something similar to a Haskell newtype, where we can take an existing type, and create a new type from it, and allow us to create new typeclass instances for our newly created type to get different behaviors.
scalaz contains a way to simulate something similar to a Haskell newtype, where we can take an existing type, and create a new type from it, and allow us to create new typeclass instances for our newly created type to get different behaviors. The same thing could be done with scala 2.10's Value Classes: https://docs.scala-lang.org/overviews/core/value-classes.html however one has to be very careful when using value classes, because there are a lot of instances in which using a value class will incur a runtime boxing/unboxing of your value, which incurs a runtime cost. The scalaz tagged types will never cause boxing of a value that is already
AnyRef. - object Token
- object TrampolineUsage
- object TraverseUsage
- object UnapplyInference
Examples showing the use of Unapply to reduce the need for type annotations
- object WordCount
Character/Line/Word Count from "The Essence of the Iterator Pattern".
Character/Line/Word Count from "The Essence of the Iterator Pattern".
- object WriterUsage