Struct bio::data_structures::bwt::Occ
source · pub struct Occ { /* private fields */ }
Expand description
An occurrence array implementation.
Implementations§
source§impl Occ
impl Occ
sourcepub fn new(bwt: &BWTSlice, k: u32, alphabet: &Alphabet) -> Self
pub fn new(bwt: &BWTSlice, k: u32, alphabet: &Alphabet) -> Self
Calculate occ array with sampling from BWT of length n. Time complexity: O(n). Space complexity: O(n / k * A) with A being the alphabet size. The specified alphabet must match the alphabet of the text and its BWT. For large texts, it is advisable to transform the text before calculating the BWT (see alphabets::rank_transform).
Arguments
bwt
- the BWTk
- the sampling rate: every k-th entry will be stored
Trait Implementations§
source§impl<'de> Deserialize<'de> for Occ
impl<'de> Deserialize<'de> for Occ
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Ord for Occ
impl Ord for Occ
source§impl PartialOrd<Occ> for Occ
impl PartialOrd<Occ> for Occ
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Eq for Occ
impl StructuralEq for Occ
impl StructuralPartialEq for Occ
Auto Trait Implementations§
impl RefUnwindSafe for Occ
impl Send for Occ
impl Sync for Occ
impl Unpin for Occ
impl UnwindSafe for Occ
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.