42 #ifndef __GECODE_SEARCH_HH__ 43 #define __GECODE_SEARCH_HH__ 45 #include <initializer_list> 53 #if !defined(GECODE_STATIC_LIBS) && \ 54 (defined(__CYGWIN__) || defined(__MINGW32__) || defined(_MSC_VER)) 56 #ifdef GECODE_BUILD_SEARCH 57 #define GECODE_SEARCH_EXPORT __declspec( dllexport ) 59 #define GECODE_SEARCH_EXPORT __declspec( dllimport ) 64 #ifdef GECODE_GCC_HAS_CLASS_VISIBILITY 65 #define GECODE_SEARCH_EXPORT __attribute__ ((visibility("default"))) 67 #define GECODE_SEARCH_EXPORT 73 #ifndef GECODE_BUILD_SEARCH 74 #define GECODE_LIBRARY_NAME "Search" 79 namespace Gecode {
namespace Search {
82 namespace Sequential {}
93 namespace Sequential {}
113 const unsigned int c_d = 8;
115 const unsigned int a_d = 2;
123 const unsigned int d_l = 5;
141 namespace Gecode {
namespace Search {
173 namespace Gecode {
namespace Search {
220 bool meta(
void)
const;
224 unsigned int wfst(
void)
const;
227 unsigned int wlst(
void)
const;
229 unsigned int workers(
void)
const;
233 unsigned int efst(
void)
const;
236 unsigned int elst(
void)
const;
238 unsigned int engines(
void)
const;
254 void init(
unsigned int wid,
unsigned int nid,
unsigned int a);
256 void init(
unsigned int wid,
unsigned int nid,
unsigned int a,
259 void invalidate(
void);
263 EdgeInfo(
unsigned int wid,
unsigned int nid,
unsigned int a);
265 operator bool(
void)
const;
267 unsigned int wid(
void)
const;
269 unsigned int nid(
void)
const;
271 unsigned int alternative(
void)
const;
273 std::string string(
void)
const;
297 unsigned int wid,
unsigned int nid,
302 unsigned int wid(
void)
const;
304 unsigned int nid(
void)
const;
306 const Space& space(
void)
const;
308 const Choice& choice(
void)
const;
314 unsigned int pending;
320 unsigned int n_active;
328 void worker(
unsigned int& wid,
unsigned int& eid);
334 void _round(
unsigned int eid);
345 unsigned int workers(
void)
const;
348 unsigned int engines(
void)
const;
350 const EngineInfo& engine(
unsigned int eid)
const;
352 unsigned int eid(
unsigned int wid)
const;
356 virtual void init(
void) = 0;
359 virtual void round(
unsigned int eid) = 0;
361 virtual void skip(
const EdgeInfo& ei) = 0;
365 virtual void done(
void) = 0;
376 static const char* t2s[EngineType::AOE + 1];
381 virtual void init(
void);
383 virtual void round(
unsigned int eid);
385 virtual void skip(
const EdgeInfo& ei);
389 virtual void done(
void);
401 #ifdef GECODE_HAS_CPPROFILER 406 namespace CPProfiler {}
410 namespace Gecode {
namespace CPProfiler {
428 virtual std::string getInfo(
const Space& home)
const = 0;
449 virtual void init(
void);
451 virtual void round(
unsigned int eid);
453 virtual void skip(
const EdgeInfo& ei);
457 virtual void done(
void);
466 namespace Gecode {
namespace Search {
479 virtual unsigned long int operator ()(
void)
const = 0;
481 virtual unsigned long int operator ++(
void) = 0;
506 rnd(
unsigned int seed,
507 unsigned long int min,
unsigned long int max,
508 unsigned long int n);
517 repeat(
Cutoff*
c,
unsigned long int n);
533 virtual unsigned long int operator ()(
void)
const;
535 virtual unsigned long int operator ++(
void);
552 virtual unsigned long int operator ()(
void)
const;
554 virtual unsigned long int operator ++(
void);
568 static const unsigned long int n_start = 63U;
570 static unsigned long int start[n_start];
572 static unsigned long int log(
unsigned long int i);
574 static unsigned long int luby(
unsigned long int i);
579 virtual unsigned long int operator ()(
void)
const;
581 virtual unsigned long int operator ++(
void);
600 virtual unsigned long int operator ()(
void)
const;
602 virtual unsigned long int operator ++(
void);
624 unsigned long int min,
unsigned long int max,
625 unsigned long int n);
627 virtual unsigned long int operator ()(
void)
const;
629 virtual unsigned long int operator ++(
void);
648 virtual unsigned long int operator ()(
void)
const;
650 virtual unsigned long int operator ++(
void);
669 virtual unsigned long int operator ()(
void)
const;
671 virtual unsigned long int operator ++(
void);
694 virtual unsigned long int operator ()(
void)
const;
696 virtual unsigned long int operator ++(
void);
705 namespace Gecode {
namespace Search {
783 namespace Gecode {
namespace Search {
812 static Stop* node(
unsigned long int l);
815 static Stop* fail(
unsigned long int l);
817 static Stop* time(
unsigned long int l);
837 unsigned long int limit(
void)
const;
839 void limit(
unsigned long int l);
860 unsigned long int limit(
void)
const;
862 void limit(
unsigned long int l);
881 unsigned long int limit(
void)
const;
883 void limit(
unsigned long int l);
894 namespace Gecode {
namespace Search {
902 virtual Space* next(
void) = 0;
904 virtual Statistics statistics(
void)
const = 0;
906 virtual bool stopped(
void)
const = 0;
908 virtual void constrain(
const Space&
b);
910 virtual void reset(
Space* s);
912 virtual NoGoods& nogoods(
void);
921 namespace Gecode {
namespace Search {
926 template<
class,
class>
928 template<
class,
template<
class>
class>
937 virtual T* next(
void);
941 virtual bool stopped(
void)
const;
955 namespace Gecode {
namespace Search {
958 template<
class T,
class E>
961 template<
class T,
template<
class>
class E>
977 const Options& options(
void)
const;
979 bool best(
void)
const;
1009 explicit SEBs(
int n);
1011 SEBs(
const std::vector<SEB>&
x);
1013 SEBs(std::initializer_list<SEB> x);
1015 template<
class InputIterator>
1016 SEBs(InputIterator first, InputIterator last);
1041 static const bool best =
false;
1075 static const bool best =
true;
1113 static const bool best =
false;
1151 template<
class T,
template<
class>
class E =
DFS>
1158 static const bool best = E<T>::best;
1179 template<
class T,
template<
class>
class E>
1183 template<
class T,
template<
class>
class E>
1190 namespace Gecode {
namespace Search {
namespace Meta {
1193 template<
class T,
template<
class>
class E>
1197 template<
class T,
template<
class>
class E>
1201 #ifdef GECODE_HAS_THREADS 1204 template<
class T,
template<
class>
class E>
1208 template<
class T,
template<
class>
class E>
1235 template<
class T,
template<
class>
class E =
DFS>
1256 static const bool best = E<T>::best;
1276 template<
class T,
template<
class>
class E>
unsigned int a_d
Create a clone during recomputation if distance is greater than a_d (adaptive distance) ...
double scale
Scale factor.
const Space & _s
The corresponding space.
const Choice * _c
The corresponding choice (nullptr if type is not BRANCH)
Search engine implementation interface
unsigned int nogoods_limit
Depth limit for extraction of no-goods.
Limited discrepancy search engine.
unsigned long int scale
Scale factor.
Class to send solution information to CPProfiler.
Stop-object based on number of nodes
void log(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
Meta-engine performing restart-based search.
Meta engine using a portfolio of search engines.
#define GECODE_SEARCH_EXPORT
Node representing a branch.
Cutoff * c1
First cutoff generator.
unsigned int c_d
Create a clone after every c_d commits (commit distance)
Cutoff generator appending two cutoff generators.
unsigned int _nid
The parent node id.
A class for building search engines.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Options opt
Stored and already expanded options.
unsigned long int l
Current limit in milliseconds.
void stop(Support::Timer &timer, std::ostream &os)
Get time since start of timer and print user friendly time information.
unsigned long int step
Step size.
Engine * build(Space *s, const Options &opt)
Build an engine of type E for a script T.
std::string _s
String corresponding to alternative.
const unsigned int initial_delay
Initial delay in milliseconds for all but first worker thread.
unsigned int slice
Size of a slice in a portfolio (in number of failures)
void linear(Home home, const FloatVarArgs &x, FloatRelType frt, FloatVal c)
Post propagator for .
unsigned long int scale
Scale factor.
unsigned long int fail
Number of failed nodes in search tree.
unsigned long int nogood
Number of no-goods posted.
Support::Timer t
Time when execution should stop.
Node representing failure.
unsigned long int depth
Maximum depth of search stack.
Array with arbitrary number of elements.
Cutoff generator for the Luby sequence.
Base class for cutoff generators for restart-based meta engine.
unsigned long int min
Minimum cutoff value.
Class to record search trace info for CPProfiler.
EngineType
Which type of engine.
unsigned long int c
Constant.
unsigned int d_l
Discrepancy limit (for LDS)
unsigned long int n
Random values.
Statistics for execution of status
A mutex for mutual exclausion among several threads.
std::string expand(Gecode::IntRelType irt)
Expand relation to abbreviation.
Gecode::FloatVal c(-8, 8)
Cutoff generator merging two cutoff generators.
Cutoff * cutoff
Cutoff for restart-based search.
double threads
Number of threads to use.
const bool b
Whether engine to be built is a best solution search engine.
const unsigned int cpprofiler_port
Default port for CPProfiler.
Cutoff generator for the random sequence.
int n
Number of negative literals for node type.
Argument array for non-primitive types.
Recorder for a search tracer with edge information.
Base-class for search engines.
Depth-first branch-and-bound search engine.
FloatVal operator+(const FloatVal &x)
Simple recorder for a search tracer.
static const Options def
Default options.
const unsigned int a_d
Create a clone during recomputation if distance is greater than a_d (adaptive distance) ...
Node representing a solution.
unsigned long int n
How many number to take from the first.
unsigned long int cur
Current value.
struct Gecode::@593::NNF::@62::@63 b
For binary nodes (and, or, eqv)
Support::RandomGenerator rnd
Random number generator.
EngineType _type
The engine type.
unsigned long int i
Iteration number.
double n
Current cutoff value.
bool clone
Whether engines create a clone when being initialized.
Template for linear congruential generators.
Search::Builder * SEB
Type for a search engine builder.
const unsigned int d_l
Default discrepancy limit for LDS.
unsigned int _a
Number of alternative.
Cutoff * c2
Second cutoff generators.
unsigned int _lst
Last worker or engine.
SearchTracer * tracer
Tracer object for tracing search.
T * lds(T *s, const Search::Options &o)
Invoke limited-discrepancy search for s as root node and optionso.
Cutoff * c1
First cutoff generators.
Cutoff generator for linear sequence.
const double threads
Number of threads to use.
T * dfs(T *s, const Search::Options &o)
Invoke depth-first search engine for subclass T of space s with options o.
Support for tracing search.
unsigned int assets
Number of assets (engines) in a portfolio.
Cutoff generator for the geometric sequence.
T * bab(T *s, const Search::Options &o)
Perform depth-first branch-and-bound search for subclass T of space s and options o...
T * pbs(T *s, const Search::Options &o)
Run a portfolio of search engines.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Cutoff * c
Actual cutoff generator.
Cutoff generator for constant sequence.
const double base
Base for geometric restart sequence.
unsigned long int n
Next number in sequence.
Choice for performing commit
No-goods recorded from restarts.
unsigned long int l
Node limit.
Engine * e
The actual search engine.
unsigned int _wid
The worker id.
unsigned long int l
Failure limit.
std::ostream & os
Output stream to use.
Cutoff generator that repeats a cutoff from another cutoff generator.
const unsigned int c_d
Create a clone after every c_d commits (commit distance)
Post propagator for SetVar x
Recorder for engine events (for access control)
unsigned long int restart
Number of restarts.
Passing search engine builder arguments.
unsigned int _nid
The node id.
Stop * stop
Stop object for stopping search.
Gecode toplevel namespace
unsigned long int node
Number of nodes expanded.
const unsigned int nogoods_limit
Depth limit for no-good generation during search.
Information about an engine.
unsigned int _wid
The parent worker id (edge does not exist if UINT_MAX)
Stop-object based on time
Base-class for Stop-object.
Cutoff * c2
Second cutoff generator.
NodeType _nt
The node type.
Base class for heap allocated objects.
static StdSearchTracer def
Default tracer (printing to std::cerr)
const unsigned int steal_limit
Minimal number of open nodes for stealing.
T * rbs(T *s, const Search::Options &o)
Perform restart-based search.
const unsigned int slice
Size of a slice in a portfolio and scale factor for restarts(in number of failures) ...
struct Gecode::@593::NNF::@62::@64 a
For atomic nodes.
Depth-first search engine.
unsigned int _fst
First worker or engine.
Stop-object based on number of failures
const bool clone
Whether engines create a clone when being initialized.