| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
DataFrame.Internal.ParRadixSort
Description
Parallel stable sort of row indices by ascending unsigned order of a per-row
Int hash, used by the join build side. A counting sort buckets rows into
key-ordered partitions that workers LSD-radix-sort in parallel, with no merge step.
Synopsis
- parSortByHash :: Int -> Vector Int -> (Vector Int, Vector Int)
- parSortThreshold :: Int
Documentation
parSortByHash :: Int -> Vector Int -> (Vector Int, Vector Int) Source #
Parallel stable sort of [0, n) by ascending unsigned hash order. See the
module header for the ordering contract.
parSortThreshold :: Int Source #
Below this many rows the partition/fork overhead is not worth it; the caller's sequential LSD radix path is used instead.