hash_walk

How a shader reads the spatial hash hash and hash_starts build: a walk over the points within a radius of a query position (zero_nb_begin, zero_nb_next, which answers ZERO_NONE when the walk is done), and the nearest point of a query (zero_hash_nearest). The module header lists the bindings and params the includer declares. The walk visits every cell within ceil(radius * inv_cell) of the query's own, so any radius is answered in full; it visits cells in a fixed order and, within a cell, points in sorted order, so a shader that lists neighbours lists them in the same order on every run. It includes hash_cell. hash_count, hash_gather, hash_nearest, hash_repel and hash_hook include it.