Packages

trait InnerEdgeParam[NI, EI[+X] <: EdgeLike[X], +NO <: InnerNodeParam[NI], EO[+X] <: EdgeLike[X]] extends OutParam[NI, EI] with EdgeParam

NI

the type of the nodes the graph is passed to.

EI

the kind of the edges the graph is passed to.

NO

the type of the nodes created internally.

EO

the kind of the edges created internally.

Linear Supertypes
EdgeParam, OutParam[NI, EI], Param[NI, EI], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerEdgeParam
  2. EdgeParam
  3. OutParam
  4. Param
  5. AnyRef
  6. Any
Implicitly
  1. by EdgeAssoc
  2. by anyToNode
  3. by ChainingOps
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def edge: EO[NO]

Concrete 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 InnerEdgeParam[NI, EI, NO, EO] toany2stringadd[InnerEdgeParam[NI, EI, NO, EO]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (InnerEdgeParam[NI, EI, NO, EO], B)
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toArrowAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def asEdgeT[N <: NI, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G): asEdgeT.G.EdgeT
    Attributes
    protected[collection]
  7. final def asEdgeTProjection[N <: NI, E[+X] <: EdgeLikeIn[X]]: EdgeT
    Attributes
    protected[collection]
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  10. def ensuring(cond: (InnerEdgeParam[NI, EI, NO, EO]) => Boolean, msg: => Any): InnerEdgeParam[NI, EI, NO, EO]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toEnsuring[InnerEdgeParam[NI, EI, NO, EO]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: (InnerEdgeParam[NI, EI, NO, EO]) => Boolean): InnerEdgeParam[NI, EI, NO, EO]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toEnsuring[InnerEdgeParam[NI, EI, NO, EO]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean, msg: => Any): InnerEdgeParam[NI, EI, NO, EO]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toEnsuring[InnerEdgeParam[NI, EI, NO, EO]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean): InnerEdgeParam[NI, EI, NO, EO]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toEnsuring[InnerEdgeParam[NI, EI, NO, EO]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  16. final def fold[N <: NI, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E], T](g: G)(fa: (fold.G.EdgeT) => T, fb: (EdgeT) => T): T
  17. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  19. final def isContaining[N <: NI, E[+X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
  20. def isDefined: Boolean
    Definition Classes
    Param
  21. final def isEdge: Boolean
    Definition Classes
    Param
  22. def isIn: Boolean
    Definition Classes
    OutParamParam
  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. def isNode: Boolean
    Definition Classes
    EdgeParam
  25. final def isOut: Boolean
    Definition Classes
    Param
  26. val n1: InnerEdgeParam[NI, EI, NO, EO]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toEdgeAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  27. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  29. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  30. def pipe[B](f: (InnerEdgeParam[NI, EI, NO, EO]) => B): B
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toChainingOps[InnerEdgeParam[NI, EI, NO, EO]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  31. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  32. val self: InnerEdgeParam[NI, EI, NO, EO]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toChainingOps[InnerEdgeParam[NI, EI, NO, EO]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  33. def stringPrefix: String
  34. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  35. def tap[U](f: (InnerEdgeParam[NI, EI, NO, EO]) => U): InnerEdgeParam[NI, EI, NO, EO]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toChainingOps[InnerEdgeParam[NI, EI, NO, EO]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  36. final def toEdgeT[N <: NI, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G)(f: (EdgeT) => toEdgeT.G.EdgeT): toEdgeT.G.EdgeT
  37. def toString(): String
    Definition Classes
    InnerEdgeParam → AnyRef → Any
  38. val value: InnerEdgeParam[NI, EI, NO, EO]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  39. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  40. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  41. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  42. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toEdgeAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  43. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toEdgeAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdgeParam: OuterNode[InnerEdgeParam[NI, EI, NO, EO]]).isDefined
    Definition Classes
    Param
  2. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdgeParam: OuterNode[InnerEdgeParam[NI, EI, NO, EO]]).isEdge
    Definition Classes
    Param
  3. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdgeParam: OuterNode[InnerEdgeParam[NI, EI, NO, EO]]).isIn
    Definition Classes
    InParamParam
  4. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdgeParam: OuterNode[InnerEdgeParam[NI, EI, NO, EO]]).isNode
    Definition Classes
    NodeParam
  5. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdgeParam: OuterNode[InnerEdgeParam[NI, EI, NO, EO]]).isOut
    Definition Classes
    Param
  6. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdgeParam: OuterNode[InnerEdgeParam[NI, EI, NO, EO]]).stringPrefix
    Definition Classes
    NodeParam
  7. def toString(): String
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toOuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdgeParam: OuterNode[InnerEdgeParam[NI, EI, NO, EO]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toStringFormat[InnerEdgeParam[NI, EI, NO, EO]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  3. def [B](y: B): (InnerEdgeParam[NI, EI, NO, EO], B)
    Implicit
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] toArrowAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from EdgeParam

Inherited from OutParam[NI, EI]

Inherited from Param[NI, EI]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion EdgeAssoc fromInnerEdgeParam[NI, EI, NO, EO] to EdgeAssoc[InnerEdgeParam[NI, EI, NO, EO]]

Inherited by implicit conversion anyToNode fromInnerEdgeParam[NI, EI, NO, EO] to OuterNode[InnerEdgeParam[NI, EI, NO, EO]]

Inherited by implicit conversion ChainingOps fromInnerEdgeParam[NI, EI, NO, EO] to ChainingOps[InnerEdgeParam[NI, EI, NO, EO]]

Inherited by implicit conversion any2stringadd fromInnerEdgeParam[NI, EI, NO, EO] to any2stringadd[InnerEdgeParam[NI, EI, NO, EO]]

Inherited by implicit conversion StringFormat fromInnerEdgeParam[NI, EI, NO, EO] to StringFormat[InnerEdgeParam[NI, EI, NO, EO]]

Inherited by implicit conversion Ensuring fromInnerEdgeParam[NI, EI, NO, EO] to Ensuring[InnerEdgeParam[NI, EI, NO, EO]]

Inherited by implicit conversion ArrowAssoc fromInnerEdgeParam[NI, EI, NO, EO] to ArrowAssoc[InnerEdgeParam[NI, EI, NO, EO]]

Ungrouped