Home
last modified time | relevance | path

Searched refs:splitter_lcp (Results 1 – 4 of 4) sorted by relevance

/dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/extlib/tlx/tlx/sort/strings/
H A Dsample_sort_tools.hpp134 lcp_iter_(splitter_lcp), samples_(samples) { in SSTreeBuilderPreAndLevelOrder()
139 assert(lcp_iter_ == splitter_lcp + num_splitters); in SSTreeBuilderPreAndLevelOrder()
141 splitter_lcp[0] &= 0x80; in SSTreeBuilderPreAndLevelOrder()
143 splitter_lcp[num_splitters] = 0; in SSTreeBuilderPreAndLevelOrder()
242 lcp_iter_(splitter_lcp), in SSTreeBuilderLevelOrder()
247 assert(lcp_iter_ == splitter_lcp + num_splitters); in SSTreeBuilderLevelOrder()
249 splitter_lcp[0] &= 0x80; in SSTreeBuilderLevelOrder()
251 splitter_lcp[num_splitters] = 0; in SSTreeBuilderLevelOrder()
344 unsigned char* splitter_lcp) { in build() argument
346 splitter_, splitter_tree_, splitter_lcp, in build()
[all …]
H A Dparallel_sample_sort.hpp367 unsigned char splitter_lcp[num_splitters + 1]; member in tlx::sort_strings_detail::PS5SmallsortJob::SeqSampleSortStep
391 classifier.build(samples.data(), sample_size, splitter_lcp); in SeqSampleSortStep()
485 << int(s.splitter_lcp[i / 2] & 0x7F); in sort_sample_sort()
489 sp, s.depth_ + (s.splitter_lcp[i / 2] & 0x7F)); in sort_sample_sort()
501 << int(s.splitter_lcp[i / 2] & 0x7F); in sort_sample_sort()
504 ctx_, sp, s.depth_ + (s.splitter_lcp[i / 2] & 0x7F), bktcache); in sort_sample_sort()
513 else if (s.splitter_lcp[i / 2] & 0x80) { in sort_sample_sort()
602 << int(s.splitter_lcp[i / 2] & 0x7F); in sample_sort_free_work()
606 s.depth_ + (s.splitter_lcp[i / 2] & 0x7F)); in sample_sort_free_work()
615 else if (s.splitter_lcp[i / 2] & 0x80) { in sample_sort_free_work()
/dports/devel/tlx/tlx-0.5.20200222-5-g8982a9d/tlx/sort/strings/
H A Dsample_sort_tools.hpp134 lcp_iter_(splitter_lcp), samples_(samples) { in SSTreeBuilderPreAndLevelOrder()
139 assert(lcp_iter_ == splitter_lcp + num_splitters); in SSTreeBuilderPreAndLevelOrder()
141 splitter_lcp[0] &= 0x80; in SSTreeBuilderPreAndLevelOrder()
143 splitter_lcp[num_splitters] = 0; in SSTreeBuilderPreAndLevelOrder()
242 lcp_iter_(splitter_lcp), in SSTreeBuilderLevelOrder()
247 assert(lcp_iter_ == splitter_lcp + num_splitters); in SSTreeBuilderLevelOrder()
249 splitter_lcp[0] &= 0x80; in SSTreeBuilderLevelOrder()
251 splitter_lcp[num_splitters] = 0; in SSTreeBuilderLevelOrder()
344 unsigned char* splitter_lcp) { in build() argument
346 splitter_, splitter_tree_, splitter_lcp, in build()
[all …]
H A Dparallel_sample_sort.hpp367 unsigned char splitter_lcp[num_splitters + 1]; member in tlx::sort_strings_detail::PS5SmallsortJob::SeqSampleSortStep
391 classifier.build(samples.data(), sample_size, splitter_lcp); in SeqSampleSortStep()
485 << int(s.splitter_lcp[i / 2] & 0x7F); in sort_sample_sort()
489 sp, s.depth_ + (s.splitter_lcp[i / 2] & 0x7F)); in sort_sample_sort()
501 << int(s.splitter_lcp[i / 2] & 0x7F); in sort_sample_sort()
504 ctx_, sp, s.depth_ + (s.splitter_lcp[i / 2] & 0x7F), bktcache); in sort_sample_sort()
513 else if (s.splitter_lcp[i / 2] & 0x80) { in sort_sample_sort()
602 << int(s.splitter_lcp[i / 2] & 0x7F); in sample_sort_free_work()
606 s.depth_ + (s.splitter_lcp[i / 2] & 0x7F)); in sample_sort_free_work()
615 else if (s.splitter_lcp[i / 2] & 0x80) { in sample_sort_free_work()