SimiLie
Loading...
Searching...
No Matches
weighted_levi_civita_tensor.hpp
1// SPDX-FileCopyrightText: 2026 Baptiste Legouix
2// SPDX-License-Identifier: AGPL-3.0-or-later
3// AI-GENERATED
4
5#pragma once
6
7#include <similie/misc/type_seq_ext.hpp>
8#include <similie/tensor/tensor_indices/antisymmetric_tensor.hpp>
9
10namespace sil::tensor {
11
12// Source and Target group the natural indices on each side of the Hodge map.
13// Store signed coefficients for sorted source and complementary target IDs.
14// Permutations within either group change sign; repeated IDs give zero.
15template <
16 misc::Specialization<TensorAntisymmetricIndex> Source,
17 misc::Specialization<TensorAntisymmetricIndex> Target>
19{
20 static constexpr bool is_tensor_index = true;
21 static constexpr bool is_explicitely_stored_tensor = true;
23 typename Source::subindices_domain_t,
24 typename Target::subindices_domain_t>;
25
26 KOKKOS_FUNCTION static constexpr subindices_domain_t subindices_domain()
27 {
28 return subindices_domain_t(Source::subindices_domain(), Target::subindices_domain());
29 }
30 static constexpr std::size_t rank()
31 {
32 return Source::rank() + Target::rank();
33 }
34 static_assert(rank() > 0);
35 static_assert([]<class... Indices>(ddc::DiscreteDomain<Indices...> const&) {
36 return ((Indices::size() == rank()) && ...);
38 static constexpr std::size_t size()
39 {
40 return Source::size() * Target::size();
41 }
42 static constexpr std::size_t mem_size()
43 {
44 return Source::mem_size();
45 }
46 static constexpr std::size_t access_size()
47 {
48 return 1 + 2 * mem_size();
49 }
50
51 KOKKOS_FUNCTION static constexpr std::size_t mem_id(std::array<std::size_t, rank()> const& ids)
52 {
53 std::array<std::size_t, Source::rank()> source {};
54 for (std::size_t i = 0; i < source.size(); ++i)
55 source[i] = ids[i];
56 return Source::mem_id(source);
57 }
58 KOKKOS_FUNCTION static constexpr std::size_t access_id(
59 std::array<std::size_t, rank()> const& ids)
60 {
61 bool odd = false;
62 for (std::size_t i = 0; i < rank(); ++i) {
63 if (ids[i] >= rank())
64 return 0;
65 for (std::size_t j = i + 1; j < rank(); ++j) {
66 if (ids[i] == ids[j])
67 return 0;
68 if ((i < Source::rank()) == (j < Source::rank()) && ids[i] > ids[j])
69 odd = !odd;
70 }
71 }
72 return 1 + mem_id(ids) + (odd ? mem_size() : 0);
73 }
74 KOKKOS_FUNCTION static constexpr std::size_t access_id_to_mem_id(std::size_t id)
75 {
76 assert(id != 0);
77 return (id - 1) % mem_size();
78 }
79 template <class Tensor, class Elem, class Id, class Functor>
80 KOKKOS_FUNCTION static constexpr typename Tensor::element_type process_access(
81 Functor const& access,
82 Tensor const& tensor,
83 Elem const& elem)
84 {
85 std::size_t const id = elem.template uid<Id>();
86 if (id == 0)
87 return 0.;
88 return id > mem_size() ? -access(tensor, elem) : access(tensor, elem);
89 }
90 KOKKOS_FUNCTION static constexpr std::array<std::size_t, rank()>
92 {
93 assert(id < mem_size());
94 std::array<std::size_t, rank()> result {};
95 std::array const source = Source::mem_id_to_canonical_natural_ids(id);
96 for (std::size_t i = 0; i < source.size(); ++i)
97 result[i] = source[i];
98 std::size_t next = source.size();
99 for (std::size_t candidate = 0; candidate < rank(); ++candidate) {
100 bool present = false;
101 for (std::size_t value : source)
102 present = present || candidate == value;
103 if (!present)
104 result[next++] = candidate;
105 }
106 return result;
107 }
108};
109
110static_assert(TensorIndexConcept<TensorWeightedLeviCivitaIndex<
111 TensorAntisymmetricIndex<TensorNaturalIndex<detail::DimensionConcept>>,
112 TensorAntisymmetricIndex<>>>);
113} // namespace sil::tensor
convert_type_seq_to_t< ddc::DiscreteDomain, typename detail::CartesianProd< Domains... >::type > cartesian_prod_t
misc::cartesian_prod_t< typename Source::subindices_domain_t, typename Target::subindices_domain_t > subindices_domain_t
static KOKKOS_FUNCTION constexpr std::size_t access_id_to_mem_id(std::size_t id)
static KOKKOS_FUNCTION constexpr Tensor::element_type process_access(Functor const &access, Tensor const &tensor, Elem const &elem)
static KOKKOS_FUNCTION constexpr std::size_t mem_id(std::array< std::size_t, rank()> const &ids)
static KOKKOS_FUNCTION constexpr std::size_t access_id(std::array< std::size_t, rank()> const &ids)
static KOKKOS_FUNCTION constexpr subindices_domain_t subindices_domain()
static KOKKOS_FUNCTION constexpr std::array< std::size_t, rank()> mem_id_to_canonical_natural_ids(std::size_t id)