Struct RandomOrder

pub struct RandomOrder { /* private fields */ }

A variable selection strategy that picks variables in a random order.

On initialisation, it creates a shuffled list of variable indices. When pick is called, it iterates through this shuffled list and chooses the first unassigned variable it encounters. The polarity of the chosen variable is selected randomly.

The initial shuffling makes the order random but fixed for the lifetime of this instance

Trait Implementations

impl Clone for RandomOrder

fn clone(&self) -> RandomOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RandomOrder

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

Formats the value using the given formatter.

impl Default for RandomOrder

fn default() -> RandomOrder

Returns the “default value” for a type.

impl<L: Literal> VariableSelection<L> for RandomOrder

VariableSelection trait implementation for the random order variable selection strategy.

fn new<C: AsRef<[L]>>(num_vars: usize, _: &[L], _: &[C]) -> Self

Creates a new RandomOrder strategy. num_vars is the total number of variables. It initialises a list of variable indices (e.g. 0 to num_vars - 1 or 1 to num_vars) and shuffles it using an Rng seeded with 0 for deterministic shuffling. A separate Rng (newly created) is stored for random polarity selection.

fn pick<A: Assignment>(&mut self, assignment: &A) -> Option<L>

Picks an unassigned variable from the pre-shuffled list. Iterates through the vars list. The first variable index i encountered for which assignment[i] is unassigned is chosen. Polarity is chosen randomly.

fn bumps<T: IntoIterator<Item = L>>(&mut self, _: T)

No-op

fn decay(&mut self, _: f64)

No-op

fn decisions(&self) -> usize

Returns the total number of decisions made by this strategy instance.