flat-tree 6.0.0

Series of functions to map a binary tree to a list
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

extern crate flat_tree;

#[test]
fn iterator() {
  let mut iterator = flat_tree::Iterator::default();
  assert_eq!(iterator.index(), 0);
  assert_eq!(iterator.prev(), 0);
  assert!(iterator.is_left());
  assert!(!iterator.is_right());
  assert_eq!(iterator.parent(), 1);
  assert_eq!(iterator.offset(), 0);
  assert_eq!(iterator.parent(), 3);
  assert_eq!(iterator.offset(), 0);
  assert_eq!(iterator.parent(), 7);
  assert_eq!(iterator.offset(), 0);
  assert_eq!(iterator.right_child(), 11);
  assert_eq!(iterator.left_child(), 9);
  assert_eq!(iterator.next(), Some(13));
  assert!(!iterator.is_left());
  assert!(iterator.is_right());
  assert_eq!(iterator.left_span(), 12);
  assert_eq!(iterator.next(), Some(14));
  assert_eq!(iterator.next(), Some(16));
  assert_eq!(iterator.offset(), 8);
  assert_eq!(iterator.parent(), 17);
  assert_eq!(iterator.offset(), 4);
  assert_eq!(iterator.parent(), 19);
  assert_eq!(iterator.offset(), 2);
  assert_eq!(iterator.parent(), 23);
  assert_eq!(iterator.offset(), 1);
  assert_eq!(iterator.right_span(), 30);

  iterator.seek(23);

  assert_eq!(iterator.index(), 23);
  assert_eq!(iterator.offset(), 1);
  assert_eq!(iterator.right_child(), 27);
  assert_eq!(iterator.sibling(), 19);
  assert_eq!(iterator.prev(), 11);
  assert_eq!(iterator.left_child(), 9);
  assert_eq!(iterator.prev(), 5);
  assert_eq!(iterator.left_child(), 4);
  assert_eq!(iterator.prev(), 2);
  assert_eq!(iterator.prev(), 0);
}

#[test]
fn non_leaf_start() {
  let mut iterator = flat_tree::Iterator::new(1);
  assert_eq!(iterator.index(), 1);
  assert_eq!(iterator.parent(), 3);
  assert_eq!(iterator.parent(), 7);
  assert_eq!(iterator.right_child(), 11);
  assert_eq!(iterator.left_child(), 9);
  assert_eq!(iterator.next(), Some(13));
  assert_eq!(iterator.left_span(), 12);
}