depth.hpp

 
#ifndef UFO_CONTAINER_TREE_PREDICATE_DEPTH_HPP
#define UFO_CONTAINER_TREE_PREDICATE_DEPTH_HPP
 
// UFO
#include <ufo/container/tree/predicate/filter.hpp>
#include <ufo/container/tree/predicate/predicate_interval.hpp>
 
namespace ufo::pred
{
namespace detail
{
struct Depth {
    using value_type = int;
};
}  // namespace detail
 
template <bool Negated = false>
using Depth = PredicateInterval<detail::Depth, Negated>;
 
static constexpr inline Depth<false> const depth;
 
template <bool Negated>
struct Filter<Depth<Negated>> {
    using Pred = Depth<Negated>;
 
    template <class Tree>
    static constexpr void init(Pred&, Tree const&) noexcept
    {
    }
 
    template <class Value>
    [[nodiscard]] static constexpr bool returnableValue(Pred const&, Value const&) noexcept
    {
        return true;
    }
 
    template <class Tree>
    [[nodiscard]] static constexpr bool returnable(Pred const& p, Tree const& t,
                                                   typename Tree::Node const& n) noexcept
    {
        // Cast to int to prevent int to be promoted to unsigned
        int  depth = static_cast<int>(t.depth(n));
        bool ret   = p.min <= depth && depth <= p.max;
        if constexpr (Negated) {
            return !ret;
        } else {
            return ret;
        }
    }
 
    template <class Tree>
    [[nodiscard]] static constexpr bool traversable(Pred const& p, Tree const& t,
                                                    typename Tree::Node const& n) noexcept
    {
        // Cast to int to prevent int to be promoted to unsigned
        int depth = static_cast<int>(t.depth(n));
        if constexpr (Negated) {
            return 0 < p.min || p.max + 1 < depth;
        } else {
            return p.min < depth;
        }
    }
 
    template <class Tree>
    [[nodiscard]] static constexpr bool returnableRay(Pred const& p, Tree const& t,
                                                      typename Tree::Node const& n,
                                                      typename Tree::Ray const&) noexcept
    {
        return returnable(p, t, n);
    }
 
    template <class Tree>
    [[nodiscard]] static constexpr bool traversableRay(Pred const& p, Tree const& t,
                                                       typename Tree::Node const& n,
                                                       typename Tree::Ray const&) noexcept
    {
        return traversable(p, t, n);
    }
};
}  // namespace ufo::pred
 
#endif  // UFO_CONTAINER_TREE_PREDICATE_DEPTH_HPP