mirror of
https://develop.openfoam.com/Development/openfoam.git
synced 2025-11-28 03:28:01 +00:00
- offers similarity with bitSet STYLE: remove remnant parent::operator= from HashSet STYLE: code formatting in HashTables
193 lines
4.5 KiB
C
193 lines
4.5 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | www.openfoam.com
|
|
\\/ M anipulation |
|
|
-------------------------------------------------------------------------------
|
|
Copyright (C) 2011-2016 OpenFOAM Foundation
|
|
Copyright (C) 2017-2020 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/>.
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "error.H"
|
|
#include "HashPtrTable.H"
|
|
|
|
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
|
|
|
|
template<class T, class Key, class Hash>
|
|
Foam::HashPtrTable<T, Key, Hash>::HashPtrTable
|
|
(
|
|
const HashPtrTable<T, Key, Hash>& rhs
|
|
)
|
|
:
|
|
parent_type(rhs.capacity())
|
|
{
|
|
for (const_iterator iter = rhs.begin(); iter != rhs.end(); ++iter)
|
|
{
|
|
const Key& k = iter.key();
|
|
const T* ptr = iter.val();
|
|
|
|
if (ptr)
|
|
{
|
|
this->set(k, new T(*ptr));
|
|
}
|
|
else
|
|
{
|
|
this->set(k, nullptr);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
template<class T, class Key, class Hash>
|
|
Foam::HashPtrTable<T, Key, Hash>::HashPtrTable
|
|
(
|
|
HashPtrTable<T, Key, Hash>&& rhs
|
|
)
|
|
:
|
|
parent_type(std::move(rhs))
|
|
{}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
|
|
|
|
template<class T, class Key, class Hash>
|
|
Foam::HashPtrTable<T, Key, Hash>::~HashPtrTable()
|
|
{
|
|
clear();
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
|
|
|
|
template<class T, class Key, class Hash>
|
|
Foam::autoPtr<T> Foam::HashPtrTable<T, Key, Hash>::remove(iterator& iter)
|
|
{
|
|
if (iter.good())
|
|
{
|
|
autoPtr<T> old(iter.val());
|
|
this->parent_type::erase(iter);
|
|
return old;
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
|
|
template<class T, class Key, class Hash>
|
|
Foam::autoPtr<T> Foam::HashPtrTable<T, Key, Hash>::remove(const Key& key)
|
|
{
|
|
iterator iter(this->find(key));
|
|
return this->remove(iter);
|
|
}
|
|
|
|
|
|
template<class T, class Key, class Hash>
|
|
bool Foam::HashPtrTable<T, Key, Hash>::erase(iterator& iter)
|
|
{
|
|
if (iter.good())
|
|
{
|
|
T* ptr = iter.val();
|
|
|
|
if (this->parent_type::erase(iter))
|
|
{
|
|
delete ptr;
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
template<class T, class Key, class Hash>
|
|
bool Foam::HashPtrTable<T, Key, Hash>::erase(const Key& key)
|
|
{
|
|
iterator iter(this->find(key));
|
|
return this->erase(iter);
|
|
}
|
|
|
|
|
|
template<class T, class Key, class Hash>
|
|
void Foam::HashPtrTable<T, Key, Hash>::clear()
|
|
{
|
|
for (iterator iter = this->begin(); iter != this->end(); ++iter)
|
|
{
|
|
delete iter.val();
|
|
}
|
|
|
|
this->parent_type::clear();
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * Member Operators * * * * * * * * * * * * * //
|
|
|
|
template<class T, class Key, class Hash>
|
|
void Foam::HashPtrTable<T, Key, Hash>::operator=
|
|
(
|
|
const HashPtrTable<T, Key, Hash>& rhs
|
|
)
|
|
{
|
|
if (this == &rhs)
|
|
{
|
|
return; // Self-assignment is a no-op
|
|
}
|
|
|
|
this->clear();
|
|
|
|
for (const_iterator iter = rhs.begin(); iter != rhs.end(); ++iter)
|
|
{
|
|
const Key& k = iter.key();
|
|
const T* ptr = iter.val();
|
|
|
|
if (ptr)
|
|
{
|
|
this->set(k, new T(*ptr));
|
|
}
|
|
else
|
|
{
|
|
this->set(k, nullptr);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
template<class T, class Key, class Hash>
|
|
void Foam::HashPtrTable<T, Key, Hash>::operator=
|
|
(
|
|
HashPtrTable<T, Key, Hash>&& rhs
|
|
)
|
|
{
|
|
if (this == &rhs)
|
|
{
|
|
return; // Self-assignment is a no-op
|
|
}
|
|
|
|
this->clear();
|
|
this->transfer(rhs);
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * Friend Operators * * * * * * * * * * * * * //
|
|
|
|
#include "HashPtrTableIO.C"
|
|
|
|
// ************************************************************************* //
|