aboutsummaryrefslogtreecommitdiff
path: root/tests/pending/pos/t6089b.scala
diff options
context:
space:
mode:
authorMartin Odersky <odersky@gmail.com>2015-12-20 22:00:29 +0100
committerMartin Odersky <odersky@gmail.com>2015-12-20 22:00:45 +0100
commite51b8845fb20fe3a4e1c655d4b72e2833906bbc2 (patch)
tree91bc16867d7a709566d8be80902b3256294cf338 /tests/pending/pos/t6089b.scala
parent581fee04f808d6f7759f98358e7475e6a58138e3 (diff)
downloaddotty-e51b8845fb20fe3a4e1c655d4b72e2833906bbc2.tar.gz
dotty-e51b8845fb20fe3a4e1c655d4b72e2833906bbc2.tar.bz2
dotty-e51b8845fb20fe3a4e1c655d4b72e2833906bbc2.zip
The big pending/pos test triage
Diffstat (limited to 'tests/pending/pos/t6089b.scala')
-rw-r--r--tests/pending/pos/t6089b.scala18
1 files changed, 0 insertions, 18 deletions
diff --git a/tests/pending/pos/t6089b.scala b/tests/pending/pos/t6089b.scala
deleted file mode 100644
index 9378a74a0..000000000
--- a/tests/pending/pos/t6089b.scala
+++ /dev/null
@@ -1,18 +0,0 @@
-// 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