Struct fritz_guess::MostFrequentLineByLine

pub struct MostFrequentLineByLine { /* fields omitted */ }

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

pub fn try_new<R: Read>(source: &mut R) -> Result<MostFrequentLineByLine, Error>

Trait Implementations

impl GuessSeparator for MostFrequentLineByLine

fn guess<'a>(
    &self,
    separators: impl Iterator<Item = &'a char> + Clone
) -> Result<char, Error>

Check which of the provided separators occurs most often per line. That character which occurs most often 'wins' for a line. The character which wins most lines will be accepted as guess.