blob: 7799b888777e693bd11154a215aceec0f07d7df4 (
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
44
45
46
47
48
49
50
51
52
53
|
// 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 ITERATION_REPORT_H
#define ITERATION_REPORT_H
#include <iostream>
class IterationReport :
public Listener<SearchFinish<CoveringArray, CoverageCost> > {
protected:
unsigned total;
public:
IterationReport() :
total(0) {}
void signal(const SearchFinish<CoveringArray, CoverageCost>&finish) {
std::set<const Node<CoveringArray, CoverageCost>*>best =
finish.source.getBest();
if (best.size()) {
const CoveringArray&state = (*best.begin())->getState();
assert(state.isTrackingNoncoverage());
std::cout << "Search stopped after " << finish.iterations << '/' <<
finish.maxIterations << " iteration(s) with " <<
state.getNoncoverage().size() << " uncovered t-sets and " <<
state.getMultipleCoverageCount() << " multicovered t-sets" << std::endl;
} else {
std::cout << "Search stopped after " << finish.iterations << '/' <<
finish.maxIterations << " iteration(s) with no results" << std::endl;
}
total += finish.iterations;
std::cout << "Used " << total << " total iterations thus far" << std::endl;
}
unsigned getTotal() const {
return total;
}
};
#endif
|
