Skip to content

Sieve

List the primes up to a limit with the Sieve of Eratosthenes.

Adapted from Exercism’s problem specification (MIT). Listed under Numbers & Math.

// FILE: sieve.nomi
//# The primes up to a limit, by the Sieve of Eratosthenes.

/// The primes up to and including `limit`, by the Sieve of Eratosthenes:
/// each prime marks its multiples, and the numbers left unmarked are prime.
pub fn primes(limit: Int) -> List<Int>
    composites = Iter.reduce(2..=limit, Set[], fn marked, n ->
        if n in marked then
            marked
        else
            multiples = Range.step_by(n * n..=limit, n) |> Iter.to_set()
            marked + multiples
        end
    end)

    2..=limit
    |> Iter.reject(&(&1 in composites))
    |> Iter.to_list()
end

// FILE: sieve_test.nomi
import sieve

test "no primes under two"
    assert sieve.primes(1) == []
end

test "find first prime"
    assert sieve.primes(2) == [2]
end

test "find primes up to 10"
    assert sieve.primes(10) == [2, 3, 5, 7]
end

test "limit is prime"
    assert sieve.primes(13) == [2, 3, 5, 7, 11, 13]
end

test "find primes up to 1000"
    assert sieve.primes(1000) == [
        2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89,
        97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181,
        191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
        283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397,
        401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,
        509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619,
        631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743,
        751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863,
        877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997,
    ]
end
  • Marking is a fold over 2..=limit into a Set<Int> of composites. An unmarked number is prime and adds its multiples from n * n with Range.step_by, joined with + (set union). A Vector<Bool> written with Vector.set was the other option; the set needs no length up front and no index arithmetic.
  • The primes are the numbers the fold left unmarked, filtered in a second pass.
  • The step pipeline is bound to multiples before marked + multiples, per the style guide’s rule for pipes feeding an operator.
  • Five plain tests, since the up-to-1000 case is a long literal on its own.