Attribution

Type Members

class CachedAttribute[T <: AnyRef, U] extends Attribute[T, U] with IdMemoised[T, Option[U]]

An attribute of a node type T with value of type U, supported by a memo table and circularity test.
class CachedDynamicAttribute[T <: AnyRef, U] extends CachedAttribute[T, U]

A cached dynamic attribute of a node type T with value of type U, supported by a memo table and circularity test.
class CachedParamAttribute[A, T <: AnyRef, U] extends (A) ⇒ Attribute[T, U] with Memoised[ParamAttributeKey, Option[U]]

A variation of the CachedAttribute class for parameterised attributes.
class CircularAttribute[T <: AnyRef, U] extends Attribute[T, U] with IdMemoised[T, U]

An attribute of a node type T with value of type U which has a circular definition.
class ConstantAttribute[T <: AnyRef, U] extends Attribute[T, U]

A constant attribute of a node type T with value of type U.
trait IdMemoised[T, U] extends MemoisedBase[T, U]

A memoised entity that uses identity to compare argument values.
trait Memoised[T, U] extends MemoisedBase[T, U]

A memoised entity that uses equality to compare argument values.
trait MemoisedBase[T, U] extends AnyRef

Common interface for encapsulation of memoisation for a single memoised entity.

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def attr[T <: AnyRef, U](name: String, f: (T) ⇒ U): CachedAttribute[T, U]

As for the other attr with the first argument specifying a name for the constructed attribute.
As for the other attr with the first argument specifying a name for the constructed attribute.

Definition Classes
AttributionCore
def attr[T <: AnyRef, U](f: (T) ⇒ U): CachedAttribute[T, U]

Define a cached attribute of T nodes of type U by the function f, which should not depend on the value of this attribute.
Define a cached 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.

Definition Classes
AttributionCore
Annotations
@macroImpl()
def childAttr[T <: Attributable, U](name: String, f: (T) ⇒ (Attributable) ⇒ U): CachedAttribute[T, U]

As for the other childAttr with the first argument specifying a name for the constructed attribute.
As for the other childAttr with the first argument specifying a name for the constructed attribute.

Definition Classes
AttributionCore
def childAttr[T <: Attributable, U](f: (T) ⇒ (Attributable) ⇒ U): CachedAttribute[T, U]

Define an attribute of T nodes of type U by the function f, which takes the current node and its parent as its arguments.
Define an 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.

Definition Classes
AttributionCore
Annotations
@macroImpl()
def circular[T <: AnyRef, U](name: String, init: U)(f: (T) ⇒ U): (T) ⇒ U

As for the other circular with the first argument specifying a name for the constructed attribute.
As for the other circular with the first argument specifying a name for the constructed attribute.

Definition Classes
AttributionCore
def circular[T <: AnyRef, U](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.

Definition Classes
AttributionCore
Annotations
@macroImpl()
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def constant[T <: AnyRef, U](name: String, u: ⇒ U): Attribute[T, U]

As for the other constant with the first argument specifying a name for the constructed attribute.
As for the other constant with the first argument specifying a name for the constructed attribute.

Definition Classes
AttributionCommon
def constant[T <: AnyRef, U](u: ⇒ U): Attribute[T, U]

Define a constant attribute of T nodes of type U given by the value u.
Define a constant attribute of T nodes of type U given by the value u. u is evaluated at most once.

Definition Classes
AttributionCommon
Annotations
@macroImpl()
def dynAttr[T <: AnyRef, U](name: String, f: (T) ⇒ U): CachedDynamicAttribute[T, U]

As for the other dynAttr with the first argument specifying a name for the constructed attribute.
As for the other dynAttr with the first argument specifying a name for the constructed attribute.

Definition Classes
AttributionCore
def dynAttr[T <: AnyRef, U](f: (T) ⇒ U): CachedDynamicAttribute[T, U]

Define a cached dynamic attribute of T nodes of type U by the partial function f, which should not depend on the value of this attribute.
Define a cached dynamic attribute of T nodes of type U by the partial 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.

Definition Classes
AttributionCore
Annotations
@macroImpl()
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
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
AttributionCommon
implicit def internalToDynamicAttribute[T <: AnyRef, U](f: (T) ⇒ U): CachedDynamicAttribute[T, U]

Implicitly converts functions to dynamic attributes.
Implicitly converts functions to dynamic attributes. This conversion allows us to use simpler types for dynamic attributes, but still extend them later.

Definition Classes
AttributionCore
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

As for the other paramAttr with the first argument specifying a name for the constructed attribute.
As for the other paramAttr with the first argument specifying a name for the constructed attribute.

Definition Classes
AttributionCore
def paramAttr[V, T <: AnyRef, U](f: (V) ⇒ (T) ⇒ U): CachedParamAttribute[V, T, U]

Define a parameterised attribute of T nodes of type U by the function f, which takes an argument of type A.
Define a parameterised 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.

Definition Classes
AttributionCore
Annotations
@macroImpl()
def resetMemo(): Unit

Lazily reset all memoisation tables.
Lazily reset all memoisation tables. The actual resets will only happen the next time the value of each attribute is accessed.

Definition Classes
Memoiser
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def tree[T <: Attributable, U <: Attributable](name: String, f: (T) ⇒ U): CachedAttribute[T, U]

As for the other tree with the first argument specifying a name for the constructed attribute.
As for the other tree with the first argument specifying a name for the constructed attribute.

Definition Classes
AttributionCore
def tree[T <: Attributable, U <: Attributable](f: (T) ⇒ U): CachedAttribute[T, U]

Define an optionally named attribute as per attr, except that the attribute must have a tree value and will be spliced into the tree to have the same parent as the node on which it is defined.
Define an optionally named attribute as per attr, except that the attribute must have a tree value and will be spliced into the tree to have the same parent as the node on which it is defined. This kind of attribute is used to generate new trees that must share context with the node on which they are defined.

Definition Classes
AttributionCore
Annotations
@macroImpl()
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws()

object Attribution extends AttributionCore

Type Members

class CachedAttribute[T <: AnyRef, U] extends Attribute[T, U] with IdMemoised[T, Option[U]]

class CachedDynamicAttribute[T <: AnyRef, U] extends CachedAttribute[T, U]

class CachedParamAttribute[A, T <: AnyRef, U] extends (A) ⇒ Attribute[T, U] with Memoised[ParamAttributeKey, Option[U]]

class CircularAttribute[T <: AnyRef, U] extends Attribute[T, U] with IdMemoised[T, U]

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

trait IdMemoised[T, U] extends MemoisedBase[T, U]

trait Memoised[T, U] extends MemoisedBase[T, U]

trait MemoisedBase[T, U] extends AnyRef

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

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

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

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

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

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

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

def clone(): AnyRef

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

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

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

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

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

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def resetMemo(): Unit

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

def toString(): String

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AttributionCore

Inherited from Memoiser

Inherited from AttributionCommon

Inherited from AnyRef

Inherited from Any

Ungrouped