Enum sigalign_impl::pattern_index::dynamic_lfi::DynamicLfi

source · 
pub enum DynamicLfi {
    B2(Lfi32B2V64),
    B3(Lfi32B3V64),
    B4(Lfi32B4V64),
    B5(Lfi32B5V64),
}

Variants§

§

B2(Lfi32B2V64)

§

B3(Lfi32B3V64)

§

B4(Lfi32B4V64)

§

B5(Lfi32B5V64)

Trait Implementations§

source§

impl EstimateSize for DynamicLfi

source§

fn serialized_size(&self) -> usize

source§

impl PatternIndex for DynamicLfi

§

type Option = DynamicLfiOption

§

type BuildError = LfiBuildError

source§

fn new( concatenated_sequence: Vec<u8>, option: Self::Option ) -> Result<Self, Self::BuildError>

Create a new PatternIndex instance with the given concatenated sequence.
source§

fn get_sorted_positions(&self, pattern: &[u8]) -> Vec<u32>

Get sorted positions of the given pattern in concatenated sequence.
source§

impl Serialize for DynamicLfi

source§

fn save_to<W>(&self, writer: W) -> Result<(), Error>
where W: Write,

source§

fn load_from<R>(reader: R) -> Result<Self, Error>
where R: Read, Self: Sized,

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V