Class to transform in-order to level-order indexes in a perfect binary tree.
More...
#include <sample_sort_tools.hpp>
template<size_t TreeBits>
struct tlx::sort_strings_detail::PerfectTreeCalculations< TreeBits >
Class to transform in-order to level-order indexes in a perfect binary tree.
Definition at line 77 of file sample_sort_tools.hpp.
◆ level_to_preorder()
static unsigned int level_to_preorder |
( |
unsigned int |
id | ) |
|
|
inlinestatic |
◆ pre_to_levelorder()
static unsigned int pre_to_levelorder |
( |
unsigned int |
id | ) |
|
|
inlinestatic |
◆ self_verify()
static void self_verify |
( |
| ) |
|
|
inlinestatic |
◆ debug
◆ num_nodes
◆ treebits
The documentation for this struct was generated from the following file: