pub struct TreMatch {
pub start: usize,
pub end: usize,
pub cost: u32,
pub n_ins: u32,
pub n_del: u32,
pub n_subst: u32,
}Expand description
Successful approximate-match result.
Fields§
§start: usizeByte offset where the match starts. The current TRE wrapper does not request submatch storage, so this is reported as 0 on a successful match. Phase 3.1 will add submatch capture and populate the real offset.
end: usizeByte offset one past the end of the match. See
Self::start for the current limitation.
cost: u32Total cost of the match (sum of edit costs).
n_ins: u32Number of inserts.
n_del: u32Number of deletes.
n_subst: u32Number of substitutes.
Trait Implementations§
impl Copy for TreMatch
impl Eq for TreMatch
impl StructuralPartialEq for TreMatch
Auto Trait Implementations§
impl Freeze for TreMatch
impl RefUnwindSafe for TreMatch
impl Send for TreMatch
impl Sync for TreMatch
impl Unpin for TreMatch
impl UnsafeUnpin for TreMatch
impl UnwindSafe for TreMatch
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more