LatticeSequence

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addRight(left: Vertex, insertee: Vertex, value: A): LatticeSequence[A, VertexSet]

This method allows insertions of any type into the RGA.

def addRight(position: Vertex, a: A): LatticeSequence[A, VertexSet]

def append(value: A): LatticeSequence[A, VertexSet]

final def asInstanceOf[T0]: T0

def before(u: Vertex, v: Vertex): Boolean

def clone(): AnyRef

def contains(v: Vertex): Boolean

val edges: Map[Vertex, Vertex]

final def eq(arg0: AnyRef): Boolean

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

def iterator: Iterator[A]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def prepend(value: A): LatticeSequence[A, VertexSet]

def successor(v: Vertex): Vertex

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

def toList: List[A]

val values: Map[Vertex, A]

def vertexIterator: Iterator[Vertex]

implicit val vertexSet: SetLike[Vertex, VertexSet]

val vertices: VertexSet

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit