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

use crate::binary::BiRanker;
use dyn_size_of::GetSize;

pub use bitm::RankSelect101111;
pub use bitm::RankSimple;

impl BiRanker for bitm::RankSimple {
    fn new_packed(seq: &[u64]) -> Self {
        Self::build(seq.to_vec().into()).0
    }

    fn size(&self) -> usize {
        self.size_bytes()
    }

    unsafe fn rank_unchecked(&self, pos: usize) -> u64 {
        unsafe { bitm::Rank::rank_unchecked(self, pos) as u64 }
    }
}

impl BiRanker for bitm::RankSelect101111 {
    fn new_packed(seq: &[u64]) -> Self {
        Self::build(seq.to_vec().into()).0
    }

    fn size(&self) -> usize {
        self.size_bytes()
    }

    const HAS_PREFETCH: bool = true;

    fn prefetch(&self, pos: usize) {
        bitm::Rank::prefetch(self, pos);
    }

    unsafe fn rank_unchecked(&self, pos: usize) -> u64 {
        unsafe { bitm::Rank::rank_unchecked(self, pos) as u64 }
    }
}