85 lines
2.1 KiB
TypeScript
85 lines
2.1 KiB
TypeScript
// Module ID: 16377
|
|
// Function ID: 16378
|
|
// Name: VibegrationsSubagentMarks
|
|
// Dependencies: [3718, 1127, 2]
|
|
// Exports: assignSubagentMarkKeys, isVibegrationsSubagentMarkKey, subagentMarkName
|
|
|
|
// Module 16377 (VibegrationsSubagentMarks)
|
|
import intl2 from "intl" /* 1127 */;
|
|
import _modDef3718 from "module_3718" /* 3718 */;
|
|
import size from "module_2" /* 2 */;
|
|
|
|
let map;
|
|
|
|
const items = ["snail", "goat", "frog", "bunny", "cat", "caterpillar", "butterfly", "dog", "spider", "bee", "bot"];
|
|
let closure_4 = {
|
|
snail() {
|
|
return _modDef3718["2l3AEQ"];
|
|
},
|
|
goat() {
|
|
return _modDef3718["+FPL+I"];
|
|
},
|
|
frog() {
|
|
return _modDef3718.w4GOfR;
|
|
},
|
|
bunny() {
|
|
return _modDef3718.XmZT9M;
|
|
},
|
|
cat() {
|
|
return _modDef3718.NnydwQ;
|
|
},
|
|
caterpillar() {
|
|
return _modDef3718["4iXcNT"];
|
|
},
|
|
butterfly() {
|
|
return _modDef3718.DoTGt5;
|
|
},
|
|
dog() {
|
|
return _modDef3718["9zxqmP"];
|
|
},
|
|
spider() {
|
|
return _modDef3718.HF0T3L;
|
|
},
|
|
bee() {
|
|
return _modDef3718.XTzDga;
|
|
},
|
|
bot() {
|
|
return _modDef3718.abtC2b;
|
|
}
|
|
};
|
|
let result = size.fileFinishedImporting("modules/vibegrations/lib/VibegrationsSubagentMarks.tsx");
|
|
|
|
export const VIBEGRATIONS_SUBAGENT_MARK_KEYS = items;
|
|
export const isVibegrationsSubagentMarkKey = function isVibegrationsSubagentMarkKey(helperMark) {
|
|
return items.includes(helperMark);
|
|
};
|
|
export const subagentMarkName = function subagentMarkName(helperMark) {
|
|
const intl = intl2.intl;
|
|
return intl.string(closure_4[helperMark]());
|
|
};
|
|
export const assignSubagentMarkKeys = function assignSubagentMarkKeys(arr) {
|
|
let length;
|
|
let closure_0 = items;
|
|
let c1 = 0;
|
|
let str = arr[0];
|
|
arr = items;
|
|
if (str == null) {
|
|
str = "";
|
|
}
|
|
let num = 0;
|
|
let num2 = 0;
|
|
if (0 < str.length) {
|
|
do {
|
|
let result = (31 * num2 + str.charCodeAt(num)) % arr.length;
|
|
c1 = result;
|
|
num = num + 1;
|
|
num2 = result;
|
|
length = str.length;
|
|
} while (num < length);
|
|
}
|
|
map = new Map();
|
|
const item = arr.forEach((item, index) => {
|
|
const result = map.set(item, length[(c1 + index) % length.length]);
|
|
});
|
|
return map;
|
|
};
|