movement_class.h

#pragma once
 
#include <tess/storage/chunk_page.h>
#include <tess/topology/step_policy.h>
 
#include <concepts>
#include <cstdint>
#include <limits>
#include <type_traits>
 
// Movement vocabulary DSL. A MovementClass is a compile-time type that
// fuses a passability predicate and an entry-cost expression, both composed
// from typed-field leaves. Every leaf reads the constexpr
// ChunkPage::field<Tag>(LocalTileId) at the (page, tile) seam -- world-scope
// accessors are not constexpr, so the vocabulary deliberately operates on a
// resolved page. Because the whole predicate inlines to the same &&/||/! a
// hand-written cast would emit, threading a class through labeling / A* /
// commit keeps single-field codegen (no std::function, no virtual).
namespace tess::movement {
 
// Marker base so movement_class_of can distinguish a class from a raw field tag
// without needing a Page type to probe the MovementClassFor concept.
struct movement_class_tag {};
 
// --- Boolean terms over typed fields -----------------------------------------
 
// Truthy iff the named field is truthy at the tile.
template <typename Tag>
struct Field {
  template <typename Page>
  [[nodiscard]] static constexpr bool eval(const Page& page,
                                           LocalTileId id) noexcept {
    static_assert(Page::schema_type::template contains<Tag>,
                  "MovementClass references a field absent from the schema.");
    return static_cast<bool>(page.template field<Tag>(id));
  }
};
 
// Truthy iff the named (integral) field is non-zero -- e.g. a positive weight.
template <typename Tag>
struct NotZero {
  template <typename Page>
  [[nodiscard]] static constexpr bool eval(const Page& page,
                                           LocalTileId id) noexcept {
    static_assert(Page::schema_type::template contains<Tag>,
                  "MovementClass references a field absent from the schema.");
    return page.template field<Tag>(id) != 0;
  }
};

template <typename Term>
struct Not {
  template <typename Page>
  [[nodiscard]] static constexpr bool eval(const Page& page,
                                           LocalTileId id) noexcept {
    return !Term::eval(page, id);
  }
};

template <typename... Terms>
struct AllOf {
  template <typename Page>
  [[nodiscard]] static constexpr bool eval(const Page& page,
                                           LocalTileId id) noexcept {
    return (true && ... && Terms::eval(page, id));
  }
};

template <typename... Terms>
struct AnyOf {
  template <typename Page>
  [[nodiscard]] static constexpr bool eval(const Page& page,
                                           LocalTileId id) noexcept {
    return (false || ... || Terms::eval(page, id));
  }
};
 
// --- cost normalization ------------------------------------------------------
 
// Byte-exact match to path::detail::tile_entry_cost_index (path.h): 0 (or any
// non-positive signed value) means impassable, and the result saturates to
// u32. The overflow compare casts through u64 first, exactly as the A* leaf
// does, so a class-driven cost read is bit-identical to the legacy read.
template <typename Value>
[[nodiscard]] constexpr std::uint32_t normalize_cost(Value value) noexcept {
  static_assert(std::is_integral_v<std::remove_cvref_t<Value>>,
                "MovementClass cost field must be integral.");
  if constexpr (std::is_signed_v<std::remove_cvref_t<Value>>) {
    if (value <= 0) {
      return 0;
    }
  } else if (value == 0) {
    return 0;
  }
  if (static_cast<std::uint64_t>(value) >
      std::numeric_limits<std::uint32_t>::max()) {
    return std::numeric_limits<std::uint32_t>::max();
  }
  return static_cast<std::uint32_t>(value);
}
 
// --- cost EXPRESSIONS (0 == impassable, u32-saturated) -----------------------

struct UnitCost {
  template <typename Page>
  [[nodiscard]] static constexpr std::uint32_t eval(const Page&,
                                                    LocalTileId) noexcept {
    return 1;
  }
};

template <std::uint32_t N>
struct ConstantCost {
  template <typename Page>
  [[nodiscard]] static constexpr std::uint32_t eval(const Page&,
                                                    LocalTileId) noexcept {
    return N;
  }
};

template <typename CostTag>
struct FieldCost {
  template <typename Page>
  [[nodiscard]] static constexpr std::uint32_t eval(const Page& page,
                                                    LocalTileId id) noexcept {
    static_assert(Page::schema_type::template contains<CostTag>,
                  "MovementClass references a field absent from the schema.");
    return normalize_cost(page.template field<CostTag>(id));
  }
};
 
// cost = Base == 0 ? 0 : saturating(Base + Overlay).
// Base/Overlay are cost EXPRESSION types, not values.
template <typename Base, typename Overlay>
struct OverlayCost {
  template <typename Page>
  [[nodiscard]] static constexpr std::uint32_t eval(const Page& page,
                                                    LocalTileId id) noexcept {
    const auto base = Base::eval(page, id);
    if (base == 0) {
      return 0;
    }
    const auto sum = static_cast<std::uint64_t>(base) +
                     static_cast<std::uint64_t>(Overlay::eval(page, id));
    constexpr auto ceiling =
        static_cast<std::uint64_t>(std::numeric_limits<std::uint32_t>::max());
    return static_cast<std::uint32_t>(sum > ceiling ? ceiling : sum);
  }
};
 
// cost = SelTag(truthy) ? WhenSet::eval(page, id) : WhenClear::eval(page, id).
// WhenSet/WhenClear are cost EXPRESSION types, not values.
template <typename SelTag, typename WhenSet, typename WhenClear>
struct SelectCost {
  template <typename Page>
  [[nodiscard]] static constexpr std::uint32_t eval(const Page& page,
                                                    LocalTileId id) noexcept {
    static_assert(Page::schema_type::template contains<SelTag>,
                  "MovementClass references a field absent from the schema.");
    return static_cast<bool>(page.template field<SelTag>(id))
               ? WhenSet::eval(page, id)
               : WhenClear::eval(page, id);
  }
};
 
// --- the class ---------------------------------------------------------------

template <typename PassExpr, typename CostExpr,
          typename StepPolicyT = DefaultSteps>
struct MovementClass : movement_class_tag {
  using pass_expr = PassExpr;
  using cost_expr = CostExpr;
  using step_policy = StepPolicyT;
 
  template <typename Page>
  [[nodiscard]] static constexpr bool passable(const Page& page,
                                               LocalTileId id) noexcept {
    return PassExpr::eval(page, id);
  }
 
  template <typename Page>
  [[nodiscard]] static constexpr std::uint32_t entry_cost(
      const Page& page, LocalTileId id) noexcept {
    return CostExpr::eval(page, id);
  }
};
 
// A class C is usable against pages of type Page.
template <typename C, typename Page>
concept MovementClassFor = std::derived_from<C, movement_class_tag> &&
                           requires(const Page& page, LocalTileId id) {
                             {
                               C::passable(page, id)
                             } -> std::convertible_to<bool>;
                             {
                               C::entry_cost(page, id)
                             } -> std::convertible_to<std::uint32_t>;
                           };
 
// --- field adapters ----------------------------------------------------------
 
// The identity class for a single-field, unweighted world. It is a
// distinct struct (NOT an alias) so it can carry the raw passability tag and
// expose passable_span: per-class region labeling uses that fast path to keep
// the identity flood a byte-identical field_span<Tag> scan.
template <typename PassableTag>
struct UnitCostFieldMovement : MovementClass<Field<PassableTag>, UnitCost> {
  using passable_tag = PassableTag;
 
  template <typename Page>
  [[nodiscard]] static constexpr auto passable_span(Page& page) noexcept {
    return page.template field_span<PassableTag>();
  }
};
 
// Weighted identity that folds cost>0 into passability, so the region graph and
// the weighted search agree exactly (recommended for new weighted classes).
// Deliberately does NOT advertise the span fast path: its passability reads
// two fields, so a raw single-field span scan would label cost-zero tiles.
template <typename PassableTag, typename CostTag>
struct PositiveCostFieldMovement
    : MovementClass<AllOf<Field<PassableTag>, NotZero<CostTag>>,
                    FieldCost<CostTag>> {};
 
// True for classes that expose the field_span fast path. `passable_tag` is
// the advertisement: a class declaring it promises its passability predicate
// is exactly the raw truthiness of that one field and MUST provide the
// matching passable_span (the topology flood scans it verbatim). Composed
// classes -- including PositiveCostFieldMovement, whose predicate reads two
// fields -- must not declare it.
template <typename C>
concept HasPassableSpan = requires { typename C::passable_tag; };
 
// Normalize a template argument that is EITHER a movement class OR a raw field
// tag, so every unit-cost <World, PassableTag> call site compiles unchanged and
// resolves to the byte-identical UnitCostFieldMovement.
template <typename T>
using movement_class_of =
    std::conditional_t<std::derived_from<T, movement_class_tag>, T,
                       UnitCostFieldMovement<T>>;
 
namespace detail {
 
// Adapts any normalized class to unit entry costs while retaining its
// passability predicate and regular-step policy. Used by minimum-step APIs.
template <typename ClassOrTag>
struct UnitMovementClass : movement_class_tag {
  using source_class = movement_class_of<ClassOrTag>;
  using cost_expr = UnitCost;
  using step_policy = step_policy_of<source_class>;
 
  template <typename Page>
  [[nodiscard]] static constexpr bool passable(const Page& page,
                                               LocalTileId id) noexcept {
    return source_class::passable(page, id);
  }
 
  template <typename Page>
  [[nodiscard]] static constexpr std::uint32_t entry_cost(
      const Page&, LocalTileId) noexcept {
    return 1;
  }
};
 
}  // namespace detail
 
}  // namespace tess::movement