diff options
author | Bram Moolenaar <Bram@vim.org> | 2010-08-08 16:38:42 +0200 |
---|---|---|
committer | Bram Moolenaar <Bram@vim.org> | 2010-08-08 16:38:42 +0200 |
commit | 09092155a66388bbd7be8d16debb35abfcfae700 (patch) | |
tree | 4cbe7f4f0d5c763405f721f7f5dba08864e53ef3 /src/hashtab.c | |
parent | 83687a72155c70c062c689a9c545b5cdf5ebd0b4 (diff) | |
download | vim-git-09092155a66388bbd7be8d16debb35abfcfae700.tar.gz |
Remove unused code.
Diffstat (limited to 'src/hashtab.c')
-rw-r--r-- | src/hashtab.c | 15 |
1 files changed, 0 insertions, 15 deletions
diff --git a/src/hashtab.c b/src/hashtab.c index e0d3e1a08..8b53aa401 100644 --- a/src/hashtab.c +++ b/src/hashtab.c @@ -492,25 +492,10 @@ hash_hash(key) want to crash if we get one. */ p = key + 1; -#if 0 - /* ElfHash algorithm, which is supposed to have an even distribution. - * Suggested by Charles Campbell. */ - hash_T g; - - while (*p != NUL) - { - hash = (hash << 4) + *p++; /* clear low 4 bits of hash, add char */ - g = hash & 0xf0000000L; /* g has high 4 bits of hash only */ - if (g != 0) - hash ^= g >> 24; /* xor g's high 4 bits into hash */ - } -#else - /* A simplistic algorithm that appears to do very well. * Suggested by George Reilly. */ while (*p != NUL) hash = hash * 101 + *p++; -#endif return hash; } |