6933bc3021
- This makes the following safe:
auto iter = ptrTable.find(unknownKey);
ptrTable.erase(iter);
- Unmask HashPtrTable::erase(const Key& key) method
112 lines
2.8 KiB
C
112 lines
2.8 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright (C) 2011 OpenFOAM Foundation
|
|
\\/ M anipulation | Copyright (C) 2017 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
|
|
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include <iostream>
|
|
#include "HashPtrTable.H"
|
|
|
|
using namespace Foam;
|
|
|
|
template<class T>
|
|
void printTable(const HashPtrTable<T>& table)
|
|
{
|
|
Info<< table.size() << nl << "(" << nl;
|
|
|
|
forAllConstIters(table, iter)
|
|
{
|
|
const T* ptr = iter.object();
|
|
Info<< iter.key() << " = ";
|
|
if (ptr)
|
|
{
|
|
Info<< *ptr;
|
|
}
|
|
else
|
|
{
|
|
Info<< "nullptr";
|
|
}
|
|
Info<< nl;
|
|
}
|
|
|
|
Info<< ")" << endl;
|
|
|
|
// Values only, with for-range
|
|
Info<< "values (";
|
|
for (auto val : table)
|
|
{
|
|
Info<< ' ';
|
|
if (val)
|
|
{
|
|
Info<< *val;
|
|
}
|
|
else
|
|
{
|
|
Info<< "nullptr";
|
|
}
|
|
}
|
|
Info<< " )" << nl;
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
// Main program:
|
|
|
|
int main()
|
|
{
|
|
HashPtrTable<double> myTable;
|
|
myTable.insert("abc", new double(42.1));
|
|
myTable.insert("def", nullptr);
|
|
myTable.insert("pi", new double(3.14159));
|
|
myTable.insert("natlog", new double(2.718282));
|
|
myTable.insert("sqrt2", new double(1.414214));
|
|
|
|
// Info<< myTable << endl;
|
|
printTable(myTable);
|
|
|
|
HashPtrTable<double> copy(myTable);
|
|
|
|
// Info<< copy << endl;
|
|
printTable(copy);
|
|
Info<< copy << endl;
|
|
|
|
Info<<"\nerase some existing and non-existing entries" << nl;
|
|
|
|
auto iter = myTable.find("pi");
|
|
myTable.erase(iter);
|
|
|
|
iter = myTable.find("unknownKey");
|
|
myTable.erase(iter);
|
|
|
|
myTable.erase("abc");
|
|
myTable.erase("unknownKey");
|
|
|
|
printTable(myTable);
|
|
|
|
return 0;
|
|
}
|
|
|
|
// ************************************************************************* //
|