ReadBufSet

abstract val changes: ReadChannel[Delta[T]]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def all(value: T): ReadChannel[Boolean]

All elements are equal to value

def any(value: T): ReadChannel[Boolean]

At least one element is equal to value

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contains(value: T): ReadChannel[Boolean]

Stream contains at least one occurrence of value.

def contains$(value: T): Boolean

def count(value: T): ReadChannel[Int]

Count number of occurrence of value.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(f: (T) ⇒ Boolean): ReadChannel[Boolean]

Checks for existence of a value for which f is true

def filter(f: (T) ⇒ Boolean): DeltaBufSet[T]

Only include elements for which f is true

def filterNot(f: (T) ⇒ Boolean): DeltaBufSet[T]

def finalize(): Unit

def forall(f: (T) ⇒ Boolean): ReadChannel[Boolean]

Checks whether f is true for all elements

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty: ReadChannel[Boolean]

def isEmpty$: Boolean

final def isInstanceOf[T0]: Boolean

def map[C](f: (T) ⇒ C): DeltaBufSet[C]

Applies f on each element

final def ne(arg0: AnyRef): Boolean

def nonEmpty: ReadChannel[Boolean]

Negation of isEmpty

def nonEmpty$: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def partition(f: (T) ⇒ Boolean): (DeltaBufSet[T], DeltaBufSet[T])

Partitions stream into two sub-stream

def size: ReadChannel[Int]

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

def toSeq: ReadChannel[Seq[T]]

def toSet$: Set[T]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit