org.kiama.attribution

UncachedAttribution

trait UncachedAttribution extends AttributionBase

Reusable implementation of attribution of syntax trees in a functional style with attribute values computed each time they are accessed.

Source
Attribution.scala
Linear Supertypes
AttributionBase, AnyRef, Any
Known Subclasses
UncachedAttribution
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. UncachedAttribution
  2. AttributionBase
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. abstract class Attribute[T <: AnyRef, U] extends (T) ⇒ U

    Common functionality for all attributes.

  2. abstract class CircularAttribute[T <: AnyRef, U] extends Attribute[T, U]

    An attribute of a node type T with value of type U which has a circular definition.

  3. abstract class ConstantAttribute[T <: AnyRef, U] extends Attribute[T, U]

    A constant attribute of a node type T with value of type U.

  4. class ParamAttributeKey extends AnyRef

    Support for parameterised attributes: argument, node pair comparison.

  5. abstract class UncachedAttribute[T <: AnyRef, U] extends Attribute[T, U]

    An attribute of a node type T with value of type U, supported by a circularity test.

  6. abstract class UncachedParamAttribute[A, T <: AnyRef, U] extends (A) ⇒ Attribute[T, U]

    A variation of the UncachedAttribute class for parameterised attributes.

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): UncachedAttribute[T, U]

    Define a named uncached attribute of T nodes of type U by the function f, which should not depend on the value of this attribute.

    Define a named uncached attribute of T nodes of type U by the function f, which should not depend on the value of this attribute. The computed attribute value is cached so it will be computed at most once. name is used in debugging output to identify this attribute.

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

    Define an anonymous uncached attribute of T nodes of type U by the function f, which should not depend on the value of this attribute.

    Define an anonymous uncached attribute of T nodes of type U by the function f, which should not depend on the value of this attribute. The computed attribute value is cached so it will be computed at most once.

  9. def attr[T <: AnyRef, U](optNameDef: Option[String])(f: (T) ⇒ U): UncachedAttribute[T, U]

    Define an uncached attribute of T nodes of type U by the function f, which should not depend on the value of this attribute.

    Define an uncached attribute of T nodes of type U by the function f, which should not depend on the value of this attribute. The computed attribute value is cached so it will be computed at most once. If optNameDef is not None, then optNameDef.get is used in debugging output to identify this attribute.

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

    Define a named uncached attribute of T nodes of type U by the function f, which takes the current node and its parent as its arguments.

    Define a named uncached attribute of T nodes of type U by the function f, which takes the current node and its parent as its arguments. T must be a sub-type of Attributable so that parents can be accessed generically. name is used in debugging output to identify this attribute and its parameter.

  11. def childAttr[T <: Attributable, U](f: (T) ⇒ (Attributable) ⇒ U): UncachedAttribute[T, U]

    Define an anonymous uncached attribute of T nodes of type U by the function f, which takes the current node and its parent as its arguments.

    Define an anonymous uncached attribute of T nodes of type U by the function f, which takes the current node and its parent as its arguments. T must be a sub-type of Attributable so that parents can be accessed generically.

  12. def childAttr[T <: Attributable, U](optNameDef: Option[String])(f: (T) ⇒ (Attributable) ⇒ U): UncachedAttribute[T, U]

    Define an uncached attribute of T nodes of type U by the function f, which takes the current node and its parent as its arguments.

    Define an uncached attribute of T nodes of type U by the function f, which takes the current node and its parent as its arguments. T must be a sub-type of Attributable so that parents can be accessed generically. If optNameDef is not None, then optNameDef.get is used in debugging output to identify this attribute.

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

    Define a named circular attribute of T nodes of type U by the function f.

    Define a named circular attribute of T nodes of type U by the function f. f is allowed to depend on the value of this attribute, which will be given by init initially and will be evaluated iteratively until a fixed point is reached (in conjunction with other circular attributes on which it depends). The final value is cached. name is used in debugging output to identify this attribute.

    Definition Classes
    AttributionBase

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

    Define an anonymous circular attribute of T nodes of type U by the function f.

    Define an anonymous circular attribute of T nodes of type U by the function f. f is allowed to depend on the value of this attribute, which will be given by init initially and will be evaluated iteratively until a fixed point is reached (in conjunction with other circular attributes on which it depends). The final value is cached.

    Definition Classes
    AttributionBase

  15. def circular[T <: AnyRef, U](optNameDef: Option[String])(init: U)(f: (T) ⇒ U): (T) ⇒ U

    Define an optionally named circular attribute of T nodes of type U by the function f.

    Define an optionally named circular attribute of T nodes of type U by the function f. f is allowed to depend on the value of this attribute, which will be given by init initially and will be evaluated iteratively until a fixed point is reached (in conjunction with other circular attributes on which it depends). The final value is cached. If optNameDef is not None, then optNameDef.get is used in debugging output to identify this attribute.

    Definition Classes
    AttributionBase

  16. def clone(): AnyRef

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

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

    Define an optionally named constanat attribute of T nodes of type U given by the value u.

    Define an optionally named constanat attribute of T nodes of type U given by the value u. u is evaluated at most once. name is used in debugging output to identify this attribute.

    Definition Classes
    AttributionBase

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

    Define an anonymous constanat attribute of T nodes of type U given by the value u.

    Define an anonymous constanat attribute of T nodes of type U given by the value u. u is evaluated at most once.

    Definition Classes
    AttributionBase

  19. def constant[T <: AnyRef, U](optNameDef: Option[String])(u: ⇒ U): Attribute[T, U]

    Define an optionally named constanat attribute of T nodes of type U given by the value u.

    Define an optionally named constanat attribute of T nodes of type U given by the value u. u is evaluated at most once. If optNameDef is not None, then optNameDef.get is used in debugging output to identify this attribute.

    Definition Classes
    AttributionBase

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

    Definition Classes
    AnyRef

  21. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  22. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  24. def hashCode(): Int

    Definition Classes
    AnyRef → Any

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

    Initialise the Attributable tree rooted at t so that it is ready for attribution.

    Initialise the Attributable tree rooted at t so that it is ready for attribution. At present, the only initialisation performed is to set node attributes such as parent and children so that nodes can generically refer to their neighbours. If you wish to use any of these properties, you must call this method before doing so. Otherwise, the node properties should not be used and there is no need to call this method.

    Definition Classes
    AttributionBase

  26. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  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 paramAttr[A, T <: AnyRef, U](name: String)(f: (A) ⇒ (T) ⇒ U): UncachedParamAttribute[A, T, U]

    Define a named parameterised uncached attribute of T nodes of type U by the function f, which takes an argument of type A.

    Define a named parameterised uncached attribute of T nodes of type U by the function f, which takes an argument of type A. The computed attribute value for a given T and A pair is cached so it will be computed at most once. name and the A value are used in debugging output to identify this attribute and its parameter.

  31. def paramAttr[A, T <: AnyRef, U](f: (A) ⇒ (T) ⇒ U): UncachedParamAttribute[A, T, U]

    Define an anonymous parameterised uncached attribute of T nodes of type U by the function f, which takes an argument of type A.

    Define an anonymous parameterised uncached attribute of T nodes of type U by the function f, which takes an argument of type A. The computed attribute value for a given T and A pair is cached so it will be computed at most once.

  32. def paramAttr[A, T <: AnyRef, U](optNameDef: Option[String])(f: (A) ⇒ (T) ⇒ U): UncachedParamAttribute[A, T, U]

    Define a parameterised uncached attribute of T nodes of type U by the function f, which takes an argument of type A.

    Define a parameterised uncached attribute of T nodes of type U by the function f, which takes an argument of type A. The computed attribute value for a given T and A pair is cached so it will be computed at most once. If optNameDef is not None, then optNameDef.get and the A value are used in debugging output to identify this attribute.

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

    Definition Classes
    AnyRef

  34. def toString(): String

    Definition Classes
    AnyRef → Any

  35. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AttributionBase

Inherited from AnyRef

Inherited from Any

Ungrouped