Part of #110 (Refactor of open address data structures)
Development branch: NVIDIA/cuCollections/refactor
Synopsis
Given a key k, a probing sequence provides a sequence of N potentially non-contiguous locations (or values) [i0, i1, i2, ... iN, EMPTY_SENTINEL] where if k exists it is present in [i0, iN].
TODOs
Backlog
References
Part of #110 (Refactor of open address data structures)
Development branch: NVIDIA/cuCollections/refactor
Synopsis
Given a key
k, a probing sequence provides a sequence ofNpotentially non-contiguous locations (or values)[i0, i1, i2, ... iN, EMPTY_SENTINEL]where ifkexists it is present in[i0, iN].TODOs
cuco::probing_schemes::linear_probingandcuco::probing_schemes::double_hashingBacklog
References