[−][src]Struct fritz_guess::MostFrequentLineByLine
Decent effort guesser which implements guessing using a line-by-line winner takes all strategy. For a line, the winner is the separator which occurs most frequent. The overall winner is the separator which takes most wins.
Methods
impl MostFrequentLineByLine
[src]
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for MostFrequentLineByLine
impl Send for MostFrequentLineByLine
impl Sync for MostFrequentLineByLine
impl Unpin for MostFrequentLineByLine
impl UnwindSafe for MostFrequentLineByLine
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,