Enum CategoryOrdering 

pub enum CategoryOrdering {
    FirstSeen,
    Lexical,
    Explicit(Vec<Vec<u8>>),
}

Policy for assigning codes to byte sequences during dictionary construction.

• FirstSeen: insertion order. Code = position of first occurrence. Best for ingestion stability (the first row sets the order, and subsequent rows of the same value reuse the same code).
• Lexical: byte-lexicographic order. The dictionary collects all distinct bytes first, then assigns codes by sorting via Vec<u8>::cmp. Best for cross-dataset reproducibility (any permutation of the same input set produces the same code map).
• Explicit(values): user provides the canonical order. Codes are assigned 0..values.len() in the order given. Best for production ML schemas where the inference-time code map must match training exactly.

Variants

FirstSeen

Lexical

Explicit(Vec<Vec<u8>>)

Trait Implementations

impl Clone for CategoryOrdering

fn clone(&self) -> CategoryOrdering

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CategoryOrdering

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

Formats the value using the given formatter.

impl PartialEq for CategoryOrdering

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

impl StructuralPartialEq for CategoryOrdering