86 lines
3.0 KiB
C++
86 lines
3.0 KiB
C++
|
/*
|
||
|
|
* <Short Description>
|
||
|
|
* Copyright (C) 2024 Brett Terpstra
|
||
|
|
*
|
||
|
|
* This program 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.
|
||
|
|
*
|
||
|
|
* This program 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 this program. If not, see <https://www.gnu.org/licenses/>.
|
||
|
|
*/
|
||
|
|
#include <blt/gp/program.h>
|
||
|
|
#include <blt/gp/generators.h>
|
||
|
|
#include <blt/gp/tree.h>
|
||
|
|
#include <blt/std/logging.h>
|
||
|
|
|
||
|
|
static constexpr long SEED = 41912;
|
||
|
|
|
||
|
blt::gp::type_provider type_system;
|
||
|
|
blt::gp::gp_program program(type_system, SEED); // NOLINT
|
||
|
|
|
||
|
|
blt::gp::operation_t add([](float a, float b) { return a + b; });
|
||
|
|
blt::gp::operation_t sub([](float a, float b) { return a - b; });
|
||
|
|
blt::gp::operation_t mul([](float a, float b) { return a * b; });
|
||
|
|
blt::gp::operation_t pro_div([](float a, float b) { return b == 0 ? 0.0f : a / b; });
|
||
|
|
|
||
|
|
blt::gp::operation_t op_if([](bool b, float a, float c) {return b ? a : c; });
|
||
|
|
blt::gp::operation_t eq_f([](float a, float b) {return a == b; });
|
||
|
|
blt::gp::operation_t eq_b([](bool a, bool b) {return a == b; });
|
||
|
|
blt::gp::operation_t lt([](float a, float b) {return a < b; });
|
||
|
|
blt::gp::operation_t gt([](float a, float b) {return a > b; });
|
||
|
|
blt::gp::operation_t op_and([](bool a, bool b) {return a && b; });
|
||
|
|
blt::gp::operation_t op_or([](bool a, bool b) {return a || b; });
|
||
|
|
blt::gp::operation_t op_xor([](bool a, bool b) {return static_cast<bool>(a ^ b); });
|
||
|
|
blt::gp::operation_t op_not([](bool b) {return !b; });
|
||
|
|
|
||
|
|
blt::gp::operation_t lit([]() {
|
||
|
|
//static std::uniform_real_distribution<float> dist(-32000, 32000);
|
||
|
|
// static std::uniform_real_distribution<float> dist(0.0f, 10.0f);
|
||
|
|
return program.get_random().get_float(0.0f, 10.f);
|
||
|
|
});
|
||
|
|
|
||
|
|
/**
|
||
|
|
* This is a test using multiple types with blt::gp
|
||
|
|
*/
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
type_system.register_type<float>();
|
||
|
|
type_system.register_type<bool>();
|
||
|
|
|
||
|
|
blt::gp::operator_builder silly{type_system};
|
||
|
|
silly.add_operator(add);
|
||
|
|
silly.add_operator(sub);
|
||
|
|
silly.add_operator(mul);
|
||
|
|
silly.add_operator(pro_div);
|
||
|
|
|
||
|
|
silly.add_operator(op_if);
|
||
|
|
silly.add_operator(eq_f);
|
||
|
|
silly.add_operator(eq_b);
|
||
|
|
silly.add_operator(lt);
|
||
|
|
silly.add_operator(gt);
|
||
|
|
silly.add_operator(op_and);
|
||
|
|
silly.add_operator(op_or);
|
||
|
|
silly.add_operator(op_xor);
|
||
|
|
silly.add_operator(op_not);
|
||
|
|
|
||
|
|
silly.add_operator(lit, true);
|
||
|
|
|
||
|
|
program.set_operations(silly.build());
|
||
|
|
|
||
|
|
blt::gp::grow_generator_t grow;
|
||
|
|
auto tree = grow.generate(blt::gp::generator_arguments{program, type_system.get_type<float>().id(), 3, 7});
|
||
|
|
|
||
|
|
auto value = tree.get_evaluation_value<float>(nullptr);
|
||
|
|
|
||
|
|
BLT_TRACE(value);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|