blt-gp/include/blt/gp/tree.h

123 lines
3.3 KiB
C
Raw Normal View History

2024-06-21 22:04:57 -04:00
#pragma once
2024-06-02 13:38:24 -04:00
/*
* 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/>.
2024-06-21 22:04:57 -04:00
*/
#ifndef BLT_GP_TREE_H
#define BLT_GP_TREE_H
#include <blt/gp/typesystem.h>
#include <blt/gp/stack.h>
#include <blt/gp/fwdecl.h>
2024-06-24 21:56:51 -04:00
#include <blt/std/types.h>
2024-06-21 22:04:57 -04:00
2024-06-25 22:21:41 -04:00
#include <utility>
#include <stack>
2024-06-21 22:04:57 -04:00
namespace blt::gp
{
2024-06-24 21:56:51 -04:00
struct op_container_t
{
2024-06-26 20:26:29 -04:00
op_container_t(detail::callable_t& func, detail::transfer_t& transfer, bool is_value):
func(func), transfer(transfer), is_value(is_value)
2024-06-25 22:21:41 -04:00
{}
detail::callable_t& func;
2024-06-26 20:26:29 -04:00
detail::transfer_t& transfer;
bool is_value;
2024-06-25 22:21:41 -04:00
};
class evaluation_context
{
friend class tree_t;
private:
2024-06-26 20:26:29 -04:00
explicit evaluation_context()
2024-06-25 22:21:41 -04:00
{}
blt::gp::stack_allocator values;
2024-06-24 21:56:51 -04:00
};
2024-06-21 22:04:57 -04:00
class tree_t
{
public:
2024-06-24 21:56:51 -04:00
[[nodiscard]] inline std::vector<op_container_t>& get_operations()
{
return operations;
}
[[nodiscard]] inline const std::vector<op_container_t>& get_operations() const
2024-06-21 22:04:57 -04:00
{
return operations;
}
[[nodiscard]] inline blt::gp::stack_allocator& get_values()
{
return values;
}
2024-06-24 21:56:51 -04:00
2024-06-25 22:21:41 -04:00
evaluation_context evaluate(void* context);
/**
* Helper template for returning the result of the last evaluation
*/
template<typename T>
T get_evaluation_value(evaluation_context& context)
{
return context.values.pop<T>();
}
/**
* Helper template for returning the result of the last evaluation
*/
template<typename T>
T& get_evaluation_ref(evaluation_context& context)
{
return context.values.from<T>(0);
}
/**
2024-06-26 20:26:29 -04:00
* Helper template for returning the result of evaluation (this calls it)
2024-06-25 22:21:41 -04:00
*/
template<typename T>
T get_evaluation_value(void* context)
{
auto results = evaluate(context);
return results.values.pop<T>();
}
2024-06-21 22:04:57 -04:00
private:
2024-06-24 21:56:51 -04:00
std::vector<op_container_t> operations;
2024-06-21 22:04:57 -04:00
blt::gp::stack_allocator values;
2024-06-24 21:56:51 -04:00
blt::size_t depth;
};
class population_t
{
public:
2024-06-25 22:21:41 -04:00
std::vector<tree_t>& getIndividuals()
{
return individuals;
}
2024-06-24 21:56:51 -04:00
private:
std::vector<tree_t> individuals;
2024-06-21 22:04:57 -04:00
};
}
#endif //BLT_GP_TREE_H