Skipped 1 file(s) >100MB (GitHub limit): source/__polyfill/05xxx/module_5021.js (118.4 MB)
81 lines
2 KiB
TypeScript
81 lines
2 KiB
TypeScript
// Module ID: 16375
|
|
// Function ID: 16376
|
|
// Name: VibegrationsSubagentMarks
|
|
// Dependencies: [3715, 1115, 2]
|
|
// Exports: assignSubagentMarkKeys, isVibegrationsSubagentMarkKey, subagentMarkName
|
|
|
|
// Module 16375 (VibegrationsSubagentMarks)
|
|
import util from "util" /* 1115 */;
|
|
import _modDef3715 from "module_3715" /* 3715 */;
|
|
import size from "module_2" /* 2 */;
|
|
|
|
const items = ["snail", "goat", "frog", "bunny", "cat", "caterpillar", "butterfly", "dog", "spider", "bee", "bot"];
|
|
const dependencyMap = {
|
|
snail() {
|
|
return _modDef3715["2l3AEQ"];
|
|
},
|
|
goat() {
|
|
return _modDef3715["+FPL+I"];
|
|
},
|
|
frog() {
|
|
return _modDef3715.w4GOfR;
|
|
},
|
|
bunny() {
|
|
return _modDef3715.XmZT9M;
|
|
},
|
|
cat() {
|
|
return _modDef3715.NnydwQ;
|
|
},
|
|
caterpillar() {
|
|
return _modDef3715["4iXcNT"];
|
|
},
|
|
butterfly() {
|
|
return _modDef3715.DoTGt5;
|
|
},
|
|
dog() {
|
|
return _modDef3715["9zxqmP"];
|
|
},
|
|
spider() {
|
|
return _modDef3715.HF0T3L;
|
|
},
|
|
bee() {
|
|
return _modDef3715.XTzDga;
|
|
},
|
|
bot() {
|
|
return _modDef3715.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 = util.intl;
|
|
return intl.string(dependencyMap[helperMark]());
|
|
};
|
|
export const assignSubagentMarkKeys = function assignSubagentMarkKeys(arr) {
|
|
let length = items;
|
|
c1 = 0;
|
|
let str = arr[0];
|
|
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);
|
|
}
|
|
const map = new Map();
|
|
const item = arr.forEach((item, index) => {
|
|
const result = map.set(item, length[(c1 + index) % length.length]);
|
|
});
|
|
return map;
|
|
};
|