cost_interval.hpp

 
#ifndef UFO_MAP_COST_PREDICATE_COST_INTERVAL_HPP
#define UFO_MAP_COST_PREDICATE_COST_INTERVAL_HPP
 
// UFO
#include <ufo/container/tree/index.hpp>
#include <ufo/container/tree/predicate/filter.hpp>
#include <ufo/map/cost/predicate/cost.hpp>
 
namespace ufo::pred
{
template <bool Negated = false>
struct CostInterval {
    using cost_t = float;
 
    constexpr CostInterval(cost_t min, cost_t max) : min(min), max(max) {}
 
    CostMin min;
    CostMax max;
};
 
template <bool Negated>
CostInterval<!Negated> operator!(CostInterval<Negated> p)
{
    return {p.min, p.max};
}
 
template <bool Negated>
struct Filter<CostInterval<Negated>> {
    using Pred = CostInterval<Negated>;
 
    template <class Tree>
    static constexpr void init(Pred& p, Tree const& t)
    {
    }
 
    template <class Tree>
    [[nodiscard]] static constexpr bool returnable(Pred const& p, Tree const& t,
                                                   TreeIndex const& n)
    {
        if constexpr (Negated) {
            return !Filter<CostGE>::returnable(p.min, t, n) ||
                   !Filter<CostLE>::returnable(p.max, t, n);
        } else {
            return Filter<CostGE>::returnable(p.min, t, n) &&
                   Filter<CostLE>::returnable(p.max, t, n);
        }
    }
 
    template <class Tree>
    [[nodiscard]] static constexpr bool traversable(Pred const& p, Tree const& t,
                                                    TreeIndex const& n)
    {
        if constexpr (Negated) {
            return true;
        } else {
            return Filter<CostGE>::traversable(p.min, t, n) &&
                   Filter<CostLE>::traversable(p.max, t, n);
        }
    }
};
}  // namespace ufo::pred
 
#endif  // UFO_MAP_COST_PREDICATE_COST_INTERVAL_HPP