Struct debruijn::Exts [−][src]
pub struct Exts {
pub val: u8,
}
Expand description
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
Complement the extension bases for each direction
Trait Implementations
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
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
Auto Trait Implementations
impl RefUnwindSafe for Exts
impl UnwindSafe for Exts
Blanket Implementations
Mutably borrows from an owned value. Read more