Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Sbalzarini Lab
S
Software
P
Parallel Computing
OpenFPM
openfpm_pdata
Commits
50670162
Commit
50670162
authored
Feb 14, 2018
by
incardon
Browse files
Adding missing file
parent
97dadefb
Changes
1
Hide whitespace changes
Inline
Side-by-side
src/Vector/tests/vector_dist_util_unit_tests.hpp
0 → 100644
View file @
50670162
/*
* vector_dist_util_unit_tests.hpp
*
* Created on: Feb 14, 2018
* Author: i-bird
*/
#ifndef SRC_VECTOR_TESTS_VECTOR_DIST_UTIL_UNIT_TESTS_HPP_
#define SRC_VECTOR_TESTS_VECTOR_DIST_UTIL_UNIT_TESTS_HPP_
/*! \brief Count local and non local
*
* \param vd distributed vector
* \param it iterator
* \param bc boundary conditions
* \param box domain box
* \param dom_ext domain + ghost box
* \param l_cnt local particles counter
* \param nl_cnt non local particles counter
* \param n_out out of domain + ghost particles counter
*
*/
template
<
unsigned
int
dim
,
typename
vector_dist
>
inline
void
count_local_n_local
(
vector_dist
&
vd
,
vector_dist_iterator
&
it
,
size_t
(
&
bc
)[
dim
]
,
Box
<
dim
,
float
>
&
box
,
Box
<
dim
,
float
>
&
dom_ext
,
size_t
&
l_cnt
,
size_t
&
nl_cnt
,
size_t
&
n_out
)
{
const
CartDecomposition
<
dim
,
float
>
&
ct
=
vd
.
getDecomposition
();
while
(
it
.
isNext
())
{
auto
key
=
it
.
get
();
// Check if it is in the domain
if
(
box
.
isInsideNP
(
vd
.
getPos
(
key
))
==
true
)
{
// Check if local
if
(
ct
.
isLocalBC
(
vd
.
getPos
(
key
),
bc
)
==
true
)
l_cnt
++
;
else
nl_cnt
++
;
}
else
{
nl_cnt
++
;
}
Point
<
dim
,
float
>
xp
=
vd
.
getPos
(
key
);
// Check that all particles are inside the Domain + Ghost part
if
(
dom_ext
.
isInside
(
xp
)
==
false
)
n_out
++
;
++
it
;
}
}
#endif
/* SRC_VECTOR_TESTS_VECTOR_DIST_UTIL_UNIT_TESTS_HPP_ */
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment