pub struct Myers<T = u64>where
    T: BitVec,{ /* private fields */ }
Expand description

Myers algorithm.

Implementations§

source§

impl<T: BitVec> Myers<T>

source

pub fn distance<C, I>(&self, text: I) -> usizewhere C: Borrow<u8>, I: IntoIterator<Item = C>,

Calculate the global distance of the pattern to the given text.

source

pub fn find_all_end<C, I>( &self, text: I, max_dist: usize ) -> Matches<'_, T, C, I::IntoIter> where C: Borrow<u8>, I: IntoIterator<Item = C>,

Finds all matches of pattern in the given text up to a given maximum distance. Matches are returned as an iterator over pairs of end position and distance.

source

pub fn find_best_end<C, I>(&self, text: I) -> (usize, usize)where C: Borrow<u8>, I: IntoIterator<Item = C>,

Find the best match of the pattern in the given text. if multiple end positions have the same distance, the first is returned.

source

pub fn find_all<C, I>( &mut self, text: I, max_dist: usize ) -> FullMatches<'_, T, C, I::IntoIter> where C: Borrow<u8>, I: IntoIterator<Item = C>, I::IntoIter: ExactSizeIterator,

Finds all matches of pattern in the given text up to a given maximum distance. In contrast to find_all_end, matches are returned as an iterator over ranges of (start, end, distance). Note that the end coordinate is not included in the range and thus and thus greater by one compared to the end index returned by find_all_end().

source

pub fn find_all_lazy<C, I>( &mut self, text: I, max_dist: usize ) -> LazyMatches<'_, T, C, I::IntoIter> where C: Borrow<u8>, I: IntoIterator<Item = C>, I::IntoIter: ExactSizeIterator,

As find_all_end, this function returns an iterator over tuples of (end, distance). Additionally, it keeps the data necessary for later obtaining the starting positions and/or the alignment path at any position that was already searched.

source§

impl<T: BitVec> Myers<T>

source

pub fn new<P, C>(pattern: P) -> Selfwhere C: Borrow<u8>, P: IntoIterator<Item = C>, P::IntoIter: ExactSizeIterator,

Create a new instance of Myers algorithm for a given pattern.

Trait Implementations§

source§

impl<T> Clone for Myers<T>where T: BitVec + Clone,

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<T> Debug for Myers<T>where T: BitVec + Debug,

source§

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

Formats the value using the given formatter. Read more
source§

impl<T> Default for Myers<T>where T: BitVec + Default,

source§

fn default() -> Myers<T>

Returns the “default value” for a type. Read more
source§

impl<T> Hash for Myers<T>where T: BitVec + Hash,

source§

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

Feeds this value into the given Hasher. Read more
1.3.0 · source§

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

Feeds a slice of this type into the given Hasher. Read more
source§

impl<T> Ord for Myers<T>where T: BitVec + Ord,

source§

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

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval. Read more
source§

impl<T> PartialEq<Myers<T>> for Myers<T>where T: BitVec + PartialEq,

source§

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

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<T> PartialOrd<Myers<T>> for Myers<T>where T: BitVec + PartialOrd,

source§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

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

impl<T> Eq for Myers<T>where T: BitVec + Eq,

source§

impl<T> StructuralEq for Myers<T>where T: BitVec,

source§

impl<T> StructuralPartialEq for Myers<T>where T: BitVec,

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for Myers<T>where T: RefUnwindSafe,

§

impl<T> Send for Myers<T>where T: Send,

§

impl<T> Sync for Myers<T>where T: Sync,

§

impl<T> Unpin for Myers<T>where T: Unpin,

§

impl<T> UnwindSafe for Myers<T>where T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere 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<T> for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere 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> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere 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 Twhere 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 Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> Scalar for Twhere T: 'static + Clone + PartialEq<T> + Debug,