Enum ChainStep 

pub enum ChainStep {
    Penalties,
    Dry,
    TopNSigma,
    TopK,
    TypP,
    TopP,
    MinP,
    Xtc,
    Temperature,
}

A step the ferrox chain can actually run.

SamplerOrder holds these rather than SamplerNames so that an unimplemented sampler is unrepresentable once the order exists: the applier’s match is total over what it can be handed, with no unreachable! standing in for a check that happened somewhere else.

Variants

Penalties

The repetition / presence / frequency penalties.

Dry

The DRY sequence-repetition penalty; see crate::dry.

TopNSigma

TopK

TypP

Locally typical sampling, llama.cpp’s typ_p.

TopP

MinP

Xtc

“Exclude top choices”, llama.cpp’s xtc.

Temperature

Implementations

impl ChainStep

pub const fn name(self) -> SamplerName

The name this step is spelled with. Exhaustive, so a step added without a name does not compile.

pub fn all() -> Vec<ChainStep>

Every step this engine can run, DERIVED from the name table rather than restated beside it.

A hand-written list here would be a second structure that had to agree with SamplerName::implemented, which is the defect shape this whole module is built to avoid. Derived, “is a step” and “has a name that maps to it” are the same statement, and tests::every_step_the_name_table_yields_names_itself_back closes the loop in the other direction.

Trait Implementations

impl Clone for ChainStep

fn clone(&self) -> ChainStep

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ChainStep

impl Debug for ChainStep

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

Formats the value using the given formatter.

impl Eq for ChainStep

impl Hash for ChainStep

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ChainStep

fn eq(&self, other: &ChainStep) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ChainStep