<p>为下一步开发做的一些技术储备</p> <br/><p>把一些常用的字符串hash算法做了一下封装</p> <br/><p>代码如下</p> <br/> <br/><pre escaped=“true” lang=“javascript” line=“1”> <br/>// hash.js <br/>exports.additive = function (key, prime) { <br/> key = key instanceof Buffer ? key : new Buffer(key); <br/> prime = prime == undefined ? 0xffffffff : prime; <br/> for (var hash = key.length, i = 0; i < key.length; i++) { <br/> hash += key[i]; <br/> } <br/> return (hash % prime); <br/>} <br/> <br/>exports.rotating = function(key) { <br/> key = key instanceof Buffer ? key : new Buffer(key); <br/> for (var hash = key.length, i = 0; i<key.length; ++i) { <br/> hash = (hash << 4) ^ (hash >> 28) ^ key[i]; <br/> } <br/> return hash; <br/>} <br/> <br/>exports.bernstein = function(key, prime) { <br/> key = key instanceof Buffer ? key : new Buffer(key); <br/> prime = prime == undefined ? 0xffffffff : prime; <br/> var hash = 0; <br/> for (i=0; i<key.length; ++i) { <br/> hash = (hash << 5 + hash) + key[i]; <br/> } <br/> return hash; <br/>} <br/> <br/>exports.fnv = function (key){ <br/> key = key instanceof Buffer ? key : new Buffer(key); <br/> var p = 16777619, hash = 0x811C9DC5; <br/> for(var i=0; i< key.length; i++) { <br/> hash = (hash * p) ^ key[i]; <br/> } <br/> hash += hash << 13; <br/> hash ^= hash >> 7; <br/> hash += hash << 3; <br/> hash ^= hash >> 17; <br/> hash += hash << 5; <br/> return hash; <br/>} <br/> <br/>exports.fnv1a = function (key){ <br/> key = key instanceof Buffer ? key : new Buffer(key); <br/> var p = 16777619, hash = 0x811C9DC5; <br/> for(var i=0; i< key.length; i++) { <br/> hash = (hash ^ key[i]) * p; <br/> } <br/> hash += hash << 13; <br/> hash ^= hash >> 7; <br/> hash += hash << 3; <br/> hash ^= hash >> 17; <br/> hash += hash << 5; <br/> return hash; <br/>} <br/></pre>