[{"_1":2,"_171":-5,"_172":-5},"loaderData",{"_3":4,"_92":93},"root",{"_5":6,"_35":36,"_65":66},"ctx",{"_7":8,"_23":-5,"_24":25,"_26":27,"_28":20,"_29":20,"_30":20,"_31":32,"_33":20,"_34":20},"auth",{"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5,"_19":20,"_21":22},"sessionClaims","sessionId","sessionStatus","userId","actor","orgId","orgRole","orgSlug","orgPermissions","factorVerificationAge","isAuthenticated",false,"tokenType","session_token","user","preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","notificationCount",0,"flagDenols","isTeamOrgMember","ENV",{"_37":38,"_39":40,"_41":42,"_43":44,"_45":46,"_47":48,"_49":50,"_51":52,"_53":54,"_55":56,"_57":58,"_59":60,"_61":62,"_63":64},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","VAL_RUNTIME_NAME","prod","RENDER_GIT_COMMIT","dc548fcd12b3326c19c6514669630405c66f7ccb","RENDER_GIT_BRANCH","main","CLERK_PUBLISHABLE_KEY","pk_live_Y2xlcmsudmFsLnRvd24k","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","API_URL","https://api.val.town","clerkState",{"_67":68},"__internal_clerk_state",{"_69":70,"_71":46,"_72":73,"_74":73,"_75":20,"_76":73,"_77":73,"_78":73,"_79":73,"_80":81,"_90":20,"_91":20},"__clerk_ssr_state",{"_21":22,"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5,"_19":20},"__publishableKey","__proxyUrl","","__domain","__isSatellite","__signInUrl","__signUpUrl","__afterSignInUrl","__afterSignUpUrl","__clerk_debug",{"_82":20,"_19":20,"_83":73,"_84":85,"_86":73,"_87":46,"_88":20,"_89":73},"isSignedIn","proxyUrl","reason","session-token-and-uat-missing","message","publishableKey","isSatellite","domain","__telemetryDisabled","__telemetryDebug","routes/embed.x.$handle.$name.$",{"_94":95,"_96":97,"_98":99,"_100":101,"_148":149,"_168":169,"_170":-5},"handle","agariolove","name","legendmod","path","lz4.ts","project",{"_102":103,"_96":97,"_104":105,"_106":-5,"_107":20,"_108":109,"_110":-5,"_111":-5,"_12":112,"_113":-5,"_114":20,"_115":-5,"_116":-5,"_117":32,"_14":118,"_119":120,"_121":120,"_122":123,"_124":123,"_125":123,"_126":120,"_127":120,"_23":128,"_131":132,"_134":135,"_147":20},"id","ca57d36a-efbd-11f0-b9de-42dde27851f2","createdAt",["D",1768225887106],"deletedAt","legacyEnvVars","privacy","public","description","imageUrl","019bb279-9ea8-77bf-8a8c-390256196f3e","pinnedFileId","pinPreview","pinMigrated","screenshotVersion","likeCount","019bb279-9ea8-77bf-8a8c-3f3f51d5ed48","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm",{"_94":95,"_129":130},"profileImageUrl","https://img.clerk.com/eyJ0eXBlIjoicHJveHkiLCJzcmMiOiJodHRwczovL2ltYWdlcy5jbGVyay5kZXYvb2F1dGhfZ2l0aHViL2ltZ18zODl5MHhjbGFyU2RpQkxjODRuMW1DQTJIeGwifQ","org",{"_94":95,"_133":130,"_12":112},"avatar","branch",{"_136":137,"_96":44,"_102":138,"_139":103,"_140":-5,"_141":-5,"_142":-5,"_143":-5,"_144":-5,"_145":97,"_146":95},"version",60,"ca58162c-efbd-11f0-b9de-42dde27851f2","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","isOwned","file",{"_102":150,"_96":99,"_151":152,"_153":-5,"_154":138,"_155":156,"_157":158,"_104":159,"_136":160,"_161":162,"_163":164,"_165":20,"_166":-5,"_98":167},"70e47330-efde-11f0-aa99-42dde27851f2","fileId","c0a33976-efc8-11f0-915f-42dde27851f2","parentId","branchId","branchVersion",50,"latest",true,["D",1768239910421],2,"fileType","script","content","/**\n * LZ4 Compression/Decompression for TypeScript.\n *\n * Reconstructed from the core logic of the LZ4 JS implementation.\n * Removes dependencies on Node.js Buffers/Streams for universal compatibility.\n */\n\nexport namespace LZ4 {\n // =========================================================================\n // CONSTANTS\n // =========================================================================\n\n const MIN_MATCH = 4;\n const HASH_LOG = 16;\n const HASH_TABLE_SIZE = 1 << HASH_LOG;\n const HASH_SHIFT = (MIN_MATCH * 8) - HASH_LOG;\n const HASH_MULTIPLIER = 2654435761;\n\n const MAX_INPUT_SIZE = 0x7E000000;\n\n // LZ4 format specific constants\n const ML_BITS = 4;\n const ML_MASK = (1 << ML_BITS) - 1;\n const RUN_BITS = 8 - ML_BITS;\n const RUN_MASK = (1 << RUN_BITS) - 1;\n\n const COPY_LENGTH = 8;\n const MF_LIMIT = COPY_LENGTH + MIN_MATCH;\n const MIN_LENGTH = MF_LIMIT + 1;\n const SKIP_STRENGTH = 6;\n\n // =========================================================================\n // HELPER FUNCTIONS\n // =========================================================================\n\n /**\n * integer multiplication polyfill for older environments,\n * though mostly standard in modern JS engines.\n */\n const imul = Math.imul || function (a: number, b: number) {\n const ah = (a >>> 16) & 0xffff;\n const al = a & 0xffff;\n const bh = (b >>> 16) & 0xffff;\n const bl = b & 0xffff;\n return ((al * bl) + (((ah * bl + al * bh) << 16) >>> 0) | 0);\n };\n\n /**\n * Calculates the max size of the compressed output to ensure buffer allocation.\n */\n export function compressBound(inputSize: number): number {\n return (inputSize > MAX_INPUT_SIZE)\n ? 0\n : (inputSize + (inputSize / 255) + 16) | 0;\n }\n\n // =========================================================================\n // DECOMPRESSION (Uncompress)\n // =========================================================================\n\n /**\n * Decompresses an LZ4 block.\n * @param input The compressed data.\n * @param output The buffer to write uncompressed data to.\n * @returns The number of bytes written to the output.\n */\n export function uncompress(input: Uint8Array, output: Uint8Array): number {\n let inputIdx = 0;\n let outputIdx = 0;\n const inputLen = input.length;\n const outputLen = output.length;\n\n while (inputIdx < inputLen) {\n const token = input[inputIdx++];\n\n // --- Literal Section ---\n let literalLen = token >> ML_BITS;\n\n // If literal length is 15 (max for 4 bits), read more bytes\n if (literalLen === RUN_MASK) {\n let current = 255;\n while ((current === 255) && (inputIdx < inputLen)) {\n current = input[inputIdx++];\n literalLen += current;\n }\n }\n\n // Bounds check\n if (outputIdx + literalLen > outputLen) {\n throw new Error(\n `Output buffer too small: expected at least ${\n outputIdx + literalLen\n }`,\n );\n }\n if (inputIdx + literalLen > inputLen) {\n throw new Error(\"Malformed LZ4 block: literal length exceeds input\");\n }\n\n // Copy Literals\n // Note: for very small copies, a loop might be faster, but set() is cleaner.\n output.set(input.subarray(inputIdx, inputIdx + literalLen), outputIdx);\n inputIdx += literalLen;\n outputIdx += literalLen;\n\n // If we are at the end of the input, we are done\n if (inputIdx === inputLen) {\n return outputIdx;\n }\n\n // --- Match Section ---\n\n // Read offset (16-bit little endian)\n if (inputIdx + 2 > inputLen) {\n throw new Error(\"Malformed LZ4 block: missing offset\");\n }\n const offset = input[inputIdx] | (input[inputIdx + 1] << 8);\n inputIdx += 2;\n\n if (offset === 0) throw new Error(\"Malformed LZ4 block: offset is 0\");\n\n // Match length\n let matchLen = token & ML_MASK;\n if (matchLen === ML_MASK) {\n let current = 255;\n while ((current === 255) && (inputIdx < inputLen)) {\n current = input[inputIdx++];\n matchLen += current;\n }\n }\n matchLen += MIN_MATCH; // Implicit length\n\n // Bounds check\n if (outputIdx + matchLen > outputLen) {\n throw new Error(\"Output buffer too small for match\");\n }\n\n // Copy Match\n // We cannot use output.set() easily here because the match might overlap\n // with the current write position (e.g. RLE), so we must copy byte-by-byte\n // or use copyWithin logic carefully.\n let matchPos = outputIdx - offset;\n if (matchPos < 0) {\n throw new Error(\"Malformed LZ4 block: offset before start\");\n }\n\n // Optimized copy for non-overlapping vs overlapping\n // For LZ4, overlapping matches (repeating patterns) are common.\n for (let i = 0; i < matchLen; i++) {\n output[outputIdx++] = output[matchPos++];\n }\n }\n\n return outputIdx;\n }\n\n // =========================================================================\n // COMPRESSION (Compress)\n // =========================================================================\n\n /**\n * Compresses data into LZ4 block format.\n * @param input The raw data.\n * @param output The buffer to write compressed data to.\n * @returns The size of the compressed data.\n */\n export function compress(input: Uint8Array, output: Uint8Array): number {\n const inputLen = input.length;\n const hashTable = new Int32Array(HASH_TABLE_SIZE).fill(0);\n\n let inputIdx = 0;\n let outputIdx = 0;\n let anchor = 0;\n\n if (inputLen >= MAX_INPUT_SIZE) throw new Error(\"Input too large\");\n\n // If input is too small, just emit literals\n if (inputLen < MIN_LENGTH) {\n // Token: Literal length = inputLen, Match length = 0\n if (output.length < inputLen + 1) throw new Error(\"Output too small\");\n\n // Write Token\n // We assume small inputs don't need multi-byte lengths for this check\n // typically, but let's do it properly via a goto-like structure or specialized helper.\n // For simplicity in this port, we fall through to the literal logic if we can't compress.\n }\n\n const limit = inputLen - MF_LIMIT;\n const matchLimit = inputLen - COPY_LENGTH; // Last few bytes must be literals\n\n // Main Loop\n while (inputIdx < limit) {\n let forwardH: number;\n let matchIdx: number;\n\n // Find a match\n let step = 1;\n let searchMatch = true;\n let nextInputIdx = inputIdx;\n\n while (searchMatch) {\n inputIdx = nextInputIdx;\n const diff = inputLen - MF_LIMIT - inputIdx;\n\n if (diff < 0) {\n searchMatch = false;\n break; // break to emit remaining literals\n }\n\n step = (step >>> SKIP_STRENGTH) + 1;\n nextInputIdx += step;\n\n if (nextInputIdx > limit) {\n searchMatch = false;\n inputIdx = limit; // Stop and emit remainder\n break;\n }\n\n // Hash current sequence\n const sequence = input[inputIdx] | (input[inputIdx + 1] << 8) |\n (input[inputIdx + 2] << 16) | (input[inputIdx + 3] << 24);\n const hash = imul(sequence, HASH_MULTIPLIER) >>> HASH_SHIFT;\n\n matchIdx = hashTable[hash];\n hashTable[hash] = inputIdx;\n\n // Check if valid match found\n if (\n matchIdx < inputIdx &&\n matchIdx >= 0 && // sanity check\n (inputIdx - matchIdx) < 65536 && // Offset must fit in 16 bits\n input[matchIdx] === input[inputIdx] &&\n input[matchIdx + 1] === input[inputIdx + 1] &&\n input[matchIdx + 2] === input[inputIdx + 2] &&\n input[matchIdx + 3] === input[inputIdx + 3]\n ) {\n searchMatch = false; // Found!\n }\n }\n\n // If we exited loop without match, we are near end\n if (inputIdx >= limit) break;\n\n // --- Encode Sequence ---\n\n // 1. Encode Literals (from anchor to inputIdx)\n const litLen = inputIdx - anchor;\n let token = litLen >= RUN_MASK\n ? (RUN_MASK << ML_BITS)\n : (litLen << ML_BITS);\n\n // We don't write token yet, need to check match length\n\n // Calculate Match Length\n // We already matched 4 bytes\n let matchLen = 4;\n while (\n inputIdx + matchLen < matchLimit &&\n input[inputIdx + matchLen] === input[matchIdx! + matchLen]\n ) {\n matchLen++;\n }\n\n matchLen -= MIN_MATCH; // Token stores length - 4\n\n // Combine token match part\n token |= matchLen >= ML_MASK ? ML_MASK : matchLen;\n\n // Write Token\n output[outputIdx++] = token;\n\n // Write Extended Literal Length\n if (litLen >= RUN_MASK) {\n let len = litLen - RUN_MASK;\n while (len >= 255) {\n output[outputIdx++] = 255;\n len -= 255;\n }\n output[outputIdx++] = len;\n }\n\n // Copy Literals\n output.set(input.subarray(anchor, anchor + litLen), outputIdx);\n outputIdx += litLen;\n\n // Write Offset (Little Endian)\n const offset = inputIdx - matchIdx!;\n output[outputIdx++] = offset & 0xff;\n output[outputIdx++] = (offset >> 8) & 0xff;\n\n // Write Extended Match Length\n if (matchLen >= ML_MASK) {\n let len = matchLen - ML_MASK;\n while (len >= 255) {\n output[outputIdx++] = 255;\n len -= 255;\n }\n output[outputIdx++] = len;\n }\n\n // Update State\n inputIdx += matchLen + MIN_MATCH;\n anchor = inputIdx;\n }\n\n // --- Encode Remaining Literals ---\n const litLen = inputLen - anchor;\n let token = litLen >= RUN_MASK\n ? (RUN_MASK << ML_BITS)\n : (litLen << ML_BITS);\n output[outputIdx++] = token;\n\n if (litLen >= RUN_MASK) {\n let len = litLen - RUN_MASK;\n while (len >= 255) {\n output[outputIdx++] = 255;\n len -= 255;\n }\n output[outputIdx++] = len;\n }\n\n output.set(input.subarray(anchor, inputLen), outputIdx);\n outputIdx += litLen;\n\n return outputIdx;\n }\n}","deleted","label",[99],"permalink","https://www.val.town/x/agariolove/legendmod/code/lz4.ts","extension","actionData","errors"]