diff options
author | Adriaan Moors <adriaan.moors@typesafe.com> | 2013-04-15 23:16:34 -0700 |
---|---|---|
committer | Adriaan Moors <adriaan.moors@typesafe.com> | 2013-04-15 23:16:34 -0700 |
commit | 86651c1205de9d901a9f0a0214888ac7c4724b81 (patch) | |
tree | 50bfed24410467a1926ebd0cedd35d79bd6750f8 /test/files/run/reify-each-node-type.check | |
parent | e337bfca56572b88dbc75a0e5d20f862be5f4ce0 (diff) | |
parent | 4e2459e3de5a1265d5bf071fc1029c6c022336c3 (diff) | |
download | scala-86651c1205de9d901a9f0a0214888ac7c4724b81.tar.gz scala-86651c1205de9d901a9f0a0214888ac7c4724b81.tar.bz2 scala-86651c1205de9d901a9f0a0214888ac7c4724b81.zip |
Merge pull request #2380 from paulp/pr/reifier-ast-test
Reifier -> AST Node test.
Diffstat (limited to 'test/files/run/reify-each-node-type.check')
-rw-r--r-- | test/files/run/reify-each-node-type.check | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/test/files/run/reify-each-node-type.check b/test/files/run/reify-each-node-type.check new file mode 100644 index 0000000000..af6fd13a7b --- /dev/null +++ b/test/files/run/reify-each-node-type.check @@ -0,0 +1,35 @@ + 1 s Ident + 2 r.List Select + 3 r.List.apply() Apply + 4 r.List.apply(1) Literal + 5 r.List.apply[Int]() TypeApply + 6 (1: Int) Typed + 7 (null: r.List[Int]) AppliedTypeTree + 8 { (); () } Block + 9 { val x: Int = 0; () } ValDef +10 { val x = 0; () } TypeTree +11 if (true) () else () If +12 { def f: Unit = (); () } DefDef +13 { def m = NN.super.q; () } Super +14 { abstract trait A extends AnyRef; () } ClassDef Template +15 { def f(x: Any): Unit = (); () } EmptyTree +16 (null: r.D with r.E) CompoundTypeTree +17 { type T = Int; () } TypeDef +18 { type CC[T >: Nothing <: r.D] = r.C[T]; () } TypeBoundsTree +19 try { 0 } finally Predef.println("") Try +20 ((x: Int) => x) Function +21 { var v = 1; v = 2 } Assign +22 { class A extends AnyRef { def <init>() = { super.<init>(); This +23 new r.List[Int]() New +24 0: @unchecked Annotated +25 (null: r.Outer#Inner) SelectFromTypeTree +26 (null: Nil.type) SingletonTypeTree +27 (null: T forSome { type T >: Nothing <: Any }) ExistentialTypeTree +28 { import r.{A, B=>C}; () } Import +29 { def f: Int = return 0; () } Return +30 { object x extends AnyRef { def <init>() = { super.<init>(); ModuleDef +31 throw new Exception() Throw +32 0 match { case _ => 0 } Match CaseDef +33 0 match { case (1| 2) => 0 } Alternative +34 NN.q match { case (x @ r.List) => 0 } Bind +35 NN.q match { case r.UnSeq(1, (_)*) => 0 } Star |