EYHN
2024-01-30 06:31:13 +00:00
parent c9f8e49f75
commit 48eb6c50e1
13 changed files with 1357 additions and 0 deletions

View File

@@ -0,0 +1,59 @@
// copied from https://github.com/shuding/stable-hash
// Use WeakMap to store the object-key mapping so the objects can still be
// garbage collected. WeakMap uses a hashtable under the hood, so the lookup
// complexity is almost O(1).
const table = new WeakMap<object, string>();
// A counter of the key.
let counter = 0;
// A stable hash implementation that supports:
// - Fast and ensures unique hash properties
// - Handles unserializable values
// - Handles object key ordering
// - Generates short results
//
// This is not a serialization function, and the result is not guaranteed to be
// parsable.
export function stableHash(arg: any): string {
const type = typeof arg;
const constructor = arg && arg.constructor;
const isDate = constructor === Date;
if (Object(arg) === arg && !isDate && constructor !== RegExp) {
// Object/function, not null/date/regexp. Use WeakMap to store the id first.
// If it's already hashed, directly return the result.
let result = table.get(arg);
if (result) return result;
// Store the hash first for circular reference detection before entering the
// recursive `stableHash` calls.
// For other objects like set and map, we use this id directly as the hash.
result = ++counter + '~';
table.set(arg, result);
let index: any;
if (constructor === Array) {
// Array.
result = '@';
for (index = 0; index < arg.length; index++) {
result += stableHash(arg[index]) + ',';
}
table.set(arg, result);
} else if (constructor === Object) {
// Object, sort keys.
result = '#';
const keys = Object.keys(arg).sort();
while ((index = keys.pop() as string) !== undefined) {
if (arg[index] !== undefined) {
result += index + ':' + stableHash(arg[index]) + ',';
}
}
table.set(arg, result);
}
return result;
}
if (isDate) return arg.toJSON();
if (type === 'symbol') return arg.toString();
return type === 'string' ? JSON.stringify(arg) : '' + arg;
}