org.widok

PollBuffer

Related Doc: package widok

trait PollBuffer[T] extends Index[Seq, Int, T] with RelativeOrder[T] with Iterate[T] with Filter[ReadBuffer, T] with Find[T] with Filter[DeltaBuffer, T, T] with RelativeOrder[T] with Aggregate[ReadBuffer, T] with FilterOrdered[ReadBuffer, T] with MapExtended[ReadBuffer, T] with AbsoluteOrder[ReadBuffer, T]

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. PollBuffer
  2. AbsoluteOrder
  3. MapExtended
  4. FilterOrdered
  5. Aggregate
  6. RelativeOrder
  7. Filter
  8. Find
  9. Filter
  10. Iterate
  11. RelativeOrder
  12. Index
  13. AnyRef
  14. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract val changes: ReadChannel[Delta[T]]

  2. abstract def map[U](f: (T) ⇒ U): DeltaBuffer[U]

  3. abstract def mapTo[U](f: (T) ⇒ U): DeltaDict[T, U]

    Map f on each element and turn stream into a dictionary

    Map f on each element and turn stream into a dictionary

    Definition Classes
    MapExtended

Concrete Value Members

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

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

    Definition Classes
    AnyRef → Any
  3. def -(other: ReadBufSet[T]): ReadBuffer[T]

    Definition Classes
    FilterOrdered
  4. final def ==(arg0: Any): Boolean

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

    Definition Classes
    PollBufferRelativeOrder
    Note

    Channels: Value that is produced right after each value

    ,

    Buffers: Current row after value

  6. def after$(value: T): T

    Row after value

    Row after value

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

    Definition Classes
    PollBufferRelativeOrder
    See also

    after

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

    Row after value with the possibility of non-existence

    Row after value with the possibility of non-existence

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

    All elements are equal to value

    All elements are equal to value

    Definition Classes
    Filter
    See also

    any

  10. def any(value: 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

  11. def apply(index: Int): T

    Definition Classes
    Index
    See also

    value

  12. final def asInstanceOf[T0]: T0

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

    Definition Classes
    PollBufferRelativeOrder
    Note

    Channels: Value that is produced right before each value

    ,

    Buffers: Current row before value

  14. def before$(value: T): T

    Row before value

    Row before value

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

    Definition Classes
    PollBufferRelativeOrder
    See also

    before

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

    Row before value with the possibility of non-existence

    Row before value with the possibility of non-existence

    Definition Classes
    PollBufferRelativeOrder
  17. def clone(): AnyRef

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

  19. def contains(value: 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.

  20. def count(value: 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.

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

    Remove all elements from other

    Remove all elements from other

    Definition Classes
    PollBufferFilterOrdered
  22. def distinct: ReadBuffer[T]

    Filters out (merges) duplicates

    Filters out (merges) duplicates

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

    Filters out duplicates

    Filters out duplicates

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

  25. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  27. def exists(f: (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

  28. def exists$(f: (T) ⇒ Boolean): Boolean

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

    Only include elements for which f is true

    Only include elements for which f is true

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

    Definition Classes
    Filter
  32. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  33. def find(f: (T) ⇒ Boolean): ReadPartialChannel[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
  34. def find$(f: (T) ⇒ Boolean): Option[T]

    Finds first value for which f is true

    Finds first value for which f is true

    Definition Classes
    PollBufferFilter
  35. def flatMap[U](f: (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
  36. def flatMapCh[U](f: (T) ⇒ ReadPartialChannel[U]): ReadBuffer[U]

  37. def flatMapSeq[U](f: (T) ⇒ Seq[U]): ReadBuffer[U]

    Definition Classes
    PollBufferMapExtended
    See also

    flatMap

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

  39. def forall(f: (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

  40. def forall$(f: (T) ⇒ Boolean): Boolean

  41. def foreach(f: (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
  42. def get: Seq[T]

    All rows as a native type

    All rows as a native type

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

    Definition Classes
    AnyRef → Any
  44. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  45. def head: ReadChannel[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
  46. def headOption: ReadPartialChannel[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
  47. def indexOf(handle: T): Int

    Index of handle

    Index of handle

    Definition Classes
    PollBufferIndex
  48. def isHead(element: T): ReadChannel[Boolean]

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

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

    Definition Classes
    PollBufferAbsoluteOrder
  51. def last: ReadChannel[T]

    Definition Classes
    PollBufferAbsoluteOrder
  52. def lastOption: ReadPartialChannel[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
  53. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  54. final def notify(): Unit

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

    Definition Classes
    AnyRef
  56. def partialMap[U](f: PartialFunction[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
  57. def partition(f: (T) ⇒ Boolean): (DeltaBuffer[T], DeltaBuffer[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
  58. def partition$(f: (T) ⇒ Boolean): (ReadBuffer[T], ReadBuffer[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
  59. def span(f: (T) ⇒ Boolean): (ReadBuffer[T], ReadBuffer[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
  60. def span$(f: (T) ⇒ Boolean): (ReadBuffer[T], ReadBuffer[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
  61. def splitAt(element: T): (ReadBuffer[T], ReadBuffer[T])

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

    Definition Classes
    AnyRef
  63. def tail: ReadBuffer[T]

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

  65. def toSeq: ReadChannel[Seq[T]]

  66. def toString(): String

    Definition Classes
    PollBuffer → AnyRef → Any
  67. def value(index: Int): T

    N-th row

    N-th row

    Definition Classes
    PollBufferIndex
  68. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AbsoluteOrder[ReadBuffer, T]

Inherited from MapExtended[ReadBuffer, T]

Inherited from FilterOrdered[ReadBuffer, T]

Inherited from Aggregate[ReadBuffer, T]

Inherited from RelativeOrder[T]

Inherited from Filter[DeltaBuffer, T, T]

Inherited from Find[T]

Inherited from Filter[ReadBuffer, T]

Inherited from Iterate[T]

Inherited from RelativeOrder[T]

Inherited from Index[Seq, Int, T]

Inherited from AnyRef

Inherited from Any

Ungrouped