Struct backtrack::problems::total_sum::TotalSum

pub struct TotalSum { /* fields omitted */ }

Accept all values where the final sum was reached with one non-zero solution.

If e.g. sum_at_least is 3 and 4 arbitrary integers are required, [0,2,2,0], [1,1,0,1] and [2,0,3,0] are valid while [1,1,1,1] is not.

Implementations

impl TotalSum

pub fn new(n: usize, domain: &[usize], sum_at_least: usize) -> Self

Trait Implementations

impl CheckInc for TotalSum

type Accumulator = SumReached

fn fold_acc(
    &self,
    accu: Option<Self::Accumulator>,
    x: &usize
) -> Self::Accumulator

Produce an Accumulator for quick-checking next candidates in accu_sat

fn accu_sat(
    &self,
    accu: Option<&Self::Accumulator>,
    x: &usize,
    index: usize
) -> bool

Check if next value is valid against accumulated checks from fold_acc

impl Debug for TotalSum

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

Formats the value using the given formatter.

impl Scope for TotalSum

fn size(&self) -> usize

Return number values needed for a complete solution

fn domain(&self) -> Vec<usize>

Return all allowed values in a solution