GraphNodes

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. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def attr[T <: AnyRef, U](name: String, f: (T) ⇒ U): CachedAttribute[T, U]

   Definition Classes

   AttributionCore

8. def attr[T <: AnyRef, U](f: (T) ⇒ U): CachedAttribute[T, U]

   Definition Classes

   AttributionCore

   Annotations

   @macroImpl( ... )

9. def childAttr[T <: Attributable, U](name: String, f: (T) ⇒ (Attributable) ⇒ U): CachedAttribute[T, U]

   Definition Classes

   AttributionCore

10. def childAttr[T <: Attributable, U](f: (T) ⇒ (Attributable) ⇒ U): CachedAttribute[T, U]

    Definition Classes

    AttributionCore

    Annotations

    @macroImpl( ... )

11. lazy val children: CachedAttribute[T, Seq[T]]

    compute the children of a node.

    compute the children of a node.

    This is similar to calling the initTree method on the node but this stores the information as an attribute instead of storing it as a tree. This is a way to avoid conflicts if we have 2 processes trying to initialise the same graph

12. def circular[T <: AnyRef, U](name: String, init: U)(f: (T) ⇒ U): CircularAttribute[T, U]

    Definition Classes

    AttributionCore

13. def circular[T <: AnyRef, U](init: U)(f: (T) ⇒ U): CircularAttribute[T, U]

    Definition Classes

    AttributionCore

    Annotations

    @macroImpl( ... )

14. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

15. def constant[T <: AnyRef, U](name: String, u: ⇒ U): Attribute[T, U]

    Definition Classes

    AttributionCommon

16. def constant[T <: AnyRef, U](u: ⇒ U): Attribute[T, U]

    Definition Classes

    AttributionCommon

    Annotations

    @macroImpl( ... )

17. lazy val descendents: CachedAttribute[T, Seq[T]]

    compute all the descendents of a node They are all the recursive children reachable from this node

18. lazy val descendentsUntil: CachedParamAttribute[(T) ⇒ Boolean, T, Seq[T]]

19. def dynAttr[T <: AnyRef, U](name: String, f: (T) ⇒ U): CachedDynamicAttribute[T, U]

    Definition Classes

    AttributionCore

20. def dynAttr[T <: AnyRef, U](f: (T) ⇒ U): CachedDynamicAttribute[T, U]

    Definition Classes

    AttributionCore

    Annotations

    @macroImpl( ... )

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

    Definition Classes

    AnyRef

22. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

23. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

25. def hashCode(): Int

    Definition Classes

    AnyRef → Any

26. def initAttributable[S <: T](s: S): S

    initialise the parent/child relationship recursively from node s

27. def initTree[T <: Attributable](t: T): Unit

    Definition Classes

    AttributionCommon

28. implicit def internalToDynamicAttribute[T <: AnyRef, U](f: (T) ⇒ U): CachedDynamicAttribute[T, U]

    Definition Classes

    AttributionCore

29. lazy val isCyclic: CachedAttribute[T, Boolean]

    return true if a CompNode has a cycle in its graph, this will be detected by Kiama throwing an exception when fetching the descendents of a node

30. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

31. lazy val isUsedAtMostOnce: CachedAttribute[T, Boolean]

    true if a node is used at most once

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

    Definition Classes

    AnyRef

33. final def notify(): Unit

    Definition Classes

    AnyRef

34. final def notifyAll(): Unit

    Definition Classes

    AnyRef

35. def paramAttr[V, T <: AnyRef, U](name: String, f: (V) ⇒ (T) ⇒ U): CachedParamAttribute[V, T, U]

    Definition Classes

    AttributionCore

36. def paramAttr[V, T <: AnyRef, U](f: (V) ⇒ (T) ⇒ U): CachedParamAttribute[V, T, U]

    Definition Classes

    AttributionCore

    Annotations

    @macroImpl( ... )

37. lazy val parent: CachedAttribute[T, Option[T]]

    compute the parent of a node.

    compute the parent of a node. This relationship is actually maintained while getting the children of a node if the parent node has not been set while recursing for children, then it is None

38. lazy val parents: CachedAttribute[T, Seq[T]]

    compute the parents of a node, that is all the chain of parents from this node up to the root of the graph

39. def reinit[S <: T](s: S): S

    reinitialise all the attributes related to a node, starting from all the parent/children relationships

    reinitialise all the attributes related to a node, starting from all the parent/children relationships

    reset the attributes, then recreate the parent/children relationships recursively

40. def resetMemo(): Unit

    Definition Classes

    Memoiser

41. def resetUses: Unit

    reinit usages

    reinit usages

    Attributes

    protected

42. lazy val root: CachedAttribute[T, T]

    the root of the graph, computed from a given node

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

    Definition Classes

    AnyRef

44. def toString(): String

    Definition Classes

    AnyRef → Any

45. lazy val transitiveUses: CachedAttribute[T, Set[T]]

    compute all the indirect uses of a given node, that is all the nodes which have this node as a descendent

46. def tree[T <: Attributable, U <: Attributable](name: String, f: (T) ⇒ U): CachedAttribute[T, U]

    Definition Classes

    AttributionCore

47. def tree[T <: Attributable, U <: Attributable](f: (T) ⇒ U): CachedAttribute[T, U]

    Definition Classes

    AttributionCore

    Annotations

    @macroImpl( ... )

48. lazy val uses: CachedAttribute[T, Set[T]]

    the nodes which have this node as a direct child

    the nodes which have this node as a direct child

    for efficiency, this uses a table of all the nodes using a given one, computed from the root

49. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )