aboutsummaryrefslogtreecommitdiff
path: root/tests/pending/run/t7326.scala
diff options
context:
space:
mode:
authorDmitry Petrashko <dmitry.petrashko@gmail.com>2015-05-13 12:08:27 +0200
committerDmitry Petrashko <dmitry.petrashko@gmail.com>2015-05-13 12:08:27 +0200
commit73a93505c432b410ae39fb3c4d6168b2e49832ce (patch)
tree53d45141a7b93682bea6430b0fb6ab28c3c3fad3 /tests/pending/run/t7326.scala
parent89bacb9c25a58454ff1878e67f7ea07ffc8c269f (diff)
downloaddotty-73a93505c432b410ae39fb3c4d6168b2e49832ce.tar.gz
dotty-73a93505c432b410ae39fb3c4d6168b2e49832ce.tar.bz2
dotty-73a93505c432b410ae39fb3c4d6168b2e49832ce.zip
Running rewrite tool on run tests.
Diffstat (limited to 'tests/pending/run/t7326.scala')
-rw-r--r--tests/pending/run/t7326.scala4
1 files changed, 2 insertions, 2 deletions
diff --git a/tests/pending/run/t7326.scala b/tests/pending/run/t7326.scala
index ed9471ea8..ce3fa122a 100644
--- a/tests/pending/run/t7326.scala
+++ b/tests/pending/run/t7326.scala
@@ -3,11 +3,11 @@ import scala.collection.immutable.HashSet
object Test extends App {
- def testCorrectness() {
+ def testCorrectness(): Unit = {
// a key that has many hashCode collisions
case class Collision(i: Int) { override def hashCode = i / 5 }
- def subsetTest[T](emptyA:Set[T], emptyB:Set[T], mkKey:Int => T, n:Int) {
+ def subsetTest[T](emptyA:Set[T], emptyB:Set[T], mkKey:Int => T, n:Int): Unit = {
val outside = mkKey(n + 1)
for(i <- 0 to n) {
val a = emptyA ++ (0 until i).map(mkKey)