Basilisk CFD
Adaptive Cartesian mesh PDE framework
Loading...
Searching...
No Matches
neighbors.h
Go to the documentation of this file.
1
/** @file neighbors.h
2
*/
3
#if dimension == 1
4
macro1
foreach_neighbor
(
int
_s
=
GHOSTS
,
5
Point
point
=
point
,
break
= (
_k
=
_nn
+ 1)) {
6
{
7
const
int
_nn
=
_s
;
8
const
int
_i
=
point
.
i
;
9
for
(
int
_k
= -
_nn
;
_k
<=
_nn
;
_k
++) {
10
point
.
i
=
_i
+
_k
;
11
POINT_VARIABLES
();
12
{...}
13
}
14
point
.
i
=
_i
;
15
}
16
}
17
#elif dimension == 2
18
macro1
foreach_neighbor
(
int
_s
=
GHOSTS
,
19
Point
point
=
point
,
break
= (
_k
=
_l
=
_nn
+ 1)) {
20
{
21
const
int
_nn
=
_s
;
22
const
int
_i
=
point
.
i
,
_j
=
point
.j;
23
for
(
int
_k
= -
_nn
;
_k
<=
_nn
;
_k
++) {
24
point
.
i
=
_i
+
_k
;
25
for
(
int
_l
= -
_nn
;
_l
<=
_nn
;
_l
++) {
26
point
.j =
_j
+
_l
;
27
POINT_VARIABLES
();
28
{...}
29
}
30
}
31
point
.
i
=
_i
;
point
.j =
_j
;
32
}
33
}
34
#else
// dimension == 3
35
macro1
foreach_neighbor
(
int
_s
=
GHOSTS
,
36
Point
point
=
point
,
break
= (
_l
=
_m
=
_n
=
_nn
+ 1)) {
37
{
38
const
int
_nn
=
_s
;
39
const
int
_i
=
point
.
i
,
_j
=
point
.j,
_k
=
point
.k;
40
for
(
int
_l
= -
_nn
;
_l
<=
_nn
;
_l
++) {
41
point
.
i
=
_i
+
_l
;
42
for
(
int
_m
= -
_nn
;
_m
<=
_nn
;
_m
++) {
43
point
.j =
_j
+
_m
;
44
for
(
int
_n
= -
_nn
;
_n
<=
_nn
;
_n
++) {
45
point
.k =
_k
+
_n
;
46
POINT_VARIABLES
();
47
{...}
48
}
49
}
50
}
51
point
.
i
=
_i
;
point
.j =
_j
;
point
.k =
_k
;
52
}
53
}
54
#endif
// dimension == 3
GHOSTS
#define GHOSTS
Definition
cartesian.h:13
x
int x
Definition
common.h:76
point
Point point
Definition
conserving.h:86
foreach_neighbor
macro1 foreach_neighbor(int _s=GHOSTS, Point point=point, break=(_k=_l=_nn+1))
Definition
neighbors.h:18
_i
def _i
Definition
stencils.h:405
_k
def _k
Definition
stencils.h:405
_j
def _j
Definition
stencils.h:405
Point
Definition
linear.h:21
Point::i
int i
Definition
linear.h:23
POINT_VARIABLES
define n n define n n macro POINT_VARIABLES(Point point=point)
Definition
tree.h:322
grid
neighbors.h
Generated by
1.9.8