fold

Type Members

implicit class doubleFold[M[_], A] extends AnyRef

Definition Classes
FoldImplicits
implicit class fractionalFold[M[_], A, B] extends AnyRef

Definition Classes
FoldImplicits
implicit class numericFold[M[_], A, B, S1] extends AnyRef

Definition Classes
FoldImplicits

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
implicit def ApplyFold[M[_], T](implicit arg0: Monad[M]): Apply[[γ$0$]Fold[M, T, γ$0$]]

Apply instance
Apply instance
This means that we can write:
val mean: Fold[Int, Int] = (sum |@| count)(_ / _)
An Apply instance is also a Functor instance so we can write:
val meanTimes2 = mean.map(_ * 2)

Definition Classes
FoldImplicits
def CoflatMapFold[M[_], T](implicit m: Monad[M]): CoflatMap[[γ$10$]Fold[M, T, γ$10$]]

Cobind instance
Cobind instance

Definition Classes
FoldImplicits
implicit def ComposeFold[M[_]](implicit arg0: Monad[M]): Compose[[β$6$, γ$7$]Fold[M, β$6$, γ$7$]]

A Fold can be turned into a Compose
A Fold can be turned into a Compose
This allows us to write:
val scans = sum compose list

Definition Classes
FoldImplicits
implicit def IdMonadNat[M[_]](implicit m: Monad[M]): ~>[Id, M]

Definition Classes
FoldImplicits
implicit def MonoidFold[M[_], A, B](implicit m: Monad[M], monoid: Monoid[B]): Monoid[Fold[M, A, B]]

Definition Classes
FoldImplicits
implicit def MonoidSink[M[_], A](implicit m: Monad[M]): Monoid[Fold[M, A, Unit]]

Definition Classes
FoldImplicits
implicit def ProfunctorFold[M[_]](implicit arg0: Monad[M]): Profunctor[[β$2$, γ$3$]Fold[M, β$2$, γ$3$]]

Profunctor instance
Profunctor instance
This is especially useful because we can "map" on the input element
val doubleSum = fromMonoid[Double] // sum all elements val roundedDoubleSum = doubleSum.mapfst(_.round)

Definition Classes
FoldImplicits
final def asInstanceOf[T0]: T0

Definition Classes
Any
def bracket[M[_], A, C](open: M[C])(step: (C, A) ⇒ M[C])(close: (C) ⇒ M[Unit])(implicit m: MonadError[M, Throwable]): Fold[M, A, Unit]

returns
a fold with just an open action and a close action which is always executed even in case of a failure during folding

Definition Classes
FoldCreation
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fromFoldLeft[A, B](b: B)(f: (B, A) ⇒ B): FoldId[A, B] { type S = B }

returns
a fold from arguments of a fold left

Definition Classes
FoldCreation
def fromMonoid[A](implicit arg0: Monoid[A]): FoldId[A, A] { type S = A }

returns
a fold which uses a Monoid to accumulate elements

Definition Classes
FoldCreation
def fromMonoidMap[A, O](f: (A) ⇒ O)(implicit arg0: Monoid[O]): FoldId[A, O] { type S = O }

returns
a fold which uses a Monoid to accumulate elements

Definition Classes
FoldCreation
def fromMonoidMapM[M[_], A, O](f: (A) ⇒ M[O])(implicit arg0: Monad[M], arg1: Monoid[O]): Fold[M, A, O] { ... /* 2 definitions in type refinement */ }

returns
a fold which uses a Monoid to accumulate elements effectfully

Definition Classes
FoldCreation
def fromSink[M[_], A](action: (A) ⇒ M[Unit])(implicit m: Monad[M]): Fold[M, A, Unit]

returns
a fold sinking all the values to a unit action

Definition Classes
FoldCreation
def fromStart[M[_], A, S1](action: M[S1])(implicit m: Monad[M]): Fold[M, A, S1] { ... /* 2 definitions in type refinement */ }

returns
a fold with just a start action

Definition Classes
FoldCreation
def fromStateEval[A, B, C](state: (A) ⇒ State[B, C])(init: B): Fold[[A]A, A, Option[C]] { ... /* 2 definitions in type refinement */ }

returns
a fold for the evaluation of a State object

Definition Classes
FoldCreation
def fromStateExec[A, B, C](state: (A) ⇒ State[B, C])(init: B): Fold[[A]A, A, B] { ... /* 2 definitions in type refinement */ }

returns
a fold for the execution of a State object

Definition Classes
FoldCreation
def fromStateRun[A, B, C](state: (A) ⇒ State[B, C])(init: B): FoldId[A, (B, Option[C])] { ... /* 3 definitions in type refinement */ }

returns
a fold from running a State object

Definition Classes
FoldCreation
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
val unitMonoid: Monoid[Unit]

Definition Classes
FoldImplicits
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package origami

object fold extends FoldCreation with FoldImplicits

Type Members

implicit class doubleFold[M[_], A] extends AnyRef

implicit class fractionalFold[M[_], A, B] extends AnyRef

implicit class numericFold[M[_], A, B, S1] extends AnyRef

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

implicit def ApplyFold[M[_], T](implicit arg0: Monad[M]): Apply[[γ$0$]Fold[M, T, γ$0$]]

def CoflatMapFold[M[_], T](implicit m: Monad[M]): CoflatMap[[γ$10$]Fold[M, T, γ$10$]]

implicit def ComposeFold[M[_]](implicit arg0: Monad[M]): Compose[[β$6$, γ$7$]Fold[M, β$6$, γ$7$]]

implicit def IdMonadNat[M[_]](implicit m: Monad[M]): ~>[Id, M]

implicit def MonoidFold[M[_], A, B](implicit m: Monad[M], monoid: Monoid[B]): Monoid[Fold[M, A, B]]

implicit def MonoidSink[M[_], A](implicit m: Monad[M]): Monoid[Fold[M, A, Unit]]

implicit def ProfunctorFold[M[_]](implicit arg0: Monad[M]): Profunctor[[β$2$, γ$3$]Fold[M, β$2$, γ$3$]]

final def asInstanceOf[T0]: T0

def bracket[M[_], A, C](open: M[C])(step: (C, A) ⇒ M[C])(close: (C) ⇒ M[Unit])(implicit m: MonadError[M, Throwable]): Fold[M, A, Unit]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fromFoldLeft[A, B](b: B)(f: (B, A) ⇒ B): FoldId[A, B] { type S = B }

def fromMonoid[A](implicit arg0: Monoid[A]): FoldId[A, A] { type S = A }

def fromMonoidMap[A, O](f: (A) ⇒ O)(implicit arg0: Monoid[O]): FoldId[A, O] { type S = O }

def fromMonoidMapM[M[_], A, O](f: (A) ⇒ M[O])(implicit arg0: Monad[M], arg1: Monoid[O]): Fold[M, A, O] { ... /* 2 definitions in type refinement */ }

def fromSink[M[_], A](action: (A) ⇒ M[Unit])(implicit m: Monad[M]): Fold[M, A, Unit]

def fromStart[M[_], A, S1](action: M[S1])(implicit m: Monad[M]): Fold[M, A, S1] { ... /* 2 definitions in type refinement */ }

def fromStateEval[A, B, C](state: (A) ⇒ State[B, C])(init: B): Fold[[A]A, A, Option[C]] { ... /* 2 definitions in type refinement */ }

def fromStateExec[A, B, C](state: (A) ⇒ State[B, C])(init: B): Fold[[A]A, A, B] { ... /* 2 definitions in type refinement */ }

def fromStateRun[A, B, C](state: (A) ⇒ State[B, C])(init: B): FoldId[A, (B, Option[C])] { ... /* 3 definitions in type refinement */ }

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

val unitMonoid: Monoid[Unit]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from FoldImplicits

Inherited from FoldCreation

Inherited from AnyRef

Inherited from Any

Ungrouped