chunked_vec 0.3.4

A vector-like data structure that stores elements in fixed-size chunks for better memory management
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

use crate::ChunkedVec;

/// Implementation of the Default trait for ChunkedVec.
///
/// This implementation provides a way to create an empty ChunkedVec using the default() method.
/// The created vector will use the default chunk size (64) and have no pre-allocated chunks.
///
/// # Examples
/// ```
/// use chunked_vec::ChunkedVec;
/// let vec: ChunkedVec<i32> = ChunkedVec::default();
/// assert!(vec.is_empty());
/// ```
impl<T> Default for ChunkedVec<T> {
    fn default() -> Self {
        Self::new()
    }
}

// TODO: Temporary implementation to cope with doctest
// src/operations.rs:169
impl<T, const N: usize, const M: usize> PartialEq<[T; M]> for ChunkedVec<T, N>
where
    T: PartialEq,
{
    fn eq(&self, other: &[T; M]) -> bool {
        self.iter().eq(other.iter())
    }
}

impl<T, const N: usize> Extend<T> for ChunkedVec<T, N> {
    fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
        for item in iter {
            self.push(item);
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn test_default() {
        let vec = ChunkedVec::<()>::default();
        assert_eq!(vec.len(), 0);
    }
}