3fd1b74b26
- these help when building upper or lower connected topologies. The new findProc() method is a non-failing whichProcID alternative
157 lines
4.4 KiB
C++
157 lines
4.4 KiB
C++
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | www.openfoam.com
|
|
\\/ M anipulation |
|
|
-------------------------------------------------------------------------------
|
|
Copyright (C) 2023 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 <http://www.gnu.org/licenses/>.
|
|
|
|
Application
|
|
Test-globalIndex2
|
|
|
|
Description
|
|
More functional tests for the globalIndex class.
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "globalIndex.H"
|
|
#include "argList.H"
|
|
#include "Time.H"
|
|
#include "IOstreams.H"
|
|
#include "Random.H"
|
|
#include "IndirectList.H"
|
|
#include "SliceList.H"
|
|
|
|
using namespace Foam;
|
|
|
|
|
|
void printTest1
|
|
(
|
|
const globalIndex& gi,
|
|
const label proci,
|
|
const label value
|
|
)
|
|
{
|
|
// With range check
|
|
Info<< " value:" << value << " on:" << gi.findProc(proci, value)
|
|
<< " below/above: ("
|
|
<< gi.findProcBelow(proci, value) << ' '
|
|
<< gi.findProcAbove(proci, value) << ')' << nl;
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
// Main program:
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
Random rnd(123456);
|
|
|
|
// #include "setRootCase.H"
|
|
// #include "createTime.H"
|
|
|
|
Info<< nl
|
|
<< "simple globalIndex tests" << nl << nl;
|
|
|
|
Info<< "Construct from indirect list(s)" << nl;
|
|
{
|
|
// Some sizes
|
|
labelList rawSizes(25);
|
|
forAll(rawSizes, i)
|
|
{
|
|
rawSizes[i] = rnd.position<label>(0, 100);
|
|
}
|
|
|
|
Info<< nl
|
|
<< "plain sizes: "
|
|
<< flatOutput(rawSizes) << nl
|
|
<< " offsets: "
|
|
<< flatOutput(globalIndex::calcOffsets(rawSizes))
|
|
<< nl;
|
|
|
|
|
|
sliceRange slice(0, 5, 5);
|
|
Info<< nl
|
|
<< "range min/max " << slice.min() << '/' << slice.max() << nl;
|
|
|
|
SliceList<label> sliceSizes(rawSizes, slice);
|
|
|
|
Info<< nl
|
|
<< "indirect addr: " << sliceSizes.addressing() << nl
|
|
<< "indirect sizes: "
|
|
<< flatOutput(sliceSizes) << nl
|
|
<< " offsets: "
|
|
<< flatOutput(globalIndex::calcOffsets(sliceSizes))
|
|
<< nl;
|
|
}
|
|
|
|
{
|
|
// From some offsets
|
|
globalIndex gi;
|
|
|
|
globalIndex gi0
|
|
(
|
|
labelList({ 0, 10, 20, 30, 40, 50, 60 })
|
|
);
|
|
|
|
Info<< "offsets: " << gi0.offsets() << nl;
|
|
|
|
// Alternative to copy assigment
|
|
gi.reset(gi0);
|
|
|
|
Info<< "globalIndex :"; gi.offsets().writeList(Info) << nl;
|
|
|
|
// Resizing is fine, but also check the binary search results!
|
|
gi.resize(10);
|
|
Info<< "globalIndex :"; gi.offsets().writeList(Info) << nl;
|
|
|
|
// NB: these routines are mostly failsafe on bad addresses
|
|
// for (const label proci : { 4, 8, -1 })
|
|
|
|
for (const label proci : { 4 })
|
|
{
|
|
Info<< "proc:" << proci
|
|
<< " : [" << gi.localStart(proci)
|
|
<< "," << gi.localEnd(proci) << ")" << nl;
|
|
|
|
for (label i = 0; i < 25; ++i)
|
|
{
|
|
const label value = rnd.position<label>(-8, 100);
|
|
|
|
printTest1(gi, proci, value);
|
|
}
|
|
|
|
Info<< "other on proc:" << proci << nl;
|
|
printTest1(gi, proci, gi.localStart(proci));
|
|
printTest1(gi, proci, gi.localEnd(proci));
|
|
|
|
Info<< "other on proc:0" << nl;
|
|
printTest1(gi, 0, gi.localStart(proci));
|
|
printTest1(gi, 0, gi.localEnd(proci));
|
|
}
|
|
}
|
|
|
|
Info<< "\nEnd\n" << endl;
|
|
return 0;
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|