eyros 2.0.0

multi-dimensional interval database
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113

extern crate eyros;
#[path="../src/planner.rs"]
mod planner;
use planner::plan;

#[path="../src/bits.rs"]
mod bits;
use bits::{num_to_bits};

macro_rules! bits {
  (_ 0) => { false };
  (_ 1) => { true };
  ($($x:tt),*) => { vec![$(bits![_ $x]),*] };
}

#[test]
fn planner () {
  let p0 = plan(
    &num_to_bits(6),
    &bits![0,1,1,0,1]
  );
  assert_eq!(p0, vec![(3,vec![1,2],vec![1])]);
  check_sums(p0);

  let p1 = plan(
    &bits![0,1,1],
    &bits![0,1,1,0,1]
  );
  assert_eq!(p1, vec![(3,vec![1,2],vec![1])]);
  check_sums(p1);

  let p2 = plan(
    &bits![1,1,1,0,1],
    &bits![0,1,1,0,1,1,1,0]
  );
  assert_eq!(p2, vec![
    (0,vec![0],vec![]),
    (3,vec![1,2],vec![1]),
    (7,vec![4],vec![4,5,6])
  ]);
  check_sums(p2);

  let p3 = plan(
    &bits![0,1,1,0,0,0,1,0,1,1,1,0,1,0,0],
    &bits![1,0,1,1,1,0,1,0,1,0,0,1,1,1,0]
  );
  assert_eq!(p3, vec![
    (1,vec![1],vec![]),
    (5,vec![2],vec![2,3,4]),
    (7,vec![6],vec![6]),
    (14,vec![8,9,10,12],vec![8,11,13])
  ]);
  check_sums(p3);

  let p4 = plan(
    &bits![1,0,1,1],
    &bits![1,1,0,0]
  );
  assert_eq!(p4, vec![
    (4,vec![0,2,3],vec![0,1])
  ]);
  check_sums(p4);

  let p5 = plan(
    &bits![1,1,1,1,1,1],
    &bits![1,1,1,1,1,1]
  );
  assert_eq!(p5, vec![
    (6,vec![0,1,2,3,4,5],vec![0])
  ]);
  check_sums(p5);
}

#[test]
fn planner_empty_tree () {
  let p0 = plan(
    &bits![1],
    &bits![]
  );
  assert_eq!(p0, vec![(0,vec![0],vec![])]);

  let p1 = plan(
    &bits![1,0,1],
    &bits![]
  );
  assert_eq!(p1, vec![
    (0,vec![0],vec![]),
    (2,vec![2],vec![])
  ]);

  let p2 = plan(
    &bits![0,0,0,1],
    &bits![]
  );
  assert_eq!(p2, vec![
    (3,vec![3],vec![])
  ]);

  let p3 = plan(
    &bits![],
    &bits![]
  );
  assert_eq!(p3, vec![]);
}

fn check_sums (merges: Vec<(usize,Vec<usize>,Vec<usize>)>) -> () {
  for m in merges {
    let mut sum = 0;
    for x in m.1 { sum += 2u64.pow(x as u32) }
    for x in m.2 { sum += 2u64.pow(x as u32) }
    assert_eq!(2u64.pow(m.0 as u32), sum);
  }
}