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/hash_mm2a.c | |
| parent | 0ac990d088d553c27f5360f62e142e99f087890a (diff) | |
Cleanup: comments (long lines) in blenlib
Diffstat (limited to 'source/blender/blenlib/intern/hash_mm2a.c')
| -rw-r--r-- | source/blender/blenlib/intern/hash_mm2a.c | 9 |
1 files changed, 5 insertions, 4 deletions
diff --git a/source/blender/blenlib/intern/hash_mm2a.c b/source/blender/blenlib/intern/hash_mm2a.c index ee4a6329f64..32b6e1a5465 100644 --- a/source/blender/blenlib/intern/hash_mm2a.c +++ b/source/blender/blenlib/intern/hash_mm2a.c @@ -23,11 +23,12 @@ * A very fast hash generating int32 result, with few collisions and good repartition. * * See also: - * reference implementation: https://smhasher.googlecode.com/svn-history/r130/trunk/MurmurHash2.cpp - * and http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed + * reference implementation: + * - https://smhasher.googlecode.com/svn-history/r130/trunk/MurmurHash2.cpp + * - http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed * - * \warning Do not store that hash in files or such, it is not endian-agnostic, so you should only use it - * for temporary data. + * \warning Do not store that hash in files or such, it is not endian-agnostic, + * so you should only use it for temporary data. */ #include "BLI_compiler_attrs.h" |