#include <HashUtils.hpp>
|
| template<typename T > |
| std::size_t | operator() (const T &t) const |
| |
| template<typename T1 , typename T2 > |
| std::size_t | operator() (const std::pair< T1, T2 > &p) const |
| |
| template<typename... T> |
| std::size_t | operator() (const std::tuple< T... > &tup) const |
| |
| template<typename... T, size_t... I> |
| std::size_t | operator() (const std::tuple< T... > &tup, std::index_sequence< I... >) const |
| |
Definition at line 80 of file HashUtils.hpp.
◆ operator()() [1/4]
template<typename T1 , typename T2 >
| std::size_t Nektar::HashOp::operator() |
( |
const std::pair< T1, T2 > & |
p | ) |
const |
|
inline |
◆ operator()() [2/4]
template<typename... T>
| std::size_t Nektar::HashOp::operator() |
( |
const std::tuple< T... > & |
tup | ) |
const |
|
inline |
Definition at line 94 of file HashUtils.hpp.
95 {
96 return operator()(tup, std::make_index_sequence<
sizeof...(T)>());
97 }
std::size_t operator()(const T &t) const
References operator()().
◆ operator()() [3/4]
template<typename... T, size_t... I>
| std::size_t Nektar::HashOp::operator() |
( |
const std::tuple< T... > & |
tup, |
|
|
std::index_sequence< I... > |
|
|
) |
| const |
|
inline |
◆ operator()() [4/4]
template<typename T >
| std::size_t Nektar::HashOp::operator() |
( |
const T & |
t | ) |
const |
|
inline |