MonoidCatamorph

Instance Constructors

new MonoidCatamorph(get: (S) ⇒ T, zero: T, op: (T, T) ⇒ T)

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
def +(other: String): String

Implicit information
This member is added by an implicit conversion from MonoidCatamorph[T, S] to any2stringadd[MonoidCatamorph[T, S]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def +=(v: S): Boolean

Definition Classes
MonoidCatamorph → RCatamorph
def -=(v: S): Boolean

Definition Classes
MonoidCatamorph → RCatamorph
def ->[B](y: B): (MonoidCatamorph[T, S], B)

Implicit information
This member is added by an implicit conversion from MonoidCatamorph[T, S] to ArrowAssoc[MonoidCatamorph[T, S]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def acquireModify(): Unit

Attributes
protected
Definition Classes
Modifiable
def andThen(action: ⇒ Unit): Subscription

Definition Classes
Subscription
final def asInstanceOf[T0]: T0

Definition Classes
Any
def chain(other: Subscription): Subscription

Definition Classes
Subscription
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[S <: AnyRef](pf: PartialFunction[S, S])(implicit e: <:<[S, AnyRef]): RContainer[S]

Incrementally collects and transforms elements on which the function is defined.
Incrementally collects and transforms elements on which the function is defined.
The partial function must be an injection.

Definition Classes
RContainer
def container: MonoidCatamorph[T, S]
def count(p: (S) ⇒ Boolean): Events[Int]

Stream with the current number of elements satisfying a predicate.
Stream with the current number of elements satisfying a predicate.

Definition Classes
RContainer
def ensuring(cond: (MonoidCatamorph[T, S]) ⇒ Boolean, msg: ⇒ Any): MonoidCatamorph[T, S]

Implicit information
This member is added by an implicit conversion from MonoidCatamorph[T, S] to Ensuring[MonoidCatamorph[T, S]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (MonoidCatamorph[T, S]) ⇒ Boolean): MonoidCatamorph[T, S]

Implicit information
This member is added by an implicit conversion from MonoidCatamorph[T, S] to Ensuring[MonoidCatamorph[T, S]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): MonoidCatamorph[T, S]

Implicit information
This member is added by an implicit conversion from MonoidCatamorph[T, S] to Ensuring[MonoidCatamorph[T, S]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): MonoidCatamorph[T, S]

Implicit information
This member is added by an implicit conversion from MonoidCatamorph[T, S] to Ensuring[MonoidCatamorph[T, S]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def exists(p: (S) ⇒ Boolean): Events[Boolean]

Stream with boolean values indicating if some element satisfied a predicate.
Stream with boolean values indicating if some element satisfied a predicate.

Definition Classes
RContainer
def filter(p: (S) ⇒ Boolean): RContainer[S]

Incrementally filters elements from the current container.
Incrementally filters elements from the current container.

Definition Classes
RContainer
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def forall(p: (S) ⇒ Boolean): Events[Boolean]

Stream with boolean values indicating if all elements satisfy a predicate.
Stream with boolean values indicating if all elements satisfy a predicate.

Definition Classes
RContainer
def foreach(f: (S) ⇒ Unit): Unit

Traverses the elements of the container.
Traverses the elements of the container.

Definition Classes
MonoidCatamorph → RContainer
def formatted(fmtstr: String): String

Implicit information
This member is added by an implicit conversion from MonoidCatamorph[T, S] to StringFormat[MonoidCatamorph[T, S]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
val get: (S) ⇒ T
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def init(mc: MonoidCatamorph[T, S]): Unit
def inserts: Events[S]

Event stream with inserted elements.
Event stream with inserted elements.

Definition Classes
MonoidCatamorph → RContainer
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def map[S](f: (S) ⇒ S): RContainer[S]

Incrementally maps elements from the current container.
Incrementally maps elements from the current container.
Function f for the map must be an injection, that is, for any two elements x and y that are not equal (x != y), f(x) **cannot be equal to** f(y).

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

Definition Classes
AnyRef
def newLeaf(v: S, f: (S) ⇒ T): Leaf[T]

Attributes
protected
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val op: (T, T) ⇒ T
def push(v: S): Boolean

Definition Classes
MonoidCatamorph → RCatamorph
def reduce[S](z: S)(op: (S, S) ⇒ S)(inv: (S, S) ⇒ S): Events[S]

Stream with the reduction of the current set of elements in this container.
Stream with the reduction of the current set of elements in this container.
Parameters op, inv and z must for an Abelian group, that is, z is the neutral element, and inv is the inverse operation of op, in the sense that inv(op(s, t), t) == op(inv(s, t), t) == s is always true.

Definition Classes
RContainer
def releaseModify(): Unit

Attributes
protected
Definition Classes
Modifiable
def removes: Events[S]

Event stream with removed elements.
Event stream with removed elements.

Definition Classes
MonoidCatamorph → RContainer
def signal: Signal[T]

Definition Classes
MonoidCatamorph → RCatamorph
def size: Int

Returns the number of elements in the container.
Returns the number of elements in the container.

Definition Classes
MonoidCatamorph → RContainer
def sizes(implicit s: Spec[S]): Events[Int]

Stream with the sizes of this container.
Stream with the sizes of this container.

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

Definition Classes
AnyRef
def to[That](implicit factory: Factory[S, That]): That

Incrementally copies this container to another container type.
Incrementally copies this container to another container type.
Materializes another container, such that all the elements from this container are visible in the target container.
Users may call unsubscribe on the resulting container to stop incremental updates. Losing the container and failing to call unsubscribe may result in a time leak.

Definition Classes
RContainer
def toAggregate(z: S)(op: (S, S) ⇒ S): Signal[S]

Creates a signal that is the fold of the elements in the container.
Creates a signal that is the fold of the elements in the container.
Neutral element z and the associative operator op must form a monoid.

Definition Classes
RContainer
def toCommuteAggregate(z: S)(op: (S, S) ⇒ S): Signal[S]

Creates a signal that is the commutative fold of the elements in the container.
Creates a signal that is the commutative fold of the elements in the container.
Neutral element z and the commutative, associative operator op must for a monoid.

Definition Classes
RContainer
def toSignalAggregate[S](z: S)(op: (S, S) ⇒ S)(implicit e: <:<[S, Signal[S]]): Signal[S]

Converts this container of signals into a signal aggregate.
Converts this container of signals into a signal aggregate.

Definition Classes
RContainer
def toString(): String

Definition Classes
AnyRef → Any
def union(that: RContainer[S])(implicit a: Arrayable[S], h: Hash[S]): RContainer[S]

Incrementally produces a union of the elements in the two containers.
Incrementally produces a union of the elements in the two containers.
This container combinator creates a subscription on the source combinators, so calling unsubscribe will stop incremental updates.

Definition Classes
RContainer
def unsubscribe(): Unit

Unsubscribes the container from its input event streams.
Unsubscribes the container from its input event streams.

Definition Classes
MonoidCatamorph → RContainer → Subscription
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( ... )
val zero: T
def →[B](y: B): (MonoidCatamorph[T, S], B)

Implicit information
This member is added by an implicit conversion from MonoidCatamorph[T, S] to ArrowAssoc[MonoidCatamorph[T, S]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Inherited from Modifiable

Inherited from RCatamorph[T, S]

Inherited from RContainer[S]

Inherited from Subscription

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from MonoidCatamorph[T, S] to any2stringadd[MonoidCatamorph[T, S]]

Inherited by implicit conversion StringFormat from MonoidCatamorph[T, S] to StringFormat[MonoidCatamorph[T, S]]

Inherited by implicit conversion Ensuring from MonoidCatamorph[T, S] to Ensuring[MonoidCatamorph[T, S]]

Inherited by implicit conversion ArrowAssoc from MonoidCatamorph[T, S] to ArrowAssoc[MonoidCatamorph[T, S]]

Ungrouped

Related Docs: object MonoidCatamorph | package container

class MonoidCatamorph[T, S] extends RCatamorph[T, S] with Modifiable

Instance Constructors

new MonoidCatamorph(get: (S) ⇒ T, zero: T, op: (T, T) ⇒ T)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def +=(v: S): Boolean

def -=(v: S): Boolean

def ->[B](y: B): (MonoidCatamorph[T, S], B)

final def ==(arg0: Any): Boolean

def acquireModify(): Unit

def andThen(action: ⇒ Unit): Subscription

final def asInstanceOf[T0]: T0

def chain(other: Subscription): Subscription

def clone(): AnyRef

def collect[S <: AnyRef](pf: PartialFunction[S, S])(implicit e: <:<[S, AnyRef]): RContainer[S]

def container: MonoidCatamorph[T, S]

def count(p: (S) ⇒ Boolean): Events[Int]

def ensuring(cond: (MonoidCatamorph[T, S]) ⇒ Boolean, msg: ⇒ Any): MonoidCatamorph[T, S]

def ensuring(cond: (MonoidCatamorph[T, S]) ⇒ Boolean): MonoidCatamorph[T, S]

def ensuring(cond: Boolean, msg: ⇒ Any): MonoidCatamorph[T, S]

def ensuring(cond: Boolean): MonoidCatamorph[T, S]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (S) ⇒ Boolean): Events[Boolean]

def filter(p: (S) ⇒ Boolean): RContainer[S]

def finalize(): Unit

def forall(p: (S) ⇒ Boolean): Events[Boolean]

def foreach(f: (S) ⇒ Unit): Unit

def formatted(fmtstr: String): String

val get: (S) ⇒ T

final def getClass(): Class[_]

def hashCode(): Int

def init(mc: MonoidCatamorph[T, S]): Unit

def inserts: Events[S]

final def isInstanceOf[T0]: Boolean

def map[S](f: (S) ⇒ S): RContainer[S]

final def ne(arg0: AnyRef): Boolean

def newLeaf(v: S, f: (S) ⇒ T): Leaf[T]

final def notify(): Unit

final def notifyAll(): Unit

val op: (T, T) ⇒ T

def push(v: S): Boolean

def reduce[S](z: S)(op: (S, S) ⇒ S)(inv: (S, S) ⇒ S): Events[S]

def releaseModify(): Unit

def removes: Events[S]

def signal: Signal[T]

def size: Int

def sizes(implicit s: Spec[S]): Events[Int]

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

def to[That](implicit factory: Factory[S, That]): That

def toAggregate(z: S)(op: (S, S) ⇒ S): Signal[S]

def toCommuteAggregate(z: S)(op: (S, S) ⇒ S): Signal[S]

def toSignalAggregate[S](z: S)(op: (S, S) ⇒ S)(implicit e: <:<[S, Signal[S]]): Signal[S]

def toString(): String

def union(that: RContainer[S])(implicit a: Arrayable[S], h: Hash[S]): RContainer[S]

def unsubscribe(): Unit

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val zero: T

def →[B](y: B): (MonoidCatamorph[T, S], B)

Inherited from Modifiable

Inherited from RCatamorph[T, S]

Inherited from RContainer[S]

Inherited from Subscription

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from MonoidCatamorph[T, S] to any2stringadd[MonoidCatamorph[T, S]]

Inherited by implicit conversion StringFormat from MonoidCatamorph[T, S] to StringFormat[MonoidCatamorph[T, S]]

Inherited by implicit conversion Ensuring from MonoidCatamorph[T, S] to Ensuring[MonoidCatamorph[T, S]]

Inherited by implicit conversion ArrowAssoc from MonoidCatamorph[T, S] to ArrowAssoc[MonoidCatamorph[T, S]]

Ungrouped