cyclotron 0.0.3

Cycle-aware memoization with automatic fixpoints.
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
52
53
54
55
56
57

use cyclotron::bruteforce;
use cyclotron::lazy_set::LazySet as _;

use std::collections::BTreeSet;

fn collatz_next(x: u64) -> u64 {
    if x % 2 == 0 {
        x / 2
    } else {
        3 * x + 1
    }
}

fn test(name: &str, mut collatz_all: impl FnMut(u64) -> BTreeSet<u64>) {
    eprintln!("Testing {}:", name);
    eprintln!("  collatz_all(19) = {:?}", collatz_all(19));
    eprintln!("  collatz_all(2) = {:?}", collatz_all(2));
}

fn test_bruteforce() {
    test(
        "bruteforce",
        bruteforce::memoize(|collatz_all, x| -> BTreeSet<u64> {
            let next = collatz_next(x);
            let mut set = collatz_all(next);
            set.insert(next);
            set
        }),
    );
}

fn test_lazy_set() {
    use cyclotron::lazy_set::{self, call, one};

    let collatz_all = call;
    let collatz_all = |x| {
        let next = collatz_next(x);
        collatz_all(next).union(one(next))
    };

    // Bruteforce `LazySet` execution.
    test(
        "lazy_set/bruteforce",
        bruteforce::memoize(lazy_set::to_eager(collatz_all)),
    );

    // Depth-first as-needed `LazySet` execution.
    test(
        "lazy_set/depth_first",
        lazy_set::depth_first::memoize(collatz_all),
    );
}

fn main() {
    test_bruteforce();
    test_lazy_set();
}