neo_frizbee 0.5.1

Fast fuzzy matching via SIMD smith waterman, similar algorithm to FZF/FZY
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

use crate::one_shot::Appendable;

#[derive(Debug)]
pub(crate) struct ThreadSlice<T> {
    pub slice: *mut T,
    pub pos: usize,
}

unsafe impl<T: Send> Send for ThreadSlice<T> {}
unsafe impl<T: Sync> Sync for ThreadSlice<T> {}

impl<T> ThreadSlice<T> {
    pub fn new(slice: &mut [T]) -> Self {
        ThreadSlice {
            slice: slice.as_mut_ptr(),
            pos: 0,
        }
    }
}

impl<T> Appendable<T> for ThreadSlice<T> {
    fn append(&mut self, value: T) {
        // The consumer of the slice is responsible for ensuring that the slice
        // will never overflow. Thus, we only use this struct when we know we'll create as many
        // matches as there are items in the haystack
        unsafe { self.slice.add(self.pos).write(value) };
        self.pos += 1;
    }
}