?HAMA

Edit File Size: 2.42 KB

/proc/thread-self/root/home/byroehnu/.trash/node_modules11/uuid/dist/esm-browser/sha1.js

Text Base64

// Adapted from Chris Veness' SHA1 code at
// http://www.movable-type.co.uk/scripts/sha1.html
function f(s, x, y, z) {
  switch (s) {
    case 0:
      return x & y ^ ~x & z;

case 1:
      return x ^ y ^ z;

case 2:
      return x & y ^ x & z ^ y & z;

case 3:
      return x ^ y ^ z;
  }
}

function ROTL(x, n) {
  return x << n | x >>> 32 - n;
}

function sha1(bytes) {
  const K = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6];
  const H = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0];

if (typeof bytes === 'string') {
    const msg = unescape(encodeURIComponent(bytes)); // UTF8 escape

bytes = [];

for (let i = 0; i < msg.length; ++i) {
      bytes.push(msg.charCodeAt(i));
    }
  } else if (!Array.isArray(bytes)) {
    // Convert Array-like to Array
    bytes = Array.prototype.slice.call(bytes);
  }

bytes.push(0x80);
  const l = bytes.length / 4 + 2;
  const N = Math.ceil(l / 16);
  const M = new Array(N);

for (let i = 0; i < N; ++i) {
    const arr = new Uint32Array(16);

for (let j = 0; j < 16; ++j) {
      arr[j] = bytes[i * 64 + j * 4] << 24 | bytes[i * 64 + j * 4 + 1] << 16 | bytes[i * 64 + j * 4 + 2] << 8 | bytes[i * 64 + j * 4 + 3];
    }

M[i] = arr;
  }

M[N - 1][14] = (bytes.length - 1) * 8 / Math.pow(2, 32);
  M[N - 1][14] = Math.floor(M[N - 1][14]);
  M[N - 1][15] = (bytes.length - 1) * 8 & 0xffffffff;

for (let i = 0; i < N; ++i) {
    const W = new Uint32Array(80);

for (let t = 0; t < 16; ++t) {
      W[t] = M[i][t];
    }

for (let t = 16; t < 80; ++t) {
      W[t] = ROTL(W[t - 3] ^ W[t - 8] ^ W[t - 14] ^ W[t - 16], 1);
    }

let a = H[0];
    let b = H[1];
    let c = H[2];
    let d = H[3];
    let e = H[4];

for (let t = 0; t < 80; ++t) {
      const s = Math.floor(t / 20);
      const T = ROTL(a, 5) + f(s, b, c, d) + e + K[s] + W[t] >>> 0;
      e = d;
      d = c;
      c = ROTL(b, 30) >>> 0;
      b = a;
      a = T;
    }

H[0] = H[0] + a >>> 0;
    H[1] = H[1] + b >>> 0;
    H[2] = H[2] + c >>> 0;
    H[3] = H[3] + d >>> 0;
    H[4] = H[4] + e >>> 0;
  }

return [H[0] >> 24 & 0xff, H[0] >> 16 & 0xff, H[0] >> 8 & 0xff, H[0] & 0xff, H[1] >> 24 & 0xff, H[1] >> 16 & 0xff, H[1] >> 8 & 0xff, H[1] & 0xff, H[2] >> 24 & 0xff, H[2] >> 16 & 0xff, H[2] >> 8 & 0xff, H[2] & 0xff, H[3] >> 24 & 0xff, H[3] >> 16 & 0xff, H[3] >> 8 & 0xff, H[3] & 0xff, H[4] >> 24 & 0xff, H[4] >> 16 & 0xff, H[4] >> 8 & 0xff, H[4] & 0xff];
}

export default sha1;

Exit & Reset Text mode: syntax highlighting auto-detects file type.

Name	Size	Perms	Modified	Actions
index.js	412 B	lrw-r--r--	2026-02-28 00:27:12	Edit Download recursive recursive
md5.js	6.72 KB	lrw-r--r--	2026-02-28 00:28:00	Edit Download recursive recursive
native.js	137 B	lrw-r--r--	2026-02-28 00:28:20	Edit Download recursive recursive
nil.js	54 B	lrw-r--r--	2026-02-28 00:28:28	Edit Download recursive recursive
parse.js	1.08 KB	lrw-r--r--	2026-02-28 00:28:34	Edit Download recursive recursive
regex.js	133 B	lrw-r--r--	2026-02-28 00:28:38	Edit Download recursive recursive
rng.js	838 B	lrw-r--r--	2026-02-28 00:28:46	Edit Download recursive recursive
sha1.js	2.42 KB	lrw-r--r--	2026-02-28 00:28:56	Edit Download recursive recursive
stringify.js	1.43 KB	lrw-r--r--	2026-02-28 00:28:58	Edit Download recursive recursive
v1.js	3.24 KB	lrw-r--r--	2026-02-28 00:29:04	Edit Download recursive recursive
v3.js	107 B	lrw-r--r--	2026-02-28 00:29:08	Edit Download recursive recursive
v4.js	680 B	lrw-r--r--	2026-02-28 00:29:14	Edit Download recursive recursive
v5.js	110 B	lrw-r--r--	2026-02-28 00:29:22	Edit Download recursive recursive
v35.js	1.73 KB	lrw-r--r--	2026-02-28 00:29:10	Edit Download recursive recursive
validate.js	141 B	lrw-r--r--	2026-02-28 00:29:28	Edit Download recursive recursive
version.js	200 B	lrw-r--r--	2026-02-28 00:29:34	Edit Download recursive recursive

Directory Contents