Blender
V3.3
|
#include <BLI_probing_strategies.hh>
Public Member Functions | |
PythonProbingStrategy (const uint64_t hash) | |
void | next () |
uint64_t | get () const |
int64_t | linear_steps () const |
This is the probing strategy used by CPython (in 2020).
It is very fast when the original hash value is good. If there are collisions, more bits of the hash value are taken into account.
LinearSteps: Can be set to something larger than 1 for improved cache performance in some cases. PreShuffle: When true, the initial call to next() will be done to the constructor. This can help when the hash function has put little information into the lower bits.
Definition at line 126 of file BLI_probing_strategies.hh.
|
inline |
Definition at line 132 of file BLI_probing_strategies.hh.
References blender::PythonProbingStrategy< LinearSteps, PreShuffle >::next().
|
inline |
Definition at line 145 of file BLI_probing_strategies.hh.
|
inline |
Definition at line 150 of file BLI_probing_strategies.hh.
|
inline |
Definition at line 139 of file BLI_probing_strategies.hh.
Referenced by blender::PythonProbingStrategy< LinearSteps, PreShuffle >::PythonProbingStrategy().