hi_sparse_bitset 0.9.0

Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
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

use std::mem::MaybeUninit;
use crate::impl_bitset::Primitive;

pub trait PrimitiveArray: AsRef<[Self::Item]> + AsMut<[Self::Item]> + Copy{
    type Item: Primitive;
    const CAP: usize;

    type UninitArray: UninitPrimitiveArray<InitArray = Self, UninitItem = Self::Item>;
    #[inline]
    fn uninit() -> Self::UninitArray {
        Self::UninitArray::new()
    }
}
impl<T, const N: usize> PrimitiveArray for [T; N]
where
    T: Primitive
{
    type Item = T;
    const CAP: usize = N;
    type UninitArray = [MaybeUninit<Self::Item>; N];
}

#[allow(dead_code)]     // Because not publicly visibile
pub trait UninitPrimitiveArray
    : AsRef<[MaybeUninit<Self::UninitItem>]>
    + AsMut<[MaybeUninit<Self::UninitItem>]>
    + Copy
{
    type InitArray: PrimitiveArray;

    //type Item?
    type UninitItem: Primitive;
    const CAP: usize;

    fn new() -> Self;

    #[inline]
    unsafe fn assume_init(self) -> Self::InitArray {
        std::mem::transmute_copy(&self)
    }
}
impl<T, const N: usize> UninitPrimitiveArray for [MaybeUninit<T>; N]
where
    T: Primitive
{
    type InitArray = [T; N];
    type UninitItem = T;
    const CAP: usize = N;

    #[inline]
    fn new() -> Self{
        // From Rust MaybeUninit::uninit_array() :
        // SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid.
        unsafe { MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init() }
    }
}