array.hpp

Go to the documentation of this file.

// Copyright (c) 2019-2024 Simons Foundation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0.txt
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// Authors: Thomas Hahn, Olivier Parcollet, Nils Wentzell

 
#pragma once
 
#include "./communicator.hpp"
#include "./ranges.hpp"
#include "./utils.hpp"
 
#include <mpi.h>
 
#include <array>
#include <cstddef>
#include <type_traits>
#include <utility>
 
namespace mpi {


  template <typename T, std::size_t N> void mpi_broadcast(std::array<T, N> &arr, communicator c = {}, int root = 0) { broadcast_range(arr, c, root); }

  template <typename T, std::size_t N>
  auto mpi_reduce(std::array<T, N> const &arr, communicator c = {}, int root = 0, bool all = false, MPI_Op op = MPI_SUM) {
    using value_t = std::remove_cvref_t<decltype(reduce(std::declval<T>()))>;
    std::array<value_t, N> res{};
    reduce_range(arr, res, c, root, all, op);
    return res;
  }

  template <typename T1, std::size_t N1, typename T2, std::size_t N2>
  void mpi_reduce_into(std::array<T1, N1> const &arr_in, std::array<T2, N2> &arr_out, communicator c = {}, int root = 0, bool all = false,
                       MPI_Op op = MPI_SUM) {
    reduce_range(arr_in, arr_out, c, root, all, op);
  }

 
} // namespace mpi