summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAdriaan Moors <adriaan.moors@epfl.ch>2012-07-21 08:51:50 +0200
committerAdriaan Moors <adriaan.moors@epfl.ch>2012-07-22 15:49:28 +0200
commit1413713bddd1d14e9cb51ca5b3f2d10f82000b6e (patch)
tree60895ed66f7a536b1f8f97ebcf1c13bc12b3c13e
parentfa4c1de6e7dc5e5703ccf822c5815da9e8ae47ed (diff)
downloadscala-1413713bddd1d14e9cb51ca5b3f2d10f82000b6e.tar.gz
scala-1413713bddd1d14e9cb51ca5b3f2d10f82000b6e.tar.bz2
scala-1413713bddd1d14e9cb51ca5b3f2d10f82000b6e.zip
SI-6089 test file for pt2
test that matchEnd that's an argument of || that's in tail position is in tail position
-rw-r--r--test/files/pos/t6089b.scala18
1 files changed, 18 insertions, 0 deletions
diff --git a/test/files/pos/t6089b.scala b/test/files/pos/t6089b.scala
new file mode 100644
index 0000000000..ff7ca157eb
--- /dev/null
+++ b/test/files/pos/t6089b.scala
@@ -0,0 +1,18 @@
+// this crazy code simply tries to nest pattern matches so that the last call is in a tricky-to-determine
+// tail position (my initial tightenign of tailpos detection for SI-6089 ruled this out)
+class BKTree {
+ @annotation.tailrec
+ final def -?-[AA](a: AA): Boolean = this match {
+ case BKTreeEmpty => false
+ case BKTreeNode(v) => {
+ val d = 1
+ d == 0 || ( Map(1 -> this,2 -> this,3 -> this) get d match {
+ case None => false
+ case Some(w) => w -?- a // can tail call here (since || is shortcutting)
+ })
+ }
+ }
+}
+
+object BKTreeEmpty extends BKTree
+case class BKTreeNode[A](v: A) extends BKTree \ No newline at end of file