GDecomp

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def +(other: String): String

   

   Implicit information

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

   Definition Classes

   any2stringadd

4. 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 ArrowAssoc in scala.Predef.

   Definition Classes

   ArrowAssoc

   Annotations

   @inline()

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

   

   Definition Classes

   AnyRef → Any

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

   

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

   

8. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

9. 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.

10. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

12. 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 Ensuring in scala.Predef.

    Definition Classes

    Ensuring

13. 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 Ensuring in scala.Predef.

    Definition Classes

    Ensuring

14. 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 Ensuring in scala.Predef.

    Definition Classes

    Ensuring

15. 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 Ensuring in scala.Predef.

    Definition Classes

    Ensuring

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

    

    Definition Classes

    AnyRef

17. 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.

18. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

19. def formatted(fmtstr: String): String

    

    Implicit information

    This member is added by an implicit conversion from GDecomp[N, A, B] to StringFormat[GDecomp[N, A, B]] performed by method StringFormat in scala.Predef.

    Definition Classes

    StringFormat

    Annotations

    @inline()

20. 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.

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

    

    Definition Classes

    AnyRef → Any

22. 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.

23. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

24. def label: A

    

    Get the label of the node under focus

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

    

    Map over the labels in this decomposition

26. 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.

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

    

    Definition Classes

    AnyRef

28. final def notify(): Unit

    

    Definition Classes

    AnyRef

29. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

30. 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.

31. 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.

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

    

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

    

    Definition Classes

    AnyRef

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

    

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

    

36. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

39. 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 ArrowAssoc in scala.Predef.

    Definition Classes

    ArrowAssoc