---------------— Search class --------------—
More...
---------------— Search class --------------—
Definition at line 971 of file constraint_solver.cc.
◆ Search() [1/2]
| operations_research::Search::Search |
( |
Solver *const | s | ) |
|
|
inlineexplicit |
◆ Search() [2/2]
| operations_research::Search::Search |
( |
Solver *const | s, |
|
|
int | ) |
|
inline |
Constructor for a dummy search. The only difference between a dummy search and a regular one is that the search depth and left search depth is initialized to -1 instead of zero.
Definition at line 993 of file constraint_solver.cc.
◆ ~Search()
| operations_research::Search::~Search |
( |
| ) |
|
|
inline |
◆ Accept()
| void operations_research::Search::Accept |
( |
ModelVisitor * | visitor | ) |
const |
◆ AcceptDelta()
◆ AcceptNeighbor()
| void operations_research::Search::AcceptNeighbor |
( |
| ) |
|
◆ AcceptSolution()
| bool operations_research::Search::AcceptSolution |
( |
| ) |
|
Even though we know the return value, we cannot return yet: this would break the contract we have with solution monitors. They all deserve a chance to look at the solution.
Definition at line 1289 of file constraint_solver.cc.
◆ AcceptUncheckedNeighbor()
| void operations_research::Search::AcceptUncheckedNeighbor |
( |
| ) |
|
◆ AddEventListener()
◆ AfterDecision()
| void operations_research::Search::AfterDecision |
( |
Decision * | d, |
|
|
bool | apply ) |
◆ ApplyDecision()
| void operations_research::Search::ApplyDecision |
( |
Decision * | d | ) |
|
◆ AtSolution()
| bool operations_research::Search::AtSolution |
( |
| ) |
|
Even though we know the return value, we cannot return yet: this would break the contract we have with solution monitors. They all deserve a chance to look at the solution.
Definition at line 1303 of file constraint_solver.cc.
◆ backtrack_at_the_end_of_the_search()
| bool operations_research::Search::backtrack_at_the_end_of_the_search |
( |
| ) |
const |
|
inline |
◆ BeginFail()
| void operations_research::Search::BeginFail |
( |
| ) |
|
◆ BeginInitialPropagation()
| void operations_research::Search::BeginInitialPropagation |
( |
| ) |
|
◆ BeginNextDecision()
| void operations_research::Search::BeginNextDecision |
( |
DecisionBuilder * | db | ) |
|
◆ CheckFail()
| void operations_research::Search::CheckFail |
( |
| ) |
|
|
inline |
◆ Clear()
| void operations_research::Search::Clear |
( |
| ) |
|
◆ created_by_solve()
| bool operations_research::Search::created_by_solve |
( |
| ) |
const |
|
inline |
◆ decision_builder()
◆ EndFail()
| void operations_research::Search::EndFail |
( |
| ) |
|
◆ EndInitialPropagation()
| void operations_research::Search::EndInitialPropagation |
( |
| ) |
|
◆ EndNextDecision()
◆ EnterSearch()
| void operations_research::Search::EnterSearch |
( |
| ) |
|
The solution counter is reset when entering search and not when leaving search. This enables the information to persist outside of top-level search.
Definition at line 1230 of file constraint_solver.cc.
◆ ExitSearch()
| void operations_research::Search::ExitSearch |
( |
| ) |
|
◆ GetEventListeners()
◆ IncrementSolutionCounter()
| void operations_research::Search::IncrementSolutionCounter |
( |
| ) |
|
|
inline |
◆ IncrementUncheckedSolutionCounter()
| void operations_research::Search::IncrementUncheckedSolutionCounter |
( |
| ) |
|
|
inline |
◆ IsUncheckedSolutionLimitReached()
| bool operations_research::Search::IsUncheckedSolutionLimitReached |
( |
| ) |
|
◆ left_search_depth()
| int operations_research::Search::left_search_depth |
( |
| ) |
const |
|
inline |
◆ LeftMove()
| void operations_research::Search::LeftMove |
( |
| ) |
|
|
inline |
◆ LocalOptimum()
| bool operations_research::Search::LocalOptimum |
( |
| ) |
|
◆ ModifyDecision()
◆ NoMoreSolutions()
| void operations_research::Search::NoMoreSolutions |
( |
| ) |
|
◆ PeriodicCheck()
| void operations_research::Search::PeriodicCheck |
( |
| ) |
|
◆ ProgressPercent()
| int operations_research::Search::ProgressPercent |
( |
| ) |
|
◆ RefuteDecision()
| void operations_research::Search::RefuteDecision |
( |
Decision * | d | ) |
|
◆ RestartSearch()
| void operations_research::Search::RestartSearch |
( |
| ) |
|
◆ RightMove()
| void operations_research::Search::RightMove |
( |
| ) |
|
|
inline |
◆ search_context()
| std::string operations_research::Search::search_context |
( |
| ) |
const |
|
inline |
◆ search_depth()
| int operations_research::Search::search_depth |
( |
| ) |
const |
|
inline |
◆ set_backtrack_at_the_end_of_the_search()
| void operations_research::Search::set_backtrack_at_the_end_of_the_search |
( |
bool | restore | ) |
|
|
inline |
◆ set_created_by_solve()
| void operations_research::Search::set_created_by_solve |
( |
bool | c | ) |
|
|
inline |
◆ set_decision_builder()
| void operations_research::Search::set_decision_builder |
( |
DecisionBuilder *const | db | ) |
|
|
inline |
◆ set_search_context()
| void operations_research::Search::set_search_context |
( |
absl::string_view | search_context | ) |
|
|
inline |
◆ set_search_depth()
| void operations_research::Search::set_search_depth |
( |
int | d | ) |
|
|
inline |
◆ set_search_left_depth()
| void operations_research::Search::set_search_left_depth |
( |
int | d | ) |
|
|
inline |
◆ set_should_finish()
| void operations_research::Search::set_should_finish |
( |
bool | s | ) |
|
|
inline |
◆ set_should_restart()
| void operations_research::Search::set_should_restart |
( |
bool | s | ) |
|
|
inline |
◆ SetBranchSelector()
◆ should_finish()
| bool operations_research::Search::should_finish |
( |
| ) |
const |
|
inline |
◆ should_restart()
| bool operations_research::Search::should_restart |
( |
| ) |
const |
|
inline |
◆ solution_counter()
| int64_t operations_research::Search::solution_counter |
( |
| ) |
const |
|
inline |
◆ unchecked_solution_counter()
| int64_t operations_research::Search::unchecked_solution_counter |
( |
| ) |
const |
|
inline |
◆ Solver
The documentation for this class was generated from the following file: