Trait

akka.stream.scaladsl

GraphApply

Related Doc: package scaladsl

Permalink

trait GraphApply extends AnyRef

Source
GraphApply.scala
Linear Supertypes
AnyRef, Any
Known Subclasses
GraphDSL
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphApply
  2. AnyRef
  3. 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

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphApply to any2stringadd[GraphApply] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd

  4. def ->[B](y: B): (GraphApply, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphApply to ArrowAssoc[GraphApply] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef → Any

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  9. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  10. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  11. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  12. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  13. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  14. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  15. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  16. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  17. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  18. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  19. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  20. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  21. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  22. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  23. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  24. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  25. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  26. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  27. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  28. def create[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]

    Permalink

    Creates a new Graph by importing the given graphs and passing their Shapes along with the GraphDSL.Builder to the given create function.

  29. def create[S <: Shape, Mat](g1: Graph[Shape, Mat])(buildBlock: (Builder[Mat]) ⇒ (Graph.Shape) ⇒ S): Graph[S, Mat]

    Permalink

    Creates a new Graph by importing the given graph g1 and passing its Shape along with the GraphDSL.Builder to the given create function.

  30. def create[S <: Shape]()(buildBlock: (Builder[NotUsed]) ⇒ S): Graph[S, NotUsed]

    Permalink

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

  31. def ensuring(cond: (GraphApply) ⇒ Boolean, msg: ⇒ Any): GraphApply

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphApply to Ensuring[GraphApply] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  32. def ensuring(cond: (GraphApply) ⇒ Boolean): GraphApply

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphApply to Ensuring[GraphApply] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  33. def ensuring(cond: Boolean, msg: ⇒ Any): GraphApply

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphApply to Ensuring[GraphApply] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  34. def ensuring(cond: Boolean): GraphApply

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphApply to Ensuring[GraphApply] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Permalink
    Definition Classes
    AnyRef

  36. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  37. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  38. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphApply to StringFormat[GraphApply] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef → Any

  40. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  41. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  43. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  44. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  46. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  47. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  48. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  49. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  50. def →[B](y: B): (GraphApply, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from GraphApply to ArrowAssoc[GraphApply] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from GraphApply to any2stringadd[GraphApply]

Inherited by implicit conversion StringFormat from GraphApply to StringFormat[GraphApply]

Inherited by implicit conversion Ensuring from GraphApply to Ensuring[GraphApply]

Inherited by implicit conversion ArrowAssoc from GraphApply to ArrowAssoc[GraphApply]

Ungrouped