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...
#include <sample_sort_tools.hpp>
|
| SSTreeBuilderPreAndLevelOrder (key_type splitter[num_splitters], key_type tree[num_splitters+1], unsigned char splitter_lcp[num_splitters+1], const key_type *samples, size_t samplesize) |
|
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) |
|
template<typename key_type, size_t num_splitters>
class tlx::sort_strings_detail::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.
Definition at line 122 of file sample_sort_tools.hpp.
SSTreeBuilderPreAndLevelOrder |
( |
key_type |
splitter[num_splitters], |
|
|
key_type |
tree[num_splitters+1], |
|
|
unsigned char |
splitter_lcp[num_splitters+1], |
|
|
const key_type * |
samples, |
|
|
size_t |
samplesize |
|
) |
| |
|
inline |
key_type recurse |
( |
const key_type * |
lo, |
|
|
const key_type * |
hi, |
|
|
unsigned int |
treeidx, |
|
|
key_type & |
rec_prevkey |
|
) |
| |
|
inline |
ptrdiff_t snum |
( |
const key_type * |
s | ) |
const |
|
inline |
const bool debug_splitter |
|
staticprivate |
The documentation for this class was generated from the following file: