class
ReverseSourceMapPrinter extends IRTreePrinter
Instance Constructors
-
new
ReverseSourceMapPrinter(untilLine: Int)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
apply(x: Int): Position
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
complete(): Unit
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
indent(): Unit
-
var
indentMargin: Int
-
val
indentStep: Int
-
var
indentString: String
-
final
def
isInstanceOf[T0]: Boolean
-
val
jsMode: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
val
out: Writer
-
def
print(args: Any*): Unit
-
def
printArgs(args: List[Tree]): Unit
-
def
printBlock(tree: Tree, isStat: Boolean): Unit
-
def
printColumn(ts: List[Tree], start: String, sep: String, end: String): Unit
-
def
printIdent(ident: Ident): Unit
-
def
printOptType(tpe: Type): Unit
-
def
printRow(ts: List[Any], sep: String): Unit
-
def
printRow(ts: List[Any], start: String, sep: String, end: String): Unit
-
def
printSeq[a](ls: List[a])(printelem: (a) ⇒ Unit)(printsep: (Boolean) ⇒ Unit): Unit
-
def
printSig(args: List[ParamDef], resultType: Type): Unit
-
def
printStat(tree: Tree): Unit
-
def
printString(s: String): Unit
-
def
printTopLevelTree(tree: Tree): Unit
-
def
printTree(tree: Tree, isStat: Boolean): Unit
-
def
printType(tpe: Type): Unit
-
def
println(): Unit
-
def
reverseSourceMap(tree: Tree): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
undent(): Unit
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Prints a tree to find original locations based on line numbers.