discrete 0.2.1

Combinatorial phantom types for discrete mathematics
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
58
59
60
61

/*

    Zero - implement unitialized element for all spaces.

    First, implement all lacking combinations.

    - [ ] Dimension
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>
    - [ ] Pair
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>
    - [ ] EqPair
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>
    - [ ] NeqPair
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>
    - [ ] DimensionN
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>
    - [ ] Context
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>
    - [ ] DirectedContext
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>
    - [ ] Permutation
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>
    - [ ] PowerSet
        - [x] Data
        - [x] Subspace<T>
        - [x] Of<T>

*/

extern crate discrete;

use discrete::*;

fn main() {
    let dir: Context<Of<Context>> = Construct::new();
    let ref dim = vec![vec![2, 2], vec![2, 2]];
    let count = dir.count(dim);
    let mut pos = dir.zero(dim);
    for i in 0..count {
        dir.to_pos(dim, i, &mut pos);
        print!("{:?}", pos);
        println!(" => {}", dir.to_index(dim, &pos));
    }
    println!("count {}", count);
}