27 auto m2n = context.connectPrimaryRanks(
"A",
"B");
29 for (
int dim = 2; dim <= 3; dim++) {
31 for (
int i = 0; i < dim; i++) {
36 auto comm =
m2n->getPrimaryRankCommunication();
38 if (context.isNamed(
"A")) {
41 BOOST_TEST(context.isNamed(
"B"));
46 BOOST_TEST(bb == bbCompare);
55 auto m2n = context.connectPrimaryRanks(
"A",
"B");
57 for (
int dim = 2; dim <= 3; dim++) {
60 for (
Rank rank = 0; rank < 3; rank++) {
62 for (
int i = 0; i < dim; i++) {
69 auto &comm = *
m2n->getPrimaryRankCommunication();
71 if (context.isNamed(
"A")) {
74 BOOST_TEST(context.isNamed(
"B"));
79 for (
int i = 0; i < 3; i++) {
80 bbmCompare.
emplace(i, bbCompare);
85 for (
Rank rank = 0; rank < 3; rank++) {
86 BOOST_TEST(bbm.
at(rank) == bbmCompare.
at(rank));
100 for (
Rank rank = 0; rank < 3; rank++) {
102 for (
int i = 0; i < dimension; i++) {
111 if (context.isPrimary()) {
118 for (
int i = 0; i < 3; i++) {
119 bbmCompare.
emplace(i, bbCompare);
122 BOOST_TEST((
int) bbmCompare.
size() == 3);
123 for (
Rank rank = 0; rank < 3; rank++) {
124 BOOST_TEST(bbm.
at(rank) == bbmCompare.
at(rank));
133 auto m2n = context.connectPrimaryRanks(
"A",
"B");
138 for (
Rank rank = 0; rank < 3; rank++) {
140 for (
int i = 0; i < 3; i++) {
148 auto &comm = *
m2n->getPrimaryRankCommunication();
150 if (context.isNamed(
"A")) {
152 }
else if (context.isNamed(
"B")) {
157 for (
Rank rank = 0; rank < 3; rank++) {
159 for (
int i = 0; i < 3; i++) {
163 fbmCompare[rank] = fbCompare;
169 for (
Rank rank = 0; rank < 3; rank++) {
171 BOOST_TEST(fbm.
at(rank) == fbmCompare.
at(rank));
184 for (
Rank rank = 0; rank < 3; rank++) {
186 for (
int i = 0; i < 3; i++) {
196 if (context.isPrimary()) {
203 for (
Rank rank = 0; rank < 3; rank++) {
204 for (
int i = 0; i < 3; i++) {
207 fbmCompare[rank] = fbCompare;
213 for (
Rank rank = 0; rank < 3; rank++) {
215 BOOST_TEST(fbm.
at(rank) == fbmCompare.
at(rank));
BOOST_AUTO_TEST_CASE(testIQNIMVJPPWithSubsteps)
BOOST_AUTO_TEST_SUITE(PreProcess)
BOOST_AUTO_TEST_SUITE_END()
#define PRECICE_TEST_SETUP(...)
Creates and attaches a TestSetup to a Boost test case.
An axis-aligned bounding box around a (partition of a) mesh.
std::map< int, BoundingBox > BoundingBoxMap
static com::PtrCommunication & getCommunication()
Intra-participant communication.
contains the data communication abstraction layer.
void receiveBoundingBoxMap(Communication &communication, int rankSender, mesh::Mesh::BoundingBoxMap &bbm)
void broadcastReceiveBoundingBoxMap(Communication &communication, mesh::Mesh::BoundingBoxMap &bbm)
void sendBoundingBox(Communication &communication, int rankReceiver, const mesh::BoundingBox &bb)
void sendConnectionMap(Communication &communication, int rankReceiver, const mesh::Mesh::ConnectionMap &cm)
void receiveConnectionMap(Communication &communication, int rankSender, mesh::Mesh::ConnectionMap &cm)
void broadcastSendConnectionMap(Communication &communication, const mesh::Mesh::ConnectionMap &cm)
void broadcastSendBoundingBoxMap(Communication &communication, const mesh::Mesh::BoundingBoxMap &bbm)
void sendBoundingBoxMap(Communication &communication, int rankReceiver, const mesh::Mesh::BoundingBoxMap &bbm)
void broadcastReceiveConnectionMap(Communication &communication, mesh::Mesh::ConnectionMap &cm)
void receiveBoundingBox(Communication &communication, int rankSender, mesh::BoundingBox &bb)
contains the logic of the parallel communication between participants.
@ Events
Require to initialize Event.
Main namespace of the precice library.