blender::ShuffleProbingStrategy< LinearSteps, PreShuffle > Class Template Reference

#include <BLI_probing_strategies.hh>

Public Member Functions
	ShuffleProbingStrategy (const uint64_t hash)
void	next ()
uint64_t	get () const
int64_t	linear_steps () const

Detailed Description

template<uint64_t LinearSteps = 2, bool PreShuffle = false>
class blender::ShuffleProbingStrategy< LinearSteps, PreShuffle >

Similar to the Python probing strategy. However, it does a bit more shuffling in the next() method. This way more bits are taken into account earlier. After a couple of collisions (that should happen rarely), it will fall back to a sequence that hits every slot.

Definition at line 160 of file BLI_probing_strategies.hh.

Constructor & Destructor Documentation

ShuffleProbingStrategy()

template<uint64_t LinearSteps = 2, bool PreShuffle = false>

blender::ShuffleProbingStrategy< LinearSteps, PreShuffle >::ShuffleProbingStrategy ( const uint64_t hash )

inline

Definition at line 166 of file BLI_probing_strategies.hh.

References hash, and next().

Member Function Documentation

get()

template<uint64_t LinearSteps = 2, bool PreShuffle = false>

uint64_t blender::ShuffleProbingStrategy< LinearSteps, PreShuffle >::get ( ) const

inline

Definition at line 184 of file BLI_probing_strategies.hh.

linear_steps()

template<uint64_t LinearSteps = 2, bool PreShuffle = false>

int64_t blender::ShuffleProbingStrategy< LinearSteps, PreShuffle >::linear_steps ( ) const

inline

Definition at line 189 of file BLI_probing_strategies.hh.

next()

template<uint64_t LinearSteps = 2, bool PreShuffle = false>

void blender::ShuffleProbingStrategy< LinearSteps, PreShuffle >::next ( )

inline

Definition at line 173 of file BLI_probing_strategies.hh.

Referenced by ShuffleProbingStrategy().

---

The documentation for this class was generated from the following file:

• BLI_probing_strategies.hh