EnumerationConstraint* ModelEnumerator::doInit(SharedContext& ctx, MinimizeConstraint* min, int numModels) {
delete queue_;
queue_ = 0;
initProjection(ctx);
uint32 st = strategy();
if (detectStrategy() || (ctx.concurrency() > 1 && !ModelEnumerator::supportsParallel())) {
st = 0;
}
bool optOne = minimizer() && minimizer()->mode() == MinimizeMode_t::optimize;
bool trivial = optOne || std::abs(numModels) == 1;
if (optOne && project_) {
const SharedMinimizeData* min = minimizer();
for (const WeightLiteral* it = min->lits; !isSentinel(it->first) && trivial; ++it) {
trivial = ctx.varInfo(it->first.var()).project();
}
if (!trivial) { ctx.report(warning(Event::subsystem_prepare, "Projection: Optimization may depend on enumeration order.")); }
}
if (st == strategy_auto) { st = trivial || (project_ && ctx.concurrency() > 1) ? strategy_record : strategy_backtrack; }
if (trivial) { st |= trivial_flag; }
if (ctx.concurrency() > 1 && !trivial && st != strategy_backtrack) {
queue_ = new SolutionQueue(ctx.concurrency());
queue_->reserve(ctx.concurrency() + 1);
}
options_ &= ~uint32(strategy_opts_mask);
options_ |= st;
Solver& s = *ctx.master();
EnumerationConstraint* c = st == strategy_backtrack
? static_cast<ConPtr>(new BacktrackFinder(s, min, project_, projectOpts()))
: static_cast<ConPtr>(new RecordFinder(s, min, project_, queue_));
if (projectionEnabled()) { setIgnoreSymmetric(true); }
return c;
}
EnumerationConstraint* ModelEnumerator::doInit(SharedContext& ctx, SharedMinimizeData* opt, int numModels) {
initProjection(ctx);
uint32 st = strategy();
if (detectStrategy() || (ctx.concurrency() > 1 && !ModelEnumerator::supportsParallel())) {
st = 0;
}
bool optOne = opt && opt->mode() == MinimizeMode_t::optimize;
bool trivial = optOne || std::abs(numModels) == 1;
if (optOne && projectionEnabled()) {
for (const WeightLiteral* it = minimizer()->lits; !isSentinel(it->first) && trivial; ++it) {
trivial = ctx.varInfo(it->first.var()).project();
}
if (!trivial) { ctx.report(warning(Event::subsystem_prepare, "Projection: Optimization may depend on enumeration order.")); }
}
if (st == strategy_auto) { st = trivial || (projectionEnabled() && ctx.concurrency() > 1) ? strategy_record : strategy_backtrack; }
if (trivial) { st |= trivial_flag; }
options_ &= ~uint32(strategy_opts_mask);
options_ |= st;
const LitVec* dom = (projectOpts() & project_dom_lits) != 0 ? (ctx.heuristic.domRec = &domRec_) : 0;
EnumerationConstraint* c = st == strategy_backtrack
? static_cast<ConPtr>(new BacktrackFinder(projectOpts()))
: static_cast<ConPtr>(new RecordFinder(dom));
if (projectionEnabled()) { setIgnoreSymmetric(true); }
return c;
}
