scala.tools.reflect.quasiquotes.Reifiers

UnapplyReifier

class UnapplyReifier extends Quasiquotes.Reifier

Linear Supertypes
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. UnapplyReifier
  2. Reifier
  3. Reifier
  4. Utils
  5. StdAttachments
  6. SymbolTables
  7. Extractors
  8. NodePrinters
  9. Errors
  10. Phases
  11. Reify
  12. GenUtils
  13. GenPositions
  14. GenAnnotationInfos
  15. GenTrees
  16. GenNames
  17. GenTypes
  18. GenSymbols
  19. Metalevels
  20. Calculate
  21. Reshape
  22. States
  23. AnyRef
  24. Any
Implicitly
  1. by StringAdd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new UnapplyReifier()

Type Members

  1. sealed abstract class FreeDefExtractor extends AnyRef

    Definition Classes
    Extractors
  2. case class Reification(name: tools.nsc.Global.Name, binding: tools.nsc.Global.Tree, tree: tools.nsc.Global.Tree) extends Product with Serializable

    Definition Classes
    GenSymbols
  3. case class ReifyAliasAttachment(sym: tools.nsc.Global.Symbol, alias: tools.nsc.Global.TermName) extends Product with Serializable

    Definition Classes
    StdAttachments
  4. case class ReifyBindingAttachment(binding: tools.nsc.Global.Tree) extends Product with Serializable

    Definition Classes
    StdAttachments
  5. implicit class RichCalculateSymbol extends AnyRef

    Definition Classes
    Calculate
  6. implicit class RichCalculateType extends AnyRef

    Definition Classes
    Calculate
  7. class State extends AnyRef

    Definition Classes
    States
  8. class SymbolTable extends AnyRef

    Definition Classes
    SymbolTables

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. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from Quasiquotes.UnapplyReifier to StringAdd[Quasiquotes.UnapplyReifier] performed by method StringAdd in scala.Predef.
    Definition Classes
    StringAdd
  5. def ->[B](y: B): (Quasiquotes.UnapplyReifier, B)

    Implicit information
    This member is added by an implicit conversion from Quasiquotes.UnapplyReifier to ArrowAssoc[Quasiquotes.UnapplyReifier] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  8. object ApplyCall

    Definition Classes
    Extractors
  9. object BoundTerm

    Definition Classes
    Extractors
  10. object BoundType

    Definition Classes
    Extractors
  11. def CannotConvertManifestToTagWithoutScalaReflect(tpe: nsc.Global.Type, manifestInScope: nsc.Global.Tree): Nothing

    Definition Classes
    Errors
  12. def CannotReifyCompoundTypeTreeWithNonEmptyBody(ctt: nsc.Global.CompoundTypeTree): Nothing

    Definition Classes
    Errors
  13. def CannotReifyErroneousPrefix(prefix: nsc.Global.Tree): Nothing

    Definition Classes
    Errors
  14. def CannotReifyErroneousReifee(reifee: Any): Nothing

    Definition Classes
    Errors
  15. def CannotReifyInvalidLazyVal(tree: nsc.Global.ValDef): Nothing

    Definition Classes
    Errors
  16. def CannotReifyRuntimeSplice(tree: nsc.Global.Tree): Nothing

    Definition Classes
    Errors
  17. def CannotReifyType(tpe: nsc.Global.Type): Nothing

    Definition Classes
    Errors
  18. def CannotReifyUntypedPrefix(prefix: nsc.Global.Tree): Nothing

    Definition Classes
    Errors
  19. def CannotReifyUntypedReifee(reifee: Any): Nothing

    Definition Classes
    Errors
  20. def CannotReifyWeakType(details: Any): Nothing

    Definition Classes
    Errors
  21. object FreeDef extends Utils.FreeDefExtractor

    Definition Classes
    Extractors
  22. object FreeRef

    Definition Classes
    Extractors
  23. object FreeTermDef extends Utils.FreeDefExtractor

    Definition Classes
    Extractors
  24. object FreeTypeDef extends Utils.FreeDefExtractor

    Definition Classes
    Extractors
  25. object ReifiedTree

    Definition Classes
    Extractors
  26. object ReifiedType

    Definition Classes
    Extractors
  27. object SymDef

    Definition Classes
    Extractors
  28. object SymbolTable

    Definition Classes
    SymbolTables
  29. object TreeSplice

    Definition Classes
    Extractors
  30. object TypeRefToFreeType

    Definition Classes
    Extractors
  31. object TypedOrAnnotated

    Definition Classes
    GenUtils
  32. def action: String

    Definition Classes
    Reifier
  33. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  34. def boundSymbolsInCallstack: List[nsc.Global.Symbol]

    Definition Classes
    Reify
  35. val calculate: nsc.Global.Traverser { ... /* 2 definitions in type refinement */ }

    Merely traverses the reifiee and records local symbols along with their metalevels.

    Merely traverses the reifiee and records local symbols along with their metalevels.

    Definition Classes
    Calculate
  36. def call(fname: String, args: nsc.Global.Tree*): nsc.Global.Tree

    Definition Classes
    GenUtils
  37. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. val concrete: Boolean

    Definition Classes
    ReifierReifier
  39. def current: Any

    Definition Classes
    Reify
  40. def currents: List[Any]

    Definition Classes
    Reify
  41. def defaultErrorPosition: nsc.Global.Position

    Definition Classes
    Errors
  42. def ensureNoExplicitFlags(m: nsc.Global.Modifiers, pos: nsc.Global.Position): Unit

    Definition Classes
    Reifier
  43. def ensuring(cond: (Quasiquotes.UnapplyReifier) ⇒ Boolean, msg: ⇒ Any): Quasiquotes.UnapplyReifier

    Implicit information
    This member is added by an implicit conversion from Quasiquotes.UnapplyReifier to Ensuring[Quasiquotes.UnapplyReifier] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  44. def ensuring(cond: (Quasiquotes.UnapplyReifier) ⇒ Boolean): Quasiquotes.UnapplyReifier

    Implicit information
    This member is added by an implicit conversion from Quasiquotes.UnapplyReifier to Ensuring[Quasiquotes.UnapplyReifier] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  45. def ensuring(cond: Boolean, msg: ⇒ Any): Quasiquotes.UnapplyReifier

    Implicit information
    This member is added by an implicit conversion from Quasiquotes.UnapplyReifier to Ensuring[Quasiquotes.UnapplyReifier] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: Boolean): Quasiquotes.UnapplyReifier

    Implicit information
    This member is added by an implicit conversion from Quasiquotes.UnapplyReifier to Ensuring[Quasiquotes.UnapplyReifier] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  49. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  50. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from Quasiquotes.UnapplyReifier to StringFormat[Quasiquotes.UnapplyReifier] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  51. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  52. def getReifier: reflect.reify.Reifier { val global: UnapplyReifier.this.global.type }

    Definition Classes
    ReifierUtils
  53. val global: Quasiquotes.global.type

    Definition Classes
    ReifierReifierUtils
  54. def group[T](lst: List[T])(similar: (T, T) ⇒ Boolean): List[List[T]]

    Splits list into a list of groups where subsequent elements are considered similar by the corresponding function.

    Splits list into a list of groups where subsequent elements are considered similar by the corresponding function.

    Example:

    > group(List(1, 1, 0, 0, 1, 0)) { _ == _ } List(List(1, 1), List(0, 0), List(1), List(0))

    Definition Classes
    Reifier
  55. def hasReifier: Boolean

    Definition Classes
    ReifierUtils
  56. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  57. def holesHaveTypes: Boolean

    Definition Classes
    Reifier
  58. def isCrossStageTypeBearer(tree: nsc.Global.Tree): Boolean

    Definition Classes
    GenUtils
  59. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  60. def isReifyingExpressions: Boolean

    Definition Classes
    UnapplyReifierReifier
  61. def isReifyingPatterns: Boolean

    Definition Classes
    Reifier
  62. def isSemiConcreteTypeMember(tpe: nsc.Global.Type): Boolean

    Definition Classes
    GenUtils
  63. val metalevels: nsc.Global.Transformer { ... /* 4 definitions in type refinement */ }

    Makes sense of cross-stage bindings.

    Makes sense of cross-stage bindings.


    Analysis of cross-stage bindings becomes convenient if we introduce the notion of metalevels. Metalevel of a tree is a number that gets incremented every time you reify something and gets decremented when you splice something. Metalevel of a symbol is equal to the metalevel of its definition.

    Example 1. Consider the following snippet:

    reify { val x = 2 // metalevel of symbol x is 1, because it's declared inside reify val y = reify{x} // metalevel of symbol y is 1, because it's declared inside reify // metalevel of Ident(x) is 2, because it's inside two reifies y.splice // metalevel of Ident(y) is 0, because it's inside a designator of a splice }

    Cross-stage bindings are introduced when symbol.metalevel != curr_metalevel. Both bindings introduced in Example 1 are cross-stage.

    Depending on what side of the inequality is greater, the following situations might occur:

    1) symbol.metalevel < curr_metalevel. In this case reifier will generate a free variable that captures both the name of the symbol (to be compiled successfully) and its value (to be run successfully). For example, x in Example 1 will be reified as follows: Ident(newFreeVar("x", IntTpe, x))

    2) symbol.metalevel > curr_metalevel. This leads to a metalevel breach that violates intuitive perception of splicing. As defined in macro spec, splicing takes a tree and inserts it into another tree - as simple as that. However, how exactly do we do that in the case of y.splice? In this very scenario we can use dataflow analysis and inline it, but what if y were a var, and what if it were calculated randomly at runtime?

    This question has a genuinely simple answer. Sure, we cannot resolve such splices statically (i.e. during macro expansion of reify), but now we have runtime toolboxes, so noone stops us from picking up that reified tree and evaluating it at runtime (in fact, this is something that Expr.splice does transparently).

    This is akin to early vs late binding dilemma. The prior is faster, plus, the latter (implemented with reflection) might not work because of visibility issues or might be not available on all platforms. But the latter still has its uses, so I'm allowing metalevel breaches, but introducing the -Xlog-runtime-evals to log them.

    upd. We no longer do that. In case of a runaway splice inside a reify, one will get a static error. Why? Unfortunately, the cute idea of transparently converting between static and dynamic splices has failed. 1) Runtime eval that services dynamic splices requires scala-compiler.jar, which might not be on library classpath 2) Runtime eval incurs a severe performance penalty, so it'd better to be explicit about it


    As we can see, the only problem is the fact that lhs'es of splice can be code blocks that can capture variables from the outside. Code inside the lhs of an splice is not reified, while the code from the enclosing reify is.

    Hence some bindings become cross-stage, which is not bad per se (in fact, some cross-stage bindings have sane semantics, as in the example above). However this affects freevars, since they are delicate inter-dimensional beings that refer to both current and next planes of existence. When splicing tears the fabric of the reality apart, some freevars have to go single-dimensional to retain their sanity.

    Example 2. Consider the following snippet:

    reify { val x = 2 reify{x}.splice }

    Since the result of the inner reify is wrapped in a splice, it won't be reified together with the other parts of the outer reify, but will be inserted into that result verbatim.

    The inner reify produces an Expr[Int] that wraps Ident(freeVar("x", IntTpe, x)). However the freevar the reification points to will vanish when the compiler processes the outer reify. That's why we need to replace that freevar with a regular symbol that will point to reified x.

    Example 3. Consider the following fragment:

    reify { val x = 2 val y = reify{x} y.splice }

    In this case the inner reify doesn't appear next to splice, so it will be reified together with x. This means that no special processing is needed here.

    Example 4. Consider the following fragment:

    reify { val x = 2 { val y = 2 val z = reify{reify{x + y}} z.splice }.splice }

    The reasoning from Example 2 still holds here - we do need to inline the freevar that refers to x. However, we must not touch anything inside the splice'd block, because it's not getting reified.

    Definition Classes
    Metalevels
  64. val mirror: nsc.Global.EmptyTree.type

    Definition Classes
    ReifierReifier
  65. def mirrorBuildCall(name: nsc.Global.TermName, args: nsc.Global.Tree*): nsc.Global.Tree

    Definition Classes
    ReifierGenUtils
  66. def mirrorCall(name: nsc.Global.TermName, args: nsc.Global.Tree*): nsc.Global.Tree

    Definition Classes
    ReifierGenUtils
  67. def mirrorFactoryCall(prefix: nsc.Global.TermName, args: nsc.Global.Tree*): nsc.Global.Tree

    Definition Classes
    GenUtils
  68. def mirrorFactoryCall(value: Product, args: nsc.Global.Tree*): nsc.Global.Tree

    Definition Classes
    GenUtils
  69. def mirrorMirrorCall(name: nsc.Global.TermName, args: nsc.Global.Tree*): nsc.Global.Tree

    Definition Classes
    GenUtils
  70. def mirrorMirrorSelect(name: nsc.Global.TermName): nsc.Global.Tree

    Definition Classes
    GenUtils
  71. def mirrorSelect(name: String): nsc.Global.Tree

    Definition Classes
    ReifierGenUtils
  72. def mirrorSelect(name: nsc.Global.TermName): nsc.Global.Tree

    Definition Classes
    GenUtils
  73. def mkList(args: List[nsc.Global.Tree]): nsc.Global.Tree

    Definition Classes
    GenUtils
  74. def mkListMap(args: List[nsc.Global.Tree]): nsc.Global.Tree

    Definition Classes
    GenUtils
  75. lazy val mkReificationPipeline: (nsc.Global.Tree) ⇒ nsc.Global.Tree

    Definition Classes
    Phases
  76. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  77. val nonoverloadedExplicitFlags: Long

    Definition Classes
    Reifier
  78. final def notify(): Unit

    Definition Classes
    AnyRef
  79. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  80. def origin(sym: nsc.Global.Symbol): String

    Definition Classes
    GenUtils
  81. def path(fullname: String, mkName: (String) ⇒ nsc.Global.Name): nsc.Global.Tree

    An (unreified) path that refers to definition with given fully qualified name

    An (unreified) path that refers to definition with given fully qualified name

    mkName

    Creator for last portion of name (either TermName or TypeName)

    Definition Classes
    GenUtils
  82. val reifee: nsc.Global.EmptyTree.type

    Definition Classes
    ReifierReifier
  83. lazy val reification: nsc.Global.Tree

    For reifee and other reification parameters, generate a tree of the form

    For reifee and other reification parameters, generate a tree of the form

    {
    val $u: universe.type = <[ universe ]>
    val $m: $u.Mirror = <[ mirror ]>
    $u.Expr[T](rtree)       // if data is a Tree
    $u.TypeTag[T](rtree)    // if data is a Type
    }

    where

    • universe is the tree that represents the universe the result will be bound to.
    • mirror is the tree that represents the mirror the result will be initially bound to.
    • rtree is code that generates reifee at runtime.
    • T is the type that corresponds to data.

    This is not a method, but a value to indicate the fact that Reifier instances are a one-off.

    Definition Classes
    Reifier
  84. def reificationIsConcrete: Boolean

    Keeps track of whether this reification contains abstract type parameters

    Keeps track of whether this reification contains abstract type parameters

    Definition Classes
    GenTypes
  85. object reifiedNodeToString extends (tools.nsc.Global.Tree) ⇒ String

    Definition Classes
    NodePrinters
  86. lazy val reifier: reflect.reify.Reifier { val global: UnapplyReifier.this.global.type }

    Definition Classes
    Utils
  87. def reify(reifee: Any): nsc.Global.Tree

    Reifies any supported value.

    Reifies any supported value. For internal use only, use reified instead.

    Definition Classes
    Reify
  88. def reifyAnnotList(annots: List[nsc.Global.Tree]): nsc.Global.Tree

    Definition Classes
    Reifier
  89. def reifyAnnotation(tree: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    Reifier
  90. def reifyAnnotationInfo(ann: nsc.Global.AnnotationInfo): nsc.Global.Tree

    Definition Classes
    GenAnnotationInfos
  91. def reifyBinding(tree: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    StdAttachments
  92. def reifyBuildCall(name: nsc.Global.TermName, args: Any*): nsc.Global.Tree

    Definition Classes
    GenUtils
  93. def reifyCase(tree: nsc.Global.Tree, location: Quasiquotes.Location): nsc.Global.Tree

    Definition Classes
    Reifier
  94. val reifyCopypaste: Boolean

    Definition Classes
    Utils
  95. val reifyDebug: Boolean

    Definition Classes
    Utils
  96. def reifyEarlyDef(tree: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    Reifier
  97. def reifyFillingHoles(tree: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    Reifier
  98. def reifyFlags(flags: nsc.Global.FlagSet): nsc.Global.Tree

    Definition Classes
    GenTrees
  99. def reifyFreeTerm(binding: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    GenSymbols
  100. def reifyFreeType(binding: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    GenSymbols
  101. def reifyFunctionType(argtpes: List[nsc.Global.Tree], restpe: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    Reifier
  102. def reifyList(xs: List[Any]): nsc.Global.Tree

    Reifies arbitrary list filling .

    Reifies arbitrary list filling ..$x and ...$y holeMap when they are put in the correct position. Fallbacks to regular reification for non-high cardinality elements.

    Definition Classes
    ReifierGenUtils
  103. def reifyMirrorObject(x: Product): nsc.Global.Tree

    Definition Classes
    GenUtils
  104. def reifyMirrorObject(name: String): nsc.Global.Tree

    Reify a case object defined in Mirror

    Reify a case object defined in Mirror

    Definition Classes
    GenUtils
  105. def reifyModifiers(m: nsc.Global.Modifiers): nsc.Global.Tree

    Definition Classes
    UnapplyReifierGenTrees
  106. def reifyMultiCardinalityList[T](xs: List[T])(fill: PartialFunction[T, nsc.Global.Tree])(fallback: (T) ⇒ nsc.Global.Tree): nsc.Global.Tree

    Reifies list filling all the valid holeMap.

    Reifies list filling all the valid holeMap.

    Reification of non-trivial list is done in two steps:

    1. split the list into groups where every placeholder is always put in a group of it's own and all subsquent non-holeMap are grouped together; element is considered to be a placeholder if it's in the domain of the fill function;

    2. fold the groups into a sequence of lists added together with ++ using fill reification for holeMap and fallback reification for non-holeMap.

    Example:

    reifyMultiCardinalityList(lst) { // first we define patterns that extract high-cardinality holeMap (currently ..) case Placeholder(CorrespondsTo(tree, tpe)) if tpe <:< iterableTreeType => tree } { // in the end we define how single elements are reified, typically with default reify call reify(_) }

    Sample execution of previous concrete list reifier:

    > val lst = List(foo, bar, qq$f3948f9s$1) > reifyMultiCardinalityList(lst) { ... } { ... } q"List($foo, $bar) ++ ${holeMap(qq$f3948f9s$1).tree}"

    Definition Classes
    UnapplyReifierReifier
  107. def reifyName(name: nsc.Global.Name): nsc.Global.Tree

    Definition Classes
    ReifierGenNames
  108. def reifyPosition(pos: nsc.Global.Position): nsc.Global.Tree

    Definition Classes
    GenPositions
  109. def reifyProduct(prefix: String, elements: List[Any]): nsc.Global.Tree

    Definition Classes
    GenUtils
  110. def reifyProduct(x: Product): nsc.Global.Tree

    Definition Classes
    GenUtils
  111. def reifyRefineStat(tree: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    Reifier
  112. def reifySymDef(sym: nsc.Global.Symbol): nsc.Global.Tree

    Definition Classes
    GenSymbols
  113. def reifySymRef(sym: nsc.Global.Symbol): nsc.Global.Tree

    Reify a reference to a symbol

    Reify a reference to a symbol

    Definition Classes
    GenSymbols
  114. val reifyTrace: SimpleTracer

    Definition Classes
    Utils
  115. def reifyTree(tree: nsc.Global.Tree): nsc.Global.Tree

    Reify a tree.

    Reify a tree. For internal use only, use reified instead.

    Definition Classes
    ReifierGenTrees
  116. def reifyTreePlaceholder(tree: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    Reifier
  117. def reifyTreeSymbols: Boolean

    Definition Classes
    GenTrees
  118. def reifyTreeSyntactically(tree: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    ReifierGenTrees
  119. def reifyTreeTypes: Boolean

    Definition Classes
    GenTrees
  120. def reifyTuple(args: List[nsc.Global.Tree]): nsc.Global.Tree

    Definition Classes
    Reifier
  121. def reifyTupleType(args: List[nsc.Global.Tree]): nsc.Global.Tree

    Definition Classes
    Reifier
  122. def reifyType(tpe: nsc.Global.Type): nsc.Global.Tree

    Reify a type.

    Reify a type. For internal use only, use reified instead.

    Definition Classes
    GenTypes
  123. val reshape: nsc.Global.Transformer { ... /* 2 definitions in type refinement */ }

    Rolls back certain changes that were introduced during typechecking of the reifee.

    Rolls back certain changes that were introduced during typechecking of the reifee.

    These include: * Undoing macro expansions * Replacing type trees with TypeTree(tpe) * Reassembling CompoundTypeTrees into reifiable form * Transforming Modifiers.annotations into Symbol.annotations * Transforming Annotated annotations into AnnotatedType annotations * Transforming Annotated(annot, expr) into Typed(expr, TypeTree(Annotated(annot, _)) * Non-idempotencies of the typechecker: https://issues.scala-lang.org/browse/SI-5464

    Definition Classes
    Reshape
  124. def scalaFactoryCall(name: String, args: nsc.Global.Tree*): nsc.Global.Tree

    Definition Classes
    UnapplyReifierGenUtils
  125. def scalaFactoryCall(name: nsc.Global.TermName, args: nsc.Global.Tree*): nsc.Global.Tree

    Definition Classes
    GenUtils
  126. def spliceType(tpe: nsc.Global.Type): nsc.Global.Tree

    Definition Classes
    GenTypes
  127. val state: State

    Encapsulates reifier state

    Encapsulates reifier state

    When untangling reifier symbol tables from the reifier itself, I discovered that encoding of a symbol table (e.g. producing corresponding reificode) might cause subsequent reification (e.g. when filling in signatures and annotations for syms).

    This is a mess in the face of nested reifications, splices and inlining of thereof, so I made SymbolTable immutable, which brought a significant amount of sanity.

    However that wasn't enough. Sure, symbol table became immutable, but the reifier still needed to mutate its symtab field during reification. This caused nasty desyncs between the table being encoded and the table of the underlying reifier, so I decided to encapsulate the entire state here, so that encoding can backup the state before it starts and restore it after it completes.

    Definition Classes
    States
  128. def symtab: SymbolTable

    Symbol table of the reifee.

    Symbol table of the reifee.

    Keeps track of auxiliary symbols that are necessary for this reification session. These include: 1) Free vars (terms, types and existentials), 2) Non-locatable symbols (sometimes, e.g. for RefinedTypes, we need to reify these; to do that we create their local copies in the reificode) 3) Non-locatable symbols that are referred by #1, #2 and #3

    Exposes three main methods: 1) syms that lists symbols belonging to the table, 2) symXXX family of methods that provide information about the symbols in the table, 3) encode that renders the table into a list of trees (recursively populating #3 and setting up initialization code for #1, #2 and #3)

    Definition Classes
    GenSymbols
  129. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  130. def termPath(fullname: String): nsc.Global.Tree

    An (unreified) path that refers to term definition with given fully qualified name

    An (unreified) path that refers to term definition with given fully qualified name

    Definition Classes
    GenUtils
  131. def toString(): String

    Definition Classes
    AnyRef → Any
  132. lazy val typer: Nothing

    Definition Classes
    ReifierReifierUtils
  133. val universe: nsc.Global.Tree

    Definition Classes
    ReifierReifier
  134. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  137. def [B](y: B): (Quasiquotes.UnapplyReifier, B)

    Implicit information
    This member is added by an implicit conversion from Quasiquotes.UnapplyReifier to ArrowAssoc[Quasiquotes.UnapplyReifier] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Quasiquotes.Reifier

Inherited from reflect.reify.Reifier

Inherited from Utils

Inherited from StdAttachments

Inherited from SymbolTables

Inherited from Extractors

Inherited from NodePrinters

Inherited from Errors

Inherited from Phases

Inherited from Reify

Inherited from GenUtils

Inherited from GenPositions

Inherited from GenAnnotationInfos

Inherited from GenTrees

Inherited from GenNames

Inherited from GenTypes

Inherited from GenSymbols

Inherited from Metalevels

Inherited from Calculate

Inherited from Reshape

Inherited from States

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion StringAdd from Quasiquotes.UnapplyReifier to StringAdd[Quasiquotes.UnapplyReifier]

Inherited by implicit conversion StringFormat from Quasiquotes.UnapplyReifier to StringFormat[Quasiquotes.UnapplyReifier]

Inherited by implicit conversion Ensuring from Quasiquotes.UnapplyReifier to Ensuring[Quasiquotes.UnapplyReifier]

Inherited by implicit conversion ArrowAssoc from Quasiquotes.UnapplyReifier to ArrowAssoc[Quasiquotes.UnapplyReifier]

Ungrouped