hash_gather

Lists, for each query position, the indexed points within a radius of it, query after query: query q's points start at qoff[q], the exclusive prefix sum of the hash_count counts. The list is in the order the spatial hash walk visits points, the same on every run. Exact. It takes the params of hash_count (buckets, inv_cell, radius, skip_self) and total, the sum of the counts, which sizes items. core.pairs lists its pairs with it.

Over a live count (COUNT=device, see the abi README) the queries are the first domain_count of a capacity n, total is the capacity of items (the bound the node states), and items is an appended output: its counter is the number of points the live queries listed, above the capacity too when the lists do not fit (the first total words are written and the counter minus total is how many did not). Words of items past the lists are left as allocated, 0. A node that states total as a bound checks the count against it. It binds 8 storage buffers (6 in the plain variant).