Packages

class LiteralNode extends NullaryNode with SimplyTypedNode

A literal value expression.

Source
Node.scala
Linear Supertypes
SimplyTypedNode, NullaryNode, Node, Dumpable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LiteralNode
  2. SimplyTypedNode
  3. NullaryNode
  4. Node
  5. Dumpable
  6. AnyRef
  7. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new LiteralNode(buildType: Type, value: Any, volatileHint: Boolean = false)

    volatileHint

    Indicates whether this value should be considered volatile, i.e. it contains user-generated data or may change in future executions of what is otherwise the same query. A database back-end should usually turn volatile constants into bind variables.

Type Members

  1. type Self = LiteralNode
    Definition Classes
    LiteralNode → SimplyTypedNode → Node

Value Members

  1. final def :@(newType: Type): Self

    Return this Node with a Type assigned (if no other type has been seen for it yet) or a typed copy.

    Return this Node with a Type assigned (if no other type has been seen for it yet) or a typed copy.

    Definition Classes
    Node
  2. val buildType: Type
    Definition Classes
    LiteralNode → SimplyTypedNode
  3. def childNames: Iterable[String]

    Names for the child nodes to show in AST dumps.

    Names for the child nodes to show in AST dumps. Defaults to a numbered sequence starting at 0 but can be overridden by subclasses to produce more suitable names.

    Definition Classes
    Node
  4. def children: ConstArray[Nothing]

    All child nodes of this node.

    All child nodes of this node. Must be implemented by subclasses.

    Definition Classes
    NullaryNode → Node
  5. final def childrenForeach[R](f: (Node) => R): Unit

    Apply a side-effecting function to all direct children from left to right.

    Apply a side-effecting function to all direct children from left to right. Note that

    n.childrenForeach(f)

    is equivalent to 

    n.children.foreach(f)

    but can be implemented more efficiently in Node subclasses.

    Definition Classes
    NullaryNode → Node
  6. def equals(o: Any): Boolean
    Definition Classes
    LiteralNode → AnyRef → Any
  7. def getDumpInfo: DumpInfo

    Return the name, main info, attribute info and named children

    Return the name, main info, attribute info and named children

    Definition Classes
    LiteralNode → Node → Dumpable
  8. def hasType: Boolean

    Check if this node has a type without marking the type as seen.

    Check if this node has a type without marking the type as seen.

    Definition Classes
    Node
  9. def hashCode(): Int
    Definition Classes
    LiteralNode → AnyRef → Any
  10. final def infer(scope: Scope = Map.empty, typeChildren: Boolean = false): Self

    Rebuild this node and all children with their computed type.

    Rebuild this node and all children with their computed type. If this node already has a type, the children are only type-checked again if typeChildren is true. if retype is also true, the existing type of this node is replaced. If this node does not yet have a type, the types of all children are computed first.

    Definition Classes
    Node
  11. final def mapChildren(f: (Node) => Node, keepType: Boolean = false): Self

    Apply a mapping function to all children of this node and recreate the node with the new children.

    Apply a mapping function to all children of this node and recreate the node with the new children. If all new children are identical to the old ones, this node is returned. If keepType is true, the type of this node is kept even when the children have changed.

    Definition Classes
    NullaryNode → Node
  12. def nodeType: Type

    The current type of this node.

    The current type of this node.

    Definition Classes
    Node
  13. def self: LiteralNode
    Definition Classes
    LiteralNode → Node
  14. final def toString(): String
    Definition Classes
    Node → AnyRef → Any
  15. final def untyped: Self

    Return this Node with no Type assigned (if it has not yet been observed) or an untyped copy.

    Return this Node with no Type assigned (if it has not yet been observed) or an untyped copy.

    Definition Classes
    Node
  16. val value: Any
  17. val volatileHint: Boolean
  18. final def withChildren(ch2: ConstArray[Node]): Self

    Rebuild this node with new child nodes unless all children are identical to the current ones, in which case this node is returned.

    Rebuild this node with new child nodes unless all children are identical to the current ones, in which case this node is returned.

    Definition Classes
    Node
  19. final def withInferredType(scope: Scope, typeChildren: Boolean): Self
    Definition Classes
    SimplyTypedNode → Node