[−][src]Struct debruijn::Exts
Store single-base extensions for a DNA Debruijn graph.
8 bits, 4 higher order ones represent extensions to the right, 4 lower order ones represent extensions to the left. For each direction the bits (from lower order to higher order) represent whether there exists an extension with each of the letters A, C, G, T. So overall the bits are: right left T G C A T G C A
Fields
val: u8
Implementations
impl Exts
[src]
pub fn new(val: u8) -> Self
[src]
pub fn empty() -> Exts
[src]
pub fn from_single_dirs(left: Exts, right: Exts) -> Exts
[src]
pub fn merge(left: Exts, right: Exts) -> Exts
[src]
pub fn add(&self, v: Exts) -> Exts
[src]
pub fn set(&self, dir: Dir, pos: u8) -> Exts
[src]
pub fn get(&self, dir: Dir) -> Vec<u8>
[src]
pub fn has_ext(&self, dir: Dir, base: u8) -> bool
[src]
pub fn from_slice_bounds(src: &[u8], start: usize, length: usize) -> Exts
[src]
pub fn from_dna_string(src: &DnaString, start: usize, length: usize) -> Exts
[src]
pub fn num_exts_l(&self) -> u8
[src]
pub fn num_exts_r(&self) -> u8
[src]
pub fn num_ext_dir(&self, dir: Dir) -> u8
[src]
pub fn mk_left(base: u8) -> Exts
[src]
pub fn mk_right(base: u8) -> Exts
[src]
pub fn mk(left_base: u8, right_base: u8) -> Exts
[src]
pub fn get_unique_extension(&self, dir: Dir) -> Option<u8>
[src]
pub fn single_dir(&self, dir: Dir) -> Exts
[src]
pub fn complement(&self) -> Exts
[src]
Complement the extension bases for each direction
pub fn reverse(&self) -> Exts
[src]
pub fn rc(&self) -> Exts
[src]
Trait Implementations
impl Clone for Exts
[src]
impl Copy for Exts
[src]
impl Debug for Exts
[src]
impl<'de> Deserialize<'de> for Exts
[src]
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
__D: Deserializer<'de>,
impl Eq for Exts
[src]
impl Hash for Exts
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl Ord for Exts
[src]
fn cmp(&self, other: &Exts) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl PartialEq<Exts> for Exts
[src]
impl PartialOrd<Exts> for Exts
[src]
fn partial_cmp(&self, other: &Exts) -> Option<Ordering>
[src]
fn lt(&self, other: &Exts) -> bool
[src]
fn le(&self, other: &Exts) -> bool
[src]
fn gt(&self, other: &Exts) -> bool
[src]
fn ge(&self, other: &Exts) -> bool
[src]
impl Serialize for Exts
[src]
fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
__S: Serializer,
[src]
__S: Serializer,
impl StructuralEq for Exts
[src]
impl StructuralPartialEq for Exts
[src]
Auto Trait Implementations
impl RefUnwindSafe for Exts
impl Send for Exts
impl Sync for Exts
impl Unpin for Exts
impl UnwindSafe for Exts
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,