221 lines
5.5 KiB
C
221 lines
5.5 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright (C) 2016-2018 OpenCFD Ltd.
|
|
\\/ M anipulation |
|
|
-------------------------------------------------------------------------------
|
|
| Copyright (C) 2011-2013 OpenFOAM Foundation
|
|
-------------------------------------------------------------------------------
|
|
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 <http://www.gnu.org/licenses/>.
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "TimePaths.H"
|
|
#include "argList.H"
|
|
#include "fileOperation.H"
|
|
#include "IOstreams.H"
|
|
|
|
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
|
|
|
|
bool Foam::TimePaths::detectProcessorCase()
|
|
{
|
|
if (processorCase_)
|
|
{
|
|
return processorCase_;
|
|
}
|
|
|
|
// Look for "processor", but should really check for following digits too
|
|
const auto sep = globalCaseName_.rfind('/');
|
|
const auto pos = globalCaseName_.find
|
|
(
|
|
"processor",
|
|
(sep == string::npos ? 0 : sep)
|
|
);
|
|
|
|
if (pos == 0)
|
|
{
|
|
globalCaseName_ = ".";
|
|
processorCase_ = true;
|
|
}
|
|
else if (pos != string::npos && sep != string::npos && sep == pos-1)
|
|
{
|
|
globalCaseName_.resize(sep);
|
|
processorCase_ = true;
|
|
}
|
|
|
|
return processorCase_;
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
|
|
|
|
Foam::TimePaths::TimePaths
|
|
(
|
|
const argList& args,
|
|
const word& systemName,
|
|
const word& constantName
|
|
)
|
|
:
|
|
processorCase_(args.parRunControl().parRun()),
|
|
distributed_(args.parRunControl().distributed()),
|
|
rootPath_(args.rootPath()),
|
|
globalCaseName_(args.globalCaseName()),
|
|
case_(args.caseName()),
|
|
system_(systemName),
|
|
constant_(constantName)
|
|
{
|
|
// For convenience: find out from case name whether it is a
|
|
// processor directory and set processorCase flag so file searching
|
|
// goes up one level.
|
|
detectProcessorCase();
|
|
}
|
|
|
|
|
|
Foam::TimePaths::TimePaths
|
|
(
|
|
const fileName& rootPath,
|
|
const fileName& caseName,
|
|
const word& systemName,
|
|
const word& constantName
|
|
)
|
|
:
|
|
processorCase_(false),
|
|
distributed_(false),
|
|
rootPath_(rootPath),
|
|
globalCaseName_(caseName),
|
|
case_(caseName),
|
|
system_(systemName),
|
|
constant_(constantName)
|
|
{
|
|
// Find out from case name whether a processor directory
|
|
detectProcessorCase();
|
|
}
|
|
|
|
|
|
Foam::TimePaths::TimePaths
|
|
(
|
|
const bool processorCase,
|
|
const fileName& rootPath,
|
|
const bool distributed,
|
|
const fileName& globalCaseName,
|
|
const fileName& caseName,
|
|
const word& systemName,
|
|
const word& constantName
|
|
)
|
|
:
|
|
processorCase_(processorCase),
|
|
distributed_(distributed),
|
|
rootPath_(rootPath),
|
|
globalCaseName_(globalCaseName),
|
|
case_(caseName),
|
|
system_(systemName),
|
|
constant_(constantName)
|
|
{
|
|
// For convenience: find out from case name whether it is a
|
|
// processor directory and set processorCase flag so file searching
|
|
// goes up one level.
|
|
detectProcessorCase();
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
|
|
|
|
Foam::instantList Foam::TimePaths::findTimes
|
|
(
|
|
const fileName& directory,
|
|
const word& constantName
|
|
)
|
|
{
|
|
return fileHandler().findTimes(directory, constantName);
|
|
}
|
|
|
|
|
|
Foam::instantList Foam::TimePaths::times() const
|
|
{
|
|
return findTimes(path(), constant());
|
|
}
|
|
|
|
|
|
Foam::label Foam::TimePaths::findClosestTimeIndex
|
|
(
|
|
const instantList& timeDirs,
|
|
const scalar t,
|
|
const word& constantName
|
|
)
|
|
{
|
|
const label nTimes = timeDirs.size();
|
|
|
|
label nearestIndex = -1;
|
|
scalar deltaT = GREAT;
|
|
|
|
for (label timei=0; timei < nTimes; ++timei)
|
|
{
|
|
if (timeDirs[timei].name() == constantName) continue;
|
|
|
|
const scalar diff = mag(timeDirs[timei].value() - t);
|
|
if (diff < deltaT)
|
|
{
|
|
deltaT = diff;
|
|
nearestIndex = timei;
|
|
}
|
|
}
|
|
|
|
return nearestIndex;
|
|
}
|
|
|
|
|
|
Foam::instant Foam::TimePaths::findClosestTime(const scalar t) const
|
|
{
|
|
instantList timeDirs = findTimes(path(), constant());
|
|
|
|
const label nTimes = timeDirs.size();
|
|
|
|
// There is only one time (likely "constant") so return it
|
|
if (nTimes == 1)
|
|
{
|
|
return timeDirs.first();
|
|
}
|
|
|
|
if (t < timeDirs[1].value())
|
|
{
|
|
return timeDirs[1];
|
|
}
|
|
else if (t > timeDirs.last().value())
|
|
{
|
|
return timeDirs.last();
|
|
}
|
|
|
|
label nearestIndex = -1;
|
|
scalar deltaT = GREAT;
|
|
|
|
for (label timei=1; timei < nTimes; ++timei)
|
|
{
|
|
const scalar diff = mag(timeDirs[timei].value() - t);
|
|
if (diff < deltaT)
|
|
{
|
|
deltaT = diff;
|
|
nearestIndex = timei;
|
|
}
|
|
}
|
|
|
|
return timeDirs[nearestIndex];
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|