pub struct MinimalDistance<'a, G: 'a> { /* private fields */ }
Expand description
Calculation of minimum distance from one part of the grammar to another. Similar to multi-source shortest path search in a graph.
Implementations§
Source§impl<'a, G> MinimalDistance<'a, G>where
G: RuleContainer,
impl<'a, G> MinimalDistance<'a, G>where
G: RuleContainer,
Auto Trait Implementations§
impl<'a, G> Freeze for MinimalDistance<'a, G>
impl<'a, G> RefUnwindSafe for MinimalDistance<'a, G>where
G: RefUnwindSafe,
impl<'a, G> Send for MinimalDistance<'a, G>where
G: Sync,
impl<'a, G> Sync for MinimalDistance<'a, G>where
G: Sync,
impl<'a, G> Unpin for MinimalDistance<'a, G>
impl<'a, G> UnwindSafe for MinimalDistance<'a, G>where
G: RefUnwindSafe,
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