Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
S
ScalFMM
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
5
Issues
5
List
Boards
Labels
Service Desk
Milestones
Operations
Operations
Incidents
Packages & Registries
Packages & Registries
Container Registry
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
solverstack
ScalFMM
Commits
e9ba19e1
Commit
e9ba19e1
authored
Nov 23, 2015
by
BRAMAS Berenger
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
update P2P exclusion test
parent
0d8e7fb2
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
10 additions
and
10 deletions
+10
-10
UTests/utestP2PExclusion.cpp
UTests/utestP2PExclusion.cpp
+10
-10
No files found.
UTests/utestP2PExclusion.cpp
View file @
e9ba19e1
...
...
@@ -40,11 +40,11 @@ class TestExclusion : public FUTester<TestExclusion> {
for
(
int
idxY
=
0
;
idxY
<
Size
;
++
idxY
){
for
(
int
idxZ
=
0
;
idxZ
<
Size
;
++
idxZ
){
if
(
FP2PExclusion
<
Width
>::
GetShapeIdx
(
idxX
,
idxY
,
idxZ
)
==
idxShape
){
for
(
int
idxX_neig
=
FMath
::
Max
(
0
,
idxX
-
1
)
;
idxX_neig
<
FMath
::
Min
(
Size
,
idxX
+
1
)
;
++
idxX_neig
){
for
(
int
idxY_neig
=
FMath
::
Max
(
0
,
idxY
-
1
)
;
idxY_neig
<
FMath
::
Min
(
Size
,
idxY
+
1
)
;
++
idxY_neig
){
for
(
int
idxZ_neig
=
FMath
::
Max
(
0
,
idxZ
-
1
)
;
idxZ_neig
<
FMath
::
Min
(
Size
,
idxZ
+
1
)
;
++
idxZ_neig
){
for
(
int
idxX_neig
=
FMath
::
Max
(
0
,
idxX
-
1
)
;
idxX_neig
<
FMath
::
Min
(
Size
,
idxX
+
2
)
;
++
idxX_neig
){
for
(
int
idxY_neig
=
FMath
::
Max
(
0
,
idxY
-
1
)
;
idxY_neig
<
FMath
::
Min
(
Size
,
idxY
+
2
)
;
++
idxY_neig
){
for
(
int
idxZ_neig
=
FMath
::
Max
(
0
,
idxZ
-
1
)
;
idxZ_neig
<
FMath
::
Min
(
Size
,
idxZ
+
2
)
;
++
idxZ_neig
){
uassert
(
grid
[(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
==
0
);
grid
[
grid
[(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
]
=
1
;
grid
[
(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
=
1
;
}
}
}
...
...
@@ -69,7 +69,7 @@ class TestExclusion : public FUTester<TestExclusion> {
for
(
int
idxY_neig
=
FMath
::
Max
(
0
,
idxY
-
1
)
;
idxY_neig
<
idxY
;
++
idxY_neig
){
for
(
int
idxZ_neig
=
FMath
::
Max
(
0
,
idxZ
-
1
)
;
idxZ_neig
<
idxZ
;
++
idxZ_neig
){
uassert
(
grid
[(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
==
0
);
grid
[
grid
[(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
]
=
1
;
grid
[
(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
=
1
;
}
}
}
...
...
@@ -89,16 +89,16 @@ class TestExclusion : public FUTester<TestExclusion> {
for
(
int
idxY
=
0
;
idxY
<
Size
;
++
idxY
){
for
(
int
idxZ
=
0
;
idxZ
<
Size
;
++
idxZ
){
if
(
FP2PMiddleExclusion
::
GetShapeIdx
(
idxX
,
idxY
,
idxZ
)
==
idxShape
){
for
(
int
idxX_neig
=
FMath
::
Max
(
0
,
idxX
-
1
)
;
idxX_neig
<
FMath
::
Min
(
Size
,
idxX
+
1
)
;
++
idxX_neig
){
for
(
int
idxY_neig
=
FMath
::
Max
(
0
,
idxY
-
1
)
;
idxY_neig
<
FMath
::
Min
(
Size
,
idxY
+
1
)
;
++
idxY_neig
){
for
(
int
idxZ_neig
=
FMath
::
Max
(
0
,
idxZ
-
1
)
;
idxZ_neig
<
FMath
::
Min
(
Size
,
idxZ
+
1
)
;
++
idxZ_neig
){
for
(
int
idxX_neig
=
FMath
::
Max
(
0
,
idxX
-
1
)
;
idxX_neig
<
FMath
::
Min
(
Size
,
idxX
+
2
)
;
++
idxX_neig
){
for
(
int
idxY_neig
=
FMath
::
Max
(
0
,
idxY
-
1
)
;
idxY_neig
<
FMath
::
Min
(
Size
,
idxY
+
2
)
;
++
idxY_neig
){
for
(
int
idxZ_neig
=
FMath
::
Max
(
0
,
idxZ
-
1
)
;
idxZ_neig
<
FMath
::
Min
(
Size
,
idxZ
+
2
)
;
++
idxZ_neig
){
const
int
diffx
=
idxX_neig
-
idxX
;
const
int
diffy
=
idxY_neig
-
idxY
;
const
int
diffz
=
idxZ_neig
-
idxZ
;
const
int
idx
=
(
diffx
+
1
)
*
9
+
(
diffy
+
1
)
*
3
+
(
diffz
+
1
);
if
(
idx
<
14
){
if
(
idx
<
=
14
){
uassert
(
grid
[(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
==
0
);
grid
[
grid
[(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
]
=
1
;
grid
[
(
idxX_neig
*
Size
+
idxY_neig
)
*
Size
+
idxZ_neig
]
=
1
;
}
}
}
...
...
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