#include <sorthelper.h>
List of all members.
Detailed Description
template<typename T>
class SortHelper< T >
Definition at line 36 of file sorthelper.h.
Constructor & Destructor Documentation
Member Function Documentation
Definition at line 63 of file sorthelper.h.
{
for (
int i = 0; i < counts_.
size(); ++i) {
if (counts_[i].value == value) {
counts_[i].count +=
count;
return;
}
}
SortPair<T> new_pair = {value,
count};
}
template<typename T >
int SortHelper< T >::MaxCount |
( |
T * |
max_value | ) |
const |
|
inline |
Definition at line 78 of file sorthelper.h.
{
for (
int i = 0; i < counts_.
size(); ++i) {
if (counts_[i].
count > best_count) {
best_count = counts_[i].count;
*max_value = counts_[i].value;
}
}
return best_count;
}
template<typename T >
static int SortHelper< T >::SortPairsByCount |
( |
const void * |
v1, |
|
|
const void * |
v2 |
|
) |
| |
|
inlinestatic |
Definition at line 44 of file sorthelper.h.
{
const SortPair<T>* p1 = reinterpret_cast<const SortPair<T>*>(v1);
const SortPair<T>* p2 = reinterpret_cast<const SortPair<T>*>(v2);
return p2->count - p1->count;
}
template<typename T >
static int SortHelper< T >::SortPairsByValue |
( |
const void * |
v1, |
|
|
const void * |
v2 |
|
) |
| |
|
inlinestatic |
Definition at line 50 of file sorthelper.h.
{
const SortPair<T>* p1 = reinterpret_cast<const SortPair<T>*>(v1);
const SortPair<T>* p2 = reinterpret_cast<const SortPair<T>*>(v2);
if (p2->value - p1->value < 0) return -1;
if (p2->value - p1->value > 0) return 1;
return 0;
}
The documentation for this class was generated from the following file: