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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/*
* This file is a part of TiledArray.
* Copyright (C) 2013 Virginia Tech
*
* 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 should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Justus Calvin
* Department of Chemistry, Virginia Tech
*
* dist_op_group.cpp
* Oct 21, 2013
*
*/
#include "TiledArray/external/madness.h"
#include "unit_test_config.h"
using madness::DistributedID;
using madness::Group;
struct GroupFixture {
GroupFixture() : did(madness::uniqueidT(), 0ul), group_list() {
for (ProcessID p = GlobalFixture::world->rank() % 2;
p < GlobalFixture::world->size(); p += 2)
group_list.push_back(p);
}
~GroupFixture() {}
DistributedID did;
std::vector<ProcessID> group_list;
}; // GroupFixture
BOOST_FIXTURE_TEST_SUITE(dist_op_group_suite, GroupFixture)
BOOST_AUTO_TEST_CASE(constructor_empty) {
// Check default constructor
BOOST_CHECK_NO_THROW(Group());
Group empty_group;
// Check that the group is empty.
BOOST_CHECK(empty_group.empty());
BOOST_CHECK_EQUAL(empty_group.size(), 0);
#if defined(TA_EXCEPTION_ERROR) && defined(MADNESS_ASSERTIONS_THROW)
// Check that accessing group data throws exceptions for an empty group.
BOOST_CHECK_THROW(empty_group.id(), madness::MadnessException);
BOOST_CHECK_THROW(empty_group.get_world(), madness::MadnessException);
BOOST_CHECK_THROW(empty_group.rank(), madness::MadnessException);
BOOST_CHECK_THROW(empty_group.rank(0), madness::MadnessException);
BOOST_CHECK_THROW(empty_group.world_rank(0), madness::MadnessException);
ProcessID parent, child1, child2;
BOOST_CHECK_THROW(empty_group.make_tree(0, parent, child1, child2),
madness::MadnessException);
#endif // TA_EXCEPTION_ERROR
}
BOOST_AUTO_TEST_CASE(constructor_new_group) {
// Check new group constructor
BOOST_CHECK_NO_THROW(Group(*GlobalFixture::world, group_list, did));
Group new_group(*GlobalFixture::world, group_list, did);
// Check that the group is not empty
BOOST_CHECK(!new_group.empty());
// Check that the rank and size of the group are correct
BOOST_CHECK_EQUAL(new_group.rank(), GlobalFixture::world->rank() / 2);
BOOST_CHECK_EQUAL(new_group.size(), group_list.size());
// Check that the group id and world are correct
BOOST_CHECK_EQUAL(new_group.id(), did);
BOOST_CHECK_EQUAL(&new_group.get_world(), GlobalFixture::world);
// Check that the group correctly maps parent world ranks to/from group ranks
for (std::size_t i = 0ul; i < group_list.size(); ++i) {
BOOST_CHECK_EQUAL(new_group.rank(group_list[i]), i);
BOOST_CHECK_EQUAL(new_group.world_rank(i), group_list[i]);
}
// Check that binary tree returns processes in the group list.
ProcessID parent, child1, child2;
BOOST_CHECK_NO_THROW(new_group.make_tree(0, parent, child1, child2));
BOOST_CHECK((parent == -1) || (std::find(group_list.begin(), group_list.end(),
parent) != group_list.end()));
BOOST_CHECK((child1 == -1) || (std::find(group_list.begin(), group_list.end(),
child1) != group_list.end()));
BOOST_CHECK((child2 == -1) || (std::find(group_list.begin(), group_list.end(),
child2) != group_list.end()));
}
BOOST_AUTO_TEST_CASE(copy_group) {
Group group(*GlobalFixture::world, group_list, did);
BOOST_CHECK_NO_THROW(Group copy_group(group));
// Check copy constructor
Group copy_group(group);
// Check that the group is not empty
BOOST_CHECK_EQUAL(copy_group.empty(), group.empty());
// Check that the rank and size of the group are correct
BOOST_CHECK_EQUAL(copy_group.rank(), group.rank());
BOOST_CHECK_EQUAL(copy_group.size(), group.size());
// Check that the group id and world are correct
BOOST_CHECK_EQUAL(copy_group.id(), group.id());
BOOST_CHECK_EQUAL(&group.get_world(), &group.get_world());
// Check that the group correctly maps parent world ranks to/from group ranks
for (std::size_t i = 0ul; i < group_list.size(); ++i) {
BOOST_CHECK_EQUAL(copy_group.rank(group_list[i]),
group.rank(group_list[i]));
BOOST_CHECK_EQUAL(copy_group.world_rank(i), group.world_rank(i));
}
// Check that binary tree returns processes in the group list.
ProcessID parent, child1, child2;
BOOST_CHECK_NO_THROW(copy_group.make_tree(0, parent, child1, child2));
BOOST_CHECK((parent == -1) || (std::find(group_list.begin(), group_list.end(),
parent) != group_list.end()));
BOOST_CHECK((child1 == -1) || (std::find(group_list.begin(), group_list.end(),
child1) != group_list.end()));
BOOST_CHECK((child2 == -1) || (std::find(group_list.begin(), group_list.end(),
child2) != group_list.end()));
}
BOOST_AUTO_TEST_SUITE_END()
|
