Struct rlifesrc_lib::search::SetCell

pub struct SetCell<R: Rule, A: Algorithm<R>> {
    pub(crate) cell: CellRef<R>,
    pub(crate) reason: A::Reason,
}

Records the cells whose values are set and their reasons.

Fields

cell: CellRef<R>

The set cell.

reason: A::Reason

The reason for setting a cell.

Implementations

impl<R: Rule, A: Algorithm<R>> SetCell<R, A>

pub(crate) const fn new(cell: CellRef<R>, reason: A::Reason) -> Self

Get a reference to the set cell.

pub(crate) fn ser(&self) -> SetCellSer

Available on crate feature serde only.

Saves the SetCell as a SetCellSer.

Trait Implementations

impl<R: Clone + Rule, A: Clone + Algorithm<R>> Clone for SetCell<R, A>where A::Reason: Clone,

fn clone(&self) -> SetCell<R, A>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<R: Debug + Rule, A: Debug + Algorithm<R>> Debug for SetCell<R, A>where A::Reason: Debug,

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

Formats the value using the given formatter.

impl<R: PartialEq + Rule, A: PartialEq + Algorithm<R>> PartialEq for SetCell<R, A>where A::Reason: PartialEq,

fn eq(&self, other: &SetCell<R, A>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<R: Eq + Rule, A: Eq + Algorithm<R>> Eq for SetCell<R, A>where A::Reason: Eq,

impl<R: Rule, A: Algorithm<R>> StructuralEq for SetCell<R, A>

impl<R: Rule, A: Algorithm<R>> StructuralPartialEq for SetCell<R, A>