Clean-up and formatting

This commit is contained in:
Hrvoje Jasak 2015-09-18 12:04:47 +01:00
parent 9e29f21409
commit f6cbf149e7
6 changed files with 21 additions and 10 deletions

View file

@ -249,6 +249,7 @@ public:
List<volumeType>&
) const;
// Other
//- Set bounds of surface. Bounds currently set as list of
@ -271,7 +272,8 @@ public:
// indices) get the specified field. Misses do not get set.
virtual void getField
(
const List<pointIndexHit>&, labelList&
const List<pointIndexHit>&,
labelList&
) const;

View file

@ -25,7 +25,8 @@ Class
Foam::booleanSurface
Description
Surface-surface intersection. Given two surfaces construct combined surface.
Surface-surface intersection.
Given two surfaces construct a combined surface.
Called 'boolean' since the volume of resulting surface will encompass
the volumes of the original surface according to some boolean operation:

View file

@ -46,7 +46,7 @@ namespace Foam
// Forward declaration of classes
/*---------------------------------------------------------------------------*\
Class orientedSurface Declaration
Class orientedSurface Declaration
\*---------------------------------------------------------------------------*/
class orientedSurface
@ -148,8 +148,12 @@ public:
//- Flip faces such that normals are consistent with point:
// orientOutside=true : point outside surface
// orientOutside=false : point inside surface
static bool orient(triSurface&, const point&, const bool orientOutside);
static bool orient
(
triSurface&,
const point&,
const bool orientOutside
);
};

View file

@ -216,8 +216,8 @@ Foam::label Foam::treeDataTriSurface::getVolumeType
sample,
max
(
Foam::sqr(GREAT),
Foam::magSqr(treeBb.span())
sqr(GREAT),
magSqr(treeBb.span())
)
);

View file

@ -108,7 +108,8 @@ public:
// Search
//- Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
//- Get type (inside, outside, mixed, unknown) of point
// with respect to a surface.
// Only makes sense for closed surfaces.
label getVolumeType
(

View file

@ -174,8 +174,11 @@ tmp<pointField> triSurfaceSearch::calcNearest
}
pointIndexHit triSurfaceSearch::nearest(const point& pt, const vector& span)
const
pointIndexHit triSurfaceSearch::nearest
(
const point& pt,
const vector& span
) const
{
const scalar nearestDistSqr = 0.25*magSqr(span);