Packages

final class BidiFlow[-I1, +O1, -I2, +O2, +Mat] extends Graph[BidiShape[I1, O1, I2, O2], Mat]

Source
BidiFlow.scala
Linear Supertypes
Graph[BidiShape[I1, O1, I2, O2], Mat], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BidiFlow
  2. Graph
  3. AnyRef
  4. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BidiFlow(traversalBuilder: TraversalBuilder, shape: BidiShape[I1, O1, I2, O2])

Type Members

  1. type Shape = BidiShape[I1, O1, I2, O2]

    Type-level accessor for the shape parameter of this graph.

    Type-level accessor for the shape parameter of this graph.

    Definition Classes
    Graph

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from BidiFlow[I1, O1, I2, O2, Mat] to any2stringadd[BidiFlow[I1, O1, I2, O2, Mat]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (BidiFlow[I1, O1, I2, O2, Mat], B)
    Implicit
    This member is added by an implicit conversion from BidiFlow[I1, O1, I2, O2, Mat] to ArrowAssoc[BidiFlow[I1, O1, I2, O2, Mat]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def addAttributes(attr: Attributes): BidiFlow[I1, O1, I2, O2, Mat]

    Add the given attributes to this Source.

    Add the given attributes to this Source. Further calls to withAttributes will not remove these attributes. Note that this operation has no effect on an empty Flow (because the attributes apply only to the contained processing stages).

    Definition Classes
    BidiFlowGraph
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def asJava: javadsl.BidiFlow[I1, O1, I2, O2, Mat]
  9. def async(dispatcher: String, inputBufferSize: Int): BidiFlow[I1, O1, I2, O2, Mat]

    Put an asynchronous boundary around this BidiFlow

    Put an asynchronous boundary around this BidiFlow

    dispatcher

    Run the graph on this dispatcher

    inputBufferSize

    Set the input buffer to this size for the graph

    Definition Classes
    BidiFlowGraph
  10. def async(dispatcher: String): BidiFlow[I1, O1, I2, O2, Mat]

    Put an asynchronous boundary around this BidiFlow

    Put an asynchronous boundary around this BidiFlow

    dispatcher

    Run the graph on this dispatcher

    Definition Classes
    BidiFlowGraph
  11. def async: BidiFlow[I1, O1, I2, O2, Mat]

    Put an asynchronous boundary around this BidiFlow

    Put an asynchronous boundary around this BidiFlow

    Definition Classes
    BidiFlowGraph
  12. def atop[OO1, II2, Mat2](bidi: Graph[BidiShape[O1, OO1, II2, I2], Mat2]): BidiFlow[I1, OO1, II2, O2, Mat]

    Add the given BidiFlow as the next step in a bidirectional transformation pipeline.

    Add the given BidiFlow as the next step in a bidirectional transformation pipeline. By convention protocol stacks are growing to the left: the right most is the bottom layer, the closest to the metal.

        +----------------------------+
        | Resulting BidiFlow         |
        |                            |
        |  +------+        +------+  |
    I1 ~~> |      |  ~O1~> |      | ~~> OO1
        |  | this |        | bidi |  |
    O2 <~~ |      | <~I2~  |      | <~~ II2
        |  +------+        +------+  |
        +----------------------------+

    The materialized value of the combined BidiFlow will be the materialized value of the current flow (ignoring the other BidiFlow’s value), use atopMat if a different strategy is needed.

  13. def atopMat[OO1, II2, Mat2, M](bidi: Graph[BidiShape[O1, OO1, II2, I2], Mat2])(combine: (Mat, Mat2) ⇒ M): BidiFlow[I1, OO1, II2, O2, M]

    Add the given BidiFlow as the next step in a bidirectional transformation pipeline.

    Add the given BidiFlow as the next step in a bidirectional transformation pipeline. By convention protocol stacks are growing to the left: the right most is the bottom layer, the closest to the metal.

        +----------------------------+
        | Resulting BidiFlow         |
        |                            |
        |  +------+        +------+  |
    I1 ~~> |      |  ~O1~> |      | ~~> OO1
        |  | this |        | bidi |  |
    O2 <~~ |      | <~I2~  |      | <~~ II2
        |  +------+        +------+  |
        +----------------------------+

    The combine function is used to compose the materialized values of this flow and that flow into the materialized value of the resulting BidiFlow.

  14. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  15. def ensuring(cond: (BidiFlow[I1, O1, I2, O2, Mat]) ⇒ Boolean, msg: ⇒ Any): BidiFlow[I1, O1, I2, O2, Mat]
    Implicit
    This member is added by an implicit conversion from BidiFlow[I1, O1, I2, O2, Mat] to Ensuring[BidiFlow[I1, O1, I2, O2, Mat]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: (BidiFlow[I1, O1, I2, O2, Mat]) ⇒ Boolean): BidiFlow[I1, O1, I2, O2, Mat]
    Implicit
    This member is added by an implicit conversion from BidiFlow[I1, O1, I2, O2, Mat] to Ensuring[BidiFlow[I1, O1, I2, O2, Mat]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. def ensuring(cond: Boolean, msg: ⇒ Any): BidiFlow[I1, O1, I2, O2, Mat]
    Implicit
    This member is added by an implicit conversion from BidiFlow[I1, O1, I2, O2, Mat] to Ensuring[BidiFlow[I1, O1, I2, O2, Mat]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  18. def ensuring(cond: Boolean): BidiFlow[I1, O1, I2, O2, Mat]
    Implicit
    This member is added by an implicit conversion from BidiFlow[I1, O1, I2, O2, Mat] to Ensuring[BidiFlow[I1, O1, I2, O2, Mat]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  22. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from BidiFlow[I1, O1, I2, O2, Mat] to StringFormat[BidiFlow[I1, O1, I2, O2, Mat]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  23. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def join[Mat2](flow: Graph[FlowShape[O1, I2], Mat2]): Flow[I1, O2, Mat]

    Add the given Flow as the final step in a bidirectional transformation pipeline.

    Add the given Flow as the final step in a bidirectional transformation pipeline. By convention protocol stacks are growing to the left: the right most is the bottom layer, the closest to the metal.

        +---------------------------+
        | Resulting Flow            |
        |                           |
        |  +------+        +------+ |
    I1 ~~> |      |  ~O1~> |      | |
        |  | this |        | flow | |
    O2 <~~ |      | <~I2~  |      | |
        |  +------+        +------+ |
        +---------------------------+

    The materialized value of the combined Flow will be the materialized value of the current flow (ignoring the other Flow’s value), use joinMat if a different strategy is needed.

  27. def joinMat[Mat2, M](flow: Graph[FlowShape[O1, I2], Mat2])(combine: (Mat, Mat2) ⇒ M): Flow[I1, O2, M]

    Add the given Flow as the final step in a bidirectional transformation pipeline.

    Add the given Flow as the final step in a bidirectional transformation pipeline. By convention protocol stacks are growing to the left: the right most is the bottom layer, the closest to the metal.

        +---------------------------+
        | Resulting Flow            |
        |                           |
        |  +------+        +------+ |
    I1 ~~> |      |  ~O1~> |      | |
        |  | this |        | flow | |
    O2 <~~ |      | <~I2~  |      | |
        |  +------+        +------+ |
        +---------------------------+

    The combine function is used to compose the materialized values of this flow and that flow into the materialized value of the resulting Flow.

  28. def mapMaterializedValue[Mat2](f: (Mat) ⇒ Mat2): BidiFlow[I1, O1, I2, O2, Mat2]

    Transform only the materialized value of this BidiFlow, leaving all other properties as they were.

  29. def named(name: String): BidiFlow[I1, O1, I2, O2, Mat]

    Add a name attribute to this Flow.

    Add a name attribute to this Flow.

    Definition Classes
    BidiFlowGraph
  30. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  32. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  33. def reversed: BidiFlow[I2, O2, I1, O1, Mat]

    Turn this BidiFlow around by 180 degrees, logically flipping it upside down in a protocol stack.

  34. val shape: BidiShape[I1, O1, I2, O2]
    Definition Classes
    BidiFlowGraph
  35. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  36. def toString(): String
    Definition Classes
    AnyRef → Any
  37. val traversalBuilder: TraversalBuilder
    Definition Classes
    BidiFlowGraph
  38. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  41. def withAttributes(attr: Attributes): BidiFlow[I1, O1, I2, O2, Mat]

    Change the attributes of this Source to the given ones and seal the list of attributes.

    Change the attributes of this Source to the given ones and seal the list of attributes. This means that further calls will not be able to remove these attributes, but instead add new ones. Note that this operation has no effect on an empty Flow (because the attributes apply only to the contained processing stages).

    Definition Classes
    BidiFlowGraph
  42. def [B](y: B): (BidiFlow[I1, O1, I2, O2, Mat], B)
    Implicit
    This member is added by an implicit conversion from BidiFlow[I1, O1, I2, O2, Mat] to ArrowAssoc[BidiFlow[I1, O1, I2, O2, Mat]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Graph[BidiShape[I1, O1, I2, O2], Mat]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from BidiFlow[I1, O1, I2, O2, Mat] to any2stringadd[BidiFlow[I1, O1, I2, O2, Mat]]

Inherited by implicit conversion StringFormat from BidiFlow[I1, O1, I2, O2, Mat] to StringFormat[BidiFlow[I1, O1, I2, O2, Mat]]

Inherited by implicit conversion Ensuring from BidiFlow[I1, O1, I2, O2, Mat] to Ensuring[BidiFlow[I1, O1, I2, O2, Mat]]

Inherited by implicit conversion ArrowAssoc from BidiFlow[I1, O1, I2, O2, Mat] to ArrowAssoc[BidiFlow[I1, O1, I2, O2, Mat]]

Ungrouped