vector.hpp

Go to the documentation of this file.

/*
 * Copyright © 2025-2026 Akreon LLC
 * SPDX-License-Identifier: Apache-2.0
 */
 
#pragma once
 
#include "akreon/linalg/assert.hpp"
 
#include <array>
#include <ranges>
#include <span>
#include <type_traits>
 
#include "algebra_util.hpp"
 
namespace linalg {
 
template <typename T, std::size_t N>
struct Vector {
  template <typename... Coords>
  constexpr Vector(Coords... coords)
    requires(sizeof...(coords) == N)
      : coordinates{coords...} {}
 
  constexpr Vector() : coordinates{} {}
 
  constexpr auto begin() const { return coordinates.begin(); }
 
  constexpr auto end() const { return coordinates.end(); }
 
  constexpr const T& operator()(std::size_t idx) const {
    AK_ASSERT(idx < N && "Vector const access index out of bounds");
    return coordinates[idx];
  }
 
  constexpr T& operator()(std::size_t idx) {
    AK_ASSERT(idx < N && "Vector mutable access index out of bounds");
    return coordinates[idx];
  }
 
  constexpr bool operator==(const Vector& other) const {
    return is_equal(other);
  }
 
  constexpr bool operator!=(const Vector& other) const {
    return !is_equal(other);
  }
 
  constexpr auto view() { return std::span<T, N>{coordinates}; }
 
  constexpr auto size() const { return N; }
 
private:
  constexpr bool is_equal(const Vector& other) const {
    for (std::size_t i = 0; i < N; ++i)
      if (other.coordinates[i] != coordinates[i]) return false;
    return true;
  }
 
  std::array<T, N> coordinates; 
};
 
template <typename T, typename... Ts>
Vector(T, Ts...) -> Vector<std::common_type_t<T, Ts...>, 1 + sizeof...(Ts)>;
 
} // namespace linalg