mirror of
https://develop.openfoam.com/Development/openfoam.git
synced 2025-11-28 03:28:01 +00:00
- previously had special resizing treatment for the corner case when the addressable size and the new capacity are identical. However, that particular approach (to minimize copying) meant that the exact deallocation size would likely be incorrect. Having the correct deallocation size becomes more important with alternative allocators. Introduce resize_copy() protected function to limit the number of elements copied during the resize. ENH: provide DynamicList/DynamicField constructor with sizing - allows fine-grained creation of a DynamicList/DynamicField with a given size/capacity without an initial value. COMP: typo in code for DynamicList::push_back() with IndirectList
196 lines
4.8 KiB
C++
196 lines
4.8 KiB
C++
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | www.openfoam.com
|
|
\\/ M anipulation |
|
|
-------------------------------------------------------------------------------
|
|
Copyright (C) 2021-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/>.
|
|
|
|
Description
|
|
Test allocation patterns when reading into an existing list.
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "DynamicList.H"
|
|
#include "DynamicField.H"
|
|
#include "IOstreams.H"
|
|
#include "ITstream.H"
|
|
#include "OTstream.H"
|
|
#include "FlatOutput.H"
|
|
#include "ListOps.H"
|
|
#include "labelRange.H"
|
|
#include "labelIndList.H"
|
|
|
|
using namespace Foam;
|
|
|
|
template<class T, int SizeMin>
|
|
void printInfo
|
|
(
|
|
const word& tag,
|
|
const DynamicList<T, SizeMin>& list,
|
|
const bool showSize = true
|
|
)
|
|
{
|
|
Info<< '<' << tag;
|
|
if (showSize)
|
|
{
|
|
Info<< " size=\"" << list.size()
|
|
<< "\" capacity=\"" << list.capacity() << "\""
|
|
<< "\" min=\"" << SizeMin << "\"" ;
|
|
if (list.cdata())
|
|
{
|
|
Info<< " ptr=\"" << name(list.cdata()) << "\"";
|
|
}
|
|
else
|
|
{
|
|
Info<< " ptr=\"nullptr\"";
|
|
}
|
|
}
|
|
Info<< '>' << nl << flatOutput(list) << nl
|
|
<< "</" << tag << ">\n" << endl;
|
|
}
|
|
|
|
|
|
template<class T, int SizeMin>
|
|
void printInfo
|
|
(
|
|
const word& tag,
|
|
const DynamicField<T, SizeMin>& list,
|
|
const bool showSize = true
|
|
)
|
|
{
|
|
Info<< '<' << tag;
|
|
if (showSize)
|
|
{
|
|
Info<< " size=\"" << list.size()
|
|
<< "\" capacity=\"" << list.capacity() << "\""
|
|
<< "\" min=\"" << SizeMin << "\"" ;
|
|
if (list.cdata())
|
|
{
|
|
Info<< " ptr=\"" << name(list.cdata()) << "\"";
|
|
}
|
|
else
|
|
{
|
|
Info<< " ptr=\"nullptr\"";
|
|
}
|
|
}
|
|
Info<< '>' << nl << flatOutput(list) << nl
|
|
<< "</" << tag << ">\n" << endl;
|
|
}
|
|
|
|
|
|
template<class T, int SizeMin>
|
|
void readList
|
|
(
|
|
DynamicList<T, SizeMin>& output,
|
|
const UList<T>& input
|
|
)
|
|
{
|
|
OTstream os;
|
|
os << input;
|
|
ITstream is(os.tokens());
|
|
|
|
is >> output;
|
|
}
|
|
|
|
template<class T, int SizeMin>
|
|
void readList
|
|
(
|
|
DynamicField<T, SizeMin>& output,
|
|
const UList<T>& input
|
|
)
|
|
{
|
|
OTstream os;
|
|
os << input;
|
|
ITstream is(os.tokens());
|
|
|
|
is >> output;
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
// Main program:
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
//
|
|
{
|
|
DynamicList<label, 64> list1;
|
|
|
|
list1.resize(4);
|
|
Foam::identity(list1);
|
|
|
|
list1.resize(3);
|
|
printInfo("", list1);
|
|
|
|
// list1.clear();
|
|
// printInfo("", list1);
|
|
|
|
list1.setCapacity(3);
|
|
printInfo("", list1);
|
|
|
|
std::fill_n(std::back_inserter(list1), 10, 5);
|
|
Info<< "back_inserter to fill some values" << nl;
|
|
printInfo("", list1);
|
|
|
|
// Not very efficient, but just test for capability
|
|
DynamicList<label, 64> list2;
|
|
|
|
list2.resize(5);
|
|
Foam::identity(list2);
|
|
|
|
Info<< "initial list" << nl;
|
|
printInfo("", list2);
|
|
|
|
labelRange range(10, 5);
|
|
std::copy(range.begin(), range.end(), std::back_inserter(list2));
|
|
Info<< "back_inserter to append some values" << nl;
|
|
printInfo("", list2);
|
|
|
|
range.reset(0, 4);
|
|
std::copy_n(range.begin(), range.size(), std::back_inserter(list2));
|
|
Info<< "back_inserter to append more values" << nl;
|
|
printInfo("", list2);
|
|
}
|
|
|
|
{
|
|
DynamicList<float, 32> list1(std::pair<label,label>(16,0));
|
|
list1 = -1;
|
|
|
|
Info<< "construct with specified size/capacity" << nl;
|
|
printInfo("", list1);
|
|
}
|
|
|
|
{
|
|
DynamicList<float, 32> list1(std::pair<label,label>(8,16));
|
|
list1 = -1;
|
|
|
|
Info<< "construct with specified size/capacity" << nl;
|
|
printInfo("", list1);
|
|
}
|
|
|
|
Info<< "\nEnd\n";
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|