match_tree.h

#ifndef PROBFD_PDBS_MATCH_TREE_H
#define PROBFD_PDBS_MATCH_TREE_H
 
#include "probfd/fdr_types.h"
 
#include "probfd/pdbs/types.h"
 
#include <cstddef>
#include <iosfwd>
#include <memory>
#include <stack>
#include <vector>
 
// Forward Declarations
struct FactPair;
 
namespace probfd {
template <typename>
struct Transition;
}
 
namespace probfd::pdbs {
class AssignmentEnumerator;
class ProjectionOperator;
class ProjectionStateSpace;
} // namespace probfd::pdbs
 
namespace probfd::pdbs {
 
class MatchTree {
    struct Node;
 
    std::unique_ptr<Node> root_;
    std::vector<ProjectionOperator> projection_operators_;
    mutable std::stack<Node*> nodes_; // reuse storage
 
public:
    explicit MatchTree(size_t hint_num_operators = 0);
 
    ~MatchTree();
 
    void insert(
        const AssignmentEnumerator& ranking_function,
        ProjectionOperator op,
        const std::vector<FactPair>& progression_preconditions,
        FDRSimpleCostFunction* task_cost_function);
 
    void get_applicable_operators(
        StateRank abstract_state,
        std::vector<const ProjectionOperator*>& operators) const;
 
    void generate_all_transitions(
        StateRank abstract_state,
        std::vector<Transition<const ProjectionOperator*>>& transitions,
        ProjectionStateSpace& state_space) const;
 
    void dump(std::ostream& out) const;
 
private:
    void dump_recursive(std::ostream& out, Node* node) const;
};
 
} // namespace probfd::pdbs
 
#endif