euclidean_pattern_tuple.hpp

Go to the documentation of this file.

/* This file is part of OpenKalman, a header-only C++ library for
 * Kalman filters and other recursive filters.
 *
 * Copyright (c) 2024-2025 Christopher Lee Ogden <ogden@gatech.edu>
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at https://mozilla.org/MPL/2.0/.
 */

#ifndef OPENKALMAN_EUCLIDEAN_PATTERN_TUPLE_HPP
#define OPENKALMAN_EUCLIDEAN_PATTERN_TUPLE_HPP

#include <type_traits>
#include <tuple>
#include "collections/concepts/tuple_like.hpp"
#include "linear-algebra/coordinates/concepts/euclidean_pattern.hpp"

namespace OpenKalman::coordinates
{
#if not defined(__cpp_concepts) or __cpp_generic_lambdas < 201707L
  namespace detail
  {
    template<typename T, std::size_t...Ix>
    constexpr bool is_euclidean_pattern_tuple_impl(std::index_sequence<Ix...>)
    {
      return (... and euclidean_pattern<std::tuple_element_t<Ix, T>>);
    }

    template<typename T, typename = void>
    struct is_euclidean_pattern_tuple : std::false_type {};

    template<typename T>
    struct is_euclidean_pattern_tuple<T, std::enable_if_t<tuple_like<T>>>
      : std::bool_constant<is_euclidean_pattern_tuple_impl<T>(std::make_index_sequence<std::tuple_size_v<T>>{})> {};
  } // namespace detail
#endif

    
  template<typename T>
#if defined(__cpp_concepts) and __cpp_generic_lambdas >= 201707L
  concept euclidean_pattern_tuple =
    coordinates::pattern_tuple<T> and
    []<std::size_t...Ix>(std::index_sequence<Ix...>)
      { return (... and euclidean_pattern<std::tuple_element_t<Ix, std::decay_t<T>>>); }
      (std::make_index_sequence<std::tuple_size_v<std::decay_t<T>>>{});
#else
  constexpr bool euclidean_pattern_tuple =
    detail::is_euclidean_pattern_tuple<std::decay_t<T>>::value;
#endif


} // namespace OpenKalman::coordinates

#endif //OPENKALMAN_EUCLIDEAN_PATTERN_TUPLE_HPP