/usr/include/gecode/search.hh is in libgecode-dev 4.4.0-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Christian Schulte, 2002
* Guido Tack, 2004
*
* Last modified:
* $Date: 2015-03-17 11:17:00 +0100 (Tue, 17 Mar 2015) $ by $Author: tack $
* $Revision: 14443 $
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#ifndef __GECODE_SEARCH_HH__
#define __GECODE_SEARCH_HH__
#include <gecode/kernel.hh>
/*
* Configure linking
*
*/
#if !defined(GECODE_STATIC_LIBS) && \
(defined(__CYGWIN__) || defined(__MINGW32__) || defined(_MSC_VER))
#ifdef GECODE_BUILD_SEARCH
#define GECODE_SEARCH_EXPORT __declspec( dllexport )
#else
#define GECODE_SEARCH_EXPORT __declspec( dllimport )
#endif
#else
#ifdef GECODE_GCC_HAS_CLASS_VISIBILITY
#define GECODE_SEARCH_EXPORT __attribute__ ((visibility("default")))
#else
#define GECODE_SEARCH_EXPORT
#endif
#endif
// Configure auto-linking
#ifndef GECODE_BUILD_SEARCH
#define GECODE_LIBRARY_NAME "Search"
#include <gecode/support/auto-link.hpp>
#endif
namespace Gecode { namespace Search {
/// %Sequential search engine implementations
namespace Sequential {}
/// %Parallel search engine implementations
namespace Parallel {}
/// %Meta search engine implementations
namespace Meta {}
/**
* \brief %Search configuration
*
* \ingroup TaskModelSearch
*/
namespace Config {
/// Whether engines create a clone when being initialized
const bool clone = true;
/// Number of threads to use
const double threads = 1.0;
/// Create a clone after every \a c_d commits (commit distance)
const unsigned int c_d = 8;
/// Create a clone during recomputation if distance is greater than \a a_d (adaptive distance)
const unsigned int a_d = 2;
/// Minimal number of open nodes for stealing
const unsigned int steal_limit = 3;
/// Initial delay in milliseconds for all but first worker thread
const unsigned int initial_delay = 5;
/// Depth limit for no-good generation during search
const unsigned int nogoods_limit = 128;
}
}}
namespace Gecode { namespace Search {
/**
* \defgroup FuncThrowSearch %Search exceptions
* \ingroup FuncThrow
*/
//@{
/// %Exception: Uninitialized cutoff for restart-based search
class GECODE_VTABLE_EXPORT UninitializedCutoff : public Exception {
public:
/// Initialize with location \a l
UninitializedCutoff(const char* l);
};
//@}
}}
#include <gecode/search/exception.hpp>
namespace Gecode { namespace Search {
/**
* \brief %Search engine statistics
* \ingroup TaskModelSearch
*/
class Statistics : public StatusStatistics {
public:
/// Number of failed nodes in search tree
unsigned long int fail;
/// Number of nodes expanded
unsigned long int node;
/// Maximum depth of search stack
unsigned long int depth;
/// Number of restarts
unsigned long int restart;
/// Number of no-goods posted
unsigned long int nogood;
/// Initialize
Statistics(void);
/// Reset
void reset(void);
/// Return sum with \a s
Statistics operator +(const Statistics& s);
/// Increment by statistics \a s
Statistics& operator +=(const Statistics& s);
};
}}
#include <gecode/search/statistics.hpp>
namespace Gecode { namespace Search {
/**
* \brief Base class for cutoff generators for restart-based meta engine
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT Cutoff {
public:
/// \name Constructors and member functions
//@{
/// Default constructor
Cutoff(void);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const = 0;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void) = 0;
/// Destructor
virtual ~Cutoff(void);
//@}
/// Memory management
//@{
/// Allocate memory from heap
static void* operator new(size_t s);
/// Free memory allocated from heap
static void operator delete(void* p);
//@}
/// \name Predefined cutoff generators
//@{
/// Create generator for constant sequence with constant \a s
static Cutoff*
constant(unsigned long int scale=1U);
/// Create generator for linear sequence scaled by \a scale
static Cutoff*
linear(unsigned long int scale=1U);
/** Create generator for geometric sequence scaled by
* \a scale using base \a base
*/
static Cutoff*
geometric(unsigned long int scale=1U, double base=1.5);
/// Create generator for luby sequence with scale-factor \a scale
static Cutoff*
luby(unsigned long int scale=1U);
/** Create generator for random sequence with seed \a seed that
* generates values between \a min and \a max with \a n steps
* between the extreme values (use 0 for \a n to get step size 1).
*/
static Cutoff*
rnd(unsigned int seed,
unsigned long int min, unsigned long int max,
unsigned long int n);
/// Append cutoff values from \a c2 after \a n values from \a c1
static Cutoff*
append(Cutoff* c1, unsigned long int n, Cutoff* c2);
/// Merge cutoff values from \a c1 with values from \a c2
static Cutoff*
merge(Cutoff* c1, Cutoff* c2);
/// Create generator that repeats \a n times each cutoff value from \a c
static Cutoff*
repeat(Cutoff* c, unsigned long int n);
//@}
};
/**
* \brief Cutoff generator for constant sequence
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT CutoffConstant : public Cutoff {
protected:
/// Constant
unsigned long int c;
public:
/// Constructor
CutoffConstant(unsigned long int c);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void);
};
/**
* \brief Cutoff generator for linear sequence
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT CutoffLinear : public Cutoff {
protected:
/// Scale factor
unsigned long int scale;
/// Next number in sequence
unsigned long int n;
public:
/// Constructor
CutoffLinear(unsigned long int scale);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void);
};
/**
* \brief Cutoff generator for the Luby sequence
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT CutoffLuby : public Cutoff {
protected:
/// Iteration number
unsigned long int i;
/// Scale factor
unsigned long int scale;
/// Number of pre-computed luby values
static const unsigned long int n_start = 63U;
/// Precomputed luby-values
static unsigned long int start[n_start];
/// Compute binary logarithm of \a i
static unsigned long int log(unsigned long int i);
/// Compute Luby number for step \a i
static unsigned long int luby(unsigned long int i);
public:
/// Constructor
CutoffLuby(unsigned long int scale);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void);
};
/**
* \brief Cutoff generator for the geometric sequence
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT CutoffGeometric : public Cutoff {
protected:
/// Current cutoff value
double n;
/// Scale factor
double scale;
/// Base
double base;
public:
/// Constructor
CutoffGeometric(unsigned long int scale, double base);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void);
};
/**
* \brief Cutoff generator for the random sequence
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT CutoffRandom : public Cutoff {
protected:
/// Random number generator
Support::RandomGenerator rnd;
/// Minimum cutoff value
unsigned long int min;
/// Random values
unsigned long int n;
/// Step size
unsigned long int step;
/// Current value
unsigned long int cur;
public:
/// Constructor
CutoffRandom(unsigned int seed,
unsigned long int min, unsigned long int max,
unsigned long int n);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void);
};
/**
* \brief Cutoff generator appending two cutoff generators
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT CutoffAppend : public Cutoff {
protected:
/// First cutoff generators
Cutoff* c1;
/// Second cutoff generators
Cutoff* c2;
/// How many number to take from the first
unsigned long int n;
public:
/// Constructor
CutoffAppend(Cutoff* c1, unsigned long int n, Cutoff* c2);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void);
/// Destructor
virtual ~CutoffAppend(void);
};
/**
* \brief Cutoff generator merging two cutoff generators
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT CutoffMerge : public Cutoff {
protected:
/// First cutoff generator
Cutoff* c1;
/// Second cutoff generator
Cutoff* c2;
public:
/// Constructor
CutoffMerge(Cutoff* c1, Cutoff* c2);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void);
/// Destructor
virtual ~CutoffMerge(void);
};
/**
* \brief Cutoff generator that repeats a cutoff from another cutoff generator
* \ingroup TaskModelSearch
*/
class GECODE_SEARCH_EXPORT CutoffRepeat : public Cutoff {
protected:
/// Actual cutoff generator
Cutoff* c;
// Current cutoff
unsigned int cutoff;
// Iteration
unsigned long int i;
// Number of repetitions
unsigned long int n;
public:
/// Constructor
CutoffRepeat(Cutoff* c, unsigned long int n);
/// Return the current cutoff value
virtual unsigned long int operator ()(void) const;
/// Increment and return the next cutoff value
virtual unsigned long int operator ++(void);
/// Destructor
virtual ~CutoffRepeat(void);
};
}}
#include <gecode/search/cutoff.hpp>
namespace Gecode { namespace Search {
class Stop;
/**
* \brief %Search engine options
*
* Defines options for search engines. Not all search engines might
* honor all option values.
*
* - \a c_d as minimal recomputation distance: this guarantees that
* a path between two nodes in the search tree for which copies are
* stored has at least length \a c_d. That is, in order to recompute
* a node in the search tree, \a c_d recomputation steps are needed.
* The minimal recomputation distance yields a guarantee on saving
* memory compared to full copying: it stores \a c_d times less nodes
* than full copying.
* - \a a_d as adaptive recomputation distance: when a node needs to be
* recomputed and the path is longer than \a a_d, an intermediate copy
* is created (approximately in the middle of the path) to speed up
* future recomputation. Note that small values of \a a_d can increase
* the memory consumption considerably.
*
* Full copying corresponds to a maximal recomputation distance
* \a c_d of 1.
*
* All recomputation performed is based on batch recomputation: batch
* recomputation performs propagation only once for an entire path
* used in recomputation.
*
* The number of threads to be used is controlled by a double \f$n\f$
* (assume that \f$m\f$ is the number of processing units available). If
* \f$1 \leq n\f$, \f$n\f$ threads are chosen (of course with rounding).
* If \f$n \leq -1\f$, then \f$m + n\f$ threads are
* chosen (all but \f$-n\f$ processing units get a thread). If \f$n\f$
* is zero, \f$m\f$ threads are chosen. If \f$0<n<1\f$,
* \f$n \times m\f$ threads are chosen. If \f$-1 <n<0\f$,
* \f$(1+n)\times m\f$ threads are chosen.
*
* \ingroup TaskModelSearch
*/
class Options {
public:
/// Whether engines create a clone when being initialized
bool clone;
/// Number of threads to use
double threads;
/// Create a clone after every \a c_d commits (commit distance)
unsigned int c_d;
/// Create a clone during recomputation if distance is greater than \a a_d (adaptive distance)
unsigned int a_d;
/// Depth limit for extraction of no-goods
unsigned int nogoods_limit;
/// Stop object for stopping search
Stop* stop;
/// Cutoff for restart-based search
Cutoff* cutoff;
/// Default options
GECODE_SEARCH_EXPORT static const Options def;
/// Initialize with default values
Options(void);
/// Expand with real number of threads
GECODE_SEARCH_EXPORT Options
expand(void) const;
};
}}
#include <gecode/search/options.hpp>
namespace Gecode { namespace Search {
/**
* \defgroup TaskModelSearchStop Stop-objects for stopping search
* \ingroup TaskModelSearch
*
* Allows to specify various criteria when a search engine should
* stop exploration. Only exploration but neither recomputation
* nor propagation will be interrupted.
*
*/
/**
* \brief Base-class for %Stop-object
* \ingroup TaskModelSearchStop
*/
class GECODE_SEARCH_EXPORT Stop {
public:
/// \name Constructors and member functions
//@{
/// Default constructor
Stop(void);
/// Stop search, if returns true
virtual bool stop(const Statistics& s, const Options& o) = 0;
/// Destructor
virtual ~Stop(void);
//@}
/// \name Memory management
//@{
/// Allocate memory from heap
static void* operator new(size_t s);
/// Free memory allocated from heap
static void operator delete(void* p);
//@}
/// \name Predefined stop objects
//@{
/// Stop if node limit \a l has been exceeded
static Stop* node(unsigned long int l);
/// Stop if failure limit \a l has been exceeded
static Stop* fail(unsigned long int l);
/// Stop if time limit \a l (in milliseconds) has been exceeded
static Stop* time(unsigned long int l);
//@}
};
/**
* \brief %Stop-object based on number of nodes
*
* The number of nodes reported (by the statistics) is the
* number since the engine started exploration. It is not the
* number since the last stop!
* \ingroup TaskModelSearchStop
*/
class GECODE_SEARCH_EXPORT NodeStop : public Stop {
protected:
/// Node limit
unsigned long int l;
public:
/// Stop if node limit \a l is exceeded
NodeStop(unsigned long int l);
/// Return current limit
unsigned long int limit(void) const;
/// Set current limit to \a l nodes
void limit(unsigned long int l);
/// Return true if node limit is exceeded
virtual bool stop(const Statistics& s, const Options& o);
};
/**
* \brief %Stop-object based on number of failures
*
* The number of failures reported (by the statistics) is the
* number since the engine started exploration. It is not the
* number since the last stop!
* \ingroup TaskModelSearchStop
*/
class GECODE_SEARCH_EXPORT FailStop : public Stop {
protected:
/// Failure limit
unsigned long int l;
public:
/// Stop if failure limit \a l is exceeded
FailStop(unsigned long int l);
/// Return current limit
unsigned long int limit(void) const;
/// Set current limit to \a l failures
void limit(unsigned long int l);
/// Return true if failure limit is exceeded
virtual bool stop(const Statistics& s, const Options& o);
};
/**
* \brief %Stop-object based on time
* \ingroup TaskModelSearchStop
*/
class GECODE_SEARCH_EXPORT TimeStop : public Stop {
protected:
/// Time when execution should stop
Support::Timer t;
/// Current limit in milliseconds
unsigned long int l;
public:
/// Stop if search exceeds \a l milliseconds (from creation of this object)
TimeStop(unsigned long int l);
/// Return current limit in milliseconds
unsigned long int limit(void) const;
/// Set current limit to \a l milliseconds
void limit(unsigned long int l);
/// Reset time to zero
void reset(void);
/// Return true if time limit is exceeded
virtual bool stop(const Statistics& s, const Options& o);
};
}}
#include <gecode/search/stop.hpp>
namespace Gecode { namespace Search {
/**
* \brief %Search engine implementation interface
*/
class GECODE_SEARCH_EXPORT Engine {
public:
/// Return next solution (NULL, if none exists or search has been stopped)
virtual Space* next(void) = 0;
/// Return statistics
virtual Statistics statistics(void) const = 0;
/// Check whether engine has been stopped
virtual bool stopped(void) const = 0;
/// Reset engine to restart at space \a s (does nothing)
virtual void reset(Space* s);
/// Return no-goods (the no-goods are empty)
virtual NoGoods& nogoods(void);
/// Destructor
virtual ~Engine(void);
/// \name Memory management
//@{
/// Allocate memory from heap
static void* operator new(size_t s);
/// Free memory allocated from heap
static void operator delete(void* p);
//@}
};
}}
#include <gecode/search/engine.hpp>
namespace Gecode {
template<template<class> class E, class T>
class RBS;
}
namespace Gecode { namespace Search {
/// Base-class for search engines
template<class T>
class EngineBase {
template<template<class>class,class> friend class ::Gecode::RBS;
protected:
/// The actual search engine
Engine* e;
/// Constructor
EngineBase(Engine* e = NULL);
public:
/// Return next solution (NULL, if none exists or search has been stopped)
virtual T* next(void);
/// Return statistics
virtual Statistics statistics(void) const;
/// Check whether engine has been stopped
virtual bool stopped(void) const;
/// Return no-goods (the no-goods are empty)
virtual NoGoods& nogoods(void);
/// Destructor
virtual ~EngineBase(void);
/// \name Memory management
//@{
/// Allocate memory from heap
static void* operator new(size_t s);
/// Free memory allocated from heap
static void operator delete(void* p);
//@}
};
}}
#include <gecode/search/engine-base.hpp>
namespace Gecode {
/**
* \brief Depth-first search engine
*
* This class supports depth-first search for subclasses \a T of
* Space.
* \ingroup TaskModelSearch
*/
template<class T>
class DFS : public Search::EngineBase<T> {
public:
/// Initialize search engine for space \a s with options \a o
DFS(T* s, const Search::Options& o=Search::Options::def);
};
/// Invoke depth-first search engine for subclass \a T of space \a s with options \a o
template<class T>
T* dfs(T* s, const Search::Options& o=Search::Options::def);
}
#include <gecode/search/dfs.hpp>
namespace Gecode {
/**
* \brief Depth-first branch-and-bound search engine
*
* Additionally, \a s must implement a member function
* \code virtual void constrain(const T& t) \endcode
* Whenever exploration requires to add a constraint
* to the space \a c currently being explored, the engine
* executes \c c.constrain(t) where \a t is the so-far
* best solution.
* \ingroup TaskModelSearch
*/
template<class T>
class BAB : public Search::EngineBase<T> {
public:
/// Initialize engine for space \a s and options \a o
BAB(T* s, const Search::Options& o=Search::Options::def);
};
/**
* \brief Perform depth-first branch-and-bound search for subclass \a T of space \a s and options \a o
*
* Additionally, \a s must implement a member function
* \code virtual void constrain(const T& t) \endcode
* Whenever exploration requires to add a constraint
* to the space \a c currently being explored, the engine
* executes \c c.constrain(t) where \a t is the so-far
* best solution.
*
* \ingroup TaskModelSearch
*/
template<class T>
T* bab(T* s, const Search::Options& o=Search::Options::def);
}
#include <gecode/search/bab.hpp>
namespace Gecode {
/**
* \brief Meta-engine performing restart-based search
*
* The engine uses the Cutoff sequence supplied in the options \a o to
* periodically restart the search of engine \a E.
*
* The class \a T can implement member functions
* \code virtual bool master(const CRI& cri) \endcode
* and
* \code virtual bool slave(const CRI& cri) \endcode
*
* Whenever exploration restarts or a solution is found, the
* engine executes the functions on the master and slave
* space. For more details, consult "Modeling and Programming
* with Gecode".
*
* \ingroup TaskModelSearch
*/
template<template<class> class E, class T>
class RBS : public Search::EngineBase<T> {
using Search::EngineBase<T>::e;
public:
/// Initialize engine for space \a s and options \a o
RBS(T* s, const Search::Options& o);
};
/**
* \brief Perform restart-based search
*
* The engine uses the Cutoff sequence supplied in the options \a o to
* periodically restart the search of engine \a E.
*
* The class \a T can implement member functions
* \code virtual bool master(const CRI& cri) \endcode
* and
* \code virtual bool slave(const CRI& cri) \endcode
*
* Whenever exploration restarts or a solution is found, the
* engine executes the functions on the master and slave
* space. For more details, consult "Modeling and Programming
* with Gecode".
*
* \ingroup TaskModelSearch
*/
template<template<class> class E, class T>
T* rbs(T* s, const Search::Options& o);
}
#include <gecode/search/rbs.hpp>
#endif
// STATISTICS: search-other
|