forked from bartvdbraak/blender
fe9b21a44a
Behavior is similar to python's set.pop(), it removes and returns a 'random' entry from the hash. Notes: * Popping will return items in same order as ghash/gset iterators (i.e. increasing order in internal buckets-based storage), unless ghash/gset is modified in between. * We are keeping a track of the latest bucket we popped out (through a 'state' parameter), this allows for similar performances to iterators when iteratively popping a whole hash (without it, we are roughly O(n!), with it we are roughly O(n)...). Reviewers: campbellbarton Differential Revision: https://developer.blender.org/D1808 |
||
---|---|---|
.. | ||
BLI_array_utils_test.cc | ||
BLI_ghash_performance_test.cc | ||
BLI_ghash_test.cc | ||
BLI_hash_mm2a_test.cc | ||
BLI_listbase_test.cc | ||
BLI_math_base_test.cc | ||
BLI_math_color_test.cc | ||
BLI_math_geom_test.cc | ||
BLI_path_util_test.cc | ||
BLI_polyfill2d_test.cc | ||
BLI_ressource_strings.h | ||
BLI_stack_test.cc | ||
BLI_string_test.cc | ||
CMakeLists.txt |