Recursive TreeBuilder for full-descent and unrolled variants, constructs only a level-order binary tree of splitters.
More...
#include <sample_sort_tools.hpp>
|
| 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) |
template<typename key_type, size_t num_splitters>
class tlx::sort_strings_detail::SSTreeBuilderLevelOrder< key_type, num_splitters >
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.
◆ SSTreeBuilderLevelOrder()
template<typename key_type, size_t num_splitters>
SSTreeBuilderLevelOrder |
( |
key_type | tree[num_splitters], |
|
|
unsigned char | splitter_lcp[num_splitters+1], |
|
|
const key_type * | samples, |
|
|
size_t | samplesize ) |
|
inline |
◆ recurse()
template<typename key_type, size_t num_splitters>
key_type recurse |
( |
const key_type * | lo, |
|
|
const key_type * | hi, |
|
|
unsigned int | treeidx, |
|
|
key_type & | rec_prevkey ) |
|
inline |
◆ snum()
template<typename key_type, size_t num_splitters>
ptrdiff_t snum |
( |
const key_type * | s | ) |
const |
|
inline |
◆ debug_splitter
template<typename key_type, size_t num_splitters>
const bool debug_splitter |
|
staticprivate |
◆ lcp_iter_
template<typename key_type, size_t num_splitters>
◆ samples_
template<typename key_type, size_t num_splitters>
◆ tree_
template<typename key_type, size_t num_splitters>
The documentation for this class was generated from the following file: