bend-parallel
Search uses release 0.1.0.0 · 112 definitions
Definitions (112)
- def gat.onedst[j] <- src[x].
- def gat.fin
- def gat.gor holds perm and its entry x at j: dst[j] <- src[x], then the n entries after j.
- def moved.join
- def moved.rejoin
- def gatsThe gather's forks: d levels down to blocks of 2^e slots under block i, with two handles each to perm, src and dst.
- def gather.pick
- def gather.dst
- def gather.run
- def gather.at
- def by_keyThe stable counting sort of keys into k buckets at fork depth b.
- def gatherdst[j] <- src[perm[j]] for every slot j, at fork depth b: with by_key's perm, src in sorted order.