compressed-intvec 0.6.0

Space-efficient integer vectors with fixed-width, variable-length, and sequence-oriented encodings.
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
//! Comprehensive integration tests for iterator functionality in [`SeqVec`].
//!
//! This test suite validates:
//! - [`SeqIter`]: Forward iteration, FusedIterator behavior, sequence termination
//! - [`SeqVecIter`]: Forward/backward iteration, ExactSizeIterator, DoubleEndedIterator
//! - Empty sequences, single-element sequences, mixed iteration patterns

use compressed_intvec::seq::{LESeqVec, SEqVecIter, SeqVec};
use dsi_bitstream::prelude::{BE, LE};
use dsi_bitstream::traits::Endianness;
use std::fmt::Debug;

/// Helper function to run comprehensive iterator tests for a type.
fn run_iterator_tests_for_type<T, E>(sequences: &[Vec<T>], type_name: &str)
where
    T: compressed_intvec::variable::traits::Storable
        + Debug
        + PartialEq
        + Copy
        + Send
        + Sync
        + 'static,
    for<'a> compressed_intvec::seq::iter::SeqVecBitReader<'a, E>: dsi_bitstream::prelude::BitRead<E, Error = core::convert::Infallible>
        + dsi_bitstream::prelude::CodesRead<E>
        + dsi_bitstream::prelude::BitSeek<Error = core::convert::Infallible>,
    E: Endianness + Debug,
    dsi_bitstream::impls::BufBitWriter<E, dsi_bitstream::impls::MemWordWriterVec<u64, Vec<u64>>>:
        dsi_bitstream::prelude::BitWrite<E, Error = core::convert::Infallible>
            + dsi_bitstream::prelude::CodesWrite<E>,
{
    let context = |op: &str| {
        format!(
            "<{}> on {} in <{}>",
            type_name,
            op,
            std::any::type_name::<E>()
        )
    };

    let vec: SeqVec<T, E> = SeqVec::from_slices(&sequences)
        .unwrap_or_else(|e| panic!("Build failed: {} - {}", context("from_slices"), e));

    // --- Test Case 1: Non-empty SeqVecIter ---
    if !sequences.is_empty() {
        // 1.1. Forward iteration with SeqVecIter
        let all_sequences: Vec<Vec<T>> = vec.iter().map(|seq| seq.collect()).collect();
        assert_eq!(
            &all_sequences,
            sequences,
            "SeqVecIter forward iteration mismatch {}",
            context("iter()")
        );

        // 1.2. Reverse iteration with DoubleEndedIterator
        if sequences.len() > 1 {
            let reversed_sequences: Vec<Vec<T>> =
                vec.iter().rev().map(|seq| seq.collect()).collect();
            let mut expected_reversed = sequences.clone();
            expected_reversed.reverse();
            assert_eq!(
                &reversed_sequences,
                &expected_reversed,
                "SeqVecIter reverse iteration mismatch {}",
                context("iter().rev()")
            );
        }

        // 1.3. Mixed forward and backward iteration
        if sequences.len() > 2 {
            let mut mixed_iter = vec.iter();
            let first = mixed_iter.next().map(|seq| seq.collect::<Vec<_>>());
            let last = mixed_iter.next_back().map(|seq| seq.collect::<Vec<_>>());

            assert_eq!(
                first,
                Some(sequences[0].clone()),
                "Mixed iteration: first element mismatch {}",
                context("iter().next()")
            );
            assert_eq!(
                last,
                Some(sequences[sequences.len() - 1].clone()),
                "Mixed iteration: last element mismatch {}",
                context("iter().next_back()")
            );
        }

        // 1.4. ExactSizeIterator
        assert_eq!(
            vec.iter().len(),
            sequences.len(),
            "ExactSizeIterator.len() mismatch {}",
            context("iter().len()")
        );

        // 1.5. FusedIterator behavior - after None, always None
        let mut iter = vec.iter();
        while iter.next().is_some() {}
        assert_eq!(
            iter.next(),
            None,
            "FusedIterator should continue returning None {}",
            context("iter() exhaustion")
        );
    }

    // --- Test Case 2: Individual SeqIter behavior ---
    for (seq_idx, expected_seq) in sequences.iter().enumerate() {
        if let Some(seq_iter) = vec.get(seq_idx) {
            // 2.1. Collect all elements
            let collected: Vec<T> = seq_iter.collect();
            assert_eq!(
                &collected,
                expected_seq,
                "SeqIter[{}] collection mismatch {}",
                seq_idx,
                context("get().collect()")
            );

            // 2.2. Iterator termination at sequence boundary
            if let Some(seq_iter) = vec.get(seq_idx) {
                let mut count = 0;
                for _ in seq_iter {
                    count += 1;
                }
                assert_eq!(
                    count,
                    expected_seq.len(),
                    "SeqIter[{}] count mismatch {}",
                    seq_idx,
                    context("get().count()")
                );
            }

            // 2.3. FusedIterator - after exhaustion, always None
            if let Some(seq_iter) = vec.get(seq_idx) {
                let mut iter = seq_iter;
                while iter.next().is_some() {}
                assert_eq!(
                    iter.next(),
                    None,
                    "SeqIter[{}] should return None after exhaustion {}",
                    seq_idx,
                    context("get() exhaustion")
                );
            }
        }
    }

    // --- Test Case 3: Empty sequences ---
    for (seq_idx, expected_seq) in sequences.iter().enumerate() {
        if expected_seq.is_empty() {
            if let Some(seq_iter) = vec.get(seq_idx) {
                assert_eq!(
                    seq_iter.next(),
                    None,
                    "Empty SeqIter[{}] should return None immediately {}",
                    seq_idx,
                    context("get().next()")
                );
            }
        }
    }

    // --- Test Case 4: SeqVecIter exhaustion ---
    if !sequences.is_empty() {
        let mut iter = vec.iter();
        for _ in 0..sequences.len() {
            assert!(iter.next().is_some());
        }
        // After exhaustion, should always return None
        assert_eq!(iter.next(), None, "SeqVecIter exhaustion mismatch");
        assert_eq!(iter.next(), None, "SeqVecIter should fuse after exhaustion");
    }

    // --- Test Case 5: PartialEq ---
    let vec_clone = vec.clone();
    assert_eq!(
        vec,
        vec_clone,
        "PartialEq: clone must equal original {}",
        context("clone()")
    );

    // Different content should not be equal
    if !sequences.is_empty() && sequences[0].len() > 0 {
        let mut different_sequences = sequences.clone();
        different_sequences[0][0] = different_sequences[0][0].wrapping_add(1);
        if let Ok(vec_different) = SeqVec::from_slices(&different_sequences) {
            assert_ne!(
                vec, vec_different,
                "PartialEq: different content must not be equal"
            );
        }
    }

    // --- Test Case 6: IntoIterator ---
    let vec_into = vec.clone();
    let collected_into: Vec<Vec<T>> = vec_into.into_iter().map(|seq| seq.collect()).collect();
    assert_eq!(
        &collected_into,
        sequences,
        "IntoIterator: consumed vector iteration mismatch {}",
        context("into_iter()")
    );

    // 6.1 IntoIterator with mixed front/back access
    if sequences.len() > 1 {
        let vec_mixed = SeqVec::from_slices(&sequences)
            .unwrap_or_else(|e| panic!("Build failed: {} - {}", context("from_slices"), e));
        let mut into_iter = vec_mixed.into_iter();
        let first = into_iter.next().map(|seq| seq.collect::<Vec<_>>());
        let last = into_iter.next_back().map(|seq| seq.collect::<Vec<_>>());

        assert_eq!(
            first,
            Some(sequences[0].clone()),
            "IntoIterator: first element mismatch {}",
            context("into_iter().next()")
        );
        assert_eq!(
            last,
            Some(sequences[sequences.len() - 1].clone()),
            "IntoIterator: last element mismatch {}",
            context("into_iter().next_back()")
        );
    }
}

// --- Macro for Type-Parameterized Iterator Testing ---

macro_rules! test_iterator_all_types {
    ($test_name:ident, $E:ty) => {
        #[test]
        fn $test_name() {
            // Test with u32
            {
                let sequences: Vec<Vec<u32>> = vec![
                    vec![1, 2, 3],
                    vec![10, 20],
                    vec![],
                    vec![100, 200, 300, 400, 500],
                ];
                run_iterator_tests_for_type::<u32, $E>(&sequences, stringify!(u32));
            }

            // Test with i32
            {
                let sequences: Vec<Vec<i32>> =
                    vec![vec![-1, 2, -3], vec![10, -20], vec![], vec![-100, 200]];
                run_iterator_tests_for_type::<i32, $E>(&sequences, stringify!(i32));
            }

            // Test with u64
            {
                let sequences: Vec<Vec<u64>> = vec![vec![1, 2, 3], vec![100, 200, 300]];
                run_iterator_tests_for_type::<u64, $E>(&sequences, stringify!(u64));
            }
        }
    };
}

test_iterator_all_types!(test_iterator_le, LE);
test_iterator_all_types!(test_iterator_be, BE);

// --- Specific Iterator Edge Cases ---

#[test]
fn test_seq_iter_single_element() {
    let sequences: Vec<Vec<u32>> = vec![vec![42]];
    let vec: LESeqVec<u32> = SeqVec::from_slices(&sequences).unwrap();

    let seq_iter = vec.get(0).unwrap();
    assert_eq!(seq_iter.next(), Some(42));
    let mut iter_after = vec.get(0).unwrap();
    while iter_after.next().is_some() {}
    assert_eq!(iter_after.next(), None, "Should fuse after exhaustion");
}

#[test]
fn test_seqvec_iter_single_sequence() {
    let sequences: Vec<Vec<u32>> = vec![vec![1, 2, 3, 4, 5]];
    let vec: LESeqVec<u32> = SeqVec::from_slices(&sequences).unwrap();

    let mut iter = vec.iter();
    assert_eq!(iter.len(), 1);
    let collected: Vec<u32> = iter.next().unwrap().collect();
    assert_eq!(collected, vec![1, 2, 3, 4, 5]);
    assert_eq!(iter.len(), 0);
    assert_eq!(iter.next(), None);
}

#[test]
fn test_seqvec_iter_double_ended() {
    let sequences: Vec<Vec<u32>> =
        vec![vec![1, 2], vec![3, 4], vec![5, 6], vec![7, 8], vec![9, 10]];
    let vec: LESeqVec<u32> = SeqVec::from_slices(&sequences).unwrap();

    let mut iter = vec.iter();

    // Collect from both ends
    let from_front = iter.next().map(|s| s.collect::<Vec<_>>());
    let from_back = iter.next_back().map(|s| s.collect::<Vec<_>>());

    assert_eq!(from_front, Some(vec![1, 2]));
    assert_eq!(from_back, Some(vec![9, 10]));
    assert_eq!(iter.len(), 3); // 3 sequences left in the middle
}

#[test]
fn test_exact_size_iterator() {
    let sequences: Vec<Vec<u32>> = vec![vec![1], vec![2, 3], vec![4, 5, 6], vec![7, 8, 9, 10]];
    let vec: LESeqVec<u32> = SeqVec::from_slices(&sequences).unwrap();

    let mut iter = vec.iter();
    assert_eq!(iter.len(), 4);
    assert_eq!(iter.size_hint(), (4, Some(4)));

    iter.next();
    assert_eq!(iter.len(), 3);

    iter.next_back();
    assert_eq!(iter.len(), 2);

    iter.next();
    iter.next();
    assert_eq!(iter.len(), 0);
    assert_eq!(iter.next(), None);
}

#[test]
fn test_seqvec_iter_exhaustion_patterns() {
    let sequences: Vec<Vec<u32>> = vec![vec![1], vec![2], vec![3], vec![4]];
    let vec: LESeqVec<u32> = SeqVec::from_slices(&sequences).unwrap();

    // Pattern 1: Exhaust from front
    {
        let mut iter = vec.iter();
        for _ in 0..4 {
            assert!(iter.next().is_some());
        }
        assert_eq!(iter.next(), None);
        assert_eq!(iter.next(), None); // Fused
    }

    // Pattern 2: Exhaust from back
    {
        let mut iter = vec.iter();
        for _ in 0..4 {
            assert!(iter.next_back().is_some());
        }
        assert_eq!(iter.next_back(), None);
        assert_eq!(iter.next_back(), None); // Fused
    }

    // Pattern 3: Alternate front/back until exhaustion
    {
        let mut iter = vec.iter();
        assert!(iter.next().is_some());
        assert!(iter.next_back().is_some());
        assert!(iter.next().is_some());
        assert!(iter.next_back().is_some());
        assert_eq!(iter.next(), None);
        assert_eq!(iter.next_back(), None);
    }
}

#[test]
fn test_all_empty_sequences_iteration() {
    let sequences: Vec<Vec<u32>> = vec![vec![], vec![], vec![]];
    let vec: LESeqVec<u32> = SeqVec::from_slices(&sequences).unwrap();

    let collected: Vec<Vec<u32>> = vec.iter().map(|seq| seq.collect()).collect();
    assert_eq!(collected.len(), 3);
    for seq in collected {
        assert!(seq.is_empty());
    }
}

#[test]
fn test_mixed_empty_non_empty_iteration() {
    let sequences: Vec<Vec<u32>> = vec![vec![1, 2], vec![], vec![3], vec![], vec![4, 5, 6]];
    let vec: LESeqVec<u32> = SeqVec::from_slices(&sequences).unwrap();

    let collected: Vec<Vec<u32>> = vec.iter().map(|seq| seq.collect()).collect();
    assert_eq!(collected.len(), 5);
    assert_eq!(collected[0], vec![1, 2]);
    assert!(collected[1].is_empty());
    assert_eq!(collected[2], vec![3]);
    assert!(collected[3].is_empty());
    assert_eq!(collected[4], vec![4, 5, 6]);
}

#[test]
fn test_seq_iter_termination_accuracy() {
    // Verify that SeqIter terminates exactly at sequence boundaries
    let seq1 = vec![1, 2, 3];
    let seq2 = vec![10, 20, 30, 40];
    let sequences: Vec<Vec<u32>> = vec![seq1.clone(), seq2.clone()];
    let vec: LESeqVec<u32> = SeqVec::from_slices(&sequences).unwrap();

    // Get first sequence
    let collected1: Vec<u32> = vec.get(0).unwrap().collect();
    assert_eq!(collected1, seq1, "First sequence must terminate correctly");

    // Get second sequence
    let collected2: Vec<u32> = vec.get(1).unwrap().collect();
    assert_eq!(collected2, seq2, "Second sequence must not include first");
}