Struct bitm::BinaryRankSearch

pub struct BinaryRankSearch;

A select strategy for RankSelect101111 that does not introduce any overhead (on space or construction speed) and is based on a binary search over ranks.

Trait Implementations

impl Clone for BinaryRankSearch

fn clone(&self) -> BinaryRankSearch

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl GetSize for BinaryRankSearch

fn size_bytes_dyn(&self) -> usize

Returns approximate number of bytes occupied by dynamic (heap) part of self. Same as self.size_bytes() - std::mem::size_of_val(self).

fn size_bytes_content_dyn(&self) -> usize

Returns approximate number of bytes occupied by dynamic (heap) part of self content. It usually equals to size_bytes_dyn(). However, sometimes it is smaller by the amount of memory reserved but not yet used (e.g., size_bytes_content_dyn() only takes into account the length of the vector and not its capacity).

fn size_bytes(&self) -> usize

Returns approximate, total (including heap memory) number of bytes occupied by self.

const USES_DYN_MEM: bool = false

true if and only if the variables of this type can use dynamic (heap) memory.

impl Select0ForRank101111 for BinaryRankSearch

fn new0( _content: &[u64], _l1ranks: &[usize], _l2ranks: &[u64], _total_rank: usize ) -> Self

fn select0( &self, content: &[u64], l1ranks: &[usize], l2ranks: &[u64], rank: usize ) -> Option<usize>

unsafe fn select0_unchecked( &self, content: &[u64], l1ranks: &[usize], l2ranks: &[u64], rank: usize ) -> usize

impl SelectForRank101111 for BinaryRankSearch

fn new( _content: &[u64], _l1ranks: &[usize], _l2ranks: &[u64], _total_rank: usize ) -> Self

fn select( &self, content: &[u64], l1ranks: &[usize], l2ranks: &[u64], rank: usize ) -> Option<usize>

unsafe fn select_unchecked( &self, content: &[u64], l1ranks: &[usize], l2ranks: &[u64], rank: usize ) -> usize

impl Copy for BinaryRankSearch