// 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 .
#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 > {
protected:
unsigned guess;
unsigned lastGuess;
public:
AnnealingPartitioner() :
guess(0),
lastGuess(0) {}
unsigned operator ()(unsigned offset, unsigned size);
void signal(const SearchFinish&finish);
};
#endif