[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8},"actionData","errors","root",{"_104":105,"_106":107},"routes/embed.x.$handle.$name.$",{"_9":10,"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":-5},"handle","q8kamikaze","name","plotmock","path","kwengine.ts","project",{"_22":45,"_11":12,"_33":46,"_47":-5,"_48":42,"_49":50,"_51":50,"_52":53,"_54":-5,"_55":56,"_57":58,"_59":32,"_60":-5,"_61":-5,"_62":63,"_64":65,"_66":-5,"_67":-5,"_68":-5,"_69":-5,"_70":71,"_72":71,"_73":74,"_75":74,"_76":74,"_77":71,"_78":71,"_79":80,"_81":82,"_83":84,"_85":42},"file",{"_22":23,"_11":14,"_24":25,"_26":-5,"_27":28,"_29":30,"_31":32,"_33":34,"_35":36,"_37":38,"_39":40,"_41":42,"_43":-5,"_13":44},"permalink","https://www.val.town/x/q8kamikaze/plotmock/code/kwengine.ts","extension","id","afe34866-1484-4fcc-ab0a-e35cf402481d","fileId","76f16f0c-afa1-11f1-8955-1607ee4eb77e","parentId","branchId","41ecad4a-db8d-4b21-8de0-73eb4a2ad6f7","branchVersion",54,"latest",true,"createdAt",["D",1789324990359],"version",14,"fileType","script","content","/* دراسة عمق — أنبوب وسوم IMDb البشرية + تصويت الأزواج\n ⚠️ ثلاثة أخطاء أمسكها القياس وصُحّحت هنا:\n ١) سقف الاتساع ٨٠٠٠ كان **يرمي أفضل وسم بالحالتين**: time-travel (٩١٥٥) وmonster (٩٥٩٥).\n السقف الآن ٣٠٬٠٠٠ — يرمي العام حقاً لا المميّز.\n ٢) المطابقة التقريبية (startsWith) أدخلت وسوماً دخيلة تماماً (\"theremin\") — أُلغيت، حرفي فقط.\n ٣) الترتيب بالندرة وحدها رفع مطابقات عرضية؛ الآن: العبارة الأطول أولاً (الأدق دلالياً)،\n ثم الأندر. */\nconst GQL = \"https://api.graphql.imdb.com/\";\nconst SHASHTI = \"https://q8kamikaze--0265d7dc765711f1baf01607ee4eb77e.web.val.run\";\nconst H = {\n \"content-type\": \"application/json\",\n \"origin\": \"https://www.imdb.com\",\n \"referer\": \"https://www.imdb.com/\",\n \"user-agent\": \"Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/120 Safari/537.36\",\n};\nasync function gql(query: string) {\n const r = await fetch(GQL, { method: \"POST\", headers: H, body: JSON.stringify({ query }), signal: AbortSignal.timeout(25000) });\n return await r.json();\n}\n\n/* كلمات لا تصلح وسماً **مستقلاً** — لكنها مسموحة **داخل** وسم مركّب\n (\"time\" وحدها ضجيج، لكن \"time travel\" أقوى وسم ممكن. خلطهما كان خطأً مقاساً.) */\nconst WEAK = new Set((\"lives live living life time man woman boy girl child children thing place world year day night \" +\n \"hunt sound family people story\").split(\" \"));\nconst STOP = new Set((\"a an the of in on at to for from by with and or but is are was were be been about after \" +\n \"who that this his her its their he she it they them movie film series show tv season episode one two three \" +\n \"new old make made get gets has have had not no all some any more most where when how why \" +\n \"someone something himself herself themselves each other into onto over under while during because\").split(\" \"));\n\nconst slug = (s: string) => s.trim().toLowerCase().replace(/\\s+/g, \"-\");\n\nasync function toKeywords(text: string) {\n const words = text.toLowerCase().replace(/[^a-z0-9 ]+/g, \" \").split(/\\s+/).filter(Boolean);\n /* جذر خفيف: أول ٥ حروف — يجسر \"traveling\"↔\"travel\" و\"monsters\"↔\"monster\" */\n const stem = (w: string) => w.slice(0, 5);\n const bag = new Set(words.filter(w => !STOP.has(w) && w.length > 2).map(stem));\n\n const cand: string[] = [];\n for (let n = 3; n >= 1; n--) {\n for (let i = 0; i + n <= words.length; i++) {\n const g = words.slice(i, i + n);\n if (STOP.has(g[0]) || STOP.has(g[g.length - 1])) continue;\n if (g.every(w => STOP.has(w) || w.length <= 2)) continue;\n cand.push(g.join(\" \"));\n }\n }\n const uniq = [...new Set(cand)].slice(0, 24);\n /* مفرد/جمع: \"monsters\" ليست وسماً و\"monster\" وسم — نضيف المفرد كمرشَّح مستقل */\n const singular = uniq.map(w => w.replace(/\\b(\\w{4,})s\\b/g, \"$1\")).filter(w => !uniq.includes(w));\n const all = [...uniq, ...new Set(singular)].slice(0, 32);\n const hits = await Promise.all(all.map(async w => {\n try {\n const j = await gql(`query { mainSearch(first: 6, options: { searchTerm: ${JSON.stringify(w)}, type: KEYWORD }) {\n edges { node { entity { ... on Keyword { text { text } } } } } } }`);\n const list: string[] = (j?.data?.mainSearch?.edges || []).map((e: any) => e.node?.entity?.text?.text).filter(Boolean);\n const exact = list.find(h => h === w);\n /* ⚠️ تصحيح رابع (قياس): الترجمة تقلب ترتيب العبارة (\"traveling in time\" مقابل\n \"time travel\")، فالثنائية الحرفية لا تتكوّن أبداً ويضيع أقوى وسم. الحل:\n نقبل أي اقتراح **كل كلماته موجودة بالوصف نفسه** — لا شرط على الترتيب. */\n const subset = list\n .filter(h => h !== w && h.split(\" \").length > 1)\n .filter(h => h.split(\" \").every(x => STOP.has(x) || bag.has(stem(x))));\n const chosen = exact || subset[0] || null;\n return { w, kw: chosen, n: chosen ? chosen.split(\" \").length : 0, via: exact ? \"حرفي\" : (chosen ? \"تجميع\" : \"\") };\n } catch { return { w, kw: null, n: 0, via: \"\" }; }\n }));\n const seen = new Set();\n const strong: any[] = [], weak: any[] = [];\n for (const h of hits.filter(x => x.kw).sort((a, b) => b.n - a.n)) {\n const s = slug(h.kw!);\n if (seen.has(s)) continue;\n seen.add(s);\n /* كلمة ضعيفة مفردة تُؤجَّل احتياطاً — تُستعمل فقط لو الوسوم القوية أقل من ثلاثة */\n (h.n === 1 && WEAK.has(h.kw!.toLowerCase()) ? weak : strong).push({ ...h, slug: s });\n }\n return strong.length >= 3 ? strong : strong.concat(weak);\n}\n\nasync function keywordBreadth(s: string) {\n try {\n const j = await gql(`query { advancedTitleSearch(first: 1,\n constraints: { keywordConstraint: { allKeywords: ${JSON.stringify([s])} },\n explicitContentConstraint: { explicitContentFilter: EXCLUDE_ADULT } }) { total } }`);\n return j?.data?.advancedTitleSearch?.total ?? -1;\n } catch { return -1; }\n}\n\nasync function pair(a: string, b: string, take = 12) {\n try {\n const j = await gql(`query { advancedTitleSearch(first: ${take},\n sort: { sortBy: POPULARITY, sortOrder: ASC },\n constraints: { keywordConstraint: { allKeywords: ${JSON.stringify([a, b])} },\n explicitContentConstraint: { explicitContentFilter: EXCLUDE_ADULT } })\n { total edges { node { title { id titleText { text } releaseYear { year } titleType { id }\n primaryImage { url } ratingsSummary { aggregateRating } } } } } }`);\n const d = j?.data?.advancedTitleSearch;\n return { total: d?.total ?? 0, items: (d?.edges || []).map((e: any) => ({\n id: e.node?.title?.id, t: e.node?.title?.titleText?.text, y: e.node?.title?.releaseYear?.year,\n type: e.node?.title?.titleType?.id, img: e.node?.title?.primaryImage?.url || null,\n r: e.node?.title?.ratingsSummary?.aggregateRating ?? null,\n })) };\n } catch { return { total: 0, items: [] }; }\n}\n\nexport async function findByKeywords(rawText: string, picked?: string[]) {\n const t0 = Date.now();\n const dbg: any = {};\n let en = rawText.trim();\n if (/[\\u0600-\\u06FF]/.test(en)) {\n try {\n const tr = await fetch(SHASHTI + \"/translate?q=\" + encodeURIComponent(en) + \"&target=en\", { signal: AbortSignal.timeout(15000) })\n .then(r => r.ok ? r.json() : null);\n if (tr?.text) en = String(tr.text);\n } catch { /* نكمل بالأصل */ }\n }\n dbg.en = en;\n\n const kws = await toKeywords(en);\n dbg.mapped = kws.map(k => k.w + \" → \" + k.kw);\n\n const withBreadth = await Promise.all(kws.slice(0, 12).map(async k => ({ ...k, total: await keywordBreadth(k.slug) })));\n const auto = withBreadth\n .filter(k => k.total >= 5 && k.total <= 30000)\n .sort((a, b) => (b.n - a.n) || (a.total - b.total))\n .slice(0, 5);\n\n /* رقائق للعرض: كل الوسوم الصالحة + اقتراحات IMDb حولها (يجسر الفجوة اللفظية:\n المستخدم يكتب \"dream\" وIMDb يسمّيها \"dream within a dream\") */\n const sugSeeds = withBreadth.filter(k => k.total >= 5).slice(0, 4);\n const sugLists = await Promise.all(sugSeeds.map(async k => {\n try {\n const j = await gql(`query { mainSearch(first: 8, options: { searchTerm: ${JSON.stringify(k.kw)}, type: KEYWORD }) {\n edges { node { entity { ... on Keyword { text { text } } } } } } }`);\n return (j?.data?.mainSearch?.edges || []).map((e: any) => e.node?.entity?.text?.text).filter(Boolean);\n } catch { return []; }\n }));\n const chipSet = new Map();\n for (const k of withBreadth.filter(x => x.total >= 5)) chipSet.set(k.slug, true);\n for (const l of sugLists) for (const s of l) chipSet.set(slug(s), false);\n dbg.chips = [...chipSet.entries()].slice(0, 24).map(([s, isAuto]) => ({ s, auto: isAuto }));\n\n /* لو المستخدم اختار رقائق بنفسه، هي المصدر — وإلا الاختيار الآلي */\n const good = picked && picked.length >= 2\n ? picked.map(p => ({ slug: p, total: 0, n: p.split(\"-\").length, w: p, kw: p }))\n : auto;\n dbg.breadth = withBreadth.map(k => k.slug + \":\" + k.total);\n dbg.chosen = good.map((k: any) => k.slug + (k.total ? \"(\" + k.total + \")\" : \"\"));\n dbg.manual = !!(picked && picked.length >= 2);\n\n if (dbg.manual) {\n for (const g of good as any[]) if (!g.total) g.total = await keywordBreadth(g.slug);\n }\n\n if (good.length < 2) { dbg.ms = Date.now() - t0; return { items: [], debug: dbg, reason: \"وسوم غير كافية\" }; }\n\n const pairs: [string, string][] = [];\n for (let i = 0; i < good.length; i++)\n for (let j = i + 1; j < good.length; j++) pairs.push([good[i].slug, good[j].slug]);\n\n const results = await Promise.all(pairs.slice(0, 10).map(async ([a, b]) => ({ a, b, ...(await pair(a, b)) })));\n dbg.pairs = results.map(r => r.a + \"+\" + r.b + \"=\" + r.total);\n\n const votes = new Map();\n for (const r of results) {\n if (!r.total || r.total > 2000) continue;\n r.items.forEach((it: any) => {\n if (!it.id) return;\n let v = votes.get(it.id);\n if (!v) { v = { ...it, pairs: 0, from: [] as string[] }; votes.set(it.id, v); }\n v.pairs++;\n if (v.from.length < 4) v.from.push(r.a + \"+\" + r.b);\n });\n }\n\n /* ═══ الحل الجذري لفشل الاختيار الآلي ═══\n لا نحاول تخمين «أي وسمين هما الجوهريان» — نجمع كل المرشَّحين من كل الأزواج،\n ثم نسحب **قائمة وسوم كل مرشَّح نفسه** ونحسب كم وسماً من وسوم وصفك يحملها فعلاً.\n العمل الصحيح يحمل أربعة أو خمسة منها؛ الدخيل يحمل الاثنين اللذين جاء بهما فقط.\n والوزن IDF: وسم نادر (missing-children ٥٨) يساوي أضعاف وسم عام (time-travel ٩١٥٥). */\n const cands = [...votes.values()].slice(0, 24);\n if (cands.length) {\n const alias = cands.map((c, i) =>\n `t${i}: title(id: ${JSON.stringify(c.id)}) { keywords(first: 40) { edges { node { text } } } }`).join(\" \");\n try {\n const j = await gql(`query { ${alias} }`);\n const qk = withBreadth.filter(k => k.total > 0)\n .concat(dbg.manual ? (good as any[]).filter(g => !withBreadth.some(w => w.slug === g.slug)) : []);\n const BASE = 400000;\n const stemSet = (s: string) => new Set(s.split(\"-\").filter(x => x.length > 2 && !STOP.has(x)).map(x => x.slice(0, 5)));\n cands.forEach((c, i) => {\n const own = ((j?.data?.[`t${i}`]?.keywords?.edges) || []).map((e: any) => slug(String(e.node?.text || \"\")));\n const ownStems = own.map((o: string) => ({ o, st: stemSet(o) }));\n const used = new Set();\n let hit = 0, idf = 0;\n const matched: string[] = [];\n for (const k of qk) {\n const mine = stemSet(k.slug);\n if (!mine.size) continue;\n /* ⚠️ المطابقة الحرفية للوسم كانت تُسقط الصحيح: Dark يحمل \"missing child\"\n و\"german town\" بينما وصفك أنتج \"missing children\" و\"german\" — نفس المعنى،\n سلسلة مختلفة. فالمطابقة الآن بتداخل الجذور (أحدهما يحتوي الآخر). */\n let best: any = null, exact = false;\n for (const o of ownStems) {\n if (used.has(o.o)) continue;\n if (o.o === k.slug) { best = o; exact = true; break; }\n /* ⚠️ بگ مقاس: وسم بلا جذور معتبرة (k9 · ak-47) مجموعته فارغة،\n و«every» على مجموعة فارغة ترجع true — فينتج تطابق كاذب تماماً.\n الشرط الآن: الطرفان غير فارغين، ومع تداخل فعلي. */\n if (!o.st.size || !mine.size) continue;\n const sub = [...mine].every(x => o.st.has(x)) || [...o.st].every(x => mine.has(x));\n if (sub && !best) best = o;\n }\n if (!best) continue;\n used.add(best.o);\n hit++;\n idf += Math.log(BASE / Math.max(k.total, 5)) * (exact ? 1 : 0.7);\n matched.push(k.slug + (exact ? \"\" : \"≈\" + best.o));\n }\n c.hit = hit; c.idf = +idf.toFixed(2); c.matched = matched;\n });\n } catch (e) { dbg.verifyErr = String(e).slice(0, 120); }\n }\n\n const ranked = cands\n .sort((a, b) => (b.hit || 0) - (a.hit || 0) || (b.idf || 0) - (a.idf || 0))\n .slice(0, 8);\n dbg.ms = Date.now() - t0;\n return { items: ranked, debug: dbg };\n}\n","deleted",false,"label",[14],"aac825c1-2413-4e07-9a62-b02afc5c4a3c",["D",1789320435960],"deletedAt","legacyEnvVars","privacy","public","httpPrivacy","description","تجربة حية — ابحث بالوصف عبر IMDb (شاشتي)","imageUrl","userId","3ebaad40-a052-4790-b81e-3f7150ba2541","pinnedFileId","5d4f5b9e-af98-11f1-ac7b-1607ee4eb77e","pinPreview","pinMigrated","screenshotVersion","likeCount",0,"orgId","019f2482-7732-7792-a002-4769564b16e3","tursoName","tursoHostname","tursoMeasuredAt","pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm","user",{"_9":10,"_103":99},"org",{"_9":10,"_96":97,"_98":99,"_55":56,"_100":101,"_102":42},"branch",{"_35":86,"_11":87,"_22":28,"_88":45,"_89":-5,"_90":-5,"_91":-5,"_92":-5,"_93":-5,"_94":12,"_95":10},"isOwned",220,"main","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","displayName","abdullah almutiri","avatar","https://lh3.googleusercontent.com/a/ACg8ocJjLfZ30tBYLbrxg91pFDOkvd_eliciqRxo05OCUN0ZLARL46c=s96-c","tier","free","canRestrictVals","profileImageUrl","ctx",{"_79":-5,"_137":138,"_139":140,"_141":142,"_143":42,"_144":42,"_145":42,"_146":32,"_147":-5,"_148":-7,"_149":-7,"_150":63,"_151":42,"_152":42,"_153":-5,"_154":42,"_155":42,"_156":42,"_157":-5},"ENV",{"_108":109,"_110":111,"_112":87,"_113":114,"_115":116,"_117":118,"_119":120,"_121":122,"_123":124,"_125":126,"_127":128,"_129":130,"_131":132,"_133":134,"_135":136},"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","orgs",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]