Struct scailist::ScAIList

pub struct ScAIList<T: Clone + Eq + Debug> { /* fields omitted */ }

This is the main object of this repo, see associated methods

Methods

impl<T: Clone + Eq + Debug> ScAIList<T>

The ScAIList itself

pub fn new(
    input_intervals: Vec<Interval<T>>,
    min_cov_len: Option<usize>
) -> Self

Create a new ScAIList out of the passed in intervals. The min_cov_len should probably be left as default, which is 20. It dictates how far ahead to look from a given point to determine if that interval covers enough other intervals to be moved to a sublist. The number of intervals it has to cover is equal to min_cov_len / 2. The number of sublists that might be fored is capped at intervals.len().log2(), but if there aren't many overlaps, fewer will be created.

pub fn upper_bound(stop: u32, intervals: &[Interval<T>]) -> Option<usize>

Binary search to find the right most index where interval.start < query.stop

Important traits for IterScAIList<'a, T>

impl<'a, T: Clone + Eq + Debug> Iterator for IterScAIList<'a, T> type Item = &'a Interval<T>;

pub fn iter(&self) -> IterScAIList<T>

Important traits for IterFind<'a, T>

impl<'a, T: Clone + Eq + Debug> Iterator for IterFind<'a, T> type Item = &'a Interval<T>;

pub fn find(&self, start: u32, stop: u32) -> IterFind<T>

Trait Implementations

impl<T: Debug + Clone + Eq> Debug for ScAIList<T>

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

Formats the value using the given formatter.