tlx
|
Recursive TreeBuilder for full-descent and unrolled variants, constructs only a level-order binary tree of splitters. More...
#include <sample_sort_tools.hpp>
Public Member Functions | |
SSTreeBuilderLevelOrder (key_type tree[num_splitters], unsigned char splitter_lcp[num_splitters+1], const key_type *samples, size_t samplesize) | |
build tree, sizes: splitter_tree[num_splitters + 1] and | |
ptrdiff_t | snum (const key_type *s) const |
key_type | recurse (const key_type *lo, const key_type *hi, unsigned int treeidx, key_type &rec_prevkey) |
Private Attributes | |
key_type * | tree_ |
unsigned char * | lcp_iter_ |
const key_type * | samples_ |
Static Private Attributes | |
static const bool | debug_splitter |
Recursive TreeBuilder for full-descent and unrolled variants, constructs only a level-order binary tree of splitters.
Definition at line 233 of file sample_sort_tools.hpp.
|
inline |
build tree, sizes: splitter_tree[num_splitters + 1] and
Definition at line 239 of file sample_sort_tools.hpp.
|
inline |
Definition at line 259 of file sample_sort_tools.hpp.
|
inline |
Definition at line 255 of file sample_sort_tools.hpp.
|
staticprivate |
Definition at line 235 of file sample_sort_tools.hpp.
|
private |
Definition at line 329 of file sample_sort_tools.hpp.
|
private |
Definition at line 330 of file sample_sort_tools.hpp.
|
private |
Definition at line 328 of file sample_sort_tools.hpp.