Struct VariantEntry 

pub struct VariantEntry {

    pub name: &'static str,
    pub variant_fn: fn() -> Vec<(&'static str, &'static str)>,
    pub complexity: &'static str,
    pub complexity_eval_fn: fn(&dyn Any) -> f64,
    pub parameter_names_fn: fn() -> &'static [&'static str],
    pub parameter_measure_fn: fn(&dyn Any) -> ProblemParameters,
    pub is_default: bool,
    pub aliases: &'static [&'static str],
    pub create_inputs: Option<fn() -> Vec<CreateInputInfo>>,
    pub construct_fn: ConstructProblemFn,
    pub random: Option<RandomRegistration>,
    pub factory: fn(Value) -> Result<Box<dyn DynProblem>, Error>,
    pub serialize_fn: fn(&dyn Any) -> Option<Value>,
}

A registered problem variant entry.

Submitted by declare_variants! for each concrete problem type. The reduction graph uses these entries to build nodes with complexity metadata.

Fields

name: &'static str

Problem name (from Problem::NAME).

variant_fn: fn() -> Vec<(&'static str, &'static str)>

Function returning variant key-value pairs (from Problem::variant()).

complexity: &'static str

Worst-case time complexity expression (e.g., "2^num_vertices").

complexity_eval_fn: fn(&dyn Any) -> f64

Compiled complexity evaluation function. Takes a &dyn Any (must be &ProblemType), calls getter methods directly, and returns the estimated worst-case time as f64.

parameter_names_fn: fn() -> &'static [&'static str]

Canonical problem-owned parameter names.

parameter_measure_fn: fn(&dyn Any) -> ProblemParameters

Measure the complete canonical parameters of a concrete instance.

is_default: bool

Whether this entry is the declared default variant for its problem.

aliases: &'static [&'static str]

Variant-level aliases (e.g., &["3SAT"] for KSatisfiability<K3>).

Unlike problem-level aliases (on ProblemSchemaEntry), these resolve to a specific reduction-graph node, not just to a canonical problem name. The CLI resolver tries variant-level aliases first and falls back to problem-level.

create_inputs: Option<fn() -> Vec<CreateInputInfo>>

Custom construction inputs. None means the catalog schema fields are also the construction inputs through the direct path.

construct_fn: ConstructProblemFn

Construct a validated concrete problem from normalized construction data.

random: Option<RandomRegistration>

Model-owned random generator for this exact variant.

factory: fn(Value) -> Result<Box<dyn DynProblem>, Error>

Factory: deserialize JSON into a boxed dynamic problem.

serialize_fn: fn(&dyn Any) -> Option<Value>

Serialize: downcast &dyn Any and serialize to JSON.

Implementations

impl VariantEntry

pub fn inputs(&self) -> Vec<CreateInputInfo>

Inputs accepted by this concrete variant’s constructor.

pub fn variant(&self) -> Vec<(&'static str, &'static str)>

Get the variant by calling the function.

pub fn variant_map(&self) -> BTreeMap<String, String>

Get the variant as a BTreeMap<String, String>.

pub fn parameter_names(&self) -> &'static [&'static str]

Return the canonical parameter names for this exact variant.

Trait Implementations

impl Collect for VariantEntry

impl Debug for VariantEntry

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

Formats the value using the given formatter.