diff options
| author | Lennart Poettering <lennart@poettering.net> | 2013-10-01 00:13:18 +0200 |
|---|---|---|
| committer | Lennart Poettering <lennart@poettering.net> | 2013-10-01 00:17:21 +0200 |
| commit | 45fa9e29f8c9759c8f2f4238fed956f695c73dc3 (patch) | |
| tree | 456b6168141128bd35319af35ac9e437851680b1 /LICENSE.MIT | |
| parent | bcd8e6d1bd3f434af894faeb400fee0e99445a7f (diff) | |
hashmap: size hashmap bucket array dynamically
Instead of fixing the hashmap bucket array to 127 entries dynamically
size it, starting with a smaller one of 31. As soon as a fill level of
75% is reached, quadruple the size, and so on.
This should siginficantly optimize the lookup time in large tables
(from O(n) back to O(1)), and save memory on smaller tables (which most
are).
Diffstat (limited to 'LICENSE.MIT')
0 files changed, 0 insertions, 0 deletions