org.widok

ReadChannel

Related Doc: package widok

trait ReadChannel[T] extends Head[T] with Tail[ReadChannel, T] with Take[ReadChannel, T] with Fold[T] with Is[T] with Aggregate[ReadChannel, T] with Filter[ReadChannel, T, T] with Map[ReadChannel, T] with MapExtended[ReadChannel, T] with Cache[T] with Size with Flush[T] with Disposable

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ReadChannel
  2. Disposable
  3. Flush
  4. Size
  5. Cache
  6. MapExtended
  7. Map
  8. Filter
  9. Aggregate
  10. Is
  11. Fold
  12. Take
  13. Tail
  14. Head
  15. AnyRef
  16. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def dispose(): Unit

    Definition Classes
    Disposable
  2. abstract def flush(f: (T) ⇒ Unit): Unit

    Call f for each element

    Call f for each element

    Definition Classes
    ReadChannelFlush
  3. abstract def size: ReadChannel[Int]

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

Concrete Value Members

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

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

    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  4. def >>(ch: WriteChannel[T]): ReadChannel[Unit]

  5. def all(value: T): ReadChannel[Boolean]

    All elements are equal to value

    All elements are equal to value

    Definition Classes
    Filter
    See also

    any

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

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def attach(f: (T) ⇒ Unit): ReadChannel[Unit]

  9. def buffer: Buffer[T]

    Buffers all produced elements

  10. def cache(default: T): ReadStateChannel[T]

    Definition Classes
    ReadChannelCache
  11. def cache: ReadPartialChannel[T]

    Definition Classes
    ReadChannelCache
  12. def child(): ReadChannel[T]

  13. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. 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.

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

  16. def detach(ch: ChildChannel[T, _]): Unit

  17. def distinct: ReadChannel[T]

    Filters out (merges) duplicates

    Filters out (merges) duplicates

    Definition Classes
    ReadChannelAggregate
  18. def drop(count: Int): ReadChannel[T]

    Definition Classes
    ReadChannelTake
    Note

    Channels: Skips first count elements, then stop listening. Subscribing to it will always yield the last result as initial value.

    ,

    Buffers: Creates a sub-buffer without the first count elements.

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

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

    Definition Classes
    AnyRef → Any
  21. 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

  22. def filter(f: (T) ⇒ Boolean): ReadChannel[T]

    Only include elements for which f is true

    Only include elements for which f is true

    Definition Classes
    ReadChannelFilter
  23. def filterCycles: ReadChannel[T]

  24. def filterNot(f: (T) ⇒ Boolean): ReadChannel[T]

    Definition Classes
    Filter
  25. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  26. def flatMap[U](f: (T) ⇒ ReadChannel[U]): ReadChannel[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
    ReadChannelMapExtended
  27. def flatMapBuf[U](f: (T) ⇒ ReadBuffer[U]): ReadBuffer[U]

  28. def flatMapCh[U](f: (T) ⇒ Channel[U]): Channel[U]

    flatMap with back-propagation.

  29. def flatMapSeq[U](f: (T) ⇒ Seq[U]): ReadChannel[U]

    Definition Classes
    ReadChannelMapExtended
    See also

    flatMap

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

    Definition Classes
    ReadChannelFold
    Note

    Caches the accumulator value.

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

  32. def forkBiFlat[U](obs: Observer[T, Channel[U]]): Channel[U]

    Bi-directional fork for channels

  33. def forkUni[U](observer: Observer[T, U], filterCycles: Boolean = false): ReadChannel[U]

    Uni-directional fork for values

  34. def forkUniFlat[U](observer: Observer[T, ReadChannel[U]]): ReadChannel[U]

    Uni-directional fork for channels

  35. def forkUniState[U](observer: Observer[T, U], onFlush: ⇒ Option[U]): ReadChannel[U]

  36. final def getClass(): Class[_]

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

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

    Wraps first element as a channel

    Wraps first element as a channel

    Denotes first produced element after the head call; whether head has observers at this point is irrelevant as the value is cached (i.e. attaching repeatedly will always lead the same value)

    Definition Classes
    ReadChannelHead
  39. def is(value: T): ReadChannel[Boolean]

    Current value is equal to value

    Current value is equal to value

    Definition Classes
    ReadChannelIs
  40. 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.

  41. def isHead(value: T): ReadChannel[Boolean]

    Checks whether the given element is the first produced value

    Checks whether the given element is the first produced value

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

    Definition Classes
    Any
  43. def isNot(value: T): ReadChannel[Boolean]

    Current value is not equal to value

    Current value is not equal to value

    Definition Classes
    ReadChannelIs
  44. def map[U](f: (T) ⇒ U): ReadChannel[U]

    Applies f on each element

    Applies f on each element

    Definition Classes
    ReadChannelMap
  45. 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
    ReadChannelMapExtended
  46. def max[U >: T](init: U)(implicit num: Numeric[U]): ReadChannel[U]

    Calculates maximum value

    Calculates maximum value

    Definition Classes
    Fold
    See also

    foldLeft

  47. def merge(ch: ReadChannel[T]): ReadChannel[T]

  48. def min[U >: T](init: U)(implicit num: Numeric[U]): ReadChannel[U]

    Calculates minimum value

    Calculates minimum value

    Definition Classes
    Fold
    See also

    foldLeft

  49. final def ne(arg0: AnyRef): Boolean

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

    Negation of isEmpty

    Negation of isEmpty

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

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

    Definition Classes
    AnyRef
  53. def or(ch: ReadChannel[_]): ReadChannel[Unit]

  54. def partialMap[U](f: PartialFunction[T, U]): ReadPartialChannel[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
    ReadChannelMapExtended
  55. def partition(f: (T) ⇒ Boolean): (ReadChannel[T], ReadChannel[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
  56. def product[U >: T](implicit num: Numeric[U]): ReadChannel[U]

    Calculates product

    Calculates product

    Definition Classes
    Fold
    See also

    foldLeft

  57. def publish[U](ch: WriteChannel[T], ignore: ReadChannel[U]): ReadChannel[Unit]

  58. def publish(ch: WriteChannel[T]): ReadChannel[Unit]

  59. def silentAttach(f: (T) ⇒ Unit): ReadChannel[Unit]

  60. def sum[U >: T](implicit num: Numeric[U]): ReadChannel[U]

    Sums over all elements

    Sums over all elements

    Definition Classes
    Fold
    See also

    foldLeft

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

    Definition Classes
    AnyRef
  62. def tail: ReadChannel[T]

    Skips first element

    Skips first element

    Definition Classes
    ReadChannelTail
  63. def take(count: Int): ReadChannel[T]

    Definition Classes
    ReadChannelTake
    Note

    Channels: Takes first count elements, then stop listening. Subscribing to it will always yield the last result as initial value.

    ,

    Buffers: Will always contain the first count (or less) elements of the parent buffer.

  64. def takeUntil(ch: ReadChannel[_]): ReadChannel[T]

    Take all elements until ch produces any value

    Take all elements until ch produces any value

    Definition Classes
    ReadChannelTake
  65. def toBuffer: Buffer[T]

    Buffers only current element

  66. def toString(): String

    Definition Classes
    AnyRef → Any
  67. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  70. def writeTo(write: WriteChannel[T]): Channel[T]

  71. def |(ch: ReadChannel[_]): ReadChannel[Unit]

Inherited from Disposable

Inherited from Flush[T]

Inherited from Size

Inherited from Cache[T]

Inherited from MapExtended[ReadChannel, T]

Inherited from Map[ReadChannel, T]

Inherited from Filter[ReadChannel, T, T]

Inherited from Aggregate[ReadChannel, T]

Inherited from Is[T]

Inherited from Fold[T]

Inherited from Take[ReadChannel, T]

Inherited from Tail[ReadChannel, T]

Inherited from Head[T]

Inherited from AnyRef

Inherited from Any

Ungrouped