Trait/Object

scalax.collection.GraphPredef

InnerEdgeParam

Related Docs: object InnerEdgeParam | package GraphPredef

Permalink

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

NI

the type of the nodes (vertices) this graph is passed to by the user.

NO

the type of the nodes (vertices) this graph passes back.

Linear Supertypes
EdgeParam, OutParam[NI, EI], Param[NI, EI], AnyRef, Any
Known Subclasses
EdgeBase, EdgeImpl, InnerEdge
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. InnerEdgeParam
  2. EdgeParam
  3. OutParam
  4. Param
  5. AnyRef
  6. Any
Implicitly
  1. by anyToNode
  2. by EdgeAssoc
  3. by CollectionsHaveToParArray
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def edge: EO[NO]

    Permalink

Concrete 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 InnerEdgeParam[NI, EI, NO, EO] to any2stringadd[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)

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to ArrowAssoc[InnerEdgeParam[NI, EI, NO, EO]] 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 asEdgeT[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): asEdgeT.G.EdgeT

    Permalink
    Attributes
    protected[scalax.collection]

  7. final def asEdgeTProjection[N <: NI, E[X] <: EdgeLikeIn[X]]: EdgeT

    Permalink
    Attributes
    protected[scalax.collection]

  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  9. def clone(): AnyRef

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

  10. def ensuring(cond: (InnerEdgeParam[NI, EI, NO, EO]) ⇒ Boolean, msg: ⇒ Any): InnerEdgeParam[NI, EI, NO, EO]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to Ensuring[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]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to Ensuring[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]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to Ensuring[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]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to Ensuring[InnerEdgeParam[NI, EI, NO, EO]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Permalink
    Definition Classes
    AnyRef

  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  16. def finalize(): Unit

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

  17. final def fold[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (fold.G.EdgeT) ⇒ T, fb: (EdgeT) ⇒ T): T

    Permalink

  18. def formatted(fmtstr: String): String

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  20. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  21. final def isContaining[N <: NI, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

    Permalink

  22. def isDefined: Boolean

    Permalink
    Definition Classes
    Param

  23. def isEdge: Boolean

    Permalink
    Definition Classes
    EdgeParam

  24. def isIn: Boolean

    Permalink
    Definition Classes
    OutParam → Param

  25. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  26. def isNode: Boolean

    Permalink
    Definition Classes
    EdgeParam

  27. def isOut: Boolean

    Permalink
    Definition Classes
    OutParam → Param

  28. val n1: InnerEdgeParam[NI, EI, NO, EO]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to EdgeAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

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

    Permalink
    Definition Classes
    AnyRef

  30. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  31. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  32. def stringPrefix: String

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  34. final def toEdgeT[N <: NI, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (EdgeT) ⇒ toEdgeT.G.EdgeT): toEdgeT.G.EdgeT

    Permalink

  35. def toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to CollectionsHaveToParArray[InnerEdgeParam[NI, EI, NO, EO], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (InnerEdgeParam[NI, EI, NO, EO]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray

  36. def toString(): String

    Permalink
    Definition Classes
    InnerEdgeParam → AnyRef → Any

  37. val value: InnerEdgeParam[NI, EI, NO, EO]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to OuterNode[InnerEdgeParam[NI, EI, NO, EO]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam

  38. final def wait(): Unit

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

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

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

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

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

  41. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to EdgeAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  42. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to EdgeAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  43. def →[B](y: B): (InnerEdgeParam[NI, EI, NO, EO], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to ArrowAssoc[InnerEdgeParam[NI, EI, NO, EO]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def isDefined: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to OuterNode[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. def isEdge: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to OuterNode[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
    NodeParam

  3. def isIn: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to OuterNode[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
    InParam → Param

  4. def isNode: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to OuterNode[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. def isOut: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to OuterNode[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
    InParam → Param

  6. def stringPrefix: String

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to OuterNode[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

    Permalink
    Implicit information
    This member is added by an implicit conversion from InnerEdgeParam[NI, EI, NO, EO] to OuterNode[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

Inherited from EdgeParam

Inherited from OutParam[NI, EI]

Inherited from Param[NI, EI]

Inherited from AnyRef

Inherited from Any

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

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

Inherited by implicit conversion CollectionsHaveToParArray from InnerEdgeParam[NI, EI, NO, EO] to CollectionsHaveToParArray[InnerEdgeParam[NI, EI, NO, EO], T]

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

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

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

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

Ungrouped