Struct SoftLambdaConstraint 

pub struct SoftLambdaConstraint<D: Domain> { /* private fields */ }

A soft constraint backed by a closure, analogous to LambdaConstraint.

When the checker returns false, the constraint is “violated” and its penalty is added to the objective during optimization search.

Implementations

impl<D: Domain> SoftLambdaConstraint<D>

pub fn new( scope: Vec<VarId>, checker: impl Fn(&[Option<D::Value>]) -> bool + 'static, penalty: f64, label: impl Into<String>, ) -> Self

impl<D: Domain> SoftLambdaConstraint<D>

pub fn is_satisfied(&self, assignment: &[Option<D::Value>]) -> bool

Check whether the underlying predicate is satisfied. This is separate from Constraint::check (which always returns true so that soft constraints don’t prune) — use this to compute penalty costs.

Trait Implementations

impl<D: Domain> Constraint<D> for SoftLambdaConstraint<D>

fn check(&self, _assignment: &[Option<D::Value>]) -> bool

Soft constraints always “pass” — they never prune domains. Their violation is tracked as cost, not as infeasibility.

fn scope(&self) -> &[VarId]

The variables this constraint involves (its “scope”).

fn revise(&self, vars: &mut [Variable<D>], depth: usize) -> Revision

AC-3 style revision: prune unsupported values from domains.

impl<D: Domain> Debug for SoftLambdaConstraint<D>

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

Formats the value using the given formatter.

impl<D: Domain> SoftConstraint<D> for SoftLambdaConstraint<D>

fn penalty(&self) -> f64

Penalty added to the objective when this constraint is violated.