11 #ifndef SWIG_operations_research_constraint_solver_WRAP_H_
12 #define SWIG_operations_research_constraint_solver_WRAP_H_
35 void swig_init_callbacks();
53 void swig_init_callbacks();
74 void swig_init_callbacks();
83 virtual std::string
name()
const;
84 virtual std::string
BaseName()
const;
101 void swig_init_callbacks();
160 void swig_connect_director(
SWIG_Callback0_t callbackToString,
SWIG_Callback1_t callbackEnterSearch,
SWIG_Callback2_t callbackRestartSearch,
SWIG_Callback3_t callbackExitSearch,
SWIG_Callback4_t callbackBeginNextDecision,
SWIG_Callback5_t callbackEndNextDecision,
SWIG_Callback6_t callbackApplyDecision,
SWIG_Callback7_t callbackRefuteDecision,
SWIG_Callback8_t callbackAfterDecision,
SWIG_Callback9_t callbackBeginFail,
SWIG_Callback10_t callbackEndFail,
SWIG_Callback11_t callbackBeginInitialPropagation,
SWIG_Callback12_t callbackEndInitialPropagation,
SWIG_Callback13_t callbackAcceptSolution,
SWIG_Callback14_t callbackAtSolution,
SWIG_Callback15_t callbackNoMoreSolutions,
SWIG_Callback16_t callbackLocalOptimum,
SWIG_Callback17_t callbackAcceptDelta,
SWIG_Callback18_t callbackAcceptNeighbor,
SWIG_Callback19_t callbackAcceptUncheckedNeighbor,
SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached,
SWIG_Callback21_t callbackPeriodicCheck,
SWIG_Callback22_t callbackProgressPercent,
SWIG_Callback23_t callbackAccept,
SWIG_Callback24_t callbackInstall);
188 void swig_init_callbacks();
248 void swig_connect_director(
SWIG_Callback0_t callbackToString,
SWIG_Callback1_t callbackEnterSearch,
SWIG_Callback2_t callbackRestartSearch,
SWIG_Callback3_t callbackExitSearch,
SWIG_Callback4_t callbackBeginNextDecision,
SWIG_Callback5_t callbackEndNextDecision,
SWIG_Callback6_t callbackApplyDecision,
SWIG_Callback7_t callbackRefuteDecision,
SWIG_Callback8_t callbackAfterDecision,
SWIG_Callback9_t callbackBeginFail,
SWIG_Callback10_t callbackEndFail,
SWIG_Callback11_t callbackBeginInitialPropagation,
SWIG_Callback12_t callbackEndInitialPropagation,
SWIG_Callback13_t callbackAcceptSolution,
SWIG_Callback14_t callbackAtSolution,
SWIG_Callback15_t callbackNoMoreSolutions,
SWIG_Callback16_t callbackLocalOptimum,
SWIG_Callback17_t callbackAcceptDelta,
SWIG_Callback18_t callbackAcceptNeighbor,
SWIG_Callback19_t callbackAcceptUncheckedNeighbor,
SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached,
SWIG_Callback21_t callbackPeriodicCheck,
SWIG_Callback22_t callbackProgressPercent,
SWIG_Callback23_t callbackAccept,
SWIG_Callback24_t callbackInstall);
276 void swig_init_callbacks();
309 virtual std::string
Print()
const;
337 void swig_connect_director(
SWIG_Callback0_t callbackToString,
SWIG_Callback1_t callbackEnterSearch,
SWIG_Callback2_t callbackRestartSearch,
SWIG_Callback3_t callbackExitSearch,
SWIG_Callback4_t callbackBeginNextDecision,
SWIG_Callback5_t callbackEndNextDecision,
SWIG_Callback6_t callbackApplyDecision,
SWIG_Callback7_t callbackRefuteDecision,
SWIG_Callback8_t callbackAfterDecision,
SWIG_Callback9_t callbackBeginFail,
SWIG_Callback10_t callbackEndFail,
SWIG_Callback11_t callbackBeginInitialPropagation,
SWIG_Callback12_t callbackEndInitialPropagation,
SWIG_Callback13_t callbackAcceptSolution,
SWIG_Callback14_t callbackAtSolution,
SWIG_Callback15_t callbackNoMoreSolutions,
SWIG_Callback16_t callbackLocalOptimum,
SWIG_Callback17_t callbackAcceptDelta,
SWIG_Callback18_t callbackAcceptNeighbor,
SWIG_Callback19_t callbackAcceptUncheckedNeighbor,
SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached,
SWIG_Callback21_t callbackPeriodicCheck,
SWIG_Callback22_t callbackProgressPercent,
SWIG_Callback23_t callbackAccept,
SWIG_Callback24_t callbackInstall,
SWIG_Callback25_t callbackPrint);
366 void swig_init_callbacks();
399 virtual bool Check();
433 void swig_connect_director(
SWIG_Callback0_t callbackToString,
SWIG_Callback1_t callbackEnterSearch,
SWIG_Callback2_t callbackRestartSearch,
SWIG_Callback3_t callbackExitSearch,
SWIG_Callback4_t callbackBeginNextDecision,
SWIG_Callback5_t callbackEndNextDecision,
SWIG_Callback6_t callbackApplyDecision,
SWIG_Callback7_t callbackRefuteDecision,
SWIG_Callback8_t callbackAfterDecision,
SWIG_Callback9_t callbackBeginFail,
SWIG_Callback10_t callbackEndFail,
SWIG_Callback11_t callbackBeginInitialPropagation,
SWIG_Callback12_t callbackEndInitialPropagation,
SWIG_Callback13_t callbackAcceptSolution,
SWIG_Callback14_t callbackAtSolution,
SWIG_Callback15_t callbackNoMoreSolutions,
SWIG_Callback16_t callbackLocalOptimum,
SWIG_Callback17_t callbackAcceptDelta,
SWIG_Callback18_t callbackAcceptNeighbor,
SWIG_Callback19_t callbackAcceptUncheckedNeighbor,
SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached,
SWIG_Callback21_t callbackPeriodicCheck,
SWIG_Callback22_t callbackProgressPercent,
SWIG_Callback23_t callbackAccept,
SWIG_Callback24_t callbackInstall,
SWIG_Callback25_t callbackCheck,
SWIG_Callback26_t callbackInit,
SWIG_Callback27_t callbackCopy,
SWIG_Callback28_t callbackMakeClone);
465 void swig_init_callbacks();
498 virtual bool Check();
532 void swig_connect_director(
SWIG_Callback0_t callbackToString,
SWIG_Callback1_t callbackEnterSearch,
SWIG_Callback2_t callbackRestartSearch,
SWIG_Callback3_t callbackExitSearch,
SWIG_Callback4_t callbackBeginNextDecision,
SWIG_Callback5_t callbackEndNextDecision,
SWIG_Callback6_t callbackApplyDecision,
SWIG_Callback7_t callbackRefuteDecision,
SWIG_Callback8_t callbackAfterDecision,
SWIG_Callback9_t callbackBeginFail,
SWIG_Callback10_t callbackEndFail,
SWIG_Callback11_t callbackBeginInitialPropagation,
SWIG_Callback12_t callbackEndInitialPropagation,
SWIG_Callback13_t callbackAcceptSolution,
SWIG_Callback14_t callbackAtSolution,
SWIG_Callback15_t callbackNoMoreSolutions,
SWIG_Callback16_t callbackLocalOptimum,
SWIG_Callback17_t callbackAcceptDelta,
SWIG_Callback18_t callbackAcceptNeighbor,
SWIG_Callback19_t callbackAcceptUncheckedNeighbor,
SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached,
SWIG_Callback21_t callbackPeriodicCheck,
SWIG_Callback22_t callbackProgressPercent,
SWIG_Callback23_t callbackAccept,
SWIG_Callback24_t callbackInstall,
SWIG_Callback25_t callbackCheck,
SWIG_Callback26_t callbackInit,
SWIG_Callback27_t callbackCopy,
SWIG_Callback28_t callbackMakeClone);
564 void swig_init_callbacks();
575 virtual void Reset();
594 void swig_init_callbacks();
606 virtual void Reset();
634 void swig_init_callbacks();
646 virtual void Reset();
670 void swig_init_callbacks();
681 virtual void Reset();
705 void swig_init_callbacks();
716 virtual void Reset();
747 void swig_init_callbacks();
757 virtual void Reset();
812 void swig_connect_director(
SWIG_Callback0_t callbackToString,
SWIG_Callback1_t callbackReset,
SWIG_Callback2_t callbackHasFragments,
SWIG_Callback3_t callbackHoldsDelta,
SWIG_Callback4_t callbackIsIncremental,
SWIG_Callback5_t callbackOnStart,
SWIG_Callback6_t callbackMakeOneNeighbor,
SWIG_Callback7_t callbackMakeNeighbor,
SWIG_Callback8_t callbackOnNodeInitialization,
SWIG_Callback9_t callbackRestartAtPathStartOnSynchronize,
SWIG_Callback10_t callbackOnSamePathAsPreviousBase,
SWIG_Callback11_t callbackGetBaseNodeRestartPosition,
SWIG_Callback12_t callbackSetNextBaseToIncrement,
SWIG_Callback13_t callbackConsiderAlternatives,
SWIG_Callback14_t callbackInitPosition);
830 void swig_init_callbacks();
845 virtual void Reset();
872 void swig_init_callbacks();
888 void swig_init_callbacks();
902 virtual void Reset();
933 void swig_init_callbacks();
969 void swig_init_callbacks();
virtual bool HoldsDelta() const
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackInitFragments, SWIG_Callback6_t callbackNextFragment)
virtual bool HasFragments() const
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Redefines MakeNextNeighbor to export a simpler interface.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SwigDirector_BaseLns(std::vector< operations_research::IntVar * > const &vars)
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
virtual std::string DebugString() const
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void Start(operations_research::Assignment const *assignment)
unsigned int(SWIGSTDCALL * SWIG_Callback2_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback6_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
virtual bool IsIncremental() const
virtual void InitFragments()
virtual ~SwigDirector_BaseLns()
virtual bool NextFragment()
virtual bool HoldsDelta() const
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor, SWIG_Callback7_t callbackModifyValue)
virtual bool HasFragments() const
virtual ~SwigDirector_ChangeValue()
virtual bool MakeOneNeighborSwigPublic()
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Redefines MakeNextNeighbor to export a simpler interface.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
SwigDirector_ChangeValue(std::vector< operations_research::IntVar * > const &vars)
virtual std::string DebugString() const
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void Start(operations_research::Assignment const *assignment)
virtual int64_t ModifyValue(int64_t index, int64_t value)
virtual bool SkipUnchanged(int index) const
unsigned int(SWIGSTDCALL * SWIG_Callback2_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)()
long long(SWIGSTDCALL * SWIG_Callback7_t)(long long, long long)
virtual bool MakeOneNeighbor()
This method should not be overridden. Override ModifyValue() instead.
unsigned int(SWIGSTDCALL * SWIG_Callback6_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
virtual bool IsIncremental() const
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
virtual std::string name() const
Object naming.
virtual void Post()
This method is called when the constraint is processed by the solver.
void(SWIGSTDCALL * SWIG_Callback4_t)()
char *(SWIGSTDCALL * SWIG_Callback0_t)()
char *(SWIGSTDCALL * SWIG_Callback1_t)()
SwigDirector_Constraint(operations_research::Solver *const solver)
virtual std::string DebugString() const
virtual void InitialPropagate()
This method performs the initial propagation of the constraint.
virtual std::string BaseName() const
Returns a base name for automatic naming.
char *(SWIGSTDCALL * SWIG_Callback2_t)()
virtual ~SwigDirector_Constraint()
void(SWIGSTDCALL * SWIG_Callback3_t)()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackName, SWIG_Callback2_t callbackBaseName, SWIG_Callback3_t callbackPost, SWIG_Callback4_t callbackInitialPropagateWrapper)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackNextWrapper)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual std::string DebugString() const
virtual ~SwigDirector_DecisionBuilder()
void *(SWIGSTDCALL * SWIG_Callback1_t)(void *)
virtual operations_research::Decision * Next(operations_research::Solver *const s)
This is the main method of the decision builder class.
SwigDirector_DecisionBuilder()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackApplyWrapper, SWIG_Callback2_t callbackRefuteWrapper, SWIG_Callback3_t callbackAccept)
virtual ~SwigDirector_Decision()
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void Accept(operations_research::DecisionVisitor *const visitor) const
Accepts the given visitor.
virtual std::string DebugString() const
virtual void Apply(operations_research::Solver *const s)
Apply will be called first when the decision is executed.
void(SWIGSTDCALL * SWIG_Callback2_t)(void *)
void(SWIGSTDCALL * SWIG_Callback3_t)(void *)
void(SWIGSTDCALL * SWIG_Callback1_t)(void *)
virtual void Refute(operations_research::Solver *const s)
Refute will be called after a backtrack.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
int(SWIGSTDCALL * SWIG_Callback2_t)()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackRunWrapper, SWIG_Callback2_t callbackPriority)
virtual ~SwigDirector_Demon()
virtual std::string DebugString() const
virtual void Run(operations_research::Solver *const s)
This is the main callback of the demon.
virtual operations_research::Solver::DemonPriority priority() const
This method returns the priority of the demon.
void(SWIGSTDCALL * SWIG_Callback1_t)(void *)
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)(void *, void *, long long, long long)
void(SWIGSTDCALL * SWIG_Callback6_t)()
virtual int64_t GetAcceptedObjectiveValue() const
Objective value from the last time Accept() was called and returned true.
virtual int64_t GetSynchronizedObjectiveValue() const
Objective value from last time Synchronize() was called.
virtual bool Accept(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta, int64_t objective_min, int64_t objective_max)
Accepts a "delta" given the assignment with which the filter has been synchronized; the delta holds t...
virtual void Reset()
Sets the filter to empty solution.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void Relax(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta)
Lets the filter know what delta and deltadelta will be passed in the next Accept().
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackRelax, SWIG_Callback2_t callbackCommit, SWIG_Callback3_t callbackAccept, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackRevert, SWIG_Callback6_t callbackReset, SWIG_Callback7_t callbackGetSynchronizedObjectiveValue, SWIG_Callback8_t callbackGetAcceptedObjectiveValue, SWIG_Callback9_t callbackOnSynchronize)
void(SWIGSTDCALL * SWIG_Callback9_t)(void *)
SwigDirector_IntVarLocalSearchFilter(std::vector< operations_research::IntVar * > const &vars)
virtual void Commit(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta)
Dual of Relax(), lets the filter know that the delta was accepted.
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
virtual void OnSynchronizeSwigPublic(operations_research::Assignment const *delta)
virtual std::string DebugString() const
void(SWIGSTDCALL * SWIG_Callback2_t)(void *, void *)
long long(SWIGSTDCALL * SWIG_Callback8_t)()
long long(SWIGSTDCALL * SWIG_Callback7_t)()
void(SWIGSTDCALL * SWIG_Callback1_t)(void *, void *)
virtual void OnSynchronize(operations_research::Assignment const *delta)
void(SWIGSTDCALL * SWIG_Callback5_t)()
virtual ~SwigDirector_IntVarLocalSearchFilter()
virtual bool IsIncremental() const
virtual void Revert()
Cancels the changes made by the last Relax()/Accept() calls.
virtual bool HoldsDelta() const
virtual ~SwigDirector_IntVarLocalSearchOperator()
virtual bool HasFragments() const
virtual bool MakeOneNeighborSwigPublic()
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Redefines MakeNextNeighbor to export a simpler interface.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor)
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
virtual std::string DebugString() const
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void Start(operations_research::Assignment const *assignment)
virtual bool SkipUnchanged(int index) const
unsigned int(SWIGSTDCALL * SWIG_Callback2_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)()
virtual bool MakeOneNeighbor()
Creates a new neighbor.
unsigned int(SWIGSTDCALL * SWIG_Callback6_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
virtual bool IsIncremental() const
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
SwigDirector_IntVarLocalSearchOperator()
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)(void *, void *, long long, long long)
void(SWIGSTDCALL * SWIG_Callback6_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
virtual int64_t GetAcceptedObjectiveValue() const
Objective value from the last time Accept() was called and returned true.
virtual int64_t GetSynchronizedObjectiveValue() const
Objective value from last time Synchronize() was called.
virtual bool Accept(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta, int64_t objective_min, int64_t objective_max)
Accepts a "delta" given the assignment with which the filter has been synchronized; the delta holds t...
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackRelax, SWIG_Callback2_t callbackCommit, SWIG_Callback3_t callbackAccept, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackSynchronize, SWIG_Callback6_t callbackRevert, SWIG_Callback7_t callbackReset, SWIG_Callback8_t callbackGetSynchronizedObjectiveValue, SWIG_Callback9_t callbackGetAcceptedObjectiveValue)
virtual void Reset()
Sets the filter to empty solution.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void Relax(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta)
Lets the filter know what delta and deltadelta will be passed in the next Accept().
virtual ~SwigDirector_LocalSearchFilter()
virtual void Commit(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta)
Dual of Relax(), lets the filter know that the delta was accepted.
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
virtual std::string DebugString() const
void(SWIGSTDCALL * SWIG_Callback2_t)(void *, void *)
long long(SWIGSTDCALL * SWIG_Callback8_t)()
SwigDirector_LocalSearchFilter()
void(SWIGSTDCALL * SWIG_Callback1_t)(void *, void *)
long long(SWIGSTDCALL * SWIG_Callback9_t)()
void(SWIGSTDCALL * SWIG_Callback7_t)()
virtual bool IsIncremental() const
virtual void Revert()
Cancels the changes made by the last Relax()/Accept() calls.
virtual void Synchronize(operations_research::Assignment const *assignment, operations_research::Assignment const *delta)
Synchronizes the filter with the current solution, delta being the difference with the solution passe...
void swig_connect_director(SWIG_Callback0_t callbackToString)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual std::string DebugString() const
virtual ~SwigDirector_LocalSearchFilterManager()
SwigDirector_LocalSearchFilterManager(std::vector< operations_research::LocalSearchFilterManager::FilterEvent > filter_events)
virtual bool HoldsDelta() const
virtual bool HasFragments() const
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
unsigned int(SWIGSTDCALL * SWIG_Callback5_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback1_t)(void *, void *)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackMakeNextNeighbor, SWIG_Callback2_t callbackStart, SWIG_Callback3_t callbackReset, SWIG_Callback4_t callbackHasFragments, SWIG_Callback5_t callbackHoldsDelta)
SwigDirector_LocalSearchOperator()
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
virtual std::string DebugString() const
virtual void Start(operations_research::Assignment const *assignment)
void(SWIGSTDCALL * SWIG_Callback2_t)(void *)
virtual ~SwigDirector_LocalSearchOperator()
void(SWIGSTDCALL * SWIG_Callback3_t)()
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
void(SWIGSTDCALL * SWIG_Callback2_t)()
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackPrint)
virtual void RestartSearch()
Restart the search.
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
virtual void ExitSearch()
End of the search.
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
virtual bool LocalOptimum()
When a local optimum is reached.
void(SWIGSTDCALL * SWIG_Callback11_t)()
void(SWIGSTDCALL * SWIG_Callback9_t)()
virtual void NoMoreSolutions()
When the search tree is finished.
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void BeginFail()
Just when the failure occurs.
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
virtual void BeginInitialPropagation()
Before the initial propagation.
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
void(SWIGSTDCALL * SWIG_Callback15_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
virtual void EnterSearch()
Beginning of the search.
char *(SWIGSTDCALL * SWIG_Callback25_t)()
void(SWIGSTDCALL * SWIG_Callback21_t)()
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
virtual std::string DebugString() const
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
void(SWIGSTDCALL * SWIG_Callback18_t)()
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
virtual void EndFail()
After completing the backtrack.
void(SWIGSTDCALL * SWIG_Callback10_t)()
void(SWIGSTDCALL * SWIG_Callback19_t)()
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void EndInitialPropagation()
After the initial propagation.
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
virtual std::string Print() const
virtual bool AtSolution()
This method is called when a valid solution is found.
virtual void BeginNextDecision(operations_research::DecisionBuilder *const db)
Before calling DecisionBuilder::Next.
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
int(SWIGSTDCALL * SWIG_Callback22_t)()
void(SWIGSTDCALL * SWIG_Callback24_t)()
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Internal methods.
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
SwigDirector_OptimizeVar(operations_research::Solver *const s, bool maximize, operations_research::IntVar *const a, int64_t step)
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
void(SWIGSTDCALL * SWIG_Callback12_t)()
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
virtual ~SwigDirector_OptimizeVar()
void(SWIGSTDCALL * SWIG_Callback3_t)()
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
virtual bool AcceptSolution()
This method is called when a solution is found.
virtual bool InitPosition() const
Returns true if the operator needs to restart its initial position at each call to Start()
unsigned int(SWIGSTDCALL * SWIG_Callback7_t)()
virtual bool HoldsDelta() const
virtual int64_t GetBaseNodeRestartPositionSwigPublic(int base_index)
virtual bool ConsiderAlternatives(int64_t base_index) const
Indicates if alternatives should be considered when iterating over base nodes.
virtual bool HasFragments() const
virtual bool MakeOneNeighborSwigPublic()
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Redefines MakeNextNeighbor to export a simpler interface.
virtual void SetNextBaseToIncrement(int64_t base_index)
Set the next base to increment on next iteration.
virtual int64_t GetBaseNodeRestartPosition(int base_index)
Returns the index of the node to which the base node of index base_index must be set to when it reach...
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor, SWIG_Callback7_t callbackMakeNeighbor, SWIG_Callback8_t callbackOnNodeInitialization, SWIG_Callback9_t callbackRestartAtPathStartOnSynchronize, SWIG_Callback10_t callbackOnSamePathAsPreviousBase, SWIG_Callback11_t callbackGetBaseNodeRestartPosition, SWIG_Callback12_t callbackSetNextBaseToIncrement, SWIG_Callback13_t callbackConsiderAlternatives, SWIG_Callback14_t callbackInitPosition)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void SetNextBaseToIncrementSwigPublic(int64_t base_index)
virtual bool InitPositionSwigPublic() const
virtual void OnNodeInitialization()
Called by OnStart() after initializing node information.
virtual bool OnSamePathAsPreviousBaseSwigPublic(int64_t base_index)
unsigned int(SWIGSTDCALL * SWIG_Callback9_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
long long(SWIGSTDCALL * SWIG_Callback11_t)(int)
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
virtual bool MakeNeighbor()
virtual std::string DebugString() const
unsigned int(SWIGSTDCALL * SWIG_Callback10_t)(long long)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)(long long)
virtual void OnNodeInitializationSwigPublic()
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void Start(operations_research::Assignment const *assignment)
virtual bool RestartAtPathStartOnSynchronizeSwigPublic()
virtual bool SkipUnchanged(int index) const
void(SWIGSTDCALL * SWIG_Callback8_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback2_t)()
virtual bool RestartAtPathStartOnSynchronize()
When the operator is being synchronized with a new solution (when Start() is called),...
void(SWIGSTDCALL * SWIG_Callback5_t)()
virtual bool OnSamePathAsPreviousBase(int64_t base_index)
Returns true if a base node has to be on the same path as the "previous" base node (base node of inde...
virtual bool MakeOneNeighbor()
This method should not be overridden. Override MakeNeighbor() instead.
unsigned int(SWIGSTDCALL * SWIG_Callback6_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
virtual bool IsIncremental() const
virtual bool ConsiderAlternativesSwigPublic(int64_t base_index) const
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
virtual ~SwigDirector_PathOperator()
void(SWIGSTDCALL * SWIG_Callback12_t)(long long)
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
void(SWIGSTDCALL * SWIG_Callback2_t)()
void(SWIGSTDCALL * SWIG_Callback27_t)(void *)
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
virtual void RestartSearch()
Restart the search.
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
virtual void ExitSearch()
End of the search.
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
virtual void Init()
This method is called when the search limit is initialized.
virtual bool LocalOptimum()
When a local optimum is reached.
SwigDirector_RegularLimit(operations_research::Solver *const s, absl::Duration time, int64_t branches, int64_t failures, int64_t solutions, bool smart_time_check, bool cumulative)
void(SWIGSTDCALL * SWIG_Callback11_t)()
void(SWIGSTDCALL * SWIG_Callback9_t)()
virtual void NoMoreSolutions()
When the search tree is finished.
unsigned int(SWIGSTDCALL * SWIG_Callback25_t)()
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void BeginFail()
Just when the failure occurs.
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
virtual void BeginInitialPropagation()
Before the initial propagation.
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
void(SWIGSTDCALL * SWIG_Callback15_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
virtual void EnterSearch()
Internal methods.
void(SWIGSTDCALL * SWIG_Callback21_t)()
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
virtual std::string DebugString() const
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
virtual void Copy(operations_research::SearchLimit const *const limit)
Copy a limit.
void(SWIGSTDCALL * SWIG_Callback18_t)()
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
virtual void EndFail()
After completing the backtrack.
void(SWIGSTDCALL * SWIG_Callback10_t)()
void(SWIGSTDCALL * SWIG_Callback19_t)()
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void EndInitialPropagation()
After the initial propagation.
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
virtual ~SwigDirector_RegularLimit()
virtual bool AtSolution()
This method is called when a valid solution is found.
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
virtual operations_research::SearchLimit * MakeClone() const
Allocates a clone of the limit.
int(SWIGSTDCALL * SWIG_Callback22_t)()
void(SWIGSTDCALL * SWIG_Callback24_t)()
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackCheck, SWIG_Callback26_t callbackInit, SWIG_Callback27_t callbackCopy, SWIG_Callback28_t callbackMakeClone)
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
void *(SWIGSTDCALL * SWIG_Callback28_t)()
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
virtual bool Check()
This method is called to check the status of the limit.
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
void(SWIGSTDCALL * SWIG_Callback12_t)()
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
void(SWIGSTDCALL * SWIG_Callback3_t)()
void(SWIGSTDCALL * SWIG_Callback26_t)()
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
virtual bool AcceptSolution()
This method is called when a solution is found.
virtual void BeginNextDecision(operations_research::DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
void(SWIGSTDCALL * SWIG_Callback2_t)()
void(SWIGSTDCALL * SWIG_Callback27_t)(void *)
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
virtual void RestartSearch()
Restart the search.
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
virtual void ExitSearch()
End of the search.
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
virtual void Init()
This method is called when the search limit is initialized.
virtual bool LocalOptimum()
When a local optimum is reached.
void(SWIGSTDCALL * SWIG_Callback11_t)()
void(SWIGSTDCALL * SWIG_Callback9_t)()
virtual void NoMoreSolutions()
When the search tree is finished.
unsigned int(SWIGSTDCALL * SWIG_Callback25_t)()
virtual ~SwigDirector_SearchLimit()
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void BeginFail()
Just when the failure occurs.
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
virtual void BeginInitialPropagation()
Before the initial propagation.
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
void(SWIGSTDCALL * SWIG_Callback15_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
virtual void EnterSearch()
Internal methods.
void(SWIGSTDCALL * SWIG_Callback21_t)()
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
virtual std::string DebugString() const
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
virtual void Copy(operations_research::SearchLimit const *const limit)
Copy a limit.
void(SWIGSTDCALL * SWIG_Callback18_t)()
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
virtual void EndFail()
After completing the backtrack.
void(SWIGSTDCALL * SWIG_Callback10_t)()
void(SWIGSTDCALL * SWIG_Callback19_t)()
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void EndInitialPropagation()
After the initial propagation.
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
virtual bool AtSolution()
This method is called when a valid solution is found.
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
virtual operations_research::SearchLimit * MakeClone() const
Allocates a clone of the limit.
int(SWIGSTDCALL * SWIG_Callback22_t)()
void(SWIGSTDCALL * SWIG_Callback24_t)()
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackCheck, SWIG_Callback26_t callbackInit, SWIG_Callback27_t callbackCopy, SWIG_Callback28_t callbackMakeClone)
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
void *(SWIGSTDCALL * SWIG_Callback28_t)()
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
virtual bool Check()
This method is called to check the status of the limit.
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
void(SWIGSTDCALL * SWIG_Callback12_t)()
SwigDirector_SearchLimit(operations_research::Solver *const s)
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
void(SWIGSTDCALL * SWIG_Callback3_t)()
void(SWIGSTDCALL * SWIG_Callback26_t)()
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
virtual bool AcceptSolution()
This method is called when a solution is found.
virtual void BeginNextDecision(operations_research::DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
void(SWIGSTDCALL * SWIG_Callback2_t)()
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
virtual void RestartSearch()
Restart the search.
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
virtual void ExitSearch()
End of the search.
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
virtual bool LocalOptimum()
When a local optimum is reached.
void(SWIGSTDCALL * SWIG_Callback11_t)()
void(SWIGSTDCALL * SWIG_Callback9_t)()
virtual void NoMoreSolutions()
When the search tree is finished.
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void BeginFail()
Just when the failure occurs.
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
virtual void BeginInitialPropagation()
Before the initial propagation.
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
void(SWIGSTDCALL * SWIG_Callback15_t)()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
virtual void EnterSearch()
Beginning of the search.
void(SWIGSTDCALL * SWIG_Callback21_t)()
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
virtual std::string DebugString() const
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
void(SWIGSTDCALL * SWIG_Callback18_t)()
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
virtual void EndFail()
After completing the backtrack.
void(SWIGSTDCALL * SWIG_Callback10_t)()
void(SWIGSTDCALL * SWIG_Callback19_t)()
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void EndInitialPropagation()
After the initial propagation.
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
virtual bool AtSolution()
This method is called when a valid solution is found.
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
int(SWIGSTDCALL * SWIG_Callback22_t)()
void(SWIGSTDCALL * SWIG_Callback24_t)()
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
virtual ~SwigDirector_SearchMonitor()
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
SwigDirector_SearchMonitor(operations_research::Solver *const s)
void(SWIGSTDCALL * SWIG_Callback12_t)()
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
void(SWIGSTDCALL * SWIG_Callback3_t)()
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
virtual bool AcceptSolution()
This method is called when a solution is found.
virtual void BeginNextDecision(operations_research::DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
void(SWIGSTDCALL * SWIG_Callback2_t)()
SwigDirector_SequenceVarLocalSearchOperator()
virtual bool HoldsDelta() const
void(SWIGSTDCALL * SWIG_Callback6_t)()
virtual bool HasFragments() const
virtual ~SwigDirector_SequenceVarLocalSearchOperator()
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
unsigned int(SWIGSTDCALL * SWIG_Callback5_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback1_t)(void *, void *)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
virtual std::string DebugString() const
virtual void Start(operations_research::Assignment const *assignment)
This method should not be overridden.
virtual bool SkipUnchanged(int index) const
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
virtual bool IsIncremental() const
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackMakeNextNeighbor, SWIG_Callback2_t callbackReset, SWIG_Callback3_t callbackHasFragments, SWIG_Callback4_t callbackHoldsDelta, SWIG_Callback5_t callbackIsIncremental, SWIG_Callback6_t callbackOnStart)
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
void(SWIGSTDCALL * SWIG_Callback2_t)()
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
virtual void RestartSearch()
Restart the search.
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
virtual void ExitSearch()
End of the search.
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
virtual bool LocalOptimum()
When a local optimum is reached.
void(SWIGSTDCALL * SWIG_Callback11_t)()
void(SWIGSTDCALL * SWIG_Callback9_t)()
virtual void NoMoreSolutions()
When the search tree is finished.
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void BeginFail()
Just when the failure occurs.
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
virtual void BeginInitialPropagation()
Before the initial propagation.
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
void(SWIGSTDCALL * SWIG_Callback15_t)()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
virtual void EnterSearch()
Beginning of the search.
void(SWIGSTDCALL * SWIG_Callback21_t)()
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
virtual std::string DebugString() const
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
void(SWIGSTDCALL * SWIG_Callback18_t)()
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
virtual void EndFail()
After completing the backtrack.
void(SWIGSTDCALL * SWIG_Callback10_t)()
void(SWIGSTDCALL * SWIG_Callback19_t)()
void(SWIGSTDCALL * SWIG_Callback1_t)()
virtual void EndInitialPropagation()
After the initial propagation.
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
virtual bool AtSolution()
This method is called when a valid solution is found.
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
int(SWIGSTDCALL * SWIG_Callback22_t)()
void(SWIGSTDCALL * SWIG_Callback24_t)()
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
SwigDirector_SolutionCollector(operations_research::Solver *const solver, operations_research::Assignment const *assignment)
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
virtual ~SwigDirector_SolutionCollector()
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
void(SWIGSTDCALL * SWIG_Callback12_t)()
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
void(SWIGSTDCALL * SWIG_Callback3_t)()
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
virtual bool AcceptSolution()
This method is called when a solution is found.
virtual void BeginNextDecision(operations_research::DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
virtual void VisitRankFirstInterval(operations_research::SequenceVar *const sequence, int index)
virtual ~SwigDirector_SymmetryBreaker()
virtual void VisitScheduleOrExpedite(operations_research::IntervalVar *const var, int64_t est)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackVisitSetVariableValue, SWIG_Callback2_t callbackVisitSplitVariableDomain, SWIG_Callback3_t callbackVisitScheduleOrPostpone, SWIG_Callback4_t callbackVisitScheduleOrExpedite, SWIG_Callback5_t callbackVisitRankFirstInterval, SWIG_Callback6_t callbackVisitRankLastInterval, SWIG_Callback7_t callbackVisitUnknownDecision)
virtual void VisitRankLastInterval(operations_research::SequenceVar *const sequence, int index)
virtual void VisitSplitVariableDomain(operations_research::IntVar *const var, int64_t value, bool start_with_lower_half)
void(SWIGSTDCALL * SWIG_Callback2_t)(void *, long long, unsigned int)
virtual void VisitUnknownDecision()
virtual std::string DebugString() const
void(SWIGSTDCALL * SWIG_Callback4_t)(void *, long long)
void(SWIGSTDCALL * SWIG_Callback1_t)(void *, long long)
virtual void VisitSetVariableValue(operations_research::IntVar *const var, int64_t value)
SwigDirector_SymmetryBreaker()
void(SWIGSTDCALL * SWIG_Callback7_t)()
virtual void VisitScheduleOrPostpone(operations_research::IntervalVar *const var, int64_t est)
void(SWIGSTDCALL * SWIG_Callback6_t)(void *, int)
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, int)
void(SWIGSTDCALL * SWIG_Callback3_t)(void *, long long)
An Assignment is a variable -> domains mapping, used to report solutions to the user.
This is the base class for building an Lns operator.
Defines operators which change the value of variables; each neighbor corresponds to one modified vari...
bool MakeOneNeighbor() override
This method should not be overridden. Override ModifyValue() instead.
A constraint is the main modeling object.
A DecisionBuilder is responsible for creating the search tree.
A Decision represents a choice point in the search tree.
A DecisionVisitor is used to inspect a decision.
A Demon is the base element of a propagation queue.
The class IntVar is a subset of IntExpr.
virtual void OnSynchronize(const Assignment *delta)
Specialization of LocalSearchOperator built from an array of IntVars which specifies the scope of the...
virtual bool MakeOneNeighbor()
Creates a new neighbor.
Interval variables are often used in scheduling.
Local Search Filters are used for fast neighbor pruning.
Filter manager: when a move is made, filters are executed to decide whether the solution is feasible ...
The base class for all local search operators.
This class encapsulates an objective.
Base class of the local search operators dedicated to path modifications (a path is a set of nodes li...
virtual bool ConsiderAlternatives(int64_t base_index) const
Indicates if alternatives should be considered when iterating over base nodes.
virtual void OnNodeInitialization()
Called by OnStart() after initializing node information.
virtual bool OnSamePathAsPreviousBase(int64_t base_index)
Returns true if a base node has to be on the same path as the "previous" base node (base node of inde...
virtual bool RestartAtPathStartOnSynchronize()
When the operator is being synchronized with a new solution (when Start() is called),...
virtual int64_t GetBaseNodeRestartPosition(int base_index)
Returns the index of the node to which the base node of index base_index must be set to when it reach...
bool MakeOneNeighbor() override
This method should not be overridden. Override MakeNeighbor() instead.
virtual bool InitPosition() const
Returns true if the operator needs to restart its initial position at each call to Start()
virtual void SetNextBaseToIncrement(int64_t base_index)
Set the next base to increment on next iteration.
Usual limit based on wall_time, number of explored branches and number of failures in the search tree...
int64_t solutions() const
Base class of all search limits.
A search monitor is a simple set of callbacks to monitor all search events.
A sequence variable is a variable whose domain is a set of possible orderings of the interval variabl...
This class is the root class of all solution collectors.
DemonPriority
This enum represents the three possible priorities for a demon in the Solver queue.
A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in r...