rapidhash-js 2.2.0 → 3.0.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (45) hide show
  1. package/CHANGELOG.md +11 -0
  2. package/README.md +100 -53
  3. package/lib/common.d.mts +7 -0
  4. package/lib/common.d.ts +7 -0
  5. package/lib/common.js +167 -0
  6. package/lib/common.js.map +1 -0
  7. package/lib/common.mjs +96 -0
  8. package/lib/common.mjs.map +1 -0
  9. package/lib/common_v2.js +26 -0
  10. package/lib/common_v2.js.map +1 -0
  11. package/lib/common_v2.mjs +15 -0
  12. package/lib/common_v2.mjs.map +1 -0
  13. package/lib/index.d.mts +2 -91
  14. package/lib/index.d.ts +2 -91
  15. package/lib/index.js +11 -467
  16. package/lib/index.mjs +1 -429
  17. package/lib/v1.0/index.d.mts +30 -0
  18. package/lib/v1.0/index.d.ts +30 -0
  19. package/lib/v1.0/index.js +106 -0
  20. package/lib/v1.0/index.js.map +1 -0
  21. package/lib/v1.0/index.mjs +103 -0
  22. package/lib/v1.0/index.mjs.map +1 -0
  23. package/lib/v2.0/index.d.mts +30 -0
  24. package/lib/v2.0/index.d.ts +30 -0
  25. package/lib/v2.0/index.js +128 -0
  26. package/lib/v2.0/index.js.map +1 -0
  27. package/lib/v2.0/index.mjs +125 -0
  28. package/lib/v2.0/index.mjs.map +1 -0
  29. package/lib/v2.2/index.d.mts +30 -0
  30. package/lib/v2.2/index.d.ts +30 -0
  31. package/lib/v2.2/index.js +128 -0
  32. package/lib/v2.2/index.js.map +1 -0
  33. package/lib/v2.2/index.mjs +125 -0
  34. package/lib/v2.2/index.mjs.map +1 -0
  35. package/lib/v3.0/index.d.mts +86 -0
  36. package/lib/v3.0/index.d.ts +86 -0
  37. package/lib/v3.0/index.js +11 -0
  38. package/lib/v3.0/index.mjs +1 -0
  39. package/lib/v3.0.js +407 -0
  40. package/lib/v3.0.js.map +1 -0
  41. package/lib/v3.0.mjs +354 -0
  42. package/lib/v3.0.mjs.map +1 -0
  43. package/package.json +23 -15
  44. package/lib/index.js.map +0 -1
  45. package/lib/index.mjs.map +0 -1
package/lib/index.mjs CHANGED
@@ -1,429 +1 @@
1
- // src/common.ts
2
- function rapid_mix_fast(a, b) {
3
- const m = a * b;
4
- return BigInt.asUintN(64, m) ^ m >> 64n;
5
- }
6
- function rapidhash_epilogue_fast(a, b, secretA, secretB, len) {
7
- const m0 = a * b;
8
- const m1 = (BigInt.asUintN(64, m0) ^ secretA ^ len) * (m0 >> 64n ^ secretB);
9
- return BigInt.asUintN(64, m1) ^ m1 >> 64n;
10
- }
11
- function rapid_mix_protected(a, b) {
12
- const m = a * b;
13
- return BigInt.asUintN(64, m) ^ m >> 64n ^ a ^ b;
14
- }
15
- function rapidhash_epilogue_protected(a0, b0, secretA, secretB, len) {
16
- const m0 = a0 * b0;
17
- const a1 = BigInt.asUintN(64, m0) ^ secretA ^ len ^ a0;
18
- const b1 = m0 >> 64n ^ secretB ^ b0;
19
- const m1 = a1 * b1;
20
- return BigInt.asUintN(64, m1) ^ m1 >> 64n ^ a1 ^ b1;
21
- }
22
- var read32x2Buffer = new Uint8Array(8);
23
- var read32x2View = new DataView(read32x2Buffer.buffer);
24
- function rapid_read32x2(buf, offset1, offset2) {
25
- read32x2View.setUint32(4, buf.getUint32(offset1, true), true);
26
- read32x2View.setUint32(0, buf.getUint32(offset2, true), true);
27
- return read32x2View.getBigUint64(0, true);
28
- }
29
- var read32Buffer = new Uint8Array(8);
30
- var read32View = new DataView(read32Buffer.buffer);
31
- function rapid_read32(buf, offset) {
32
- read32View.setUint32(0, buf.getUint32(offset, true), true);
33
- return read32View.getBigUint64(0, true);
34
- }
35
- function rapid_read64(buf, offset) {
36
- return buf.getBigUint64(offset, true);
37
- }
38
- var readSmallBuffer = new Uint8Array(8);
39
- var readSmallView = new DataView(readSmallBuffer.buffer);
40
- function rapid_readSmall(buf, offset, k) {
41
- readSmallBuffer[7] = buf.getUint8(offset);
42
- readSmallBuffer[4] = buf.getUint8(offset + (k >> 1));
43
- readSmallBuffer[0] = buf.getUint8(offset + k - 1);
44
- return readSmallView.getBigUint64(0, true);
45
- }
46
- var readBytesBuffer = new Uint8Array(8);
47
- var readBytesView = new DataView(readBytesBuffer.buffer);
48
- function rapid_readBytes(buf, offset1, offset2) {
49
- readBytesBuffer[0] = buf.getUint8(offset2);
50
- readBytesBuffer[7] = buf.getUint8(offset1);
51
- return readBytesView.getBigUint64(0, true);
52
- }
53
- var textEncoder = new TextEncoder();
54
- var utf8BufferSize = 2048;
55
- var stringLengthThresholdToUseBuffer = utf8BufferSize / 3;
56
- var utf8Buffer = new Uint8Array(utf8BufferSize);
57
- function toDataView(message) {
58
- if (typeof message === "string") {
59
- if (message.length <= stringLengthThresholdToUseBuffer) {
60
- const { written } = textEncoder.encodeInto(message, utf8Buffer);
61
- return new DataView(utf8Buffer.buffer, 0, written);
62
- }
63
- const utf8bytes = textEncoder.encode(message);
64
- return new DataView(utf8bytes.buffer, utf8bytes.byteOffset, utf8bytes.byteLength);
65
- }
66
- if (message instanceof Uint8Array) {
67
- return new DataView(message.buffer, message.byteOffset, message.byteLength);
68
- }
69
- return message;
70
- }
71
- var defaultRapidMumBehaviour = "fast";
72
- var rapidMumImplementations = {
73
- fast: {
74
- rapid_mix: rapid_mix_fast,
75
- rapidhash_epilogue: rapidhash_epilogue_fast
76
- },
77
- protected: {
78
- rapid_mix: rapid_mix_protected,
79
- rapidhash_epilogue: rapidhash_epilogue_protected
80
- }
81
- };
82
- function isBigUint64(value) {
83
- return value >= 0n && value <= 0xffffffffffffffffn;
84
- }
85
- function validateOptions(options, defaultSeed) {
86
- const result = {
87
- seed: defaultSeed,
88
- rapidMumBehaviour: defaultRapidMumBehaviour
89
- };
90
- if (options === void 0) {
91
- return result;
92
- }
93
- if (options.seed !== void 0) {
94
- if (!isBigUint64(options.seed)) {
95
- throw new Error(`seed must be a 64-bit unsigned bigint value: ${options.seed}`);
96
- }
97
- result.seed = options.seed;
98
- }
99
- if (options.rapidMumBehaviour !== void 0) {
100
- result.rapidMumBehaviour = options.rapidMumBehaviour;
101
- }
102
- return result;
103
- }
104
-
105
- // src/rapidhash_v1.0.ts
106
- var RAPID_SEED = 0xbdd89aa982704029n;
107
- var rapid_secret = [0x2d358dccaa6c78a5n, 0x8bb84b93962eacc9n, 0x4b33a62ed433d4a3n];
108
- function rapidhash_v1_internal(key, seed, secret, rapid_mix, rapidhash_epilogue) {
109
- const len = key.byteLength;
110
- const lenBI = BigInt(key.byteLength);
111
- seed ^= rapid_mix(seed ^ secret[0], secret[1]) ^ lenBI;
112
- let a;
113
- let b;
114
- if (len <= 16) {
115
- if (len >= 4) {
116
- const last = len - 4;
117
- a = rapid_read32x2(key, 0, last);
118
- const delta = (len & 24) >> (len >> 3);
119
- b = rapid_read32x2(key, delta, last - delta);
120
- } else if (len > 0) {
121
- a = rapid_readSmall(key, 0, len);
122
- b = 0n;
123
- } else {
124
- a = 0n;
125
- b = 0n;
126
- }
127
- } else {
128
- let i = len;
129
- let p = 0;
130
- if (i > 48) {
131
- let see1 = seed;
132
- let see2 = seed;
133
- while (i >= 96) {
134
- seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);
135
- see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);
136
- see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);
137
- seed = rapid_mix(rapid_read64(key, p + 48) ^ secret[0], rapid_read64(key, p + 56) ^ seed);
138
- see1 = rapid_mix(rapid_read64(key, p + 64) ^ secret[1], rapid_read64(key, p + 72) ^ see1);
139
- see2 = rapid_mix(rapid_read64(key, p + 80) ^ secret[2], rapid_read64(key, p + 88) ^ see2);
140
- p += 96;
141
- i -= 96;
142
- }
143
- if (i >= 48) {
144
- seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);
145
- see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);
146
- see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);
147
- p += 48;
148
- i -= 48;
149
- }
150
- seed ^= see1 ^ see2;
151
- }
152
- if (i > 16) {
153
- seed = rapid_mix(rapid_read64(key, p) ^ secret[2], rapid_read64(key, p + 8) ^ seed ^ secret[1]);
154
- if (i > 32) {
155
- seed = rapid_mix(rapid_read64(key, p + 16) ^ secret[2], rapid_read64(key, p + 24) ^ seed);
156
- }
157
- }
158
- a = rapid_read64(key, p + i - 16);
159
- b = rapid_read64(key, p + i - 8);
160
- }
161
- a ^= secret[1];
162
- b ^= seed;
163
- return rapidhash_epilogue(a, b, secret[0], secret[1], lenBI);
164
- }
165
- function rapidhash_v1(message, options) {
166
- const { seed, rapidMumBehaviour } = validateOptions(options, RAPID_SEED);
167
- const { rapid_mix, rapidhash_epilogue } = rapidMumImplementations[rapidMumBehaviour];
168
- return rapidhash_v1_internal(toDataView(message), seed, rapid_secret, rapid_mix, rapidhash_epilogue);
169
- }
170
- function rapidhash_v1_fast(message, options) {
171
- const { seed } = validateOptions(options, RAPID_SEED);
172
- return rapidhash_v1_internal(toDataView(message), seed, rapid_secret, rapid_mix_fast, rapidhash_epilogue_fast);
173
- }
174
- function rapidhash_v1_protected(message, options) {
175
- const { seed } = validateOptions(options, RAPID_SEED);
176
- return rapidhash_v1_internal(
177
- toDataView(message),
178
- seed,
179
- rapid_secret,
180
- rapid_mix_protected,
181
- rapidhash_epilogue_protected
182
- );
183
- }
184
-
185
- // src/common_v2.ts
186
- var RAPID_SEED2 = 0n;
187
- var rapid_secret2 = [
188
- 0x2d358dccaa6c78a5n,
189
- 0x8bb84b93962eacc9n,
190
- 0x4b33a62ed433d4a3n,
191
- 0x4d5a2da51de1aa47n,
192
- 0xa0761d6478bd642fn,
193
- 0xe7037ed1a0b428dbn,
194
- 0x90ed1765281c388cn,
195
- 0xaaaaaaaaaaaaaaaan
196
- ];
197
-
198
- // src/rapidhash_v2.0.ts
199
- function rapidhash_v2_0_internal(key, seed, secret, rapid_mix, rapidhash_epilogue) {
200
- const len = key.byteLength;
201
- const lenBI = BigInt(key.byteLength);
202
- seed ^= rapid_mix(seed ^ secret[2], secret[1]) ^ lenBI;
203
- let a;
204
- let b;
205
- if (len <= 16) {
206
- if (len >= 4) {
207
- if (len >= 8) {
208
- const last = len - 8;
209
- a = rapid_read64(key, 0);
210
- b = rapid_read64(key, last);
211
- } else {
212
- const last = len - 4;
213
- a = rapid_read32(key, 0);
214
- b = rapid_read32(key, last);
215
- }
216
- } else if (len > 0) {
217
- a = rapid_readSmall(key, 0, len);
218
- b = 0n;
219
- } else {
220
- a = 0n;
221
- b = 0n;
222
- }
223
- } else if (len > 56) {
224
- let i = len;
225
- let p = 0;
226
- let see1 = seed;
227
- let see2 = seed;
228
- let see3456;
229
- if (i >= 112) {
230
- let see3 = seed;
231
- let see4 = seed;
232
- let see5 = seed;
233
- let see6 = seed;
234
- do {
235
- seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);
236
- see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);
237
- see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);
238
- see3 = rapid_mix(rapid_read64(key, p + 48) ^ secret[3], rapid_read64(key, p + 56) ^ see3);
239
- see4 = rapid_mix(rapid_read64(key, p + 64) ^ secret[4], rapid_read64(key, p + 72) ^ see4);
240
- see5 = rapid_mix(rapid_read64(key, p + 80) ^ secret[5], rapid_read64(key, p + 88) ^ see5);
241
- see6 = rapid_mix(rapid_read64(key, p + 96) ^ secret[6], rapid_read64(key, p + 104) ^ see6);
242
- p += 112;
243
- i -= 112;
244
- } while (i >= 112);
245
- see3456 = see3 ^ see4 ^ see5 ^ see6;
246
- } else {
247
- see3456 = 0n;
248
- }
249
- if (i >= 48) {
250
- seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);
251
- see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);
252
- see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);
253
- p += 48;
254
- i -= 48;
255
- if (i >= 48) {
256
- seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);
257
- see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);
258
- see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);
259
- p += 48;
260
- i -= 48;
261
- }
262
- }
263
- seed ^= see1 ^ see2 ^ see3456;
264
- if (i > 16) {
265
- seed = rapid_mix(rapid_read64(key, p) ^ secret[2], rapid_read64(key, p + 8) ^ seed);
266
- if (i > 32) {
267
- seed = rapid_mix(rapid_read64(key, p + 16) ^ secret[2], rapid_read64(key, p + 24) ^ seed);
268
- }
269
- }
270
- a = rapid_read64(key, p + i - 16);
271
- b = rapid_read64(key, p + i - 8);
272
- } else {
273
- seed = rapid_mix(rapid_read64(key, 0) ^ secret[0], rapid_read64(key, 8) ^ seed);
274
- if (len > 32) {
275
- seed = rapid_mix(rapid_read64(key, 16) ^ secret[1], rapid_read64(key, 24) ^ seed);
276
- if (len > 48) {
277
- seed = rapid_mix(rapid_read64(key, 32) ^ secret[0], rapid_read64(key, 40) ^ seed);
278
- }
279
- }
280
- a = rapid_read64(key, len - 16);
281
- b = rapid_read64(key, len - 8);
282
- }
283
- a ^= secret[1];
284
- b ^= seed;
285
- return rapidhash_epilogue(a, b, secret[7], secret[1], lenBI);
286
- }
287
- function rapidhash_v2_0(message, options) {
288
- const { seed, rapidMumBehaviour } = validateOptions(options, RAPID_SEED2);
289
- const { rapid_mix, rapidhash_epilogue } = rapidMumImplementations[rapidMumBehaviour];
290
- return rapidhash_v2_0_internal(toDataView(message), seed, rapid_secret2, rapid_mix, rapidhash_epilogue);
291
- }
292
- function rapidhash_v2_0_fast(message, options) {
293
- const { seed } = validateOptions(options, RAPID_SEED2);
294
- return rapidhash_v2_0_internal(toDataView(message), seed, rapid_secret2, rapid_mix_fast, rapidhash_epilogue_fast);
295
- }
296
- function rapidhash_v2_0_protected(message, options) {
297
- const { seed } = validateOptions(options, RAPID_SEED2);
298
- return rapidhash_v2_0_internal(
299
- toDataView(message),
300
- seed,
301
- rapid_secret2,
302
- rapid_mix_protected,
303
- rapidhash_epilogue_protected
304
- );
305
- }
306
-
307
- // src/rapidhash_v2.2.ts
308
- function rapidhash_v2_2_internal(key, seed, secret, rapid_mix, rapidhash_epilogue) {
309
- const len = key.byteLength;
310
- const lenBI = BigInt(key.byteLength);
311
- seed ^= rapid_mix(seed ^ secret[2], secret[1]) ^ lenBI;
312
- let a;
313
- let b;
314
- if (len <= 16) {
315
- if (len >= 4) {
316
- if (len >= 8) {
317
- const last = len - 8;
318
- a = rapid_read64(key, 0);
319
- b = rapid_read64(key, last);
320
- } else {
321
- const last = len - 4;
322
- a = rapid_read32(key, 0);
323
- b = rapid_read32(key, last);
324
- }
325
- } else if (len > 0) {
326
- a = rapid_readBytes(key, 0, len - 1);
327
- b = BigInt(key.getUint8(len >> 1));
328
- } else {
329
- a = 0n;
330
- b = 0n;
331
- }
332
- } else if (len <= 64) {
333
- seed = rapid_mix(rapid_read64(key, 0) ^ secret[0], rapid_read64(key, 8) ^ seed);
334
- if (len > 32) {
335
- seed = rapid_mix(rapid_read64(key, 16) ^ secret[1], rapid_read64(key, 24) ^ seed);
336
- if (len > 48) {
337
- seed = rapid_mix(rapid_read64(key, 32) ^ secret[1], rapid_read64(key, 40) ^ seed);
338
- }
339
- }
340
- a = rapid_read64(key, len - 16);
341
- b = rapid_read64(key, len - 8);
342
- } else {
343
- let i = len;
344
- let p = 0;
345
- let see1 = seed;
346
- let see2 = seed;
347
- let see3456;
348
- if (i >= 112) {
349
- let see3 = seed;
350
- let see4 = seed;
351
- let see5 = seed;
352
- let see6 = seed;
353
- do {
354
- seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);
355
- see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);
356
- see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);
357
- see3 = rapid_mix(rapid_read64(key, p + 48) ^ secret[3], rapid_read64(key, p + 56) ^ see3);
358
- see4 = rapid_mix(rapid_read64(key, p + 64) ^ secret[4], rapid_read64(key, p + 72) ^ see4);
359
- see5 = rapid_mix(rapid_read64(key, p + 80) ^ secret[5], rapid_read64(key, p + 88) ^ see5);
360
- see6 = rapid_mix(rapid_read64(key, p + 96) ^ secret[6], rapid_read64(key, p + 104) ^ see6);
361
- p += 112;
362
- i -= 112;
363
- } while (i >= 112);
364
- see3456 = see3 ^ see4 ^ see5 ^ see6;
365
- } else {
366
- see3456 = 0n;
367
- }
368
- if (i >= 48) {
369
- seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);
370
- see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);
371
- see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);
372
- p += 48;
373
- i -= 48;
374
- if (i >= 48) {
375
- seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);
376
- see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);
377
- see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);
378
- p += 48;
379
- i -= 48;
380
- }
381
- }
382
- seed ^= see1 ^ see2 ^ see3456;
383
- if (i > 16) {
384
- seed = rapid_mix(rapid_read64(key, p) ^ secret[2], rapid_read64(key, p + 8) ^ seed);
385
- if (i > 32) {
386
- seed = rapid_mix(rapid_read64(key, p + 16) ^ secret[2], rapid_read64(key, p + 24) ^ seed);
387
- }
388
- }
389
- a = rapid_read64(key, p + i - 16);
390
- b = rapid_read64(key, p + i - 8);
391
- }
392
- a ^= secret[1];
393
- b ^= seed;
394
- return rapidhash_epilogue(a, b, secret[7], secret[1], lenBI);
395
- }
396
- function rapidhash_v2_2(message, options) {
397
- const { seed, rapidMumBehaviour } = validateOptions(options, RAPID_SEED2);
398
- const { rapid_mix, rapidhash_epilogue } = rapidMumImplementations[rapidMumBehaviour];
399
- return rapidhash_v2_2_internal(toDataView(message), seed, rapid_secret2, rapid_mix, rapidhash_epilogue);
400
- }
401
- function rapidhash_v2_2_fast(message, options) {
402
- const { seed } = validateOptions(options, RAPID_SEED2);
403
- return rapidhash_v2_2_internal(toDataView(message), seed, rapid_secret2, rapid_mix_fast, rapidhash_epilogue_fast);
404
- }
405
- function rapidhash_v2_2_protected(message, options) {
406
- const { seed } = validateOptions(options, RAPID_SEED2);
407
- return rapidhash_v2_2_internal(
408
- toDataView(message),
409
- seed,
410
- rapid_secret2,
411
- rapid_mix_protected,
412
- rapidhash_epilogue_protected
413
- );
414
- }
415
- export {
416
- rapidhash_v2_2 as rapidhash,
417
- rapidhash_v2_2_fast as rapidhash_fast,
418
- rapidhash_v2_2_protected as rapidhash_protected,
419
- rapidhash_v1,
420
- rapidhash_v1_fast,
421
- rapidhash_v1_protected,
422
- rapidhash_v2_0,
423
- rapidhash_v2_0_fast,
424
- rapidhash_v2_0_protected,
425
- rapidhash_v2_2,
426
- rapidhash_v2_2_fast,
427
- rapidhash_v2_2_protected
428
- };
429
- //# sourceMappingURL=index.mjs.map
1
+ export { s as rapidhash, i as rapidhashMicro, a as rapidhashMicro_fast, o as rapidhashMicro_protected, t as rapidhashNano, n as rapidhashNano_fast, r as rapidhashNano_protected, c as rapidhash_fast, l as rapidhash_protected } from "./v3.0.mjs";
@@ -0,0 +1,30 @@
1
+ import { t as RapidhashOptions } from "../common.mjs";
2
+ /**
3
+ * Calculate a 64-bit hash value of the given message.
4
+ *
5
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
6
+ * @param options Options for modifying the hash calculation.
7
+ * @param options.seed {bigint} 64-bit unsigned seed value.
8
+ * @param options.rapidMumBehaviour {'fast'|'protected'} Alters behaviour of the rapid_mum function. Defaults to 'fast'.
9
+ */
10
+ declare function rapidhash_v1(message: string | Uint8Array | DataView, options?: Partial<RapidhashOptions>): bigint;
11
+ /**
12
+ * Calculate a 64-bit hash value of the given message.
13
+ * This function is equivalent to rapidhash() with options.rapidMumBehaviour set to 'fast'.
14
+ *
15
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
16
+ * @param options Options for modifying the hash calculation.
17
+ * @param options.seed {bigint} 64-bit unsigned seed value.
18
+ */
19
+ declare function rapidhash_v1_fast(message: string | Uint8Array | DataView, options?: Partial<Omit<RapidhashOptions, 'rapidMumBehaviour'>>): bigint;
20
+ /**
21
+ * Calculate a 64-bit hash value of the given message.
22
+ * This function is equivalent to rapidhash() with options.rapidMumBehaviour set to 'protected'.
23
+ *
24
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
25
+ * @param options Options for modifying the hash calculation.
26
+ * @param options.seed {bigint} 64-bit unsigned seed value.
27
+ */
28
+ declare function rapidhash_v1_protected(message: string | Uint8Array | DataView, options?: Partial<Omit<RapidhashOptions, 'rapidMumBehaviour'>>): bigint;
29
+ export { rapidhash_v1 as rapidhash, rapidhash_v1_fast as rapidhash_fast, rapidhash_v1_protected as rapidhash_protected };
30
+ //# sourceMappingURL=index.d.mts.map
@@ -0,0 +1,30 @@
1
+ import { t as RapidhashOptions } from "../common.js";
2
+ /**
3
+ * Calculate a 64-bit hash value of the given message.
4
+ *
5
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
6
+ * @param options Options for modifying the hash calculation.
7
+ * @param options.seed {bigint} 64-bit unsigned seed value.
8
+ * @param options.rapidMumBehaviour {'fast'|'protected'} Alters behaviour of the rapid_mum function. Defaults to 'fast'.
9
+ */
10
+ declare function rapidhash_v1(message: string | Uint8Array | DataView, options?: Partial<RapidhashOptions>): bigint;
11
+ /**
12
+ * Calculate a 64-bit hash value of the given message.
13
+ * This function is equivalent to rapidhash() with options.rapidMumBehaviour set to 'fast'.
14
+ *
15
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
16
+ * @param options Options for modifying the hash calculation.
17
+ * @param options.seed {bigint} 64-bit unsigned seed value.
18
+ */
19
+ declare function rapidhash_v1_fast(message: string | Uint8Array | DataView, options?: Partial<Omit<RapidhashOptions, 'rapidMumBehaviour'>>): bigint;
20
+ /**
21
+ * Calculate a 64-bit hash value of the given message.
22
+ * This function is equivalent to rapidhash() with options.rapidMumBehaviour set to 'protected'.
23
+ *
24
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
25
+ * @param options Options for modifying the hash calculation.
26
+ * @param options.seed {bigint} 64-bit unsigned seed value.
27
+ */
28
+ declare function rapidhash_v1_protected(message: string | Uint8Array | DataView, options?: Partial<Omit<RapidhashOptions, 'rapidMumBehaviour'>>): bigint;
29
+ export { rapidhash_v1 as rapidhash, rapidhash_v1_fast as rapidhash_fast, rapidhash_v1_protected as rapidhash_protected };
30
+ //# sourceMappingURL=index.d.ts.map
@@ -0,0 +1,106 @@
1
+ Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
2
+ const require_common = require("../common.js");
3
+ // src/v1.0/rapidhash_v1.0.ts
4
+ const RAPID_SEED = 13679853920966426665n;
5
+ const rapid_secret = [
6
+ 3257665815644502181n,
7
+ 10067880064238660809n,
8
+ 5418857496715711651n
9
+ ];
10
+ function rapidhash_v1_internal(key, seed, secret, rapid_mix, rapidhash_epilogue) {
11
+ const len = key.byteLength;
12
+ const lenBI = BigInt(key.byteLength);
13
+ seed ^= rapid_mix(seed ^ secret[0], secret[1]) ^ lenBI;
14
+ let a;
15
+ let b;
16
+ if (len <= 16) {
17
+ if (len >= 4) {
18
+ const last = len - 4;
19
+ a = require_common.rapid_read32x2(key, 0, last);
20
+ const delta = (len & 24) >> (len >> 3);
21
+ b = require_common.rapid_read32x2(key, delta, last - delta);
22
+ } else if (len > 0) {
23
+ a = require_common.rapid_readSmall(key, 0, len);
24
+ b = 0n;
25
+ } else {
26
+ a = 0n;
27
+ b = 0n;
28
+ }
29
+ } else {
30
+ let i = len;
31
+ let p = 0;
32
+ if (i > 48) {
33
+ let see1 = seed;
34
+ let see2 = seed;
35
+ while (i >= 96) {
36
+ seed = rapid_mix(require_common.rapid_read64(key, p) ^ secret[0], require_common.rapid_read64(key, p + 8) ^ seed);
37
+ see1 = rapid_mix(require_common.rapid_read64(key, p + 16) ^ secret[1], require_common.rapid_read64(key, p + 24) ^ see1);
38
+ see2 = rapid_mix(require_common.rapid_read64(key, p + 32) ^ secret[2], require_common.rapid_read64(key, p + 40) ^ see2);
39
+ seed = rapid_mix(require_common.rapid_read64(key, p + 48) ^ secret[0], require_common.rapid_read64(key, p + 56) ^ seed);
40
+ see1 = rapid_mix(require_common.rapid_read64(key, p + 64) ^ secret[1], require_common.rapid_read64(key, p + 72) ^ see1);
41
+ see2 = rapid_mix(require_common.rapid_read64(key, p + 80) ^ secret[2], require_common.rapid_read64(key, p + 88) ^ see2);
42
+ p += 96;
43
+ i -= 96;
44
+ }
45
+ if (i >= 48) {
46
+ seed = rapid_mix(require_common.rapid_read64(key, p) ^ secret[0], require_common.rapid_read64(key, p + 8) ^ seed);
47
+ see1 = rapid_mix(require_common.rapid_read64(key, p + 16) ^ secret[1], require_common.rapid_read64(key, p + 24) ^ see1);
48
+ see2 = rapid_mix(require_common.rapid_read64(key, p + 32) ^ secret[2], require_common.rapid_read64(key, p + 40) ^ see2);
49
+ p += 48;
50
+ i -= 48;
51
+ }
52
+ seed ^= see1 ^ see2;
53
+ }
54
+ if (i > 16) {
55
+ seed = rapid_mix(require_common.rapid_read64(key, p) ^ secret[2], require_common.rapid_read64(key, p + 8) ^ seed ^ secret[1]);
56
+ if (i > 32) seed = rapid_mix(require_common.rapid_read64(key, p + 16) ^ secret[2], require_common.rapid_read64(key, p + 24) ^ seed);
57
+ }
58
+ a = require_common.rapid_read64(key, p + i - 16);
59
+ b = require_common.rapid_read64(key, p + i - 8);
60
+ }
61
+ a ^= secret[1];
62
+ b ^= seed;
63
+ return rapidhash_epilogue(a, b, secret[0], secret[1], lenBI);
64
+ }
65
+ /**
66
+ * Calculate a 64-bit hash value of the given message.
67
+ *
68
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
69
+ * @param options Options for modifying the hash calculation.
70
+ * @param options.seed {bigint} 64-bit unsigned seed value.
71
+ * @param options.rapidMumBehaviour {'fast'|'protected'} Alters behaviour of the rapid_mum function. Defaults to 'fast'.
72
+ */
73
+ function rapidhash_v1(message, options) {
74
+ const { seed, rapidMumBehaviour } = require_common.validateOptions(options, RAPID_SEED);
75
+ const { rapid_mix, rapidhash_epilogue } = require_common.rapidMumImplementations[rapidMumBehaviour];
76
+ return rapidhash_v1_internal(require_common.toDataView(message), seed, rapid_secret, rapid_mix, rapidhash_epilogue);
77
+ }
78
+ /**
79
+ * Calculate a 64-bit hash value of the given message.
80
+ * This function is equivalent to rapidhash() with options.rapidMumBehaviour set to 'fast'.
81
+ *
82
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
83
+ * @param options Options for modifying the hash calculation.
84
+ * @param options.seed {bigint} 64-bit unsigned seed value.
85
+ */
86
+ function rapidhash_v1_fast(message, options) {
87
+ const { seed } = require_common.validateOptions(options, RAPID_SEED);
88
+ return rapidhash_v1_internal(require_common.toDataView(message), seed, rapid_secret, require_common.rapid_mix_fast, require_common.rapidhash_epilogue_fast);
89
+ }
90
+ /**
91
+ * Calculate a 64-bit hash value of the given message.
92
+ * This function is equivalent to rapidhash() with options.rapidMumBehaviour set to 'protected'.
93
+ *
94
+ * @param message {string|Uint8Array|DataView} The message to be hashed.
95
+ * @param options Options for modifying the hash calculation.
96
+ * @param options.seed {bigint} 64-bit unsigned seed value.
97
+ */
98
+ function rapidhash_v1_protected(message, options) {
99
+ const { seed } = require_common.validateOptions(options, RAPID_SEED);
100
+ return rapidhash_v1_internal(require_common.toDataView(message), seed, rapid_secret, require_common.rapid_mix_protected, require_common.rapidhash_epilogue_protected);
101
+ }
102
+ exports.rapidhash = rapidhash_v1;
103
+ exports.rapidhash_fast = rapidhash_v1_fast;
104
+ exports.rapidhash_protected = rapidhash_v1_protected;
105
+
106
+ //# sourceMappingURL=index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","names":["rapid_read32x2","rapid_readSmall","rapid_read64","validateOptions","rapidMumImplementations","toDataView","rapid_mix_fast","rapidhash_epilogue_fast","rapid_mix_protected","rapidhash_epilogue_protected"],"sources":["../../src/v1.0/rapidhash_v1.0.ts"],"sourcesContent":["import {\n type RapidhashEpilogue,\n type RapidhashOptions,\n type RapidMix,\n rapid_mix_fast,\n rapid_mix_protected,\n rapid_read32x2,\n rapid_read64,\n rapid_readSmall,\n rapidhash_epilogue_fast,\n rapidhash_epilogue_protected,\n rapidMumImplementations,\n toDataView,\n validateOptions,\n} from '../common';\n\ntype RapidSecret = [bigint, bigint, bigint];\n\nconst RAPID_SEED = 0xbdd89aa982704029n;\nconst rapid_secret: RapidSecret = [0x2d358dccaa6c78a5n, 0x8bb84b93962eacc9n, 0x4b33a62ed433d4a3n];\n\n// ---\n\nfunction rapidhash_v1_internal(\n key: DataView,\n seed: bigint,\n secret: RapidSecret,\n rapid_mix: RapidMix,\n rapidhash_epilogue: RapidhashEpilogue,\n): bigint {\n const len = key.byteLength;\n const lenBI = BigInt(key.byteLength);\n\n seed ^= rapid_mix(seed ^ secret[0], secret[1]) ^ lenBI;\n\n let a: bigint;\n let b: bigint;\n\n if (len <= 16) {\n if (len >= 4) {\n const last = len - 4;\n a = rapid_read32x2(key, 0, last);\n const delta = (len & 24) >> (len >> 3);\n b = rapid_read32x2(key, delta, last - delta);\n } else if (len > 0) {\n a = rapid_readSmall(key, 0, len);\n b = 0n;\n } else {\n a = 0n;\n b = 0n;\n }\n } else {\n let i = len;\n let p = 0;\n\n if (i > 48) {\n let see1 = seed;\n let see2 = seed;\n\n while (i >= 96) {\n seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);\n see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);\n see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);\n seed = rapid_mix(rapid_read64(key, p + 48) ^ secret[0], rapid_read64(key, p + 56) ^ seed);\n see1 = rapid_mix(rapid_read64(key, p + 64) ^ secret[1], rapid_read64(key, p + 72) ^ see1);\n see2 = rapid_mix(rapid_read64(key, p + 80) ^ secret[2], rapid_read64(key, p + 88) ^ see2);\n p += 96;\n i -= 96;\n }\n if (i >= 48) {\n seed = rapid_mix(rapid_read64(key, p) ^ secret[0], rapid_read64(key, p + 8) ^ seed);\n see1 = rapid_mix(rapid_read64(key, p + 16) ^ secret[1], rapid_read64(key, p + 24) ^ see1);\n see2 = rapid_mix(rapid_read64(key, p + 32) ^ secret[2], rapid_read64(key, p + 40) ^ see2);\n p += 48;\n i -= 48;\n }\n\n seed ^= see1 ^ see2;\n }\n\n if (i > 16) {\n seed = rapid_mix(rapid_read64(key, p) ^ secret[2], rapid_read64(key, p + 8) ^ seed ^ secret[1]);\n if (i > 32) {\n seed = rapid_mix(rapid_read64(key, p + 16) ^ secret[2], rapid_read64(key, p + 24) ^ seed);\n }\n }\n a = rapid_read64(key, p + i - 16);\n b = rapid_read64(key, p + i - 8);\n }\n a ^= secret[1];\n b ^= seed;\n\n return rapidhash_epilogue(a, b, secret[0], secret[1], lenBI);\n}\n\n// ---\n\n/**\n * Calculate a 64-bit hash value of the given message.\n *\n * @param message {string|Uint8Array|DataView} The message to be hashed.\n * @param options Options for modifying the hash calculation.\n * @param options.seed {bigint} 64-bit unsigned seed value.\n * @param options.rapidMumBehaviour {'fast'|'protected'} Alters behaviour of the rapid_mum function. Defaults to 'fast'.\n */\nexport function rapidhash_v1(message: string | Uint8Array | DataView, options?: Partial<RapidhashOptions>): bigint {\n const {seed, rapidMumBehaviour} = validateOptions(options, RAPID_SEED);\n const {rapid_mix, rapidhash_epilogue} = rapidMumImplementations[rapidMumBehaviour];\n\n return rapidhash_v1_internal(toDataView(message), seed, rapid_secret, rapid_mix, rapidhash_epilogue);\n}\n\n/**\n * Calculate a 64-bit hash value of the given message.\n * This function is equivalent to rapidhash() with options.rapidMumBehaviour set to 'fast'.\n *\n * @param message {string|Uint8Array|DataView} The message to be hashed.\n * @param options Options for modifying the hash calculation.\n * @param options.seed {bigint} 64-bit unsigned seed value.\n */\nexport function rapidhash_v1_fast(\n message: string | Uint8Array | DataView,\n options?: Partial<Omit<RapidhashOptions, 'rapidMumBehaviour'>>,\n): bigint {\n const {seed} = validateOptions(options, RAPID_SEED);\n\n return rapidhash_v1_internal(toDataView(message), seed, rapid_secret, rapid_mix_fast, rapidhash_epilogue_fast);\n}\n\n/**\n * Calculate a 64-bit hash value of the given message.\n * This function is equivalent to rapidhash() with options.rapidMumBehaviour set to 'protected'.\n *\n * @param message {string|Uint8Array|DataView} The message to be hashed.\n * @param options Options for modifying the hash calculation.\n * @param options.seed {bigint} 64-bit unsigned seed value.\n */\nexport function rapidhash_v1_protected(\n message: string | Uint8Array | DataView,\n options?: Partial<Omit<RapidhashOptions, 'rapidMumBehaviour'>>,\n): bigint {\n const {seed} = validateOptions(options, RAPID_SEED);\n\n return rapidhash_v1_internal(\n toDataView(message),\n seed,\n rapid_secret,\n rapid_mix_protected,\n rapidhash_epilogue_protected,\n );\n}\n"],"mappings":";;;AAkBA,MAAM,aAAa;AACnB,MAAM,eAA4B;CAAC;CAAqB;CAAqB;AAAmB;AAIhG,SAAS,sBACP,KACA,MACA,QACA,WACA,oBACQ;CACR,MAAM,MAAM,IAAI;CAChB,MAAM,QAAQ,OAAO,IAAI,UAAU;CAEnC,QAAQ,UAAU,OAAO,OAAO,IAAI,OAAO,EAAE,IAAI;CAEjD,IAAI;CACJ,IAAI;CAEJ,IAAI,OAAO,IAAI;EACb,IAAI,OAAO,GAAG;GACZ,MAAM,OAAO,MAAM;GACnB,IAAIA,eAAAA,eAAe,KAAK,GAAG,IAAI;GAC/B,MAAM,SAAS,MAAM,QAAQ,OAAO;GACpC,IAAIA,eAAAA,eAAe,KAAK,OAAO,OAAO,KAAK;EAC7C,OAAO,IAAI,MAAM,GAAG;GAClB,IAAIC,eAAAA,gBAAgB,KAAK,GAAG,GAAG;GAC/B,IAAI;EACN,OAAO;GACL,IAAI;GACJ,IAAI;EACN;CACF,OAAO;EACL,IAAI,IAAI;EACR,IAAI,IAAI;EAER,IAAI,IAAI,IAAI;GACV,IAAI,OAAO;GACX,IAAI,OAAO;GAEX,OAAO,KAAK,IAAI;IACd,OAAO,UAAUC,eAAAA,aAAa,KAAK,CAAC,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,CAAC,IAAI,IAAI;IAClF,OAAO,UAAUA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,IAAI;IACxF,OAAO,UAAUA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,IAAI;IACxF,OAAO,UAAUA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,IAAI;IACxF,OAAO,UAAUA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,IAAI;IACxF,OAAO,UAAUA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,IAAI;IACxF,KAAK;IACL,KAAK;GACP;GACA,IAAI,KAAK,IAAI;IACX,OAAO,UAAUA,eAAAA,aAAa,KAAK,CAAC,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,CAAC,IAAI,IAAI;IAClF,OAAO,UAAUA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,IAAI;IACxF,OAAO,UAAUA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,IAAI;IACxF,KAAK;IACL,KAAK;GACP;GAEA,QAAQ,OAAO;EACjB;EAEA,IAAI,IAAI,IAAI;GACV,OAAO,UAAUA,eAAAA,aAAa,KAAK,CAAC,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,CAAC,IAAI,OAAO,OAAO,EAAE;GAC9F,IAAI,IAAI,IACN,OAAO,UAAUA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,OAAO,IAAIA,eAAAA,aAAa,KAAK,IAAI,EAAE,IAAI,IAAI;EAE5F;EACA,IAAIA,eAAAA,aAAa,KAAK,IAAI,IAAI,EAAE;EAChC,IAAIA,eAAAA,aAAa,KAAK,IAAI,IAAI,CAAC;CACjC;CACA,KAAK,OAAO;CACZ,KAAK;CAEL,OAAO,mBAAmB,GAAG,GAAG,OAAO,IAAI,OAAO,IAAI,KAAK;AAC7D;;;;;;;;;AAYA,SAAgB,aAAa,SAAyC,SAA6C;CACjH,MAAM,EAAC,MAAM,sBAAqBC,eAAAA,gBAAgB,SAAS,UAAU;CACrE,MAAM,EAAC,WAAW,uBAAsBC,eAAAA,wBAAwB;CAEhE,OAAO,sBAAsBC,eAAAA,WAAW,OAAO,GAAG,MAAM,cAAc,WAAW,kBAAkB;AACrG;;;;;;;;;AAUA,SAAgB,kBACd,SACA,SACQ;CACR,MAAM,EAAC,SAAQF,eAAAA,gBAAgB,SAAS,UAAU;CAElD,OAAO,sBAAsBE,eAAAA,WAAW,OAAO,GAAG,MAAM,cAAcC,eAAAA,gBAAgBC,eAAAA,uBAAuB;AAC/G;;;;;;;;;AAUA,SAAgB,uBACd,SACA,SACQ;CACR,MAAM,EAAC,SAAQJ,eAAAA,gBAAgB,SAAS,UAAU;CAElD,OAAO,sBACLE,eAAAA,WAAW,OAAO,GAClB,MACA,cACAG,eAAAA,qBACAC,eAAAA,4BACF;AACF"}