IncSeq

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++(that: (IncrementalBundle.this)#ReactiveDeltaSeq[T])(implicit ticket: (IncrementalBundle.this)#CreationTicket): (IncrementalBundle.this)#ReactiveDeltaSeq[T]

Concatenates the ReactiveDeltaSeq with another (that) ReactiveDeltaSeq by returning a new ReactiveDeltaSeq (ConcatenateDeltaSeq)

final def ==(arg0: Any): Boolean

def add(value: T)(implicit fac: (IncrementalBundle.this)#Scheduler): Unit

def addInTx(delta: Delta[T])(implicit ticket: (IncrementalBundle.this)#AdmissionTicket): Unit

def asEvent(implicit ticket: (IncrementalBundle.this)#CreationTicket): (IncrementalBundle.this)#Event[Delta[T]]

Returns current ReactiveDeltaSeq as an Event

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def commit(base: Delta[T]): Delta[T]

def contains(element: T)(implicit ticket: (IncrementalBundle.this)#CreationTicket, ord: Ordering[T]): (IncrementalBundle.this)#Signal[Boolean]

To check if an element is in the sequence

def count(fulfillsCondition: (T) ⇒ Boolean)(implicit ticket: (IncrementalBundle.this)#CreationTicket): (IncrementalBundle.this)#Signal[Int]

Counts number of elements fulfilling the condition provided

final def disconnect(): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(fulfillsCondition: (T) ⇒ Boolean)(implicit ticket: (IncrementalBundle.this)#CreationTicket): (IncrementalBundle.this)#Signal[Boolean]

To check if elements fulfilling the condition exists

def filter(filterOperation: (T) ⇒ Boolean)(implicit ticket: (IncrementalBundle.this)#CreationTicket): (IncrementalBundle.this)#ReactiveDeltaSeq[T]

Filters the sequence , basing on filterExpression and returns the new filtered sequence

def foldUndo[A](initial: A)(fold: (A, Delta[T]) ⇒ A)(unfold: (A, Delta[T]) ⇒ A)(implicit ticket: (IncrementalBundle.this)#CreationTicket): (IncrementalBundle.this)#Signal[A]

Based on the concept of reversible Folds Used to fold the deltas basing on fold for Addition-Delta and unfold for Removal-Delta

final def getClass(): Class[_]

def guardedReevaluate(input: ReIn): Rout

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[A](mapOperation: (T) ⇒ A)(implicit ticket: (IncrementalBundle.this)#CreationTicket): (IncrementalBundle.this)#ReactiveDeltaSeq[A]

Maps the elements of ReactiveDeltaSeq and returns a new ReactiveDeltaSeq with the mapped deltas with the old ReactiveDeltaSeq as dependency

def max(implicit ticket: (IncrementalBundle.this)#CreationTicket, ord: Ordering[T]): (IncrementalBundle.this)#Signal[Option[T]]

def min(implicit ticket: (IncrementalBundle.this)#CreationTicket, ord: Ordering[T]): (IncrementalBundle.this)#Signal[Option[T]]

val name: ReName

the name of the reactive, useful for debugging as it often contains positional information

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def printMap(): Unit

final def reevaluate(rein: ReIn): Rout

called if any of the dependencies (rescala.core.Core.ReSources) changed in the current update turn, after all (known) dependencies are updated

def remove(value: T)(implicit fac: (IncrementalBundle.this)#Scheduler): Unit

def size(implicit ticket: (IncrementalBundle.this)#CreationTicket): (IncrementalBundle.this)#Signal[Int]

Returns the sizeOfSeq of the ReactiveDeltaSeq

val state: (IncrementalBundle.this)#State[Delta[T]]

the initial state passed by the scheduler

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit