mirror of
https://github.com/triqs/dft_tools
synced 2024-12-27 06:43:40 +01:00
3fe400d34c
- examples split from the rst file using a python script (split_code). - Final result for the doc is unchanged. - examples are compiled and tested with the other tests. - examples' code have been clang-formatted, with triqs style. - doc compiles much faster, and with the same options as the rest of the test. - examples are added as tests, so they are run by make test, as simple C tests. - done for the tutorials and the reference. - autocompile removed (changed into triqs_example directive). - add triqs_example : - make a literal include of the source code. - runs the compiled example - add, as before, the result to the source code in the doc. - added the script split_code, used to make the changes automatically, maybe for later reuse. (in _tools)
23 lines
623 B
C++
23 lines
623 B
C++
#include <triqs/arrays.hpp>
|
|
#include <boost/mpi.hpp>
|
|
using triqs::arrays::array;
|
|
using triqs::clef::placeholder;
|
|
|
|
int main() {
|
|
boost::mpi::environment env; // argc, argv);
|
|
boost::mpi::communicator world;
|
|
|
|
array<long, 2> A(2, 2), B(2, 2), C(2, 2);
|
|
placeholder<0> i_;
|
|
placeholder<1> j_;
|
|
A(i_, j_) << (1 + world.rank()) * (10 * i_ + j_);
|
|
|
|
if (world.rank() == 0) std::cout << " A = " << A << std::endl;
|
|
|
|
boost::mpi::reduce(world, A, C, std::plus<array<long, 2>>(), 0);
|
|
|
|
int s = world.size();
|
|
if (world.rank() == 0) std::cout << " C = " << C << " should be " << array<long, 2>((s * (s + 1) / 2) * A) << std::endl;
|
|
}
|
|
|