Stxxl
1.4.0
|
#include <algorithm>
#include <stxxl/bits/noncopyable.h>
#include <stxxl/bits/common/utils.h>
#include <stxxl/bits/verbose.h>
Go to the source code of this file.
Classes | |
class | stxxl::loser_tree< run_cursor_type, run_cursor_cmp_type > |
Namespaces | |
namespace | stxxl |
| |
namespace | std |
Defines | |
#define | TreeStep(L) |
Functions | |
template<typename run_cursor_type , typename run_cursor_cmp_type > | |
void | std::swap (stxxl::loser_tree< run_cursor_type, run_cursor_cmp_type > &a, stxxl::loser_tree< run_cursor_type, run_cursor_cmp_type > &b) |
#define TreeStep | ( | L | ) |
if (LogK >= L) \ { \ currentE = current + \ regEntry[(winnerIndex + (1 << LogK)) >> (((int(LogK - L) + 1) >= 0) ? ((LogK - L) + 1) : 0)]; \ if (cmp(*currentE, *winnerE)) \ { \ std::swap(regEntry[(winnerIndex + (1 << LogK)) \ >> (((int(LogK - L) + 1) >= 0) ? ((LogK - L) + 1) : 0)], winnerIndex); \ winnerE = currentE; \ } \ }
Referenced by stxxl::loser_tree< run_cursor_type, run_cursor_cmp_type >::multi_merge_unrolled().