Struct ChainDictionary 

pub struct ChainDictionary<D> { /* private fields */ }

A dictionary composition that preserves caller-supplied priority order.

Dictionaries are stored from highest to lowest priority. During lookup, matches of different byte lengths are all returned so the lattice segmenter can still compare shorter high-priority entries with longer low-priority entries. When two dictionaries produce a match with the same byte length, only the first one is kept.

Implementations

impl<D> ChainDictionary<D>

pub fn new() -> ChainDictionary<D>

Creates an empty chain.

pub fn push(&mut self, dictionary: D)

Appends a dictionary with lower priority than the existing entries.

pub fn len(&self) -> usize

Returns the number of dictionaries in the chain.

pub fn is_empty(&self) -> bool

Returns whether the chain contains no dictionaries.

pub fn dictionaries(&self) -> &[D]

Returns the chained dictionaries in priority order.

pub fn into_dictionaries(self) -> Vec<D>

Consumes the chain and returns its dictionaries in priority order.

Trait Implementations

impl<D> Clone for ChainDictionary<D>

where D: Clone,

fn clone(&self) -> ChainDictionary<D>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<D> Debug for ChainDictionary<D>

where D: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<D> Default for ChainDictionary<D>

where D: Default,

fn default() -> ChainDictionary<D>

Returns the “default value” for a type.

impl<D> Eq for ChainDictionary<D>

where D: Eq,

impl<D> FromIterator<D> for ChainDictionary<D>

fn from_iter<T>(iter: T) -> ChainDictionary<D>

where T: IntoIterator<Item = D>,

Creates a value from an iterator.

impl<D> HanjaDictionary for ChainDictionary<D>

where D: HanjaDictionary,

fn matches_at<'a>(&'a self, s: &'a str) -> Box<dyn Iterator<Item = Match> + 'a>

Yields every dictionary match that starts at the beginning of s.

fn max_word_chars(&self) -> Option<usize>

Returns the greatest dictionary entry length in Unicode scalar values.

fn entries<'a>( &'a self, ) -> Option<Box<dyn Iterator<Item = DictionaryRecord> + 'a>>

Enumerates complete dictionary entries when the backend supports it.

fn has_homophone(&self, hanja: &str, reading: &str) -> bool

Returns whether another hanja spelling has the same hangul reading.

impl<D> PartialEq for ChainDictionary<D>

where D: PartialEq,

fn eq(&self, other: &ChainDictionary<D>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<D> StructuralPartialEq for ChainDictionary<D>