Corrected line lengths over 80 characters

This commit is contained in:
Will Bainbridge
2018-10-03 12:18:58 +01:00
parent 39ad49bc34
commit 6aa4fe45f8
5 changed files with 21 additions and 9 deletions

View File

@ -158,7 +158,8 @@ public:
(
const FromPatch& fromPatch,
const ToPatch& toPatch,
const intersection::algorithm alg = intersection::algorithm::fullRay,
const intersection::algorithm alg =
intersection::algorithm::fullRay,
const intersection::direction dir = intersection::direction::vector
);

View File

@ -627,7 +627,8 @@ Foam::label Foam::processorPolyPatch::matchFace
return -1;
}
CirculatorBase::direction circulateDirection = CirculatorBase::direction::clockwise;
CirculatorBase::direction circulateDirection =
CirculatorBase::direction::clockwise;
if (!sameOrientation)
{

View File

@ -190,15 +190,17 @@ public:
(
const point& p,
const vector& q,
const intersection::algorithm = intersection::algorithm::fullRay,
const intersection::direction dir = intersection::direction::vector
const intersection::algorithm =
intersection::algorithm::fullRay,
const intersection::direction dir =
intersection::direction::vector
) const;
//- Fast intersection with a ray.
// For a hit, the pointHit.distance() is the line parameter t :
// intersection=p+t*q. Only defined for algorithm::visible, algorithm::fullRay or
// algorithm::halfRay. tol increases the virtual size of the triangle
// by a relative factor.
// intersection=p+t*q. Only defined for algorithm::visible,
// algorithm::fullRay or algorithm::halfRay. tol increases the
// virtual size of the triangle by a relative factor.
inline pointHit intersection
(
const point& p,

View File

@ -325,7 +325,8 @@ public:
const word& slavePatchName,
const typeOfMatch tom,
const bool coupleDecouple = false,
const intersection::algorithm algo = intersection::algorithm::visible
const intersection::algorithm algo =
intersection::algorithm::visible
);
//- Construct from dictionary

View File

@ -644,7 +644,14 @@ bool Foam::treeDataPrimitivePatch<PatchType>::findIntersection
points[f[0]],
points[f[1]],
points[f[2]]
).intersection(start, dir, intersection::algorithm::halfRay, shape.planarTol_);
)
.intersection
(
start,
dir,
intersection::algorithm::halfRay,
shape.planarTol_
);
}
else
{