Struct Problem

pub struct Problem {
    pub circuit: Circuit,
    pub details: ProblemDetails,
}

Problem that may be returned by the problem parsers

Fields

circuit: Circuit

Combinational circuit as the core of the problem

details: ProblemDetails

Additional details on the problem

Implementations

impl Problem

pub fn simplify(&self) -> Result<(Self, Vec<Literal>), Literal>

Simplify the circuit (see Circuit::simplify()), and map the gate literals in the additional problem details accordingly

If the reachable circuit fragment contains a cycle, this method returns Err(l), where l represents a gate that is part of the cycle.

On success, simplify() returns the simplified problem along with a Vec<Literal> which maps the gates of self to literals valid in the simplified circuit. The simplified circuit only contains gates reachable from the problem details (except for the AIGER literal map).

Trait Implementations

impl Clone for Problem

fn clone(&self) -> Problem

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Problem

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

Formats the value using the given formatter.

impl PartialEq for Problem

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Problem

impl StructuralPartialEq for Problem