simdphrase 0.1.1

Extremely fast phrase search implementation.
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

use std::{
    alloc::{alloc, dealloc, Allocator},
    ptr::NonNull,
};

use rkyv::{Archive, Serialize};

#[derive(Default, Archive, Serialize)]
pub struct AlignedAllocator<const N: usize>;
unsafe impl<const N: usize> Allocator for AlignedAllocator<N> {
    fn allocate(
        &self,
        layout: std::alloc::Layout,
    ) -> Result<std::ptr::NonNull<[u8]>, std::alloc::AllocError> {
        const { assert!(N.is_power_of_two()) };
        const { assert!(N != 0) };
        unsafe {
            // This probably will never fail, if it does
            // what can I do ? Let it crash, something
            // went wrong.
            let p = alloc(layout.align_to(N).unwrap());
            let s = std::ptr::slice_from_raw_parts_mut(p, layout.size());
            #[cfg(debug_assertions)]
            return NonNull::new(s).ok_or(std::alloc::AllocError);

            #[cfg(not(debug_assertions))]
            return Ok(NonNull::new_unchecked(s));
        }
    }

    unsafe fn deallocate(&self, ptr: std::ptr::NonNull<u8>, layout: std::alloc::Layout) {
        // This probably will never fail, if it does
        // what can I do ? Let it crash, something
        // went wrong.
        dealloc(ptr.as_ptr(), layout.align_to(N).unwrap());
    }
}

pub type Aligned64 = AlignedAllocator<64>;