Enum bio::data_structures::fmindex::BackwardSearchResult
source · pub enum BackwardSearchResult {
Complete(Interval),
Partial(Interval, usize),
Absent,
}
Expand description
This enum represents the potential result states
from a backward_search in the fm index. The
potential variants of the enum are:
Complete(Interval) — the query matched completely. The interval is the
range of suffix array indices matching the query string.
Partial(Intarval, usize) - some suffix of the query matched, but not the whole query.
The interval returned is the range of suffix array indices for the maximal
matching suffix, and the usize
is the length of the maximal matching suffix.
Absent - None suffix of the pattern matched in the text.
Variants§
Trait Implementations§
source§impl Clone for BackwardSearchResult
impl Clone for BackwardSearchResult
source§fn clone(&self) -> BackwardSearchResult
fn clone(&self) -> BackwardSearchResult
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Debug for BackwardSearchResult
impl Debug for BackwardSearchResult
source§impl<'de> Deserialize<'de> for BackwardSearchResult
impl<'de> Deserialize<'de> for BackwardSearchResult
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 Hash for BackwardSearchResult
impl Hash for BackwardSearchResult
source§impl Ord for BackwardSearchResult
impl Ord for BackwardSearchResult
source§fn cmp(&self, other: &BackwardSearchResult) -> Ordering
fn cmp(&self, other: &BackwardSearchResult) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl PartialEq<BackwardSearchResult> for BackwardSearchResult
impl PartialEq<BackwardSearchResult> for BackwardSearchResult
source§fn eq(&self, other: &BackwardSearchResult) -> bool
fn eq(&self, other: &BackwardSearchResult) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl PartialOrd<BackwardSearchResult> for BackwardSearchResult
impl PartialOrd<BackwardSearchResult> for BackwardSearchResult
source§fn partial_cmp(&self, other: &BackwardSearchResult) -> Option<Ordering>
fn partial_cmp(&self, other: &BackwardSearchResult) -> Option<Ordering>
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 moresource§impl Serialize for BackwardSearchResult
impl Serialize for BackwardSearchResult
impl Copy for BackwardSearchResult
impl Eq for BackwardSearchResult
impl StructuralEq for BackwardSearchResult
impl StructuralPartialEq for BackwardSearchResult
Auto Trait Implementations§
impl RefUnwindSafe for BackwardSearchResult
impl Send for BackwardSearchResult
impl Sync for BackwardSearchResult
impl Unpin for BackwardSearchResult
impl UnwindSafe for BackwardSearchResult
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.