Files
viseq/src/state-manager.h
T

127 lines
3.3 KiB
C++
Raw Normal View History

2024-10-25 16:41:37 +02:00
#pragma once
#include "edge.h"
2024-10-25 16:41:37 +02:00
#include "datatypes.h"
2024-10-30 14:55:24 +01:00
#include "graph-manager.h"
#include "midi-node.h"
2024-10-25 16:41:37 +02:00
#include "signal-manager.h"
#include "ui.h"
2024-10-27 00:40:57 +02:00
#include <algorithm>
#include <iterator>
#include <memory>
#include <ranges>
#include <vector>
2024-10-25 16:41:37 +02:00
class AppState{
public:
2024-10-30 14:55:24 +01:00
AppState() : sm(&gm, &mutex), ui(&settings, &sm, &gm) {}
2024-10-25 16:41:37 +02:00
enum States {IDLE, CONFIG};
AppSettings settings;
States state;
std::mutex mutex;
2024-10-30 14:55:24 +01:00
GraphManager gm;
2024-10-25 16:41:37 +02:00
SignalManager sm;
AppUI ui;
void updateMidiPorts(){
2024-11-01 14:08:27 +01:00
for(auto&n : gm.nodes | RANGE_FILTER([](SPTR_Node n){return n->getNodeType() == NodeType::MIDINODE;})){
auto nc = std::dynamic_pointer_cast<MidiNode>(n);
2024-10-25 16:41:37 +02:00
for(auto& mo : sm.midi.midi_out_ports){
if(!nc->midi_outs.contains(mo.number) && mo.enabled){
nc->midi_outs[mo.number] = {mo.number, mo.port.port_name, false};
2024-10-25 16:41:37 +02:00
}
if(nc->midi_outs.contains(mo.number) && !mo.enabled){
nc->midi_outs.erase(mo.number);
2024-10-25 16:41:37 +02:00
}
}
}
}
2024-11-01 14:08:27 +01:00
void copyNodesAndConnections(VEC_SPTR_Node nodes, Vec2D<float> position){
2024-10-26 16:31:23 +02:00
2024-11-01 14:08:27 +01:00
VEC_SPTR_Edge copy_connections;
for(auto n : nodes){
2024-11-01 14:08:27 +01:00
std::ranges::copy_if(n->connections.begin(), n->connections.end(), std::back_inserter(copy_connections), [nodes](SPTR_Edge e){ return std::ranges::contains(nodes, e->start) && std::ranges::contains(nodes, e->end);});
}
2024-10-26 16:31:23 +02:00
for(auto n : nodes){
2024-11-01 14:08:27 +01:00
SPTR_Node old_node = n;
SPTR_Node new_node = gm.copyNode(n, position + n->drag_offset);
new_node->copied = false;
new_node->selected = true;
2024-10-26 16:31:23 +02:00
for(auto &c : copy_connections){
if(c->start == old_node) c->start = new_node;
if(c->end == old_node) c->end = new_node;
2024-10-26 16:31:23 +02:00
}
}
gm.edges.insert(gm.edges.end(), copy_connections.cbegin(), copy_connections.cend());
2024-10-26 16:31:23 +02:00
}
2024-11-01 14:08:27 +01:00
void removeNodes(VEC_SPTR_Node nodes){
for(auto n : gm.nodes){
n->highlighted = false;
}
2024-11-01 14:08:27 +01:00
auto erase_connections = gm.edges | RANGE_FILTER([nodes](SPTR_Edge c){ return std::ranges::contains(nodes, c->start) || std::ranges::contains(nodes, c->end);});
2024-11-01 14:08:27 +01:00
VEC_SPTR_Node adjacent_nodes;
for(auto c : erase_connections){
if(!c->start->selected) adjacent_nodes.push_back(c->start);
if(!c->end->selected) adjacent_nodes.push_back(c->end);
}
2024-11-01 14:08:27 +01:00
auto reroute_signals = sm.signals | RANGE_FILTER([nodes](SPTR_Signal s){return std::ranges::contains(nodes, s->next);});
for(auto s : reroute_signals){
float dist = 10000000;
2024-11-01 14:08:27 +01:00
SPTR_Node next_node;
for(auto n : adjacent_nodes){
if(n->position.dist(s->position) < dist) {
dist = n->position.dist(s->position);
next_node = n;
}
}
s->next = next_node;
s->last = next_node;
}
2024-11-01 14:08:27 +01:00
auto rebase_signals = sm.signals | RANGE_FILTER([nodes](SPTR_Signal s){return std::ranges::contains(nodes, s->start);});
for(auto s : rebase_signals){
s->start = s->next;
}
for(auto n : nodes){
2024-11-01 14:08:27 +01:00
std::erase_if(gm.edges, [n](SPTR_Edge c){ return c->start == n || c->end == n;});
}
2024-11-01 14:08:27 +01:00
std::erase_if(gm.nodes, [nodes](SPTR_Node n){ return std::ranges::contains(nodes, n);});
}
void draw(Vec2D<float> mouse_pos, Camera2D camera){
2024-10-25 16:41:37 +02:00
mutex.lock();
updateMidiPorts();
mutex.unlock();
2024-10-30 14:55:24 +01:00
gm.drawNodes(mouse_pos, camera);
gm.drawEdges(mouse_pos, camera);
2024-10-25 16:41:37 +02:00
sm.drawSignals(mouse_pos, camera);
}
void drawUI(Vec2D<float> *mouse_pos, Camera2D *camera){
mutex.lock();
ui.draw(mouse_pos, camera);
mutex.unlock();
}
};