pub struct LCS { /* private fields */ }
Expand description
Longest common subsequence (LCS) alignment.
This measure uses the following edit operations:
- Insert
- Delete
- Match
The matches in edit script for this measure give a longest common subsequence. The cost is the number of insertions/deletions after aligning the LCSes.
Implementations
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for LCS
impl Send for LCS
impl Sync for LCS
impl Unpin for LCS
impl UnwindSafe for LCS
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more