Skip to content

[FEA] New probing scheme concept #205

@sleeepyjack

Description

@sleeepyjack

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

  • Implement classes cuco::probing_schemes::linear_probing and cuco::probing_schemes::double_hashing
  • Provide an option for windowed, i.e., vectorized probing via customization point object
  • Enable cooperative probing

Backlog

  • Use C++20-style ranges with sentinels

References

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions