pub enum ValOrder {
Ascend,
Descend,
Random,
}Expand description
Value-ordering heuristic (maps to Minion’s ValOrderEnum).
Random consumes the solver RNG, so two runs with the same seed
reach the same leaves only if they made the same number of prior
random draws — i.e. mid-search injection will diverge the
solution order, even under VarOrder::Static.
Variants§
Trait Implementations§
impl Copy for ValOrder
impl Eq for ValOrder
impl StructuralPartialEq for ValOrder
Auto Trait Implementations§
impl Freeze for ValOrder
impl RefUnwindSafe for ValOrder
impl Send for ValOrder
impl Sync for ValOrder
impl Unpin for ValOrder
impl UnsafeUnpin for ValOrder
impl UnwindSafe for ValOrder
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 1 byte
Size for each variant:
Ascend: 0 bytesDescend: 0 bytesRandom: 0 bytes