:~ - Graph Core 1.11.3 - scalax.collection.edge.Implicits.:~

Extractors for weighted and/or labeled undirected edges.

object StringLabel extends LEdgeImplicits[String]
import StringLabel._

val lE = (n1 ~+ n2)(label)
lE match { case LUnDiEdge(s, t, l) => f(s, t, l) } // constructor pattern
lE match { case s :~ t + l         => f(s, t, l) } // infix op pattern

val lkE = (n1 ~+# n2)(label)
lkE match { case s :~ t + l => f(s, t, l) }

Linear Supertypes

AnyRef, Any

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

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

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def unapply[N](e: WkLkUnDiEdge[N]): Option[(N, (N, Long, WLUnDiEdge.L1))]
def unapply[N](e: WkLUnDiEdge[N]): Option[(N, (N, Long, WLUnDiEdge.L1))]
def unapply[N](e: WLkUnDiEdge[N]): Option[(N, (N, Long, WLUnDiEdge.L1))]
def unapply[N](e: WLUnDiEdge[N]): Option[(N, (N, Long, WLUnDiEdge.L1))]
def unapply[N](e: LkUnDiEdge[N]): Option[(N, (N, LUnDiEdge.L1))]
def unapply[N](e: LUnDiEdge[N]): Option[(N, (N, LUnDiEdge.L1))]
def unapply[N](e: WkUnDiEdge[N]): Option[(N, (N, Long))]
def unapply[N](e: WUnDiEdge[N]): Option[(N, (N, Long))]
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

:~

Related Doc: package Implicits

object :~

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

def unapply[N](e: WkLkUnDiEdge[N]): Option[(N, (N, Long, WLUnDiEdge.L1))]

def unapply[N](e: WkLUnDiEdge[N]): Option[(N, (N, Long, WLUnDiEdge.L1))]

def unapply[N](e: WLkUnDiEdge[N]): Option[(N, (N, Long, WLUnDiEdge.L1))]

def unapply[N](e: WLUnDiEdge[N]): Option[(N, (N, Long, WLUnDiEdge.L1))]

def unapply[N](e: LkUnDiEdge[N]): Option[(N, (N, LUnDiEdge.L1))]

def unapply[N](e: LUnDiEdge[N]): Option[(N, (N, LUnDiEdge.L1))]

def unapply[N](e: WkUnDiEdge[N]): Option[(N, (N, Long))]

def unapply[N](e: WUnDiEdge[N]): Option[(N, (N, Long))]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped