arrays.hpp

Go to the documentation of this file.

// Copyright (c) 2013-2017 Commissariat à l'énergie atomique et aux énergies alternatives (CEA)
// Copyright (c) 2013-2017 Centre national de la recherche scientifique (CNRS)
// Copyright (c) 2019-2023 Simons Foundation
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You may obtain a copy of the License at
//     https://www.gnu.org/licenses/gpl-3.0.txt
//
// Authors: Olivier Parcollet, Nils Wentzell
 
#pragma once

 
// for python code generator, we need to know what to include...
#define TRIQS_INCLUDED_ARRAYS
 
#include <cassert>
 
#include <complex>
#include <h5/h5.hpp>
#include <nda/nda.hpp>
#include <nda/h5.hpp>
#include <nda/mpi.hpp>
#include <nda/blas.hpp>
#include <nda/lapack.hpp>
#include <nda/linalg/det.hpp>
#include <nda/linalg/inv.hpp>
#include <nda/clef/adapters/math.hpp>
#include <nda/clef/sum.hpp>
 
#include "utility/concept_tools.hpp"
#include "utility/exceptions.hpp"
 
#define TRIQS_CLEF_MAKE_FNT_LAZY CLEF_MAKE_FNT_LAZY
#define TRIQS_CLEF_IMPLEMENT_LAZY_CALL CLEF_IMPLEMENT_LAZY_CALL
 
namespace stdutil = nda::stdutil;
 
namespace triqs {
 
  namespace clef = nda::clef;
  using dcomplex = std::complex<double>;
  using namespace std::literals::complex_literals;
 
  using nda::range;
 
} // namespace triqs
 
namespace triqs::arrays {
 
  using namespace nda;
 
  using nda::blas::dot;
 
  template <typename... T> std::array<long, sizeof...(T)> make_shape(T... x) { return {long(x)...}; }
 
} // namespace triqs::arrays
 
namespace nda {
 
  // Rotate the index n to 0, preserving the relative order of the other indices
  template <int N, typename A> auto rotate_index_view(A &&a) {
    return permuted_indices_view<encode(nda::permutations::cycle<get_rank<A>>(-1, N + 1))>(std::forward<A>(a));
  }
 
} // namespace nda