1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
#include "purify/mpi_utilities.h"
#include "catch2/catch_all.hpp"
using namespace purify;
using Catch::Approx;
TEST_CASE("re-group visibilities in order of processes") {
auto const N = 5;
utilities::vis_params params;
params.u = Vector<t_real>::Random(N);
params.v = Vector<t_real>::Random(N);
params.w = Vector<t_real>::Random(N);
params.vis = Vector<t_complex>::Random(N);
params.weights = Vector<t_complex>::Random(N);
std::vector<t_int> order(N);
SECTION("Single item out of order") {
order[0] = 1;
std::fill(order.begin() + 1, order.end(), 0);
auto actual = params;
utilities::regroup(actual, order, 2);
CHECK(params.u(0) == Approx(actual.u(N - 1)));
CHECK(params.u(N - 1) == Approx(actual.u(0)));
CHECK(params.u.segment(1, N - 2).isApprox(actual.u.segment(1, N - 2)));
}
SECTION("Two items out of order") {
order[0] = 0;
order[1] = 1;
order[2] = 1;
std::fill(order.begin() + 3, order.end(), 0);
auto actual = params;
utilities::regroup(actual, order, 2);
CHECK(params.u(0) == Approx(actual.u(0)));
CHECK(params.u(1) == Approx(actual.u(N - 2)));
CHECK(params.u(2) == Approx(actual.u(N - 1)));
CHECK(params.u(3) == Approx(actual.u(1)));
CHECK(params.u(4) == Approx(actual.u(2)));
}
SECTION("Three procs") {
order = {1, 0, 2, 2, 0};
auto actual = params;
utilities::regroup(actual, order, 3);
CHECK(actual.u(0) == Approx(params.u(N - 1)));
CHECK(actual.u(1) == Approx(params.u(1)));
CHECK(actual.u(2) == Approx(params.u(0)));
CHECK(actual.u(3) == Approx(params.u(3)));
CHECK(actual.u(4) == Approx(params.u(2)));
}
}
|
