sample_sort_tools.hpp File Reference

#include <tlx/sort/strings/string_set.hpp>
#include <tlx/define/attribute_fallthrough.hpp>
#include <tlx/die/core.hpp>
#include <tlx/logger/core.hpp>
#include <tlx/math/clz.hpp>
#include <tlx/math/ctz.hpp>
#include <tlx/string/hexdump.hpp>
#include <algorithm>
#include <cassert>
#include <cstddef>

Go to the source code of this file.

Classes
struct	PerfectTreeCalculations< TreeBits >
	Class to transform in-order to level-order indexes in a perfect binary tree. More...
class	SSTreeBuilderPreAndLevelOrder< key_type, num_splitters >
	Recursive TreeBuilder for full-descent and unrolled variants, constructs a both a pre-order and level-order array of splitters and the corresponding LCPs. More...
class	SSTreeBuilderLevelOrder< key_type, num_splitters >
	Recursive TreeBuilder for full-descent and unrolled variants, constructs only a level-order binary tree of splitters. More...
class	SSClassifyTreeUnrollInterleave< key_type, TreeBits, Rollout >
	Sample Sort Classification Tree Unrolled and Interleaved. More...
class	SSClassifyEqualUnroll< key_type, TreeBits >
	Sample Sort Classification Tree Unrolled with Equal Comparisons. More...
class	SSClassifyTreeCalcUnrollInterleave< key_type, TreeBits, Rollout >
	Sample Sort Classification Tree Unrolled, Interleaved, and with Perfect Tree Index Calculations. More...

Namespaces
	tlx
	tlx::sort_strings_detail

Macros
#define	TLX_CLASSIFY_TREE_STEP
#define	TLX_CLASSIFY_TREE_STEP
#define	TLX_CLASSIFY_TREE_STEP

Functions
template<typename Type >
static std::string	to_binary (Type v, const size_t width=(8 *sizeof(Type)))
	represent binary digits of large integer datatypes More...
static void	perfect_tree_calculations_self_verify ()

Macro Definition Documentation

#define TLX_CLASSIFY_TREE_STEP

Definition at line 613 of file sample_sort_tools.hpp.

#define TLX_CLASSIFY_TREE_STEP

Definition at line 613 of file sample_sort_tools.hpp.

#define TLX_CLASSIFY_TREE_STEP

Definition at line 613 of file sample_sort_tools.hpp.