#pragma once
/*
* 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 .
*/
#ifndef BLT_GP_TREE_H
#define BLT_GP_TREE_H
#include
#include
#include
#include
#include
#include
namespace blt::gp
{
struct op_container_t
{
op_container_t(detail::callable_t& func, detail::transfer_t& transfer, operator_id id, bool is_value):
func(func), transfer(transfer), id(id), is_value(is_value)
{}
std::reference_wrapper func;
std::reference_wrapper transfer;
operator_id id;
bool is_value;
};
class evaluation_context
{
friend class tree_t;
private:
explicit evaluation_context()
{}
blt::gp::stack_allocator values;
};
class tree_t
{
public:
[[nodiscard]] inline std::vector& get_operations()
{
return operations;
}
[[nodiscard]] inline const std::vector& get_operations() const
{
return operations;
}
[[nodiscard]] inline blt::gp::stack_allocator& get_values()
{
return values;
}
evaluation_context evaluate(void* context);
/**
* Helper template for returning the result of the last evaluation
*/
template
T get_evaluation_value(evaluation_context& context)
{
return context.values.pop();
}
/**
* Helper template for returning the result of the last evaluation
*/
template
T& get_evaluation_ref(evaluation_context& context)
{
return context.values.from(0);
}
/**
* Helper template for returning the result of evaluation (this calls it)
*/
template
T get_evaluation_value(void* context)
{
auto results = evaluate(context);
return results.values.pop();
}
private:
std::vector operations;
blt::gp::stack_allocator values;
blt::size_t depth;
};
class population_t
{
public:
std::vector& getIndividuals()
{
return individuals;
}
private:
std::vector individuals;
};
}
#endif //BLT_GP_TREE_H