quadrank 0.2.0

Fast rank over binary and size-4 DNA alphabets.
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

use crate::binary::BiRanker;
use mem_dbg::MemSize;
use sux::{bits::BitVec, prelude::RankSmall, traits::RankUnchecked};

pub use sux::prelude::Rank9;

// A macro that implements RankerT for the given RankSmall parameters.
macro_rules! impl_rank_small {
    ($T: ty) => {
        impl BiRanker for $T {
            #[inline(always)]
            fn new_packed(seq: &[u64]) -> Self {
                // RankUnchecked::rank_unchecked does not work for `len`, so we add some padding.
                let bits = unsafe {
                    BitVec::from_raw_parts(
                        seq.align_to::<usize>().1.to_vec(),
                        seq.len() * u64::BITS as usize,
                    )
                };
                <$T>::new(bits)
            }

            const HAS_PREFETCH: bool = true;

            #[inline(always)]
            fn prefetch(&self, pos: usize) {
                sux::traits::RankUnchecked::prefetch(&self, pos);
            }

            #[inline(always)]
            fn size(&self) -> usize {
                self.mem_size(Default::default())
            }

            #[inline(always)]
            unsafe fn rank_unchecked(&self, pos: usize) -> u64 {
                unsafe { RankUnchecked::rank_unchecked(self, pos) as u64 }
            }
        }
    };
}

impl_rank_small!(Rank9);
impl_rank_small!(RankSmall<2,9>);
impl_rank_small!(RankSmall<1,9>);
impl_rank_small!(RankSmall<1,10>);
impl_rank_small!(RankSmall<1,11>);
impl_rank_small!(RankSmall<3,13>);

pub type RankSmall0 = RankSmall<2, 9>;
pub type RankSmall1 = RankSmall<1, 9>;
pub type RankSmall2 = RankSmall<1, 10>;
pub type RankSmall3 = RankSmall<1, 11>;
pub type RankSmall4 = RankSmall<3, 13>;