ReadDict

abstract val changes: ReadChannel[Delta[A, B]]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

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

All elements are equal to value

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

At least one element is equal to value

def apply(key: A): B

final def asInstanceOf[T0]: T0

def buffer: Dict[A, B]

def clone(): AnyRef

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

Count number of occurrence of value.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

Checks for existence of a value for which f is true

def exists$(f: ((A, B)) ⇒ Boolean): Boolean

Row exists where f returns true

def filter(f: (B) ⇒ Boolean): DeltaDict[A, B]

Only include elements for which f is true

def filter$(f: ((A, B)) ⇒ Boolean): ReadDict[A, B]

Only include elements for which f is true

def filterNot(f: (B) ⇒ Boolean): DeltaDict[A, B]

def finalize(): Unit

def find$(f: ((A, B)) ⇒ Boolean): Option[(A, B)]

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

Checks whether f is true for all elements

def forall$(f: ((A, B)) ⇒ Boolean): Boolean

For all rows f returns true

def foreach(f: ((A, B)) ⇒ Unit): Unit

def get(key: A): Option[B]

Value associated to key

def get: Map[A, B]

final def getClass(): Class[_]

def has(value: B): ReadChannel[Boolean]

Stream contains at least one occurrence of value.

def hashCode(): Int

def isDefinedAt$(key: A): Boolean

Returns true if key is defined

def isEmpty: ReadChannel[Boolean]

def isEmpty$: Boolean

final def isInstanceOf[T0]: Boolean

def keys: DeltaBufSet[A]

Returns key set

def keys$: Set[A]

Returns key set

def map[C](f: (A, B) ⇒ C): DeltaDict[A, C]

Applies f on each value

def mapKeys[C](f: (A) ⇒ C): DeltaDict[C, B]

Applies f on each key

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: (B) ⇒ Boolean): (DeltaDict[A, B], DeltaDict[A, B])

Partitions stream into two sub-stream

def size: ReadChannel[Int]

def sortBy[C](f: (A, B) ⇒ C)(implicit ordering: Ordering[C]): ReadBuffer[(A, B)]

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

def toBuffer: ReadBuffer[(A, B)]

Convert dictionary to buffer

def toString(): String

def value(key: A): ReadPartialChannel[B]

Observes key and encapsulate its value states in a partial channel

def value$(key: A): B

Value associated to key

def values$: Iterable[B]

Returns all values

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def toMap: Map[A, B]

Converts dictionary to map *