org.widok

RefBuf

Related Doc: package widok

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. AbsoluteOrder
  14. MapExtended
  15. FilterOrdered
  16. Aggregate
  17. RelativeOrder
  18. Filter
  19. Find
  20. Filter
  21. Iterate
  22. RelativeOrder
  23. Index
  24. DeltaBuffer
  25. Map
  26. Size
  27. AnyRef
  28. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RefBuf()

Value Members

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

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

    Definition Classes
    AnyRef → Any
  3. def ++=(buf: Seq[Ref[T]]): Unit

    Definition Classes
    Buffer
    See also

    appendAll

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

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

    Definition Classes
    Buffer
    See also

    append

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

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

    Definition Classes
    Buffer
    See also

    removeAll

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

    Definition Classes
    Buffer
    See also

    remove

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

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

    Definition Classes
    PollBufferRelativeOrder
    Note

    Channels: Value that is produced right after each value

    ,

    Buffers: Current row after value

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

    Row after value

    Row after value

    Definition Classes
    PollBufferRelativeOrder
  12. def afterOption(value: Ref[T]): ReadPartialChannel[Ref[T]]

    Definition Classes
    PollBufferRelativeOrder
    See also

    after

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

    Row after value with the possibility of non-existence

    Row after value with the possibility of non-existence

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

    All elements are equal to value

    All elements are equal to value

    Definition Classes
    Filter
    See also

    any

  15. def any(value: Ref[T]): ReadChannel[Boolean]

    At least one element is equal to value

    At least one element is equal to value

    Definition Classes
    Filter
    See also

    all

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

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

    Appends element

    Appends element

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

    Appends all elements from buf

    Appends all elements from buf

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

    Definition Classes
    Index
    See also

    value

  20. final def asInstanceOf[T0]: T0

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

    Definition Classes
    PollBufferRelativeOrder
    Note

    Channels: Value that is produced right before each value

    ,

    Buffers: Current row before value

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

    Row before value

    Row before value

    Definition Classes
    PollBufferRelativeOrder
  23. def beforeOption(value: Ref[T]): ReadPartialChannel[Ref[T]]

    Definition Classes
    PollBufferRelativeOrder
    See also

    before

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

    Row before value with the possibility of non-existence

    Row before value with the possibility of non-existence

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

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

    Definition Classes
    StateBuffer
  27. def clear(): Unit

    Remove all rows

    Remove all rows

    Definition Classes
    WriteBufferBuffer
  28. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. def concat(buf: ReadBuffer[Ref[T]]): ReadBuffer[Ref[T]]

    Definition Classes
    PollBuffer
  30. def contains(value: Ref[T]): ReadChannel[Boolean]

    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.

  31. def count(value: Ref[T]): ReadChannel[Int]

    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.

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

    Remove all elements from other

    Remove all elements from other

    Definition Classes
    PollBufferFilterOrdered
  33. def dispose(): Unit

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

    Filters out (merges) duplicates

    Filters out (merges) duplicates

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

    Filters out duplicates

    Filters out duplicates

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

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

    Definition Classes
    AnyRef
  38. def exists(f: (Ref[T]) ⇒ Boolean): ReadChannel[Boolean]

    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

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

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

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

    Only include elements for which f is true

    Only include elements for which f is true

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

    Definition Classes
    Filter
  43. def finalize(): Unit

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

    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
  45. def find$(f: (Ref[T]) ⇒ Boolean): Option[Ref[T]]

    Finds first value for which f is true

    Finds first value for which f is true

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

    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
  47. def flatMapCh[U](f: (Ref[T]) ⇒ ReadPartialChannel[U]): ReadBuffer[U]

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

    Definition Classes
    PollBufferMapExtended
    See also

    flatMap

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

    Definition Classes
    PollBuffer
  50. def forall(f: (Ref[T]) ⇒ Boolean): ReadChannel[Boolean]

    Checks whether f is true for all elements

    Checks whether f is true for all elements

    Definition Classes
    Filter
    See also

    exists

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

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

    Iterates over all row values with the given function f

    Iterates over all row values with the given function f

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

    All rows as a native type

    All rows as a native type

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

    Definition Classes
    AnyRef → Any
  55. def head: ReadChannel[Ref[T]]

    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
  56. def headOption: ReadPartialChannel[Ref[T]]

    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
  57. def indexOf(handle: Ref[T]): Int

    Index of handle

    Index of handle

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

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

    Inserts element after handle

    Inserts element after handle

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

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

    Inserts element before handle

    Inserts element before handle

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

    Definition Classes
    DeltaBuffer
  63. def isEmpty: ReadChannel[Boolean]

    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.

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

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

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

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

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

    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
  69. def map[U](f: (Ref[T]) ⇒ U): DeltaBuffer[U]

    Unlike mapPure, stores mapping locally.

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

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

    Definition Classes
    DeltaBuffer
    Note

    f must not be side-effecting

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

    Definition Classes
    DeltaBuffer
  72. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  73. def nonEmpty: ReadChannel[Boolean]

    Negation of isEmpty

    Negation of isEmpty

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

    Definition Classes
    AnyRef
  75. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  76. def partialMap[U](f: PartialFunction[Ref[T], U]): ReadBuffer[U]

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

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

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

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

    Prepends element

    Prepends element

    Definition Classes
    WriteBufferBuffer
  81. def removals: ReadChannel[Ref[T]]

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

    Removes row by its reference handle

    Removes row by its reference handle

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

    Removes all elements from buf

    Removes all elements from buf

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

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

    Replaces value of reference by element

    Replaces value of reference by element

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

    Replaces contents with elements

    Replaces contents with elements

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

    Definition Classes
    DeltaBufferSize
    Note

    State channels: Produce when a new child is attached and if the size changes. In org.widok.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.

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

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

    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
  90. def splitAt(element: Ref[T]): (ReadBuffer[Ref[T]], ReadBuffer[Ref[T]])

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

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

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

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

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

    Definition Classes
    PollBuffer
  96. def toString(): String

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

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

    N-th row

    N-th row

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

    All row values that are stored within the Ref objects

  100. final def wait(): Unit

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

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

    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 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