Function ArrayFill

benchmarks/GfFill.cpp:30–41

// ===== Fill Array Tensor

static void ArrayFill(benchmark::State &state) {
  std::size_t n_iw = state.range(0);
  nda::array<scalar_t, 2> arr{4 * n_iw, 4 * n_iw};
  nda::array<scalar_t, 3> tensor{2 * n_iw + 1, 2 * n_iw, 2 * n_iw};
  for (auto _ : state) {
    for (int q : range(-n_iw, n_iw + 1)) // Bosonic
      for (int m : range(-n_iw, n_iw))   // Fermionic
        for (int n : range(-n_iw, n_iw)) // Fermionic
          tensor(q + n_iw, m + n_iw, n + n_iw) += arr(m + 2 * n_iw, q + m + 2 * n_iw) * arr(q + n + 2 * n_iw, n + 2 * n_iw);
  }
  state.SetBytesProcessed(int64_t(state.iterations()) * 8 * n_iw * n_iw * n_iw * sizeof(scalar_t));
}
BENCHMARK(ArrayFill)->RangeMultiplier(2)->Range(1 << 6, 1 << 8); //->Complexity();

// ===== Fill Green function Tensor Loop