Mercurial > projects > ldc
annotate test/sieve.d @ 314:8d98e42ece93 trunk
[svn r335] The basics of exception handling are in place.
Still need to make sure calls are turned into invokes everywhere. (NewExpression for instance)
Still some rough edges and corner cases to figure out.
Needs testing!
author | ChristianK |
---|---|
date | Wed, 02 Jul 2008 22:20:18 +0200 |
parents | d9d5d59873d8 |
children |
rev | line source |
---|---|
1 | 1 /* Eratosthenes Sieve prime number calculation. */ |
2 | |
270
d9d5d59873d8
[svn r291] Fixed a bunch of the old Phobos tests to work with Tango.
lindquist
parents:
1
diff
changeset
|
3 extern(C) int printf(char*, ...); |
d9d5d59873d8
[svn r291] Fixed a bunch of the old Phobos tests to work with Tango.
lindquist
parents:
1
diff
changeset
|
4 |
1 | 5 bool flags[8191]; |
6 | |
7 int main() | |
8 { int i, prime, k, count, iter; | |
9 | |
10 printf("10 iterations\n"); | |
11 for (iter = 1; | |
12 iter <= 10; | |
13 iter++) | |
14 { | |
15 count = 0; | |
16 flags[] = true; | |
17 for (i = 0; i < flags.length; i++) | |
18 { if (flags[i]) | |
19 { | |
20 prime = i + i + 3; | |
21 k = i + prime; | |
22 while (k < flags.length) | |
23 { | |
24 flags[k] = false; | |
25 k += prime; | |
26 } | |
27 count += 1; | |
28 } | |
29 } | |
30 } | |
31 printf("%d primes\n", count); | |
32 return 0; | |
33 } |