diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2016-02-10 15:28:16 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2016-02-10 15:28:16 +0300 |
| commit | e7374d0227348b461e4d55d8f36536174d84e24e (patch) | |
| tree | ee96a87286f43270384f4945b115c443b3dab6ce /source/blender/blenlib/intern/smallhash.c | |
| parent | 88d5d99130d31d8126c00af4966bdd164ed1c610 (diff) | |
Docs: minor comment edits to smallhash
Diffstat (limited to 'source/blender/blenlib/intern/smallhash.c')
| -rw-r--r-- | source/blender/blenlib/intern/smallhash.c | 11 |
1 files changed, 7 insertions, 4 deletions
diff --git a/source/blender/blenlib/intern/smallhash.c b/source/blender/blenlib/intern/smallhash.c index 35c23299877..0b976e9612e 100644 --- a/source/blender/blenlib/intern/smallhash.c +++ b/source/blender/blenlib/intern/smallhash.c @@ -28,12 +28,14 @@ /** \file blender/blenlib/intern/smallhash.c * \ingroup bli * - * A light stack-friendly hash library, it uses stack space for smallish hash tables - * but falls back to heap memory once the stack limits reached. + * A light stack-friendly hash library, it uses stack space for relatively small, fixed size hash tables + * but falls back to heap memory once the stack limits reached (#SMSTACKSIZE). * - * based on a doubling non-chaining approach which uses more buckets then entries + * based on a doubling hashing approach (non-chaining) which uses more buckets then entries * stepping over buckets when two keys share the same hash so any key can find a free bucket. * + * See: http://en.wikipedia.org/wiki/Double_hashing + * * \warning This should _only_ be used for small hashes where allocating a hash every time is unacceptable. * Otherwise #GHash should be used instead. * @@ -50,7 +52,8 @@ #include <string.h> #include <stdlib.h> -#include <BLI_sys_types.h> + +#include "BLI_sys_types.h" #include "MEM_guardedalloc.h" |