Struct GIntervalMap 

pub struct GIntervalMap<D>(/* private fields */);

A map from genomic internvals to values, internally represented as a interval tree for efficient queries. Note that GIntervalMap permits duplicated records.

Implementations

impl<D> GIntervalMap<D>

pub fn new() -> Self

Create a new empty GIntervalMap.

pub fn len(&self) -> usize

Return the number of records.

pub fn iter(&self) -> Iter<'_, D>

Iterate over all records in the map. The records are returned in sorted order. The order is determined by the chromosome (string comparison) and the start position and end position of the intervals.

pub fn insert<B: BEDLike>(&mut self, bed: &B, value: D)

This is very inefficient and should be avoided if possible.

pub fn find<B: BEDLike>(&self, bed: &B) -> GIntervalQueryIter<'_, D>

Return regions that overlaop with the query.

pub fn is_overlapped<B: BEDLike>(&self, bed: &B) -> bool

Determine if the query overlaps with any record.

Trait Implementations

impl<D: Clone> Clone for GIntervalMap<D>

fn clone(&self) -> GIntervalMap<D>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<D: Debug> Debug for GIntervalMap<D>

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

Formats the value using the given formatter.

impl<B: BEDLike, D> FromIterator<(B, D)> for GIntervalMap<D>

fn from_iter<I: IntoIterator<Item = (B, D)>>(iter: I) -> Self

Creates a value from an iterator.