git-svn-id: http://lampsvn.epfl.ch/svn-repos/scala/scala/trunk@5729 5e8d7ff9-d8ef-0310-90f0-a4852d11357a

This commit is contained in:
spoon 2006-02-10 13:08:26 +00:00
parent 24ee5f9b56
commit 3ee6483c8b
2 changed files with 84 additions and 0 deletions

View File

@ -0,0 +1,4 @@
List(2, 6, 10, 14, 18, 22, 24, 26, 28, 30, 32, 34, 36, 38)
List(2, 6, 10, 14, 18, 22, 24, 26, 28, 30, 32, 34, 36, 38)
List(2, 6, 10, 14, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2)
called 21 times

View File

@ -0,0 +1,80 @@
// test "val foo =" clauses in for comprehensions
// $Id$
import scala.collection.immutable.Queue
import scala.{List=>L}
object Test {
// redefine some symbols to make it extra hard
/*
class List
class Pair
class Tuple2
def List[A](as:A*) = 5
*/
def firstDigit(x:int): int =
x match {
case 0 => 0
case _ if(x<0) => firstDigit(-x)
case _ if(x<10) => x
case _ => firstDigit(x / 10)
}
{
// a basic test case
val input = L.range(0,20)
val oddFirstTimesTwo =
for{val x <- input
val xf = firstDigit(x)
xf % 2 == 1}
yield x*2
Console.println(oddFirstTimesTwo)
}
{
// make sure it works on non-Ls
// val input: Queue = Queue.Empty[int].incl(L.range(0,20))
val input = L.range(0,20).elements
val oddFirstTimesTwo =
for{val x <- input
val xf = firstDigit(x)
xf % 2 == 1}
yield x*2
Console.println(oddFirstTimesTwo.toL)
}
{
// yield the computed value
val input = L.range(0,20)
val oddFirstTimesTwo =
for{val x <- input
val xf = firstDigit(x)
xf % 2 == 1}
yield xf*2
Console.println(oddFirstTimesTwo)
}
{
// make sure the function is only called once
var count: int = 0
def fdct(x: int) = {
count = count + 1
firstDigit(x)
}
val input = L.range(0,20)
for{val x <- input
val xf = fdct(x)
xf % 2 == 1}
yield xf
Console.println("called " + count + " times")
}
def main(args: Array[String]): Unit = ()
}