trait
Fold[R, A, B] extends AnyRef
Type Members
-
abstract
type
S
Abstract Value Members
-
abstract
def
end(s: S): Eff[R, B]
-
abstract
def
fold: (S, A) ⇒ S
-
abstract
def
start: Eff[R, S]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
&&&[C](f: Fold[R, A, C]): Fold[R, A, (B, C)] { type S = (Fold.this.S, f.S) }
-
def
***[V, W](f: Fold[R, V, W]): Fold[R, (A, V), (B, W)] { type S = (Fold.this.S, f.S) }
-
def
*>[C](f: Fold[R, A, C]): Fold[R, A, C]
-
def
<*[C](f: Fold[R, A, C]): Fold[R, A, B] { type S = (Fold.this.S, f.S) }
-
def
<*>[C](f: Fold[R, A, C]): Fold[R, A, (B, C)] { type S = (Fold.this.S, f.S) }
-
def
<+*(sink: Sink[R, S]): Fold[R, A, B] { type S = (Fold.this.S, sink.S) }
-
def
<-*(sink: Sink[R, S]): Fold[R, A, B] { type S = (Fold.this.S, sink.S) }
-
def
<<+*(sink: Sink[R, (A, S)]): Fold[R, A, B] { type S = (Fold.this.S, sink.S) }
-
def
<<-*(sink: Sink[R, (A, S)]): Fold[R, A, B] { type S = (Fold.this.S, sink.S) }
-
final
def
==(arg0: Any): Boolean
-
def
as[C](c: ⇒ C): Fold[R, A, C] { type S = Fold.this.S }
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
compose[C](f2: Fold[R, B, C]): Fold[R, A, C] { type S = org.atnos.eff.Eff[R,(Fold.this.S, f2.S)] }
-
def
contramap[C](f: (C) ⇒ A): Fold[R, C, B] { type S = Fold.this.S }
-
def
endWith(action: Eff[R, Unit]): Fold[R, A, B]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
into[U](implicit intoPoly: IntoPoly[R, U]): Fold[U, A, B] { type S = Fold.this.S }
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[C](f: (B) ⇒ C): Fold[R, A, C] { type S = Fold.this.S }
-
def
mapFlatten[C](f: (B) ⇒ Eff[R, C]): Fold[R, A, C] { type S = Fold.this.S }
-
-
def
nest[F[_], C](f: (C) ⇒ F[A])(implicit monoid: Monoid[B], foldable: Foldable[F]): Fold[R, C, B] { type S = org.atnos.eff.Eff[R,B] }
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
observe[C](f: Fold[R, A, C]): Fold[R, A, B] { type S = (Fold.this.S, f.S) }
-
def
observeNextState(sink: Sink[R, S]): Fold[R, A, B] { type S = (Fold.this.S, sink.S) }
-
def
observeState(sink: Sink[R, S]): Fold[R, A, B] { type S = (Fold.this.S, sink.S) }
-
def
observeWithNextState(sink: Sink[R, (A, S)]): Fold[R, A, B] { type S = (Fold.this.S, sink.S) }
-
def
observeWithState(sink: Sink[R, (A, S)]): Fold[R, A, B] { type S = (Fold.this.S, sink.S) }
-
def
observedBy[C](f: Fold[R, A, C]): Fold[R, A, C]
-
def
pipe[C](f: Fold[R, B, C]): Fold[R, A, C] { type S = Fold.this.S }
-
def
run[F[_]](foldable: F[A])(implicit arg0: Foldable[F]): Eff[R, B]
-
def
run1(a: A): Eff[R, B]
-
def
startWith(action: Eff[R, Unit]): Fold[R, A, B]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
void: Fold[R, A, Unit] { type S = Fold.this.S }
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zip[C](f: Fold[R, A, C]): Fold[R, A, (B, C)] { type S = (Fold.this.S, f.S) }
A Fold is a "left fold" over a data structure with:
Both 'start' and 'end' have an effect which allows the whole folding to take place inside a context.