diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2019-04-21 17:54:27 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2019-04-21 23:30:08 +0300 |
| commit | cda4cd0705f92dd0aac760071a4f71b98935d19f (patch) | |
| tree | 25c60c32bbb85f695bbdf8a1acd8e1addc62c684 /source/blender/blenlib/intern/smallhash.c | |
| parent | 0ac990d088d553c27f5360f62e142e99f087890a (diff) | |
Cleanup: comments (long lines) in blenlib
Diffstat (limited to 'source/blender/blenlib/intern/smallhash.c')
| -rw-r--r-- | source/blender/blenlib/intern/smallhash.c | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/source/blender/blenlib/intern/smallhash.c b/source/blender/blenlib/intern/smallhash.c index 4060ad15fe3..ea15c14d3d2 100644 --- a/source/blender/blenlib/intern/smallhash.c +++ b/source/blender/blenlib/intern/smallhash.c @@ -20,15 +20,17 @@ /** \file * \ingroup bli * - * 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). + * 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 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: https://en.wikipedia.org/wiki/Double_hashing * - * \warning This should _only_ be used for small hashes where allocating a hash every time is unacceptable. + * \warning This should _only_ be used for small hashes + * where allocating a hash every time is unacceptable. * Otherwise #GHash should be used instead. * * #SmallHashEntry.key |