Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F79295122
test_grid_synchronizer_check_neighbors.cc
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Sun, Aug 25, 16:53
Size
3 KB
Mime Type
text/x-c
Expires
Tue, Aug 27, 16:53 (1 d, 21 h)
Engine
blob
Format
Raw Data
Handle
20025905
Attached To
rAKA akantu
test_grid_synchronizer_check_neighbors.cc
View Options
/**
* @file test_grid_synchronizer_check_neighbors.cc
*
* @author Nicolas Richart <nicolas.richart@epfl.ch>
*
* @date creation: Mon Mar 11 2013
* @date last modification: Fri Feb 27 2015
*
* @brief Test the generation of neighbors list based on a akaentu::Grid
*
* @section LICENSE
*
* Copyright (©) 2014, 2015 EPFL (Ecole Polytechnique Fédérale de Lausanne)
* Laboratory (LSMS - Laboratoire de Simulation en Mécanique des Solides)
*
* Akantu is free software: you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option) any
* later version.
*
* Akantu 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 Lesser General Public License for more
* details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Akantu. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include <fstream>
#include <iostream>
#include <string>
#include "aka_common.hh"
#include "static_communicator.hh"
using
namespace
akantu
;
const
UInt
spatial_dimension
=
3
;
#include "test_grid_tools.hh"
void
readNeighbors
(
std
::
ifstream
&
nin
,
neighbors_map_t
<
spatial_dimension
>::
type
&
neighbors_map_read
)
{
std
::
string
line
;
while
(
std
::
getline
(
nin
,
line
))
{
std
::
getline
(
nin
,
line
);
std
::
istringstream
iss
(
line
);
UInt
nb_neig
;
iss
>>
nb_neig
;
std
::
getline
(
nin
,
line
);
Point
<
spatial_dimension
>
pt
;
pt
.
read
(
line
);
std
::
getline
(
nin
,
line
);
for
(
UInt
i
=
0
;
i
<
nb_neig
;
++
i
)
{
std
::
getline
(
nin
,
line
);
Point
<
spatial_dimension
>
ne
;
ne
.
read
(
line
);
neighbors_map_read
[
pt
].
push_back
(
ne
);
}
}
}
int
main
(
int
argc
,
char
*
argv
[])
{
initialize
(
argc
,
argv
);
StaticCommunicator
&
comm
=
StaticCommunicator
::
getStaticCommunicator
();
// Int psize = comm.getNbProc();
Int
prank
=
comm
.
whoAmI
();
std
::
string
file_ref
=
"neighbors_ref"
;
std
::
string
file
=
file_ref
;
std
::
stringstream
sstr
;
sstr
<<
file
<<
"_"
<<
prank
;
file
=
sstr
.
str
();
std
::
ifstream
nin
;
neighbors_map_t
<
spatial_dimension
>::
type
neighbors_map_read
;
nin
.
open
(
file_ref
.
c_str
());
readNeighbors
(
nin
,
neighbors_map_read
);
nin
.
close
();
neighbors_map_t
<
spatial_dimension
>::
type
neighbors_map
;
nin
.
open
(
file
.
c_str
());
readNeighbors
(
nin
,
neighbors_map
);
nin
.
close
();
neighbors_map_t
<
spatial_dimension
>::
type
::
iterator
it_n
=
neighbors_map
.
begin
();
neighbors_map_t
<
spatial_dimension
>::
type
::
iterator
end_n
=
neighbors_map
.
end
();
for
(;
it_n
!=
end_n
;
++
it_n
)
{
std
::
sort
(
it_n
->
second
.
begin
(),
it_n
->
second
.
end
());
std
::
vector
<
Point
<
spatial_dimension
>
>::
iterator
it_v
=
it_n
->
second
.
begin
();
std
::
vector
<
Point
<
spatial_dimension
>
>::
iterator
end_v
=
it_n
->
second
.
end
();
neighbors_map_t
<
spatial_dimension
>::
type
::
iterator
it_nr
=
neighbors_map_read
.
find
(
it_n
->
first
);
if
(
it_nr
==
neighbors_map_read
.
end
())
AKANTU_DEBUG_ERROR
(
"Argh what is this point that is not present in the ref file "
<<
it_n
->
first
);
std
::
vector
<
Point
<
spatial_dimension
>
>::
iterator
it_vr
=
it_nr
->
second
.
begin
();
std
::
vector
<
Point
<
spatial_dimension
>
>::
iterator
end_vr
=
it_nr
->
second
.
end
();
for
(;
it_v
!=
end_v
&&
it_vr
!=
end_vr
;
++
it_v
,
++
it_vr
)
{
if
(
*
it_vr
!=
*
it_v
)
AKANTU_DEBUG_ERROR
(
"Neighbors does not match "
<<
*
it_v
<<
" != "
<<
*
it_vr
<<
" neighbor of "
<<
it_n
->
first
);
}
if
(
it_v
==
end_v
&&
it_vr
!=
end_vr
)
{
AKANTU_DEBUG_ERROR
(
"Some neighbors of "
<<
it_n
->
first
<<
" are missing!"
);
}
if
(
it_v
!=
end_v
&&
it_vr
==
end_vr
)
AKANTU_DEBUG_ERROR
(
"Some neighbors of "
<<
it_n
->
first
<<
" are in excess!"
);
}
akantu
::
finalize
();
return
EXIT_SUCCESS
;
}
Event Timeline
Log In to Comment