Class/Object

pl.metastack.metarx

Dict

Related Docs: object Dict | package metarx

Permalink

class Dict[A, B] extends ReadDict[A, B] with WriteDict[A, B] with StateDict[A, B]

Linear Supertypes
StateDict[A, B], Disposable, WriteDict[A, B], reactive.mutate.Dict[A, B], ReadDict[A, B], DeltaDict[A, B], MapDict[DeltaDict, A, B], Filter[[x]DeltaDict[x, B], A, B], Size, PollDict[A, B], Key[A, B], FilterMap[ReadDict, A, B], Empty, Key[A, B], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Dict
  2. StateDict
  3. Disposable
  4. WriteDict
  5. Dict
  6. ReadDict
  7. DeltaDict
  8. MapDict
  9. Filter
  10. Size
  11. PollDict
  12. Key
  13. FilterMap
  14. Empty
  15. Key
  16. AnyRef
  17. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Dict()

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++=(map: Map[A, B]): Unit

    Permalink

    Definition Classes
    Dict
    See also

    insertAll

  4. def +=(kv: (A, B)): Unit

    Permalink

    Definition Classes
    Dict
    See also

    insert

  5. def +=(key: A, value: B): Unit

    Permalink

    Definition Classes
    Dict
    See also

    insert

  6. def --=(keys: Seq[A]): Unit

    Permalink

    Definition Classes
    Dict
    See also

    removeAll

  7. def -=(key: A): Unit

    Permalink

    Definition Classes
    Dict
    See also

    remove

  8. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def all(value: B): ReadChannel[Boolean]

    Permalink

    All elements are equal to value

    All elements are equal to value

    Definition Classes
    Filter
    See also

    any

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

    Permalink

    At least one element is equal to value

    At least one element is equal to value

    Definition Classes
    Filter
    See also

    all

  11. def apply(key: A): B

    Permalink

    Definition Classes
    Key
    See also

    value$

  12. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  13. def buffer: Dict[A, B]

    Permalink
    Definition Classes
    DeltaDict
  14. val changes: RootChannel[Delta[A, B]]

    Permalink
    Definition Classes
    StateDict
  15. def clear(): Unit

    Permalink

    Removes all elements

    Removes all elements

    Definition Classes
    WriteDictDict
  16. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. def count(value: B): ReadChannel[Int]

    Permalink

    Count number of occurrence of value.

    Count number of occurrence of value.

    Definition Classes
    Filter
    Note

    Channels: With every matching element, the counter is increased.

    ,

    Buffers: When the element is removed, the counter is decreased.

  18. def dispose(): Unit

    Permalink
    Definition Classes
    StateDictDisposable
  19. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  20. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  21. def exists(f: (B) ⇒ Boolean): ReadChannel[Boolean]

    Permalink

    Checks for existence of a value for which f is true

    Checks for existence of a value for which f is true

    Definition Classes
    Filter
    Note

    Channels: false as long as f returns false, then true

    ,

    Buffers: false as long as no row exists where f is true, then true

    See also

    forall

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

    Permalink

    Row exists where f returns true

    Row exists where f returns true

    Definition Classes
    PollDictKey
  23. def filter(f: (B) ⇒ Boolean): DeltaDict[A, B]

    Permalink

    Only include elements for which f is true

    Only include elements for which f is true

    Definition Classes
    DeltaDictFilter
  24. def filter$(f: ((A, B)) ⇒ Boolean): ReadDict[A, B]

    Permalink

    Only include elements for which f is true

    Only include elements for which f is true

    Definition Classes
    PollDictFilterMap
  25. def filterNot(f: (B) ⇒ Boolean): DeltaDict[A, B]

    Permalink
    Definition Classes
    Filter
  26. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  27. def find$(f: ((A, B)) ⇒ Boolean): Option[(A, B)]

    Permalink

    returns

    Row for which f returns true

    Definition Classes
    PollDictKey
  28. def forall(f: (B) ⇒ Boolean): ReadChannel[Boolean]

    Permalink

    Checks whether f is true for all elements

    Checks whether f is true for all elements

    Definition Classes
    Filter
    See also

    exists

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

    Permalink

    For all rows f returns true

    For all rows f returns true

    Definition Classes
    PollDictKey
  30. def foreach(f: ((A, B)) ⇒ Unit): Unit

    Permalink
    Definition Classes
    PollDict
  31. def get(key: A): Option[B]

    Permalink

    Value associated to key

    Value associated to key

    Definition Classes
    PollDictKey
  32. def get: Map[A, B]

    Permalink
    Definition Classes
    PollDict
  33. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  34. def has(value: B): ReadChannel[Boolean]

    Permalink

    Stream contains at least one occurrence of value.

    Stream contains at least one occurrence of value.

    Definition Classes
    Filter
    Note

    Channels: Once true, will never produce any other value.

    ,

    Buffers: When the item is removed, it will produce false.

  35. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  36. def insert(key: A, value: B): Unit

    Permalink

    Inserts a new key-value tuple.

    Inserts a new key-value tuple. If key already exists, update must be used instead.

    Definition Classes
    WriteDictDict
  37. def insertAll(map: Map[A, B]): Unit

    Permalink

    Insert all elements from map

    Insert all elements from map

    Definition Classes
    WriteDictDict
  38. def insertOrUpdate(key: A, value: B): Unit

    Permalink
  39. def isDefinedAt$(key: A): Boolean

    Permalink

    Returns true if key is defined

    Returns true if key is defined

    Definition Classes
    PollDictKey
  40. def isEmpty: ReadChannel[Boolean]

    Permalink

    Definition Classes
    Size
    Note

    Partial channels: Produce true if the current value is cleared.

    ,

    Channels: Produce false with the first received value.

    ,

    Buffers: Produce a new value once a row is added or removed.

  41. def isEmpty$: Boolean

    Permalink
    Definition Classes
    PollDictEmpty
  42. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  43. def keys: DeltaBufSet[A]

    Permalink

    Returns key set

    Returns key set

    Definition Classes
    DeltaDictKey
  44. def keys$: Set[A]

    Permalink

    Returns key set

    Returns key set

    Definition Classes
    PollDictKey
  45. def map[C](f: (A, B) ⇒ C): DeltaDict[A, C]

    Permalink

    Applies f on each value

    Applies f on each value

    Definition Classes
    DeltaDictMapDict
  46. def mapKeys[C](f: (A) ⇒ C): DeltaDict[C, B]

    Permalink

    Applies f on each key

    Applies f on each key

    Definition Classes
    DeltaDictMapDict
  47. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  48. def nonEmpty: ReadChannel[Boolean]

    Permalink

    Negation of isEmpty

    Negation of isEmpty

    Definition Classes
    Size
  49. def nonEmpty$: Boolean

    Permalink
    Definition Classes
    PollDictEmpty
  50. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  51. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  52. def partition(f: (B) ⇒ Boolean): (DeltaDict[A, B], DeltaDict[A, B])

    Permalink

    Partitions stream into two sub-stream

    Partitions stream into two sub-stream

    The left stream contains all elements for which f is true, all other elements go to the right stream.

    Definition Classes
    Filter
  53. def remove(key: A): Unit

    Permalink

    Removes key

    Removes key

    Definition Classes
    WriteDictDict
  54. def removeAll(keys: Seq[A]): Unit

    Permalink

    Remove all keys from keys

    Remove all keys from keys

    Definition Classes
    WriteDictDict
  55. def removeIfExists(key: A): Unit

    Permalink
  56. def set(map: Map[A, B]): Unit

    Permalink

    Replace current dictionary with elements from map

    Replace current dictionary with elements from map

    Definition Classes
    WriteDictDict
  57. def size: ReadChannel[Int]

    Permalink

    Definition Classes
    DeltaDictSize
    Note

    State channels: Produce when a new child is attached and if the size changes. In Opt the size is reset if the value is cleared.

    ,

    Channels: The size is only produced in response to each received value on the channel.

    ,

    Buffers: Produce the row count once a row is added or removed.

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

    Permalink
    Definition Classes
    PollDict
  59. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  60. def toBuffer: ReadBuffer[(A, B)]

    Permalink

    Convert dictionary to buffer

    Convert dictionary to buffer

    Definition Classes
    PollDictKey
  61. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  62. def update(key: A, value: B): Unit

    Permalink

    Sets the value of key to value

    Sets the value of key to value

    Definition Classes
    WriteDictDict
  63. def value(key: A): ReadPartialChannel[B]

    Permalink

    Observes key and encapsulate its value states in a partial channel

    Observes key and encapsulate its value states in a partial channel

    Definition Classes
    DeltaDictKey
  64. def value$(key: A): B

    Permalink

    Value associated to key

    Value associated to key

    Definition Classes
    PollDictKey
  65. def values$: Iterable[B]

    Permalink

    Returns all values

    Returns all values

    Definition Classes
    PollDictKey
  66. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  67. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  68. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def toMap: Map[A, B]

    Permalink

    Converts dictionary to map *

    Converts dictionary to map *

    Definition Classes
    PollDictKey
    Annotations
    @deprecated
    Deprecated

    (Since version v0.1.5) Use get

Inherited from StateDict[A, B]

Inherited from Disposable

Inherited from WriteDict[A, B]

Inherited from reactive.mutate.Dict[A, B]

Inherited from ReadDict[A, B]

Inherited from DeltaDict[A, B]

Inherited from MapDict[DeltaDict, A, B]

Inherited from Filter[[x]DeltaDict[x, B], A, B]

Inherited from Size

Inherited from PollDict[A, B]

Inherited from Key[A, B]

Inherited from FilterMap[ReadDict, A, B]

Inherited from Empty

Inherited from Key[A, B]

Inherited from AnyRef

Inherited from Any

Ungrouped