inc-complete 0.10.3

A library for writing incremental computations that re-execute the minimum number of steps when an input is changed
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

use inc_complete::{
    Db, DbHandle, Storage, define_intermediate, intermediate, storage::HashMapStorage,
};

#[derive(Default, Storage)]
struct MyStorage {
    check: HashMapStorage<Foo>,
}

#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
struct Foo(u32);

#[intermediate(id = 0)]
fn foo(ctx: &Foo, db: &DbHandle<MyStorage>) -> u32 {
    if ctx.0 == 0 {
        0
    // Cycle: 7 -> 6 -> 5 -> 4 -> 7
    } else if ctx.0 == 4 {
        Foo(7).get(db)
    // Cycle: 20 -> 19 -> 18 -> 17 -> 16 -> 15 -> 14 -> 13 -> 12 -> 11 -> 10 -> 20
    } else if ctx.0 == 10 {
        Foo(20).get(db)
    } else {
        Foo(ctx.0 - 1).get(db)
    }
}

#[test]
#[should_panic(
    expected = "Cycle:\n  1. Foo(5)\n  2. Foo(4)\n  3. Foo(7)\n  4. Foo(6)\n  5. Foo(5)"
)]
fn find_cycle_of_7() {
    // Cycle: 7 -> 6 -> 5 -> 4 -> 7
    let db = Db::<MyStorage>::new();
    let _ = Foo(5).get(&db);
}

#[test]
#[should_panic(
    expected = "Cycle:\n  1. Foo(16)\n  2. Foo(15)\n  3. Foo(14)\n  4. Foo(13)\n  5. Foo(12)\n  6. Foo(11)\n  7. Foo(10)\n  8. Foo(20)\n  9. Foo(19)\n  10. Foo(18)\n  11. Foo(17)\n  12. Foo(16)"
)]
fn find_cycle_of_20() {
    // Cycle: 20 -> 19 -> 18 -> 17 -> 16 -> 15 -> 14 -> 13 -> 12 -> 11 -> 10 -> 20
    let db = Db::<MyStorage>::new();
    let _ = Foo(16).get(&db);
}