/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | www.openfoam.com
\\/ M anipulation |
-------------------------------------------------------------------------------
Copyright (C) 2021-2022 OpenCFD Ltd.
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see .
\*---------------------------------------------------------------------------*/
template
void Foam::binModels::singleDirectionUniformBin::writeFileHeader
(
OFstream& os
) const
{
writeHeaderValue(os, "bins", nBin_);
writeHeaderValue(os, "start", binLimits_.min());
writeHeaderValue(os, "end", binLimits_.max());
writeHeaderValue(os, "delta", binWidth_);
writeHeaderValue(os, "direction", binDir_);
// Compute and print bin end points in the binning direction
vectorField binPoints(nBin_);
writeCommented(os, "x co-ords :");
forAll(binPoints, pointi)
{
binPoints[pointi] = (binLimits_.min() + (pointi + 1)*binWidth_)*binDir_;
os << tab << binPoints[pointi].x();
}
os << nl;
writeCommented(os, "y co-ords :");
forAll(binPoints, pointi)
{
os << tab << binPoints[pointi].y();
}
os << nl;
writeCommented(os, "z co-ords :");
forAll(binPoints, pointi)
{
os << tab << binPoints[pointi].z();
}
os << nl;
writeHeader(os, "");
writeCommented(os, "Time");
for (label i = 0; i < nBin_; ++i)
{
const word ibin("_" + Foam::name(i));
writeTabbed(os, writeComponents("total" + ibin));
writeTabbed(os, writeComponents("internal" + ibin));
if (decomposePatchValues_)
{
writeTabbed(os, writeComponents("normal" + ibin));
writeTabbed(os, writeComponents("tangenial" + ibin));
}
else
{
writeTabbed(os, writeComponents("patch" + ibin));
}
}
os << endl;
}
template
bool Foam::binModels::singleDirectionUniformBin::processField
(
const label fieldi
)
{
const word& fieldName = fieldNames_[fieldi];
typedef GeometricField VolFieldType;
const VolFieldType* fieldPtr = mesh_.findObject(fieldName);
if (!fieldPtr)
{
return false;
}
if (writeToFile() && !writtenHeader_)
{
writeFileHeader(filePtrs_[fieldi]);
}
const VolFieldType& fld = *fieldPtr;
// Total number of fields
//
// 0: internal
// 1: patch total
//
// OR
//
// 0: internal
// 1: patch normal
// 2: patch tangential
label nField = 2;
if (decomposePatchValues_)
{
nField += 1;
}
List> data(nField);
for (auto& binList : data)
{
binList.resize(nBin_, Zero);
}
const auto whichBin = [&](const scalar d) -> label
{
if (d >= binLimits_.min() && d <= binLimits_.max())
{
// Find the bin division
label bini = floor
(
(d - binLimits_.min())/binWidth_
);
return min(max(bini, 0), nBin_ - 1);
}
else
{
return -1;
}
};
for (const label zonei : cellZoneIDs_)
{
const cellZone& cZone = mesh_.cellZones()[zonei];
for (const label celli : cZone)
{
const label bini = whichBin(mesh_.C()[celli] & binDir_);
if (bini >= 0)
{
data[0][bini] += fld[celli];
}
}
}
for (const label patchi : patchIDs_)
{
const polyPatch& pp = mesh_.boundaryMesh()[patchi];
const vectorField np(mesh_.boundary()[patchi].nf());
const auto& pts = pp.faceCentres();
const scalarField dd(pp.faceCentres() & binDir_);
forAll(pts, facei)
{
const label bini = whichBin(pts[facei] & binDir_);
if (bini >= 0)
{
const Type& v = fld.boundaryField()[patchi][facei];
if (!decomposePatchValues(data, bini, v, np[facei]))
{
data[1][bini] += v;
}
}
}
}
for (auto& binList : data)
{
reduce(binList, sumOp>());
}
if (writeToFile())
{
writeBinnedData(data, filePtrs_[fieldi]);
}
return true;
}
// ************************************************************************* //