main page
modules
namespaces
classes
files
Gecode home
Generated on Fri Aug 31 2012 16:21:44 for Gecode by
doxygen
1.8.1.2
gecode
search
sequential
restart.hh
Go to the documentation of this file.
1
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2
/*
3
* Main authors:
4
* Christian Schulte <schulte@gecode.org>
5
*
6
* Copyright:
7
* Christian Schulte, 2009
8
*
9
* Last modified:
10
* $Date: 2009-05-12 22:21:02 +1000 (Tue, 12 May 2009) $ by $Author: schulte $
11
* $Revision: 9063 $
12
*
13
* This file is part of Gecode, the generic constraint
14
* development environment:
15
* http://www.gecode.org
16
*
17
* Permission is hereby granted, free of charge, to any person obtaining
18
* a copy of this software and associated documentation files (the
19
* "Software"), to deal in the Software without restriction, including
20
* without limitation the rights to use, copy, modify, merge, publish,
21
* distribute, sublicense, and/or sell copies of the Software, and to
22
* permit persons to whom the Software is furnished to do so, subject to
23
* the following conditions:
24
*
25
* The above copyright notice and this permission notice shall be
26
* included in all copies or substantial portions of the Software.
27
*
28
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35
*
36
*/
37
38
#ifndef __GECODE_SEARCH_SEQUENTIAL_RESTART_HH__
39
#define __GECODE_SEARCH_SEQUENTIAL_RESTART_HH__
40
41
#include <
gecode/search/sequential/dfs.hh
>
42
43
namespace
Gecode {
namespace
Search {
namespace
Sequential {
44
46
class
Restart
:
public
DFS
{
47
protected
:
49
Space
*
root
;
51
Space
*
best
;
52
public
:
54
Restart
(
Space
* s,
size_t
sz,
const
Search::Options
& o);
56
Space
*
next
(
void
);
58
~Restart
(
void
);
59
};
60
61
forceinline
62
Restart::Restart
(
Space
* s,
size_t
sz,
const
Search::Options
& o) :
63
DFS
(s,sz,o),
64
root(s->status() ==
SS_FAILED
? NULL : s->
clone
()), best(NULL) {}
65
66
forceinline
Space
*
67
Restart::next
(
void
) {
68
if
(
best
!= NULL) {
69
root
->
constrain
(*
best
);
70
root
=
reset
(
root
);
71
}
72
if
(
root
== NULL)
73
return
NULL;
74
delete
best
;
75
best
=
DFS::next
();
76
return
(
best
!= NULL) ?
best
->
clone
() : NULL;
77
}
78
79
forceinline
80
Restart::~Restart
(
void
) {
81
delete
best
;
82
delete
root
;
83
}
84
85
}}}
86
87
#endif
88
89
// STATISTICS: search-sequential