scalax.collection.edge.LBase

TypedLEdgeImplicits

trait TypedLEdgeImplicits[G[N, E[X] <: EdgeLikeIn[X]] <: GraphBase[N, E[X]], UL] extends AnyRef

Convenience trait to quickly achieve implicit conversion from a labeled edge to its label for any graph type. This trait is the typed variant of scalax.collection.edge.LBase.LEdgeImplicits which works for immutable Graphs only.

G

kind of type of graph.

UL

type of the user label.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TypedLEdgeImplicits
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  13. implicit def innerEdge2UserLabel[N, E[X] <: EdgeLikeIn[X]](innerEdge: G.EdgeT): UL

    Lets implicitly convert a labeled inner edge to its label:

    Lets implicitly convert a labeled inner edge to its label:

    import scalax.collection.mutable.{Graph => MGraph}

case class MyLabel(val i: Int)
val g = MGraph(LUnDiEdge(1,3)(MyLabel(4)))
val eInner = g.edges.head

object MyLabelConversion extends TypedLEdgeImplicits[MGraph, MyLabel]
import MyLabelConversion._
val four_2 = eInner.i

    As this conversion is not type safe, the user has to ensure that innerEdge is of appropriate type.

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  18. implicit def outerLEdge2UserLabel[N](edge: LEdge[N] { type L1 = UL }): UL

    Lets implicitly convert a labeled outer edge to its label:

    Lets implicitly convert a labeled outer edge to its label:

    import scalax.collection.mutable.{Graph => MGraph}

case class MyLabel(val i: Int)
val eOuter = LUnDiEdge(1,3)(MyLabel(4))

object MyLabelConversion extends TypedLEdgeImplicits[MGraph, MyLabel]
import MyLabelConversion._
val four = eOuter.i

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

    Definition Classes
    AnyRef

  20. def toString(): String

    Definition Classes
    AnyRef → Any

  21. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any

Ungrouped