Trait

pl.metastack.metarx

ReadChannel

Related Doc: package metarx

Permalink

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 PartialChannel[T] with Flush[T] with Publish[T] with Disposable

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

Abstract Value Members

  1. abstract def dispose(): Unit

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

    Permalink

    Call f for each element

    Call f for each element

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

    Permalink

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

Concrete Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. def !==(value: ReadChannel[T]): ReadChannel[Boolean]

    Permalink
    Definition Classes
    Is
  3. def !==(value: T): ReadChannel[Boolean]

    Permalink
    Definition Classes
    Is
  4. final def ##(): Int

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

    Permalink
    Definition Classes
    AnyRef → Any
  6. def ===(value: ReadChannel[T]): ReadChannel[Boolean]

    Permalink
    Definition Classes
    Is
  7. def ===(value: T): ReadChannel[Boolean]

    Permalink
    Definition Classes
    Is
  8. def >>(ch: WriteChannel[T]): ReadChannel[Unit]

    Permalink
    Definition Classes
    Publish
  9. def all(value: T): 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: 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

  11. final def asInstanceOf[T0]: T0

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

    Permalink
  13. def buffer: Buffer[T]

    Permalink

    Buffers all produced elements

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

    Permalink
    Definition Classes
    ReadChannelCache
  15. def cache: ReadPartialChannel[T]

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

    Permalink
  17. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. def collect[U](f: PartialFunction[T, U]): ReadChannel[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
    ReadChannelMapExtended
  19. def contains[U](value: U)(implicit ev: <:<[T, Option[U]]): ReadChannel[Boolean]

    Permalink
    Definition Classes
    ReadChannelPartialChannel
  20. def count(implicit ev: <:<[T, Option[_]]): ReadChannel[Int]

    Permalink
    Definition Classes
    ReadChannelPartialChannel
  21. def count(value: 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.

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

    Permalink
  23. def distinct: ReadChannel[T]

    Permalink

    Filters out (merges) duplicates

    Filters out (merges) duplicates

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

    Permalink

    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.

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

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

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

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

    Permalink

    Only include elements for which f is true

    Only include elements for which f is true

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

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

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

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

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

    Permalink

    flatMap with back-propagation.

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

    Permalink

    Definition Classes
    ReadChannelMapExtended
    See also

    flatMap

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

    Permalink

    Definition Classes
    ReadChannelFold
    Note

    Caches the accumulator value.

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

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

    Permalink

    Bi-directional fork for channels

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

    Permalink

    Uni-directional fork for values

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

    Permalink

    Uni-directional fork for channels

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

    Permalink
  42. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  43. def has(value: 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.

  44. def hashCode(): Int

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

    Permalink

    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
  46. def is(other: ReadChannel[T]): ReadChannel[Boolean]

    Permalink
    Definition Classes
    ReadChannelIs
  47. def is(value: T): ReadChannel[Boolean]

    Permalink

    Current value is equal to value

    Current value is equal to value

    Definition Classes
    ReadChannelIs
  48. def isDefined(implicit ev: <:<[T, Option[_]]): ReadChannel[Boolean]

    Permalink

    true if partial channel has a value, false otherwise

    true if partial channel has a value, false otherwise

    Definition Classes
    ReadChannelPartialChannel
  49. 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.

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

    Permalink

    Checks whether the given element is the first produced value

    Checks whether the given element is the first produced value

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

    Permalink
    Definition Classes
    Any
  52. def isNot(other: ReadChannel[T]): ReadChannel[Boolean]

    Permalink
    Definition Classes
    ReadChannelIs
  53. def isNot(value: T): ReadChannel[Boolean]

    Permalink

    Current value is not equal to value

    Current value is not equal to value

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

    Permalink

    Applies f on each element

    Applies f on each element

    Definition Classes
    ReadChannelMap
  55. def mapOrElse[U, V](f: (U) ⇒ V, default: ⇒ V)(implicit ev: <:<[T, Option[U]]): ReadChannel[V]

    Permalink
    Definition Classes
    ReadChannelPartialChannel
  56. def mapTo[U](f: (T) ⇒ U): DeltaDict[T, U]

    Permalink

    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
  57. def mapValues[U, V](f: (U) ⇒ V)(implicit ev: <:<[T, Option[U]]): ReadChannel[Option[V]]

    Permalink
    Definition Classes
    ReadChannelPartialChannel
  58. def max[U >: T](init: U)(implicit num: Numeric[U]): ReadChannel[U]

    Permalink

    Calculates maximum value

    Calculates maximum value

    Definition Classes
    Fold
    See also

    foldLeft

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

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

    Permalink

    Calculates minimum value

    Calculates minimum value

    Definition Classes
    Fold
    See also

    foldLeft

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

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

    Permalink

    Negation of isEmpty

    Negation of isEmpty

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

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

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

    Permalink
  66. def orElse[U](default: ⇒ ReadChannel[U])(implicit ev: <:<[T, Option[U]]): ReadChannel[U]

    Permalink
    Definition Classes
    ReadChannelPartialChannel
  67. def partition(f: (T) ⇒ Boolean): (ReadChannel[T], ReadChannel[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
  68. def product[U >: T](implicit num: Numeric[U]): ReadChannel[U]

    Permalink

    Calculates product

    Calculates product

    Definition Classes
    Fold
    See also

    foldLeft

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

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

    Permalink
    Definition Classes
    ReadChannelPublish
  71. def silentAttach(f: (T) ⇒ Unit): ReadChannel[Unit]

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

    Permalink

    Sums over all elements

    Sums over all elements

    Definition Classes
    Fold
    See also

    foldLeft

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

    Permalink
    Definition Classes
    AnyRef
  74. def tail: ReadChannel[T]

    Permalink

    Skips first element

    Skips first element

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

    Permalink

    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.

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

    Permalink

    Take all elements until ch produces any value

    Take all elements until ch produces any value

    Definition Classes
    ReadChannelTake
  77. def takeWhile(f: (T) ⇒ Boolean): ReadChannel[T]

    Permalink
  78. def throttle(interval: FiniteDuration)(implicit scheduler: Scheduler): ReadChannel[T]

    Permalink
  79. def toBuffer: Buffer[T]

    Permalink

    Buffers only current element

  80. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  81. def undefined(implicit ev: <:<[T, Option[_]]): ReadChannel[Boolean]

    Permalink
    Definition Classes
    ReadChannelPartialChannel
  82. def values[U](implicit ev: <:<[T, Option[U]]): ReadChannel[U]

    Permalink

    Filters out all defined values

    Filters out all defined values

    Definition Classes
    ReadChannelPartialChannel
  83. final def wait(): Unit

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

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

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

    Permalink
  87. def zip[U, V, W, X](other1: ReadChannel[U], other2: ReadChannel[V], other3: ReadChannel[W], other4: ReadChannel[X]): ReadChannel[(T, U, V, W, X)]

    Permalink
  88. def zip[U, V, W](other1: ReadChannel[U], other2: ReadChannel[V], other3: ReadChannel[W]): ReadChannel[(T, U, V, W)]

    Permalink
  89. def zip[U, V](other1: ReadChannel[U], other2: ReadChannel[V]): ReadChannel[(T, U, V)]

    Permalink

    Helper function to zip channel with the two given channels.

    Helper function to zip channel with the two given channels. Can be used to avoid nested tuples.

  90. def zip[U](other: ReadChannel[U]): ReadChannel[(T, U)]

    Permalink
  91. def zipWith[U, V](other: ReadChannel[U])(f: (T, U) ⇒ V): ReadChannel[V]

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

    Permalink

Inherited from Disposable

Inherited from Publish[T]

Inherited from Flush[T]

Inherited from PartialChannel[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