470a6f2bb7
This paves the way for implementing daggys and other utilities. Squashed commit of the following: commit 1f77239ab3c9e44d190eef94531a39501c8c4dfe Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 16:25:02 2021 -0300 Adding README, stdout support for daggyd logging commit c2c237224e84a3be68aaa597ce98af1365e74a13 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 16:10:29 2021 -0300 removing old daggyd commit cfea2baf61ca10c535801c5a391d2d525a1a2d04 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 16:10:09 2021 -0300 Moving tests into their sub-project folders commit e41ca42069bea1db16dd76b6684a3f692fef6b15 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 15:57:40 2021 -0300 Splitting out daggyd from libdaggy commit be97b146c1d2446f5c03cb78707e921f18c60bd8 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 15:56:55 2021 -0300 Splitting out daggyd from libdaggy commit cb61e140e9d6d8832d61fb7037fd4c0ff6edad00 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 15:49:47 2021 -0300 moving daggy to libdaggy
83 lines
1.7 KiB
C++
83 lines
1.7 KiB
C++
#pragma once
|
|
|
|
#include <deque>
|
|
#include <functional>
|
|
#include <iostream>
|
|
#include <iterator>
|
|
#include <optional>
|
|
#include <queue>
|
|
#include <sstream>
|
|
#include <stdexcept>
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
|
|
#include "Defines.hpp"
|
|
|
|
/*
|
|
The DAG structure in daggy is just to ensure that tasks are run
|
|
in the correct dependent order.
|
|
*/
|
|
|
|
namespace daggy {
|
|
|
|
template <typename T>
|
|
struct Vertex
|
|
{
|
|
RunState state = RunState::QUEUED;
|
|
uint32_t depCount = 0;
|
|
T data;
|
|
std::unordered_set<size_t> children;
|
|
};
|
|
|
|
template <typename K, typename V>
|
|
class DAG
|
|
{
|
|
public:
|
|
// Vertices
|
|
void addVertex(K id, V data);
|
|
|
|
std::unordered_set<K> getVertices() const;
|
|
|
|
// Edges
|
|
void addEdge(const K &from, const K &to);
|
|
|
|
void addEdgeIf(const K &src,
|
|
std::function<bool(const Vertex<V> &v)> predicate);
|
|
|
|
[[nodiscard]] bool isValid() const;
|
|
|
|
bool hasVertex(const K &id);
|
|
|
|
// Attributes
|
|
[[nodiscard]] size_t size() const;
|
|
|
|
[[nodiscard]] bool empty() const;
|
|
|
|
// Reset the DAG to completely unvisited
|
|
void reset();
|
|
|
|
// Reset any vertex with RUNNING state to QUEUED
|
|
void resetRunning();
|
|
|
|
void setVertexState(const K &id, RunState state);
|
|
|
|
void forEach(std::function<void(const Vertex<V> &)> fun) const;
|
|
|
|
[[nodiscard]] bool allVisited() const;
|
|
|
|
std::optional<std::pair<K, V>> visitNext();
|
|
|
|
// WARNING: reference potentially invalidated on insertions.
|
|
Vertex<V> &getVertex(const K &id);
|
|
|
|
void completeVisit(const K &id);
|
|
|
|
private:
|
|
std::unordered_map<K, size_t> keyMap_;
|
|
std::vector<K> vertexName_;
|
|
std::vector<Vertex<V>> vertices_;
|
|
};
|
|
} // namespace daggy
|
|
|
|
#include "DAG.impl.hxx"
|