Extensible prime generator: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: added wording to the output text.) |
m (→The functions: corrected heading (=== not ==)) |
||
| Line 1,223: | Line 1,223: | ||
=={{header|F_Sharp|F#}}== |
=={{header|F_Sharp|F#}}== |
||
This task uses [http://www.rosettacode.org/wiki/Sieve_of_Eratosthenes#Unbounded_Page-Segmented_Bit-Packed_Odds-Only_Mutable_Array_Sieve Unbounded_Page-Segmented_Bit-Packed Odds-Only Mutable Array Sieve F#] |
This task uses [http://www.rosettacode.org/wiki/Sieve_of_Eratosthenes#Unbounded_Page-Segmented_Bit-Packed_Odds-Only_Mutable_Array_Sieve Unbounded_Page-Segmented_Bit-Packed Odds-Only Mutable Array Sieve F#] |
||
==The functions== |
===The functions=== |
||
<lang fsharp> |
<lang fsharp> |
||
let primes64()=let pz=primes() in let rec p()=seq{yield(int64(pz()));yield! p()} in p() |
let primes64()=let pz=primes() in let rec p()=seq{yield(int64(pz()));yield! p()} in p() |
||