Files
openfoam/src/OpenFOAM/containers/HashTables/HashTable/HashTableDetail.H
Mark Olesen 0840bfdcb8 STYLE: adjustments to HashSet, HashTable
- use HashTable emplace instead of insert to avoid unneeded argument
  (for HashSet).

- use emplace when generating zero-initialized values for
  HashTable::operator()

- drop unused parameter from Detail::HashTableSingle,
  adjust templates parameter names

- forward HashTable::operator[] to the semantically identical
  HashTable::at() to avoid code duplication
2019-09-27 14:52:52 +02:00

266 lines
6.6 KiB
C++

/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | Copyright (C) 2019 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 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/>.
Class
Foam::Detail::HashTablePair
Description
Internal storage type for HashTable
SourceFiles
HashTableDetail.H
\*---------------------------------------------------------------------------*/
#ifndef HashTableDetail_H
#define HashTableDetail_H
#include "zero.H"
#include <memory>
#include <utility>
#include <type_traits>
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
// Forward Declarations
class Ostream;
template<class T> class autoPtr;
namespace Detail
{
/*---------------------------------------------------------------------------*\
Class isPointer Declaration
\*---------------------------------------------------------------------------*/
//- Pointer-like behaviour
template<class T> struct isPointer : std::is_pointer<T> {};
//- Pointer-like behaviour for autoPtr
template<class T> struct isPointer<autoPtr<T>> : std::true_type {};
//- Pointer-like behaviour for std::unique_ptr
template<class T> struct isPointer<std::unique_ptr<T>> : std::true_type {};
/*---------------------------------------------------------------------------*\
Class HashTablePair Declaration
\*---------------------------------------------------------------------------*/
//- Internal storage type for HashTable entries
// Structure with a (K,V) tuple and a linked-list for collisions
// Could store key/val as std::pair, but no particular advantage
// unless the iterator dereference type changes.
template<class K, class V>
struct HashTablePair
{
// Types
//- Type of key
typedef K key_type;
//- Type of content
typedef V mapped_type;
//- This struct stores a value
static constexpr bool stores_value()
{
return true;
}
// Member Data
//- The lookup key
key_type key_;
//- The mapped data
mapped_type val_;
//- Addressing (next in collision list)
HashTablePair* next_;
// Member Functions
//- No copy construct
HashTablePair(const HashTablePair&) = delete;
//- No copy assignment
void operator=(const HashTablePair&) = delete;
//- Construct from next pointer, key, contents
template<class... Args>
HashTablePair
(
HashTablePair* next,
const key_type& key,
Args&&... args
)
:
key_(key),
val_(std::forward<Args>(args)...),
next_(next)
{}
//- The key
const key_type& key() const
{
return key_;
}
//- The mapped value
const mapped_type& mapped() const
{
return val_;
}
//- The mapped value
mapped_type& mapped()
{
return val_;
}
//- Write (key, val) pair - for pointer types
template<class TypeT = V>
typename std::enable_if<Detail::isPointer<TypeT>::value, void>::type
print(Ostream& os) const
{
os << key_;
if (val_)
{
os << ' ' << *val_;
}
}
//- Write (key, val) pair - for non-pointer types
template<class TypeT = V>
typename std::enable_if<!Detail::isPointer<TypeT>::value, void>::type
print(Ostream& os) const
{
os << key_ << ' ' << val_;
}
};
/*---------------------------------------------------------------------------*\
Class HashTableSingle Declaration
\*---------------------------------------------------------------------------*/
//- Internal storage type for HashSet entries
// Structure with a single (K) value and a linked-list for collisions
template<class K>
struct HashTableSingle
{
// Types
//- Type of key
typedef K key_type;
//- Type of content
typedef Foam::zero::null mapped_type;
//- Content storage type to the entry
typedef key_type value_type;
//- This struct does not store a value
static constexpr bool stores_value()
{
return false;
}
// Member Data
//- The lookup key == content
key_type key_;
//- Addressing (next in collision list)
HashTableSingle* next_;
// Member Functions
//- No copy construct
HashTableSingle(const HashTableSingle&) = delete;
//- No copy assignment
void operator=(const HashTableSingle&) = delete;
//- Construct from next pointer, key, (ununsed) contents
template<class... Args>
HashTableSingle
(
HashTableSingle* next,
const key_type& key,
Args&&...
)
:
key_(key),
next_(next)
{}
//- The key
const key_type& key() const
{
return key_;
}
//- The mapped value (dummy)
const mapped_type& mapped() const
{
return Foam::zero::null::dummy;
}
//- The mapped value (dummy)
mapped_type& mapped()
{
return Foam::zero::null::dummy;
}
//- Write the key. There is no value
void print(Ostream& os) const
{
os << key_;
}
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
} // End namespace Detail
} // End namespace Foam
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#endif
// ************************************************************************* //