Class

quiver

BiDecomp

Related Doc: package quiver

Permalink

case class BiDecomp[N, A, B](first: Context[N, A, B], last: Context[N, A, B], rest: Graph[N, A, B]) extends Product with Serializable

The decomposition of a graph into two detached contexts focused on distinguished "first" and "last" nodes.

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BiDecomp
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BiDecomp(first: Context[N, A, B], last: Context[N, A, B], rest: Graph[N, A, B])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. def addPred(node: LNode[N, A], edge: B): BiDecomp[N, A, B]

    Permalink

    Prepends a predecessor to the first node in this graph and makes that the first node.

  5. def addSucc(node: LNode[N, A], edge: B): BiDecomp[N, A, B]

    Permalink

    Appends a successor to the last node in this graph and makes that the last node.

  6. def append(b: BiDecomp[N, A, B], edge: B): BiDecomp[N, A, B]

    Permalink

    Appends one decomposition to another.

    Appends one decomposition to another. The first node of this graph will be the first node of the result. The last node of the given graph will be the last node of the result. The given edge will be added from the last node of this graph to the first node of the given graph.

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  8. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  10. def finalize(): Unit

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

  11. val first: Context[N, A, B]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  14. val last: Context[N, A, B]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. val rest: Graph[N, A, B]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  20. def toGraph: Graph[N, A, B]

    Permalink

  21. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped