blob: 34fd5645b7b8ec016afc151e84e22258bd5a6ac0 (
plain)
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
|
// Copyright 2008, 2009 Brady J. Garvin
// This file is part of Covering Arrays by Simulated Annealing (CASA).
// CASA is free software: you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// CASA is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with CASA. If not, see <http://www.gnu.org/licenses/>.
#ifndef ANNEALING_PARTITIONER_H
#define ANNEALING_PARTITIONER_H
#include "algorithms/BinarySearch.H"
#include "events/Listener.H"
#include "search/SearchFinish.H"
#include "covering/state/CoveringArray.H"
#include "covering/cost/CoverageCost.H"
class AnnealingPartitioner :
public Partitioner,
public Listener<SearchFinish<CoveringArray,CoverageCost> > {
protected:
unsigned guess;
unsigned lastGuess;
public:
AnnealingPartitioner() :
guess(0),
lastGuess(0) {}
unsigned operator ()(unsigned offset, unsigned size);
void signal(const SearchFinish<CoveringArray, CoverageCost>&finish);
};
#endif
|