scala.reflect.quasiquotes.Reifiers

# Reifier

###
Related Doc: package Reifiers

#### abstract class Reifier extends reify.Reifier

Source
  Reifiers.scala

Linear Supertypes
reify.Reifier, Utils, StdAttachments, SymbolTables, Extractors, NodePrinters, Errors, Phases, Reify, GenUtils, GenPositions, GenAnnotationInfos, GenTrees, GenNames, GenTypes, GenSymbols, Metalevels, Calculate, Reshape, States, AnyRef, Any
Known Subclasses
ApplyReifier, UnapplyReifier
Type Hierarchy Learn more about scaladoc diagrams
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Reifier
2. Reifier
3. Utils
4. StdAttachments
5. SymbolTables
6. Extractors
7. NodePrinters
8. Errors
9. Phases
10. Reify
11. GenUtils
12. GenPositions
13. GenAnnotationInfos
14. GenTrees
15. GenNames
16. GenTypes
17. GenSymbols
18. Metalevels
19. Calculate
20. Reshape
21. States
22. AnyRef
23. Any

Implicitly

1. by any2stringadd
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 Reifier(isReifyingExpressions: Boolean)

### 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

### Abstract Value Members

1. #### abstract def reifyHighRankList(xs: List[Any])(fill: PartialFunction[Any, tools.nsc.Global.Tree])(fallback: (Any) ⇒ tools.nsc.Global.Tree): tools.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:

   reifyHighRankList(lst) { // first we define patterns that extract high-rank holeMap (currently ..) case Placeholder(IterableType(_, _)) => 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) > reifyHighRankList(lst) { ... } { ... } q"List($foo, $bar) ++ ${holeMap(qq$f3948f9s$1).tree}"

### Concrete Value Members

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

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     AnyRef → Any

2. #### final def ##(): Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any

3. #### def +(other: String): String

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

4. #### def ->[B](y: B): (Quasiquotes.Reifier, B)

   Implicit information
     This member is added by an implicit conversion from Quasiquotes.Reifier to ArrowAssoc[Quasiquotes.Reifier] performed by method ArrowAssoc in scala.Predef.
   Definition Classes
     ArrowAssoc
   Annotations
     @inline()

5. #### final def ==(arg0: Any): Boolean

   The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

   The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

   arg0

     the object to compare against this object for equality.

   returns

     `true` if the receiver object is equivalent to the argument; `false` otherwise.

   Definition Classes
     AnyRef → Any

6. #### object ApplyCall

   Definition Classes
     Extractors

7. #### object BoundTerm

   Definition Classes
     Extractors

8. #### object BoundType

   Definition Classes
     Extractors

9. #### def CannotConvertManifestToTagWithoutScalaReflect(tpe: tools.nsc.Global.Type, manifestInScope: tools.nsc.Global.Tree): Nothing

   Definition Classes
     Errors

10. #### def CannotReifyCompoundTypeTreeWithNonEmptyBody(ctt: tools.nsc.Global.CompoundTypeTree): Nothing

    Definition Classes
      Errors

11. #### def CannotReifyErroneousPrefix(prefix: tools.nsc.Global.Tree): Nothing

    Definition Classes
      Errors

12. #### def CannotReifyErroneousReifee(reifee: Any): Nothing

    Definition Classes
      Errors

13. #### def CannotReifyInvalidLazyVal(tree: tools.nsc.Global.ValDef): Nothing

    Definition Classes
      Errors

14. #### def CannotReifyRuntimeSplice(tree: tools.nsc.Global.Tree): Nothing

    Definition Classes
      Errors

15. #### def CannotReifyType(tpe: tools.nsc.Global.Type): Nothing

    Definition Classes
      Errors

16. #### def CannotReifyUntypedPrefix(prefix: tools.nsc.Global.Tree): Nothing

    Definition Classes
      Errors

17. #### def CannotReifyUntypedReifee(reifee: Any): Nothing

    Definition Classes
      Errors

18. #### def CannotReifyWeakType(details: Any): Nothing

    Definition Classes
      Errors

19. #### object FreeDef extends Utils.FreeDefExtractor

    Definition Classes
      Extractors

20. #### object FreeRef

    Definition Classes
      Extractors

21. #### object FreeTermDef extends Utils.FreeDefExtractor

    Definition Classes
      Extractors

22. #### object FreeTypeDef extends Utils.FreeDefExtractor

    Definition Classes
      Extractors

23. #### object ReifiedTree

    Definition Classes
      Extractors

24. #### object ReifiedType

    Definition Classes
      Extractors

25. #### object SymDef

    Definition Classes
      Extractors

26. #### object SymbolTable

    Definition Classes
      SymbolTables

27. #### object TreeSplice

    Definition Classes
      Extractors

28. #### object TypeRefToFreeType

    Definition Classes
      Extractors

29. #### object TypedOrAnnotated

    Definition Classes
      GenUtils

30. #### def action: String

31. #### final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type `T0`.

    Cast the receiver object to be of type `T0`.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression `1.asInstanceOf[String]` will throw a `ClassCastException` at runtime, while the expression `List(1).asInstanceOf[List[String]]` will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown

      `ClassCastException` if the receiver object is not an instance of the erasure of type `T0`.

32. #### def boundSymbolsInCallstack: List[tools.nsc.Global.Symbol]

    Definition Classes
      Reify

33. #### val calculate: tools.nsc.Global.Traverser { ... /* 2 definitions in type refinement */ }

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

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

    Definition Classes
      Calculate

34. #### def call(fname: String, args: tools.nsc.Global.Tree*): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

35. #### def clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

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

      not specified by SLS as a member of AnyRef

36. #### val concrete: Boolean

    Definition Classes
      Reifier → Reifier

37. #### def current: Any

    Definition Classes
      Reify

38. #### def currents: List[Any]

    Definition Classes
      Reify

39. #### def defaultErrorPosition: tools.nsc.Global.Position

    Definition Classes
      Errors

40. #### def ensureNoExplicitFlags(m: tools.nsc.Global.Modifiers, pos: tools.nsc.Global.Position): Unit

41. #### def ensuring(cond: (Quasiquotes.Reifier) ⇒ Boolean, msg: ⇒ Any): Quasiquotes.Reifier

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

42. #### def ensuring(cond: (Quasiquotes.Reifier) ⇒ Boolean): Quasiquotes.Reifier

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

43. #### def ensuring(cond: Boolean, msg: ⇒ Any): Quasiquotes.Reifier

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

44. #### def ensuring(cond: Boolean): Quasiquotes.Reifier

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

45. #### final def eq(arg0: AnyRef): Boolean

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional properties:

    - It is consistent: for any non-null instances `x` and `y` of type `AnyRef`, multiple invocations of `x.eq(y)` consistently returns `true` or consistently returns `false`.
    - For any non-null instance `x` of type `AnyRef`, `x.eq(null)` and `null.eq(x)` returns `false`.
    - `null.eq(null)` returns `true`.

    When overriding the `equals` or `hashCode` methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (`o1 eq o2`), they should be equal to each other (`o1 == o2`) and they should hash to the same value (`o1.hashCode == o2.hashCode`).

    returns

      `true` if the argument is a reference to the receiver object; `false` otherwise.

    Definition Classes
      AnyRef

46. #### def equals(arg0: Any): Boolean

    The equality method for reference types.

    The equality method for reference types. Default implementation delegates to `eq`.

    See also `equals` in scala.Any.

    returns

      `true` if the receiver object is equivalent to the argument; `false` otherwise.

    Definition Classes
      AnyRef → Any

47. #### val fillListHole: PartialFunction[Any, tools.nsc.Global.Tree]

48. #### val fillListOfListsHole: PartialFunction[Any, tools.nsc.Global.Tree]

49. #### def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the `finalize` method is invoked, as well as the interaction between `finalize` and non-local returns and exceptions, are all platform dependent.

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

      not specified by SLS as a member of AnyRef

50. #### def formatted(fmtstr: String): String

    Implicit information
      This member is added by an implicit conversion from Quasiquotes.Reifier to StringFormat[Quasiquotes.Reifier] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @inline()

51. #### final def getClass(): Class[_]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

      a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
      AnyRef → Any
    Note

      not specified by SLS as a member of AnyRef

52. #### def getReifier: reify.Reifier { val global: Reifier.this.global.type }

    Definition Classes
      Reifier → Utils

53. #### val global: Quasiquotes.global.type

    Definition Classes
      Reifier → Reifier → Utils

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))

55. #### def hasReifier: Boolean

    Definition Classes
      Reifier → Utils

56. #### def hashCode(): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

      the hash code value for this object.

    Definition Classes
      AnyRef → Any

57. #### def holesHaveTypes: Boolean

58. #### def isCrossStageTypeBearer(tree: tools.nsc.Global.Tree): Boolean

    Definition Classes
      GenUtils

59. #### final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object is `T0`.

    Test whether the dynamic type of the receiver object is `T0`.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression `1.isInstanceOf[String]` will return `false`, while the expression `List(1).isInstanceOf[List[String]]` will return `true`. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

      `true` if the receiver object is an instance of erasure of type `T0`; `false` otherwise.

    Definition Classes
      Any

60. #### val isReifyingExpressions: Boolean

61. #### def isReifyingPatterns: Boolean

62. #### def isSemiConcreteTypeMember(tpe: tools.nsc.Global.Type): Boolean

    Definition Classes
      GenUtils

63. #### val metalevels: tools.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: tools.nsc.Global.EmptyTree.type

    Definition Classes
      Reifier → Reifier

65. #### def mirrorBuildCall(name: tools.nsc.Global.TermName, args: tools.nsc.Global.Tree*): tools.nsc.Global.Tree

    Definition Classes
      Reifier → GenUtils

66. #### def mirrorCall(name: tools.nsc.Global.TermName, args: tools.nsc.Global.Tree*): tools.nsc.Global.Tree

    Definition Classes
      Reifier → GenUtils

67. #### def mirrorFactoryCall(prefix: tools.nsc.Global.TermName, args: tools.nsc.Global.Tree*): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

68. #### def mirrorFactoryCall(value: Product, args: tools.nsc.Global.Tree*): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

69. #### def mirrorMirrorCall(name: tools.nsc.Global.TermName, args: tools.nsc.Global.Tree*): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

70. #### def mirrorMirrorSelect(name: tools.nsc.Global.TermName): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

71. #### def mirrorSelect(name: String): tools.nsc.Global.Tree

    Definition Classes
      Reifier → GenUtils

72. #### def mirrorSelect(name: tools.nsc.Global.TermName): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

73. #### def mkList(args: List[tools.nsc.Global.Tree]): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

74. #### def mkListMap(args: List[tools.nsc.Global.Tree]): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

75. #### lazy val mkReificationPipeline: (tools.nsc.Global.Tree) ⇒ tools.nsc.Global.Tree

    Definition Classes
      Phases

76. #### val nameMap: Map[tools.nsc.Global.Name, Set[tools.nsc.Global.TermName]]

    Map that stores freshly generated names linked to the corresponding names in the reified tree.

    Map that stores freshly generated names linked to the corresponding names in the reified tree. This information is used to reify names created by calls to freshTermName and freshTypeName.

77. #### final def ne(arg0: AnyRef): Boolean

    Equivalent to `!(this eq that)`.

    Equivalent to `!(this eq that)`.

    returns

      `true` if the argument is not a reference to the receiver object; `false` otherwise.

    Definition Classes
      AnyRef

78. #### val nonOverloadedExplicitFlags: Long

79. #### final def notify(): Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Definition Classes
      AnyRef
    Note

      not specified by SLS as a member of AnyRef

80. #### final def notifyAll(): Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    Definition Classes
      AnyRef
    Note

      not specified by SLS as a member of AnyRef

81. #### def origin(sym: tools.nsc.Global.Symbol): String

    Definition Classes
      GenUtils

82. #### def path(fullname: String, mkName: (String) ⇒ tools.nsc.Global.Name): tools.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

83. #### val reifee: tools.nsc.Global.EmptyTree.type

    Definition Classes
      Reifier → Reifier

84. #### lazy val reification: tools.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

85. #### 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

86. #### object reifiedNodeToString extends (tools.nsc.Global.Tree) ⇒ String

    Definition Classes
      NodePrinters

87. #### lazy val reifier: reify.Reifier { val global: Reifier.this.global.type }

    Definition Classes
      Utils

88. #### def reify(reifee: Any): tools.nsc.Global.Tree

    Reifies any supported value.

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

    Definition Classes
      Reify

89. #### def reifyAnnotList(annots: List[tools.nsc.Global.Tree]): tools.nsc.Global.Tree

90. #### def reifyAnnotation(hole: Quasiquotes.Hole): tools.nsc.Global.Tree

91. #### def reifyAnnotationInfo(ann: tools.nsc.Global.AnnotationInfo): tools.nsc.Global.Tree

    Definition Classes
      GenAnnotationInfos

92. #### def reifyBinding(tree: tools.nsc.Global.Tree): tools.nsc.Global.Tree

    Definition Classes
      StdAttachments

93. #### def reifyBuildCall(name: tools.nsc.Global.TermName, args: Any*): tools.nsc.Global.Tree

    Definition Classes
      GenUtils

94. #### def reifyConstructionCheck(name: tools.nsc.Global.TermName, hole: Quasiquotes.Hole): tools.nsc.Global.Tree

95. #### val reifyCopypaste: Boolean

    Definition Classes
      Utils

96. #### val reifyDebug: Boolean

    Definition Classes
      Utils

97. #### def reifyEarlyDef(hole: Quasiquotes.Hole): tools.nsc.Global.Tree

98. #### def reifyFillingHoles(tree: tools.nsc.Global.Tree): tools.nsc.Global.Tree

99. #### def reifyFlags(flags: tools.nsc.Global.FlagSet): tools.nsc.Global.Tree

    Definition Classes
      GenTrees

100. #### def reifyFreeTerm(binding: tools.nsc.Global.Tree): tools.nsc.Global.Tree

     Definition Classes
       GenSymbols

101. #### def reifyFreeType(binding: tools.nsc.Global.Tree): tools.nsc.Global.Tree

     Definition Classes
       GenSymbols

102. #### def reifyFunctionType(argtpes: List[tools.nsc.Global.Tree], restpe: tools.nsc.Global.Tree): tools.nsc.Global.Tree

103. #### def reifyList(xs: List[Any]): tools.nsc.Global.Tree

     Reifies arbitrary list filling ..$x and ...$y holeMap when they are put in the correct position.

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

     Definition Classes
       Reifier → GenUtils

104. #### def reifyMirrorObject(x: Product): tools.nsc.Global.Tree

     Definition Classes
       GenUtils

105. #### def reifyMirrorObject(name: String): tools.nsc.Global.Tree

     Reify a case object defined in Mirror

     Reify a case object defined in Mirror

     Definition Classes
       GenUtils

106. #### def reifyModifiers(m: tools.nsc.Global.Modifiers): tools.nsc.Global.Tree

     Definition Classes
       GenTrees

107. #### def reifyName(name: tools.nsc.Global.Name): tools.nsc.Global.Tree

     Definition Classes
       Reifier → GenNames

108. #### def reifyPackageStat(hole: Quasiquotes.Hole): tools.nsc.Global.Tree

109. #### def reifyPosition(pos: tools.nsc.Global.Position): tools.nsc.Global.Tree

     Definition Classes
       GenPositions

110. #### def reifyProduct(prefix: String, elements: List[Any]): tools.nsc.Global.Tree

     Definition Classes
       GenUtils

111. #### def reifyProduct(x: Product): tools.nsc.Global.Tree

     Definition Classes
       GenUtils

112. #### def reifyRefineStat(hole: Quasiquotes.Hole): tools.nsc.Global.Tree

113. #### def reifySymDef(sym: tools.nsc.Global.Symbol): tools.nsc.Global.Tree

     Definition Classes
       GenSymbols

114. #### def reifySymRef(sym: tools.nsc.Global.Symbol): tools.nsc.Global.Tree

     Reify a reference to a symbol

     Reify a reference to a symbol

     Definition Classes
       GenSymbols

115. #### val reifyTrace: SimpleTracer

     Definition Classes
       Utils

116. #### def reifyTree(tree: tools.nsc.Global.Tree): tools.nsc.Global.Tree

     Reify a tree.

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

     Definition Classes
       Reifier → GenTrees

117. #### def reifyTreePlaceholder(tree: tools.nsc.Global.Tree): tools.nsc.Global.Tree

118. #### def reifyTreeSymbols: Boolean

     Definition Classes
       GenTrees

119. #### def reifyTreeSyntactically(tree: tools.nsc.Global.Tree): tools.nsc.Global.Tree

     Definition Classes
       Reifier → GenTrees

120. #### def reifyTreeTypes: Boolean

     Definition Classes
       GenTrees

121. #### def reifyTuple(args: List[tools.nsc.Global.Tree]): tools.nsc.Global.Tree

122. #### def reifyTupleType(args: List[tools.nsc.Global.Tree]): tools.nsc.Global.Tree

123. #### def reifyType(tpe: tools.nsc.Global.Type): tools.nsc.Global.Tree

     Reify a type.

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

     Definition Classes
       GenTypes

124. #### def reifyVparamss(vparamss: List[List[tools.nsc.Global.ValDef]]): tools.nsc.Global.Tree

125. #### val reshape: tools.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

126. #### def scalaFactoryCall(name: String, args: tools.nsc.Global.Tree*): tools.nsc.Global.Tree

     Definition Classes
       Reifier → GenUtils

127. #### def scalaFactoryCall(name: tools.nsc.Global.TermName, args: tools.nsc.Global.Tree*): tools.nsc.Global.Tree

     Definition Classes
       GenUtils

128. #### def spliceType(tpe: tools.nsc.Global.Type): tools.nsc.Global.Tree

     Definition Classes
       GenTypes

129. #### 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

130. #### 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 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

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

     Definition Classes
       AnyRef

132. #### def termPath(fullname: String): tools.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

133. #### def toString(): String

     Creates a String representation of this object.

     Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

     returns

       a String representation of the object.

     Definition Classes
       AnyRef → Any

134. #### lazy val typer: Nothing

     Definition Classes
       Reifier → Reifier → Utils

135. #### val universe: tools.nsc.Global.Tree

     Definition Classes
       Reifier → Reifier

136. #### final def wait(): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

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

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

138. #### final def wait(arg0: Long): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

139. #### def wrap(tree: tools.nsc.Global.Tree): tools.nsc.Global.Tree

     Wraps expressions into: a block which starts with a sequence of vals that correspond to fresh names that has to be created at evaluation of the quasiquote and ends with reified tree:

     Wraps expressions into: a block which starts with a sequence of vals that correspond to fresh names that has to be created at evaluation of the quasiquote and ends with reified tree:

     { val name$1: universe.TermName = universe.build.freshTermName(prefix1) ... val name$N: universe.TermName = universe.build.freshTermName(prefixN) tree }

     Wraps patterns into: a call into anonymous class' unapply method required by unapply macro expansion:

     new { def unapply(tree) = tree match { case pattern if guard => Some(result) case _ => None } }.unapply(<unapply-selector>)

     where pattern corresponds to reified tree and guard represents conjunction of equalities which check that pairs of names in nameMap.values are equal between each other.

140. #### def →[B](y: B): (Quasiquotes.Reifier, B)

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

### Inherited from 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 any2stringadd from Quasiquotes.Reifier to any2stringadd[Quasiquotes.Reifier]

### Inherited by implicit conversion StringFormat from Quasiquotes.Reifier to StringFormat[Quasiquotes.Reifier]

### Inherited by implicit conversion Ensuring from Quasiquotes.Reifier to Ensuring[Quasiquotes.Reifier]

### Inherited by implicit conversion ArrowAssoc from Quasiquotes.Reifier to ArrowAssoc[Quasiquotes.Reifier]

### Ungrouped