Struct Problem 

pub struct Problem { /* private fields */ }

Implementations

impl Problem

pub fn new(items: INodes, opts: ONodes) -> Problem

pub fn from_spec(spec: &Spec) -> Result<Problem>

Trait Implementations

impl Dance for Problem

type I = INodes

type O = ONodes

fn items(&mut self) -> &mut Self::I

fn opts(&mut self) -> &mut Self::O

fn updates(&mut self) -> &mut isize

fn cover(&mut self, i: Link)

fn commit(&mut self, p: Link, j: Link)

fn uncover(&mut self, i: Link)

fn uncommit(&mut self, p: Link, j: Link)

fn hide(&mut self, p: Link)

fn unhide(&mut self, p: Link)

fn branch_degree(&mut self, i: Link) -> Data

fn llink(&mut self, i: Link) -> &mut Link

fn rlink(&mut self, i: Link) -> &mut Link

fn dlink(&mut self, i: Link) -> &mut Link

fn ulink(&mut self, i: Link) -> &mut Link

fn top(&mut self, i: Link) -> &mut Data

fn len(&mut self, i: Link) -> &mut Data

impl DanceC for Problem

fn purify(&mut self, p: Link)

fn unpurify(&mut self, p: Link)

fn color(&mut self, i: Link) -> &mut Data

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 Reduce for Problem

fn get_color(&mut self, n: Link) -> Data

fn get_opt_data(&self, i: Count, c: Data) -> (Count, Data)

impl Solve for Problem

fn enter_level(&mut self, _: Link, _: Count, _: Link)

fn prepare_to_branch(&mut self, i: Link, l: Count, xl: Link)

fn try_item(&mut self, i: Link, _: Count, xl: Link) -> bool

fn try_again(&mut self, i: Link, l: Count, xl: &mut Link) -> bool

fn restore_item(&mut self, i: Link, _: Count, _: Link)

impl Eq for Problem

impl StructuralPartialEq for Problem