mirror of
https://github.com/ethereum/solidity
synced 2023-10-03 13:03:40 +00:00
180 lines
5.2 KiB
C++
180 lines
5.2 KiB
C++
/*
|
|
This file is part of solidity.
|
|
|
|
solidity 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.
|
|
|
|
solidity 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 solidity. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include <tools/yulPhaser/Population.h>
|
|
|
|
#include <tools/yulPhaser/Selections.h>
|
|
|
|
#include <libsolutil/CommonData.h>
|
|
#include <libsolutil/CommonIO.h>
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
#include <numeric>
|
|
|
|
using namespace std;
|
|
using namespace solidity;
|
|
using namespace solidity::langutil;
|
|
using namespace solidity::util;
|
|
using namespace solidity::phaser;
|
|
|
|
namespace solidity::phaser
|
|
{
|
|
|
|
ostream& operator<<(ostream& _stream, Individual const& _individual);
|
|
ostream& operator<<(ostream& _stream, Population const& _population);
|
|
|
|
}
|
|
|
|
ostream& phaser::operator<<(ostream& _stream, Individual const& _individual)
|
|
{
|
|
_stream << "Fitness: " << _individual.fitness;
|
|
_stream << ", optimisations: " << _individual.chromosome;
|
|
|
|
return _stream;
|
|
}
|
|
|
|
bool phaser::isFitter(Individual const& a, Individual const& b)
|
|
{
|
|
return (
|
|
(a.fitness < b.fitness) ||
|
|
(a.fitness == b.fitness && a.chromosome.length() < b.chromosome.length()) ||
|
|
(a.fitness == b.fitness && a.chromosome.length() == b.chromosome.length() && toString(a.chromosome) < toString(b.chromosome))
|
|
);
|
|
}
|
|
|
|
Population Population::makeRandom(
|
|
shared_ptr<FitnessMetric const> _fitnessMetric,
|
|
size_t _size,
|
|
function<size_t()> _chromosomeLengthGenerator
|
|
)
|
|
{
|
|
vector<Chromosome> chromosomes;
|
|
for (size_t i = 0; i < _size; ++i)
|
|
chromosomes.push_back(Chromosome::makeRandom(_chromosomeLengthGenerator()));
|
|
|
|
return Population(move(_fitnessMetric), move(chromosomes));
|
|
}
|
|
|
|
Population Population::makeRandom(
|
|
shared_ptr<FitnessMetric const> _fitnessMetric,
|
|
size_t _size,
|
|
size_t _minChromosomeLength,
|
|
size_t _maxChromosomeLength
|
|
)
|
|
{
|
|
return makeRandom(
|
|
move(_fitnessMetric),
|
|
_size,
|
|
std::bind(uniformChromosomeLength, _minChromosomeLength, _maxChromosomeLength)
|
|
);
|
|
}
|
|
|
|
void Population::run(optional<size_t> _numRounds, ostream& _outputStream)
|
|
{
|
|
for (size_t round = 0; !_numRounds.has_value() || round < _numRounds.value(); ++round)
|
|
{
|
|
doMutation();
|
|
doSelection();
|
|
|
|
_outputStream << "---------- ROUND " << round << " ----------" << endl;
|
|
_outputStream << *this;
|
|
}
|
|
}
|
|
|
|
Population Population::select(Selection const& _selection) const
|
|
{
|
|
vector<Individual> selectedIndividuals;
|
|
for (size_t i: _selection.materialise(m_individuals.size()))
|
|
selectedIndividuals.emplace_back(m_individuals[i]);
|
|
|
|
return Population(m_fitnessMetric, selectedIndividuals);
|
|
}
|
|
|
|
Population operator+(Population _a, Population _b)
|
|
{
|
|
// This operator is meant to be used only with populations sharing the same metric (and, to make
|
|
// things simple, "the same" here means the same exact object in memory).
|
|
assert(_a.m_fitnessMetric == _b.m_fitnessMetric);
|
|
|
|
return Population(_a.m_fitnessMetric, move(_a.m_individuals) + move(_b.m_individuals));
|
|
}
|
|
|
|
bool Population::operator==(Population const& _other) const
|
|
{
|
|
// We consider populations identical only if they share the same exact instance of the metric.
|
|
// It might be possible to define some notion of equality for metric objects but it would
|
|
// be an overkill since mixing populations using different metrics is not a common use case.
|
|
return m_individuals == _other.m_individuals && m_fitnessMetric == _other.m_fitnessMetric;
|
|
}
|
|
|
|
ostream& phaser::operator<<(ostream& _stream, Population const& _population)
|
|
{
|
|
auto individual = _population.m_individuals.begin();
|
|
for (; individual != _population.m_individuals.end(); ++individual)
|
|
_stream << *individual << endl;
|
|
|
|
return _stream;
|
|
}
|
|
|
|
void Population::doMutation()
|
|
{
|
|
// TODO: Implement mutation and crossover
|
|
}
|
|
|
|
void Population::doSelection()
|
|
{
|
|
randomizeWorstChromosomes(*m_fitnessMetric, m_individuals, m_individuals.size() / 2);
|
|
m_individuals = sortedIndividuals(move(m_individuals));
|
|
}
|
|
|
|
void Population::randomizeWorstChromosomes(
|
|
FitnessMetric const& _fitnessMetric,
|
|
vector<Individual>& _individuals,
|
|
size_t _count
|
|
)
|
|
{
|
|
assert(_individuals.size() >= _count);
|
|
// ASSUMPTION: _individuals is sorted in ascending order
|
|
|
|
auto individual = _individuals.begin() + (_individuals.size() - _count);
|
|
for (; individual != _individuals.end(); ++individual)
|
|
{
|
|
auto chromosome = Chromosome::makeRandom(binomialChromosomeLength(MaxChromosomeLength));
|
|
size_t fitness = _fitnessMetric.evaluate(chromosome);
|
|
*individual = {move(chromosome), fitness};
|
|
}
|
|
}
|
|
|
|
vector<Individual> Population::chromosomesToIndividuals(
|
|
FitnessMetric const& _fitnessMetric,
|
|
vector<Chromosome> _chromosomes
|
|
)
|
|
{
|
|
vector<Individual> individuals;
|
|
for (auto& chromosome: _chromosomes)
|
|
individuals.emplace_back(move(chromosome), _fitnessMetric);
|
|
|
|
return individuals;
|
|
}
|
|
|
|
vector<Individual> Population::sortedIndividuals(vector<Individual> _individuals)
|
|
{
|
|
sort(_individuals.begin(), _individuals.end(), isFitter);
|
|
return _individuals;
|
|
}
|