[{"_1":2,"_292":-5,"_293":-5},"loaderData",{"_3":4,"_96":97,"_201":202,"_291":-5},"root",{"_5":6,"_33":34,"_65":66},"ctx",{"_7":8,"_19":20,"_21":-5,"_22":23,"_24":25,"_26":27,"_28":27,"_29":27,"_30":31,"_32":27},"auth",{"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5},"sessionClaims","sessionId","sessionStatus","userId","actor","orgId","orgRole","orgSlug","orgPermissions","factorVerificationAge","environmentVariableKeys",[],"user","preferencesKeybindings","default","preferencesTheme","light","preferencesFixers",false,"preferencesCopilot","preferencesSelectionAi","notificationCount",0,"flagDenols","ENV",{"_35":36,"_37":38,"_39":40,"_41":42,"_43":44,"_45":46,"_47":48,"_49":50,"_51":52,"_53":54,"_55":56,"_57":58,"_59":60,"_61":62,"_63":64},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","VAL_RUNTIME_NAME","prod","RENDER_GIT_COMMIT","5beacca5973a0e52781e0b9acd2cb00f05badfe7","RENDER_GIT_BRANCH","main","CLERK_PUBLISHABLE_KEY","pk_live_Y2xlcmsudmFsLnRvd24k","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","API_URL","https://api.val.town","WORKER_FINGERPRINT","963e45ace5b0a45db0aea6fd292ac66b","clerkState",{"_67":68},"__internal_clerk_state",{"_69":70,"_71":44,"_72":73,"_74":73,"_75":27,"_76":73,"_77":73,"_78":73,"_79":73,"_80":73,"_81":73,"_82":73,"_83":73,"_84":85,"_94":27,"_95":27},"__clerk_ssr_state",{"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5},"__publishableKey","__proxyUrl","","__domain","__isSatellite","__signInUrl","__signUpUrl","__afterSignInUrl","__afterSignUpUrl","__signInForceRedirectUrl","__signUpForceRedirectUrl","__signInFallbackRedirectUrl","__signUpFallbackRedirectUrl","__clerk_debug",{"_86":27,"_87":73,"_88":89,"_90":73,"_91":44,"_92":27,"_93":73},"isSignedIn","proxyUrl","reason","session-token-and-uat-missing","message","publishableKey","isSatellite","domain","__telemetryDisabled","__telemetryDebug","routes/_app.x.$handle.$name",{"_98":99,"_100":101,"_102":42,"_103":73,"_104":-7,"_105":106,"_149":150,"_172":173,"_174":175,"_181":182,"_186":-5,"_187":188,"_192":193,"_199":27,"_200":27},"handle","deadcoder0904","name","parse-xml-jsr","branchName","path","version","project",{"_107":108,"_100":101,"_109":110,"_111":-5,"_112":27,"_113":114,"_115":-5,"_116":-5,"_12":117,"_118":-5,"_119":27,"_120":-5,"_121":31,"_14":122,"_123":124,"_125":124,"_126":127,"_128":127,"_129":127,"_130":124,"_131":124,"_21":132,"_135":136,"_148":27},"id","a53ed4fa-4065-11f0-9e46-76b3cceeab13","createdAt",["D",1748946575665],"deletedAt","legacyEnvVars","privacy","public","description","imageUrl","153147a0-405e-11f0-bfbe-7da0210b7c9d","pinnedFileId","pinPreview","screenshotVersion","likeCount","f13116cb-1a0d-4299-877c-4dcaddc30109","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm",{"_98":99,"_133":134},"profileImageUrl","https://img.clerk.com/eyJ0eXBlIjoicHJveHkiLCJzcmMiOiJodHRwczovL2ltYWdlcy5jbGVyay5kZXYvb2F1dGhfZ2l0aHViL2ltZ18yeHphTnM0VVcwaDJiMnFVeU1FZFFMRkVhRXoifQ","branch",{"_104":137,"_100":42,"_107":138,"_139":108,"_140":141,"_142":143,"_144":114,"_145":117,"_146":101,"_147":99},11,"a5410ce8-4065-11f0-9e46-76b3cceeab13","projectId","forkedBranchId","2848f266-405e-11f0-9f68-76b3cceeab13","forkedBranchVersion",5,"forkedProjectPrivacy","forkedProjectUserId","projectName","userHandle","isOwned","tree",[151],{"_107":152,"_100":153,"_154":155,"_156":-5,"_157":138,"_158":137,"_159":160,"_109":161,"_104":162,"_163":164,"_165":166,"_167":27,"_168":-5,"_169":170,"_103":171},"40b01042-4067-11f0-b5c8-76b3cceeab13","main.tsx","fileId","1f81b7a1-1920-4f4c-a201-2ea872f4eed4","parentId","branchId","branchVersion","latest",true,["D",1748947265945],10,"fileType","script","content","import { parse } from \"jsr:@libs/xml@7.0.0/parse\";\n\nconst parsed = parse(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);","deleted","label","children",[],[153],"files",[151],"counts",{"_176":31,"_177":178,"_179":178,"_180":31},"pulls","branches",1,"forks","envVars","contents",[183],{"_107":152,"_100":153,"_154":155,"_156":-5,"_157":138,"_158":137,"_159":160,"_109":184,"_104":162,"_163":164,"_165":166,"_167":27,"_168":-5,"_103":185},["D",1748947265945],[153],"file","upstreamProject",{"_107":189,"_100":190,"_115":-5,"_116":-5,"_113":114,"_21":191},"2848a9c8-405e-11f0-9f68-76b3cceeab13","parse-xml",{"_98":99,"_133":134},"upstreamBranch",{"_107":141,"_109":194,"_195":196,"_100":42,"_139":189,"_104":143,"_140":-5,"_142":-5,"_197":198,"_111":-5,"_148":27,"_113":114,"_147":99,"_14":122,"_146":190},["D",1748943359541],"updatedAt",["D",1748943515740],"lockfileKey","1748943517991-esm.town_v_deadcoder0904_parse-xml@5-main","emptyEnvVars","isNew","routes/_app.x.$handle.$name.branch.$branch.history",{"_98":99,"_100":101,"_102":42,"_105":203,"_207":208,"_289":31,"_290":27},{"_107":108,"_100":101,"_109":204,"_111":-5,"_112":27,"_113":114,"_115":-5,"_116":-5,"_12":117,"_118":-5,"_119":27,"_120":-5,"_121":31,"_14":122,"_123":124,"_125":124,"_126":127,"_128":127,"_129":127,"_130":124,"_131":124,"_21":205,"_135":206,"_148":27},["D",1748946575665],{"_98":99,"_133":134},{"_104":137,"_100":42,"_107":138,"_139":108,"_140":141,"_142":143,"_144":114,"_145":117,"_146":101,"_147":99},"history",[209,214,222,229,237,245,252,260,268,276,282],{"_154":155,"_104":137,"_109":210,"_157":138,"_172":211},["D",1748947265945],[212],{"_107":152,"_157":138,"_154":155,"_100":153,"_165":166,"_163":164,"_104":162,"_156":-5,"_109":210,"_158":137,"_168":-5,"_159":160,"_167":27,"_103":213},[153],{"_154":155,"_104":162,"_109":215,"_157":138,"_172":216},["D",1748947226083],[217],{"_107":218,"_157":138,"_154":155,"_100":153,"_165":219,"_163":164,"_104":220,"_156":-5,"_109":215,"_158":162,"_168":-5,"_159":27,"_167":27,"_103":221},"28ed7a58-4067-11f0-8352-76b3cceeab13","import { parseXml } from \"jsr:@libs/xml@7.0.0/parse\";\n\nconst parsed = parseXml(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);",9,[153],{"_154":155,"_104":220,"_109":223,"_157":138,"_172":224},["D",1748947224629],[225],{"_107":226,"_157":138,"_154":155,"_100":153,"_165":219,"_163":164,"_104":227,"_156":-5,"_109":223,"_158":220,"_168":-5,"_159":27,"_167":27,"_103":228},"280f7adc-4067-11f0-a216-76b3cceeab13",8,[153],{"_154":155,"_104":227,"_109":230,"_157":138,"_172":231},["D",1748947045417],[232],{"_107":233,"_157":138,"_154":155,"_100":153,"_165":234,"_163":164,"_104":235,"_156":-5,"_109":230,"_158":227,"_168":-5,"_159":27,"_167":27,"_103":236},"bd3d8f46-4066-11f0-be7c-76b3cceeab13","import { parseXml } from \"jsr:@libs/xml@7.0.0/parse.ts\";\n\nconst parsed = parseXml(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);",7,[153],{"_154":155,"_104":235,"_109":238,"_157":138,"_172":239},["D",1748947032788],[240],{"_107":241,"_157":138,"_154":155,"_100":153,"_165":242,"_163":164,"_104":243,"_156":-5,"_109":238,"_158":235,"_168":-5,"_159":27,"_167":27,"_103":244},"b5b6b158-4066-11f0-a390-76b3cceeab13","import { parseXml } from \"jsr:@libs/xml/parse\";\n\nconst parsed = parseXml(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);",6,[153],{"_154":155,"_104":243,"_109":246,"_157":138,"_172":247},["D",1748947019219],[248],{"_107":249,"_157":138,"_154":155,"_100":153,"_165":250,"_163":164,"_104":143,"_156":-5,"_109":246,"_158":243,"_168":-5,"_159":27,"_167":27,"_103":251},"ada08c00-4066-11f0-b700-76b3cceeab13","import { parseXml } from \"jsr:@libs/xml/parse.ts\";\n\nconst parsed = parseXml(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);",[153],{"_154":155,"_104":143,"_109":253,"_157":138,"_172":254},["D",1748946971370],[255],{"_107":256,"_157":138,"_154":155,"_100":153,"_165":257,"_163":164,"_104":258,"_156":-5,"_109":253,"_158":143,"_168":-5,"_159":27,"_167":27,"_103":259},"911b313e-4066-11f0-b9fe-76b3cceeab13","import { parseXml } from \"jsr:@libs/xml\";\n\nconst parsed = parseXml(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);",4,[153],{"_154":155,"_104":258,"_109":261,"_157":138,"_172":262},["D",1748946762990],[263],{"_107":264,"_157":138,"_154":155,"_100":153,"_165":265,"_163":164,"_104":266,"_156":-5,"_109":261,"_158":258,"_168":-5,"_159":27,"_167":27,"_103":267},"14e75516-4066-11f0-8e5a-76b3cceeab13","import { parseXml } from \"https://deno.land/x/xml@7.0.0\";\n\nconst parsed = parseXml(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);",3,[153],{"_154":155,"_104":266,"_109":269,"_157":138,"_172":270},["D",1748946638423],[271],{"_107":272,"_157":138,"_154":155,"_100":153,"_165":273,"_163":164,"_104":274,"_156":-5,"_109":269,"_158":266,"_168":-5,"_159":27,"_167":27,"_103":275},"caa7904c-4065-11f0-946c-76b3cceeab13","import { parseXml } from \"npm:@libs/xml\";\n\nconst parsed = parseXml(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);",2,[153],{"_154":155,"_104":274,"_109":277,"_157":138,"_172":278},["D",1748946590879],[279],{"_107":280,"_157":138,"_154":155,"_100":153,"_165":257,"_163":164,"_104":178,"_156":-5,"_109":277,"_158":274,"_168":-5,"_159":27,"_167":27,"_103":281},"ae5164f4-4065-11f0-8c60-76b3cceeab13",[153],{"_154":155,"_104":178,"_109":283,"_157":138,"_172":284},["D",1748946575665],[285],{"_107":286,"_157":138,"_154":155,"_100":153,"_165":287,"_163":164,"_104":31,"_156":-5,"_109":283,"_158":178,"_168":-5,"_159":27,"_167":27,"_103":288},"a5433dba-4065-11f0-9e46-76b3cceeab13","import { parseXml } from \"npm:@rgrove/parse-xml\";\n\nconst parsed = parseXml(`\n Given an array of integers \\`nums\\`and an integer \\`target\\`, return indices of the two numbers such that they add up to \\`target\\`.\n\n You may assume that each input would have exactly one solution, and you may not use the same element twice.\n\n You can return the answer in any order.\n \n 2 <= nums.length <= 10^4\n -10^9 <= nums[i] <= 10^9\n `);\n\nconsole.log(parsed);",[153],"page","hasNext","routes/_app","actionData","errors"]

History