rusqsieve 0.4.0

High-performance SIQS integer factorization for native Rust and WebAssembly
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51

#include "../rusqsieve.h"

#include <assert.h>
#include <stddef.h>
#include <string.h>

static int cancel_immediately(
    const struct rusqsieve_progress *progress,
    void *context
) {
    unsigned *calls = context;
    assert(progress != NULL);
    ++*calls;
    return 1;
}

int main(void) {
    rusqsieve_factors *factors = rusqsieve_factors_new();
    assert(factors != NULL);
    assert(rusqsieve_abi_version() == 2);
    assert(strcmp(rusqsieve_strerror(RUSQSIEVE_OK), "success") == 0);

    assert(rusqsieve_factor("360", 1, factors) == RUSQSIEVE_OK);
    assert(rusqsieve_factors_len(factors) == 6);
    assert(strcmp(rusqsieve_factors_get(factors, 0), "2") == 0);
    assert(strcmp(rusqsieve_factors_get(factors, 1), "2") == 0);
    assert(strcmp(rusqsieve_factors_get(factors, 2), "2") == 0);
    assert(strcmp(rusqsieve_factors_get(factors, 3), "3") == 0);
    assert(strcmp(rusqsieve_factors_get(factors, 4), "3") == 0);
    assert(strcmp(rusqsieve_factors_get(factors, 5), "5") == 0);
    assert(rusqsieve_factors_get(factors, 6) == NULL);

    /* A result object is reusable; factor() releases its previous contents. */
    assert(rusqsieve_factor("1", 0, factors) == RUSQSIEVE_OK);
    assert(rusqsieve_factors_len(factors) == 0);
    assert(rusqsieve_factors_get(factors, 0) == NULL);

    assert(rusqsieve_factor("invalid", 1, factors) ==
           RUSQSIEVE_INVALID_DECIMAL);
    assert(rusqsieve_factors_len(factors) == 0);

    unsigned calls = 0;
    assert(rusqsieve_factor_with_progress(
               "1000036000099", 1, factors, cancel_immediately, &calls) ==
           RUSQSIEVE_CANCELLED);
    assert(calls == 1);
    assert(rusqsieve_factors_len(factors) == 0);
    rusqsieve_factors_free(factors);
    rusqsieve_factors_free(NULL);
    return 0;
}