quiver

GDecomp

case class GDecomp[N, A, B](ctx: Context[N, A, B], rest: Graph[N, A, B]) extends Product with Serializable

The decomposition of a graph into a detached context focused on one node, and the rest of the graph.

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GDecomp
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
Implicitly
  1. by any2stringadd
  2. by any2stringfmt
  3. by any2ArrowAssoc
  4. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GDecomp(ctx: Context[N, A, B], rest: Graph[N, A, B])

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  5. def ->[B](y: B): (GDecomp[N, A, B], B)

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to ArrowAssoc[GDecomp[N, A, B]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  8. def addPred(node: LNode[N, A], edge: B): GDecomp[N, A, B]

  9. def addSucc(node: LNode[N, A], edge: B): GDecomp[N, A, B]

  10. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  11. def back(b: B): Vector[GDecomp[N, A, B]]

    Decompose the graph on predecessors of the focused node, following incoming edges labeled with b.

    Decompose the graph on predecessors of the focused node, following incoming edges labeled with b. O(n) in the degree of the focused node.

  12. def clone(): AnyRef

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

  13. val ctx: Context[N, A, B]

  14. def ensuring(cond: (GDecomp[N, A, B]) ⇒ Boolean, msg: ⇒ Any): GDecomp[N, A, B]

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to Ensuring[GDecomp[N, A, B]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  15. def ensuring(cond: (GDecomp[N, A, B]) ⇒ Boolean): GDecomp[N, A, B]

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to Ensuring[GDecomp[N, A, B]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  16. def ensuring(cond: Boolean, msg: ⇒ Any): GDecomp[N, A, B]

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to Ensuring[GDecomp[N, A, B]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  17. def ensuring(cond: Boolean): GDecomp[N, A, B]

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to Ensuring[GDecomp[N, A, B]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Definition Classes
    AnyRef

  19. def extend[C](f: (GDecomp[N, A, B]) ⇒ C): GDecomp[N, C, B]

    Recursively decompose the graph, passing each decomposition to the given function, storing the results as labels.

    Recursively decompose the graph, passing each decomposition to the given function, storing the results as labels. The resulting decomposition has the exact same structure as this one, just redecorated with new labels. This differs from redecorate in that calls to f see successively smaller subgraphs as each decomposition removes a node.

  20. def finalize(): Unit

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

  21. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  22. def forward(b: B): Vector[GDecomp[N, A, B]]

    Decompose the graph on successors of the focused node, following outgoing edges labeled with b.

    Decompose the graph on successors of the focused node, following outgoing edges labeled with b. O(n) in the degree of the focused node.

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

    Definition Classes
    AnyRef → Any

  24. def ins: Vector[GDecomp[N, A, B]]

    Decompose the graph on predecessors of the focused node.

    Decompose the graph on predecessors of the focused node. O(n) in the outdegree of the focused node.

  25. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  26. def label: A

    Get the label of the node under focus

  27. def map[C](f: (A) ⇒ C): GDecomp[N, C, B]

    Map over the labels in this decomposition

  28. def move(f: (Context[N, A, B]) ⇒ Vector[N]): Vector[GDecomp[N, A, B]]

    Decompose the graph on the nodes returned by f.

    Decompose the graph on the nodes returned by f. O(n) in the degree of the focused node.

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

    Definition Classes
    AnyRef

  30. final def notify(): Unit

    Definition Classes
    AnyRef

  31. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  32. def outs: Vector[GDecomp[N, A, B]]

    Decompose the graph on successors of the focused node.

    Decompose the graph on successors of the focused node. O(n) in the indegree of the focused node.

  33. def redecorate[C](f: (GDecomp[N, A, B]) ⇒ C): GDecomp[N, C, B]

    Decompose the graph on each node in turn, and apply the given function on each such "rotation", storing the results as labels.

    Decompose the graph on each node in turn, and apply the given function on each such "rotation", storing the results as labels. The resulting decomposition has the exact same structure as this one, just redecorated with new labels. This differs from extend in that each call to f sees the entire graph from different perspectives.

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

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

    Definition Classes
    AnyRef

  36. def toDecomp: Decomp[N, A, B]

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

  38. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  41. def →[B](y: B): (GDecomp[N, A, B], B)

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to ArrowAssoc[GDecomp[N, A, B]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (gDecomp: StringAdd).self
    Definition Classes
    StringAdd

  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (gDecomp: StringFormat).self
    Definition Classes
    StringFormat

Deprecated Value Members

  1. def x: GDecomp[N, A, B]

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to ArrowAssoc[GDecomp[N, A, B]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (gDecomp: ArrowAssoc[GDecomp[N, A, B]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: GDecomp[N, A, B]

    Implicit information
    This member is added by an implicit conversion from GDecomp[N, A, B] to Ensuring[GDecomp[N, A, B]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (gDecomp: Ensuring[GDecomp[N, A, B]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from GDecomp[N, A, B] to StringAdd

Inherited by implicit conversion any2stringfmt from GDecomp[N, A, B] to StringFormat

Inherited by implicit conversion any2ArrowAssoc from GDecomp[N, A, B] to ArrowAssoc[GDecomp[N, A, B]]

Inherited by implicit conversion any2Ensuring from GDecomp[N, A, B] to Ensuring[GDecomp[N, A, B]]

Ungrouped