org.widok

Channel

Related Docs: object Channel | package widok

trait Channel[T] extends ReadChannel[T] with WriteChannel[T]

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Channel
  2. WriteChannel
  3. Channel
  4. ReadChannel
  5. Disposable
  6. Flush
  7. Size
  8. Cache
  9. MapExtended
  10. Map
  11. Filter
  12. Aggregate
  13. Is
  14. Fold
  15. Take
  16. Tail
  17. Head
  18. AnyRef
  19. 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
    ChannelDisposable
  2. abstract def flush(f: (T) ⇒ Unit): Unit

    Definition Classes
    WriteChannel
  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. def :=(value: T): Unit

    Definition Classes
    Channel
  4. def <<[U](ch: ReadChannel[T], ignore: ReadChannel[U]): ReadChannel[Unit]

    Definition Classes
    WriteChannel
  5. def <<(ch: ReadChannel[T]): ReadChannel[Unit]

    Definition Classes
    WriteChannel
  6. def <<>>(other: Channel[T], ignoreOther: ReadChannel[Unit]): Unit

  7. def <<>>(other: Channel[T]): Unit

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

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

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

    All elements are equal to value

    All elements are equal to value

    Definition Classes
    Filter
    See also

    any

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

  12. final def asInstanceOf[T0]: T0

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

    Definition Classes
    ReadChannel
  14. def biMap[U](f: (T) ⇒ U, g: (U) ⇒ T): Channel[U]

  15. def bind(other: Channel[T], ignoreOther: ReadChannel[Unit]): Unit

  16. def bind(other: Channel[T]): Unit

    Two-way binding; synchronises this and other.

  17. def buffer: Buffer[T]

    Buffers all produced elements

    Buffers all produced elements

    Definition Classes
    ReadChannel
  18. def cache(default: T): ReadStateChannel[T]

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

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

    Definition Classes
    ReadChannel
  21. def clone(): AnyRef

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

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

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

    Definition Classes
    ReadChannel
  25. def distinct: ReadChannel[T]

    Filters out (merges) duplicates

    Filters out (merges) duplicates

    Definition Classes
    ReadChannelAggregate
  26. 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.

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

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

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

  30. 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
  31. def filterCycles: ReadChannel[T]

    Definition Classes
    ReadChannel
  32. def filterNot(f: (T) ⇒ Boolean): ReadChannel[T]

    Definition Classes
    Filter
  33. def finalize(): Unit

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

    Definition Classes
    ReadChannel
  36. def flatMapCh[U](f: (T) ⇒ Channel[U]): Channel[U]

    flatMap with back-propagation.

    flatMap with back-propagation.

    Definition Classes
    ReadChannel
  37. def flatMapSeq[U](f: (T) ⇒ Seq[U]): ReadChannel[U]

    Definition Classes
    ReadChannelMapExtended
    See also

    flatMap

  38. def flatProduce[U](value: Option[T], ignore: ReadChannel[U]*): Unit

    Definition Classes
    WriteChannel
  39. def flatProduce(value: Option[T]): Unit

    Definition Classes
    WriteChannel
  40. def foldLeft[U](acc: U)(f: (U, T) ⇒ U): ReadChannel[U]

    Definition Classes
    ReadChannelFold
    Note

    Caches the accumulator value.

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

  42. def forkBi[U](fwd: Observer[T, U], bwd: Observer[U, T], silent: Boolean = false): Channel[U]

    Bi-directional fork for values

    Bi-directional fork for values

    Definition Classes
    WriteChannel
  43. def forkBiFlat[U](obs: Observer[T, Channel[U]]): Channel[U]

    Bi-directional fork for channels

    Bi-directional fork for channels

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

    Uni-directional fork for values

    Uni-directional fork for values

    Definition Classes
    ReadChannel
  45. def forkUniFlat[U](observer: Observer[T, ReadChannel[U]]): ReadChannel[U]

    Uni-directional fork for channels

    Uni-directional fork for channels

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

    Definition Classes
    ReadChannel
  47. final def getClass(): Class[_]

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

    Definition Classes
    AnyRef → Any
  49. 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
  50. def is(value: T): ReadChannel[Boolean]

    Current value is equal to value

    Current value is equal to value

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

  52. 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
  53. final def isInstanceOf[T0]: Boolean

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

    Current value is not equal to value

    Current value is not equal to value

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

    Applies f on each element

    Applies f on each element

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

    Calculates maximum value

    Calculates maximum value

    Definition Classes
    Fold
    See also

    foldLeft

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

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

    Calculates minimum value

    Calculates minimum value

    Definition Classes
    Fold
    See also

    foldLeft

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

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

    Negation of isEmpty

    Negation of isEmpty

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

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

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

    Definition Classes
    ReadChannel
  65. def partialBiMap[U](f: (T) ⇒ Option[U], g: (U) ⇒ Option[T]): Channel[U]

  66. 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
  67. 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
  68. def produce[U](value: T, ignore: ReadChannel[U]*): Unit

    Definition Classes
    WriteChannel
  69. def produce(value: T): Unit

    Definition Classes
    WriteChannelChannel
  70. def product[U >: T](implicit num: Numeric[U]): ReadChannel[U]

    Calculates product

    Calculates product

    Definition Classes
    Fold
    See also

    foldLeft

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

    Definition Classes
    ReadChannel
  72. def publish(ch: WriteChannel[T]): ReadChannel[Unit]

    Definition Classes
    ReadChannel
  73. def silentAttach(f: (T) ⇒ Unit): ReadChannel[Unit]

    Definition Classes
    ReadChannel
  74. def subscribe[U](ch: ReadChannel[T], ignore: ReadChannel[U]): ReadChannel[Unit]

    Definition Classes
    WriteChannel
  75. def subscribe(ch: ReadChannel[T]): ReadChannel[Unit]

    Redirect stream from other to this.

    Redirect stream from other to this.

    Definition Classes
    WriteChannel
  76. def sum[U >: T](implicit num: Numeric[U]): ReadChannel[U]

    Sums over all elements

    Sums over all elements

    Definition Classes
    Fold
    See also

    foldLeft

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

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

    Skips first element

    Skips first element

    Definition Classes
    ReadChannelTail
  79. 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.

  80. 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
  81. def toBuffer: Buffer[T]

    Buffers only current element

    Buffers only current element

    Definition Classes
    ReadChannel
  82. def toOpt: Opt[T]

  83. def toString(): String

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

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

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

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

    Definition Classes
    ReadChannel
  88. def |(ch: ReadChannel[_]): ReadChannel[Unit]

    Definition Classes
    ReadChannel

Inherited from WriteChannel[T]

Inherited from reactive.propagate.Channel[T]

Inherited from ReadChannel[T]

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