case class LatticeSequence[A, VertexSet](vertices: VertexSet, edges: Map[Vertex, Vertex], values: Map[Vertex, A])(implicit vertexSet: SetLike[Vertex, VertexSet]) extends Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- LatticeSequence
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
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
- def addRight(left: Vertex, insertee: Vertex, value: A): LatticeSequence[A, VertexSet]
This method allows insertions of any type into the RGA.
This method allows insertions of any type into the RGA. This is used to move the start and end nodes
- left
the vertex specifying the position
- insertee
the vertex to be inserted right to position
- returns
A new RAG containing the inserted element
- def addRight(position: Vertex, a: A): LatticeSequence[A, VertexSet]
- def append(value: A): LatticeSequence[A, VertexSet]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def before(u: Vertex, v: Vertex): Boolean
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def contains(v: Vertex): Boolean
- val edges: Map[Vertex, Vertex]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def iterator: Iterator[A]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def prepend(value: A): LatticeSequence[A, VertexSet]
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def successor(v: Vertex): Vertex
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])