[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_1142":1143,"_1144":1145},"routes/_app.x.$handle.$name",{"_111":110,"_34":59,"_119":101,"_29":120,"_13":14,"_121":-5,"_11":122,"_123":124,"_125":126,"_127":128,"_129":130,"_22":-5,"_131":-5,"_132":-5,"_133":27,"_134":135,"_136":63,"_137":-5,"_138":-5,"_139":140},"routes/_app.x.$handle.$name.branch.$branch.version.$version.diff",{"_11":12,"_13":14,"_15":16,"_17":-5,"_18":-5},"project",{"_57":58,"_34":59,"_40":60,"_61":-5,"_62":63,"_64":65,"_66":65,"_67":-5,"_68":-5,"_18":69,"_70":71,"_72":63,"_73":-5,"_74":75,"_76":77,"_78":79,"_80":-5,"_81":-5,"_82":-5,"_83":-5,"_84":85,"_86":85,"_87":88,"_89":88,"_90":88,"_91":85,"_92":85,"_93":94,"_95":96,"_97":98,"_99":27},"version",524,"changes",[19,20,21],"aiChatInfo","userId",{"_22":52,"_24":-7,"_26":27,"_28":27,"_29":53,"_31":53},{"_22":45,"_24":46,"_26":27,"_28":27,"_29":47,"_31":47},{"_22":23,"_24":25,"_26":27,"_28":27,"_29":30,"_31":30},"file",{"_32":33,"_34":30,"_35":36,"_37":39,"_40":41,"_42":14,"_43":44,"_26":27},"previous",{"_32":33,"_34":30,"_35":36,"_37":38},"deleted",false,"deletedHere","path","substitutionCipher.ts","latestPath","fileId","d41a3d08-4422-11f0-89d5-76b3cceeab13","name","fileType","script","content","import { generateHint } from \"./wordHelpers.ts\";\n\nexport function randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [\n shuffledAlphabet[swapIndex],\n shuffledAlphabet[i],\n ];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nexport function substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\"\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char)\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence\n .slice(keywordLedSequence.length - positionIndex)\n .concat(\n keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex)\n );\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(\n keyword,\n ALPHABET[(positionIndex + 1) % ALPHABET.length],\n type\n );\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] =\n ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(\n keyword,\n ALPHABET[(positionIndex + 1) % ALPHABET.length],\n type\n );\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] =\n keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nexport function substitutionEncode(args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n}): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n const { substitutionMap, reverseSubstitutionMap } =\n substitutionAndReverseMaps(keyword, positionLetter, type);\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n // For aristocrat, preserve punctuation and word spacing\n const textWithSpaceAndPunctuation = plainText.toUpperCase();\n encodedGrouped = textWithSpaceAndPunctuation\n .split(\"\")\n .map((char) => {\n // Only encode letters, keep everything else (spaces, punctuation) as-is\n if (/[A-Z]/.test(char)) {\n return substitutionMap[char];\n }\n return char;\n })\n .join(\"\");\n } else if (groupingType === \"patristocrat\") {\n // For patristocrat, strip punctuation and group into 5-letter blocks\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText\n .split(\"\")\n .reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {} as Record);\n\n // 4.4 Hint (only give hint if it's patristocrat)\n let hintInfo: { hint: string; source: string };\n if (groupingType === \"aristocrat\") {\n hintInfo = { hint: \"\", source: \"\" };\n } else {\n hintInfo = generateHint(plainText, 4);\n }\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n","import { generateHint } from \"./wordHelpers.ts\";\n\nexport function randomSubstitutionMap(): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n const alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".split(\"\");\n\n // Fisher-Yates shuffle to randomize mapping\n const shuffledAlphabet = [...alphabet].sort(() => Math.random() - 0.5);\n\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n\n for (let i = 0; i < alphabet.length; i++) {\n const originalLetter = alphabet[i];\n const substitutedLetter = shuffledAlphabet[i];\n\n // Ensure no letter maps to itself\n if (originalLetter === substitutedLetter) {\n // Swap with another letter\n const swapIndex = (i + 1) % alphabet.length;\n [shuffledAlphabet[i], shuffledAlphabet[swapIndex]] = [\n shuffledAlphabet[swapIndex],\n shuffledAlphabet[i],\n ];\n }\n\n substitutionMap[originalLetter] = shuffledAlphabet[i];\n reverseSubstitutionMap[shuffledAlphabet[i]] = originalLetter;\n }\n\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nexport function substitutionAndReverseMaps(\n keyword: string,\n positionLetter: string,\n type: \"k1\" | \"k2\" | \"random\"\n): {\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n} {\n if (type === \"random\") {\n return randomSubstitutionMap();\n }\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n // Normalize inputs\n const upperKeyword = keyword.toUpperCase().replace(/[^A-Z]/g, \"\");\n const upperPosition = positionLetter.toUpperCase();\n\n // 1. Remove duplicate letters from the keyword (in the order they appear)\n let uniqueKeyword: string[] = [];\n for (const char of upperKeyword) {\n if (!uniqueKeyword.includes(char)) {\n uniqueKeyword.push(char);\n }\n }\n\n // 2. Find the index of the position letter in the alphabet\n const positionIndex = ALPHABET.indexOf(upperPosition);\n if (positionIndex < 0) {\n throw new Error(\n `Position letter \"${upperPosition}\" is not a valid A–Z character.`\n );\n }\n\n // 3. Create an array of all letters except those in the keyword\n // (to help fill the rest of the alphabet)\n let remainingLetters = ALPHABET.split(\"\").filter(\n (char) => !uniqueKeyword.includes(char)\n );\n\n // 4. Sequence led by keyword\n const keywordLedSequence = uniqueKeyword.concat(remainingLetters);\n\n // 5. Rotation to make keyword start at the right index\n const keywordAtRightIndexSequence = keywordLedSequence\n .slice(keywordLedSequence.length - positionIndex)\n .concat(\n keywordLedSequence.slice(0, keywordLedSequence.length - positionIndex)\n );\n\n // 5. Build the final substitution dicts\n const substitutionMap: Record = {};\n const reverseSubstitutionMap: Record = {};\n if (type === \"k2\") {\n // for k2, keyword is in the ciphertext\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(\n keyword,\n ALPHABET[(positionIndex + 1) % ALPHABET.length],\n type\n );\n }\n substitutionMap[ALPHABET[index]] = keywordAtRightIndexSequence[index];\n reverseSubstitutionMap[keywordAtRightIndexSequence[index]] =\n ALPHABET[index];\n }\n } else {\n // for k1, keyword is in the plain text\n for (const index in keywordAtRightIndexSequence) {\n if (ALPHABET[index] === keywordAtRightIndexSequence[index]) {\n // Don't allow letter mapping to the same letter. try the next positionIndex\n return substitutionAndReverseMaps(\n keyword,\n ALPHABET[(positionIndex + 1) % ALPHABET.length],\n type\n );\n }\n substitutionMap[keywordAtRightIndexSequence[index]] = ALPHABET[index];\n reverseSubstitutionMap[ALPHABET[index]] =\n keywordAtRightIndexSequence[index];\n }\n }\n return { substitutionMap, reverseSubstitutionMap };\n}\n\nexport function substitutionEncode(args: {\n plainText: string;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n existingSubstitutionMap?: Record;\n existingReverseSubstitutionMap?: Record;\n}): {\n encoded: string;\n original: string;\n cleanOriginal: string;\n encodedLetterCounts: Record;\n substitutionMap: Record;\n reverseSubstitutionMap: Record;\n keyword: string;\n positionLetter: string;\n type: \"k1\" | \"k2\" | \"random\";\n groupingType: \"aristocrat\" | \"patristocrat\";\n hint: string;\n hintSource: string;\n} {\n const { plainText, keyword, positionLetter, type, groupingType, existingSubstitutionMap, existingReverseSubstitutionMap } = args;\n\n // 1. Normalize plaintext: uppercase, remove non-letters\n const normalizedText = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // 2. get substitution and reverse substitution maps\n // If existing maps are provided (for hard mode misspelling), use them\n let substitutionMap: Record;\n let reverseSubstitutionMap: Record;\n \n if (existingSubstitutionMap && existingReverseSubstitutionMap) {\n substitutionMap = existingSubstitutionMap;\n reverseSubstitutionMap = existingReverseSubstitutionMap;\n } else {\n ({ substitutionMap, reverseSubstitutionMap } =\n substitutionAndReverseMaps(keyword, positionLetter, type));\n }\n // present(\n // `substitutionMap: ${JSON.stringify(substitutionMap)}, reverseSubstitutionMap: ${\n // JSON.stringify(reverseSubstitutionMap)\n // }`,\n // );\n\n // 4.1 get cipher text\n let cipherText = \"\";\n for (const char of normalizedText) {\n cipherText += substitutionMap[char];\n }\n\n // 4.2 Group encoded letters into 5-letter groups\n let encodedGrouped = \"\";\n if (groupingType === \"aristocrat\") {\n // For aristocrat, preserve punctuation and word spacing\n const textWithSpaceAndPunctuation = plainText.toUpperCase();\n encodedGrouped = textWithSpaceAndPunctuation\n .split(\"\")\n .map((char) => {\n // Only encode letters, keep everything else (spaces, punctuation) as-is\n if (/[A-Z]/.test(char)) {\n return substitutionMap[char];\n }\n return char;\n })\n .join(\"\");\n } else if (groupingType === \"patristocrat\") {\n // For patristocrat, strip punctuation and group into 5-letter blocks\n encodedGrouped = cipherText.split(\"\").reduce((acc, letter, index) => {\n if (index > 0 && index % 5 === 0) {\n acc += \" \";\n }\n return acc + letter;\n }, \"\");\n } else {\n throw new Error(`Invalid grouping type: ${groupingType}`);\n }\n\n // 4.3 Generate letter counts\n const encodedLetterCounts: Record = cipherText\n .split(\"\")\n .reduce((acc, letter) => {\n acc[letter] = (acc[letter] || 0) + 1;\n return acc;\n }, {} as Record);\n\n // 4.4 Hint (only give hint if it's patristocrat)\n let hintInfo: { hint: string; source: string };\n if (groupingType === \"aristocrat\") {\n hintInfo = { hint: \"\", source: \"\" };\n } else {\n hintInfo = generateHint(plainText, 4);\n }\n\n // 5. Return the desired dictionary/object\n return {\n encoded: encodedGrouped,\n original: plainText, // The original (unmodified) plain text\n cleanOriginal: normalizedText,\n encodedLetterCounts,\n substitutionMap, // A->D, B->W, etc.\n reverseSubstitutionMap, // D->A, W->B, etc.\n keyword,\n positionLetter,\n type,\n groupingType,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n };\n}\n","createdAt",["D",1766901707702],"branchVersion","branchId","88faff98-2793-11f0-9d52-569c3dd06744",{"_32":48,"_34":47,"_35":36,"_37":50,"_40":51,"_42":14,"_43":44,"_26":27},{"_32":48,"_34":47,"_35":36,"_37":49},"App.tsx","d41a0f68-4422-11f0-89d5-76b3cceeab13","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport React, {\n createRef,\n useEffect,\n useRef,\n useState,\n} from \"https://esm.sh/react@18.2.0\";\nimport { AnotherRound } from \"./AnotherRound.tsx\";\nimport { isMobileNative, sendBridgeMessage } from \"./bridge.ts\";\nimport { getCipherName } from \"./cipherHelpers.ts\";\nimport {\n appendToLocalStorage,\n isTextKnown,\n present,\n startNewGame,\n} from \"./gameHelpers.ts\";\nimport { GameLink } from \"./GameLink.tsx\";\nimport { GameResult } from \"./GameResult.tsx\";\nimport { KnownTextWarning } from \"./KnownTextWarning.tsx\";\nimport { Loading } from \"./Loading.tsx\";\nimport { misspellSentence } from \"./misspellHelpers.ts\";\nimport { post } from \"./networkHelpers.ts\";\nimport { Notice } from \"./Notice.tsx\";\nimport { fetchQuote } from \"./quoteService.ts\";\nimport {\n randomSubstitutionMap,\n substitutionAndReverseMaps,\n substitutionEncode,\n} from \"./substitutionCipher.ts\";\nimport { generateHint, randomLetter } from \"./wordHelpers.ts\";\n\nexport function App({ uuid }: { uuid: string }) {\n const [name, setName] = useState(localStorage.getItem(\"name\"));\n const [hardMode, setHardMode] = useState(\n localStorage.getItem(\"hardMode\") === \"true\"\n );\n const [cipher, setCipher] = useState | null>(null);\n const [originalQuote, setOriginalQuote] = useState(null);\n const [decryptionAttempt, setDecryptionAttempt] = useState([]);\n const [startTime, setStartTime] = useState(null);\n const [solveTime, setSolveTime] = useState(null);\n const [isCorrect, setIsCorrect] = useState(null);\n const [hintCount, setHintCount] = useState(0);\n const [keywordRevealed, setKeywordRevealed] = useState(false);\n const [quoteAuthor, setQuoteAuthor] = useState(null);\n const [isLoading, setIsLoading] = useState(true);\n const [loadingError, setLoadingError] = useState(\"\");\n const [isRevealed, setIsRevealed] = useState(false);\n const [currentFocusIndex, setCurrentFocusIndex] = useState(\n null\n );\n const inputRefs = useRef[]>([]);\n const [knownTexts, setKnownTexts] = useState([]);\n const currentUrl = `${window.location.origin}/${uuid.replace(\"cipher-\", \"\")}`;\n // present(`uuid: ${uuid}, currentUrl: ${currentUrl} window.location.origin: ${window.location.origin}`);\n window.history.pushState({}, \"\", currentUrl);\n\n if (window.WebNativeBridge) {\n window.WebNativeBridge.nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n }\n };\n }\n\n useEffect(() => {\n async function loadGame() {\n const result = await fetchQuote(uuid);\n\n setKnownTexts(result.knownTexts);\n\n if (result.error) {\n setLoadingError(result.error);\n setIsLoading(false);\n return;\n }\n\n if (result.cipher) {\n setCipher(result.cipher);\n setQuoteAuthor(result.author);\n // Store the original quote before any misspelling is applied\n setOriginalQuote(result.cipher.original);\n\n // Initialize decryption attempt with empty strings (only for letters)\n const lettersOnly = result.cipher.encoded.replace(/[^A-Z]/g, \"\");\n const initialAttempt = lettersOnly.split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n\n // Create refs for each input (only for letters)\n inputRefs.current = initialAttempt.map(() => createRef());\n }\n\n setIsLoading(false);\n }\n\n loadGame();\n }, []); // Only load once on mount\n\n // Add Enter key listener for submitting the game\n useEffect(() => {\n const handleKeyPress = (event: KeyboardEvent) => {\n // Only allow Enter to submit when game is active and not yet completed\n if (\n event.key === \"Enter\" &&\n startTime !== null &&\n !isRevealed &&\n !isCorrect\n ) {\n handleSubmit();\n }\n };\n\n window.addEventListener(\"keydown\", handleKeyPress);\n return () => {\n window.removeEventListener(\"keydown\", handleKeyPress);\n };\n }, [startTime, isRevealed, isCorrect, decryptionAttempt]);\n\n const handleStartGame = () => {\n if (!name || !name.trim()) {\n return;\n }\n localStorage.setItem(\"name\", name ?? \"\");\n\n // Apply hard mode modifications\n if (hardMode && cipher) {\n if (cipher.groupingType === \"aristocrat\") {\n // For aristocrat: apply misspelling\n const misspelledText = misspellSentence(cipher.original);\n const misspelledCipher = substitutionEncode({\n plainText: misspelledText,\n keyword: cipher.keyword,\n positionLetter: cipher.positionLetter,\n type: cipher.type,\n groupingType: cipher.groupingType,\n });\n setCipher(misspelledCipher);\n\n // Re-initialize decryption attempt with the misspelled cipher\n const lettersOnly = misspelledCipher.encoded.replace(/[^A-Z]/g, \"\");\n const initialAttempt = lettersOnly.split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n inputRefs.current = initialAttempt.map(() => createRef());\n } else if (cipher.groupingType === \"patristocrat\") {\n // For patristocrat: reduce hint from 4 letters to 2 letters\n const hintInfo = generateHint(cipher.original, 2);\n setCipher({\n ...cipher,\n hint: hintInfo.hint,\n hintSource: hintInfo.source,\n });\n }\n }\n\n setStartTime(Date.now());\n };\n\n const handleLetterChange = (letterIndex: number, value: string) => {\n if (!cipher) return;\n\n const newAttempt = [...decryptionAttempt];\n const uppercaseValue = value.toUpperCase();\n\n // If the value is a letter, autofill all matching encoded letters\n if (/^[A-Z]$/.test(uppercaseValue)) {\n newAttempt[letterIndex] = uppercaseValue;\n\n // Get the encoded letter at this letter-only index\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n const encodedLetter = encodedLettersOnly[letterIndex];\n\n // Find all indices of the same encoded letter and fill them\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex(\n (letter, i) => letter === \"\" && i > letterIndex\n );\n if (\n nextUnfilledIndex !== -1 &&\n inputRefs.current[nextUnfilledIndex]?.current\n ) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex(\n (letter) => letter === \"\"\n );\n if (\n firstUnfilledIndex !== -1 &&\n inputRefs.current[firstUnfilledIndex]?.current\n ) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n }\n\n setDecryptionAttempt(newAttempt);\n };\n\n const handleKeyDown = (\n letterIndex: number,\n event: React.KeyboardEvent\n ) => {\n if (!cipher) return;\n\n // Handle letter key press - if field is already filled, clear it first to allow replacement\n if (/^[a-zA-Z]$/.test(event.key) && decryptionAttempt[letterIndex]) {\n event.preventDefault(); // Prevent default to handle manually\n \n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n const encodedLetter = encodedLettersOnly[letterIndex];\n const newAttempt = [...decryptionAttempt];\n const uppercaseValue = event.key.toUpperCase();\n \n // Clear all instances of the old letter first\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = \"\";\n }\n });\n \n // Now set all instances to the new letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = uppercaseValue;\n }\n });\n \n setDecryptionAttempt(newAttempt);\n \n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex(\n (letter, i) => letter === \"\" && i > letterIndex\n );\n if (\n nextUnfilledIndex !== -1 &&\n inputRefs.current[nextUnfilledIndex]?.current\n ) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n } else {\n // find the first unfilled input and focus it\n const firstUnfilledIndex = newAttempt.findIndex(\n (letter) => letter === \"\"\n );\n if (\n firstUnfilledIndex !== -1 &&\n inputRefs.current[firstUnfilledIndex]?.current\n ) {\n inputRefs.current[firstUnfilledIndex].current?.focus();\n }\n }\n \n return; // Exit early since we handled the key press\n }\n\n // Handle backspace to clear all instances of the letter or move to previous input\n if (event.key === \"Backspace\") {\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n // If current input is empty, move to previous input and delete its letter\n if (!decryptionAttempt[letterIndex]) {\n if (letterIndex > 0) {\n const prevIndex = letterIndex - 1;\n const newAttempt = [...decryptionAttempt];\n\n // Remove the letter from the previous input\n const encodedLetterToRemove = encodedLettersOnly[prevIndex];\n newAttempt[prevIndex] = \"\";\n\n // Remove the same letter from all other inputs\n const updatedAttempt = newAttempt.map((letter, idx) =>\n encodedLettersOnly[idx] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(updatedAttempt);\n\n // Focus the previous input\n inputRefs.current[prevIndex].current?.focus();\n }\n } else {\n // If current input is not empty, clear all instances of its letter\n const encodedLetterToRemove = encodedLettersOnly[letterIndex];\n const newAttempt = decryptionAttempt.map((letter, idx) =>\n encodedLettersOnly[idx] === encodedLetterToRemove ? \"\" : letter\n );\n\n setDecryptionAttempt(newAttempt);\n\n // Focus the current input after clearing\n inputRefs.current[letterIndex].current?.focus();\n }\n }\n };\n\n const handleClear = async () => {\n if (cipher) {\n // Only create entries for letters (not punctuation)\n const lettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n const initialAttempt = lettersOnly.split(\"\").map(() => \"\");\n setDecryptionAttempt(initialAttempt);\n }\n };\n const handleSubmit = async () => {\n if (isRevealed || isCorrect) {\n return;\n }\n\n // if there is empty letter in decryptionAttempt, return\n if (decryptionAttempt.some((letter) => letter === \"\")) {\n present(\"😾 Not completed yet\");\n return;\n }\n if (cipher) {\n // Remove spaces from the encoded message to match decryption attempt\n const cleanEncoded = cipher.encoded.replace(/\\s/g, \"\");\n\n // Translate the decryption attempt back to original letters\n const translatedAttempt = decryptionAttempt.join(\"\");\n const isMatch = translatedAttempt === cipher.cleanOriginal;\n\n setIsCorrect(isMatch);\n\n if (isMatch && startTime) {\n const timeTaken = Math.round((Date.now() - startTime) / 1000);\n setSolveTime(timeTaken);\n\n // Use the original quote (before misspelling) for saving\n appendToLocalStorage(originalQuote || cipher.original, quoteAuthor);\n\n if (uuid && name) {\n await post(\"https://simplevalueapi.val.run/addLog\", {\n id: uuid,\n log: `⭐️ ${name} completed the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }${hardMode ? \". ⚔️ Hard Mode ✔️ ⚔️\" : \"\"}`,\n });\n void sendBridgeMessage({\n action: \"finish\",\n data: {\n uuid,\n success: true,\n timeTaken,\n hintCount,\n keywordRevealed,\n hardMode,\n },\n });\n }\n }\n if (!isMatch && uuid && name) {\n await post(\"https://simplevalueapi.val.run/addLog\", {\n id: uuid,\n log: `❌ ${name} submitted an incorrect answer. Hints so far: ${hintCount}. Keyword used: ${\n keywordRevealed ? \"yes\" : \"no\"\n }${hardMode ? \". ⚔️ Hard Mode ✔️ ⚔️\" : \"\"}`,\n });\n }\n }\n };\n\n const handleRevealAnswer = async () => {\n if (isCorrect) {\n return;\n }\n if (cipher && startTime) {\n const revealedAttempt = cipher.cleanOriginal.split(\"\");\n const timeTaken = Math.round((Date.now() - startTime) / 1000);\n setDecryptionAttempt(revealedAttempt);\n setIsRevealed(true);\n // Use the original quote (before misspelling) for saving\n appendToLocalStorage(originalQuote || cipher.original, quoteAuthor);\n if (uuid && name) {\n const writeResult = await post(\n \"https://simplevalueapi.val.run/addLog\",\n {\n id: uuid,\n log: `💀 ${name} abandoned the mission. Time: ${timeTaken} seconds. Hints: ${hintCount}. Keyword needed: ${\n keywordRevealed ? \"yes\" : \"no\"\n }${hardMode ? \". ⚔️ Hard Mode ✔️ ⚔️\" : \"\"}`,\n }\n );\n void sendBridgeMessage({\n action: \"finish\",\n data: {\n uuid,\n success: false,\n timeTaken,\n hintCount,\n keywordRevealed,\n hardMode,\n },\n });\n }\n }\n };\n\n const handleRevealKeyword = () => {\n if (cipher) {\n if (cipher.type === \"random\") {\n present(\"It's a random substitution cipher. There is no keyword.\");\n } else if (\n cipher.type === \"k1\" &&\n cipher.keyword === \"\" &&\n cipher.groupingType === \"aristocrat\"\n ) {\n const shift = cipher.positionLetter.charCodeAt(0) - 65;\n present(`It's a Caesar cipher with shift ${shift}`);\n setKeywordRevealed(true);\n } else {\n present(`The keyword is ${cipher.keyword}`);\n setKeywordRevealed(true);\n }\n }\n };\n\n const handleRevealAuthor = () => {\n if (quoteAuthor) {\n present(`The author is ${quoteAuthor}`);\n } else {\n present(`No author for this`);\n }\n };\n\n const handleHintType = () => {\n if (isCorrect || isRevealed) {\n return;\n }\n if (cipher && currentFocusIndex !== null) {\n // Get the original letter for the current encoded letter\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n const encodedLetter = encodedLettersOnly[currentFocusIndex];\n const originalLetter =\n Object.entries(cipher.reverseSubstitutionMap).find(\n ([encoded]) => encoded === encodedLetter\n )?.[1] || \"\";\n\n if (originalLetter) {\n const newAttempt = [...decryptionAttempt];\n newAttempt[currentFocusIndex] = originalLetter;\n\n // Fill all matching encoded letters\n decryptionAttempt.forEach((letter, idx) => {\n if (encodedLettersOnly[idx] === encodedLetter) {\n newAttempt[idx] = originalLetter;\n }\n });\n\n setDecryptionAttempt(newAttempt);\n setHintCount(hintCount + 1);\n // Find the next unfilled input and focus it\n const nextUnfilledIndex = newAttempt.findIndex(\n (letter, i) => letter === \"\" && i > currentFocusIndex\n );\n if (\n nextUnfilledIndex !== -1 &&\n inputRefs.current[nextUnfilledIndex]?.current\n ) {\n inputRefs.current[nextUnfilledIndex].current?.focus();\n }\n }\n }\n };\n\n const isDuplicated = (encodedLetter: string) => {\n if (!cipher) return false;\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n let attemptForLetter = \"\";\n for (const index in decryptionAttempt) {\n if (\n encodedLettersOnly[index] === encodedLetter &&\n decryptionAttempt[index] !== \"\"\n ) {\n attemptForLetter = decryptionAttempt[index];\n break;\n }\n }\n for (const index in decryptionAttempt) {\n // if another encoded letter also uses attemptForLetter\n if (\n decryptionAttempt[index] !== \"\" &&\n encodedLettersOnly[index] !== encodedLetter &&\n decryptionAttempt[index] === attemptForLetter\n ) {\n return true;\n }\n }\n return false;\n };\n\n const attemptedOriginalFor = (encodedLetter: string) => {\n if (!cipher) return \"\";\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n for (const index in decryptionAttempt) {\n if (\n encodedLettersOnly[index] === encodedLetter &&\n decryptionAttempt[index] !== \"\"\n ) {\n return decryptionAttempt[index];\n }\n }\n return \"?\";\n };\n\n const attemptedEncodedFor = (originalLetter: string) => {\n if (!cipher) return \"\";\n const encodedLettersOnly = cipher.encoded.replace(/[^A-Z]/g, \"\");\n for (const index in decryptionAttempt) {\n if (decryptionAttempt[index] === originalLetter) {\n return encodedLettersOnly[index];\n }\n }\n return \"?\";\n };\n\n // Helper: Get the visual position (including punctuation) in the encoded string\n const visualIndexFor = (groupIndex: number, indexInGroup: number): number => {\n if (!cipher) return 0;\n let index = 0;\n let words = cipher.encoded.split(/\\s+/); // Split by all whitespace (spaces, newlines, tabs)\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n // Helper: Convert visual position to letter-only index in decryptionAttempt\n const letterIndexFromVisual = (visualIndex: number): number => {\n if (!cipher) return 0;\n const encodedWithoutSpaces = cipher.encoded.replace(/\\s/g, \"\");\n let letterCount = 0;\n for (let i = 0; i < visualIndex && i < encodedWithoutSpaces.length; i++) {\n if (/[A-Z]/.test(encodedWithoutSpaces[i])) {\n letterCount++;\n }\n }\n return letterCount;\n };\n\n // Helper: Check if a character at visual position is a letter\n const isLetterAtVisual = (\n groupIndex: number,\n indexInGroup: number\n ): boolean => {\n if (!cipher) return false;\n const words = cipher.encoded.split(/\\s+/); // Split by all whitespace (spaces, newlines, tabs)\n if (groupIndex >= words.length) return false;\n const char = words[groupIndex][indexInGroup];\n return /[A-Z]/.test(char);\n };\n\n return (\n <>\n \n {isLoading ? (\n \n ) : !cipher ? (\n

\n {`Something unexpected happened: ${loadingError}`}\n

\n ) : (\n \n {!isMobileNative() && (\n

\n Cipher Challenge 🕵️\n

\n )}\n\n {cipher &&\n startTime === null &&\n isTextKnown(cipher.original, quoteAuthor, knownTexts) && (\n \n )}\n\n {startTime !== null && (\n

\n \n \n \n {cipher.encoded.split(/\\s+/).map((group, groupIndex) => (\n \n \n {group.split(\"\").map((char, charIndex) => {\n const isLetter = /[A-Z]/.test(char);\n return (\n \n {char}\n {isLetter && (\n \n {cipher?.encodedLetterCounts[\n char\n ].toString() ?? \"\"}\n \n )}\n

\n );\n })}\n \n \n {group.split(\"\").map((char, charIndex) => {\n const isLetter = isLetterAtVisual(\n groupIndex,\n charIndex\n );\n const visualIdx = visualIndexFor(\n groupIndex,\n charIndex\n );\n const letterIdx = letterIndexFromVisual(visualIdx);\n\n if (!isLetter) {\n // Render punctuation/non-letter as plain text\n return (\n \n {char}\n \n );\n }\n\n // Render input for letters\n return (\n \n handleLetterChange(letterIdx, e.target.value)\n }\n onKeyDown={(e) => handleKeyDown(letterIdx, e)}\n onFocus={() => setCurrentFocusIndex(letterIdx)}\n style={{\n width: \"var(--char-width)\",\n height: \"var(--char-height)\",\n textAlign: \"center\",\n textTransform: \"uppercase\",\n backgroundColor: \"#e0e0e0\",\n fontSize: \"var(--font-size-base)\",\n padding: \"0\",\n border: \"1px solid #ccc\",\n boxSizing: \"border-box\",\n lineHeight: \"normal\",\n verticalAlign: \"middle\",\n }}\n />\n );\n })}\n \n \n ))}\n \n \n \n\n {cipher.hint && (\n \n {cipher.hintSource === \"first\"\n ? \"Beginning of the quote\"\n : \"End of the quote\"}\n : {cipher.hint}\n \n )}\n\n

\n \n {getCipherName(\n cipher.type,\n cipher.keyword,\n cipher.groupingType\n )}\n {\" \"}\n → original:\n
\n {cipher.type !== \"k2\"\n ? \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n .split(\"\")\n .map((letter, index) => (\n \n {letter}\n \n {cipher.encodedLetterCounts[letter] ?? 0}\n \n {\"→\"}\n \n {attemptedOriginalFor(letter)}\n \n \n \n ))\n : \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n .split(\"\")\n .map((letter, index) => (\n \n \n {attemptedEncodedFor(letter)}\n \n {\"→\"}\n {letter}\n \n \n ))}\n

\n\n {cipher.type === \"k2\" && (\n

\n Cipher letter frequency:\n
\n {\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n .split(\"\")\n .map((letter, index) => (\n \n {letter}\n {\":\"}\n \n {cipher?.encodedLetterCounts[letter] ?? 0}\n \n \n \n ))}\n

\n )}\n\n {!isMobileNative() && (\n

\n Codebreaker: {name ?? \"\"}\n

\n )}\n \n \n Submit Decryption\n \n \n Clear\n \n \n\n {isCorrect !== null && !isRevealed && (\n \n {isCorrect ? (\n <>\n 🎉 Correct! You solved the cipher in {solveTime} seconds\n with {hintCount} hints and{\" \"}\n {keywordRevealed\n ? \"with the help of the keyword\"\n : \"without peeking the keyword\"}\n .\n
\n Original Quote: \"{originalQuote || cipher.original}\"\n {quoteAuthor && (\n \n Quote by: {quoteAuthor}\n \n )}\n \n ) : (\n \"Incorrect. Try again! 🤔\"\n )}\n \n )}\n \n )}\n\n {startTime === null && (\n

\n \n \n setName(e.target.value)}\n type=\"text\"\n />\n \n START\n \n

\n {`Something unexpected happened: ${loadingError}`}\n

\n ) : (\n \n {!isMobileNative() && (\n

\n Cipher Challenge 🕵️\n

\n )}\n\n {cipher &&\n startTime === null &&\n isTextKnown(cipher.original, quoteAuthor, knownTexts) && (\n \n )}\n\n {startTime !== null && (\n

\n\n {cipher.type === \"k2\" && (\n

\n )}\n\n {!isMobileNative() && (\n

\n Codebreaker: {name ?? \"\"}\n

\n \n \n setName(e.target.value)}\n type=\"text\"\n />\n \n START\n \n

\n \n \n {\n const newHardMode = e.target.checked;\n setHardMode(newHardMode);\n localStorage.setItem(\"hardMode\", String(newHardMode));\n }}\n style={{\n width: \"20px\",\n height: \"20px\",\n cursor: \"pointer\",\n }}\n />\n Hard Mode (beta)\n \n \n present(\n \"Hard Mode:\\nIf it's an Aristocrat, some misspellings will be introduced.\\nIf it's a Patristocrat, the hint is reduced.\"\n )\n }\n style={{\n fontSize: \"calc(var(--font-size-base) * 0.8)\",\n color: \"gray\",\n textDecoration: \"none\",\n cursor: \"pointer\",\n wordSpacing: \"-5px\",\n }}\n >\n What is it?\n \n \n \n )}\n\n \n {!(isMobileNative() && !startTime) && ( // if it's mobile native, don't show game results in the waiting page\n \n )}\n \n\n {startTime !== null && (\n \n \n Reveal Author\n \n \n Reveal Current Letter\n \n \n Reveal Keyword\n \n \n Reveal Entire Answer\n \n \n )}\n\n {isRevealed && (\n \n 🚨 Answer Revealed! Better luck next time. 🚨\n \n )}\n \n )}\n \n );\n}\n",["D",1766901707702],{"_32":54,"_34":53,"_35":36,"_37":55,"_40":56,"_42":14,"_43":44,"_26":27},"hardModeAristocrat.test.ts","b1eacb8c-e3b2-11f0-9b4c-42dde27851f2","import { assertEquals } from \"https://deno.land/std@0.208.0/assert/mod.ts\";\nimport { substitutionEncode } from \"./substitutionCipher.ts\";\nimport { misspellSentence } from \"./misspellHelpers.ts\";\n\n/**\n * Test for hard mode aristocrat misspelling bug\n * \n * Bug: When hard mode aristocrat is played with type=\"random\", creating a misspelled\n * cipher would generate a NEW random substitution map, causing the same cipher letter\n * to map to different plaintext letters, making the puzzle unsolvable.\n * \n * Fix: When creating the misspelled cipher, we reuse the original cipher's substitution\n * map to ensure consistency.\n */\n\nDeno.test(\"Hard mode aristocrat - reuses substitution map for misspelled text\", () => {\n // Create original cipher with random type\n const originalText = \"I KNOW YOUR LIFE\";\n const originalCipher = substitutionEncode({\n plainText: originalText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n });\n \n // Misspell the text (simulating hard mode)\n const misspelledText = misspellSentence(originalText);\n \n // Create misspelled cipher WITHOUT reusing map (this is the bug)\n const misspelledCipherWithBug = substitutionEncode({\n plainText: misspelledText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n });\n \n // Create misspelled cipher WITH reusing map (this is the fix)\n const misspelledCipherFixed = substitutionEncode({\n plainText: misspelledText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n existingSubstitutionMap: originalCipher.substitutionMap,\n existingReverseSubstitutionMap: originalCipher.reverseSubstitutionMap,\n });\n \n // Verify the bug: different maps for same letter\n // For example, if original has A->X, the buggy version might have A->Y\n const letterA_original = originalCipher.substitutionMap[\"A\"];\n const letterA_buggy = misspelledCipherWithBug.substitutionMap[\"A\"];\n const letterA_fixed = misspelledCipherFixed.substitutionMap[\"A\"];\n \n console.log(\"Original A maps to:\", letterA_original);\n console.log(\"Buggy A maps to:\", letterA_buggy);\n console.log(\"Fixed A maps to:\", letterA_fixed);\n \n // The buggy version will likely have different mapping (random)\n // The fixed version should have the same mapping as original\n assertEquals(\n letterA_fixed,\n letterA_original,\n \"Fixed version should use the same substitution map as original\"\n );\n \n // Check all 26 letters\n for (let i = 0; i < 26; i++) {\n const letter = String.fromCharCode(65 + i); // A-Z\n assertEquals(\n misspelledCipherFixed.substitutionMap[letter],\n originalCipher.substitutionMap[letter],\n `Letter ${letter} should map to the same cipher letter in both original and misspelled versions`\n );\n }\n});\n\nDeno.test(\"Hard mode aristocrat - consistency check with K1 cipher\", () => {\n // Test with K1 to ensure the fix works for non-random types too\n const originalText = \"HELLO WORLD\";\n const originalCipher = substitutionEncode({\n plainText: originalText,\n keyword: \"SECRET\",\n positionLetter: \"D\",\n type: \"k1\",\n groupingType: \"aristocrat\",\n });\n \n const misspelledText = \"HELO WRLD\"; // Manually misspelled\n const misspelledCipher = substitutionEncode({\n plainText: misspelledText,\n keyword: \"SECRET\",\n positionLetter: \"D\",\n type: \"k1\",\n groupingType: \"aristocrat\",\n existingSubstitutionMap: originalCipher.substitutionMap,\n existingReverseSubstitutionMap: originalCipher.reverseSubstitutionMap,\n });\n \n // K1 with same keyword should generate same map anyway, but let's verify\n assertEquals(\n misspelledCipher.substitutionMap,\n originalCipher.substitutionMap,\n \"K1 cipher should have consistent substitution map\"\n );\n});\n\nDeno.test(\"Hard mode aristocrat - encoded text uses correct mapping\", () => {\n // Create a simple example to verify encoding is correct\n const originalText = \"AAA BBB\";\n const originalCipher = substitutionEncode({\n plainText: originalText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n });\n \n // Get what A and B map to\n const cipherA = originalCipher.substitutionMap[\"A\"];\n const cipherB = originalCipher.substitutionMap[\"B\"];\n \n // Create misspelled version with different letters\n const misspelledText = \"AAB BBA\";\n const misspelledCipher = substitutionEncode({\n plainText: misspelledText,\n keyword: \"test\",\n positionLetter: \"A\",\n type: \"random\",\n groupingType: \"aristocrat\",\n existingSubstitutionMap: originalCipher.substitutionMap,\n existingReverseSubstitutionMap: originalCipher.reverseSubstitutionMap,\n });\n \n // Expected encoded text: AAB BBA -> cipherA cipherA cipherB space cipherB cipherB cipherA\n const expectedEncoded = `${cipherA}${cipherA}${cipherB} ${cipherB}${cipherB}${cipherA}`;\n assertEquals(\n misspelledCipher.encoded,\n expectedEncoded,\n \"Misspelled text should encode correctly using the original substitution map\"\n );\n});\n\n",["D",1766901707702],"id","88fab826-2793-11f0-9d52-569c3dd06744","cipher",["D",1746217506027],"deletedAt","legacyEnvVars",true,"privacy","public","httpPrivacy","description","imageUrl","a8d58876-68b6-4f0e-8150-985f4e2460c5","pinnedFileId","8901560e-2793-11f0-9d52-569c3dd06744","pinPreview","pinMigrated","screenshotVersion",448,"likeCount",0,"orgId","6fc68030-e621-49ab-8a1f-a11bb64257a4","tursoName","tursoHostname","tursoMeasuredAt","pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm","user",{"_111":110,"_118":114},"org",{"_111":110,"_112":-5,"_113":114,"_18":69,"_115":116,"_117":27},"branch",{"_13":100,"_34":101,"_57":44,"_102":58,"_103":-5,"_104":-5,"_105":-5,"_106":-5,"_107":-5,"_108":59,"_109":110},"isOwned",541,"main","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","bao","handle","displayName","avatar","https://img.clerk.com/eyJ0eXBlIjoicHJveHkiLCJzcmMiOiJodHRwczovL2ltYWdlcy5jbGVyay5kZXYvb2F1dGhfZ2l0aHViL2ltZ18ycEVlOVBSNmVaOUp0aDdjYlNvajhVRlRtQ08ifQ","tier","free","canRestrictVals","profileImageUrl","branchName","","adoptOrgId",{"_57":58,"_34":59,"_40":1138,"_61":-5,"_62":63,"_64":65,"_66":65,"_67":-5,"_68":-5,"_18":69,"_70":71,"_72":63,"_73":-5,"_74":75,"_76":77,"_78":79,"_80":-5,"_81":-5,"_82":-5,"_83":-5,"_84":85,"_86":85,"_87":88,"_89":88,"_90":88,"_91":85,"_92":85,"_93":1139,"_95":1140,"_97":1141,"_99":27},"tree",[405,487,489,490,491,492,493,494,495,496,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511,512,513,514,515,516,517,518,519],"files",[405,406,407,408,409,410,411,412,413,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444,445,446,447,448,449,450,451,452,453,454,455,456,457,458,459,460,461,462,463,464,465,466,467,468,469,470,471,472,473,474,475,476,477,478,479,480,481,482,483,484,485,486,487,488,489,490,491,492,493,494,495,496,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511,512,513,514,515,516,517,518,519],"counts",{"_395":77,"_396":181,"_397":77,"_398":399,"_400":401},"contents",[141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173],"upstreamProject","upstreamBranch","emptyEnvVars","flags",[],"hasHttpFiles","grants","orgs","customDomains",{},{"_57":390,"_34":391,"_32":392,"_177":-5,"_43":44,"_42":199,"_179":27,"_40":393,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_29":394},{"_57":384,"_34":385,"_32":386,"_177":-5,"_43":44,"_42":199,"_179":63,"_40":387,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_29":389},{"_57":378,"_34":379,"_32":380,"_177":-5,"_43":44,"_42":199,"_179":27,"_40":381,"_13":77,"_35":22,"_37":382,"_26":27,"_183":-5,"_29":383},{"_57":372,"_34":373,"_32":374,"_177":-5,"_43":44,"_42":362,"_179":27,"_40":375,"_13":181,"_35":22,"_37":376,"_26":27,"_183":-5,"_29":377},{"_57":366,"_34":367,"_32":368,"_177":-5,"_43":44,"_42":330,"_179":27,"_40":369,"_13":304,"_35":36,"_37":370,"_26":27,"_183":-5,"_29":371},{"_57":359,"_34":360,"_32":361,"_177":-5,"_43":44,"_42":362,"_179":63,"_40":363,"_13":77,"_35":36,"_37":364,"_26":27,"_183":-5,"_29":365},{"_57":355,"_34":47,"_32":48,"_177":-5,"_43":44,"_42":14,"_179":27,"_40":356,"_13":357,"_35":36,"_37":50,"_26":27,"_183":-5,"_29":358},{"_57":348,"_34":349,"_32":350,"_177":-5,"_43":44,"_42":351,"_179":27,"_40":352,"_13":194,"_35":36,"_37":353,"_26":27,"_183":-5,"_29":354},{"_57":341,"_34":342,"_32":343,"_177":-5,"_43":44,"_42":344,"_179":63,"_40":345,"_13":223,"_35":36,"_37":346,"_26":27,"_183":-5,"_29":347},{"_57":334,"_34":335,"_32":336,"_177":-5,"_43":44,"_42":337,"_179":63,"_40":338,"_13":194,"_35":36,"_37":339,"_26":27,"_183":-5,"_29":340},{"_57":327,"_34":328,"_32":329,"_177":-5,"_43":44,"_42":330,"_179":63,"_40":331,"_13":324,"_35":36,"_37":332,"_26":27,"_183":-5,"_29":333},{"_57":319,"_34":320,"_32":321,"_177":-5,"_43":44,"_42":322,"_179":27,"_40":323,"_13":324,"_35":36,"_37":325,"_26":27,"_183":-5,"_29":326},{"_57":313,"_34":314,"_32":315,"_177":-5,"_43":44,"_42":199,"_179":63,"_40":316,"_13":77,"_35":22,"_37":317,"_26":27,"_183":-5,"_29":318},{"_57":307,"_34":308,"_32":309,"_177":-5,"_43":44,"_42":223,"_179":63,"_40":310,"_13":77,"_35":22,"_37":311,"_26":27,"_183":-5,"_29":312},{"_57":299,"_34":300,"_32":301,"_177":-5,"_43":44,"_42":302,"_179":63,"_40":303,"_13":304,"_35":36,"_37":305,"_26":27,"_183":-5,"_29":306},{"_57":293,"_34":294,"_32":295,"_177":-5,"_43":44,"_42":258,"_179":63,"_40":296,"_13":223,"_35":36,"_37":297,"_26":27,"_183":-5,"_29":298},{"_57":287,"_34":288,"_32":289,"_177":-5,"_43":44,"_42":206,"_179":63,"_40":290,"_13":223,"_35":36,"_37":291,"_26":27,"_183":-5,"_29":292},{"_57":280,"_34":281,"_32":282,"_177":-5,"_43":44,"_42":283,"_179":63,"_40":284,"_13":223,"_35":36,"_37":285,"_26":27,"_183":-5,"_29":286},{"_57":272,"_34":273,"_32":274,"_177":-5,"_43":44,"_42":275,"_179":27,"_40":276,"_13":277,"_35":36,"_37":278,"_26":27,"_183":-5,"_29":279},{"_57":265,"_34":266,"_32":267,"_177":-5,"_43":44,"_42":268,"_179":27,"_40":269,"_13":77,"_35":36,"_37":270,"_26":27,"_183":-5,"_29":271},{"_57":262,"_34":53,"_32":54,"_177":-5,"_43":44,"_42":14,"_179":27,"_40":263,"_13":77,"_35":36,"_37":55,"_26":27,"_183":-5,"_29":264},{"_57":255,"_34":256,"_32":257,"_177":-5,"_43":44,"_42":258,"_179":63,"_40":259,"_13":77,"_35":36,"_37":260,"_26":27,"_183":-5,"_29":261},{"_57":246,"_34":247,"_32":71,"_177":-5,"_43":44,"_42":248,"_179":63,"_40":249,"_13":250,"_35":251,"_37":252,"_26":27,"_183":253,"_29":254},{"_57":240,"_34":241,"_32":242,"_177":-5,"_43":44,"_42":178,"_179":63,"_40":243,"_13":194,"_35":36,"_37":244,"_26":27,"_183":-5,"_29":245},{"_57":233,"_34":234,"_32":235,"_177":-5,"_43":44,"_42":236,"_179":63,"_40":237,"_13":215,"_35":36,"_37":238,"_26":27,"_183":-5,"_29":239},{"_57":226,"_34":227,"_32":228,"_177":-5,"_43":44,"_42":229,"_179":63,"_40":230,"_13":77,"_35":36,"_37":231,"_26":27,"_183":-5,"_29":232},{"_57":218,"_34":219,"_32":220,"_177":-5,"_43":44,"_42":221,"_179":63,"_40":222,"_13":223,"_35":36,"_37":224,"_26":27,"_183":-5,"_29":225},{"_57":210,"_34":211,"_32":212,"_177":-5,"_43":44,"_42":213,"_179":27,"_40":214,"_13":215,"_35":36,"_37":216,"_26":27,"_183":-5,"_29":217},{"_57":203,"_34":204,"_32":205,"_177":-5,"_43":44,"_42":206,"_179":63,"_40":207,"_13":77,"_35":22,"_37":208,"_26":27,"_183":-5,"_29":209},{"_57":196,"_34":197,"_32":198,"_177":-5,"_43":44,"_42":199,"_179":63,"_40":200,"_13":77,"_35":36,"_37":201,"_26":27,"_183":-5,"_29":202},{"_57":192,"_34":30,"_32":33,"_177":-5,"_43":44,"_42":14,"_179":27,"_40":193,"_13":194,"_35":36,"_37":39,"_26":27,"_183":-5,"_29":195},{"_57":185,"_34":186,"_32":187,"_177":-5,"_43":44,"_42":188,"_179":63,"_40":189,"_13":77,"_35":36,"_37":190,"_26":27,"_183":-5,"_29":191},{"_57":174,"_34":175,"_32":176,"_177":-5,"_43":44,"_42":178,"_179":63,"_40":180,"_13":181,"_35":36,"_37":182,"_26":27,"_183":-5,"_29":184},"393bc5e2-c24c-11f0-9bca-42dde27851f2","wordHelpers.ts","d41a43f2-4422-11f0-89d5-76b3cceeab13","parentId",521,"latest",["D",1763229308190],2,"export function getUniqueLetters(word: string): string {\n return [...new Set(word.toUpperCase().replace(/[^A-Z]/g, \"\"))].join(\"\");\n}\n\nexport function randomLetter(): string {\n const ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n return ALPHABET[Math.floor(Math.random() * ALPHABET.length)];\n}\n\nexport function randomWordFromSentence(sentence: string): string {\n const words = sentence.split(\" \");\n for (let i = 0; i < words.length * 2; i++) {\n const word = words[Math.floor(Math.random() * words.length)];\n const alphabetsOnly = word.replace(/[^A-Za-z]/g, \"\");\n if (alphabetsOnly.length >= 4) {\n return alphabetsOnly.toUpperCase();\n }\n }\n return \"\";\n}\n\nexport function generateHint(\n quote: string,\n letterCount: number = 4\n): { hint: string; source: \"first\" | \"last\" } {\n const words = quote.split(\" \");\n let currentHint = \"\";\n let hintWithSpaceRemoved = \"\";\n let quoteWithLettersOnly = quote.replace(/[^A-Za-z]/g, \"\");\n\n const source = quote.length % 2 === 1 ? \"first\" : \"last\";\n if (source === \"first\") {\n // Iterate through words, building the hint until we have the specified number of letters\n for (let i = 0; i < quoteWithLettersOnly.length; i++) {\n currentHint += quoteWithLettersOnly[i];\n hintWithSpaceRemoved = currentHint.replace(/\\s/g, \"\");\n\n if (hintWithSpaceRemoved.length === letterCount) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"first\",\n };\n }\n }\n\n // Fallback: if we can't find the specified number of letters, return the first word\n return {\n hint: words[0],\n source: \"first\",\n };\n } else {\n // Iterate through words in reverse, building the hint until we have the specified number of letters\n for (let i = quoteWithLettersOnly.length - 1; i >= 0; i--) {\n currentHint = quoteWithLettersOnly[i] + currentHint;\n hintWithSpaceRemoved = currentHint.replace(/\\s/g, \"\");\n\n if (hintWithSpaceRemoved.length === letterCount) {\n return {\n hint: currentHint.toUpperCase(),\n source: \"last\",\n };\n }\n }\n\n // Fallback: if we can't find the specified number of letters, return the last word\n return {\n hint: words[words.length - 1],\n source: \"last\",\n };\n }\n}\n","label",[175],"f61dc908-c03a-11f0-b555-42dde27851f2","test_misspell.ts","f61dc9c6-c03a-11f0-b555-42dde27851f2",517,["D",1763001991791],"import { misspellSentence } from \"./misspellHelpers.ts\";\n\n// Test sentences with common words that have misspelling alternatives\nconst testSentences = [\n \"The only way to do great work is to love what you do.\",\n \"I think that you should always know what you want in life.\",\n \"When you have nothing, you must make something from your heart.\",\n \"People will never understand the truth about this world.\",\n \"Your time is limited, so don't waste it living someone else's life.\",\n \"The best time to plant a tree was 20 years ago. The second best time is now.\",\n \"Success is not final, failure is not fatal: it is the courage to continue that counts.\",\n \"Be yourself; everyone else is already taken.\",\n \"In the end, we will remember not the words of our enemies, but the silence of our friends.\",\n \"Life is what happens when you're busy making other plans.\"\n];\n\nconsole.log(\"=== Testing Misspell Function ===\\n\");\nconsole.log(\"Running misspellSentence with 33% chance per word\\n\");\nconsole.log(\"━\".repeat(80));\n\ntestSentences.forEach((sentence, index) => {\n console.log(`\\n${index + 1}. ORIGINAL:`);\n console.log(` ${sentence}`);\n \n // Run misspelling 3 times to show variation\n console.log(`\\n MISSPELLED VERSIONS:`);\n for (let i = 1; i <= 3; i++) {\n const misspelled = misspellSentence(sentence);\n console.log(` ${i}. ${misspelled}`);\n }\n \n console.log(\"\\n\" + \"━\".repeat(80));\n});\n\nconsole.log(\"\\n=== Testing with Higher Misspelling Rate (66%) ===\\n\");\n\nconst highRateSentence = \"I think you should know that your life will be better when you make the right choices.\";\nconsole.log(\"ORIGINAL:\");\nconsole.log(`${highRateSentence}\\n`);\nconsole.log(\"MISSPELLED (66% chance):\");\nfor (let i = 1; i <= 3; i++) {\n const misspelled = misspellSentence(highRateSentence, 66);\n console.log(`${i}. ${misspelled}`);\n}\n\nconsole.log(\"\\n=== Testing with Lower Misspelling Rate (15%) ===\\n\");\n\nconst lowRateSentence = \"I think you should know that your life will be better when you make the right choices.\";\nconsole.log(\"ORIGINAL:\");\nconsole.log(`${lowRateSentence}\\n`);\nconsole.log(\"MISSPELLED (15% chance):\");\nfor (let i = 1; i <= 3; i++) {\n const misspelled = misspellSentence(lowRateSentence, 15);\n console.log(`${i}. ${misspelled}`);\n}\n\n",[186],"b1eb8928-e3b2-11f0-9b4c-42dde27851f2",["D",1766901707702],4,[30],"2975aee6-a6e7-11f0-a077-0224a6c84d84","substitutionCipher.test.ts","2975af68-a6e7-11f0-a077-0224a6c84d84",496,["D",1760217221145],"import {\n assertEquals,\n assertMatch,\n} from \"https://deno.land/std@0.208.0/assert/mod.ts\";\nimport {\n substitutionEncode,\n substitutionAndReverseMaps,\n} from \"./substitutionCipher.ts\";\n\nDeno.test(\"Aristocrat - preserves punctuation and spacing\", () => {\n const plainText = \"Hello, World! How are you?\";\n const keyword = \"SECRET\";\n const positionLetter = \"A\";\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Verify punctuation is preserved\n assertEquals(result.encoded.includes(\",\"), true, \"Comma should be preserved\");\n assertEquals(\n result.encoded.includes(\"!\"),\n true,\n \"Exclamation mark should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"?\"),\n true,\n \"Question mark should be preserved\"\n );\n\n // Verify spaces are preserved in the same positions\n const originalSpaces = [...plainText]\n .map((c, i) => (c === \" \" ? i : -1))\n .filter((i) => i >= 0);\n const encodedSpaces = [...result.encoded]\n .map((c, i) => (c === \" \" ? i : -1))\n .filter((i) => i >= 0);\n assertEquals(\n encodedSpaces,\n originalSpaces,\n \"Spaces should be in the same positions\"\n );\n\n // Verify only letters are encoded\n const encodedWithoutSpaces = result.encoded.replace(/\\s/g, \"\");\n const plainTextWithoutSpaces = plainText.toUpperCase().replace(/\\s/g, \"\");\n\n for (let i = 0; i < encodedWithoutSpaces.length; i++) {\n const encodedChar = encodedWithoutSpaces[i];\n const plainChar = plainTextWithoutSpaces[i];\n\n if (/[A-Z]/.test(plainChar)) {\n // Letter should be encoded\n assertEquals(\n /[A-Z]/.test(encodedChar),\n true,\n `Encoded letter ${encodedChar} should be A-Z`\n );\n } else {\n // Punctuation should remain unchanged\n assertEquals(\n encodedChar,\n plainChar,\n `Punctuation ${plainChar} should be preserved`\n );\n }\n }\n\n // Verify encoded length matches original length\n assertEquals(\n result.encoded.length,\n plainText.length,\n \"Encoded text should have same length as original\"\n );\n});\n\nDeno.test(\"Aristocrat - letters are properly substituted\", () => {\n const plainText = \"Don't worry!\";\n const keyword = \"KEYWORD\";\n const positionLetter = \"B\";\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Extract only letters from encoded and original\n const encodedLetters = result.encoded.replace(/[^A-Z]/g, \"\");\n const originalLetters = plainText.toUpperCase().replace(/[^A-Z]/g, \"\");\n\n // Verify each letter is properly encoded using the substitution map\n for (let i = 0; i < originalLetters.length; i++) {\n const originalLetter = originalLetters[i];\n const expectedEncoded = result.substitutionMap[originalLetter];\n const actualEncoded = encodedLetters[i];\n assertEquals(\n actualEncoded,\n expectedEncoded,\n `Letter ${originalLetter} should encode to ${expectedEncoded}, got ${actualEncoded}`\n );\n }\n\n // Verify apostrophe and exclamation are preserved\n assertEquals(\n result.encoded.includes(\"'\"),\n true,\n \"Apostrophe should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"!\"),\n true,\n \"Exclamation should be preserved\"\n );\n});\n\nDeno.test(\n \"Patristocrat - strips punctuation and groups into 5-letter blocks\",\n () => {\n const plainText = \"Hello, World! How are you?\";\n const keyword = \"SECRET\";\n const positionLetter = \"A\";\n const type = \"k1\";\n const groupingType = \"patristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Verify no punctuation in encoded text\n assertEquals(\n /[^A-Z\\s]/.test(result.encoded),\n false,\n \"Should not contain any punctuation\"\n );\n\n // Verify letters are grouped into 5-letter blocks\n const groups = result.encoded.split(\" \");\n\n // All groups except possibly the last should have 5 letters\n for (let i = 0; i < groups.length - 1; i++) {\n assertEquals(groups[i].length, 5, `Group ${i} should have 5 letters`);\n }\n\n // Last group should have 1-5 letters\n const lastGroup = groups[groups.length - 1];\n assertEquals(\n lastGroup.length >= 1 && lastGroup.length <= 5,\n true,\n \"Last group should have between 1 and 5 letters\"\n );\n\n // Verify all encoded characters are uppercase letters\n const encodedWithoutSpaces = result.encoded.replace(/\\s/g, \"\");\n assertEquals(\n /^[A-Z]+$/.test(encodedWithoutSpaces),\n true,\n \"All characters (except spaces) should be uppercase letters\"\n );\n }\n);\n\nDeno.test(\n \"Patristocrat - same substitution as aristocrat but different formatting\",\n () => {\n const plainText = \"Test message!\";\n const keyword = \"KEY\";\n const positionLetter = \"C\";\n const type = \"k2\";\n\n const aristocrat = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType: \"aristocrat\",\n });\n\n const patristocrat = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType: \"patristocrat\",\n });\n\n // Both should use the same substitution map\n assertEquals(\n aristocrat.substitutionMap,\n patristocrat.substitutionMap,\n \"Both should use same substitution map\"\n );\n\n // Extract letters only from both\n const aristocratLetters = aristocrat.encoded.replace(/[^A-Z]/g, \"\");\n const patristocratLetters = patristocrat.encoded.replace(/[^A-Z]/g, \"\");\n\n // Same letters, same encoding\n assertEquals(\n aristocratLetters,\n patristocratLetters,\n \"Same letters should be encoded identically\"\n );\n\n // But different formatting\n assertEquals(\n aristocrat.encoded === patristocrat.encoded,\n false,\n \"Formatting should be different\"\n );\n }\n);\n\nDeno.test(\n \"Caesar cipher (K1 with empty keyword) - aristocrat preserves punctuation\",\n () => {\n const plainText = \"Hello, Caesar!\";\n const keyword = \"\";\n const positionLetter = \"D\"; // Shift of 3\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Verify it's a Caesar cipher (shift cipher)\n const { substitutionMap } = result;\n\n // For Caesar with shift 3 (D), A->D, B->E, C->F, etc.\n assertEquals(substitutionMap[\"A\"], \"D\", \"A should map to D\");\n assertEquals(substitutionMap[\"B\"], \"E\", \"B should map to E\");\n assertEquals(substitutionMap[\"C\"], \"F\", \"C should map to F\");\n\n // Verify punctuation is preserved\n assertEquals(\n result.encoded.includes(\",\"),\n true,\n \"Comma should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"!\"),\n true,\n \"Exclamation should be preserved\"\n );\n\n // Verify the encoding\n assertEquals(result.encoded.charAt(0), \"K\", \"H (pos 7) + 3 = K (pos 10)\");\n assertEquals(result.encoded.includes(\",\"), true, \"Should have comma\");\n assertEquals(result.encoded.includes(\"!\"), true, \"Should have exclamation\");\n }\n);\n\nDeno.test(\"Letter counts - should only count letters, not punctuation\", () => {\n const plainText = \"A, A, A! B, B!\";\n const keyword = \"TEST\";\n const positionLetter = \"A\";\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Count how many times 'A' and 'B' appear in original\n const aCount = (plainText.match(/A/gi) || []).length;\n const bCount = (plainText.match(/B/gi) || []).length;\n\n // Get encoded letters for A and B\n const encodedA = result.substitutionMap[\"A\"];\n const encodedB = result.substitutionMap[\"B\"];\n\n // Verify counts match\n assertEquals(\n result.encodedLetterCounts[encodedA],\n aCount,\n `Encoded letter for A should appear ${aCount} times`\n );\n assertEquals(\n result.encodedLetterCounts[encodedB],\n bCount,\n `Encoded letter for B should appear ${bCount} times`\n );\n\n // Verify punctuation doesn't appear in counts\n assertEquals(\n result.encodedLetterCounts[\",\"],\n undefined,\n \"Comma should not be in letter counts\"\n );\n assertEquals(\n result.encodedLetterCounts[\"!\"],\n undefined,\n \"Exclamation should not be in letter counts\"\n );\n});\n\nDeno.test(\"cleanOriginal - should only contain letters\", () => {\n const plainText = \"Hello, World! 123\";\n const keyword = \"KEY\";\n const positionLetter = \"A\";\n const type = \"k1\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // cleanOriginal should be letters only, no punctuation or numbers\n assertEquals(\n /^[A-Z]+$/.test(result.cleanOriginal),\n true,\n \"cleanOriginal should only contain uppercase letters\"\n );\n assertEquals(\n result.cleanOriginal,\n \"HELLOWORLD\",\n \"cleanOriginal should be HELLOWORLD\"\n );\n});\n\nDeno.test(\"Various punctuation marks - aristocrat\", () => {\n const plainText = \"One-two-three... Go! (Now)\";\n const keyword = \"WORD\";\n const positionLetter = \"A\";\n const type = \"k2\";\n const groupingType = \"aristocrat\";\n\n const result = substitutionEncode({\n plainText,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n\n // Verify all punctuation is preserved\n assertEquals(\n result.encoded.includes(\"-\"),\n true,\n \"Hyphen should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\".\"),\n true,\n \"Period should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"!\"),\n true,\n \"Exclamation should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\"(\"),\n true,\n \"Opening parenthesis should be preserved\"\n );\n assertEquals(\n result.encoded.includes(\")\"),\n true,\n \"Closing parenthesis should be preserved\"\n );\n\n // Count punctuation marks\n const originalPunctCount = (plainText.match(/[^A-Za-z\\s]/g) || []).length;\n const encodedPunctCount = (result.encoded.match(/[^A-Z\\s]/g) || []).length;\n assertEquals(\n encodedPunctCount,\n originalPunctCount,\n \"Number of punctuation marks should be preserved\"\n );\n});\n",[197],"229d604e-a798-11f0-8271-0224a6c84d84","run_tests.sh","229d60d0-a798-11f0-8271-0224a6c84d84",506,["D",1760293230598],"#!/bin/bash\n\n# Script to run all unit tests in the cipher project\n\necho \"Running all unit tests...\"\necho \"========================\"\necho \"\"\n\n# Find all .test.ts files and run them\ndeno test --allow-net --no-check *.test.ts\n\necho \"\"\necho \"========================\"\necho \"Tests completed!\"\n\n",[204],"ec6a18dc-c038-11f0-a9af-42dde27851f2","quoteService.ts","229d5644-a798-11f0-8271-0224a6c84d84",515,["D",1763001116519],3,"import { getKnownTexts } from \"./gameHelpers.ts\";\nimport { post } from \"./networkHelpers.ts\";\nimport { randomLetter } from \"./wordHelpers.ts\";\nimport { substitutionEncode } from \"./substitutionCipher.ts\";\nimport { misspellSentence } from \"./misspellHelpers.ts\";\n\nexport interface FetchQuoteResult {\n cipher: ReturnType | null;\n author: string | null;\n knownTexts: string[];\n error: string | null;\n}\n\nexport async function fetchQuote(uuid: string): Promise {\n try {\n const known = await getKnownTexts();\n\n let loadedFromUUID = false;\n let cipher: ReturnType | null = null;\n let author: string | null = null;\n\n if (uuid) {\n let value: any = undefined;\n while (value === undefined) {\n const response = await fetch(\n `https://simplevalueapi.val.run/getValue?id=${uuid}`\n );\n const responseData = await response.json();\n if (responseData?.error) {\n break;\n }\n value = responseData?.value;\n if (!value) {\n await new Promise((resolve) => setTimeout(resolve, 500));\n }\n }\n const newCipher = value?.cipher;\n const fetchedAuthor = value?.author;\n if (newCipher && fetchedAuthor) {\n cipher = newCipher;\n author = fetchedAuthor;\n loadedFromUUID = true;\n }\n }\n\n if (!loadedFromUUID) {\n if (uuid) {\n // mark this uuid as known\n await post(\"https://simplevalueapi.val.run/setValue\", {\n id: uuid,\n });\n }\n let quote = \"\";\n let fetchedAuthor = \"\";\n let responseKeyword = \"\";\n while (quote === \"\") {\n const response = await fetch(`/quote`);\n const responseData = await response.json();\n if ((responseData?.quote?.length ?? 0) >= 5) {\n responseKeyword = responseData.keyword;\n quote = responseData.quote;\n fetchedAuthor = responseData.author;\n break;\n }\n }\n\n // Cipher type randomization logic:\n // We have 6 total cipher types, each with equal 1/6 probability:\n // - Aristocrat (66%): k1 (16.67%), k1-caesar (16.67%), k2 (16.67%), random (16.67%)\n // - Patristocrat (33%): k1 (16.67%), k2 (16.67%)\n const groupingType =\n Math.random() < 2 / 3 ? \"aristocrat\" : \"patristocrat\";\n const typeRandom = Math.random();\n const type =\n groupingType === \"aristocrat\"\n ? typeRandom < 0.5\n ? \"k1\"\n : typeRandom < 0.75\n ? \"k2\"\n : \"random\"\n : typeRandom < 0.5\n ? \"k1\"\n : \"k2\";\n\n // For k1 aristocrat, 50% chance of empty keyword (Caesar cipher)\n const isCaesar =\n type === \"k1\" && groupingType === \"aristocrat\" && Math.random() < 0.5;\n const keyword = isCaesar ? \"\" : responseKeyword;\n\n // Always create cipher with the original quote\n const positionLetter = randomLetter();\n const newCipher = substitutionEncode({\n plainText: quote,\n keyword,\n positionLetter,\n type,\n groupingType,\n });\n cipher = newCipher;\n author = fetchedAuthor;\n if (uuid) {\n await post(\"https://simplevalueapi.val.run/setValue\", {\n id: uuid,\n value: { cipher: newCipher, author: fetchedAuthor },\n });\n }\n }\n\n return {\n cipher,\n author,\n knownTexts: known,\n error: null,\n };\n } catch (error) {\n console.error(\"Failed to fetch quote:\", error);\n return {\n cipher: null,\n author: null,\n knownTexts: [],\n error: `${error}`,\n };\n }\n}\n",[211],"df182b86-b743-11f0-a388-0224a6c84d84","quoteService.test.ts","229d49ce-a798-11f0-8271-0224a6c84d84",511,["D",1762016258186],1,"import {\n assertEquals,\n assert,\n} from \"https://deno.land/std@0.208.0/assert/mod.ts\";\nimport { fetchQuote } from \"./quoteService.ts\";\nimport { substitutionEncode } from \"./substitutionCipher.ts\";\nimport { post } from \"./networkHelpers.ts\";\n\n/**\n * Helper to create a test game that won't expire during testing\n * Returns null if creation fails (e.g., network issues)\n */\nasync function createTestGame(): Promise {\n try {\n const testUuid = `cipher-test-${Date.now()}`;\n const testCipher = substitutionEncode({\n plainText: \"This is a test quote for testing.\",\n keyword: \"TEST\",\n positionLetter: \"A\",\n type: \"k1\",\n groupingType: \"aristocrat\",\n });\n\n await post(\"https://simplevalueapi.val.run/setValue\", {\n id: testUuid,\n value: { cipher: testCipher, author: \"Test Author\" },\n });\n\n // Give the API a moment to save\n await new Promise((resolve) => setTimeout(resolve, 500));\n\n return testUuid;\n } catch (error) {\n console.error(\"Failed to create test game:\", error);\n return null;\n }\n}\n\nDeno.test({\n name: \"fetchQuote - loads existing game from UUID\",\n async fn() {\n // Create a fresh test game\n const testUuid = await createTestGame();\n\n if (!testUuid) {\n console.log(\"⚠️ Skipping test - could not create test game\");\n return; // Skip test if we can't create a test game\n }\n\n const result = await fetchQuote(testUuid);\n\n // Should successfully load the game\n assertEquals(result.error, null, \"Should not have an error\");\n assert(result.cipher !== null, \"Should have a cipher\");\n assertEquals(\n result.author,\n \"Test Author\",\n \"Should have the correct author\"\n );\n assert(Array.isArray(result.knownTexts), \"Should have known texts array\");\n },\n sanitizeResources: false, // Network requests may leave resources open\n});\n\nDeno.test(\n \"fetchQuote - handles non-existent UUID (skipped - requires /quote endpoint)\",\n async () => {\n // This test requires the /quote endpoint which only works in browser context\n // Skip for now - could be implemented with a mock server\n }\n);\n\nDeno.test({\n name: \"fetchQuote - cipher has required properties\",\n async fn() {\n // Create a fresh test game\n const testUuid = await createTestGame();\n\n if (!testUuid) {\n console.log(\"⚠️ Skipping test - could not create test game\");\n return;\n }\n\n const result = await fetchQuote(testUuid);\n\n assert(result.cipher !== null, \"Should have a cipher\");\n\n if (result.cipher) {\n // Check all required properties exist\n assert(\n typeof result.cipher.encoded === \"string\",\n \"encoded should be a string\"\n );\n assert(\n typeof result.cipher.original === \"string\",\n \"original should be a string\"\n );\n assert(\n typeof result.cipher.cleanOriginal === \"string\",\n \"cleanOriginal should be a string\"\n );\n assert(\n typeof result.cipher.keyword === \"string\",\n \"keyword should be a string\"\n );\n assert(\n typeof result.cipher.positionLetter === \"string\",\n \"positionLetter should be a string\"\n );\n assert(\n [\"k1\", \"k2\", \"random\"].includes(result.cipher.type),\n \"type should be k1, k2, or random\"\n );\n assert(\n [\"aristocrat\", \"patristocrat\"].includes(result.cipher.groupingType),\n \"groupingType should be aristocrat or patristocrat\"\n );\n assert(\n typeof result.cipher.substitutionMap === \"object\",\n \"should have substitutionMap\"\n );\n assert(\n typeof result.cipher.reverseSubstitutionMap === \"object\",\n \"should have reverseSubstitutionMap\"\n );\n }\n },\n sanitizeResources: false, // Network requests may leave resources open\n});\n\nDeno.test(\n \"fetchQuote - aristocrat preserves punctuation (skipped - requires /quote endpoint)\",\n async () => {\n // This test requires creating new games which needs /quote endpoint\n // Punctuation preservation is tested in substitutionCipher.test.ts\n }\n);\n\nDeno.test(\n \"fetchQuote - patristocrat strips punctuation (skipped - requires /quote endpoint)\",\n async () => {\n // This test requires creating new games which needs /quote endpoint\n // Punctuation stripping is tested in substitutionCipher.test.ts\n }\n);\n\nDeno.test(\n \"fetchQuote - handles empty UUID (skipped - requires /quote endpoint)\",\n async () => {\n // This test requires /quote endpoint\n // Could be implemented with a mock server\n }\n);\n\nDeno.test({\n name: \"fetchQuote - gracefully handles errors\",\n async fn() {\n // Test with a UUID that definitely doesn't exist\n const nonExistentUuid = `cipher-nonexistent-${Date.now()}`;\n const result = await fetchQuote(nonExistentUuid);\n\n // Should have knownTexts array regardless\n assert(\n Array.isArray(result.knownTexts),\n \"Should always return knownTexts array\"\n );\n\n // When UUID doesn't exist in Deno context without /quote endpoint,\n // it should return an error\n // In browser context with /quote endpoint, it would create a new game\n },\n sanitizeResources: false, // /quote endpoint causes resource leak in test environment\n});\n\nDeno.test({\n name: \"fetchQuote - always returns knownTexts array\",\n async fn() {\n // Create a valid test game to ensure we get a proper response\n const testUuid = await createTestGame();\n\n if (!testUuid) {\n console.log(\"⚠️ Skipping test - could not create test game\");\n return;\n }\n\n const result = await fetchQuote(testUuid);\n\n // Should always return a knownTexts array\n assert(Array.isArray(result.knownTexts), \"knownTexts should be an array\");\n },\n sanitizeResources: false,\n});\n",[219],"241abd8a-44b1-11f0-a3f3-76b3cceeab13","networkHelpers.ts","241abe2a-44b1-11f0-a3f3-76b3cceeab13",383,["D",1749418805397],"export async function post(url: string, data: any) {\n return await fetch(url, {\n method: \"POST\",\n headers: {\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify(data),\n });\n}",[227],"eeeea684-4fbf-11f0-9f08-f69ea79377d9","nativeToWeb.ts","9afed40a-4fbe-11f0-bcd3-f69ea79377d9",472,["D",1750634621433],"import { startNewGame } from \"./gameHelpers.ts\";\n\nexport function setupNativeToWebHandlers({ uuid }: { uuid: string }) {\n if (window.WebNativeBridge) {\n window.WebNativeBridge.nativeToWeb = (data: any) => {\n if (data.action === \"startNewGame\") {\n startNewGame(uuid);\n } else if (data.action === \"alive\") {\n return { result: true };\n }\n };\n }\n}",[234],"393bae18-c24c-11f0-9bca-42dde27851f2","misspellHelpers.ts","ca1e62ec-bf93-11f0-8a96-42dde27851f2",["D",1763229308190],"/**\n * Map of common words to their misspelled/homophone alternatives.\n * These words are ALWAYS misspelled when encountered.\n */\nconst REPLACEMENT_MAP: Record = {\n that: [\"tht\", \"dat\", \"taht\", \"sat\"],\n your: [\"ur\", \"yor\", \"yer\", \"you're\"],\n have: [\"hav\", \"hve\", \"haf\", \"half\"],\n with: [\"wth\", \"weeth\", \"wit\", \"wiz\"],\n what: [\"wat\", \"wht\", \"wut\", \"whut\"],\n will: [\"wil\", \"whil\", \"whill\", \"wheel\"],\n when: [\"wen\", \"whn\", \"wren\", \"whe\"],\n they: [\"thay\", \"thy\", \"dey\", \"thei\"],\n there: [\"their\", \"ther\", \"thier\", \"der\"],\n life: [\"lyfe\", \"lif\", \"lfe\", \"lief\"],\n people: [\"ppl\", \"peple\", \"peepl\", \"peeple\"],\n than: [\"then\", \"thn\", \"dan\", \"thang\"],\n only: [\"onli\", \"onle\", \"onley\", \"ownly\"],\n love: [\"luv\", \"lov\", \"luve\", \"lav\"],\n from: [\"frm\", \"frum\", \"fom\", \"frorm\"],\n world: [\"wrld\", \"wurld\", \"worl\", \"werld\"],\n which: [\"wich\", \"whch\", \"witch\", \"wic\"],\n more: [\"mor\", \"moar\", \"moor\", \"mre\"],\n like: [\"lyk\", \"lighk\", \"lyke\", \"lke\"],\n them: [\"thm\", \"dem\", \"thum\", \"tham\"],\n never: [\"nevr\", \"neva\", \"nver\", \"nevar\"],\n things: [\"thngs\", \"thingz\", \"thangs\", \"tings\"],\n good: [\"gud\", \"gd\", \"goo\", \"guud\"],\n know: [\"no\", \"kno\", \"noe\", \"knw\"],\n this: [\"dis\", \"ths\", \"tis\", \"thiss\"],\n must: [\"mst\", \"mus\", \"musst\", \"muhst\"],\n time: [\"tym\", \"tyme\", \"tim\", \"thyme\"],\n make: [\"mak\", \"maek\", \"mek\", \"mke\"],\n without: [\"w/o\", \"withut\", \"witout\", \"wthout\"],\n always: [\"alwys\", \"alwayz\", \"allways\", \"awlays\"],\n their: [\"there\", \"thier\", \"thir\", \"der\"],\n nothing: [\"nuthing\", \"nothin\", \"nothng\", \"nuting\"],\n because: [\"becuz\", \"becaus\", \"bcuz\", \"cuz\"],\n every: [\"evry\", \"evrey\", \"evory\", \"evri\"],\n should: [\"shud\", \"shuld\", \"shoud\", \"shld\"],\n live: [\"liv\", \"lyve\", \"lve\", \"lief\"],\n yourself: [\"urself\", \"yorself\", \"yurself\", \"youself\"],\n does: [\"dus\", \"doez\", \"duz\", \"dose\"],\n something: [\"somethin\", \"sumthing\", \"somthing\", \"somethn\"],\n think: [\"thnk\", \"thynk\", \"tink\", \"thik\"],\n others: [\"othrs\", \"otherz\", \"othes\", \"uthers\"],\n about: [\"bout\", \"abowt\", \"abt\", \"abut\"],\n most: [\"mst\", \"moast\", \"mosst\", \"mos\"],\n those: [\"thos\", \"thoes\", \"doze\", \"dose\"],\n then: [\"than\", \"thn\", \"den\", \"thun\"],\n mind: [\"mynd\", \"mnd\", \"mined\", \"mihnd\"],\n cannot: [\"cant\", \"canot\", \"cannt\", \"kant\"],\n would: [\"wud\", \"wuld\", \"wood\", \"wude\"],\n want: [\"wnt\", \"wont\", \"wount\", \"waunt\"],\n just: [\"dgust\", \"jus\", \"jost\", \"jast\"],\n other: [\"ozzer\", \"uther\", \"othur\", \"odder\"],\n into: [\"intwo\", \"intoo\", \"intu\", \"innto\"],\n thing: [\"think\", \"thin\", \"ting\", \"thang\"],\n great: [\"grate\", \"greit\", \"gret\", \"graet\"],\n being: [\"bein\", \"beeing\", \"bean\", \"beying\"],\n person: [\"peson\", \"persun\", \"persen\", \"pearson\"],\n heart: [\"hart\", \"hrt\", \"herat\", \"hort\"],\n even: [\"eeven\", \"evan\", \"evin\", \"evun\"],\n find: [\"faind\", \"fynd\", \"fined\", \"fiend\"],\n right: [\"rite\", \"ryght\", \"wright\", \"rigt\"],\n better: [\"beter\", \"bettr\", \"bettar\", \"bettor\"],\n become: [\"beecome\", \"becom\", \"bekome\", \"becalm\"],\n were: [\"where\", \"wer\", \"ware\", \"wure\"],\n some: [\"sum\", \"som\", \"son\", \"song\"],\n truth: [\"tooth\", \"troof\", \"trueth\", \"truce\"],\n knowledge: [\"knowlege\", \"knolege\", \"nowledge\", \"noledge\"],\n};\n\n/**\n * Introduces misspellings into a sentence by randomly misspelling words.\n * Strategy:\n * 1. First pass: Replace all words in REPLACEMENT_MAP\n * 2. Calculate target misspellings based on total words * chance\n * 3. If needed, misspell the longest remaining words using swapAdjacentLetters\n *\n * @param sentence - The input sentence to misspell\n * @param misspellingChance - The probability (0-100) that each word will be misspelled. Defaults to 33.\n * @returns The sentence with some words misspelled\n */\nexport function misspellSentence(\n sentence: string,\n misspellingChance: number = 33\n): string {\n // Split sentence into words and non-word characters (spaces, punctuation, etc.)\n const tokens = sentence.split(/(\\s+|[.,!?;:'\"()[\\]{}])/);\n\n // Track word indices and whether they were misspelled\n interface WordInfo {\n index: number;\n word: string;\n misspelled: boolean;\n isCommonWord: boolean;\n }\n\n const wordInfos: WordInfo[] = [];\n\n // First pass: identify all words and replace common words\n const tokensAfterFirstPass = tokens.map((token, index) => {\n // Only process actual words (not spaces or punctuation)\n if (!/\\w+/.test(token) || token.trim() === \"\") {\n return token;\n }\n\n const isCommonWord = isInReplacementMap(token);\n\n if (isCommonWord) {\n // Replace with misspelled version\n const misspelled = replaceSimilarSound(token);\n wordInfos.push({\n index,\n word: token,\n misspelled: true,\n isCommonWord: true,\n });\n return misspelled;\n } else {\n // Keep original for now\n wordInfos.push({\n index,\n word: token,\n misspelled: false,\n isCommonWord: false,\n });\n return token;\n }\n });\n\n // Count how many words we've misspelled and how many we should misspell\n const totalWords = wordInfos.length;\n const wordsReplaced = wordInfos.filter((w) => w.misspelled).length;\n const targetMisspellings = Math.round((totalWords * misspellingChance) / 100);\n\n // If we need more misspellings, find the longest N words to misspell\n if (wordsReplaced < targetMisspellings) {\n const difference = targetMisspellings - wordsReplaced;\n\n // Get words that haven't been misspelled yet, sorted by length (longest first)\n const unmmisspelledWords = wordInfos\n .filter((w) => !w.misspelled)\n .sort((a, b) => b.word.length - a.word.length);\n\n // Misspell the longest N words\n const wordsToMisspell = unmmisspelledWords.slice(0, difference);\n\n // Apply swapAdjacentLetters to these words\n wordsToMisspell.forEach((wordInfo) => {\n const misspelled = swapAdjacentLetters(wordInfo.word);\n tokensAfterFirstPass[wordInfo.index] = misspelled;\n wordInfo.misspelled = true;\n });\n }\n\n return tokensAfterFirstPass.join(\"\");\n}\n\n/**\n * Checks if a word is in the replacement map (common words that should always be misspelled)\n */\nfunction isInReplacementMap(word: string): boolean {\n return word.toLowerCase() in REPLACEMENT_MAP;\n}\n\n/**\n * Swaps two adjacent letters in a word\n */\nfunction swapAdjacentLetters(word: string): string {\n if (word.length < 2) {\n return word;\n }\n\n // Pick a random position to swap (not the last character)\n const pos = Math.floor(Math.random() * (word.length - 1));\n\n const chars = word.split(\"\");\n // Swap characters at pos and pos+1\n [chars[pos], chars[pos + 1]] = [chars[pos + 1], chars[pos]];\n\n return chars.join(\"\");\n}\n\n/**\n * Replaces whole words with similar-sounding alternatives or common misspellings\n */\nfunction replaceSimilarSound(word: string): string {\n // Check if the word (case-insensitive) is in the replacement map\n const lowerWord = word.toLowerCase();\n const replacements = REPLACEMENT_MAP[lowerWord];\n\n if (replacements && replacements.length > 0) {\n // Pick a random replacement\n const replacement =\n replacements[Math.floor(Math.random() * replacements.length)];\n\n return replacement;\n }\n\n // If no replacement found, fall back to swapping adjacent letters\n return swapAdjacentLetters(word);\n}\n",[241],"f3c15666-c805-11f0-8990-42dde27851f2","main.tsx",522,["D",1763858833829],384,"http","/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { createRoot } from \"https://esm.sh/react-dom@18.2.0/client\";\nimport { appSiteAssociation, getQuote } from \"./api.ts\";\nimport { App } from \"./App.tsx\";\nimport { quoteCount } from \"./constants.ts\";\n\nfunction client() {\n const root = document.getElementById(\"root\");\n if (root) {\n const uuid = root.dataset.uuid;\n createRoot(root).render();\n }\n}\nif (typeof document !== \"undefined\") {\n client();\n}\n\nexport default async function server(request: Request): Promise {\n const requestPath = new URL(request.url).pathname;\n if (requestPath === \"/quote\") {\n return getQuote(request);\n } else if (requestPath === \"/.well-known/apple-app-site-association\") {\n return appSiteAssociation();\n }\n\n let paramUuid: string | null;\n let numberId: string | undefined;\n let match = requestPath.match(/\\/(\\d+)/);\n if (match && parseInt(match[1]) >= 0) {\n paramUuid = \"cipher-\" + match[1];\n numberId = match[1];\n console.log(\"paramUuid:\", paramUuid);\n } else {\n let randonNum = Math.round(Math.random() * 1000000);\n paramUuid = `cipher-${randonNum}`;\n numberId = `${randonNum}`;\n }\n const displayUuid = paramUuid;\n\n return new Response(\n `\n \n \n Cipher Challenge\n \n \n \n \n

\n \n \n \n \n \n \n \n `,\n {\n headers: {\n \"content-type\": \"text/html\",\n },\n }\n );\n}\n","bao-cipher",[247],"02f17e2c-e28c-11f0-a32d-42dde27851f2","letterReplacement.test.ts","02f17ec2-e28c-11f0-a32d-42dde27851f2",523,["D",1766775142106],"import { assertEquals } from \"https://deno.land/std@0.208.0/assert/mod.ts\";\n\n/**\n * Test for letter replacement functionality\n * \n * This test verifies that users can replace letters in filled input boxes\n * without having to hit backspace first. The feature should:\n * 1. Detect when a letter key is pressed on a filled input\n * 2. Clear the old letter from all matching positions\n * 3. Fill the new letter in all matching positions\n * 4. Move focus to the next empty input\n */\n\nDeno.test(\"Letter replacement - simulates the desired behavior\", () => {\n // Simulate initial state with some letters filled\n const decryptionAttempt = [\"A\", \"B\", \"C\", \"\", \"\", \"A\", \"\", \"B\"];\n const encodedLettersOnly = \"XYZWQXRY\"; // Encoded cipher text (letters only)\n const letterIndex = 0; // User is focused on first input which has \"A\"\n const newLetter = \"D\"; // User types \"D\"\n \n // Simulate the replacement logic\n const encodedLetter = encodedLettersOnly[letterIndex]; // \"X\"\n const newAttempt = [...decryptionAttempt];\n \n // Clear all instances of the encoded letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = \"\";\n }\n });\n \n // Set all instances to the new letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = newLetter;\n }\n });\n \n // Verify the replacement worked correctly\n assertEquals(newAttempt[0], \"D\", \"First position (X) should now be D\");\n assertEquals(newAttempt[5], \"D\", \"Sixth position (also X) should now be D\");\n assertEquals(newAttempt[1], \"B\", \"Second position (Y) should remain B\");\n assertEquals(newAttempt[2], \"C\", \"Third position (Z) should remain C\");\n assertEquals(newAttempt[7], \"B\", \"Eighth position (Y) should remain B\");\n});\n\nDeno.test(\"Letter replacement - handles empty fields correctly\", () => {\n // When field is empty, normal input should work\n const decryptionAttempt = [\"\", \"B\", \"C\", \"\", \"\", \"\", \"\", \"B\"];\n const encodedLettersOnly = \"XYZWQXRY\";\n const letterIndex = 0; // User is focused on first input which is empty\n const newLetter = \"A\";\n \n const encodedLetter = encodedLettersOnly[letterIndex]; // \"X\"\n const newAttempt = [...decryptionAttempt];\n \n // Since the regex test /^[a-zA-Z]$/.test(event.key) && decryptionAttempt[letterIndex]\n // would be false (field is empty), this path wouldn't execute\n // But let's test that the normal handleLetterChange would work\n \n // Set all instances to the new letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = newLetter;\n }\n });\n \n assertEquals(newAttempt[0], \"A\", \"First position should be A\");\n assertEquals(newAttempt[5], \"A\", \"Sixth position should also be A (same encoded letter)\");\n});\n\nDeno.test(\"Letter replacement - replaces multiple instances\", () => {\n // When replacing a letter that appears multiple times\n const decryptionAttempt = [\"T\", \"E\", \"S\", \"T\", \"\", \"T\", \"E\", \"\"];\n const encodedLettersOnly = \"XYZXQXYQ\"; // X appears at indices 0, 3, 5\n const letterIndex = 0; // Replacing \"T\" (encoded as X)\n const newLetter = \"R\";\n \n const encodedLetter = encodedLettersOnly[letterIndex]; // \"X\"\n const newAttempt = [...decryptionAttempt];\n \n // Clear all X positions\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = \"\";\n }\n });\n \n // Set all X positions to new letter\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n newAttempt[idx] = newLetter;\n }\n });\n \n assertEquals(newAttempt[0], \"R\", \"Position 0 should be R\");\n assertEquals(newAttempt[3], \"R\", \"Position 3 should be R\");\n assertEquals(newAttempt[5], \"R\", \"Position 5 should be R\");\n assertEquals(newAttempt[1], \"E\", \"Position 1 should remain E\");\n assertEquals(newAttempt[2], \"S\", \"Position 2 should remain S\");\n assertEquals(newAttempt[6], \"E\", \"Position 6 should remain E\");\n});\n\n",[256],"b1eacaec-e3b2-11f0-9b4c-42dde27851f2",["D",1766901707702],[53],"d41a3a1a-4422-11f0-89d5-76b3cceeab13","gameHelpers.ts","d41a3b5a-4422-11f0-89d5-76b3cceeab13",378,["D",1749357682642],"import { isMobileNative, sendBridgeMessage } from \"./bridge.ts\";\n\nexport function startNewGame(input: string) {\n const number = parseInt(input.replace(\"cipher-\", \"\"));\n if (number >= 0) {\n const newId = `cipher-${number + 1}`;\n window.location.href = `${window.location.origin}/${newId.replace(\"cipher-\", \"\")}`;\n } else {\n present(\"The game is not available yet\");\n }\n}\n\nexport function present(text: string) {\n alert(text);\n void sendBridgeMessage({ action: \"present\", data: { message: text } });\n}\n\nexport function appendToLocalStorage(text: string, author: string | null): void {\n const newValue = `${text} - ${author ?? \"\"}`;\n if (isMobileNative()) {\n void sendBridgeMessage({ action: \"appendKnownQuote\", data: { quote: newValue } });\n return;\n }\n\n const key = \"known_texts\";\n // Get the existing data from local storage\n const storedData = localStorage.getItem(key);\n\n // If it exists, parse it; otherwise, use an empty array\n let arr: string[] = storedData ? JSON.parse(storedData) : [];\n\n // Push the new value onto the array if it is not already in it\n if (!arr.includes(newValue)) {\n arr.push(newValue);\n }\n\n // Save the updated array back to local storage\n localStorage.setItem(key, JSON.stringify(arr));\n}\n\nexport function isTextKnown(text: string, author: string | null, texts: string[]): boolean {\n const set = new Set(texts);\n return set.has(`${text} - ${author ?? \"\"}`);\n}\n\nexport async function getKnownTexts(): Promise {\n if (isMobileNative()) {\n const result = await sendBridgeMessage({ action: \"requestKnownQuotes\", data: {} });\n return result?.[\"quotes\"] ?? [];\n }\n const key = \"known_texts\";\n const storedData = localStorage.getItem(key);\n return storedData ? JSON.parse(storedData) : [];\n}",[266],"ca1ea004-bf93-11f0-8a96-42dde27851f2","constants.ts","d41a38e4-4422-11f0-89d5-76b3cceeab13",512,["D",1762930192045],18,"export const quoteCount = 4806;\n\nexport const tutorialUrl = \"https://baolei.notion.site/ciphertutorial\";\nexport const strategyUrl = \"https://baolei.notion.site/cipherstrategy\";\n",[273],"6386d184-a721-11f0-a70d-0224a6c84d84","cipherHelpers.ts","2975a900-a6e7-11f0-a077-0224a6c84d84",504,["D",1760242229389],"export function getCipherName(\n type: string,\n keyword: string,\n groupingType: string\n): string {\n // Caesar cipher is a special case of K1 aristocrat with empty keyword\n if (type === \"k1\" && keyword === \"\" && groupingType === \"aristocrat\") {\n return \"Caesar Cipher\";\n }\n\n // Capitalize first letter of type and groupingType\n const capitalizedType = type.charAt(0).toUpperCase() + type.slice(1);\n const capitalizedGrouping =\n groupingType.charAt(0).toUpperCase() + groupingType.slice(1);\n\n return `${capitalizedType} ${capitalizedGrouping}`;\n}\n",[281],"229d8704-a798-11f0-8271-0224a6c84d84","bridge.ts","d41a35f6-4422-11f0-89d5-76b3cceeab13",["D",1760293230598],"export function isMobileNative(): boolean {\n return Boolean((globalThis as any).window?.WebNativeBridge);\n}\n\nexport async function sendBridgeMessage(message: {\n action: string;\n data: any;\n}): Promise {\n return await (globalThis as any).window?.WebNativeBridge?.webToNative?.(\n message\n );\n}\n",[288],"02f23eb6-e28c-11f0-a32d-42dde27851f2","appSiteAssociation.test.ts","f3c14a04-c805-11f0-8990-42dde27851f2",["D",1766775142106],"import { assertEquals } from \"https://deno.land/std@0.208.0/assert/mod.ts\";\nimport { appSiteAssociation } from \"./api.ts\";\nimport server from \"./main.tsx\";\n\nDeno.test(\"appSiteAssociation - function exists and returns correct response\", async () => {\n const response = appSiteAssociation();\n \n // Check that response is returned\n assertEquals(response instanceof Response, true, \"appSiteAssociation should return a Response object\");\n \n // Check headers\n assertEquals(\n response.headers.get(\"Content-Type\"),\n \"application/json\",\n \"Response should have Content-Type: application/json\"\n );\n \n // Check response body\n const body = await response.json();\n assertEquals(\n body.applinks !== undefined,\n true,\n \"Response should contain applinks object\"\n );\n assertEquals(\n body.applinks.details !== undefined,\n true,\n \"applinks should contain details array\"\n );\n assertEquals(\n body.applinks.details.length > 0,\n true,\n \"details array should not be empty\"\n );\n assertEquals(\n body.applinks.details[0].appIDs.includes(\"869W3P5ZRS.fyi.lei.cipher\"),\n true,\n \"appIDs should contain the correct app ID\"\n );\n});\n\nDeno.test(\"server - routes .well-known/apple-app-site-association correctly\", async () => {\n const request = new Request(\"https://example.com/.well-known/apple-app-site-association\");\n const response = await server(request);\n \n // Check that response is returned\n assertEquals(response instanceof Response, true, \"Server should return a Response object\");\n \n // Check headers\n assertEquals(\n response.headers.get(\"Content-Type\"),\n \"application/json\",\n \"Response should have Content-Type: application/json\"\n );\n \n // Check response body\n const body = await response.json();\n assertEquals(\n body.applinks !== undefined,\n true,\n \"Response should contain applinks object\"\n );\n});\n\nDeno.test(\"server - HTML includes apple-itunes-app meta tag\", async () => {\n const request = new Request(\"https://example.com/123\");\n const response = await server(request);\n \n // Check that response is HTML\n assertEquals(\n response.headers.get(\"content-type\"),\n \"text/html\",\n \"Response should have content-type: text/html\"\n );\n \n // Check response body contains the meta tag\n const html = await response.text();\n assertEquals(\n html.includes('name=\"apple-itunes-app\"'),\n true,\n \"HTML should contain apple-itunes-app meta tag\"\n );\n assertEquals(\n html.includes('app-id=6742675455'),\n true,\n \"Meta tag should contain correct app-id\"\n );\n assertEquals(\n html.includes('app-argument=https://cipher.lei.fyi/123'),\n true,\n \"Meta tag should contain correct app-argument with the game ID\"\n );\n});\n\nDeno.test(\"server - HTML includes correct numberId in apple-itunes-app meta tag for random games\", async () => {\n const request = new Request(\"https://example.com/\");\n const response = await server(request);\n \n // Check that response is HTML\n const html = await response.text();\n \n // Extract the numberId from the meta tag\n const metaTagMatch = html.match(/app-argument=https:\\/\\/cipher\\.lei\\.fyi\\/(\\d+)/);\n assertEquals(\n metaTagMatch !== null,\n true,\n \"HTML should contain apple-itunes-app meta tag with a numeric game ID\"\n );\n \n if (metaTagMatch) {\n const numberId = metaTagMatch[1];\n // Check that the same numberId is in the data-uuid attribute\n assertEquals(\n html.includes(`data-uuid=\"cipher-${numberId}\"`),\n true,\n \"The numberId in apple-itunes-app should match the one in data-uuid\"\n );\n }\n});\n\n\n",[294],"b0b954ee-abeb-11f0-8ee2-0224a6c84d84","api.ts","d419ff96-4422-11f0-89d5-76b3cceeab13",508,["D",1760768921885],8,"import { quoteCount } from \"./constants.ts\";\nimport { randomWordFromSentence } from \"./wordHelpers.ts\";\n\n// Deno runtime type declaration\ndeclare const Deno: {\n env: {\n get(key: string): string | undefined;\n };\n};\n\n/**\n * API Specification for getQuote endpoint\n *\n * Path:\n * /quote\n *\n * Query Parameters:\n * - pageId (optional): The starting quote ID. If not provided, a random ID is selected.\n * - count (optional): The number of quotes to return. Must be used with pageId.\n *\n * Response Formats:\n *\n * 1. Single Quote Mode (when count is NOT provided):\n * Returns a single quote object:\n * {\n * quote: string, // The quote text\n * author: string, // The author name\n * keyword: string, // A random word from a previous quote\n * quoteId: number // The quote's unique ID\n * }\n *\n * 2. Multiple Quotes Mode (when both count AND pageId are provided):\n * Returns an array of quote objects:\n * [\n * {\n * quote: string,\n * author: string,\n * quoteId: number\n * },\n * ...\n * ]\n * Returns exactly 'count' quotes starting from 'pageId'.\n * Note: keyword is not included in multi-quote mode.\n */\nexport async function getQuote(request: Request): Promise {\n const url = new URL(request.url);\n const pageId =\n url.searchParams.get(\"pageId\") ??\n Math.floor(Math.random() * quoteCount + 1).toString();\n const pageIdInt = parseInt(pageId);\n const countParam = url.searchParams.get(\"count\");\n const count = countParam ? parseInt(countParam) : null;\n\n console.log(\"Page ID:\", pageIdInt);\n if (count !== null) {\n console.log(\"Count:\", count);\n }\n\n try {\n const notionToken = Deno.env.get(\"Notion_ready_only_api_token\");\n if (!notionToken) {\n throw new Error(\"Notion API token not found\");\n }\n const databaseId = \"16e2c190bff080fd9ea8d2a8c21548b0\";\n\n // Determine the range to fetch based on count parameter\n const maxId =\n count !== null && url.searchParams.has(\"pageId\")\n ? pageIdInt + count - 1\n : pageIdInt + 10; // load a few more to make sure we have one that's long enough\n const minId =\n count !== null && url.searchParams.has(\"pageId\")\n ? pageIdInt\n : Math.max(1, pageIdInt - 1); // load a few more to make sure we have one that's long enough\n\n // Use database query with filter instead of direct page fetch\n const response = await fetch(\n `https://api.notion.com/v1/databases/${databaseId}/query`,\n {\n method: \"POST\",\n headers: {\n Authorization: `Bearer ${notionToken}`,\n \"Notion-Version\": \"2022-06-28\",\n \"Content-Type\": \"application/json\",\n },\n body: JSON.stringify({\n filter: {\n and: [\n {\n property: \"ID\", // Uppercase ID property\n unique_id: {\n less_than_or_equal_to: maxId,\n },\n },\n {\n property: \"ID\", // Uppercase ID property\n unique_id: {\n greater_than_or_equal_to: minId,\n },\n },\n ],\n },\n sorts: [\n {\n property: \"ID\",\n direction: \"ascending\",\n },\n ],\n }),\n }\n );\n // console.log(response);\n\n if (!response.ok) {\n throw new Error(\n `Failed to query Notion database: ${response.statusText}`\n );\n }\n\n const data = await response.json();\n console.log(`Fetched ${data.results.length} pages from Notion API`);\n\n // Multi-quote mode: return list of quotes when count and pageId are both provided\n if (count !== null && url.searchParams.has(\"pageId\")) {\n const quotes: Array<{ quote: string; author: string; quoteId: number }> =\n [];\n for (const page of data.results) {\n const quote = page.properties.quote?.rich_text?.[0]?.plain_text || \"\";\n const author = page.properties.author?.rich_text?.[0]?.plain_text || \"\";\n const quoteId = page.properties.ID.unique_id?.number ?? 0;\n\n if (quote.length >= 1) {\n quotes.push({ quote, author, quoteId });\n }\n\n if (quotes.length >= count) {\n break;\n }\n }\n\n if (quotes.length === 0) {\n throw new Error(`No quotes found starting from ID ${pageId}`);\n }\n\n return new Response(JSON.stringify(quotes), {\n headers: { \"Content-Type\": \"application/json\" },\n });\n }\n\n // Single quote mode: original behavior with keyword\n let keyword = \"\";\n for (const page of data.results) {\n // console.log(\"Checking page\", page.properties.ID);\n // Extract plain text from rich text properties\n const quote = page.properties.quote?.rich_text?.[0]?.plain_text || \"\";\n const author = page.properties.author?.rich_text?.[0]?.plain_text || \"\";\n const quoteId = page.properties.ID.unique_id?.number ?? 0;\n if (!keyword) {\n keyword = randomWordFromSentence(quote);\n // console.log(\"Found a keyword\", keyword);\n continue;\n }\n if (quote.length >= 1) {\n // console.log(\"Found a quote long enough\", quote);\n return new Response(\n JSON.stringify({ quote, author, keyword, quoteId }),\n {\n headers: { \"Content-Type\": \"application/json\" },\n }\n );\n }\n }\n\n throw new Error(`No page found with ID ${pageId}`);\n } catch (error) {\n return new Response(JSON.stringify({ error: error.message }), {\n status: 500,\n headers: { \"Content-Type\": \"application/json\" },\n });\n }\n}\n\nexport function appSiteAssociation(): Response {\n return new Response(\n JSON.stringify({\n applinks: {\n details: [\n {\n appIDs: [\"869W3P5ZRS.fyi.lei.cipher\"],\n components: [\n {\n \"/\": \"/*\",\n comment: \"matches all\",\n },\n ],\n },\n ],\n },\n }),\n {\n headers: { \"Content-Type\": \"application/json\" },\n }\n );\n}\n",[300],"8901727e-2793-11f0-9d52-569c3dd06744","README.md","8901731e-2793-11f0-9d52-569c3dd06744",["D",1735608699289],"A web app to practice aristocrat and patristocrat cipher decoding.",[308],"2975aaa4-a6e7-11f0-a077-0224a6c84d84","PUNCTUATION_FEATURE.md","2975ab12-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"# Punctuation Preservation Feature\n\n## Summary\n\nSuccessfully implemented punctuation preservation for Aristocrat ciphers while maintaining punctuation stripping for Patristocrat ciphers.\n\n## Changes Made\n\n### 1. `substitutionCipher.ts`\n\n- **Line 148-158**: Updated aristocrat encoding to preserve all punctuation and spacing\n- **Line 174**: Fixed TypeScript type annotation for `encodedLetterCounts`\n\n**Key Logic:**\n\n- Aristocrat: Encode only letters (`/[A-Z]/`), preserve everything else (spaces, punctuation)\n- Patristocrat: Strip all non-letters, group into 5-letter blocks (no change from before)\n\n### 2. `App.tsx`\n\nUpdated to handle letter-only indexing while displaying punctuation:\n\n#### New Helper Functions (Lines 503-534):\n\n- `visualIndexFor()`: Maps group/char position to visual position in encoded string\n- `letterIndexFromVisual()`: Converts visual position to letter-only array index\n- `isLetterAtVisual()`: Checks if character at position is a letter\n\n#### Updated Functions:\n\n- `handleLetterChange()`: Works with letter-only indices, finds matching encoded letters\n- `handleKeyDown()`: Backspace handling with letter-only indices\n- `handleClear()`: Clears only letter positions\n- `isDuplicated()`: Checks duplicates using letter-only indices\n- `attemptedOriginalFor()`: Maps encoded letters to attempted decryption\n- `attemptedEncodedFor()`: Maps attempted letters to encoded letters\n\n#### Initialization (Lines 92-98, 169-175):\n\n- `decryptionAttempt` now only tracks letters: `cipher.encoded.replace(/[^A-Z]/g, '')`\n- Input refs array sized for letters only\n\n#### Rendering (Lines 609-682):\n\n- Display layer: Shows all characters including punctuation\n- Input layer: Only creates input boxes for letters, displays punctuation as text\n\n### 3. `substitutionCipher.test.ts` (New File)\n\nComprehensive test suite with 8 tests:\n\n1. **Aristocrat - preserves punctuation and spacing**: Verifies commas, periods, exclamation marks, etc. are preserved\n2. **Aristocrat - letters are properly substituted**: Validates correct substitution with apostrophes\n3. **Patristocrat - strips punctuation and groups into 5-letter blocks**: Ensures no punctuation in output\n4. **Patristocrat - same substitution but different formatting**: Confirms both use same cipher\n5. **Caesar cipher - aristocrat preserves punctuation**: Tests Caesar as K1 with empty keyword\n6. **Letter counts - only counts letters**: Verifies punctuation doesn't affect frequency analysis\n7. **cleanOriginal - only contains letters**: Ensures answer checking works correctly\n8. **Various punctuation marks**: Tests hyphens, ellipses, parentheses, etc.\n\n**All tests pass! ✅**\n\n## How It Works\n\n### Data Structure\n\n- `cipher.encoded`: Full string with letters, spaces, and punctuation (aristocrat) or letters + spaces only (patristocrat)\n- `decryptionAttempt[]`: Array of only letters (no punctuation or spaces)\n- Mapping: Helper functions convert between visual positions and letter-only array indices\n\n### Example Flow\n\n**Input:** `\"Hello, World!\"`\n\n**Aristocrat Mode:**\n\n- `cipher.encoded`: `\"KHOOR, ZRUOG!\"` (letters encoded, punctuation preserved)\n- `decryptionAttempt`: `[\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]` (10 letters only)\n- User sees: `K H O O R , W R U O G !` with inputs only under letters\n\n**Patristocrat Mode:**\n\n- `cipher.encoded`: `\"KHOOR ZRUOG\"` (punctuation stripped, grouped)\n- `decryptionAttempt`: `[\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]` (same 10 letters)\n- User sees: `KHOOR ZRUOG` with inputs under all characters\n\n## Benefits\n\n1. **More authentic**: Real cryptograms preserve punctuation\n2. **Better hints**: Punctuation provides clues about sentence structure\n3. **Cleaner code**: Separation between display (with punctuation) and state (letters only)\n4. **Backward compatible**: Patristocrat unchanged, existing games work\n5. **Well tested**: Comprehensive test coverage ensures correctness\n\n## Testing\n\nRun tests:\n\n```bash\ndeno test substitutionCipher.test.ts\n```\n\nAll 8 tests pass with type checking enabled.\n",[314],"c6358b40-a6fe-11f0-8e28-0224a6c84d84","Notice.tsx","0d04bde6-4428-11f0-a96c-76b3cceeab13",500,["D",1760227362568],16,"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { sendBridgeMessage } from \"./bridge.ts\";\nimport { getCipherName } from \"./cipherHelpers.ts\";\nimport { tutorialUrl, strategyUrl } from \"./constants.ts\";\n\nexport function Notice({\n type,\n groupingType,\n keyword,\n}: {\n type?: string;\n groupingType?: string;\n keyword?: string;\n}) {\n return (\n \n

\n URGENT NOTICE\n

\n
\n We’ve intercepted an enemy telegraph brimming with top-secret plans that\n could turn the tide of the war.\n
\n
\n Your mission is to crack the cipher and extract its secrets before the\n enemy strikes. Lives depend on your speed and precision -- time is running\n out.\n
\n
\n {type && groupingType && keyword !== undefined && (\n

\n We believe the message is encrypted with{\" \"}\n {getCipherName(type, keyword, groupingType)}. Learn more about the\n cipher at{\" \"}\n \n void sendBridgeMessage({\n action: \"openLink\",\n data: { url: tutorialUrl },\n })\n }\n >\n this location\n \n . Learn strategies{\" \"}\n \n void sendBridgeMessage({\n action: \"openLink\",\n data: { url: strategyUrl },\n })\n }\n >\n here\n \n .\n

\n )}\n \n );\n}\n",[320],"f8d203a0-a71f-11f0-bd90-0224a6c84d84","Loading.tsx","0d04bb8e-4428-11f0-a96c-76b3cceeab13",501,["D",1760241620865],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { isMobileNative, sendBridgeMessage } from \"./bridge.ts\";\nimport { tutorialUrl } from \"./constants.ts\";\n\nexport function Loading() {\n return (\n \n {!isMobileNative() && (\n

Cipher Challenge 🕵️

\n )}\n \n Our agents are still busy at work retrieving intel. Due to the nature of\n this work, no further details can be provided.\n
\n
\n Just hang on for a for a few more seconds...\n
\n
\n In the meantime you can study the{\" \"}\n \n void sendBridgeMessage({\n action: \"openLink\",\n data: { url: tutorialUrl },\n })\n }\n >\n rulebook\n {\" \"}\n and the{\" \"}\n \n void sendBridgeMessage({\n action: \"openLink\",\n data: { url: strategyUrl },\n })\n }\n >\n strategies\n \n .\n \n \n );\n}\n",[328],"4862820c-44d6-11f0-9fd0-76b3cceeab13","KnownTextWarning.tsx","0d04b0da-4428-11f0-a96c-76b3cceeab13",399,["D",1749434757648],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { useState } from \"https://esm.sh/react@18.2.0\";\nimport { isMobileNative } from \"./bridge.ts\";\nimport { startNewGame } from \"./gameHelpers.ts\";\n\nexport function KnownTextWarning(\n { cipherText, knownTexts, uuid }: { cipherText: string; knownTexts: string[]; uuid: string },\n) {\n const [knownTextsShown, setKnownTextsShown] = useState(false);\n\n return (\n

\n You have decoded this one before.\n

\n {!isMobileNative()\n ? (\n {\n setKnownTextsShown(!knownTextsShown);\n }}\n style={{\n marginTop: \"5pt\",\n padding: \"10pt\",\n backgroundColor: \"#4CAF50\",\n color: \"white\",\n border: \"none\",\n flex: 1,\n }}\n >\n {knownTextsShown ? \"Hide solved texts\" : \"Show solved texts\"}\n \n )\n : (\n {\n startNewGame(uuid);\n }}\n style={{\n marginTop: \"5pt\",\n padding: \"10pt\",\n backgroundColor: \"#4CAF50\",\n color: \"white\",\n border: \"none\",\n flex: 1,\n }}\n >\n Try another one\n \n )}\n {knownTextsShown && (\n

= 0 ? \"bold\" : \"regular\" }}>\n {text}\n

\n )}\n

\n );\n}",[335],"4f346a50-44d6-11f0-bc1a-76b3cceeab13","GameResult.tsx","7e3cb3f2-442c-11f0-8338-76b3cceeab13",400,["D",1749434769089],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { isMobileNative, sendBridgeMessage } from \"./bridge.ts\";\n\nexport function GameResult({ uuid }: { uuid: string }) {\n const resultUrl = `https://cipherresult.val.run/?id=${uuid}`;\n return (\n \n See{\" \"}\n {\n void sendBridgeMessage({ action: \"openLink\", data: { url: resultUrl } });\n }}\n >\n Game Result\n \n \n );\n}",[342],"caef865a-a720-11f0-a251-0224a6c84d84","GameLink.tsx","7e3cb1a4-442c-11f0-8338-76b3cceeab13",503,["D",1760241973382],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { useState } from \"https://esm.sh/react@18.2.0\";\nimport { isMobileNative } from \"./bridge.ts\";\n\nexport function GameLink({\n uuid,\n currentUrl,\n}: {\n uuid: string;\n currentUrl: string;\n}) {\n const [copied, setCopied] = useState(false);\n\n const id = uuid.replace(\"cipher-\", \"\");\n const handleCopy = () => {\n navigator.clipboard.writeText(currentUrl).then(() => {\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n });\n };\n\n return isMobileNative() ? (\n \n Game ID: {id}\n \n ) : (\n <>\n \n \n Competing against friends? Send them this link to solve the same\n problem:\n \n \n \n \n {copied ? \"✓ Copied!\" : \"📋 Copy\"}\n \n \n \n );\n}\n",[349],"b1eafec2-e3b2-11f0-9b4c-42dde27851f2",["D",1766901707702],74,[47],"56e3acc2-ad3e-11f0-a058-0224a6c84d84","App.test.ts","56e3ad8a-ad3e-11f0-a058-0224a6c84d84",510,["D",1760914370552],"import { assertEquals } from \"https://deno.land/std@0.208.0/assert/mod.ts\";\n\n/**\n * Test for the letter filling bug fix in App.tsx\n *\n * Bug Description:\n * When cipher.encoded contains newlines, splitting by space only (\" \")\n * causes newlines to remain in words, leading to misalignment between\n * visual indices and letter indices. This caused incorrect letter filling.\n *\n * Fix:\n * Changed all instances of .split(\" \") to .split(/\\s+/) to properly\n * split by all whitespace characters (spaces, newlines, tabs).\n */\n\nDeno.test(\n \"visualIndexFor handles newlines correctly (bug from game 794496)\",\n () => {\n // Real scenario from the bug report\n const encoded = \"DBEQ,\\nNXP LD WECD\";\n\n // Fixed implementation\n const visualIndexFor = (\n groupIndex: number,\n indexInGroup: number\n ): number => {\n let index = 0;\n let words = encoded.split(/\\s+/); // Split by all whitespace\n for (let i = 0; i < groupIndex; i += 1) {\n index += words[i].length;\n }\n return index + indexInGroup;\n };\n\n const letterIndexFromVisual = (visualIndex: number): number => {\n const encodedWithoutSpaces = encoded.replace(/\\s/g, \"\");\n let letterCount = 0;\n for (let i = 0; i < visualIndex && i < encodedWithoutSpaces.length; i++) {\n if (/[A-Z]/.test(encodedWithoutSpaces[i])) {\n letterCount++;\n }\n }\n return letterCount;\n };\n\n const isLetterAtVisual = (\n groupIndex: number,\n indexInGroup: number\n ): boolean => {\n const words = encoded.split(/\\s+/); // Split by all whitespace\n if (groupIndex >= words.length) return false;\n const char = words[groupIndex][indexInGroup];\n return /[A-Z]/.test(char);\n };\n\n const encodedLettersOnly = encoded.replace(/[^A-Z]/g, \"\");\n const words = encoded.split(/\\s+/);\n\n // Test all letter positions\n let allCorrect = true;\n words.forEach((group, groupIndex) => {\n group.split(\"\").forEach((char, charIndex) => {\n const isLetter = isLetterAtVisual(groupIndex, charIndex);\n if (isLetter) {\n const visualIdx = visualIndexFor(groupIndex, charIndex);\n const letterIdx = letterIndexFromVisual(visualIdx);\n const actualLetter = encodedLettersOnly[letterIdx];\n\n if (char !== actualLetter) {\n console.error(\n `Mismatch at group ${groupIndex}, char ${charIndex}: ` +\n `expected '${char}', got '${actualLetter}'`\n );\n allCorrect = false;\n }\n }\n });\n });\n\n assertEquals(allCorrect, true, \"All letters should match their indices\");\n }\n);\n\nDeno.test(\"letter filling works correctly across newlines\", () => {\n const encoded = \"ABC,\\nDEF GHI\";\n const encodedLettersOnly = encoded.replace(/[^A-Z]/g, \"\"); // \"ABCDEFGHI\"\n\n // Simulate filling letter 'D' (index 3) with 'X'\n const decryptionAttempt = encodedLettersOnly.split(\"\").map(() => \"\");\n const letterToFill = 3; // Position of 'D' in \"ABCDEFGHI\"\n const valueToFill = \"X\";\n const encodedLetter = encodedLettersOnly[letterToFill]; // 'D'\n\n // Fill all positions where the encoded letter matches\n encodedLettersOnly.split(\"\").forEach((letter, idx) => {\n if (letter === encodedLetter) {\n decryptionAttempt[idx] = valueToFill;\n }\n });\n\n // Only position 3 should be filled (only one 'D' in the string)\n assertEquals(decryptionAttempt[3], \"X\");\n assertEquals(decryptionAttempt[0], \"\"); // 'A' should not be filled\n assertEquals(decryptionAttempt[4], \"\"); // 'E' should not be filled\n});\n\nDeno.test(\n \"whitespace splitting works for various whitespace characters\",\n () => {\n const testCases = [\n { input: \"ABC DEF\", expected: [\"ABC\", \"DEF\"] },\n { input: \"ABC\\nDEF\", expected: [\"ABC\", \"DEF\"] },\n { input: \"ABC\\tDEF\", expected: [\"ABC\", \"DEF\"] },\n { input: \"ABC \\n\\n DEF\", expected: [\"ABC\", \"DEF\"] },\n { input: \"ABC,\\nDEF GHI\", expected: [\"ABC,\", \"DEF\", \"GHI\"] },\n ];\n\n testCases.forEach(({ input, expected }) => {\n const result = input.split(/\\s+/);\n assertEquals(\n result,\n expected,\n `Failed for input: ${JSON.stringify(input)}`\n );\n });\n }\n);\n",[360],"f8d1cbba-a71f-11f0-bd90-0224a6c84d84","AnotherRound.tsx","7e3ca574-442c-11f0-8338-76b3cceeab13",["D",1760241620865],"/** @jsxImportSource https://esm.sh/react@18.2.0 */\nimport { isMobileNative } from \"./bridge.ts\";\nimport { startNewGame } from \"./gameHelpers.ts\";\n\nexport function AnotherRound({ uuid }: { uuid: string }) {\n return (\n !isMobileNative() && (\n <>\n \n \n {\n startNewGame(uuid);\n }}\n style={{\n padding: \"10pt\",\n backgroundColor: \"#3572fa\",\n color: \"white\",\n border: \"none\",\n flex: 0.3,\n fontSize: \"var(--font-size-button)\",\n }}\n >\n Another Round\n \n

\n If your friends are on the same link, you can all tap this button to\n compete on a same puzzle again.\n

\n \n \n )\n );\n}\n",[367],"56e3be1a-ad3e-11f0-a058-0224a6c84d84",".vtignore","2975a784-a6e7-11f0-a077-0224a6c84d84",["D",1760914370552],".git\nanalyze_quotes.js\ndebug_game.js\n",[373],"2975a3ec-a6e7-11f0-a077-0224a6c84d84",".gitignore","2975a45a-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],".vt\n",[379],"2975f0b8-a6e7-11f0-a077-0224a6c84d84",".vscode","0199d51f-481c-713b-a192-42ecc85f9123",["D",1760217221145],"directory",[385],"2975b76a-a6e7-11f0-a077-0224a6c84d84",".git","0199d51f-481b-75d3-b631-1eb96532089d",["D",1760217221145],[391],"pulls","branches","forks","envVars",{"_402":77,"_404":77},"connections",{"_402":77,"_403":77},"count","unfilledCount","emptyCount",{"_57":390,"_34":391,"_32":392,"_177":-5,"_43":44,"_42":199,"_179":27,"_40":1135,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":1136,"_29":1137},{"_57":1131,"_34":1046,"_32":1041,"_177":392,"_43":44,"_42":199,"_179":27,"_40":1132,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":1133,"_29":1134},{"_57":1124,"_34":1125,"_32":1126,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1127,"_13":77,"_35":22,"_37":1128,"_26":27,"_183":-5,"_521":1129,"_29":1130},{"_57":1117,"_34":1118,"_32":1119,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1120,"_13":77,"_35":22,"_37":1121,"_26":27,"_183":-5,"_521":1122,"_29":1123},{"_57":1110,"_34":1111,"_32":1112,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1113,"_13":77,"_35":22,"_37":1114,"_26":27,"_183":-5,"_521":1115,"_29":1116},{"_57":1103,"_34":1104,"_32":1105,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1106,"_13":77,"_35":22,"_37":1107,"_26":27,"_183":-5,"_521":1108,"_29":1109},{"_57":1096,"_34":1097,"_32":1098,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1099,"_13":77,"_35":22,"_37":1100,"_26":27,"_183":-5,"_521":1101,"_29":1102},{"_57":1089,"_34":1090,"_32":1091,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1092,"_13":77,"_35":22,"_37":1093,"_26":27,"_183":-5,"_521":1094,"_29":1095},{"_57":1082,"_34":1083,"_32":1084,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1085,"_13":77,"_35":22,"_37":1086,"_26":27,"_183":-5,"_521":1087,"_29":1088},{"_57":1075,"_34":1076,"_32":1077,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1078,"_13":77,"_35":22,"_37":1079,"_26":27,"_183":-5,"_521":1080,"_29":1081},{"_57":1068,"_34":1069,"_32":1070,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1071,"_13":77,"_35":22,"_37":1072,"_26":27,"_183":-5,"_521":1073,"_29":1074},{"_57":1061,"_34":1062,"_32":1063,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1064,"_13":77,"_35":22,"_37":1065,"_26":27,"_183":-5,"_521":1066,"_29":1067},{"_57":1054,"_34":1055,"_32":1056,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1057,"_13":77,"_35":22,"_37":1058,"_26":27,"_183":-5,"_521":1059,"_29":1060},{"_57":1047,"_34":1048,"_32":1049,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1050,"_13":77,"_35":22,"_37":1051,"_26":27,"_183":-5,"_521":1052,"_29":1053},{"_57":1038,"_34":1039,"_32":1040,"_177":1041,"_43":44,"_42":199,"_179":27,"_40":1042,"_13":77,"_35":22,"_37":1043,"_26":27,"_183":-5,"_521":1044,"_29":1045},{"_57":1034,"_34":685,"_32":1029,"_177":392,"_43":44,"_42":199,"_179":27,"_40":1035,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":1036,"_29":1037},{"_57":1026,"_34":1027,"_32":1028,"_177":1029,"_43":44,"_42":199,"_179":27,"_40":1030,"_13":77,"_35":22,"_37":1031,"_26":27,"_183":-5,"_521":1032,"_29":1033},{"_57":1022,"_34":1006,"_32":1001,"_177":392,"_43":44,"_42":199,"_179":27,"_40":1023,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":1024,"_29":1025},{"_57":1018,"_34":658,"_32":1014,"_177":1001,"_43":44,"_42":199,"_179":27,"_40":1019,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":1020,"_29":1021},{"_57":1013,"_34":667,"_32":1009,"_177":1014,"_43":44,"_42":199,"_179":27,"_40":1015,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":1016,"_29":1017},{"_57":1007,"_34":660,"_32":1008,"_177":1009,"_43":44,"_42":199,"_179":27,"_40":1010,"_13":77,"_35":22,"_37":1003,"_26":27,"_183":-5,"_521":1011,"_29":1012},{"_57":999,"_34":638,"_32":1000,"_177":1001,"_43":44,"_42":199,"_179":27,"_40":1002,"_13":77,"_35":22,"_37":1003,"_26":27,"_183":-5,"_521":1004,"_29":1005},{"_57":995,"_34":683,"_32":679,"_177":392,"_43":44,"_42":199,"_179":27,"_40":996,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":997,"_29":998},{"_57":991,"_34":990,"_32":985,"_177":679,"_43":44,"_42":199,"_179":27,"_40":992,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":993,"_29":994},{"_57":982,"_34":983,"_32":984,"_177":985,"_43":44,"_42":199,"_179":27,"_40":986,"_13":77,"_35":22,"_37":987,"_26":27,"_183":-5,"_521":988,"_29":989},{"_57":976,"_34":977,"_32":978,"_177":679,"_43":44,"_42":199,"_179":27,"_40":979,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":980,"_29":981},{"_57":970,"_34":971,"_32":972,"_177":679,"_43":44,"_42":199,"_179":27,"_40":973,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":974,"_29":975},{"_57":964,"_34":965,"_32":966,"_177":679,"_43":44,"_42":199,"_179":27,"_40":967,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":968,"_29":969},{"_57":958,"_34":959,"_32":960,"_177":679,"_43":44,"_42":199,"_179":27,"_40":961,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":962,"_29":963},{"_57":952,"_34":953,"_32":954,"_177":679,"_43":44,"_42":199,"_179":27,"_40":955,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":956,"_29":957},{"_57":946,"_34":947,"_32":948,"_177":679,"_43":44,"_42":199,"_179":27,"_40":949,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":950,"_29":951},{"_57":940,"_34":941,"_32":942,"_177":679,"_43":44,"_42":199,"_179":27,"_40":943,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":944,"_29":945},{"_57":936,"_34":935,"_32":930,"_177":679,"_43":44,"_42":199,"_179":27,"_40":937,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":938,"_29":939},{"_57":927,"_34":928,"_32":929,"_177":930,"_43":44,"_42":199,"_179":27,"_40":931,"_13":77,"_35":22,"_37":932,"_26":27,"_183":-5,"_521":933,"_29":934},{"_57":921,"_34":922,"_32":923,"_177":679,"_43":44,"_42":199,"_179":27,"_40":924,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":925,"_29":926},{"_57":917,"_34":916,"_32":911,"_177":679,"_43":44,"_42":199,"_179":27,"_40":918,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":919,"_29":920},{"_57":908,"_34":909,"_32":910,"_177":911,"_43":44,"_42":199,"_179":27,"_40":912,"_13":77,"_35":22,"_37":913,"_26":27,"_183":-5,"_521":914,"_29":915},{"_57":904,"_34":903,"_32":898,"_177":679,"_43":44,"_42":199,"_179":27,"_40":905,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":906,"_29":907},{"_57":895,"_34":896,"_32":897,"_177":898,"_43":44,"_42":199,"_179":27,"_40":899,"_13":77,"_35":22,"_37":900,"_26":27,"_183":-5,"_521":901,"_29":902},{"_57":889,"_34":890,"_32":891,"_177":679,"_43":44,"_42":199,"_179":27,"_40":892,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":893,"_29":894},{"_57":883,"_34":884,"_32":885,"_177":679,"_43":44,"_42":199,"_179":27,"_40":886,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":887,"_29":888},{"_57":877,"_34":878,"_32":879,"_177":679,"_43":44,"_42":199,"_179":27,"_40":880,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":881,"_29":882},{"_57":871,"_34":872,"_32":873,"_177":679,"_43":44,"_42":199,"_179":27,"_40":874,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":875,"_29":876},{"_57":867,"_34":866,"_32":861,"_177":679,"_43":44,"_42":199,"_179":27,"_40":868,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":869,"_29":870},{"_57":858,"_34":859,"_32":860,"_177":861,"_43":44,"_42":199,"_179":27,"_40":862,"_13":77,"_35":22,"_37":863,"_26":27,"_183":-5,"_521":864,"_29":865},{"_57":852,"_34":853,"_32":854,"_177":679,"_43":44,"_42":199,"_179":27,"_40":855,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":856,"_29":857},{"_57":846,"_34":847,"_32":848,"_177":679,"_43":44,"_42":199,"_179":27,"_40":849,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":850,"_29":851},{"_57":840,"_34":841,"_32":842,"_177":679,"_43":44,"_42":199,"_179":27,"_40":843,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":844,"_29":845},{"_57":836,"_34":835,"_32":830,"_177":679,"_43":44,"_42":199,"_179":27,"_40":837,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":838,"_29":839},{"_57":827,"_34":828,"_32":829,"_177":830,"_43":44,"_42":199,"_179":27,"_40":831,"_13":77,"_35":22,"_37":832,"_26":27,"_183":-5,"_521":833,"_29":834},{"_57":823,"_34":822,"_32":817,"_177":679,"_43":44,"_42":199,"_179":27,"_40":824,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":825,"_29":826},{"_57":814,"_34":815,"_32":816,"_177":817,"_43":44,"_42":199,"_179":27,"_40":818,"_13":77,"_35":22,"_37":819,"_26":27,"_183":-5,"_521":820,"_29":821},{"_57":810,"_34":809,"_32":804,"_177":679,"_43":44,"_42":199,"_179":27,"_40":811,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":812,"_29":813},{"_57":801,"_34":802,"_32":803,"_177":804,"_43":44,"_42":199,"_179":27,"_40":805,"_13":77,"_35":22,"_37":806,"_26":27,"_183":-5,"_521":807,"_29":808},{"_57":797,"_34":796,"_32":791,"_177":679,"_43":44,"_42":199,"_179":27,"_40":798,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":799,"_29":800},{"_57":788,"_34":789,"_32":790,"_177":791,"_43":44,"_42":199,"_179":27,"_40":792,"_13":77,"_35":22,"_37":793,"_26":27,"_183":-5,"_521":794,"_29":795},{"_57":782,"_34":783,"_32":784,"_177":679,"_43":44,"_42":199,"_179":27,"_40":785,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":786,"_29":787},{"_57":776,"_34":777,"_32":778,"_177":679,"_43":44,"_42":199,"_179":27,"_40":779,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":780,"_29":781},{"_57":770,"_34":771,"_32":772,"_177":679,"_43":44,"_42":199,"_179":27,"_40":773,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":774,"_29":775},{"_57":764,"_34":765,"_32":766,"_177":679,"_43":44,"_42":199,"_179":27,"_40":767,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":768,"_29":769},{"_57":758,"_34":759,"_32":760,"_177":679,"_43":44,"_42":199,"_179":27,"_40":761,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":762,"_29":763},{"_57":752,"_34":753,"_32":754,"_177":679,"_43":44,"_42":199,"_179":27,"_40":755,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":756,"_29":757},{"_57":748,"_34":747,"_32":742,"_177":679,"_43":44,"_42":199,"_179":27,"_40":749,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":750,"_29":751},{"_57":739,"_34":740,"_32":741,"_177":742,"_43":44,"_42":199,"_179":27,"_40":743,"_13":77,"_35":22,"_37":744,"_26":27,"_183":-5,"_521":745,"_29":746},{"_57":733,"_34":734,"_32":735,"_177":679,"_43":44,"_42":199,"_179":27,"_40":736,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":737,"_29":738},{"_57":727,"_34":728,"_32":729,"_177":679,"_43":44,"_42":199,"_179":27,"_40":730,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":731,"_29":732},{"_57":721,"_34":722,"_32":723,"_177":679,"_43":44,"_42":199,"_179":27,"_40":724,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":725,"_29":726},{"_57":717,"_34":716,"_32":711,"_177":679,"_43":44,"_42":199,"_179":27,"_40":718,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":719,"_29":720},{"_57":708,"_34":709,"_32":710,"_177":711,"_43":44,"_42":199,"_179":27,"_40":712,"_13":77,"_35":22,"_37":713,"_26":27,"_183":-5,"_521":714,"_29":715},{"_57":702,"_34":703,"_32":704,"_177":679,"_43":44,"_42":199,"_179":27,"_40":705,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":706,"_29":707},{"_57":696,"_34":697,"_32":698,"_177":679,"_43":44,"_42":199,"_179":27,"_40":699,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":700,"_29":701},{"_57":690,"_34":691,"_32":692,"_177":679,"_43":44,"_42":199,"_179":27,"_40":693,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":694,"_29":695},{"_57":684,"_34":685,"_32":686,"_177":679,"_43":44,"_42":199,"_179":27,"_40":687,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":688,"_29":689},{"_57":676,"_34":677,"_32":678,"_177":679,"_43":44,"_42":199,"_179":27,"_40":680,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":681,"_29":682},{"_57":672,"_34":658,"_32":654,"_177":392,"_43":44,"_42":199,"_179":27,"_40":673,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":674,"_29":675},{"_57":668,"_34":667,"_32":662,"_177":654,"_43":44,"_42":199,"_179":27,"_40":669,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":670,"_29":671},{"_57":659,"_34":660,"_32":661,"_177":662,"_43":44,"_42":199,"_179":27,"_40":663,"_13":77,"_35":22,"_37":664,"_26":27,"_183":-5,"_521":665,"_29":666},{"_57":651,"_34":652,"_32":653,"_177":654,"_43":44,"_42":199,"_179":27,"_40":655,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":656,"_29":657},{"_57":644,"_34":645,"_32":646,"_177":392,"_43":44,"_42":199,"_179":27,"_40":647,"_13":77,"_35":22,"_37":648,"_26":27,"_183":-5,"_521":649,"_29":650},{"_57":637,"_34":638,"_32":639,"_177":392,"_43":44,"_42":199,"_179":27,"_40":640,"_13":77,"_35":22,"_37":641,"_26":27,"_183":-5,"_521":642,"_29":643},{"_57":630,"_34":631,"_32":632,"_177":392,"_43":44,"_42":199,"_179":27,"_40":633,"_13":77,"_35":22,"_37":634,"_26":27,"_183":-5,"_521":635,"_29":636},{"_57":624,"_34":67,"_32":625,"_177":392,"_43":44,"_42":199,"_179":27,"_40":626,"_13":77,"_35":22,"_37":627,"_26":27,"_183":-5,"_521":628,"_29":629},{"_57":384,"_34":385,"_32":386,"_177":-5,"_43":44,"_42":199,"_179":63,"_40":621,"_13":77,"_35":388,"_37":-5,"_26":27,"_183":-5,"_521":622,"_29":623},{"_57":614,"_34":615,"_32":616,"_177":386,"_43":44,"_42":199,"_179":63,"_40":617,"_13":77,"_35":22,"_37":618,"_26":27,"_183":-5,"_521":619,"_29":620},{"_57":378,"_34":379,"_32":380,"_177":-5,"_43":44,"_42":199,"_179":27,"_40":611,"_13":77,"_35":22,"_37":382,"_26":27,"_183":-5,"_521":612,"_29":613},{"_57":372,"_34":373,"_32":374,"_177":-5,"_43":44,"_42":362,"_179":27,"_40":608,"_13":181,"_35":22,"_37":376,"_26":27,"_183":-5,"_521":609,"_29":610},{"_57":366,"_34":367,"_32":368,"_177":-5,"_43":44,"_42":330,"_179":27,"_40":605,"_13":304,"_35":36,"_37":370,"_26":27,"_183":-5,"_521":606,"_29":607},{"_57":359,"_34":360,"_32":361,"_177":-5,"_43":44,"_42":362,"_179":63,"_40":602,"_13":77,"_35":36,"_37":364,"_26":27,"_183":-5,"_521":603,"_29":604},{"_57":355,"_34":47,"_32":48,"_177":-5,"_43":44,"_42":14,"_179":27,"_40":599,"_13":357,"_35":36,"_37":50,"_26":27,"_183":-5,"_521":600,"_29":601},{"_57":348,"_34":349,"_32":350,"_177":-5,"_43":44,"_42":351,"_179":27,"_40":596,"_13":194,"_35":36,"_37":353,"_26":27,"_183":-5,"_521":597,"_29":598},{"_57":341,"_34":342,"_32":343,"_177":-5,"_43":44,"_42":344,"_179":63,"_40":593,"_13":223,"_35":36,"_37":346,"_26":27,"_183":-5,"_521":594,"_29":595},{"_57":334,"_34":335,"_32":336,"_177":-5,"_43":44,"_42":337,"_179":63,"_40":590,"_13":194,"_35":36,"_37":339,"_26":27,"_183":-5,"_521":591,"_29":592},{"_57":327,"_34":328,"_32":329,"_177":-5,"_43":44,"_42":330,"_179":63,"_40":587,"_13":324,"_35":36,"_37":332,"_26":27,"_183":-5,"_521":588,"_29":589},{"_57":319,"_34":320,"_32":321,"_177":-5,"_43":44,"_42":322,"_179":27,"_40":584,"_13":324,"_35":36,"_37":325,"_26":27,"_183":-5,"_521":585,"_29":586},{"_57":313,"_34":314,"_32":315,"_177":-5,"_43":44,"_42":199,"_179":63,"_40":581,"_13":77,"_35":22,"_37":317,"_26":27,"_183":-5,"_521":582,"_29":583},{"_57":307,"_34":308,"_32":309,"_177":-5,"_43":44,"_42":223,"_179":63,"_40":578,"_13":77,"_35":22,"_37":311,"_26":27,"_183":-5,"_521":579,"_29":580},{"_57":299,"_34":300,"_32":301,"_177":-5,"_43":44,"_42":302,"_179":63,"_40":575,"_13":304,"_35":36,"_37":305,"_26":27,"_183":-5,"_521":576,"_29":577},{"_57":293,"_34":294,"_32":295,"_177":-5,"_43":44,"_42":258,"_179":63,"_40":572,"_13":223,"_35":36,"_37":297,"_26":27,"_183":-5,"_521":573,"_29":574},{"_57":287,"_34":288,"_32":289,"_177":-5,"_43":44,"_42":206,"_179":63,"_40":569,"_13":223,"_35":36,"_37":291,"_26":27,"_183":-5,"_521":570,"_29":571},{"_57":280,"_34":281,"_32":282,"_177":-5,"_43":44,"_42":283,"_179":63,"_40":566,"_13":223,"_35":36,"_37":285,"_26":27,"_183":-5,"_521":567,"_29":568},{"_57":272,"_34":273,"_32":274,"_177":-5,"_43":44,"_42":275,"_179":27,"_40":563,"_13":277,"_35":36,"_37":278,"_26":27,"_183":-5,"_521":564,"_29":565},{"_57":265,"_34":266,"_32":267,"_177":-5,"_43":44,"_42":268,"_179":27,"_40":560,"_13":77,"_35":36,"_37":270,"_26":27,"_183":-5,"_521":561,"_29":562},{"_57":262,"_34":53,"_32":54,"_177":-5,"_43":44,"_42":14,"_179":27,"_40":557,"_13":77,"_35":36,"_37":55,"_26":27,"_183":-5,"_521":558,"_29":559},{"_57":255,"_34":256,"_32":257,"_177":-5,"_43":44,"_42":258,"_179":63,"_40":554,"_13":77,"_35":36,"_37":260,"_26":27,"_183":-5,"_521":555,"_29":556},{"_57":246,"_34":247,"_32":71,"_177":-5,"_43":44,"_42":248,"_179":63,"_40":551,"_13":250,"_35":251,"_37":252,"_26":27,"_183":253,"_521":552,"_29":553},{"_57":240,"_34":241,"_32":242,"_177":-5,"_43":44,"_42":178,"_179":63,"_40":548,"_13":194,"_35":36,"_37":244,"_26":27,"_183":-5,"_521":549,"_29":550},{"_57":233,"_34":234,"_32":235,"_177":-5,"_43":44,"_42":236,"_179":63,"_40":545,"_13":215,"_35":36,"_37":238,"_26":27,"_183":-5,"_521":546,"_29":547},{"_57":226,"_34":227,"_32":228,"_177":-5,"_43":44,"_42":229,"_179":63,"_40":542,"_13":77,"_35":36,"_37":231,"_26":27,"_183":-5,"_521":543,"_29":544},{"_57":218,"_34":219,"_32":220,"_177":-5,"_43":44,"_42":221,"_179":63,"_40":539,"_13":223,"_35":36,"_37":224,"_26":27,"_183":-5,"_521":540,"_29":541},{"_57":210,"_34":211,"_32":212,"_177":-5,"_43":44,"_42":213,"_179":27,"_40":536,"_13":215,"_35":36,"_37":216,"_26":27,"_183":-5,"_521":537,"_29":538},{"_57":203,"_34":204,"_32":205,"_177":-5,"_43":44,"_42":206,"_179":63,"_40":533,"_13":77,"_35":22,"_37":208,"_26":27,"_183":-5,"_521":534,"_29":535},{"_57":196,"_34":197,"_32":198,"_177":-5,"_43":44,"_42":199,"_179":63,"_40":530,"_13":77,"_35":36,"_37":201,"_26":27,"_183":-5,"_521":531,"_29":532},{"_57":192,"_34":30,"_32":33,"_177":-5,"_43":44,"_42":14,"_179":27,"_40":527,"_13":194,"_35":36,"_37":39,"_26":27,"_183":-5,"_521":528,"_29":529},{"_57":185,"_34":186,"_32":187,"_177":-5,"_43":44,"_42":188,"_179":63,"_40":524,"_13":77,"_35":36,"_37":190,"_26":27,"_183":-5,"_521":525,"_29":526},{"_57":174,"_34":175,"_32":176,"_177":-5,"_43":44,"_42":178,"_179":63,"_40":520,"_13":181,"_35":36,"_37":182,"_26":27,"_183":-5,"_521":522,"_29":523},["D",1763229308190],"children",[],[175],["D",1763001991791],[],[186],["D",1766901707702],[],[30],["D",1760217221145],[],[197],["D",1760293230598],[],[204],["D",1763001116519],[],[211],["D",1762016258186],[],[219],["D",1749418805397],[],[227],["D",1750634621433],[],[234],["D",1763229308190],[],[241],["D",1763858833829],[],[247],["D",1766775142106],[],[256],["D",1766901707702],[],[53],["D",1749357682642],[],[266],["D",1762930192045],[],[273],["D",1760242229389],[],[281],["D",1760293230598],[],[288],["D",1766775142106],[],[294],["D",1760768921885],[],[300],["D",1735608699289],[],[308],["D",1760217221145],[],[314],["D",1760227362568],[],[320],["D",1760241620865],[],[328],["D",1749434757648],[],[335],["D",1749434769089],[],[342],["D",1760241973382],[],[349],["D",1766901707702],[],[47],["D",1760914370552],[],[360],["D",1760241620865],[],[367],["D",1760914370552],[],[373],["D",1760217221145],[],[379],"2975a590-a6e7-11f0-a077-0224a6c84d84","extensions.json","2975a5f4-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"{\n \"recommendations\": [\n \"denoland.vscode-deno\"\n ]\n}",[],[385,615],["D",1760217221145],[488],[385],"29754dd4-a6e7-11f0-a077-0224a6c84d84","29754f46-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"Unnamed repository; edit this file 'description' to name the repository.\n",[],[391,67],"29754bf4-a6e7-11f0-a077-0224a6c84d84","config","29754c76-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"[core]\n\trepositoryformatversion = 0\n\tfilemode = true\n\tbare = false\n\tlogallrefupdates = true\n\tignorecase = true\n\tprecomposeunicode = true\n",[],[391,631],"2975509a-a6e7-11f0-a077-0224a6c84d84","HEAD","29755108-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"ref: refs/heads/master\n",[],[391,638],"29754546-a6e7-11f0-a077-0224a6c84d84","COMMIT_EDITMSG","297545e6-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"supported Caesar cipher\n\n# Please enter the commit message for your changes. Lines starting\n# with '#' will be ignored, and an empty message aborts the commit.\n#\n# Date: Sat Oct 11 13:49:10 2025 -0700\n#\n# On branch master\n# Changes to be committed:\n#\tnew file: .vscode/extensions.json\n#\tmodified: .vt/state.json\n#\tmodified: App.tsx\n#\tmodified: Notice.tsx\n#\tnew file: cipherHelpers.ts\n#\n",[],[391,645],"2975efc8-a6e7-11f0-a077-0224a6c84d84","tags","0199d51f-481c-713b-a192-3d2893b50767","0199d51f-481c-713b-a192-37350e7fa246",["D",1760217221145],[],[391,658,652],"refs","2975a220-a6e7-11f0-a077-0224a6c84d84","master","2975a298-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a192-39cc4433b218",["D",1760217221145],"e8b3571a8dfa4906607554a0794cde7369b283e4\n",[],[391,658,667,660],"heads","2975eed8-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[481],[391,658,667],"2975edca-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[480,482],[391,658],"2975ecbc-a6e7-11f0-a077-0224a6c84d84","pack","0199d51f-481c-713b-a192-331b8aedd70f","0199d51f-481c-713b-a191-92aa9eed1ec1",["D",1760217221145],[],[391,683,677],"objects","2975eb2c-a6e7-11f0-a077-0224a6c84d84","info","0199d51f-481c-713b-a192-2e2559b4fdb6",["D",1760217221145],[],[391,683,685],"2975e96a-a6e7-11f0-a077-0224a6c84d84","ff","0199d51f-481c-713b-a192-2851494ed9f8",["D",1760217221145],[],[391,683,691],"2975e870-a6e7-11f0-a077-0224a6c84d84","f3","0199d51f-481c-713b-a192-2445b27aa267",["D",1760217221145],[],[391,683,697],"2975e726-a6e7-11f0-a077-0224a6c84d84","ec","0199d51f-481c-713b-a192-204308985ba9",["D",1760217221145],[],[391,683,703],"29759d34-a6e7-11f0-a077-0224a6c84d84","b3571a8dfa4906607554a0794cde7369b283e4","29759da2-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a192-1cab24be1fcf",["D",1760217221145],"x\u0001��AjC!\u0010��=�\\ aF��RJ��%�q$B\u0012\u001f>��[B�Y�|�K��\u0004K�a\u000eU\b��rTqvE�\\9'�v��\u0010.\u000b[��x�cB��%�aY)Ŭ�-�R\n��(*&��\u0019~�k\u001fp�\u000e��#s��i;՟�\t\u0014\u0003Z��#\u001c1\"\u001aymM}\u0003V��ٟ��\u0002\u0017֝\u0007Hۮ:�/��A�",[],[391,683,716,709],"e8","2975e5b4-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[473],[391,683,716],"2975e4ba-a6e7-11f0-a077-0224a6c84d84","e7","0199d51f-481c-713b-a192-1b6d04549258",["D",1760217221145],[],[391,683,722],"2975e398-a6e7-11f0-a077-0224a6c84d84","d9","0199d51f-481c-713b-a192-17c16afc89fe",["D",1760217221145],[],[391,683,728],"2975e1e0-a6e7-11f0-a077-0224a6c84d84","d8","0199d51f-481c-713b-a192-11d1a41c7b7c",["D",1760217221145],[],[391,683,734],"29759ab4-a6e7-11f0-a077-0224a6c84d84","cd5ffdba7dc18a40961268b5bcf720b5b7b37a","29759b2c-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a192-0c5e6eb2e752",["D",1760217221145],"x\u0001m��\u000e�0\u0010E]�\u0015�kk�i;�|�q�\u000f\u001bI\u0010\f�\u001bÿ[(\u000bL�ݝI�=��ޕ��)�4�m[R�9��&�L��i@\n�\u0011��Ȩ\t\n�B�E\b\f+)�J��\u0019�\u0006��_��B\u0004j1č�1R\u0006 -z-��$S��m\u0018��K(\u0014?\u0015�\u001d��k9�|��4\u0002Ď15��\u00070P��z\u0001VsS�9�\n��{1\u0001c�;�",[],[391,683,747,740],"d7","2975e028-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[468],[391,683,747],"2975df10-a6e7-11f0-a077-0224a6c84d84","d1","0199d51f-481c-713b-a192-0af67f54d3b3",["D",1760217221145],[],[391,683,753],"2975de16-a6e7-11f0-a077-0224a6c84d84","c6","0199d51f-481c-713b-a192-07214975bd7a",["D",1760217221145],[],[391,683,759],"2975dd30-a6e7-11f0-a077-0224a6c84d84","c3","0199d51f-481c-713b-a192-03427ff2f218",["D",1760217221145],[],[391,683,765],"2975dc36-a6e7-11f0-a077-0224a6c84d84","b8","0199d51f-481c-713b-a191-fdcc58dc7f35",["D",1760217221145],[],[391,683,771],"2975db46-a6e7-11f0-a077-0224a6c84d84","95","0199d51f-481c-713b-a191-fa6f1267df32",["D",1760217221145],[],[391,683,777],"2975da42-a6e7-11f0-a077-0224a6c84d84","8f","0199d51f-481c-713b-a191-f56123235808",["D",1760217221145],[],[391,683,783],"297595f0-a6e7-11f0-a077-0224a6c84d84","7ce0a1f409726e7c5ec0c37ae823cbd16b33fd","2975965e-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-f1f852a004dd",["D",1760217221145],"x\u0001��A\n�0\u0010@Q�9�\\@�I��\u0005\u0011ѭ��N&4`M�q��\u0015O��K]��Ұ�M\u0015\b\u0007��D9��U\u001dR�\t3��eB\u0011�cF�f㦏\u000e)\u00067I\u000e�HS��e�Rb��\r��$sv�_}�\r.\\�\u0005�3��]�!��\t(\u0006��G�cD4��70�׶��5��\r�l�6�\u0001��B\u0019",[],[391,683,796,789],"8e","2975d920-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[460],[391,683,796],"2975946a-a6e7-11f0-a077-0224a6c84d84","e1686108766a2b21593296f6d6e30bffb54d28","297594d8-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-ec62d9372277",["D",1760217221145],"x\u0001m��\u000e�0\u0010E]�\u0015�kk��N[>ør�\u0007�$\b\u0004Ѝ��-�\u0005&��$瞱mos��8�mZR�)l��L�\n�*@\nR��(\u0002��\u000b�\u0002�+�g(9'\u001ba9'�\u001dM�\u001eYV\u0006�\bԠ\u000f;�a�\f�\u001bt�{�I�$�z��(�*Z3��z8�\u000e��^\u000b\u000e��y��\u001f�@Ђ��\u001b��\n�\"��\u0005f\t;�",[],[391,683,809,802],"8c","2975d830-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[458],[391,683,809],"29759302-a6e7-11f0-a077-0224a6c84d84","128ce73cf082cb55562f71e62a1e6bb0f1f63b","29759366-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-e9b7342cd829",["D",1760217221145],"x\u0001m�?k�0\f�;�S<2%KZ�Rr��-�馃�N�\u0004�c\u0007�i�\u0004��\tm�p�$��{�zm{<�<=�i�.`�\u000f3-ob\"$\f�N(�Ǒ�\u0013陜o�/\u000fEA�mb��#(k�)��,��}��$��^��QI��9k��)3\"�X\u000b@\r�\u0016e�]\u001a\u001e�\tG��H�\u000e�W\u001b�g�\u000e�\u0014A�\u0010�F��Yiľf�u(o�,\\r��P�e�\u0003o�#��8��\u001c��p�\u000fv�\u000e-��_�\u0006��T�oܠz�",[],[391,683,822,815],"88","2975d6f0-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[456],[391,683,822],"29759190-a6e7-11f0-a077-0224a6c84d84","ba21b78fbf15b54d3bf72ecbaf6f82c5c03af4","297591fe-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-e532db74db0f",["D",1760217221145],"x\u0001m��\u000e�0\u0010E]�\u0015�kkʴ��|�q�\u000f\u001bI\u0010\f�\u001bÿ[(\u000bL�ݝI�=��ޕ��)�4�m[R�9��&�L��i@\n�pZU�Q\u0013$P��\u0010\u0018*!�J��\u0019�\u0006��_�SQ\"\u0002�\u0018��\u0018)\u0003\u0010\u0016�\u0016A\u000b�)Y�6�M�%�\u0012?\u0015�\u001d��k9�|��Y\nv��yܖ?��\u0015K�\u0017`�d5�\u0013�⺹\u0017�\u0017e\u0011;�",[],[391,683,835,828],"81","2975d5ce-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[454],[391,683,835],"2975d4de-a6e7-11f0-a077-0224a6c84d84","7d","0199d51f-481c-713b-a191-e2ef8c9f3d98",["D",1760217221145],[],[391,683,841],"2975d3ee-a6e7-11f0-a077-0224a6c84d84","79","0199d51f-481c-713b-a191-de5f3afcd768",["D",1760217221145],[],[391,683,847],"2975d308-a6e7-11f0-a077-0224a6c84d84","70","0199d51f-481c-713b-a191-db14f7cde819",["D",1760217221145],[],[391,683,853],"29759028-a6e7-11f0-a077-0224a6c84d84","f5b8c3bbca356a2f6eca90c3d2a82982536db2","29759096-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-d731b9cae122",["D",1760217221145],"x\u0001e�AO�@\u0010�=�W�4��рD�Hz0=x0�w�e\n\u001bJw3;\r\"�w[hl�o޼�ͮJ��\r};˂��\u0018[aC�\u001b�%�P{J\"@��^��M��\u000f�\u001d\u001d\u000f��Ciöva�9�Fi��)l�f�\u0015y��]:��w��*��'�\u0002�s(6^�f%8\u0018ق�N�}i\b2\u0005�\u0016\tY�!��cL&��u�\u0010�,�\u0005�i�\u00040I�\u0015�\u0011Y�\b-M�3;#�4?�°\u0017�$Bܲv\u0010�ZcX\u0015��O�~q��\n��?\u0015��\u001cq\u001e�MҶ��v�Kda�Q�To\u0015�J�sp7��hJ�!?D\\n\\ޞ�!5\u0018I}o�\\DM�\u000b�B��",[],[391,683,866,859],"69","2975d218-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[449],[391,683,866],"2975d11e-a6e7-11f0-a077-0224a6c84d84","66","0199d51f-481c-713b-a191-d330405b444a",["D",1760217221145],[],[391,683,872],"2975cffc-a6e7-11f0-a077-0224a6c84d84","65","0199d51f-481c-713b-a191-ccb018098c7f",["D",1760217221145],[],[391,683,878],"2975cf16-a6e7-11f0-a077-0224a6c84d84","51","0199d51f-481c-713b-a191-cb6f363df557",["D",1760217221145],[],[391,683,884],"2975ce26-a6e7-11f0-a077-0224a6c84d84","50","0199d51f-481c-713b-a191-c78a85a56a1e",["D",1760217221145],[],[391,683,890],"29758e98-a6e7-11f0-a077-0224a6c84d84","783e0e9b7165f91da25573c7d621bc98c0b8ae","29758f06-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-c1dc9c5d5bcf",["D",1760217221145],"x\u0001m��\u000e�0\u0010E]�\u0015�kk��\u001dZ>ørׇ�$\b\u0006Ѝ��-�\u0005&��$瞱mos��8�mZV�)��̔\n�*$��.yQ\u0004��K䒴+�\u0007��`+a>&�\u001dL��Y�\n�\b�!\u001f6��\u0001Q\u0018rJx%X�$��06}\u0017Q��h�8�_�a��\\��R�cL��\u0017\u0010[/\b��\u001a�\t\u0010��{6\u0001d�;�",[],[391,683,903,896],"4b","2975cd22-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[443],[391,683,903],"29758ce0-a6e7-11f0-a077-0224a6c84d84","5d04191ebcf0c272585f007ff02bce40ec5c0a","29758d6c-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-bee77ee0c4cb",["D",1760217221145],"x\u0001}��\u000e�0\u0010E]�\u0015�kk�郶�a\\�k)�$\b\u0004Ѝ��-�\u000b\\��Lr�\\�\r�\u0004�\u000f��C��!-Z\u001f3R*X�@b�4Ô\u0006��\u0017��5�Ȋs�\b�1��d��\u0015�VY��in�>��\u0016_?:;/��v�\t�ɘI\u0010|\u0007Y�{�\u0015\u0001\u0002\u0002S\u0012+\\�\u0018\n��\u0013hu��\u0017�\u001bz�;�",[],[391,683,916,909],"3c","2975cbd8-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[441],[391,683,916],"2975cae8-a6e7-11f0-a077-0224a6c84d84","3b","0199d51f-481c-713b-a191-b8af0fd8cb1f",["D",1760217221145],[],[391,683,922],"29758858-a6e7-11f0-a077-0224a6c84d84","ac6b461d7b0deec405bb967bf2bf988770fa8a","297588bc-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-b51fde516167",["D",1760217221145],"x\u0001-��\u000e�0\u0010\u0006=�\u0014_8I�?1��ћ\u00071�\u0017X�H\rn�v�6�wW��$Sv��~wX跳^@!r��J�e8\u001bd��N!�7|�P��\u0002qL�Y\u0002^K�\u0019�\"#h�T��g\u0006<��VH�yqK��\u000f��j탚\u0015 9Y\u0016Ͳ�E��L�u��q`�\b��p��Q�\\��d��\u001a�ґ\u000f�q9|\u0001�cB\u0010",[],[391,683,935,928],"37","2975c9ee-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[438],[391,683,935],"2975c8f4-a6e7-11f0-a077-0224a6c84d84","35","0199d51f-481c-713b-a191-b3e2c9c50c83",["D",1760217221145],[],[391,683,941],"2975c7d2-a6e7-11f0-a077-0224a6c84d84","30","0199d51f-481c-713b-a191-ad3178097380",["D",1760217221145],[],[391,683,947],"2975c6d8-a6e7-11f0-a077-0224a6c84d84","2e","0199d51f-481c-713b-a191-aa45cfb26ee9",["D",1760217221145],[],[391,683,953],"2975c5ca-a6e7-11f0-a077-0224a6c84d84","15","0199d51f-481c-713b-a191-a60bf0f3b92d",["D",1760217221145],[],[391,683,959],"2975c43a-a6e7-11f0-a077-0224a6c84d84","11","0199d51f-481c-713b-a191-a11db9db3ca4",["D",1760217221145],[],[391,683,965],"2975c26e-a6e7-11f0-a077-0224a6c84d84","10","0199d51f-481c-713b-a191-9c41c6336a24",["D",1760217221145],[],[391,683,971],"2975c11a-a6e7-11f0-a077-0224a6c84d84","04","0199d51f-481c-713b-a191-995a8666dcb1",["D",1760217221145],[],[391,683,977],"297586aa-a6e7-11f0-a077-0224a6c84d84","890064cc0e35fd911c17ddc6d0ea3202cc2738","2975872c-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-971925a9d1b2",["D",1760217221145],"x\u0001E��\r�@\b\u0004@K�\n|��R��(�9\b�ؾO�9�1�\u0003�M0\u0013\u001dȢ��O�\u0014\u001b\\�d�!��\u0015�$�׹��\u001a�",[],[391,683,990,983],"01","2975c020-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[429],[391,683,990],"2975bec2-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[428,430,431,432,433,434,435,436,437,439,440,442,444,445,446,447,448,450,451,452,453,455,457,459,461,462,463,464,465,466,467,469,470,471,472,474,475,476,477,478],[391,683],"297583a8-a6e7-11f0-a077-0224a6c84d84","29758416-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-86c7efeb9266",["D",1760217221145],"0000000000000000000000000000000000000000 37f3c5df738c5b506fb60a19e61c824d18dc75cc Bao Lei 1760213625 -0700\tcommit (initial): first commit\n37f3c5df738c5b506fb60a19e61c824d18dc75cc d7639cf648197be152a3dddac5c639317e09cbf3 Bao Lei 1760214197 -0700\tcommit: on dev2\nd7639cf648197be152a3dddac5c639317e09cbf3 8e7ce0a1f409726e7c5ec0c37ae823cbd16b33fd Bao Lei 1760215750 -0700\tcommit: supported Caesar cipher\n8e7ce0a1f409726e7c5ec0c37ae823cbd16b33fd e8b3571a8dfa4906607554a0794cde7369b283e4 Bao Lei 1760215835 -0700\tcommit (amend): supported Caesar cipher\n",[],[391,1006,638],"logs","29758510-a6e7-11f0-a077-0224a6c84d84","2975857e-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-8eabbc95140f",["D",1760217221145],[],[391,1006,658,667,660],"2975bdc8-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-8ba9c8aeebd5",["D",1760217221145],[425],[391,1006,658,667],"2975bca6-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[424],[391,1006,658],"2975bb98-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[423,426],[391,1006],"29758204-a6e7-11f0-a077-0224a6c84d84","exclude","2975827c-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-825aae4abce4",["D",1760217221145],"# git ls-files --others --exclude-from=.git/info/exclude\n# Lines that start with '#' are comments.\n# For a project mostly in C, the following would be a good set of\n# exclude patterns (uncomment them if you want to use them):\n# *.[oa]\n# *~\n",[],[391,685,1027],"2975ba8a-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[421],[391,685],"29757ec6-a6e7-11f0-a077-0224a6c84d84","update.sample","29757f48-a6e7-11f0-a077-0224a6c84d84","0199d51f-481c-713b-a191-7c5d4a72f154",["D",1760217221145],"#!/bin/sh\n#\n# An example hook script to block unannotated tags from entering.\n# Called by \"git receive-pack\" with arguments: refname sha1-old sha1-new\n#\n# To enable this hook, rename this file to \"update\".\n#\n# Config\n# ------\n# hooks.allowunannotated\n# This boolean sets whether unannotated tags will be allowed into the\n# repository. By default they won't be.\n# hooks.allowdeletetag\n# This boolean sets whether deleting tags will be allowed in the\n# repository. By default they won't be.\n# hooks.allowmodifytag\n# This boolean sets whether a tag may be modified after creation. By default\n# it won't be.\n# hooks.allowdeletebranch\n# This boolean sets whether deleting branches will be allowed in the\n# repository. By default they won't be.\n# hooks.denycreatebranch\n# This boolean sets whether remotely creating branches will be denied\n# in the repository. By default this is allowed.\n#\n\n# --- Command line\nrefname=\"$1\"\noldrev=\"$2\"\nnewrev=\"$3\"\n\n# --- Safety check\nif [ -z \"$GIT_DIR\" ]; then\n\techo \"Don't run this script from the command line.\" >&2\n\techo \" (if you want, you could supply GIT_DIR then run\" >&2\n\techo \" $0 )\" >&2\n\texit 1\nfi\n\nif [ -z \"$refname\" -o -z \"$oldrev\" -o -z \"$newrev\" ]; then\n\techo \"usage: $0 \" >&2\n\texit 1\nfi\n\n# --- Config\nallowunannotated=$(git config --type=bool hooks.allowunannotated)\nallowdeletebranch=$(git config --type=bool hooks.allowdeletebranch)\ndenycreatebranch=$(git config --type=bool hooks.denycreatebranch)\nallowdeletetag=$(git config --type=bool hooks.allowdeletetag)\nallowmodifytag=$(git config --type=bool hooks.allowmodifytag)\n\n# check for no description\nprojectdesc=$(sed -e '1q' \"$GIT_DIR/description\")\ncase \"$projectdesc\" in\n\"Unnamed repository\"* | \"\")\n\techo \"*** Project description file hasn't been set\" >&2\n\texit 1\n\t;;\nesac\n\n# --- Check types\n# if $newrev is 0000...0000, it's a commit to delete a ref.\nzero=$(git hash-object --stdin &2\n\t\t\techo \"*** Use 'git tag [ -a | -s ]' for tags you want to propagate.\" >&2\n\t\t\texit 1\n\t\tfi\n\t\t;;\n\trefs/tags/*,delete)\n\t\t# delete tag\n\t\tif [ \"$allowdeletetag\" != \"true\" ]; then\n\t\t\techo \"*** Deleting a tag is not allowed in this repository\" >&2\n\t\t\texit 1\n\t\tfi\n\t\t;;\n\trefs/tags/*,tag)\n\t\t# annotated tag\n\t\tif [ \"$allowmodifytag\" != \"true\" ] && git rev-parse $refname > /dev/null 2>&1\n\t\tthen\n\t\t\techo \"*** Tag '$refname' already exists.\" >&2\n\t\t\techo \"*** Modifying a tag is not allowed in this repository.\" >&2\n\t\t\texit 1\n\t\tfi\n\t\t;;\n\trefs/heads/*,commit)\n\t\t# branch\n\t\tif [ \"$oldrev\" = \"$zero\" -a \"$denycreatebranch\" = \"true\" ]; then\n\t\t\techo \"*** Creating a branch is not allowed in this repository\" >&2\n\t\t\texit 1\n\t\tfi\n\t\t;;\n\trefs/heads/*,delete)\n\t\t# delete branch\n\t\tif [ \"$allowdeletebranch\" != \"true\" ]; then\n\t\t\techo \"*** Deleting a branch is not allowed in this repository\" >&2\n\t\t\texit 1\n\t\tfi\n\t\t;;\n\trefs/remotes/*,commit)\n\t\t# tracking branch\n\t\t;;\n\trefs/remotes/*,delete)\n\t\t# delete tracking branch\n\t\tif [ \"$allowdeletebranch\" != \"true\" ]; then\n\t\t\techo \"*** Deleting a tracking branch is not allowed in this repository\" >&2\n\t\t\texit 1\n\t\tfi\n\t\t;;\n\t*)\n\t\t# Anything else (is there anything else?)\n\t\techo \"*** Update hook: unknown type of update to ref $refname of type $newrev_type\" >&2\n\t\texit 1\n\t\t;;\nesac\n\n# --- Finished\nexit 0\n",[],[391,1046,1039],"hooks","29757624-a6e7-11f0-a077-0224a6c84d84","push-to-checkout.sample","2975769c-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n\n# An example hook script to update a checked-out tree on a git push.\n#\n# This hook is invoked by git-receive-pack(1) when it reacts to git\n# push and updates reference(s) in its repository, and when the push\n# tries to update the branch that is currently checked out and the\n# receive.denyCurrentBranch configuration variable is set to\n# updateInstead.\n#\n# By default, such a push is refused if the working tree and the index\n# of the remote repository has any difference from the currently\n# checked out commit; when both the working tree and the index match\n# the current commit, they are updated to match the newly pushed tip\n# of the branch. This hook is to be used to override the default\n# behaviour; however the code below reimplements the default behaviour\n# as a starting point for convenient modification.\n#\n# The hook receives the commit with which the tip of the current\n# branch is going to be updated:\ncommit=$1\n\n# It can exit with a non-zero status to refuse the push (when it does\n# so, it must not modify the index or the working tree).\ndie () {\n\techo >&2 \"$*\"\n\texit 1\n}\n\n# Or it can make any necessary changes to the working tree and to the\n# index to bring them to the desired state when the tip of the current\n# branch is updated to the new commit, and exit with a zero status.\n#\n# For example, the hook can simply run git read-tree -u -m HEAD \"$1\"\n# in order to emulate git fetch that is run in the reverse direction\n# with git push, as the two-tree form of git read-tree -u -m is\n# essentially the same as git switch or git checkout that switches\n# branches while keeping the local changes in the working tree that do\n# not interfere with the difference between the branches.\n\n# The below is a more-or-less exact translation to shell of the C code\n# for the default behaviour for git's push-to-checkout hook defined in\n# the push_to_deploy() function in builtin/receive-pack.c.\n#\n# Note that the hook will be executed from the repository directory,\n# not from the working tree, so if you want to perform operations on\n# the working tree, you will have to adapt your code accordingly, e.g.\n# by adding \"cd ..\" or using relative paths.\n\nif ! git update-index -q --ignore-submodules --refresh\nthen\n\tdie \"Up-to-date check failed\"\nfi\n\nif ! git diff-files --quiet --ignore-submodules --\nthen\n\tdie \"Working directory has unstaged changes\"\nfi\n\n# This is a rough translation of:\n#\n# head_has_history() ? \"HEAD\" : EMPTY_TREE_SHA1_HEX\nif git cat-file -e HEAD 2>/dev/null\nthen\n\thead=HEAD\nelse\n\thead=$(git hash-object -t tree --stdin \\).*$/Signed-off-by: \\1/p')\n# git interpret-trailers --in-place --trailer \"$SOB\" \"$COMMIT_MSG_FILE\"\n# if test -z \"$COMMIT_SOURCE\"\n# then\n# /usr/bin/perl -i.bak -pe 'print \"\\n\" if !$first_line++' \"$COMMIT_MSG_FILE\"\n# fi\n",[],[391,1046,1055],"2975719c-a6e7-11f0-a077-0224a6c84d84","pre-receive.sample","29757214-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n#\n# An example hook script to make use of push options.\n# The example simply echoes all push options that start with 'echoback='\n# and rejects all pushes when the \"reject\" push option is used.\n#\n# To enable this hook, rename this file to \"pre-receive\".\n\nif test -n \"$GIT_PUSH_OPTION_COUNT\"\nthen\n\ti=0\n\twhile test \"$i\" -lt \"$GIT_PUSH_OPTION_COUNT\"\n\tdo\n\t\teval \"value=\\$GIT_PUSH_OPTION_$i\"\n\t\tcase \"$value\" in\n\t\techoback=*)\n\t\t\techo \"echo from the pre-receive-hook: ${value#*=}\" >&2\n\t\t\t;;\n\t\treject)\n\t\t\texit 1\n\t\tesac\n\t\ti=$((i + 1))\n\tdone\nfi\n",[],[391,1046,1062],"29756cb0-a6e7-11f0-a077-0224a6c84d84","pre-rebase.sample","29756d1e-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n#\n# Copyright (c) 2006, 2008 Junio C Hamano\n#\n# The \"pre-rebase\" hook is run just before \"git rebase\" starts doing\n# its job, and can prevent the command from running by exiting with\n# non-zero status.\n#\n# The hook is called with the following parameters:\n#\n# $1 -- the upstream the series was forked from.\n# $2 -- the branch being rebased (or empty when rebasing the current branch).\n#\n# This sample shows how to prevent topic branches that are already\n# merged to 'next' branch from getting rebased, because allowing it\n# would result in rebasing already published history.\n\npublish=next\nbasebranch=\"$1\"\nif test \"$#\" = 2\nthen\n\ttopic=\"refs/heads/$2\"\nelse\n\ttopic=`git symbolic-ref HEAD` ||\n\texit 0 ;# we do not interrupt rebasing detached HEAD\nfi\n\ncase \"$topic\" in\nrefs/heads/??/*)\n\t;;\n*)\n\texit 0 ;# we do not interrupt others.\n\t;;\nesac\n\n# Now we are dealing with a topic branch being rebased\n# on top of master. Is it OK to rebase it?\n\n# Does the topic really exist?\ngit show-ref -q \"$topic\" || {\n\techo >&2 \"No such branch $topic\"\n\texit 1\n}\n\n# Is topic fully merged to master?\nnot_in_master=`git rev-list --pretty=oneline ^master \"$topic\"`\nif test -z \"$not_in_master\"\nthen\n\techo >&2 \"$topic is fully merged to master; better remove it.\"\n\texit 1 ;# we could allow it, but there is no point.\nfi\n\n# Is topic ever merged to next? If so you should not be rebasing it.\nonly_next_1=`git rev-list ^master \"^$topic\" ${publish} | sort`\nonly_next_2=`git rev-list ^master ${publish} | sort`\nif test \"$only_next_1\" = \"$only_next_2\"\nthen\n\tnot_in_topic=`git rev-list \"^$topic\" master`\n\tif test -z \"$not_in_topic\"\n\tthen\n\t\techo >&2 \"$topic is already up to date with master\"\n\t\texit 1 ;# we could allow it, but there is no point.\n\telse\n\t\texit 0\n\tfi\nelse\n\tnot_in_next=`git rev-list --pretty=oneline ^${publish} \"$topic\"`\n\t/usr/bin/perl -e '\n\t\tmy $topic = $ARGV[0];\n\t\tmy $msg = \"* $topic has commits already merged to public branch:\\n\";\n\t\tmy (%not_in_next) = map {\n\t\t\t/^([0-9a-f]+) /;\n\t\t\t($1 => 1);\n\t\t} split(/\\n/, $ARGV[1]);\n\t\tfor my $elem (map {\n\t\t\t\t/^([0-9a-f]+) (.*)$/;\n\t\t\t\t[$1 => $2];\n\t\t\t} split(/\\n/, $ARGV[2])) {\n\t\t\tif (!exists $not_in_next{$elem->[0]}) {\n\t\t\t\tif ($msg) {\n\t\t\t\t\tprint STDERR $msg;\n\t\t\t\t\tundef $msg;\n\t\t\t\t}\n\t\t\t\tprint STDERR \" $elem->[1]\\n\";\n\t\t\t}\n\t\t}\n\t' \"$topic\" \"$not_in_next\" \"$not_in_master\"\n\texit 1\nfi\n\n<<\\DOC_END\n\nThis sample hook safeguards topic branches that have been\npublished from being rewound.\n\nThe workflow assumed here is:\n\n * Once a topic branch forks from \"master\", \"master\" is never\n merged into it again (either directly or indirectly).\n\n * Once a topic branch is fully cooked and merged into \"master\",\n it is deleted. If you need to build on top of it to correct\n earlier mistakes, a new topic branch is created by forking at\n the tip of the \"master\". This is not strictly necessary, but\n it makes it easier to keep your history simple.\n\n * Whenever you need to test or publish your changes to topic\n branches, merge them into \"next\" branch.\n\nThe script, being an example, hardcodes the publish branch name\nto be \"next\", but it is trivial to make it configurable via\n$GIT_DIR/config mechanism.\n\nWith this workflow, you would want to know:\n\n(1) ... if a topic branch has ever been merged to \"next\". Young\n topic branches can have stupid mistakes you would rather\n clean up before publishing, and things that have not been\n merged into other branches can be easily rebased without\n affecting other people. But once it is published, you would\n not want to rewind it.\n\n(2) ... if a topic branch has been fully merged to \"master\".\n Then you can delete it. More importantly, you should not\n build on top of it -- other people may already want to\n change things related to the topic as patches against your\n \"master\", so if you need further changes, it is better to\n fork the topic (perhaps with the same name) afresh from the\n tip of \"master\".\n\nLet's look at this example:\n\n\t\t o---o---o---o---o---o---o---o---o---o \"next\"\n\t\t / / / /\n\t\t / a---a---b A / /\n\t\t/ / / /\n\t / / c---c---c---c B /\n\t / / / \\ /\n\t / / / b---b C \\ /\n\t / / / / \\ /\n ---o---o---o---o---o---o---o---o---o---o---o \"master\"\n\n\nA, B and C are topic branches.\n\n * A has one fix since it was merged up to \"next\".\n\n * B has finished. It has been fully merged up to \"master\" and \"next\",\n and is ready to be deleted.\n\n * C has not merged to \"next\" at all.\n\nWe would want to allow C to be rebased, refuse A, and encourage\nB to be deleted.\n\nTo compute (1):\n\n\tgit rev-list ^master ^topic next\n\tgit rev-list ^master next\n\n\tif these match, topic has not merged in next at all.\n\nTo compute (2):\n\n\tgit rev-list master..topic\n\n\tif this is empty, it is fully merged to \"master\".\n\nDOC_END\n",[],[391,1046,1069],"29756a94-a6e7-11f0-a077-0224a6c84d84","pre-push.sample","29756b02-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n\n# An example hook script to verify what is about to be pushed. Called by \"git\n# push\" after it has checked the remote status, but before anything has been\n# pushed. If this script exits with a non-zero status nothing will be pushed.\n#\n# This hook is called with the following parameters:\n#\n# $1 -- Name of the remote to which the push is being done\n# $2 -- URL to which the push is being done\n#\n# If pushing without using a named remote those arguments will be equal.\n#\n# Information about the commits which are being pushed is supplied as lines to\n# the standard input in the form:\n#\n# \n#\n# This sample shows how to prevent push of commits where the log message starts\n# with \"WIP\" (work in progress).\n\nremote=\"$1\"\nurl=\"$2\"\n\nzero=$(git hash-object --stdin &2 \"Found WIP commit in $local_ref, not pushing\"\n\t\t\texit 1\n\t\tfi\n\tfi\ndone\n\nexit 0\n",[],[391,1046,1076],"297568e6-a6e7-11f0-a077-0224a6c84d84","pre-merge-commit.sample","29756954-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n#\n# An example hook script to verify what is about to be committed.\n# Called by \"git merge\" with no arguments. The hook should\n# exit with non-zero status after issuing an appropriate message to\n# stderr if it wants to stop the merge commit.\n#\n# To enable this hook, rename this file to \"pre-merge-commit\".\n\n. git-sh-setup\ntest -x \"$GIT_DIR/hooks/pre-commit\" &&\n exec \"$GIT_DIR/hooks/pre-commit\"\n:\n",[],[391,1046,1083],"297566d4-a6e7-11f0-a077-0224a6c84d84","pre-commit.sample","29756742-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n#\n# An example hook script to verify what is about to be committed.\n# Called by \"git commit\" with no arguments. The hook should\n# exit with non-zero status after issuing an appropriate message if\n# it wants to stop the commit.\n#\n# To enable this hook, rename this file to \"pre-commit\".\n\nif git rev-parse --verify HEAD >/dev/null 2>&1\nthen\n\tagainst=HEAD\nelse\n\t# Initial commit: diff against an empty tree object\n\tagainst=$(git hash-object -t tree /dev/null)\nfi\n\n# If you want to allow non-ASCII filenames set this variable to true.\nallownonascii=$(git config --type=bool hooks.allownonascii)\n\n# Redirect output to stderr.\nexec 1>&2\n\n# Cross platform projects tend to avoid non-ASCII filenames; prevent\n# them from being added to the repository. We exploit the fact that the\n# printable range starts at the space character and ends with tilde.\nif [ \"$allownonascii\" != \"true\" ] &&\n\t# Note that the use of brackets around a tr range is ok here, (it's\n\t# even required, for portability to Solaris 10's /usr/bin/tr), since\n\t# the square bracket bytes happen to fall in the designated range.\n\ttest $(git diff --cached --name-only --diff-filter=A -z $against |\n\t LC_ALL=C tr -d '[ -~]\\0' | wc -c) != 0\nthen\n\tcat <<\\EOF\nError: Attempt to add a non-ASCII file name.\n\nThis can cause problems if you want to work with people on other platforms.\n\nTo be portable it is advisable to rename the file.\n\nIf you know what you are doing you can disable this check using:\n\n git config hooks.allownonascii true\nEOF\n\texit 1\nfi\n\n# If there are whitespace errors, print the offending file names and fail.\nexec git diff-index --check --cached $against --\n",[],[391,1046,1090],"29756544-a6e7-11f0-a077-0224a6c84d84","pre-applypatch.sample","297565b2-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n#\n# An example hook script to verify what is about to be committed\n# by applypatch from an e-mail message.\n#\n# The hook should exit with non-zero status after issuing an\n# appropriate message if it wants to stop the commit.\n#\n# To enable this hook, rename this file to \"pre-applypatch\".\n\n. git-sh-setup\nprecommit=\"$(git rev-parse --git-path hooks/pre-commit)\"\ntest -x \"$precommit\" && exec \"$precommit\" ${1+\"$@\"}\n:\n",[],[391,1046,1097],"297562d8-a6e7-11f0-a077-0224a6c84d84","post-update.sample","29756364-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n#\n# An example hook script to prepare a packed repository for use over\n# dumb transports.\n#\n# To enable this hook, rename this file to \"post-update\".\n\nexec git update-server-info\n",[],[391,1046,1104],"297555cc-a6e7-11f0-a077-0224a6c84d84","fsmonitor-watchman.sample","29755644-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/usr/bin/perl\n\nuse strict;\nuse warnings;\nuse IPC::Open2;\n\n# An example hook script to integrate Watchman\n# (https://facebook.github.io/watchman/) with git to speed up detecting\n# new and modified files.\n#\n# The hook is passed a version (currently 2) and last update token\n# formatted as a string and outputs to stdout a new update token and\n# all files that have been modified since the update token. Paths must\n# be relative to the root of the working tree and separated by a single NUL.\n#\n# To enable this hook, rename this file to \"query-watchman\" and set\n# 'git config core.fsmonitor .git/hooks/query-watchman'\n#\nmy ($version, $last_update_token) = @ARGV;\n\n# Uncomment for debugging\n# print STDERR \"$0 $version $last_update_token\\n\";\n\n# Check the hook interface version\nif ($version ne 2) {\n\tdie \"Unsupported query-fsmonitor hook version '$version'.\\n\" .\n\t \"Falling back to scanning...\\n\";\n}\n\nmy $git_work_tree = get_working_dir();\n\nmy $retry = 1;\n\nmy $json_pkg;\neval {\n\trequire JSON::XS;\n\t$json_pkg = \"JSON::XS\";\n\t1;\n} or do {\n\trequire JSON::PP;\n\t$json_pkg = \"JSON::PP\";\n};\n\nlaunch_watchman();\n\nsub launch_watchman {\n\tmy $o = watchman_query();\n\tif (is_work_tree_watched($o)) {\n\t\toutput_result($o->{clock}, @{$o->{files}});\n\t}\n}\n\nsub output_result {\n\tmy ($clockid, @files) = @_;\n\n\t# Uncomment for debugging watchman output\n\t# open (my $fh, \">\", \".git/watchman-output.out\");\n\t# binmode $fh, \":utf8\";\n\t# print $fh \"$clockid\\n@files\\n\";\n\t# close $fh;\n\n\tbinmode STDOUT, \":utf8\";\n\tprint $clockid;\n\tprint \"\\0\";\n\tlocal $, = \"\\0\";\n\tprint @files;\n}\n\nsub watchman_clock {\n\tmy $response = qx/watchman clock \"$git_work_tree\"/;\n\tdie \"Failed to get clock id on '$git_work_tree'.\\n\" .\n\t\t\"Falling back to scanning...\\n\" if $? != 0;\n\n\treturn $json_pkg->new->utf8->decode($response);\n}\n\nsub watchman_query {\n\tmy $pid = open2(\\*CHLD_OUT, \\*CHLD_IN, 'watchman -j --no-pretty')\n\tor die \"open2() failed: $!\\n\" .\n\t\"Falling back to scanning...\\n\";\n\n\t# In the query expression below we're asking for names of files that\n\t# changed since $last_update_token but not from the .git folder.\n\t#\n\t# To accomplish this, we're using the \"since\" generator to use the\n\t# recency index to select candidate nodes and \"fields\" to limit the\n\t# output to file names only. Then we're using the \"expression\" term to\n\t# further constrain the results.\n\tmy $last_update_line = \"\";\n\tif (substr($last_update_token, 0, 1) eq \"c\") {\n\t\t$last_update_token = \"\\\"$last_update_token\\\"\";\n\t\t$last_update_line = qq[\\n\"since\": $last_update_token,];\n\t}\n\tmy $query = <<\"\tEND\";\n\t\t[\"query\", \"$git_work_tree\", {$last_update_line\n\t\t\t\"fields\": [\"name\"],\n\t\t\t\"expression\": [\"not\", [\"dirname\", \".git\"]]\n\t\t}]\n\tEND\n\n\t# Uncomment for debugging the watchman query\n\t# open (my $fh, \">\", \".git/watchman-query.json\");\n\t# print $fh $query;\n\t# close $fh;\n\n\tprint CHLD_IN $query;\n\tclose CHLD_IN;\n\tmy $response = do {local $/; };\n\n\t# Uncomment for debugging the watch response\n\t# open ($fh, \">\", \".git/watchman-response.json\");\n\t# print $fh $response;\n\t# close $fh;\n\n\tdie \"Watchman: command returned no output.\\n\" .\n\t\"Falling back to scanning...\\n\" if $response eq \"\";\n\tdie \"Watchman: command returned invalid output: $response\\n\" .\n\t\"Falling back to scanning...\\n\" unless $response =~ /^\\{/;\n\n\treturn $json_pkg->new->utf8->decode($response);\n}\n\nsub is_work_tree_watched {\n\tmy ($output) = @_;\n\tmy $error = $output->{error};\n\tif ($retry > 0 and $error and $error =~ m/unable to resolve root .* directory (.*) is not watched/) {\n\t\t$retry--;\n\t\tmy $response = qx/watchman watch \"$git_work_tree\"/;\n\t\tdie \"Failed to make watchman watch '$git_work_tree'.\\n\" .\n\t\t \"Falling back to scanning...\\n\" if $? != 0;\n\t\t$output = $json_pkg->new->utf8->decode($response);\n\t\t$error = $output->{error};\n\t\tdie \"Watchman: $error.\\n\" .\n\t\t\"Falling back to scanning...\\n\" if $error;\n\n\t\t# Uncomment for debugging watchman output\n\t\t# open (my $fh, \">\", \".git/watchman-output.out\");\n\t\t# close $fh;\n\n\t\t# Watchman will always return all files on the first query so\n\t\t# return the fast \"everything is dirty\" flag to git and do the\n\t\t# Watchman query just to get it over with now so we won't pay\n\t\t# the cost in git to look up each individual file.\n\t\tmy $o = watchman_clock();\n\t\t$error = $output->{error};\n\n\t\tdie \"Watchman: $error.\\n\" .\n\t\t\"Falling back to scanning...\\n\" if $error;\n\n\t\toutput_result($o->{clock}, (\"/\"));\n\t\t$last_update_token = $o->{clock};\n\n\t\teval { launch_watchman() };\n\t\treturn 0;\n\t}\n\n\tdie \"Watchman: $error.\\n\" .\n\t\"Falling back to scanning...\\n\" if $error;\n\n\treturn 1;\n}\n\nsub get_working_dir {\n\tmy $working_dir;\n\tif ($^O =~ 'msys' || $^O =~ 'cygwin') {\n\t\t$working_dir = Win32::GetCwd();\n\t\t$working_dir =~ tr/\\\\/\\//;\n\t} else {\n\t\trequire Cwd;\n\t\t$working_dir = Cwd::cwd();\n\t}\n\n\treturn $working_dir;\n}\n",[],[391,1046,1111],"29755392-a6e7-11f0-a077-0224a6c84d84","commit-msg.sample","297553f6-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n#\n# An example hook script to check the commit log message.\n# Called by \"git commit\" with one argument, the name of the file\n# that has the commit message. The hook should exit with non-zero\n# status after issuing an appropriate message if it wants to stop the\n# commit. The hook is allowed to edit the commit message file.\n#\n# To enable this hook, rename this file to \"commit-msg\".\n\n# Uncomment the below to add a Signed-off-by line to the message.\n# Doing this in a hook is a bad idea in general, but the prepare-commit-msg\n# hook is more suited to it.\n#\n# SOB=$(git var GIT_AUTHOR_IDENT | sed -n 's/^\$.*>\$.*$/Signed-off-by: \\1/p')\n# grep -qs \"^$SOB\" \"$1\" || echo \"$SOB\" >> \"$1\"\n\n# This example catches duplicate Signed-off-by lines.\n\ntest \"\" = \"$(grep '^Signed-off-by: ' \"$1\" |\n\t sort | uniq -c | sed -e '/^[ \t]*1[ \t]/d')\" || {\n\techo >&2 Duplicate Signed-off-by lines.\n\texit 1\n}\n",[],[391,1046,1118],"29755216-a6e7-11f0-a077-0224a6c84d84","applypatch-msg.sample","29755284-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],"#!/bin/sh\n#\n# An example hook script to check the commit log message taken by\n# applypatch from an e-mail message.\n#\n# The hook should exit with non-zero status after issuing an\n# appropriate message if it wants to stop the commit. The hook is\n# allowed to edit the commit message file.\n#\n# To enable this hook, rename this file to \"applypatch-msg\".\n\n. git-sh-setup\ncommitmsg=\"$(git rev-parse --git-path hooks/commit-msg)\"\ntest -x \"$commitmsg\" && exec \"$commitmsg\" ${1+\"$@\"}\n:\n",[],[391,1046,1125],"2975b968-a6e7-11f0-a077-0224a6c84d84",["D",1760217221145],[407,408,409,410,411,412,413,414,415,416,417,418,419],[391,1046],["D",1760217221145],[406,420,422,427,479,483,484,485,486],[391],["D",1746217506027],{"_111":110,"_118":114},{"_111":110,"_112":-5,"_113":114,"_18":69,"_115":116,"_117":27},{"_13":100,"_34":101,"_57":44,"_102":58,"_103":-5,"_104":-5,"_105":-5,"_106":-5,"_107":-5,"_108":59,"_109":110},"ctx",{"_93":-5,"_138":1175,"_1176":1177,"_1178":1179,"_1180":27,"_1181":27,"_1182":27,"_1183":63,"_1184":-5,"_1185":-7,"_1186":-7,"_1187":77,"_1188":27,"_1189":27,"_1190":-5,"_1191":27,"_1192":27,"_1193":27,"_1194":-5},"ENV",{"_1146":1147,"_1148":1149,"_1150":101,"_1151":1152,"_1153":1154,"_1155":1156,"_1157":1158,"_1159":1160,"_1161":1162,"_1163":1164,"_1165":1166,"_1167":1168,"_1169":1170,"_1171":1172,"_1173":1174},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","e87eb04e707cf64e7e532c8e8ec395f209e17f15","RENDER_GIT_BRANCH","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","CLOUDFLARE_TURNSTILE_SITE_KEY","0x4AAAAAACtaIZJH7s9rBMZ6","GOOGLE_CLIENT_ID","875989696899-jtsqkhlbdv5jrlsk8631p7ipjg3c6o62.apps.googleusercontent.com","STRIPE_PUBLISHABLE_KEY","pk_live_51N2zvWEpZTTLipIkVEwXrUG9AT0yeOOEYxszarZT1jpsZV58Ly6wlg3SltZpHN26CUalOBmUSY7adQRQiSkCZz2500qSXNkf8Y","API_URL","https://api.val.town",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]

Diff · v524