Enum SegmentationStrategy 

#[non_exhaustive]
pub enum SegmentationStrategy {
    Lattice,
    Eager,
}

Strategy used to segment hanja-containing spans.

Lattice considers every dictionary path and chooses the best coverage, while Eager greedily takes the longest match at each cursor. The eager strategy can reduce work for callers that prefer speed over segmentation accuracy.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Lattice

Use dynamic programming to maximize dictionary coverage.

Eager

Use left-to-right eager longest-match segmentation.

Trait Implementations

impl Clone for SegmentationStrategy

fn clone(&self) -> SegmentationStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SegmentationStrategy

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

Formats the value using the given formatter.

impl Default for SegmentationStrategy

fn default() -> SegmentationStrategy

Returns the “default value” for a type.

impl PartialEq for SegmentationStrategy

fn eq(&self, other: &SegmentationStrategy) -> 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 Copy for SegmentationStrategy

impl Eq for SegmentationStrategy

impl StructuralPartialEq for SegmentationStrategy