- The capitalization is consistent with most other template classes, but more importantly frees up xfer() for use as method name without needing special treatment to avoid ambiguities. It seems reasonable to have different names for transfer(...) and xfer() methods, since the transfer is occuring in different directions. The xfer() method can thus replace the recently introduced zero-parameter transfer() methods. Other name candidates (eg, yield, release, etc.) were deemed too abstract.
208 lines
5.6 KiB
C
208 lines
5.6 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright (C) 1991-2009 OpenCFD Ltd.
|
|
\\/ M anipulation |
|
|
-------------------------------------------------------------------------------
|
|
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 2 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, write to the Free Software Foundation,
|
|
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "StaticHashTable.H"
|
|
#include "Istream.H"
|
|
#include "Ostream.H"
|
|
|
|
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
|
|
|
|
template<class T, class Key, class Hash>
|
|
Foam::StaticHashTable<T, Key, Hash>::StaticHashTable
|
|
(
|
|
Istream& is,
|
|
const label size
|
|
)
|
|
:
|
|
StaticHashTableName(),
|
|
keys_(size),
|
|
objects_(size),
|
|
nElmts_(0),
|
|
endIter_(*this, keys_.size(), 0),
|
|
endConstIter_(*this, keys_.size(), 0)
|
|
{
|
|
if (size < 1)
|
|
{
|
|
FatalErrorIn
|
|
(
|
|
"StaticHashTable<T, Key, Hash>::StaticHashTable(const label size)"
|
|
) << "Illegal size " << size << " for StaticHashTable."
|
|
<< " Minimum size is 1" << abort(FatalError);
|
|
}
|
|
|
|
operator>>(is, *this);
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * IOstream Operators * * * * * * * * * * * * //
|
|
|
|
template<class T, class Key, class Hash>
|
|
Foam::Istream& Foam::operator>>(Istream& is, StaticHashTable<T, Key, Hash>& L)
|
|
{
|
|
is.fatalCheck("operator>>(Istream&, StaticHashTable<T, Key, Hash>&)");
|
|
|
|
// Anull list
|
|
L.clear();
|
|
|
|
is.fatalCheck("operator>>(Istream&, StaticHashTable<T, Key, Hash>&)");
|
|
|
|
token firstToken(is);
|
|
|
|
is.fatalCheck
|
|
(
|
|
"operator>>(Istream&, StaticHashTable<T, Key, Hash>&) : "
|
|
"reading first token"
|
|
);
|
|
|
|
if (firstToken.isLabel())
|
|
{
|
|
label s = firstToken.labelToken();
|
|
|
|
// Read beginning of contents
|
|
char listDelimiter = is.readBeginList("StaticHashTable<T, Key, Hash>");
|
|
|
|
if (s)
|
|
{
|
|
if (2*s > L.keys_.size())
|
|
{
|
|
L.resize(2*s);
|
|
}
|
|
|
|
if (listDelimiter == token::BEGIN_LIST)
|
|
{
|
|
for (label i=0; i<s; i++)
|
|
{
|
|
Key key;
|
|
is >> key;
|
|
L.insert(key, pTraits<T>(is));
|
|
|
|
is.fatalCheck
|
|
(
|
|
"operator>>(Istream&, StaticHashTable<T, Key, Hash>&)"
|
|
" : reading entry"
|
|
);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
FatalIOErrorIn
|
|
(
|
|
"operator>>(Istream&, StaticHashTable<T, Key, Hash>&)",
|
|
is
|
|
) << "incorrect first token, '(', found " << firstToken.info()
|
|
<< exit(FatalIOError);
|
|
}
|
|
}
|
|
|
|
// Read end of contents
|
|
is.readEndList("StaticHashTable");
|
|
}
|
|
else if (firstToken.isPunctuation())
|
|
{
|
|
if (firstToken.pToken() != token::BEGIN_LIST)
|
|
{
|
|
FatalIOErrorIn
|
|
(
|
|
"operator>>(Istream&, StaticHashTable<T, Key, Hash>&)",
|
|
is
|
|
) << "incorrect first token, '(', found " << firstToken.info()
|
|
<< exit(FatalIOError);
|
|
}
|
|
|
|
token lastToken(is);
|
|
while
|
|
(
|
|
!(
|
|
lastToken.isPunctuation()
|
|
&& lastToken.pToken() == token::END_LIST
|
|
)
|
|
)
|
|
{
|
|
is.putBack(lastToken);
|
|
Key key;
|
|
is >> key;
|
|
T element;
|
|
is >> element;
|
|
L.insert(key, element);
|
|
|
|
is.fatalCheck
|
|
(
|
|
"operator>>(Istream&, StaticHashTable<T, Key, Hash>&) : "
|
|
"reading entry"
|
|
);
|
|
|
|
is >> lastToken;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
FatalIOErrorIn
|
|
(
|
|
"operator>>(Istream&, StaticHashTable<T, Key, Hash>&)",
|
|
is
|
|
) << "incorrect first token, expected <int> or '(', found "
|
|
<< firstToken.info()
|
|
<< exit(FatalIOError);
|
|
}
|
|
|
|
is.fatalCheck("operator>>(Istream&, StaticHashTable<T, Key, Hash>&)");
|
|
|
|
return is;
|
|
}
|
|
|
|
|
|
template<class T, class Key, class Hash>
|
|
Foam::Ostream& Foam::operator<<
|
|
(
|
|
Ostream& os,
|
|
const StaticHashTable<T, Key, Hash>& L)
|
|
{
|
|
// Write size and start delimiter
|
|
os << nl << L.size() << nl << token::BEGIN_LIST << nl;
|
|
|
|
// Write contents
|
|
for
|
|
(
|
|
typename StaticHashTable<T, Key, Hash>::const_iterator iter = L.begin();
|
|
iter != L.end();
|
|
++iter
|
|
)
|
|
{
|
|
os << iter.key() << token::SPACE << iter() << nl;
|
|
}
|
|
|
|
// Write end delimiter
|
|
os << token::END_LIST;
|
|
|
|
// Check state of IOstream
|
|
os.check("Ostream& operator<<(Ostream&, const StaticHashTable&)");
|
|
|
|
return os;
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|