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 is_default: bool,
    pub factory: fn(Value) -> Result<Box<dyn DynProblem>, Error>,
    pub serialize_fn: fn(&dyn Any) -> Option<Value>,
    pub solve_fn: SolveFn,
}

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.

is_default: bool

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

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.

solve_fn: SolveFn

Solve: downcast &dyn Any and brute-force solve.

Implementations

impl VariantEntry

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>.

Trait Implementations

impl Debug for VariantEntry

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

Formats the value using the given formatter.

impl Collect for VariantEntry