#include <DataTable.h>
|
template<typename Item > |
static void | AccumulateHashCode (size_t &hashCode, const Item &item, size_t) |
|
template<typename Item > |
static bool | IsEqual (const Item &item1, const Item &item2) |
|
template<typename Item > |
static int | Compare (const Item &item1, const Item &item2) |
|
template<typename Iterator , typename LessFunc , typename MemManager > |
static void | Sort (Iterator begin, size_t count, const LessFunc &lessFunc, MemManager &) |
|
◆ HashBucket
◆ RawMemPoolParams
◆ AccumulateHashCode()
template<typename Item >
static void momo::DataTraits::AccumulateHashCode |
( |
size_t & |
hashCode, |
|
|
const Item & |
item, |
|
|
size_t |
|
|
) |
| |
|
inlinestatic |
◆ Compare()
template<typename Item >
static int momo::DataTraits::Compare |
( |
const Item & |
item1, |
|
|
const Item & |
item2 |
|
) |
| |
|
inlinestatic |
◆ IsEqual()
template<typename Item >
static bool momo::DataTraits::IsEqual |
( |
const Item & |
item1, |
|
|
const Item & |
item2 |
|
) |
| |
|
inlinestatic |
◆ Sort()
template<typename Iterator , typename LessFunc , typename MemManager >
static void momo::DataTraits::Sort |
( |
Iterator |
begin, |
|
|
size_t |
count, |
|
|
const LessFunc & |
lessFunc, |
|
|
MemManager & |
|
|
) |
| |
|
inlinestatic |
◆ selectEqualityMaxCount
const size_t momo::DataTraits::selectEqualityMaxCount = 6 |
|
static |
The documentation for this class was generated from the following file: