graphs/include/graph_base.h

128 lines
3.1 KiB
C++

#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 <https://www.gnu.org/licenses/>.
*/
#ifndef GRAPHS_GRAPH_BASE_H
#define GRAPHS_GRAPH_BASE_H
#include <blt/gfx/renderer/batch_2d_renderer.h>
#include <blt/std/types.h>
#include <blt/std/assert.h>
#include <config.h>
inline blt::size_t last_node = 0;
inline std::string get_name()
{
return "unnamed" + std::to_string(last_node++);
}
struct node_t
{
float repulsiveness = 24.0f;
std::string name;
std::string description;
std::string texture = conf::DEFAULT_IMAGE;
blt::gfx::point2d_t point;
blt::vec2 velocity;
float outline_scale = conf::OUTLINE_SCALE;
blt::color4 outline_color = conf::POINT_OUTLINE_COLOR;
explicit node_t(const blt::gfx::point2d_t& point): name(get_name()), point(point)
{}
explicit node_t(const blt::gfx::point2d_t& point, std::string name): name(std::move(name)), point(point)
{
BLT_ASSERT(!this->name.empty() && "Name should not be empty!");
}
blt::vec2& getVelocityRef()
{
return velocity;
}
blt::vec2& getPositionRef()
{
return point.pos;
}
[[nodiscard]] const blt::vec2& getPosition() const
{
return point.pos;
}
[[nodiscard]] auto& getRenderObj() const
{
return point;
}
};
struct edge_t
{
// fuck you too :3
friend selector_t;
float ideal_spring_length = conf::DEFAULT_SPRING_LENGTH;
float thickness = conf::DEFAULT_THICKNESS;
blt::color4 color = conf::EDGE_COLOR;
std::string description;
edge_t(blt::u64 i1, blt::u64 i2): i1(i1), i2(i2)
{
BLT_ASSERT(i1 != i2 && "Indices cannot be equal!");
}
inline friend bool operator==(edge_t e1, edge_t e2)
{
return (e1.i1 == e2.i1 || e1.i1 == e2.i2) && (e1.i2 == e2.i1 || e1.i2 == e2.i2);
}
[[nodiscard]] size_t getFirst() const
{
return i1;
}
[[nodiscard]] size_t getSecond() const
{
return i2;
}
private:
// we are trying to maintain this as an invariant.
blt::u64 i1, i2;
};
struct edge_hash
{
blt::u64 operator()(const edge_t& e) const
{
return e.getFirst() * e.getSecond();
}
};
struct edge_eq
{
bool operator()(const edge_t& e1, const edge_t& e2) const
{
return e1 == e2;
}
};
#endif //GRAPHS_GRAPH_BASE_H