ConstraintCompanion

abstract def apply[N, E[X] <: EdgeLikeIn[X]](self: Graph[N, E]): CC[N, E]

Instantiates a user constraint.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def &&(that: ConstraintCompanion[Constraint]): ConstraintCompanionBinaryOp

Creates a new constraint companion of the type ConstraintCompanionBinaryOp the apply of which returns ConstraintBinaryOp with the And operator.

final def ==(arg0: AnyRef): Boolean

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

def stringPrefix: Option[String]

The stringPrefix of constrained Graphs using this constraint will be replaced by this string unless None.

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withStringPrefix(stringPrefix: String): PrefixedConstraintCompanion

Sets stringPrefix of constrained Graphs using this combined constraint companion to graphStringPrefix.

def ||(that: ConstraintCompanion[Constraint]): ConstraintCompanionBinaryOp

Creates a new constraint companion of the type ConstraintCompanionBinaryOp the apply of which returns ConstraintBinaryOp with the Or operator.