Struct lt_fm_index::use_case::LtFmIndex [−][src]
pub struct LtFmIndex<C: CountArray, B: Bwt> { /* fields omitted */ }
Implementations
Trait Implementations
impl<'de, C: CountArray, B: Bwt> Deserialize<'de> for LtFmIndex<C, B> where
C: Deserialize<'de>,
B: Deserialize<'de>,
impl<'de, C: CountArray, B: Bwt> Deserialize<'de> for LtFmIndex<C, B> where
C: Deserialize<'de>,
B: Deserialize<'de>,
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
Auto Trait Implementations
impl<C, B> RefUnwindSafe for LtFmIndex<C, B> where
B: RefUnwindSafe,
C: RefUnwindSafe,
impl<C, B> UnwindSafe for LtFmIndex<C, B> where
B: UnwindSafe,
C: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.