Struct bam::index::LinearIndex

pub struct LinearIndex { /* fields omitted */ }

Stores linear index: for each tiling 16384bp window it stores the smallest file offset of an alignment that overlaps it.

Implementations

impl LinearIndex

pub fn is_empty(&self) -> bool

Returns true if the linear index is empty.

pub fn smallest_offset(&self) -> VirtualOffset

Returns the first offset. Panics, if the index is empty.

pub fn intervals(&self) -> &[(u32, VirtualOffset)]

Returns a slice where each element represents a first window with a specific offset in form of (index, offset).

pub fn min_end_offset(&self, start: i32) -> VirtualOffset

Retuns an offset x, such that for a region with genomic coordinates [start-end) we only need to visit chunks with end offset > x.

Trait Implementations

impl Clone for LinearIndex

fn clone(&self) -> LinearIndex

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Display for LinearIndex

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.