dag.hpp

Go to the documentation of this file.

#pragma once
 
#include "bits/dag.hpp"
#include "bits/list.hpp"
#include "task.hpp"
 
#include <iosfwd>
#include <memory>
#include <ranges>
#include <string>
 
namespace joque
{
 
struct edge_content;
using dag_edge = bits::gedge< edge_content >;
 
struct node_content;
using dag_node = bits::gnode< node_content, dag_edge >;
 
enum class ekind : uint8_t
{
        // A after B => A shall be executed after B finishes
        AFTER,
        // A invalidated_by B => if B was executed, A is considered out of date
        INVALIDATED_BY,
        // A requires B => A has to be skipped if B failed
        REQUIRES
};
 
std::string_view to_sv( const ekind& e );
 
struct edge_content
{
        dag_node& source;
        dag_node& target;
        ekind     kind;
};
 
template < ekind Kind, typename Edges >
auto filter_edges( Edges& e )
{
        return e | std::views::filter( []( const dag_edge& e ) {
                       return e->kind == Kind;
               } );
}
 
template < typename Node, typename... Args >
void add_edge( Node& source, Node& target, Args&&... args )
{
        auto& e =
            source.out_edges().emplace_front( source, target, std::forward< Args >( args )... );
        target.in_edges().link_front( e );
}
 
enum class inval : uint8_t
{
        VALID,
        INVALID,
        UNKNOWN
};
std::string_view to_sv( const inval& k );
 
struct node_content
{
        std::string name;
        const task& t;
 
        inval invalidated = inval::UNKNOWN;
 
        bool started = false;
        bool done = false;
        bool failed = false;
};
 
using dag = bits::graph< dag_node >;
 
void insert_set( dag& dag, const task_set& ts, const std::string& filter );
 
}  // namespace joque