#include "geom.h"
#include <algorithm>
#include <cassert>
#include <fstream>
#include <iostream>
#include <list>
#include <string>
#include <vector>
Go to the source code of this file.
|
void | GetBound (int const ib, int const nx, int const ny, double const w[], double s[]) |
|
void | AddBound (int const ib, int const nx, int const ny, double w[], double const s[]) |
|
◆ AddBound()
void AddBound |
( |
int |
ib, |
|
|
int |
nx, |
|
|
int |
ny, |
|
|
double |
w[], |
|
|
double const |
s[] |
|
) |
| |
Computes w
:= w
+ s
at the interface/boundary nodes on the boundary ib
. South (ib==1), East (ib==2), North (ib==3), West (ib==4)
- Parameters
-
[in] | ib | my local boundary |
[in] | nx | number of discretization intervals in x-direction |
[in] | ny | number of discretization intervals in y-direction |
[in,out] | w | vector for all nodes of local discretization |
[in] | s | short vector with values on boundary ib |
Definition at line 347 of file geom.cpp.
◆ GetBound()
void GetBound |
( |
int |
ib, |
|
|
int |
nx, |
|
|
int |
ny, |
|
|
double const |
w[], |
|
|
double |
s[] |
|
) |
| |
Copies the values of w
corresponding to boundary ib
onto vector s. South (ib==1), East (ib==2), North (ib==3), West (ib==4). The vector s
has to be long enough!!
- Parameters
-
[in] | ib | my local boundary |
[in] | nx | number of discretization intervals in x-direction |
[in] | ny | number of discretization intervals in y-direction |
[in] | w | vector for all nodes of local discretization |
[out] | s | short vector with values on boundary ib |
Definition at line 301 of file geom.cpp.