hxtask_dag_node.hpp

Go to the documentation of this file.

#pragma once
// SPDX-FileCopyrightText: © 2017-2026 Adrian Johnston.
// SPDX-License-Identifier: MIT
// This file is licensed under the MIT license found in the LICENSE.md file.

 
#include "hxtask_queue.hpp"
 
HX_NS_BEGIN_

template<int32_t max_successors_=4>
class hxtask_dag_node : public hxtask {
public:
    hxtask_dag_node(void);

    void add_successor(hxtask_dag_node* successor_, int priority_ = 0) hxattr_nonnull(2);

    void reset(void) noexcept { m_predecessor_count_ = 0; m_successor_count_ = 0; }

    void on_completion(hxtask_queue* q_) override { this->dag_node_completed_(q_, false); }

    void on_failure(hxtask_queue* q_) override { this->dag_node_completed_(q_, true); }

    void on_cancel(hxtask_queue* q_) override { this->dag_node_completed_(q_, true); }
 
private:
    class edge_t_ {
    public:
        hxtask_dag_node* node_;
        int priority_;
    };
 
    void dag_node_completed_(hxtask_queue* q_, bool is_cancelled_);
 
    int32_t m_predecessor_count_;
    int32_t m_successor_count_;
    edge_t_ m_successors_[max_successors_];
};
 
#include "detail/hxtask_dag_node.inl"
HX_NS_END_