mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-02 03:05:24 +08:00
Yudong Jin
7257641e0e
* Retranslate the complete Japanese online edition from Chinese * Fit Japanese homepage labels and localize heading permalinks * Point Japanese contribution instructions to the Japanese preview * Replace locale conditionals with multilingual UI tables
61 lines
1.3 KiB
JavaScript
61 lines
1.3 KiB
JavaScript
/**
|
|
* File: simple_hash.js
|
|
* Created Time: 2023-08-06
|
|
* Author: yuan0221 ([email protected])
|
|
*/
|
|
|
|
/* 加算ハッシュ */
|
|
function addHash(key) {
|
|
let hash = 0;
|
|
const MODULUS = 1000000007;
|
|
for (const c of key) {
|
|
hash = (hash + c.charCodeAt(0)) % MODULUS;
|
|
}
|
|
return hash;
|
|
}
|
|
|
|
/* 乗算ハッシュ */
|
|
function mulHash(key) {
|
|
let hash = 0;
|
|
const MODULUS = 1000000007;
|
|
for (const c of key) {
|
|
hash = (31 * hash + c.charCodeAt(0)) % MODULUS;
|
|
}
|
|
return hash;
|
|
}
|
|
|
|
/* 排他的論理和ハッシュ */
|
|
function xorHash(key) {
|
|
let hash = 0;
|
|
const MODULUS = 1000000007;
|
|
for (const c of key) {
|
|
hash ^= c.charCodeAt(0);
|
|
}
|
|
return hash % MODULUS;
|
|
}
|
|
|
|
/* 回転ハッシュ */
|
|
function rotHash(key) {
|
|
let hash = 0;
|
|
const MODULUS = 1000000007;
|
|
for (const c of key) {
|
|
hash = ((hash << 4) ^ (hash >> 28) ^ c.charCodeAt(0)) % MODULUS;
|
|
}
|
|
return hash;
|
|
}
|
|
|
|
/* 実行用コード */
|
|
const key = 'Hello 算法';
|
|
|
|
let hash = addHash(key);
|
|
console.log('加算ハッシュの値は ' + hash);
|
|
|
|
hash = mulHash(key);
|
|
console.log('乗算ハッシュの値は ' + hash);
|
|
|
|
hash = xorHash(key);
|
|
console.log('排他的論理和ハッシュの値は ' + hash);
|
|
|
|
hash = rotHash(key);
|
|
console.log('回転ハッシュの値は ' + hash);
|