pub struct Alignfold<T, U> {
pub align: Align<T>,
pub basepairs: SparsePosMat<U>,
pub unpairs: SparsePoss<U>,
}
Fields§
§align: Align<T>
§basepairs: SparsePosMat<U>
§unpairs: SparsePoss<U>
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<T, U> RefUnwindSafe for Alignfold<T, U>where T: RefUnwindSafe, U: RefUnwindSafe,
impl<T, U> Send for Alignfold<T, U>where T: Send, U: Send,
impl<T, U> Sync for Alignfold<T, U>where T: Sync, U: Sync,
impl<T, U> Unpin for Alignfold<T, U>where T: Unpin, U: Unpin,
impl<T, U> UnwindSafe for Alignfold<T, U>where T: UnwindSafe, U: UnwindSafe,
Blanket Implementations§
§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.