flatk 0.1.0

Flat layout abstraction toolkit.
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161

/// This suite of tests checks various ways to index collections using the `Get` trait.
use flatk::*;

/// Get a subview from this `UniChunked` collection according to the given
/// range. If the range is a single index, then a single chunk is returned
/// instead.
#[test]
fn get_unichunked() {
    let v = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12];
    let s = Chunked3::from_flat(v.view());

    assert_eq!(s.get(2), Some(&[7, 8, 9])); // Single index
    assert_eq!(s.get(2), Some(&s[2]));

    let r = s.get(1..3).unwrap(); // Range
    let mut iter = r.iter();
    assert_eq!(Some(&[4, 5, 6]), iter.next());
    assert_eq!(Some(&[7, 8, 9]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.get(2..).unwrap(); // RangeFrom
    let mut iter = r.iter();
    assert_eq!(Some(&[7, 8, 9]), iter.next());
    assert_eq!(Some(&[10, 11, 12]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.get(..2).unwrap(); // RangeTo
    let mut iter = r.iter();
    assert_eq!(Some(&[1, 2, 3]), iter.next());
    assert_eq!(Some(&[4, 5, 6]), iter.next());
    assert_eq!(None, iter.next());

    assert_eq!(s.view(), s.get(..).unwrap()); // RangeFull
    assert_eq!(s.view(), s.view().get(..).unwrap());

    let r = s.get(1..=2).unwrap(); // RangeInclusive
    let mut iter = r.iter();
    assert_eq!(Some(&[4, 5, 6]), iter.next());
    assert_eq!(Some(&[7, 8, 9]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.get(..=1).unwrap(); // RangeToInclusive
    let mut iter = r.iter();
    assert_eq!(Some(&[1, 2, 3]), iter.next());
    assert_eq!(Some(&[4, 5, 6]), iter.next());
    assert_eq!(None, iter.next());
}

#[test]
fn isolate_unichunked() {
    let v = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12];
    let s = Chunked3::from_flat(v.view());

    assert_eq!(s.view().try_isolate(2), Some(&[7, 8, 9])); // Single index
    assert_eq!(s.view().try_isolate(2), Some(&s[2]));

    let r = s.view().isolate(1..3); // Range
    let mut iter = r.iter();
    assert_eq!(Some(&[4, 5, 6]), iter.next());
    assert_eq!(Some(&[7, 8, 9]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.view().isolate(2..); // RangeFrom
    let mut iter = r.iter();
    assert_eq!(Some(&[7, 8, 9]), iter.next());
    assert_eq!(Some(&[10, 11, 12]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.view().isolate(..2); // RangeTo
    let mut iter = r.iter();
    assert_eq!(Some(&[1, 2, 3]), iter.next());
    assert_eq!(Some(&[4, 5, 6]), iter.next());
    assert_eq!(None, iter.next());

    assert_eq!(s.view(), s.view().isolate(..)); // RangeFull

    let r = s.view().isolate(1..=2); // RangeInclusive
    let mut iter = r.iter();
    assert_eq!(Some(&[4, 5, 6]), iter.next());
    assert_eq!(Some(&[7, 8, 9]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.view().isolate(..=1); // RangeToInclusive
    let mut iter = r.iter();
    assert_eq!(Some(&[1, 2, 3]), iter.next());
    assert_eq!(Some(&[4, 5, 6]), iter.next());
    assert_eq!(None, iter.next());
}

#[test]
fn isolate_nested_unichunked() {
    let v = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12];
    let s = Chunked3::from_flat(Chunked2::from_flat(v.view()));

    assert_eq!(s.view().isolate(0).isolate(0), &[1, 2]);
    assert_eq!(s.view().isolate(0).isolate(1), &[3, 4]);
    assert_eq!(s.view().isolate(0).isolate(2), &[5, 6]);

    assert_eq!(s.view().isolate(1).isolate(0), &[7, 8]);
    assert_eq!(s.view().isolate(1).isolate(1), &[9, 10]);
    assert_eq!(s.view().isolate(1).isolate(2), &[11, 12]);
}

/// Get a subview from this `Chunked` collection according to the given
/// range. If the range is a single index, then a single chunk is returned
/// instead.
#[test]
fn get_chunked() {
    let v = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11];
    let s = Chunked::from_offsets(vec![0, 3, 4, 6, 9, 11], v.clone());
    let s = s.view();

    assert_eq!(s.get(2), Some(&s[2])); // Single index

    let r = s.get(1..3).unwrap(); // Range
    let mut iter = r.iter();
    assert_eq!(Some(&[4][..]), iter.next());
    assert_eq!(Some(&[5, 6][..]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.get(3..).unwrap(); // RangeFrom
    let mut iter = r.iter();
    assert_eq!(Some(&[7, 8, 9][..]), iter.next());
    assert_eq!(Some(&[10, 11][..]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.get(..2).unwrap(); // RangeTo
    let mut iter = r.iter();
    assert_eq!(Some(&[1, 2, 3][..]), iter.next());
    assert_eq!(Some(&[4][..]), iter.next());
    assert_eq!(None, iter.next());

    assert_eq!(s.view(), s.get(..).unwrap()); // RangeFull
    assert_eq!(s.view(), s.view().get(..).unwrap());

    let r = s.get(1..=2).unwrap(); // RangeInclusive
    let mut iter = r.iter();
    assert_eq!(Some(&[4][..]), iter.next());
    assert_eq!(Some(&[5, 6][..]), iter.next());
    assert_eq!(None, iter.next());

    let r = s.get(..=1).unwrap(); // RangeToInclusive
    let mut iter = r.iter();
    assert_eq!(Some(&[1, 2, 3][..]), iter.next());
    assert_eq!(Some(&[4][..]), iter.next());
    assert_eq!(None, iter.next());
}

#[test]
fn get_selected() {
    let v = vec![1, 2, 3, 4, 5];
    let selection = Select::new(vec![0, 0, 4], v.as_slice());
    assert_eq!((0, &1), selection.get(1).unwrap());
}

#[test]
fn get_subset() {
    let mut v = vec![1, 2, 3, 4, 5];
    let subset = Subset::from_indices(vec![0, 2, 4], v.as_mut_slice());
    assert_eq!(&3, subset.view().get(1).unwrap());
}