几个常用字符串hash算法的node封装

最新推荐文章于 2025-04-08 20:40:25 发布

Mark_Melon

最新推荐文章于 2025-04-08 20:40:25 发布

阅读量1.7k

点赞数

分类专栏：算法知识点文章标签： hash

算法同时被 2 个专栏收录

19 篇文章

订阅专栏

知识点

9 篇文章

订阅专栏

本文介绍了Node.js中实现的几种哈希算法，包括加法哈希(additive)、旋转哈希(rotating)、Bernstein哈希(bernstein)、FNV哈希(fnv)及FNV-1a哈希(fnv1a)。这些算法适用于不同场景的数据处理需求。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// hash.js

exports.additive = function (key, prime) {

	key = key instanceof Buffer ? key : new Buffer(key);

	prime = prime == undefined ? 0xffffffff : prime;

	for (var hash = key.length, i = 0; i < key.length; i++) {

		hash += key[i];

	}

	return (hash % prime);

}



exports.rotating = function(key) {

	key = key instanceof Buffer ? key : new Buffer(key);

	for (var hash = key.length, i = 0; i<key.length; ++i) {

		hash = (hash << 4) ^ (hash >> 28) ^ key[i];

	}

	return hash;

}



exports.bernstein = function(key, prime) {

	key = key instanceof Buffer ? key : new Buffer(key);

	prime = prime == undefined ? 0xffffffff : prime;

	var hash = 0;

	for (i=0; i<key.length; ++i) {

		hash =  (hash << 5 + hash) + key[i];

	}

	return hash;

}



exports.fnv = function (key){

	key = key instanceof Buffer ? key : new Buffer(key);

	var p = 16777619, hash = 0x811C9DC5;

	for(var i=0; i< key.length; i++) {

		hash = (hash * p) ^ key[i];

	}

	hash += hash << 13;

	hash ^= hash >> 7;

	hash += hash << 3;

	hash ^= hash >> 17;

	hash += hash << 5;

	return hash;

}



exports.fnv1a = function (key){

	key = key instanceof Buffer ? key : new Buffer(key);

	var p = 16777619, hash = 0x811C9DC5;

	for(var i=0; i< key.length; i++) {

		hash = (hash ^ key[i]) * p;

	}

	hash += hash << 13;

	hash ^= hash >> 7;

	hash += hash << 3;

	hash ^= hash >> 17;

	hash += hash << 5;

	return hash;

}

转载自：http://cnodejs.org/topic/4f16442ccae1f4aa2700114d