cartesian_heuristic_function.h

#ifndef PROBFD_CARTESIAN_ABSTRACTIONS_CARTESIAN_HEURISTIC_FUNCTION_H
#define PROBFD_CARTESIAN_ABSTRACTIONS_CARTESIAN_HEURISTIC_FUNCTION_H
 
#include "probfd/cartesian_abstractions/types.h"
 
#include "probfd/value_type.h"
 
#include "downward/cartesian_abstractions/refinement_hierarchy.h"
 
#include <memory>
#include <vector>
 
// Forward Declarations
class State;
 
namespace probfd::cartesian_abstractions {
 
/*
  Store RefinementHierarchy and heuristic values for looking up abstract state
  IDs and corresponding heuristic values efficiently.
*/
class CartesianHeuristicFunction {
    // Avoid const to enable moving.
    std::unique_ptr<RefinementHierarchy> refinement_hierarchy_;
    std::vector<value_t> h_values_;
 
public:
    CartesianHeuristicFunction(
        std::unique_ptr<RefinementHierarchy>&& hierarchy,
        std::vector<value_t>&& h_values);
 
    CartesianHeuristicFunction(const CartesianHeuristicFunction&) = delete;
    CartesianHeuristicFunction(CartesianHeuristicFunction&&) = default;
 
    ~CartesianHeuristicFunction();
 
    [[nodiscard]]
    value_t get_value(const State& state) const;
};
 
} // namespace probfd::cartesian_abstractions
 
#endif // PROBFD_CARTESIAN_ABSTRACTIONS_CARTESIAN_HEURISTIC_FUNCTION_H