/* 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 . */ // SPDX-License-Identifier: GPL-3.0 #include #include #include #include using namespace std; using namespace solidity::phaser; vector RangeSelection::materialise(size_t _poolSize) const { size_t beginIndex = static_cast(round(double(_poolSize) * m_startPercent)); size_t endIndex = static_cast(round(double(_poolSize) * m_endPercent)); vector selection; for (size_t i = beginIndex; i < endIndex; ++i) selection.push_back(i); return selection; } vector MosaicSelection::materialise(size_t _poolSize) const { size_t count = static_cast(round(double(_poolSize) * m_selectionSize)); vector selection; for (size_t i = 0; i < count; ++i) selection.push_back(min(m_pattern[i % m_pattern.size()], _poolSize - 1)); return selection; } vector RandomSelection::materialise(size_t _poolSize) const { size_t count = static_cast(round(double(_poolSize) * m_selectionSize)); vector selection; for (size_t i = 0; i < count; ++i) selection.push_back(SimulationRNG::uniformInt(0, _poolSize - 1)); return selection; } vector RandomSubset::materialise(size_t _poolSize) const { vector selection; for (size_t index = 0; index < _poolSize; ++index) if (SimulationRNG::bernoulliTrial(m_selectionChance)) selection.push_back(index); return selection; }