Mercurial > projects > ldc
annotate tests/mini/sieve.d @ 1622:a542ef277a84
Merge DMD r316: bugzilla 3628 can't cast null to int
---
dmd/constfold.c | 2 +-
dmd/optimize.c | 8 ++++----
2 files changed, 5 insertions(+), 5 deletions(-)
author | Leandro Lucarella <llucax@gmail.com> |
---|---|
date | Wed, 06 Jan 2010 15:18:22 -0300 |
parents | 1bb99290e03a |
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 } |