Class

razie.tconf.parser

LazyAstNode

Related Doc: package parser

Permalink

case class LazyAstNode[T <: DSpec, U <: DUser](f: (StrAstNode, FoldingContext[T, U]) ⇒ StrAstNode) extends BaseAstNode with Product with Serializable

lazy AST node - value computed when they're folded.

By default a lazy state will cause a non cacheable wiki

Linear Supertypes
Serializable, Serializable, Product, Equals, BaseAstNode, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LazyAstNode
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. BaseAstNode
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LazyAstNode(f: (StrAstNode, FoldingContext[T, U]) ⇒ StrAstNode)

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: BaseAstNode): BaseAstNode

    Permalink

    composing AST elements

    composing AST elements

    Definition Classes
    BaseAstNode

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

    Permalink
    Definition Classes
    AnyRef → Any

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def cacheOk: LazyAstNode[T, U]

    Permalink

  7. def clone(): AnyRef

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

  8. var dirty: Boolean

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  10. val f: (StrAstNode, FoldingContext[T, U]) ⇒ StrAstNode

    Permalink

  11. def finalize(): Unit

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

  12. def fold(ctx: FoldingContext[_, _]): StrAstNode

    Permalink

    lazy unfolding of AST tree

    lazy unfolding of AST tree

    Definition Classes
    BaseAstNode

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

    Permalink
    Definition Classes
    AnyRef → Any

  14. def ifold(current: StrAstNode, ctx: FoldingContext[_, _]): StrAstNode

    Permalink
    Definition Classes
    LazyAstNode → BaseAstNode

  15. def ilinks: List[Any]

    Permalink
    Definition Classes
    LazyAstNode → BaseAstNode

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. def print(level: Int): String

    Permalink
    Definition Classes
    BaseAstNode

  21. def printHtml(level: Int): String

    Permalink
    Definition Classes
    BaseAstNode

  22. def props: Map[String, String]

    Permalink
    Definition Classes
    LazyAstNode → BaseAstNode

  23. def s: String

    Permalink
    Definition Classes
    LazyAstNode → BaseAstNode

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

    Permalink
    Definition Classes
    AnyRef

  25. def toString(): String

    Permalink
    Definition Classes
    LazyAstNode → AnyRef → Any

  26. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from BaseAstNode

Inherited from AnyRef

Inherited from Any

Ungrouped