pub struct Options {
pub sim_words: usize,
pub seed: u64,
pub budget: u64,
pub final_budget: u64,
pub rounds: usize,
pub attempts: usize,
pub recycle: usize,
pub collect: usize,
pub progress: Option<Progress>,
}Expand description
How decide searches.
Fields§
§sim_words: usizeRandom simulation words (64 patterns each) the first signatures are drawn from.
seed: u64§budget: u64Conflicts a sweeping query of the first round may spend; 0 is unlimited.
final_budget: u64Conflicts an output pair’s query of the last round may spend; 0 is unlimited.
rounds: usizeThe most rounds a decision takes. Each sweeps afresh at ten times the budget of the one before and puts every
output pair to the solver within a hundred times its budget; the first round that leaves no pair open is the
last, and the last round’s pairs are put within final_budget. A small first budget wastes no conflict on
queries the merges around them make easy later, and a round left short is no worse than one at its budget.
attempts: usizeHow many classes a node is put against before it stays apart.
recycle: usizeThe variables a solver holds before a fresh one replaces it.
collect: usizeHow many clauses a solver’s part of the log holds before what nothing a later clause can name is let go, and beyond twice what each collection leaves.
progress: Option<Progress>What to report the search’s cost to as it goes, if anything.