akka.stream.scaladsl

FlowGraph

object FlowGraph extends GraphApply

Source
Graph.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. FlowGraph
  2. GraphApply
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class Builder[+M] extends AnyRef

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

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

    Definition Classes
    Any
  6. object Implicits

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20, M21, M22](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18], g19: Graph[Shape, M19], g20: Graph[Shape, M20], g21: Graph[Shape, M21], g22: Graph[Shape, M22])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20, M21, M22) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  10. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20, M21](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18], g19: Graph[Shape, M19], g20: Graph[Shape, M20], g21: Graph[Shape, M21])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20, M21) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  11. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18], g19: Graph[Shape, M19], g20: Graph[Shape, M20])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  12. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18], g19: Graph[Shape, M19])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  13. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  14. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  15. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  16. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  17. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  18. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  19. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  20. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  21. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  22. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  23. def closed[Mat, M1, M2, M3, M4, M5, M6, M7, M8](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  24. def closed[Mat, M1, M2, M3, M4, M5, M6, M7](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7])(combineMat: (M1, M2, M3, M4, M5, M6, M7) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  25. def closed[Mat, M1, M2, M3, M4, M5, M6](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6])(combineMat: (M1, M2, M3, M4, M5, M6) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  26. def closed[Mat, M1, M2, M3, M4, M5](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5])(combineMat: (M1, M2, M3, M4, M5) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  27. def closed[Mat, M1, M2, M3, M4](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4])(combineMat: (M1, M2, M3, M4) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  28. def closed[Mat, M1, M2, M3](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3])(combineMat: (M1, M2, M3) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  29. def closed[Mat, M1, M2](g1: Graph[Shape, M1], g2: Graph[Shape, M2])(combineMat: (M1, M2) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  30. def closed[Mat](g1: Graph[Shape, Mat])(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape) ⇒ Unit): RunnableGraph[Mat]

    Creates a new fully connected graph by importing the given graph g1 (using builder.graph()) and passing its resulting Shape along with theFlowGraph.Builder to the given create function.

    Creates a new fully connected graph by importing the given graph g1 (using builder.graph()) and passing its resulting Shape along with theFlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  31. def closed()(buildBlock: (Builder[Unit]) ⇒ Unit): RunnableGraph[Unit]

    Creates a new fully connected graph by passing a FlowGraph.Builder to the given create function.

    Creates a new fully connected graph by passing a FlowGraph.Builder to the given create function.

    The created graph must have all ports connected, otherwise an IllegalArgumentException is thrown.

    Definition Classes
    GraphApply
  32. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  34. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  35. final def getClass(): Class[_]

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

    Definition Classes
    AnyRef → Any
  37. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  38. final def ne(arg0: AnyRef): Boolean

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

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

    Definition Classes
    AnyRef
  41. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20, M21, M22](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18], g19: Graph[Shape, M19], g20: Graph[Shape, M20], g21: Graph[Shape, M21], g22: Graph[Shape, M22])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20, M21, M22) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  42. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20, M21](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18], g19: Graph[Shape, M19], g20: Graph[Shape, M20], g21: Graph[Shape, M21])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20, M21) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  43. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18], g19: Graph[Shape, M19], g20: Graph[Shape, M20])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19, M20) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  44. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18], g19: Graph[Shape, M19])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18, M19) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  45. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17], g18: Graph[Shape, M18])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17, M18) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  46. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16], g17: Graph[Shape, M17])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16, M17) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  47. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15], g16: Graph[Shape, M16])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15, M16) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  48. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14], g15: Graph[Shape, M15])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14, M15) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  49. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13], g14: Graph[Shape, M14])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13, M14) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  50. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12], g13: Graph[Shape, M13])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12, M13) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  51. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11], g12: Graph[Shape, M12])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11, M12) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  52. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10], g11: Graph[Shape, M11])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10, M11) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  53. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9, M10](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9], g10: Graph[Shape, M10])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9, M10) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  54. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8, M9](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8], g9: Graph[Shape, M9])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8, M9) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  55. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7, M8](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7], g8: Graph[Shape, M8])(combineMat: (M1, M2, M3, M4, M5, M6, M7, M8) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  56. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6, M7](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6], g7: Graph[Shape, M7])(combineMat: (M1, M2, M3, M4, M5, M6, M7) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  57. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5, M6](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5], g6: Graph[Shape, M6])(combineMat: (M1, M2, M3, M4, M5, M6) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  58. def partial[S <: Shape, Mat, M1, M2, M3, M4, M5](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4], g5: Graph[Shape, M5])(combineMat: (M1, M2, M3, M4, M5) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  59. def partial[S <: Shape, Mat, M1, M2, M3, M4](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3], g4: Graph[Shape, M4])(combineMat: (M1, M2, M3, M4) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  60. def partial[S <: Shape, Mat, M1, M2, M3](g1: Graph[Shape, M1], g2: Graph[Shape, M2], g3: Graph[Shape, M3])(combineMat: (M1, M2, M3) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  61. def partial[S <: Shape, Mat, M1, M2](g1: Graph[Shape, M1], g2: Graph[Shape, M2])(combineMat: (M1, M2) ⇒ Mat)(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape, Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graphs (using builder.graph()) and passing their resulting Shapes along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  62. def partial[S <: Shape, Mat](g1: Graph[Shape, Mat])(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape) ⇒ S): Graph[S, Mat]

    Creates a new Graph by importing the given graph g1 (using builder.graph()) and passing its resulting Shape along with theFlowGraph.Builder to the given create function.

    Creates a new Graph by importing the given graph g1 (using builder.graph()) and passing its resulting Shape along with theFlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  63. def partial[S <: Shape]()(buildBlock: (Builder[Unit]) ⇒ S): Graph[S, Unit]

    Creates a new Graph by passing a FlowGraph.Builder to the given create function.

    Creates a new Graph by passing a FlowGraph.Builder to the given create function.

    Partial graphs are allowed to have unconnected ports.

    Definition Classes
    GraphApply
  64. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  65. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from GraphApply

Inherited from AnyRef

Inherited from Any

Ungrouped