Class

pl.metastack.metarx

RefBuf

Related Doc: package metarx

Permalink

case class RefBuf[T]() extends Buffer[Ref[T]] with Product with Serializable

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RefBuf
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Buffer
  7. StateBuffer
  8. Disposable
  9. WriteBuffer
  10. Buffer
  11. ReadBuffer
  12. PollBuffer
  13. Concatenate
  14. AbsoluteOrder
  15. MapExtended
  16. FilterOrdered
  17. Aggregate
  18. RelativeOrder
  19. Filter
  20. Find
  21. Filter
  22. Iterate
  23. RelativeOrder
  24. Index
  25. DeltaBuffer
  26. Map
  27. Size
  28. AnyRef
  29. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RefBuf()

    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 ++(buffer: ReadBuffer[Ref[T]]): ReadBuffer[Ref[T]]

    Permalink
    Definition Classes
    Concatenate
  4. def ++=(buf: Seq[Ref[T]]): Unit

    Permalink

    Definition Classes
    Buffer
    See also

    appendAll

  5. def +=(value: T): Ref[T]

    Permalink
  6. def +=(value: Ref[T]): Unit

    Permalink

    Definition Classes
    Buffer
    See also

    append

  7. def -(other: ReadBufSet[Ref[T]]): ReadBuffer[Ref[T]]

    Permalink
    Definition Classes
    FilterOrdered
  8. def --=(agg: Seq[Ref[T]]): Unit

    Permalink

    Definition Classes
    Buffer
    See also

    removeAll

  9. def -=(value: Ref[T]): Unit

    Permalink

    Definition Classes
    Buffer
    See also

    remove

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

    Permalink
    Definition Classes
    AnyRef → Any
  11. def after(value: Ref[T]): ReadChannel[Ref[T]]

    Permalink

    Definition Classes
    PollBufferRelativeOrder
    Note

    Channels: Value that is produced right after each value

    ,

    Buffers: Current row after value

  12. def after$(value: Ref[T]): Ref[T]

    Permalink

    Row after value

    Row after value

    Definition Classes
    PollBufferRelativeOrder
  13. def afterOption(value: Ref[T]): ReadChannel[Ref[T]]

    Permalink

    Definition Classes
    PollBufferRelativeOrder
    See also

    after

  14. def afterOption$(value: Ref[T]): Option[Ref[T]]

    Permalink

    Row after value with the possibility of non-existence

    Row after value with the possibility of non-existence

    Definition Classes
    PollBufferRelativeOrder
  15. def all(value: Ref[T]): ReadChannel[Boolean]

    Permalink

    All elements are equal to value

    All elements are equal to value

    Definition Classes
    Filter
    See also

    any

  16. def any(value: Ref[T]): 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

  17. def append(element: T): Ref[T]

    Permalink
  18. def append(element: Ref[T]): Unit

    Permalink

    Appends element

    Appends element

    Definition Classes
    WriteBufferBuffer
  19. def appendAll(buf: Seq[Ref[T]]): Unit

    Permalink

    Appends all elements from buf

    Appends all elements from buf

    Definition Classes
    WriteBufferBuffer
  20. def apply(index: Int): Ref[T]

    Permalink

    Definition Classes
    Index
    See also

    value

  21. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  22. def before(value: Ref[T]): ReadChannel[Ref[T]]

    Permalink

    Definition Classes
    PollBufferRelativeOrder
    Note

    Channels: Value that is produced right before each value

    ,

    Buffers: Current row before value

  23. def before$(value: Ref[T]): Ref[T]

    Permalink

    Row before value

    Row before value

    Definition Classes
    PollBufferRelativeOrder
  24. def beforeOption(value: Ref[T]): ReadChannel[Ref[T]]

    Permalink

    Definition Classes
    PollBufferRelativeOrder
    See also

    before

  25. def beforeOption$(value: Ref[T]): Option[Ref[T]]

    Permalink

    Row before value with the possibility of non-existence

    Row before value with the possibility of non-existence

    Definition Classes
    PollBufferRelativeOrder
  26. def buffer: ReadBuffer[Ref[T]]

    Permalink
    Definition Classes
    DeltaBuffer
  27. val changes: RootChannel[Delta[Ref[T]]]

    Permalink
    Definition Classes
    StateBuffer
  28. def clear(): Unit

    Permalink

    Remove all rows

    Remove all rows

    Definition Classes
    WriteBufferBuffer
  29. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. def collect[U](f: PartialFunction[Ref[T], U]): ReadBuffer[U]

    Permalink

    Applies partial function f on each element; if the function is not defined for the current input, it is filtered out

    Applies partial function f on each element; if the function is not defined for the current input, it is filtered out

    Definition Classes
    PollBufferMapExtended
  31. def concat(buf: ReadBuffer[Ref[T]]): ReadBuffer[Ref[T]]

    Permalink
    Definition Classes
    PollBufferConcatenate
  32. def count(value: Ref[T]): 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.

  33. def diff(other: ReadBufSet[Ref[T]]): ReadBuffer[Ref[T]]

    Permalink

    Remove all elements from other

    Remove all elements from other

    Definition Classes
    PollBufferFilterOrdered
  34. def dispose(): Unit

    Permalink
    Definition Classes
    StateBufferDisposable
  35. def distinct: ReadBuffer[Ref[T]]

    Permalink

    Filters out (merges) duplicates

    Filters out (merges) duplicates

    Definition Classes
    PollBufferAggregate
  36. def distinct$: ReadBuffer[Ref[T]]

    Permalink

    Filters out duplicates

    Filters out duplicates

    Definition Classes
    PollBufferFilter
  37. def drop(count: Int): ReadBuffer[Ref[T]]

    Permalink
    Definition Classes
    PollBuffer
  38. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  39. def exists(f: (Ref[T]) ⇒ 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

  40. def exists$(f: (Ref[T]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    PollBuffer
  41. def filter(f: (Ref[T]) ⇒ Boolean): DeltaBuffer[Ref[T]]

    Permalink

    TODO Could this be implemented more efficiently without iterating over elements?

    TODO Could this be implemented more efficiently without iterating over elements?

    Definition Classes
    PollBufferFilter
  42. def filter$(f: (Ref[T]) ⇒ Boolean): ReadBuffer[Ref[T]]

    Permalink

    Only include elements for which f is true

    Only include elements for which f is true

    Definition Classes
    PollBufferFilter
  43. def filterNot(f: (Ref[T]) ⇒ Boolean): DeltaBuffer[Ref[T]]

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  45. def find(f: (Ref[T]) ⇒ Boolean): ReadPartialChannel[Ref[T]]

    Permalink

    Returns first matching row; if it gets deleted, returns next match.

    Returns first matching row; if it gets deleted, returns next match.

    Definition Classes
    PollBufferFind
  46. def find$(f: (Ref[T]) ⇒ Boolean): Option[Ref[T]]

    Permalink

    Finds first value for which f is true

    Finds first value for which f is true

    Definition Classes
    PollBufferFilter
  47. def flatMap[U](f: (Ref[T]) ⇒ ReadBuffer[U]): ReadBuffer[U]

    Permalink

    Applies f on each element and flatten its result into the stream

    Applies f on each element and flatten its result into the stream

    Definition Classes
    PollBufferMapExtended
  48. def flatMapCh[U](f: (Ref[T]) ⇒ ReadPartialChannel[U]): ReadBuffer[U]

    Permalink
    Definition Classes
    PollBuffer
  49. def flatMapSeq[U](f: (Ref[T]) ⇒ Seq[U]): ReadBuffer[U]

    Permalink

    Definition Classes
    PollBufferMapExtended
    See also

    flatMap

  50. def foldLeft[U](acc: U)(f: (U, Ref[T]) ⇒ U): ReadChannel[U]

    Permalink
    Definition Classes
    PollBuffer
  51. def forall(f: (Ref[T]) ⇒ 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

  52. def forall$(f: (Ref[T]) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    PollBuffer
  53. def foreach(f: (Ref[T]) ⇒ Unit): Unit

    Permalink

    Iterates over all row values with the given function f

    Iterates over all row values with the given function f

    Definition Classes
    PollBufferIterate
  54. def get: Seq[Ref[T]]

    Permalink

    All rows as a native type

    All rows as a native type

    Definition Classes
    PollBufferIndex
  55. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  56. def has(value: Ref[T]): 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.

  57. def head: ReadChannel[Ref[T]]

    Permalink

    Wraps first element in a channel

    Wraps first element in a channel

    Produce a value for the first row. If the list is empty, head does not produce any value. When the first row is deleted, the next row will be produced.

    Definition Classes
    PollBufferAbsoluteOrder
  58. def headOption: ReadPartialChannel[Ref[T]]

    Permalink

    First element with the possibility of non-existence

    First element with the possibility of non-existence

    returns

    scala.Some with first row, or scala.None if the list is empty

    Definition Classes
    PollBufferAbsoluteOrder
  59. def indexOf(handle: Ref[T]): Int

    Permalink

    Index of handle

    Index of handle

    Definition Classes
    PollBufferIndex
  60. def insertAfter(reference: Ref[T], element: T): Ref[T]

    Permalink
  61. def insertAfter(reference: Ref[T], element: Ref[T]): Unit

    Permalink

    Inserts element after handle

    Inserts element after handle

    Definition Classes
    WriteBufferBuffer
  62. def insertBefore(reference: Ref[T], element: T): Ref[T]

    Permalink
  63. def insertBefore(reference: Ref[T], element: Ref[T]): Unit

    Permalink

    Inserts element before handle

    Inserts element before handle

    Definition Classes
    WriteBufferBuffer
  64. def insertions: ReadChannel[Ref[T]]

    Permalink
    Definition Classes
    DeltaBuffer
  65. 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.

  66. def isHead(element: Ref[T]): ReadChannel[Boolean]

    Permalink
    Definition Classes
    PollBufferAbsoluteOrder
  67. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  68. def isLast(element: Ref[T]): ReadChannel[Boolean]

    Permalink
    Definition Classes
    PollBufferAbsoluteOrder
  69. def last: ReadChannel[Ref[T]]

    Permalink
    Definition Classes
    PollBufferAbsoluteOrder
  70. def lastOption: ReadPartialChannel[Ref[T]]

    Permalink

    Last element with the possibility of non-existence

    Last element with the possibility of non-existence

    returns

    scala.Some with first row, or scala.None if the list is empty

    Definition Classes
    PollBufferAbsoluteOrder
  71. def map[U](f: (Ref[T]) ⇒ U): DeltaBuffer[U]

    Permalink

    Unlike mapPure, stores mapping locally.

    Unlike mapPure, stores mapping locally. This is currently needed as widget objects are not immutable.

    Definition Classes
    DeltaBufferMap
  72. def mapPure[U](f: (Ref[T]) ⇒ U): DeltaBuffer[U]

    Permalink

    Definition Classes
    DeltaBuffer
    Note

    f must not be side-effecting

  73. def mapTo[U](f: (Ref[T]) ⇒ U): DeltaDict[Ref[T], U]

    Permalink
    Definition Classes
    DeltaBuffer
  74. def mkString(): ReadChannel[String]

    Permalink
    Definition Classes
    PollBuffer
  75. def mkString(sep: String): ReadChannel[String]

    Permalink
    Definition Classes
    PollBuffer
  76. final def ne(arg0: AnyRef): Boolean

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

    Permalink

    Negation of isEmpty

    Negation of isEmpty

    Definition Classes
    Size
  78. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  80. def partition(f: (Ref[T]) ⇒ Boolean): (DeltaBuffer[Ref[T]], DeltaBuffer[Ref[T]])

    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
  81. def partition$(f: (Ref[T]) ⇒ Boolean): (ReadBuffer[Ref[T]], ReadBuffer[Ref[T]])

    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
    PollBufferFilter
  82. def prepend(element: T): Ref[T]

    Permalink
  83. def prepend(element: Ref[T]): Unit

    Permalink

    Prepends element

    Prepends element

    Definition Classes
    WriteBufferBuffer
  84. def reduce[U >: Ref[T]](op: (U, U) ⇒ U): ReadChannel[U]

    Permalink
    Definition Classes
    PollBuffer
  85. def removals: ReadChannel[Ref[T]]

    Permalink
    Definition Classes
    DeltaBuffer
  86. def remove(element: Ref[T]): Unit

    Permalink

    Removes row by its reference handle

    Removes row by its reference handle

    Definition Classes
    WriteBufferBuffer
  87. def removeAll(buf: Seq[Ref[T]]): Unit

    Permalink

    Removes all elements from buf

    Removes all elements from buf

    Definition Classes
    WriteBufferBuffer
  88. def replace(reference: Ref[T], element: T): Ref[T]

    Permalink
  89. def replace(reference: Ref[T], element: Ref[T]): Unit

    Permalink

    Replaces value of reference by element

    Replaces value of reference by element

    Definition Classes
    WriteBufferBuffer
  90. def set(elements: Seq[Ref[T]]): Unit

    Permalink

    Replaces contents with elements

    Replaces contents with elements

    Definition Classes
    WriteBufferBuffer
  91. def size: ReadChannel[Int]

    Permalink

    Definition Classes
    DeltaBufferSize
    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.

  92. def span(f: (Ref[T]) ⇒ Boolean): (ReadBuffer[Ref[T]], ReadBuffer[Ref[T]])

    Permalink

    Splits stream into two sub-streams

    Splits stream into two sub-streams

    The left stream contains all elements as long as f is true, all subsequent elements go to the right stream.

    Definition Classes
    PollBufferFilterOrdered
  93. def span$(f: (Ref[T]) ⇒ Boolean): (ReadBuffer[Ref[T]], ReadBuffer[Ref[T]])

    Permalink

    Split container into two sub-containers

    Split container into two sub-containers

    The left container contains all elements if f is true, all subsequent elements go to the right container.

    Definition Classes
    PollBufferFilter
  94. def splitAt(element: Ref[T]): (ReadBuffer[Ref[T]], ReadBuffer[Ref[T]])

    Permalink
    Definition Classes
    PollBufferAbsoluteOrder
  95. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  96. def tail: ReadBuffer[Ref[T]]

    Permalink
    Definition Classes
    PollBufferAbsoluteOrder
  97. def take(count: Int): ReadBuffer[Ref[T]]

    Permalink
    Definition Classes
    PollBuffer
  98. def takeUntil(ch: ReadChannel[_]): DeltaBuffer[Ref[T]]

    Permalink
    Definition Classes
    DeltaBuffer
  99. def toSeq: ReadChannel[Seq[Ref[T]]]

    Permalink
    Definition Classes
    PollBuffer
  100. def toString(): String

    Permalink
    Definition Classes
    PollBuffer → AnyRef → Any
  101. def update(f: (Ref[T]) ⇒ Ref[T]): Unit

    Permalink
    Definition Classes
    Buffer
  102. def value(index: Int): Ref[T]

    Permalink

    N-th row

    N-th row

    Definition Classes
    PollBufferIndex
  103. def values: Seq[T]

    Permalink

    All row values that are stored within the Ref objects

  104. final def wait(): Unit

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Buffer[Ref[T]]

Inherited from StateBuffer[Ref[T]]

Inherited from Disposable

Inherited from WriteBuffer[Ref[T]]

Inherited from reactive.mutate.Buffer[Seq, Ref[T]]

Inherited from ReadBuffer[Ref[T]]

Inherited from PollBuffer[Ref[T]]

Inherited from Concatenate[ReadBuffer, Ref[T]]

Inherited from AbsoluteOrder[ReadBuffer, Ref[T]]

Inherited from MapExtended[ReadBuffer, Ref[T]]

Inherited from FilterOrdered[ReadBuffer, Ref[T]]

Inherited from Aggregate[ReadBuffer, Ref[T]]

Inherited from RelativeOrder[Ref[T]]

Inherited from Filter[DeltaBuffer, Ref[T], Ref[T]]

Inherited from Find[Ref[T]]

Inherited from Filter[ReadBuffer, Ref[T]]

Inherited from Iterate[Ref[T]]

Inherited from RelativeOrder[Ref[T]]

Inherited from Index[Seq, Int, Ref[T]]

Inherited from DeltaBuffer[Ref[T]]

Inherited from Map[DeltaBuffer, Ref[T]]

Inherited from Size

Inherited from AnyRef

Inherited from Any

Ungrouped