Struct MergeableWords

pub struct MergeableWords { /* private fields */ }

A Pattern that identifies adjacent words that could potentially be merged into a single word.

This checks if two adjacent words could form a valid compound word, but first verifies that the two words aren’t already a valid lexeme in the dictionary (like “straight away”).

Implementations

impl MergeableWords

pub fn new( predicate: impl Fn(Option<&WordMetadata>, Option<&WordMetadata>) -> bool + Send + Sync + 'static, ) -> Self

pub fn get_merged_word( &self, word_a: &Token, word_b: &Token, source: &[char], ) -> Option<CharString>

Get the merged word from the dictionary if these words can be merged. Returns None if the words should remain separate (according to the predicate).

Trait Implementations

impl Pattern for MergeableWords

fn matches(&self, tokens: &[Token], source: &[char]) -> Option<usize>

Check if the pattern matches at the start of the given token slice.