TIMPI
Loading...
Searching...
No Matches
Functions | Variables
set_unit.C File Reference

Go to the source code of this file.

Functions

void my_inserter (std::set< int > &s, int i)
 
void my_inserter (std::multiset< int > &s, int i)
 
void my_inserter (std::unordered_multiset< int > &s, int i)
 
void my_inserter (std::set< std::vector< int > > &s, int i)
 
void my_inserter (std::unordered_set< int > &s, int i)
 
void my_inserter (std::map< int, int > &m, int i)
 
void my_inserter (std::multimap< int, int > &m, int i)
 
void my_inserter (std::unordered_multimap< int, int > &m, int i)
 
void my_inserter (std::map< int, std::vector< int > > &m, int i)
 
void my_inserter (std::unordered_map< int, int > &m, int i)
 
void my_inserter (std::unordered_map< int, std::vector< int > > &m, int i)
 
void tester (const std::set< int > &s, int i)
 
void tester (const std::multiset< int > &s, int i)
 
void tester (const std::unordered_multiset< int > &s, int i)
 
void tester (const std::set< std::vector< int > > &s, int i)
 
void tester (const std::unordered_set< int > &s, int i)
 
void tester (const std::map< int, int > &m, int i)
 
void tester (const std::multimap< int, int > &m, int i)
 
void tester (const std::unordered_multimap< int, int > &m, int i)
 
void tester (const std::map< int, std::vector< int > > &m, int i)
 
void tester (const std::unordered_map< int, int > &m, int i)
 
void tester (const std::unordered_map< int, std::vector< int > > &m, int i)
 
template<class Set >
void testBigUnion (int n_multi=1)
 
template<class Set >
void testUnion ()
 
void testMapSet ()
 
void testMapMap ()
 
int main (int argc, const char *const *argv)
 

Variables

Communicator * TestCommWorld
 

Function Documentation

◆ main()

int main ( int  argc,
const char *const *  argv 
)

Definition at line 269 of file set_unit.C.

270{
271 TIMPI::TIMPIInit init(argc, argv);
272 TestCommWorld = &init.comm();
273
274 testBigUnion<std::set<int>>();
275 testBigUnion<std::multiset<int>>(3);
276 testBigUnion<std::unordered_multiset<int>>(3);
277 testBigUnion<std::unordered_set<int>>();
278 testBigUnion<std::map<int, int>>();
279 testBigUnion<std::multimap<int, int>>(3);
280 testBigUnion<std::unordered_multimap<int, int>>(3);
281 testBigUnion<std::unordered_map<int, int>>();
282
283 testUnion<std::set<int>>();
284 testUnion<std::unordered_set<int>>();
285 testUnion<std::map<int, int>>();
286 testUnion<std::unordered_map<int, int>>();
287
288 // TODO: allgather(vector<vector>)
289 // testUnion<std::set<std::vector<int>>>();
290
291 // No std::hash<vector<non-bool>>
292 // testUnion<std::unordered_set<std::vector<int>>>();
293
294 testUnion<std::map<int, std::vector<int>>>();
295 testUnion<std::unordered_map<int, std::vector<int>>>();
296
297 testMapSet();
298 testMapMap();
299
300 return 0;
301}
TIMPI::TIMPIInit
The TIMPIInit class, when constructed, initializes any dependent libraries (e.g.
Definition timpi_init.h:58
TIMPI::cast_int
Tnew cast_int(Told oldvar)
Definition timpi_assert.h:297
TestCommWorld
Communicator * TestCommWorld
Definition set_unit.C:15
testMapSet
void testMapSet()
Definition set_unit.C:196
testMapMap
void testMapMap()
Definition set_unit.C:236

References TIMPI::cast_int(), TestCommWorld, testMapMap(), and testMapSet().

◆ my_inserter() [1/11]

void my_inserter ( std::map< int, int > &  m,
int  i 
)

Definition at line 40 of file set_unit.C.

41{ m.insert(std::make_pair(i,2*i+3)); }

References TIMPI::cast_int().

◆ my_inserter() [2/11]

void my_inserter ( std::map< int, std::vector< int > > &  m,
int  i 
)

Definition at line 57 of file set_unit.C.

58{ m.insert(std::make_pair(i,std::vector<int>(i,2*i+3))); }

References TIMPI::cast_int().

◆ my_inserter() [3/11]

void my_inserter ( std::multimap< int, int > &  m,
int  i 
)

Definition at line 43 of file set_unit.C.

44{
45 m.insert(std::make_pair(-1,-1));
46 m.insert(std::make_pair(i,3*i+1));
47 m.insert(std::make_pair(i,3*i+2));
48}

References TIMPI::cast_int().

◆ my_inserter() [4/11]

void my_inserter ( std::multiset< int > &  s,
int  i 
)

Definition at line 20 of file set_unit.C.

21{
22 s.insert(-1);
23 s.insert(3*i+1);
24 s.insert(3*i+2);
25}

References TIMPI::cast_int().

◆ my_inserter() [5/11]

void my_inserter ( std::set< int > &  s,
int  i 
)

Definition at line 17 of file set_unit.C.

18{ s.insert(i); }

References TIMPI::cast_int().

Referenced by testBigUnion(), and testUnion().

◆ my_inserter() [6/11]

void my_inserter ( std::set< std::vector< int > > &  s,
int  i 
)

Definition at line 34 of file set_unit.C.

35{ s.insert(std::vector<int>(i,i)); }

References TIMPI::cast_int().

◆ my_inserter() [7/11]

void my_inserter ( std::unordered_map< int, int > &  m,
int  i 
)

Definition at line 60 of file set_unit.C.

61{ m.insert(std::make_pair(i,2*i+3)); }

References TIMPI::cast_int().

◆ my_inserter() [8/11]

void my_inserter ( std::unordered_map< int, std::vector< int > > &  m,
int  i 
)

Definition at line 63 of file set_unit.C.

64{ m.insert(std::make_pair(i,std::vector<int>(i,2*i+3))); }

References TIMPI::cast_int().

◆ my_inserter() [9/11]

void my_inserter ( std::unordered_multimap< int, int > &  m,
int  i 
)

Definition at line 50 of file set_unit.C.

51{
52 m.insert(std::make_pair(-1,-1));
53 m.insert(std::make_pair(i,3*i+1));
54 m.insert(std::make_pair(i,3*i+2));
55}

References TIMPI::cast_int().

◆ my_inserter() [10/11]

void my_inserter ( std::unordered_multiset< int > &  s,
int  i 
)

Definition at line 27 of file set_unit.C.

28{
29 s.insert(-1);
30 s.insert(3*i+1);
31 s.insert(3*i+2);
32}

References TIMPI::cast_int().

◆ my_inserter() [11/11]

void my_inserter ( std::unordered_set< int > &  s,
int  i 
)

Definition at line 37 of file set_unit.C.

38{ s.insert(i); }

References TIMPI::cast_int().

◆ testBigUnion()

template<class Set >
void testBigUnion ( int  n_multi = 1)

Definition at line 152 of file set_unit.C.

153 {
154 Set data;
155
156 const int N = TestCommWorld->size();
157
158 my_inserter(data, 150*N + TestCommWorld->rank());
159
160 TestCommWorld->set_union(data);
161
162 // The real assertions here are the internal ones in that
163 // set_union
164 TIMPI_UNIT_ASSERT( data.size() == n_multi * std::size_t(N) );
165 for (int p=0; p<N; ++p)
166 {
167 tester(data, 150*N + p);
168 }
169 }
TIMPI::Communicator::size
processor_id_type size() const
Definition communicator.h:211
TIMPI::Communicator::rank
processor_id_type rank() const
Definition communicator.h:208
TIMPI::Communicator::set_union
void set_union(T &data, const unsigned int root_id) const
Take a container (set, map, unordered_set, multimap, etc) of local variables on each processor,...
tester
void tester(const std::set< int > &s, int i)
Definition set_unit.C:67
my_inserter
void my_inserter(std::set< int > &s, int i)
Definition set_unit.C:17

References TIMPI::cast_int(), my_inserter(), TIMPI::Communicator::rank(), TIMPI::Communicator::set_union(), TIMPI::Communicator::size(), TestCommWorld, and tester().

◆ tester() [1/11]

void tester ( const std::map< int, int > &  m,
int  i 
)

Definition at line 90 of file set_unit.C.

91{
92 TIMPI_UNIT_ASSERT( m.count(i) == std::size_t(1) );
93 TIMPI_UNIT_ASSERT( m.at(i) == 2*i+3 );
94}

References TIMPI::cast_int().

◆ tester() [2/11]

void tester ( const std::map< int, std::vector< int > > &  m,
int  i 
)

Definition at line 128 of file set_unit.C.

129{
130 TIMPI_UNIT_ASSERT( m.count(i) == std::size_t(1) );
131 TIMPI_UNIT_ASSERT( m.at(i).size() == std::size_t(i) );
132 for (auto val : m.at(i))
133 TIMPI_UNIT_ASSERT( val == 2*i+3 );
134}

References TIMPI::cast_int().

◆ tester() [3/11]

void tester ( const std::multimap< int, int > &  m,
int  i 
)

Definition at line 96 of file set_unit.C.

97{
98 TIMPI_UNIT_ASSERT( m.count(-1) * 3 == m.size() );
99
100 std::bitset<2> found;
101 auto pr = m.equal_range(i);
102 for (auto it = pr.first; it != pr.second; ++it)
103 {
104 auto val = it->second;
105 TIMPI_UNIT_ASSERT( val > 3*i && val < 3*i+3 );
106 TIMPI_UNIT_ASSERT( !found[val-3*i-1] );
107 found[val-3*i-1] = true;
108 }
109 TIMPI_UNIT_ASSERT( found.count() == 2 );
110}

References TIMPI::cast_int().

◆ tester() [4/11]

void tester ( const std::multiset< int > &  s,
int  i 
)

Definition at line 70 of file set_unit.C.

71{
72 TIMPI_UNIT_ASSERT( s.count(-1) * 3 == s.size() );
73 TIMPI_UNIT_ASSERT( s.count(3*i+1) == std::size_t(1) );
74 TIMPI_UNIT_ASSERT( s.count(3*i+2) == std::size_t(1) );
75}

References TIMPI::cast_int().

◆ tester() [5/11]

void tester ( const std::set< int > &  s,
int  i 
)

Definition at line 67 of file set_unit.C.

68{ TIMPI_UNIT_ASSERT( s.count(i) == std::size_t(1) ); }

References TIMPI::cast_int().

Referenced by testBigUnion(), and testUnion().

◆ tester() [6/11]

void tester ( const std::set< std::vector< int > > &  s,
int  i 
)

Definition at line 84 of file set_unit.C.

85{ TIMPI_UNIT_ASSERT( s.count(std::vector<int>(i,i)) == std::size_t(1) ); }

References TIMPI::cast_int().

◆ tester() [7/11]

void tester ( const std::unordered_map< int, int > &  m,
int  i 
)

Definition at line 136 of file set_unit.C.

137{
138 TIMPI_UNIT_ASSERT( m.count(i) == std::size_t(1) );
139 TIMPI_UNIT_ASSERT( m.at(i) == 2*i+3 );
140}

References TIMPI::cast_int().

◆ tester() [8/11]

void tester ( const std::unordered_map< int, std::vector< int > > &  m,
int  i 
)

Definition at line 142 of file set_unit.C.

143{
144 TIMPI_UNIT_ASSERT( m.count(i) == std::size_t(1) );
145 TIMPI_UNIT_ASSERT( m.at(i).size() == std::size_t(i) );
146 for (auto val : m.at(i))
147 TIMPI_UNIT_ASSERT( val == 2*i+3 );
148}

References TIMPI::cast_int().

◆ tester() [9/11]

void tester ( const std::unordered_multimap< int, int > &  m,
int  i 
)

Definition at line 112 of file set_unit.C.

113{
114 TIMPI_UNIT_ASSERT( m.count(-1) * 3 == m.size() );
115
116 std::bitset<2> found;
117 const auto pr = m.equal_range(i);
118 for (auto it = pr.first; it != pr.second; ++it)
119 {
120 auto val = it->second;
121 TIMPI_UNIT_ASSERT( val > 3*i && val < 3*i+3 );
122 TIMPI_UNIT_ASSERT( !found[val-3*i-1] );
123 found[val-3*i-1] = true;
124 }
125 TIMPI_UNIT_ASSERT( found.count() == 2 );
126}

References TIMPI::cast_int().

◆ tester() [10/11]

void tester ( const std::unordered_multiset< int > &  s,
int  i 
)

Definition at line 77 of file set_unit.C.

78{
79 TIMPI_UNIT_ASSERT( s.count(-1) * 3 == s.size() );
80 TIMPI_UNIT_ASSERT( s.count(3*i+1) == std::size_t(1) );
81 TIMPI_UNIT_ASSERT( s.count(3*i+2) == std::size_t(1) );
82}

References TIMPI::cast_int().

◆ tester() [11/11]

void tester ( const std::unordered_set< int > &  s,
int  i 
)

Definition at line 87 of file set_unit.C.

88{ TIMPI_UNIT_ASSERT( s.count(i) == std::size_t(1) ); }

References TIMPI::cast_int().

◆ testMapMap()

void testMapMap ( )

Definition at line 236 of file set_unit.C.

237 {
238 std::map<unsigned int, std::map<unsigned short, double>> mapmap;
239
240 // Values on all procs
241 mapmap[0].emplace(20201, 0.8);
242
243 // Insert extra values on procs 0 and 2
244 switch (TestCommWorld->rank())
245 {
246 case 0:
247 case 2:
248 mapmap[0].emplace(60201, 1.);
249 break;
250 default:
251 break;
252 }
253
254 TestCommWorld->set_union(mapmap);
255
256 TIMPI_UNIT_ASSERT( mapmap.size() == 1 );
257 const std::map<unsigned short, double> goodmap {{20201, 0.8},
258 {60201, 1}};
259 for (const auto & pr : mapmap)
260 {
261 const auto & key = pr.first;
262 const auto & boundary_id_map = pr.second;
263 TIMPI_UNIT_ASSERT( key == 0 );
264 TIMPI_UNIT_ASSERT( boundary_id_map == goodmap );
265 }
266 }

References TIMPI::cast_int(), TIMPI::Communicator::rank(), TIMPI::Communicator::set_union(), and TestCommWorld.

Referenced by main().

◆ testMapSet()

void testMapSet ( )

Definition at line 196 of file set_unit.C.

197 {
198 std::map<unsigned int, std::set<unsigned short>> mapset;
199
200 // Values on all procs
201 mapset[0].insert(20201);
202
203 // Insert extra values on procs 0 and 2
204 switch (TestCommWorld->rank())
205 {
206 case 0:
207 case 2:
208 mapset[0].insert(60201);
209 break;
210 default:
211 break;
212 }
213
214 TestCommWorld->set_union(mapset);
215
216 // Check results on all procs. In a broken 4-processor run what we
217 // saw was:
218 // key = 0, surface_ids = 20201 60201
219 // key = 0, surface_ids = 20201
220 // key = 0, surface_ids = 20201 60201
221 // key = 0, surface_ids = 20201
222 // whereas what we expect to see is that all procs have the
223 // same surface_ids, the ones from pid 0.
224 TIMPI_UNIT_ASSERT( mapset.size() == 1 );
225 const std::set<unsigned short> goodset {20201, 60201};
226 for (const auto & pr : mapset)
227 {
228 const auto & key = pr.first;
229 const auto & boundary_id_set = pr.second;
230 TIMPI_UNIT_ASSERT( key == 0 );
231 TIMPI_UNIT_ASSERT( boundary_id_set == goodset );
232 }
233 }

References TIMPI::cast_int(), TIMPI::Communicator::rank(), TIMPI::Communicator::set_union(), and TestCommWorld.

Referenced by main().

◆ testUnion()

template<class Set >
void testUnion ( )

Definition at line 174 of file set_unit.C.

175 {
176 Set data;
177
178 const int N = TestCommWorld->size();
179
180 my_inserter(data, TestCommWorld->rank());
181 my_inserter(data, 2*N);
182 my_inserter(data, 3*N + TestCommWorld->rank());
183
184 TestCommWorld->set_union(data);
185
186 TIMPI_UNIT_ASSERT( data.size() == std::size_t(2*N+1) );
187 tester(data, 2*N);
188 for (int p=0; p<N; ++p)
189 {
190 tester(data, p);
191 tester(data, 3*N+p);
192 }
193 }

References TIMPI::cast_int(), my_inserter(), TIMPI::Communicator::rank(), TIMPI::Communicator::set_union(), TIMPI::Communicator::size(), TestCommWorld, and tester().

Variable Documentation

◆ TestCommWorld

Communicator* TestCommWorld

Definition at line 15 of file set_unit.C.

Referenced by main(), testBigUnion(), testMapMap(), testMapSet(), and testUnion().

Generated on Fri Sep 11 2026 20:26:17 for TIMPI by doxygen 1.9.8