Struct debruijn::kmer::IntKmer

pub struct IntKmer<T: PrimInt + FromPrimitive + IntHelp> {
    pub storage: T,
}

A Kmer sequence with a statically know K. K will fill the underlying integer type.

Fields

storage: T

Implementations

impl<T: PrimInt + FromPrimitive + Hash + IntHelp> IntKmer<T>

pub fn top_mask(n_bases: usize) -> T

pub fn bottom_mask(n_bases: usize) -> T

Trait Implementations

impl<T: Clone + PrimInt + FromPrimitive + IntHelp> Clone for IntKmer<T>

fn clone(&self) -> IntKmer<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Copy + PrimInt + FromPrimitive + IntHelp> Copy for IntKmer<T>

impl<T: PrimInt + FromPrimitive + Hash + IntHelp> Debug for IntKmer<T>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'de, T: PrimInt + FromPrimitive + IntHelp> Deserialize<'de> for IntKmer<T> where
    T: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<T: Eq + PrimInt + FromPrimitive + IntHelp> Eq for IntKmer<T>

impl<T: Hash + PrimInt + FromPrimitive + IntHelp> Hash for IntKmer<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<T: PrimInt + FromPrimitive + Hash + IntHelp> Kmer for IntKmer<T>

fn empty() -> Self

Create a Kmer initialized to all A's

fn k() -> usize

K value for this concrete type.

fn from_u64(v: u64) -> IntKmer<T>

fn to_u64(&self) -> u64

Return the rank of this kmer in an lexicographic ordering of all kmers E.g. 'AAAA' -> 0, 'AAAT' -> 1, etc. This will panic if K > 32.

fn extend_left(&self, v: u8) -> Self

Shift the base v into the left end of the kmer

fn extend_right(&self, v: u8) -> Self

Add the base v to the right side of the sequence, and remove the leftmost base

fn extend(&self, v: u8, dir: Dir) -> Self

Add the base v to the side of sequence given by dir, and remove a base at the opposite side

fn get_extensions(&self, exts: Exts, dir: Dir) -> Vec<Self>

Generate all the extension of this sequence given by exts in direction Dir

fn min_rc_flip(&self) -> (Self, bool)

Return the minimum of the kmer and it's reverse complement, and a flag indicating if sequence was flipped

fn min_rc(&self) -> Self

fn is_palindrome(&self) -> bool

Test if this Kmer and it's reverse complement are the same

fn from_bytes(bytes: &[u8]) -> Self

Create a Kmer from the first K bytes of bytes, which must be encoded as the integers 0-4.

fn from_ascii(bytes: &[u8]) -> Self

Create a Kmer from the first K bytes of bytes, which must be encoded as ASCII letters A,C,G, or T.

fn to_string(&self) -> String

Return String containing Kmer sequence

fn kmers_from_bytes(str: &[u8]) -> Vec<Self>

Generate vector of all kmers contained in str encoded as 0-4.

fn kmers_from_ascii(str: &[u8]) -> Vec<Self>

Generate vector of all kmers contained in str, encoded as ASCII ACGT.

impl<T: PrimInt + FromPrimitive + Hash + IntHelp> Mer for IntKmer<T>

fn len(&self) -> usize

Length of DNA sequence

fn get(&self, pos: usize) -> u8

Get the letter at the given position.

fn set_mut(&mut self, pos: usize, v: u8)

Set base at pos to 2-bit encoded base val

fn set_slice_mut(&mut self, pos: usize, n_bases: usize, value: u64)

Set a slice of bases in the kmer, using the packed representation in value. Sets n_bases, starting at pos. Bases must always be packed into the upper-most bits of the value.

fn rc(&self) -> Self

Return the reverse complement of this kmer

fn at_count(&self) -> u32

Count the number of A/T bases in the kmer

fn gc_count(&self) -> u32

Count the number of G/C bases in the kmer

fn iter<'a>(&'a self) -> MerIter<'a, Self>

Iterate over the bases in the sequence

impl<T: Ord + PrimInt + FromPrimitive + IntHelp> Ord for IntKmer<T>

fn cmp(&self, other: &IntKmer<T>) -> Ordering

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<T: PartialEq + PrimInt + FromPrimitive + IntHelp> PartialEq<IntKmer<T>> for IntKmer<T>

fn eq(&self, other: &IntKmer<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &IntKmer<T>) -> bool

This method tests for !=.

impl<T: PartialOrd + PrimInt + FromPrimitive + IntHelp> PartialOrd<IntKmer<T>> for IntKmer<T>

fn partial_cmp(&self, other: &IntKmer<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &IntKmer<T>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &IntKmer<T>) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &IntKmer<T>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &IntKmer<T>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: PrimInt + FromPrimitive + IntHelp> Serialize for IntKmer<T> where
    T: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<T: PrimInt + FromPrimitive + IntHelp> StructuralEq for IntKmer<T>

impl<T: PrimInt + FromPrimitive + IntHelp> StructuralPartialEq for IntKmer<T>