agentix-cli 0.132.0 → 0.133.0

package/dist/chunk-EQ33PFXP.js

@@ -1,55 +0,0 @@
-import{a as F,b as H,c as G}from"./chunk-2ZDV3DCT.js";import{a as Q,b as j,c as U,d as T,e as N,j as B}from"./chunk-ZG4G6BFP.js";import{a as Y}from"./chunk-7VLLZQ3N.js";import{y as I,z as nt}from"./chunk-724IBN5Y.js";import{g as O}from"./chunk-6TURWSMN.js";import{b as v,c as W}from"./chunk-QOYAX2FT.js";import{readFileSync as at,existsSync as K}from"fs";nt();import{resolve as E}from"path";import{execSync as it}from"child_process";async function xt(e,r,o,t={}){let d=t.selectorModel??"haiku",l=t.synthModel??"sonnet",m=t.maxCandidates??3,p=t.maxHops??2,h=t.maxArticles??8,a=t.timeoutMs??6e4,i=t.log??console.error.bind(console,"[wiki-query]"),c=t.messagePath?.length?t.messagePath:void 0,n=t.graphWeight??P,s=E(r.baseDir,"_index.md"),u=J(r,o,t.shared),w=t.method??"catalog";if(w!=="catalog"){let g=H(r,t.shared);if(w==="summaries"||g.size>0){let f=t.summaries??F,k=await G(e,u,g,{...f,navigatorModel:t.selectorModel??f.navigatorModel,answerModel:t.synthModel??f.answerModel},{call:t.call??Y,fetch:t.fetch,timeoutMs:a,log:i}),$=k.picked.map(A=>({title:A.meta.title,path:A.path,type:A.meta.type}));return{answer:k.answer,citations:k.status==="ok"?$:[],candidates:$.map(({title:A,path:rt})=>({title:A,path:rt})),walked:$.map(A=>({...A,hop:0})),status:k.status,method:"summaries",live:k.live,liveAsked:k.liveAsked,trace:k.trace,...k.error?{error:k.error}:{}}}}if(!K(s)&&u.sharedPool.length===0)return C("no-catalog",e,"No _index.md found \u2014 run `agentx wiki status` to rebuild.");let tt=(K(s)?at(s,"utf-8"):"")+lt(e,u.sharedPool,c,n),R=Date.now(),S=[],b="";try{let g=await Z(e,u.pool,o,m,c,n);g?(S=g,b=`[wiki-rerank seat] ${g.map(f=>f.title).join(" | ")}`):(b=await V(ht(e,tt,m,c),d,a),S=mt(b))}catch(g){return i("selector failed:",g?.message),{...C("error",e,`Selector: ${g?.message||"unknown"}`),trace:{selectorMs:Date.now()-R,synthesisMs:0,selectorOutput:b}}}let M=Date.now()-R;if(S.length===0)return{...C("no-candidates",e,"Selector returned no candidates."),trace:{selectorMs:M,synthesisMs:0,selectorOutput:b}};let x=X(S,u,p,h);if(x.length===0)return{...C("no-candidates",e,"Candidates did not resolve to readable articles."),candidates:S,trace:{selectorMs:M,synthesisMs:0,selectorOutput:b}};let _=Date.now(),D="";try{D=await V(dt(e,x),l,a*2)}catch(g){return i("synthesis failed:",g?.message),{...C("error",e,`Synthesis: ${g?.message||"unknown"}`),candidates:S,walked:x.map(f=>({title:f.meta.title,path:f.path,type:f.meta.type,hop:f.hop??0})),trace:{selectorMs:M,synthesisMs:Date.now()-_,selectorOutput:b}}}let et=Date.now()-_;return{answer:D.trim(),citations:x.map(g=>({title:g.meta.title,path:g.path,type:g.meta.type})),candidates:S,walked:x.map(g=>({title:g.meta.title,path:g.path,type:g.meta.type,hop:g.hop??0})),status:"ok",trace:{selectorMs:M,synthesisMs:et,selectorOutput:b}}}async function Ct(e,r,o,t={}){let d=t.maxCandidates??3,l=t.graphWeight??P,m=t.messagePath?.length?t.messagePath:void 0,p=t.pool??z(r);if(p.length===0||!e.trim())return[];let h=await Z(e,p,o,d,m,l,t.stage??"retrieve");if(!h){let a=new Set(W(e,v(p.map(q))).map(i=>i.docIndex));h=L(e,p,m,l).filter(i=>a.has(i)).slice(0,d).map(i=>({title:p[i].title,path:p[i].path}))}return h.length===0?[]:X(h,J(r,o),t.maxHops??1,t.maxArticles??6)}function z(e){try{return(e.rebuildIndex().articles??[]).filter(r=>r.path&&!r.path.includes("/_versions/"))}catch{return[]}}function C(e,r,o){return{answer:"",citations:[],candidates:[],walked:[],status:e,error:o}}function J(e,r,o=[]){let t=new Map,d=[];for(let a of e.listArticles(r||""))t.set(a.meta.title.toLowerCase(),a.path),d.push({path:a.path,related:a.meta.related??[],lastUpdated:a.meta.lastUpdated??""});let l=[],m=new Map;for(let a of o)if(a.store.baseDir!==e.baseDir){m.set(a.id,a);for(let i of a.store.listArticles(r||"")){if(i.path.includes("/_versions/")||a.skip?.(i.path))continue;let c=`@${a.id}/${i.path}`;l.push(st(i,c)),d.push({path:c,related:i.meta.related??[],lastUpdated:i.meta.lastUpdated??""});let n=i.meta.title.toLowerCase();t.has(n)||t.set(n,c)}}let p=new Map;if(m.size>0)for(let a of[...d].sort((i,c)=>c.lastUpdated.localeCompare(i.lastUpdated)))for(let i of a.related){let c=i.toLowerCase(),n=p.get(c)??[];n.includes(a.path)||n.push(a.path),p.set(c,n)}let h;return{backlinks:p,readable:new Set(d.map(a=>a.path)),get pool(){return h??=[...z(e),...l]},sharedPool:l,titleIndex:t,read(a){let i=a.match(/^@([^/]+)\/(.+)$/),c=i?m.get(i[1]):void 0;if(i&&!c)return null;let n=c?.store??e,s=i?i[2]:a,u=r?n.readArticleAs(s,r):n.readArticle(s);return u?{...u,path:a}:null}}}function st(e,r){return{path:r,title:e.meta.title,type:e.meta.type,related:e.meta.related,tags:e.meta.tags||[],owner:e.meta.owner,access:e.meta.access,sharedWith:e.meta.sharedWith,aliases:[e.meta.title.toLowerCase(),...(e.meta.aliases??[]).map(o=>o.toLowerCase())],backlinks:0,sources:e.meta.sources,lastUpdated:e.meta.lastUpdated,graphPath:e.meta.graphPath}}var ot=150;function lt(e,r,o,t){return r.length===0?"":`
-
-## Shared wiki (other agents' articles)
-
-${L(e,r,o,t).slice(0,ot).map(l=>`- ${r[l].title}${r[l].type?` [${r[l].type}]`:""} (${r[l].path})`).join(`
-`)}
-`}var ct=3;function X(e,r,o,t){let d=r.titleIndex,l=n=>n.startsWith("@"),m=[...e.filter(n=>!l(n.path)),...e.filter(n=>l(n.path))],p=m.length>0&&!l(m[0].path)?Math.floor(t/2):t,h=new Map,a=0,i=m.map(n=>({path:n.path,hop:0})),c=[];for(;h.size<t;){if(!i.length){if(!c.length||p>=t)break;p=t,i=c.splice(0)}let n=i.shift();if(h.has(n.path)||n.hop>o)continue;if(l(n.path)&&a>=p){c.push(n);continue}let s=r.read(n.path);if(s&&(h.set(n.path,{...s,hop:n.hop}),l(n.path)&&a++,!(n.hop>=o))){if(n.hop===0){let u=[s.meta.title,...s.meta.aliases??[]].map(y=>y.toLowerCase()),w=[...new Set(u.flatMap(y=>r.backlinks.get(y)??[]))].filter(y=>y!==n.path&&!h.has(y)).slice(0,ct);for(let y of w)i.push({path:y,hop:1})}for(let u of s.meta.related||[]){let w=d.get(u.toLowerCase());w&&!h.has(w)&&i.push({path:w,hop:n.hop+1})}}}return Array.from(h.values())}async function Z(e,r,o,t,d,l=P,m="catalog-selector"){try{if(r.length<2)return null;let h=L(e,r,d,l).slice(0,j).map(n=>({id:`k${n}`,title:r[n].title||r[n].path,tags:r[n].tags,excerpt:[r[n].type?`type: ${r[n].type}`:"",(r[n].related??[]).length?`related: ${(r[n].related??[]).join(", ")}`:"",(r[n].graphPath??[]).length?`graph: ${(r[n].graphPath??[]).join(" \u203A ")}`:""].filter(Boolean).join(" \xB7 ")})),a=await I(Q,U({query:e,candidates:h,excerptChars:300}),T(h),{features:{agent:o??"unknown",stage:m}});if(!a||a.mode!=="active")return null;let c=N(a.answers,h).ranked.slice(0,t).map(n=>r[Number(n.slice(1))]).filter(Boolean).map(n=>({title:n.title,path:n.path}));return c.length>0?c:null}catch{return null}}var P=.6;function L(e,r,o,t=P){let d=W(e,v(r.map(q))),l=d.reduce((s,u)=>Math.max(s,u.score),0),m=new Map(d.map(s=>[s.docIndex,l>0?s.score/l:0])),p=!!o?.length,h=s=>p&&s.graphPath?.length?B(o,s.graphPath):0,a=(s,u)=>u.score-s.score||s.i-u.i,i=r.map((s,u)=>({i:u,score:(m.get(u)??0)*(1+t*h(s))})).filter(s=>m.has(s.i)).sort(a),c=r.map((s,u)=>({i:u,score:h(s)})).filter(s=>!m.has(s.i)&&s.score>0).sort(a),n=[...i,...c].map(s=>s.i);for(let s=0;s<r.length;s++)n.includes(s)||n.push(s);return n}function q(e){return[e.title,(e.tags??[]).join(" "),(e.related??[]).join(" ")].join(" ")}function ht(e,r,o,t){let d=t?.length?`
-## Intent
-
-The request was classified under the intent-graph path "${t.join(" \u203A ")}". Prefer articles filed under the same branch when their titles are equally plausible.
-`:"";return`You are picking candidate articles from a wiki catalog to answer a question. You do NOT answer the question. You pick which articles the answer is likely to come from.
-
-## Question
-
-${e}
-${d}
-## Catalog (_index.md \u2014 articles grouped by type, with wikilink previews)
-
-${r}
-
-## Your task
-
-Pick up to ${o} articles from the catalog that are most likely to answer the question. Prefer:
-- Articles whose title directly names a subject in the question.
-- Articles of the right type (e.g. a "who owns X" question \u2192 person or project; a "what happened on DATE" \u2192 event).
-- Articles whose wikilinks suggest they sit at the center of a relevant subgraph.
-
-Return ONLY valid JSON, no markdown fencing, no prose:
-
-[
-  {"title": "Exact Article Title", "path": "path/from/catalog.md"},
-  ...
-]
-
-If none of the articles match, return [].`}function dt(e,r){let o=r.map(t=>{let d=[t.meta.owner?`owner: ${t.meta.owner}`:"",t.meta.lastUpdated?`updated: ${t.meta.lastUpdated}`:""].filter(Boolean).join(", "),l=`### ${t.meta.title} \u2014 ${t.meta.type||"untyped"} (${t.path}) [hop ${t.hop}]${d?` {${d}}`:""}`,m=t.meta.related?.length?`Related: ${t.meta.related.join(", ")}`:"";return[l,m,"",t.content].filter(Boolean).join(`
-`)}).join(`
-
----
-
-`);return`You are answering a question using a small subgraph of wiki articles. The articles were walked from the catalog; trust them over your prior knowledge.
-
-## Question
-
-${e}
-
-## Articles (${r.length} walked from the catalog)
-
-${o}
-
-## Your task
-
-Answer the question in 2\u20136 sentences. Cite articles by their title in square brackets like [Article Title]. When two articles disagree, prefer the one updated more recently, and say which agent's page and date the answer comes from. If the articles do not answer the question, say so plainly (do not invent). Prefer concrete facts over hedging.
-
-Output ONLY the answer \u2014 no preamble, no "here is my answer:", no markdown fencing.`}function mt(e){let r=e.match(/\[[\s\S]*?\]/);if(!r)return[];try{let o=JSON.parse(r[0]);return Array.isArray(o)?o.filter(t=>t&&typeof t.title=="string"&&typeof t.path=="string").map(t=>({title:t.title,path:t.path})):[]}catch{return[]}}async function V(e,r,o){let{writeFileSync:t,mkdirSync:d,rmSync:l}=await import("fs"),{tmpdir:m}=await import("os"),p=E(m(),`agentx-wiki-query-${process.pid}`);d(p,{recursive:!0});let h=E(p,`prompt-${Date.now()}.txt`);t(h,e);try{let a=`cat '${h}' | claude -p - --output-format json --max-turns 1 --model ${r} --disallowedTools "Bash Read Write Edit Glob Grep Agent WebSearch WebFetch NotebookEdit"`,i=it(a,{env:O(),encoding:"utf-8",timeout:o,maxBuffer:4*1024*1024});try{let c=JSON.parse(i);return String(c.result||c.content||"")}catch{return i}}finally{try{l(h,{force:!0})}catch{}}}async function Mt(e){try{let{loadDaemonConfig:r}=await import("./config-ZIXIH23X.js");return r(e).wiki.query.shared}catch{return!0}}export{xt as a,Ct as b,z as c,ot as d,P as e,L as f,Mt as g};
-//# sourceMappingURL=chunk-EQ33PFXP.js.map

package/dist/chunk-EQ33PFXP.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/wiki/query.ts"],"sourcesContent":["import { readFileSync, existsSync } from \"fs\"\nimport { buildIndex, scoreAll } from \"@/memory/bm25\"\nimport { askSeat } from \"@/decisions/seat\"\nimport { ancestryScore } from \"@/graph\"\nimport {\n  DEFAULT_SHORTLIST,\n  WIKI_RERANK_SEAT,\n  rerankQuestions,\n  rerankState,\n  toRanking,\n  type RerankCandidate,\n} from \"@/decisions/seats/wiki-rerank\"\nimport { claudeCliEnv } from \"@/utils/workspace-env\"\nimport { resolve } from \"path\"\nimport { execSync } from \"child_process\"\nimport type { WikiArticle, WikiIndex } from \"./types\"\nimport type { WikiStore } from \"./store\"\nimport { claudeModelCall, type ModelCall } from \"./model-call\"\nimport type { FetchLike, LiveLine } from \"./live-read\"\nimport { DEFAULT_SUMMARIES_QUERY, collectSummaries, summariesQuery, type SummariesQuerySettings } from \"./query-summaries\"\nimport type { QueryMethod } from \"./query-settings\"\n\n/**\n * Agentic wiki query — the \"Farzapedia-faithful\" retrieval path.\n *\n * Two LLM calls + a deterministic graph walk:\n *   1. Selector (cheap): read `_index.md` + question → pick up to `maxCandidates`\n *      candidate articles by title + type.\n *   2. Walk (pure code): starting from candidates, follow `related` wikilinks\n *      up to `maxHops`, capped at `maxArticles` total.\n *   3. Synthesis (main): answer the question from the walked subgraph.\n *\n * Returns an answer with citations and a trace of which articles were walked,\n * so callers can audit the retrieval path.\n */\n\nexport interface AgenticQueryOptions {\n  /** Candidate-selection model (cheap). Defaults to \"haiku\". */\n  selectorModel?: string\n  /** Synthesis model (main). Defaults to \"sonnet\". */\n  synthModel?: string\n  /** Number of candidates the selector is asked to return. Default 3. */\n  maxCandidates?: number\n  /** Wikilink hops from candidates. Default 2. */\n  maxHops?: number\n  /** Hard cap on total articles walked. Default 8. */\n  maxArticles?: number\n  /** Timeout per LLM call, ms. Default 60_000. */\n  timeoutMs?: number\n  /** Logger — defaults to console.error. */\n  log?: (...args: unknown[]) => void\n  /** Intent-graph path the question's request was classified under.\n   *  Articles on the same branch rank higher in candidate selection. */\n  messagePath?: string[]\n  /** Weight of the branch match against the text match, 0–1. Default 0.6\n   *  (`graph.retrievalWeights.graph`). */\n  graphWeight?: number\n  /** Other wikis to search besides `store`: the shared wiki (#824). Only\n   *  articles the requester may read are offered. Their paths come back\n   *  as `@<id>/<path>`. */\n  shared?: SharedWikiStore[]\n  /** How pages are picked (#855). `summaries`: from the one-line page\n   *  summaries, then a live read (query-summaries.ts). `auto`: that, once\n   *  a summary exists for the pages in scope. Default \"catalog\". */\n  method?: QueryMethod\n  /** Settings of the summaries method. An explicit `selectorModel` or\n   *  `synthModel` overrides its models. */\n  summaries?: SummariesQuerySettings\n  /** Model call and HTTP GET of the summaries method; tests pass their own. */\n  call?: ModelCall\n  fetch?: FetchLike\n}\n\n/** A wiki searched alongside the requester's own. */\nexport interface SharedWikiStore {\n  /** Shown in citations as `@<id>/<path>`: an agent id, or \"shared\". */\n  id: string\n  store: WikiStore\n  /** Paths to leave out, e.g. the agents/ tree under the root store. */\n  skip?: (path: string) => boolean\n}\n\nexport interface AgenticQueryResult {\n  answer: string\n  citations: Array<{ title: string; path: string; type?: string }>\n  /** Titles/paths the selector picked. */\n  candidates: Array<{ title: string; path: string }>\n  /** Full article subgraph the walk produced. */\n  walked: Array<{ title: string; path: string; type?: string; hop: number }>\n  /** \"no-catalog\" | \"no-candidates\" | \"ok\" */\n  status: \"ok\" | \"no-catalog\" | \"no-candidates\" | \"error\"\n  /** How the pages were picked. */\n  method?: \"summaries\" | \"catalog\"\n  /** Lines read at the source for this answer (summaries method). */\n  live?: LiveLine[]\n  /** Live reads the model named and the config allowed. */\n  liveAsked?: number\n  /** For operator debugging only. */\n  trace?: {\n    selectorMs: number\n    synthesisMs: number\n    selectorOutput?: string\n    planMs?: number\n    liveMs?: number\n  }\n  error?: string\n}\n\n/**\n * Run an agentic query against a specific agent's WikiStore.\n *\n * `requesterId` is used for permission checks — only articles the requester\n * can read will be included in the synthesis input.\n */\nexport async function agenticQuery(\n  question: string,\n  store: WikiStore,\n  requesterId: string | undefined,\n  opts: AgenticQueryOptions = {},\n): Promise<AgenticQueryResult> {\n  const selectorModel = opts.selectorModel ?? \"haiku\"\n  const synthModel = opts.synthModel ?? \"sonnet\"\n  const maxCandidates = opts.maxCandidates ?? 3\n  const maxHops = opts.maxHops ?? 2\n  const maxArticles = opts.maxArticles ?? 8\n  const timeoutMs = opts.timeoutMs ?? 60_000\n  const log = opts.log ?? console.error.bind(console, \"[wiki-query]\")\n  const messagePath = opts.messagePath?.length ? opts.messagePath : undefined\n  const graphWeight = opts.graphWeight ?? DEFAULT_GRAPH_WEIGHT\n\n  // --- Step 1: Load the catalog ---\n  const catalogPath = resolve(store.baseDir, \"_index.md\")\n  const view = scopeView(store, requesterId, opts.shared)\n\n  const method = opts.method ?? \"catalog\"\n  if (method !== \"catalog\") {\n    const summaries = collectSummaries(store, opts.shared)\n    if (method === \"summaries\" || summaries.size > 0) {\n      const base = opts.summaries ?? DEFAULT_SUMMARIES_QUERY\n      const out = await summariesQuery(question, view, summaries, {\n        ...base,\n        navigatorModel: opts.selectorModel ?? base.navigatorModel,\n        answerModel: opts.synthModel ?? base.answerModel,\n      }, { call: opts.call ?? claudeModelCall, fetch: opts.fetch, timeoutMs, log })\n      const pages = out.picked.map((a) => ({ title: a.meta.title, path: a.path, type: a.meta.type }))\n      return {\n        answer: out.answer,\n        citations: out.status === \"ok\" ? pages : [],\n        candidates: pages.map(({ title, path }) => ({ title, path })),\n        walked: pages.map((p) => ({ ...p, hop: 0 })),\n        status: out.status,\n        method: \"summaries\",\n        live: out.live,\n        liveAsked: out.liveAsked,\n        trace: out.trace,\n        ...(out.error ? { error: out.error } : {}),\n      }\n    }\n  }\n\n  if (!existsSync(catalogPath) && view.sharedPool.length === 0) {\n    return emptyResult(\"no-catalog\", question, \"No _index.md found — run `agentx wiki status` to rebuild.\")\n  }\n  const ownCatalog = existsSync(catalogPath) ? readFileSync(catalogPath, \"utf-8\") : \"\"\n  const catalog = ownCatalog + renderSharedCatalog(question, view.sharedPool, messagePath, graphWeight)\n\n  // --- Step 2: Selector — pick candidates ---\n  const selectorStart = Date.now()\n  let candidates: Array<{ title: string; path: string }> = []\n  let selectorOutput = \"\"\n  try {\n    const viaSeat = await selectCandidatesViaSeat(question, view.pool, requesterId, maxCandidates, messagePath, graphWeight)\n    if (viaSeat) {\n      candidates = viaSeat\n      selectorOutput = `[wiki-rerank seat] ${viaSeat.map((c) => c.title).join(\" | \")}`\n    } else {\n      selectorOutput = await runClaude(\n        buildSelectorPrompt(question, catalog, maxCandidates, messagePath),\n        selectorModel,\n        timeoutMs,\n      )\n      candidates = parseCandidates(selectorOutput)\n    }\n  } catch (e: any) {\n    log(\"selector failed:\", e?.message)\n    return { ...emptyResult(\"error\", question, `Selector: ${e?.message || \"unknown\"}`), trace: { selectorMs: Date.now() - selectorStart, synthesisMs: 0, selectorOutput } }\n  }\n  const selectorMs = Date.now() - selectorStart\n\n  if (candidates.length === 0) {\n    return { ...emptyResult(\"no-candidates\", question, \"Selector returned no candidates.\"), trace: { selectorMs, synthesisMs: 0, selectorOutput } }\n  }\n\n  // --- Step 3: Walk the subgraph via `related` wikilinks ---\n  const walked = walkSubgraph(candidates, view, maxHops, maxArticles)\n\n  if (walked.length === 0) {\n    return { ...emptyResult(\"no-candidates\", question, \"Candidates did not resolve to readable articles.\"), candidates, trace: { selectorMs, synthesisMs: 0, selectorOutput } }\n  }\n\n  // --- Step 4: Synthesize the answer ---\n  const synthStart = Date.now()\n  let answer = \"\"\n  try {\n    answer = await runClaude(\n      buildSynthesisPrompt(question, walked),\n      synthModel,\n      timeoutMs * 2,\n    )\n  } catch (e: any) {\n    log(\"synthesis failed:\", e?.message)\n    return { ...emptyResult(\"error\", question, `Synthesis: ${e?.message || \"unknown\"}`), candidates, walked: walked.map(w => ({ title: w.meta.title, path: w.path, type: w.meta.type, hop: (w as any).hop ?? 0 })), trace: { selectorMs, synthesisMs: Date.now() - synthStart, selectorOutput } }\n  }\n  const synthesisMs = Date.now() - synthStart\n\n  return {\n    answer: answer.trim(),\n    citations: walked.map(a => ({ title: a.meta.title, path: a.path, type: a.meta.type })),\n    candidates,\n    walked: walked.map(w => ({ title: w.meta.title, path: w.path, type: w.meta.type, hop: (w as any).hop ?? 0 })),\n    status: \"ok\",\n    trace: { selectorMs, synthesisMs, selectorOutput },\n  }\n}\n\nexport interface RetrieveOptions {\n  /** Articles picked before the walk. Default 3. */\n  maxCandidates?: number\n  /** Wikilink hops from the picked articles. Default 1. */\n  maxHops?: number\n  /** Hard cap on articles returned. Default 6. */\n  maxArticles?: number\n  messagePath?: string[]\n  graphWeight?: number\n  /** The catalog to pick from. Pass it when retrieving many times in a row,\n   *  so the index is not rebuilt for every call. */\n  pool?: CatalogEntry[]\n  /** Seat telemetry label. */\n  stage?: string\n}\n\n/**\n * The retrieval half of agenticQuery, without the synthesis call: BM25\n * shortlist, rerank seat, then the `related` wikilink walk. Returns the\n * walked articles, hop 0 first.\n *\n * When the seat is off or fails, the BM25 order decides on its own, and\n * only articles the text matched are picked: an article chosen for\n * nothing but its catalog position is noise here, not a candidate. There\n * is no CLI fallback, so this never spends an LLM call.\n */\nexport async function retrieveArticles(\n  question: string,\n  store: WikiStore,\n  requesterId: string | undefined,\n  opts: RetrieveOptions = {},\n): Promise<Array<WikiArticle & { hop: number }>> {\n  const maxCandidates = opts.maxCandidates ?? 3\n  const graphWeight = opts.graphWeight ?? DEFAULT_GRAPH_WEIGHT\n  const messagePath = opts.messagePath?.length ? opts.messagePath : undefined\n  const pool = opts.pool ?? catalogPool(store)\n  if (pool.length === 0 || !question.trim()) return []\n\n  let candidates = await selectCandidatesViaSeat(\n    question, pool, requesterId, maxCandidates, messagePath, graphWeight, opts.stage ?? \"retrieve\",\n  )\n  if (!candidates) {\n    const matched = new Set(scoreAll(question, buildIndex(pool.map(catalogDoc))).map((r) => r.docIndex))\n    candidates = rankCatalogPool(question, pool, messagePath, graphWeight)\n      .filter((i) => matched.has(i))\n      .slice(0, maxCandidates)\n      .map((i) => ({ title: pool[i].title, path: pool[i].path }))\n  }\n  if (candidates.length === 0) return []\n  return walkSubgraph(candidates, scopeView(store, requesterId), opts.maxHops ?? 1, opts.maxArticles ?? 6)\n}\n\nexport type CatalogEntry = WikiIndex[\"articles\"][number]\n\n/** The catalog retrieval picks from: every indexed article but old versions. */\nexport function catalogPool(store: WikiStore): CatalogEntry[] {\n  try {\n    return (store.rebuildIndex().articles ?? []).filter((a) => a.path && !a.path.includes(\"/_versions/\"))\n  } catch {\n    return []\n  }\n}\n\n// --- Helpers ---\n\nfunction emptyResult(\n  status: AgenticQueryResult[\"status\"],\n  _question: string,\n  error?: string,\n): AgenticQueryResult {\n  return {\n    answer: \"\",\n    citations: [],\n    candidates: [],\n    walked: [],\n    status,\n    error,\n  }\n}\n\n/**\n * The articles a query may open: the requester's own wiki first, then\n * each shared one. Shared paths carry an `@<id>/` prefix so the walk\n * knows which store to read; a title the own wiki has resolves there.\n */\ninterface ScopeView {\n  /** Own catalog, then the shared articles. */\n  pool: CatalogEntry[]\n  sharedPool: CatalogEntry[]\n  titleIndex: Map<string, string>\n  /** Title (lowercased) → pages whose `related` names it, newest first.\n   *  Built only when shared wikis are searched. */\n  backlinks: Map<string, string[]>\n  /** Paths the requester may read, own and shared. */\n  readable: Set<string>\n  read(path: string): WikiArticle | null\n}\n\nfunction scopeView(store: WikiStore, requesterId: string | undefined, shared: SharedWikiStore[] = []): ScopeView {\n  const titleIndex = new Map<string, string>()\n  const linking: Array<{ path: string; related: string[]; lastUpdated: string }> = []\n  for (const article of store.listArticles(requesterId || \"\")) {\n    titleIndex.set(article.meta.title.toLowerCase(), article.path)\n    linking.push({ path: article.path, related: article.meta.related ?? [], lastUpdated: article.meta.lastUpdated ?? \"\" })\n  }\n  const sharedPool: CatalogEntry[] = []\n  const byId = new Map<string, SharedWikiStore>()\n  for (const s of shared) {\n    if (s.store.baseDir === store.baseDir) continue\n    byId.set(s.id, s)\n    // listArticles is cached and already drops what the requester can't\n    // read; rebuilding every agent's index per query would not be.\n    for (const a of s.store.listArticles(requesterId || \"\")) {\n      if (a.path.includes(\"/_versions/\") || s.skip?.(a.path)) continue\n      const path = `@${s.id}/${a.path}`\n      sharedPool.push(catalogEntry(a, path))\n      linking.push({ path, related: a.meta.related ?? [], lastUpdated: a.meta.lastUpdated ?? \"\" })\n      const key = a.meta.title.toLowerCase()\n      if (!titleIndex.has(key)) titleIndex.set(key, path)\n    }\n  }\n  // In a fleet's shared pool the page that answers a question often links\n  // TO the page the selector picked (a decision about a person), and the\n  // forward walk never reaches it (#824 review: ranked 103rd of ~5,700).\n  const backlinks = new Map<string, string[]>()\n  if (byId.size > 0) {\n    for (const l of [...linking].sort((a, b) => b.lastUpdated.localeCompare(a.lastUpdated))) {\n      for (const t of l.related) {\n        const key = t.toLowerCase()\n        const list = backlinks.get(key) ?? []\n        if (!list.includes(l.path)) list.push(l.path)\n        backlinks.set(key, list)\n      }\n    }\n  }\n  let pool: CatalogEntry[] | undefined\n  return {\n    backlinks,\n    readable: new Set(linking.map((l) => l.path)),\n    // Lazy: retrieveArticles brings its own pool, and building this one\n    // rebuilds the index.\n    get pool() { return (pool ??= [...catalogPool(store), ...sharedPool]) },\n    sharedPool,\n    titleIndex,\n    read(path) {\n      const m = path.match(/^@([^/]+)\\/(.+)$/)\n      const target = m ? byId.get(m[1]) : undefined\n      if (m && !target) return null\n      const s = target?.store ?? store\n      const rel = m ? m[2] : path\n      const article = requesterId ? s.readArticleAs(rel, requesterId) : s.readArticle(rel)\n      return article ? { ...article, path } : null\n    },\n  }\n}\n\nfunction catalogEntry(a: WikiArticle, path: string): CatalogEntry {\n  return {\n    path,\n    title: a.meta.title,\n    type: a.meta.type,\n    related: a.meta.related,\n    tags: a.meta.tags || [],\n    owner: a.meta.owner,\n    access: a.meta.access,\n    sharedWith: a.meta.sharedWith,\n    aliases: [a.meta.title.toLowerCase(), ...(a.meta.aliases ?? []).map((x) => x.toLowerCase())],\n    backlinks: 0,\n    sources: a.meta.sources,\n    lastUpdated: a.meta.lastUpdated,\n    graphPath: a.meta.graphPath,\n  }\n}\n\n/** Shared articles most related to the question, for the CLI selector.\n *  Capped: a fleet's shared catalog would not fit one prompt. */\nexport const SHARED_CATALOG_LINES = 150\n\nfunction renderSharedCatalog(question: string, pool: CatalogEntry[], messagePath: string[] | undefined, graphWeight: number): string {\n  if (pool.length === 0) return \"\"\n  const lines = rankCatalogPool(question, pool, messagePath, graphWeight)\n    .slice(0, SHARED_CATALOG_LINES)\n    .map((i) => `- ${pool[i].title}${pool[i].type ? ` [${pool[i].type}]` : \"\"} (${pool[i].path})`)\n  return `\\n\\n## Shared wiki (other agents' articles)\\n\\n${lines.join(\"\\n\")}\\n`\n}\n\n/** Pages that link to a picked page, opened per picked page. */\nconst BACKLINKS_PER_PICK = 3\n\nfunction walkSubgraph(\n  candidates: Array<{ title: string; path: string }>,\n  view: ScopeView,\n  maxHops: number,\n  maxArticles: number,\n): Array<WikiArticle & { hop: number }> {\n  const titleIndex = view.titleIndex\n  const isShared = (path: string) => path.startsWith(\"@\")\n\n  // The agent's own pages come first, and shared pages may take at most\n  // half the walk when it has any: in the #824 trial shared pages took\n  // the slots of the agent's own correct pages and its score dropped.\n  const ordered = [...candidates.filter((c) => !isShared(c.path)), ...candidates.filter((c) => isShared(c.path))]\n  let sharedCap = ordered.length > 0 && !isShared(ordered[0].path) ? Math.floor(maxArticles / 2) : maxArticles\n\n  const opened = new Map<string, WikiArticle & { hop: number }>()\n  let sharedOpened = 0\n  let frontier: Array<{ path: string; hop: number }> = ordered.map((c) => ({ path: c.path, hop: 0 }))\n  // Shared pages turned away by the cap, in walk order. When the agent's\n  // own pages run out first they get the slots left: an own pick with no\n  // own neighbours must not leave the walk short of shared pages that answer.\n  const deferred: Array<{ path: string; hop: number }> = []\n\n  while (opened.size < maxArticles) {\n    if (!frontier.length) {\n      if (!deferred.length || sharedCap >= maxArticles) break\n      sharedCap = maxArticles\n      frontier = deferred.splice(0)\n    }\n    const next = frontier.shift()!\n    if (opened.has(next.path)) continue\n    if (next.hop > maxHops) continue\n    if (isShared(next.path) && sharedOpened >= sharedCap) { deferred.push(next); continue }\n\n    const article = view.read(next.path)\n    if (!article) continue\n\n    opened.set(next.path, { ...article, hop: next.hop })\n    if (isShared(next.path)) sharedOpened++\n    if (next.hop >= maxHops) continue\n\n    if (next.hop === 0) {\n      // Pages link to a subject by any of its names; skip what is already\n      // open before taking the newest few, or an opened page uses a slot.\n      const names = [article.meta.title, ...(article.meta.aliases ?? [])].map((n) => n.toLowerCase())\n      const linking = [...new Set(names.flatMap((n) => view.backlinks.get(n) ?? []))]\n        .filter((path) => path !== next.path && !opened.has(path))\n        .slice(0, BACKLINKS_PER_PICK)\n      for (const path of linking) frontier.push({ path, hop: 1 })\n    }\n    for (const target of article.meta.related || []) {\n      const path = titleIndex.get(target.toLowerCase())\n      if (path && !opened.has(path)) {\n        frontier.push({ path, hop: next.hop + 1 })\n      }\n    }\n  }\n\n  return Array.from(opened.values())\n}\n\n// --- Prompts ---\n\n/**\n * Pick candidates with the wiki-rerank seat instead of a Claude CLI call.\n *\n * The selector is 56% of a wiki query — 14.1s of a 25s total, measured —\n * and its whole job is \"pick 3 articles from this catalog\", which is a\n * Choice with per-option probabilities. Jev answers that in about a\n * second. Synthesis stays on Sonnet; it writes prose, which Jev cannot.\n *\n * BM25 shortlists first because the shared catalog carries 971 entries,\n * past the 255-option cap. Same two-stage shape as findRelevantReranked,\n * and it reuses that seat rather than introducing a second one.\n *\n * Returns null whenever the seat is off, errors, or has nothing to rank,\n * and the caller falls back to the CLI selector — so this is strictly an\n * accelerator, never a new way to fail.\n */\nasync function selectCandidatesViaSeat(\n  question: string,\n  pool: CatalogEntry[],\n  requesterId: string | undefined,\n  maxCandidates: number,\n  messagePath?: string[],\n  graphWeight: number = DEFAULT_GRAPH_WEIGHT,\n  stage = \"catalog-selector\",\n): Promise<Array<{ title: string; path: string }> | null> {\n  try {\n    if (pool.length < 2) return null\n\n    const shortlist = rankCatalogPool(question, pool, messagePath, graphWeight).slice(0, DEFAULT_SHORTLIST)\n\n    const candidates: RerankCandidate[] = shortlist.map((i) => ({\n      id: `k${i}`,\n      title: pool[i].title || pool[i].path,\n      tags: pool[i].tags,\n      // The catalog has no body — a title, its type, its wikilinks and its\n      // branch of the intent graph are what the selector chooses on.\n      excerpt: [\n        pool[i].type ? `type: ${pool[i].type}` : \"\",\n        (pool[i].related ?? []).length ? `related: ${(pool[i].related ?? []).join(\", \")}` : \"\",\n        (pool[i].graphPath ?? []).length ? `graph: ${(pool[i].graphPath ?? []).join(\" › \")}` : \"\",\n      ].filter(Boolean).join(\" · \"),\n    }))\n\n    const result = await askSeat(\n      WIKI_RERANK_SEAT,\n      rerankState({ query: question, candidates, excerptChars: 300 }),\n      rerankQuestions(candidates),\n      { features: { agent: requesterId ?? \"unknown\", stage } },\n    )\n    if (!result || result.mode !== \"active\") return null\n\n    const ranking = toRanking(result.answers as never, candidates)\n    const picked = ranking.ranked\n      .slice(0, maxCandidates)\n      .map((id) => pool[Number(id.slice(1))])\n      .filter(Boolean)\n      .map((a) => ({ title: a.title, path: a.path }))\n    return picked.length > 0 ? picked : null\n  } catch {\n    return null\n  }\n}\n\n/** Weight of the intent-graph branch match against the text match when\n *  shortlisting catalog candidates. Mirrors `graph.retrievalWeights.graph`. */\nexport const DEFAULT_GRAPH_WEIGHT = 0.6\n\n/**\n * Order the catalog pool for a question. Three bands, never mixed:\n *\n *   1. articles the text match scored, ordered by `text * (1 + w * branch)`\n *      when the request was classified: the branch reorders text matches\n *      but cannot lift an unrelated article above one;\n *   2. articles on the request's branch that the text never matched, by\n *      how much of the path they share;\n *   3. the rest, in catalog order.\n *\n * Band 1 comes first in full because the shortlist the reranker sees is\n * finite (DEFAULT_SHORTLIST): a busy category holds more same-branch\n * articles than that, and a blended score let them push the article that\n * actually answers the question out of the list.\n *\n * Exported for tests; the seat and the CLI selector both consume the order.\n */\nexport function rankCatalogPool(\n  question: string,\n  pool: Array<{ title: string; tags?: string[]; related?: string[]; graphPath?: string[] }>,\n  messagePath?: string[],\n  graphWeight: number = DEFAULT_GRAPH_WEIGHT,\n): number[] {\n  const bm25 = scoreAll(question, buildIndex(pool.map(catalogDoc)))\n  const maxBm25 = bm25.reduce((m, r) => Math.max(m, r.score), 0)\n  const text = new Map(bm25.map((r) => [r.docIndex, maxBm25 > 0 ? r.score / maxBm25 : 0]))\n  const useGraph = !!messagePath?.length\n  const branch = (a: { graphPath?: string[] }) =>\n    useGraph && a.graphPath?.length ? ancestryScore(messagePath!, a.graphPath) : 0\n\n  const byScore = (x: { i: number; score: number }, y: { i: number; score: number }) => y.score - x.score || x.i - y.i\n  const matched = pool\n    .map((a, i) => ({ i, score: (text.get(i) ?? 0) * (1 + graphWeight * branch(a)) }))\n    .filter((c) => text.has(c.i))\n    .sort(byScore)\n  const branchOnly = pool\n    .map((a, i) => ({ i, score: branch(a) }))\n    .filter((c) => !text.has(c.i) && c.score > 0)\n    .sort(byScore)\n  const ranked = [...matched, ...branchOnly].map((c) => c.i)\n  for (let i = 0; i < pool.length; i++) if (!ranked.includes(i)) ranked.push(i)\n  return ranked\n}\n\n/** What BM25 sees of a catalog entry: the catalog carries no body. */\nfunction catalogDoc(a: { title: string; tags?: string[]; related?: string[] }): string {\n  return [a.title, (a.tags ?? []).join(\" \"), (a.related ?? []).join(\" \")].join(\" \")\n}\n\nfunction buildSelectorPrompt(question: string, catalog: string, maxCandidates: number, messagePath?: string[]): string {\n  const branch = messagePath?.length\n    ? `\\n## Intent\\n\\nThe request was classified under the intent-graph path \"${messagePath.join(\" › \")}\". Prefer articles filed under the same branch when their titles are equally plausible.\\n`\n    : \"\"\n  return `You are picking candidate articles from a wiki catalog to answer a question. You do NOT answer the question. You pick which articles the answer is likely to come from.\n\n## Question\n\n${question}\n${branch}\n## Catalog (_index.md — articles grouped by type, with wikilink previews)\n\n${catalog}\n\n## Your task\n\nPick up to ${maxCandidates} articles from the catalog that are most likely to answer the question. Prefer:\n- Articles whose title directly names a subject in the question.\n- Articles of the right type (e.g. a \"who owns X\" question → person or project; a \"what happened on DATE\" → event).\n- Articles whose wikilinks suggest they sit at the center of a relevant subgraph.\n\nReturn ONLY valid JSON, no markdown fencing, no prose:\n\n[\n  {\"title\": \"Exact Article Title\", \"path\": \"path/from/catalog.md\"},\n  ...\n]\n\nIf none of the articles match, return [].`\n}\n\nfunction buildSynthesisPrompt(\n  question: string,\n  articles: Array<WikiArticle & { hop: number }>,\n): string {\n  const articlesBlock = articles\n    .map(a => {\n      // Owner and date let the answer say where a fact came from and pick\n      // the newer page when two disagree (#824).\n      const from = [a.meta.owner ? `owner: ${a.meta.owner}` : \"\", a.meta.lastUpdated ? `updated: ${a.meta.lastUpdated}` : \"\"].filter(Boolean).join(\", \")\n      const header = `### ${a.meta.title} — ${a.meta.type || \"untyped\"} (${a.path}) [hop ${a.hop}]${from ? ` {${from}}` : \"\"}`\n      const related = a.meta.related?.length ? `Related: ${a.meta.related.join(\", \")}` : \"\"\n      return [header, related, \"\", a.content].filter(Boolean).join(\"\\n\")\n    })\n    .join(\"\\n\\n---\\n\\n\")\n\n  return `You are answering a question using a small subgraph of wiki articles. The articles were walked from the catalog; trust them over your prior knowledge.\n\n## Question\n\n${question}\n\n## Articles (${articles.length} walked from the catalog)\n\n${articlesBlock}\n\n## Your task\n\nAnswer the question in 2–6 sentences. Cite articles by their title in square brackets like [Article Title]. When two articles disagree, prefer the one updated more recently, and say which agent's page and date the answer comes from. If the articles do not answer the question, say so plainly (do not invent). Prefer concrete facts over hedging.\n\nOutput ONLY the answer — no preamble, no \"here is my answer:\", no markdown fencing.`\n}\n\nfunction parseCandidates(raw: string): Array<{ title: string; path: string }> {\n  const match = raw.match(/\\[[\\s\\S]*?\\]/)\n  if (!match) return []\n  try {\n    const parsed = JSON.parse(match[0])\n    if (!Array.isArray(parsed)) return []\n    return parsed\n      .filter((x: any) => x && typeof x.title === \"string\" && typeof x.path === \"string\")\n      .map((x: any) => ({ title: x.title, path: x.path }))\n  } catch {\n    return []\n  }\n}\n\nasync function runClaude(prompt: string, model: string, timeoutMs: number): Promise<string> {\n  // Use stdin via a temp-file pipe to avoid shell-escaping a huge prompt.\n  // Prompts can exceed the `-E` arg buffer on macOS, so we always pipe.\n  const { writeFileSync, mkdirSync, rmSync } = await import(\"fs\")\n  const { tmpdir } = await import(\"os\")\n  const dir = resolve(tmpdir(), `agentx-wiki-query-${process.pid}`)\n  mkdirSync(dir, { recursive: true })\n  const promptPath = resolve(dir, `prompt-${Date.now()}.txt`)\n  writeFileSync(promptPath, prompt)\n  try {\n    const cmd = `cat '${promptPath}' | claude -p - --output-format json --max-turns 1 --model ${model} --disallowedTools \"Bash Read Write Edit Glob Grep Agent WebSearch WebFetch NotebookEdit\"`\n    const raw = execSync(cmd, { env: claudeCliEnv(), encoding: \"utf-8\", timeout: timeoutMs, maxBuffer: 4 * 1024 * 1024 })\n    try {\n      const envelope = JSON.parse(raw)\n      return String(envelope.result || envelope.content || \"\")\n    } catch {\n      return raw\n    }\n  } finally {\n    try { rmSync(promptPath, { force: true }) } catch {}\n  }\n}\n\n/** `wiki.query.shared` from agentx.json: whether a query also searches the\n *  shared wiki. On when there is no config to read. The CLI and the\n *  `agentx_wiki_query` tool both ask here, so the switch reaches both. */\nexport async function sharedQueryEnabled(configPath?: string): Promise<boolean> {\n  try {\n    const { loadDaemonConfig } = await import(\"@/daemon/config\")\n    return loadDaemonConfig(configPath).wiki.query.shared\n  } catch {\n    return true\n  }\n}\n"],"mappings":"gTAAA,OAAS,gBAAAA,GAAc,cAAAC,MAAkB,KAEzCC,KAWA,OAAS,WAAAC,MAAe,OACxB,OAAS,YAAAC,OAAgB,gBAoGzB,eAAsBC,GACpBC,EACAC,EACAC,EACAC,EAA4B,CAAC,EACA,CAC7B,IAAMC,EAAgBD,EAAK,eAAiB,QACtCE,EAAaF,EAAK,YAAc,SAChCG,EAAgBH,EAAK,eAAiB,EACtCI,EAAUJ,EAAK,SAAW,EAC1BK,EAAcL,EAAK,aAAe,EAClCM,EAAYN,EAAK,WAAa,IAC9BO,EAAMP,EAAK,KAAO,QAAQ,MAAM,KAAK,QAAS,cAAc,EAC5DQ,EAAcR,EAAK,aAAa,OAASA,EAAK,YAAc,OAC5DS,EAAcT,EAAK,aAAeU,EAGlCC,EAAcC,EAAQd,EAAM,QAAS,WAAW,EAChDe,EAAOC,EAAUhB,EAAOC,EAAaC,EAAK,MAAM,EAEhDe,EAASf,EAAK,QAAU,UAC9B,GAAIe,IAAW,UAAW,CACxB,IAAMC,EAAYC,EAAiBnB,EAAOE,EAAK,MAAM,EACrD,GAAIe,IAAW,aAAeC,EAAU,KAAO,EAAG,CAChD,IAAME,EAAOlB,EAAK,WAAamB,EACzBC,EAAM,MAAMC,EAAexB,EAAUgB,EAAMG,EAAW,CAC1D,GAAGE,EACH,eAAgBlB,EAAK,eAAiBkB,EAAK,eAC3C,YAAalB,EAAK,YAAckB,EAAK,WACvC,EAAG,CAAE,KAAMlB,EAAK,MAAQsB,EAAiB,MAAOtB,EAAK,MAAO,UAAAM,EAAW,IAAAC,CAAI,CAAC,EACtEgB,EAAQH,EAAI,OAAO,IAAKI,IAAO,CAAE,MAAOA,EAAE,KAAK,MAAO,KAAMA,EAAE,KAAM,KAAMA,EAAE,KAAK,IAAK,EAAE,EAC9F,MAAO,CACL,OAAQJ,EAAI,OACZ,UAAWA,EAAI,SAAW,KAAOG,EAAQ,CAAC,EAC1C,WAAYA,EAAM,IAAI,CAAC,CAAE,MAAAE,EAAO,KAAAC,EAAK,KAAO,CAAE,MAAAD,EAAO,KAAAC,EAAK,EAAE,EAC5D,OAAQH,EAAM,IAAKI,IAAO,CAAE,GAAGA,EAAG,IAAK,CAAE,EAAE,EAC3C,OAAQP,EAAI,OACZ,OAAQ,YACR,KAAMA,EAAI,KACV,UAAWA,EAAI,UACf,MAAOA,EAAI,MACX,GAAIA,EAAI,MAAQ,CAAE,MAAOA,EAAI,KAAM,EAAI,CAAC,CAC1C,GAIJ,GAAI,CAACQ,EAAWjB,CAAW,GAAKE,EAAK,WAAW,SAAW,EACzD,OAAOgB,EAAY,aAAchC,EAAU,gEAA2D,EAGxG,IAAMiC,IADaF,EAAWjB,CAAW,EAAIoB,GAAapB,EAAa,OAAO,EAAI,IACrDqB,GAAoBnC,EAAUgB,EAAK,WAAYL,EAAaC,CAAW,EAG9FwB,EAAgB,KAAK,IAAI,EAC3BC,EAAqD,CAAC,EACtDC,EAAiB,GACrB,GAAI,CACF,IAAMC,EAAU,MAAMC,EAAwBxC,EAAUgB,EAAK,KAAMd,EAAaI,EAAeK,EAAaC,CAAW,EACnH2B,GACFF,EAAaE,EACbD,EAAiB,sBAAsBC,EAAQ,IAAKE,GAAMA,EAAE,KAAK,EAAE,KAAK,KAAK,MAE7EH,EAAiB,MAAMI,EACrBC,GAAoB3C,EAAUiC,GAAS3B,EAAeK,CAAW,EACjEP,EACAK,CACF,EACA4B,EAAaO,GAAgBN,CAAc,EAE/C,OAASO,EAAP,CACA,OAAAnC,EAAI,mBAAoBmC,GAAG,OAAO,EAC3B,CAAE,GAAGb,EAAY,QAAShC,EAAU,aAAa6C,GAAG,SAAW,WAAW,EAAG,MAAO,CAAE,WAAY,KAAK,IAAI,EAAIT,EAAe,YAAa,EAAG,eAAAE,CAAe,CAAE,CACxK,CACA,IAAMQ,EAAa,KAAK,IAAI,EAAIV,EAEhC,GAAIC,EAAW,SAAW,EACxB,MAAO,CAAE,GAAGL,EAAY,gBAAiBhC,EAAU,kCAAkC,EAAG,MAAO,CAAE,WAAA8C,EAAY,YAAa,EAAG,eAAAR,CAAe,CAAE,EAIhJ,IAAMS,EAASC,EAAaX,EAAYrB,EAAMT,EAASC,CAAW,EAElE,GAAIuC,EAAO,SAAW,EACpB,MAAO,CAAE,GAAGf,EAAY,gBAAiBhC,EAAU,kDAAkD,EAAG,WAAAqC,EAAY,MAAO,CAAE,WAAAS,EAAY,YAAa,EAAG,eAAAR,CAAe,CAAE,EAI5K,IAAMW,EAAa,KAAK,IAAI,EACxBC,EAAS,GACb,GAAI,CACFA,EAAS,MAAMR,EACbS,GAAqBnD,EAAU+C,CAAM,EACrC1C,EACAI,EAAY,CACd,CACF,OAASoC,EAAP,CACA,OAAAnC,EAAI,oBAAqBmC,GAAG,OAAO,EAC5B,CAAE,GAAGb,EAAY,QAAShC,EAAU,cAAc6C,GAAG,SAAW,WAAW,EAAG,WAAAR,EAAY,OAAQU,EAAO,IAAIK,IAAM,CAAE,MAAOA,EAAE,KAAK,MAAO,KAAMA,EAAE,KAAM,KAAMA,EAAE,KAAK,KAAM,IAAMA,EAAU,KAAO,CAAE,EAAE,EAAG,MAAO,CAAE,WAAAN,EAAY,YAAa,KAAK,IAAI,EAAIG,EAAY,eAAAX,CAAe,CAAE,CAC9R,CACA,IAAMe,GAAc,KAAK,IAAI,EAAIJ,EAEjC,MAAO,CACL,OAAQC,EAAO,KAAK,EACpB,UAAWH,EAAO,IAAIpB,IAAM,CAAE,MAAOA,EAAE,KAAK,MAAO,KAAMA,EAAE,KAAM,KAAMA,EAAE,KAAK,IAAK,EAAE,EACrF,WAAAU,EACA,OAAQU,EAAO,IAAIK,IAAM,CAAE,MAAOA,EAAE,KAAK,MAAO,KAAMA,EAAE,KAAM,KAAMA,EAAE,KAAK,KAAM,IAAMA,EAAU,KAAO,CAAE,EAAE,EAC5G,OAAQ,KACR,MAAO,CAAE,WAAAN,EAAY,YAAAO,GAAa,eAAAf,CAAe,CACnD,CACF,CA4BA,eAAsBgB,GACpBtD,EACAC,EACAC,EACAC,EAAwB,CAAC,EACsB,CAC/C,IAAMG,EAAgBH,EAAK,eAAiB,EACtCS,EAAcT,EAAK,aAAeU,EAClCF,EAAcR,EAAK,aAAa,OAASA,EAAK,YAAc,OAC5DoD,EAAOpD,EAAK,MAAQqD,EAAYvD,CAAK,EAC3C,GAAIsD,EAAK,SAAW,GAAK,CAACvD,EAAS,KAAK,EAAG,MAAO,CAAC,EAEnD,IAAIqC,EAAa,MAAMG,EACrBxC,EAAUuD,EAAMrD,EAAaI,EAAeK,EAAaC,EAAaT,EAAK,OAAS,UACtF,EACA,GAAI,CAACkC,EAAY,CACf,IAAMoB,EAAU,IAAI,IAAIC,EAAS1D,EAAU2D,EAAWJ,EAAK,IAAIK,CAAU,CAAC,CAAC,EAAE,IAAKC,GAAMA,EAAE,QAAQ,CAAC,EACnGxB,EAAayB,EAAgB9D,EAAUuD,EAAM5C,EAAaC,CAAW,EAClE,OAAQ,GAAM6C,EAAQ,IAAI,CAAC,CAAC,EAC5B,MAAM,EAAGnD,CAAa,EACtB,IAAK,IAAO,CAAE,MAAOiD,EAAK,CAAC,EAAE,MAAO,KAAMA,EAAK,CAAC,EAAE,IAAK,EAAE,EAE9D,OAAIlB,EAAW,SAAW,EAAU,CAAC,EAC9BW,EAAaX,EAAYpB,EAAUhB,EAAOC,CAAW,EAAGC,EAAK,SAAW,EAAGA,EAAK,aAAe,CAAC,CACzG,CAKO,SAASqD,EAAYvD,EAAkC,CAC5D,GAAI,CACF,OAAQA,EAAM,aAAa,EAAE,UAAY,CAAC,GAAG,OAAQ0B,GAAMA,EAAE,MAAQ,CAACA,EAAE,KAAK,SAAS,aAAa,CAAC,CACtG,MAAE,CACA,MAAO,CAAC,CACV,CACF,CAIA,SAASK,EACP+B,EACAC,EACAC,EACoB,CACpB,MAAO,CACL,OAAQ,GACR,UAAW,CAAC,EACZ,WAAY,CAAC,EACb,OAAQ,CAAC,EACT,OAAAF,EACA,MAAAE,CACF,CACF,CAoBA,SAAShD,EAAUhB,EAAkBC,EAAiCgE,EAA4B,CAAC,EAAc,CAC/G,IAAMC,EAAa,IAAI,IACjBC,EAA2E,CAAC,EAClF,QAAWC,KAAWpE,EAAM,aAAaC,GAAe,EAAE,EACxDiE,EAAW,IAAIE,EAAQ,KAAK,MAAM,YAAY,EAAGA,EAAQ,IAAI,EAC7DD,EAAQ,KAAK,CAAE,KAAMC,EAAQ,KAAM,QAASA,EAAQ,KAAK,SAAW,CAAC,EAAG,YAAaA,EAAQ,KAAK,aAAe,EAAG,CAAC,EAEvH,IAAMC,EAA6B,CAAC,EAC9BC,EAAO,IAAI,IACjB,QAAWC,KAAKN,EACd,GAAIM,EAAE,MAAM,UAAYvE,EAAM,QAC9B,CAAAsE,EAAK,IAAIC,EAAE,GAAIA,CAAC,EAGhB,QAAW7C,KAAK6C,EAAE,MAAM,aAAatE,GAAe,EAAE,EAAG,CACvD,GAAIyB,EAAE,KAAK,SAAS,aAAa,GAAK6C,EAAE,OAAO7C,EAAE,IAAI,EAAG,SACxD,IAAME,EAAO,IAAI2C,EAAE,MAAM7C,EAAE,OAC3B2C,EAAW,KAAKG,GAAa9C,EAAGE,CAAI,CAAC,EACrCuC,EAAQ,KAAK,CAAE,KAAAvC,EAAM,QAASF,EAAE,KAAK,SAAW,CAAC,EAAG,YAAaA,EAAE,KAAK,aAAe,EAAG,CAAC,EAC3F,IAAM+C,EAAM/C,EAAE,KAAK,MAAM,YAAY,EAChCwC,EAAW,IAAIO,CAAG,GAAGP,EAAW,IAAIO,EAAK7C,CAAI,GAMtD,IAAM8C,EAAY,IAAI,IACtB,GAAIJ,EAAK,KAAO,EACd,QAAWK,IAAK,CAAC,GAAGR,CAAO,EAAE,KAAK,CAACzC,EAAGkD,IAAMA,EAAE,YAAY,cAAclD,EAAE,WAAW,CAAC,EACpF,QAAWmD,KAAKF,EAAE,QAAS,CACzB,IAAMF,EAAMI,EAAE,YAAY,EACpBC,EAAOJ,EAAU,IAAID,CAAG,GAAK,CAAC,EAC/BK,EAAK,SAASH,EAAE,IAAI,GAAGG,EAAK,KAAKH,EAAE,IAAI,EAC5CD,EAAU,IAAID,EAAKK,CAAI,EAI7B,IAAIxB,EACJ,MAAO,CACL,UAAAoB,EACA,SAAU,IAAI,IAAIP,EAAQ,IAAKQ,GAAMA,EAAE,IAAI,CAAC,EAG5C,IAAI,MAAO,CAAE,OAAQrB,IAAS,CAAC,GAAGC,EAAYvD,CAAK,EAAG,GAAGqE,CAAU,CAAG,EACtE,WAAAA,EACA,WAAAH,EACA,KAAKtC,EAAM,CACT,IAAMmD,EAAInD,EAAK,MAAM,kBAAkB,EACjCoD,EAASD,EAAIT,EAAK,IAAIS,EAAE,CAAC,CAAC,EAAI,OACpC,GAAIA,GAAK,CAACC,EAAQ,OAAO,KACzB,IAAMT,EAAIS,GAAQ,OAAShF,EACrBiF,EAAMF,EAAIA,EAAE,CAAC,EAAInD,EACjBwC,EAAUnE,EAAcsE,EAAE,cAAcU,EAAKhF,CAAW,EAAIsE,EAAE,YAAYU,CAAG,EACnF,OAAOb,EAAU,CAAE,GAAGA,EAAS,KAAAxC,CAAK,EAAI,IAC1C,CACF,CACF,CAEA,SAAS4C,GAAa9C,EAAgBE,EAA4B,CAChE,MAAO,CACL,KAAAA,EACA,MAAOF,EAAE,KAAK,MACd,KAAMA,EAAE,KAAK,KACb,QAASA,EAAE,KAAK,QAChB,KAAMA,EAAE,KAAK,MAAQ,CAAC,EACtB,MAAOA,EAAE,KAAK,MACd,OAAQA,EAAE,KAAK,OACf,WAAYA,EAAE,KAAK,WACnB,QAAS,CAACA,EAAE,KAAK,MAAM,YAAY,EAAG,IAAIA,EAAE,KAAK,SAAW,CAAC,GAAG,IAAKwD,GAAMA,EAAE,YAAY,CAAC,CAAC,EAC3F,UAAW,EACX,QAASxD,EAAE,KAAK,QAChB,YAAaA,EAAE,KAAK,YACpB,UAAWA,EAAE,KAAK,SACpB,CACF,CAIO,IAAMyD,GAAuB,IAEpC,SAASjD,GAAoBnC,EAAkBuD,EAAsB5C,EAAmCC,EAA6B,CACnI,OAAI2C,EAAK,SAAW,EAAU,GAIvB;AAAA;AAAA;AAAA;AAAA,EAHOO,EAAgB9D,EAAUuD,EAAM5C,EAAaC,CAAW,EACnE,MAAM,EAAGwE,EAAoB,EAC7B,IAAKC,GAAM,KAAK9B,EAAK8B,CAAC,EAAE,QAAQ9B,EAAK8B,CAAC,EAAE,KAAO,KAAK9B,EAAK8B,CAAC,EAAE,QAAU,OAAO9B,EAAK8B,CAAC,EAAE,OAAO,EAChC,KAAK;AAAA,CAAI;AAAA,CAC1E,CAGA,IAAMC,GAAqB,EAE3B,SAAStC,EACPX,EACArB,EACAT,EACAC,EACsC,CACtC,IAAM2D,EAAanD,EAAK,WAClBuE,EAAY1D,GAAiBA,EAAK,WAAW,GAAG,EAKhD2D,EAAU,CAAC,GAAGnD,EAAW,OAAQI,GAAM,CAAC8C,EAAS9C,EAAE,IAAI,CAAC,EAAG,GAAGJ,EAAW,OAAQI,GAAM8C,EAAS9C,EAAE,IAAI,CAAC,CAAC,EAC1GgD,EAAYD,EAAQ,OAAS,GAAK,CAACD,EAASC,EAAQ,CAAC,EAAE,IAAI,EAAI,KAAK,MAAMhF,EAAc,CAAC,EAAIA,EAE3FkF,EAAS,IAAI,IACfC,EAAe,EACfC,EAAiDJ,EAAQ,IAAK/C,IAAO,CAAE,KAAMA,EAAE,KAAM,IAAK,CAAE,EAAE,EAI5FoD,EAAiD,CAAC,EAExD,KAAOH,EAAO,KAAOlF,GAAa,CAChC,GAAI,CAACoF,EAAS,OAAQ,CACpB,GAAI,CAACC,EAAS,QAAUJ,GAAajF,EAAa,MAClDiF,EAAYjF,EACZoF,EAAWC,EAAS,OAAO,CAAC,EAE9B,IAAMC,EAAOF,EAAS,MAAM,EAE5B,GADIF,EAAO,IAAII,EAAK,IAAI,GACpBA,EAAK,IAAMvF,EAAS,SACxB,GAAIgF,EAASO,EAAK,IAAI,GAAKH,GAAgBF,EAAW,CAAEI,EAAS,KAAKC,CAAI,EAAG,SAE7E,IAAMzB,EAAUrD,EAAK,KAAK8E,EAAK,IAAI,EACnC,GAAKzB,IAELqB,EAAO,IAAII,EAAK,KAAM,CAAE,GAAGzB,EAAS,IAAKyB,EAAK,GAAI,CAAC,EAC/CP,EAASO,EAAK,IAAI,GAAGH,IACrB,EAAAG,EAAK,KAAOvF,IAEhB,IAAIuF,EAAK,MAAQ,EAAG,CAGlB,IAAMC,EAAQ,CAAC1B,EAAQ,KAAK,MAAO,GAAIA,EAAQ,KAAK,SAAW,CAAC,CAAE,EAAE,IAAK2B,GAAMA,EAAE,YAAY,CAAC,EACxF5B,EAAU,CAAC,GAAG,IAAI,IAAI2B,EAAM,QAASC,GAAMhF,EAAK,UAAU,IAAIgF,CAAC,GAAK,CAAC,CAAC,CAAC,CAAC,EAC3E,OAAQnE,GAASA,IAASiE,EAAK,MAAQ,CAACJ,EAAO,IAAI7D,CAAI,CAAC,EACxD,MAAM,EAAGyD,EAAkB,EAC9B,QAAWzD,KAAQuC,EAASwB,EAAS,KAAK,CAAE,KAAA/D,EAAM,IAAK,CAAE,CAAC,EAE5D,QAAWoD,KAAUZ,EAAQ,KAAK,SAAW,CAAC,EAAG,CAC/C,IAAMxC,EAAOsC,EAAW,IAAIc,EAAO,YAAY,CAAC,EAC5CpD,GAAQ,CAAC6D,EAAO,IAAI7D,CAAI,GAC1B+D,EAAS,KAAK,CAAE,KAAA/D,EAAM,IAAKiE,EAAK,IAAM,CAAE,CAAC,IAK/C,OAAO,MAAM,KAAKJ,EAAO,OAAO,CAAC,CACnC,CAoBA,eAAelD,EACbxC,EACAuD,EACArD,EACAI,EACAK,EACAC,EAAsBC,EACtBoF,EAAQ,mBACgD,CACxD,GAAI,CACF,GAAI1C,EAAK,OAAS,EAAG,OAAO,KAI5B,IAAMlB,EAFYyB,EAAgB9D,EAAUuD,EAAM5C,EAAaC,CAAW,EAAE,MAAM,EAAGsF,CAAiB,EAEtD,IAAKb,IAAO,CAC1D,GAAI,IAAIA,IACR,MAAO9B,EAAK8B,CAAC,EAAE,OAAS9B,EAAK8B,CAAC,EAAE,KAChC,KAAM9B,EAAK8B,CAAC,EAAE,KAGd,QAAS,CACP9B,EAAK8B,CAAC,EAAE,KAAO,SAAS9B,EAAK8B,CAAC,EAAE,OAAS,IACxC9B,EAAK8B,CAAC,EAAE,SAAW,CAAC,GAAG,OAAS,aAAa9B,EAAK8B,CAAC,EAAE,SAAW,CAAC,GAAG,KAAK,IAAI,IAAM,IACnF9B,EAAK8B,CAAC,EAAE,WAAa,CAAC,GAAG,OAAS,WAAW9B,EAAK8B,CAAC,EAAE,WAAa,CAAC,GAAG,KAAK,UAAK,IAAM,EACzF,EAAE,OAAO,OAAO,EAAE,KAAK,QAAK,CAC9B,EAAE,EAEIc,EAAS,MAAMC,EACnBC,EACAC,EAAY,CAAE,MAAOtG,EAAU,WAAAqC,EAAY,aAAc,GAAI,CAAC,EAC9DkE,EAAgBlE,CAAU,EAC1B,CAAE,SAAU,CAAE,MAAOnC,GAAe,UAAW,MAAA+F,CAAM,CAAE,CACzD,EACA,GAAI,CAACE,GAAUA,EAAO,OAAS,SAAU,OAAO,KAGhD,IAAMK,EADUC,EAAUN,EAAO,QAAkB9D,CAAU,EACtC,OACpB,MAAM,EAAG/B,CAAa,EACtB,IAAKoG,GAAOnD,EAAK,OAAOmD,EAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EACrC,OAAO,OAAO,EACd,IAAK/E,IAAO,CAAE,MAAOA,EAAE,MAAO,KAAMA,EAAE,IAAK,EAAE,EAChD,OAAO6E,EAAO,OAAS,EAAIA,EAAS,IACtC,MAAE,CACA,OAAO,IACT,CACF,CAIO,IAAM3F,EAAuB,GAmB7B,SAASiD,EACd9D,EACAuD,EACA5C,EACAC,EAAsBC,EACZ,CACV,IAAM8F,EAAOjD,EAAS1D,EAAU2D,EAAWJ,EAAK,IAAIK,CAAU,CAAC,CAAC,EAC1DgD,EAAUD,EAAK,OAAO,CAAC3B,EAAGnB,IAAM,KAAK,IAAImB,EAAGnB,EAAE,KAAK,EAAG,CAAC,EACvDgD,EAAO,IAAI,IAAIF,EAAK,IAAK9C,GAAM,CAACA,EAAE,SAAU+C,EAAU,EAAI/C,EAAE,MAAQ+C,EAAU,CAAC,CAAC,CAAC,EACjFE,EAAW,CAAC,CAACnG,GAAa,OAC1BoG,EAAUpF,GACdmF,GAAYnF,EAAE,WAAW,OAASqF,EAAcrG,EAAcgB,EAAE,SAAS,EAAI,EAEzEsF,EAAU,CAAC9B,EAAiC+B,IAAoCA,EAAE,MAAQ/B,EAAE,OAASA,EAAE,EAAI+B,EAAE,EAC7GzD,EAAUF,EACb,IAAI,CAAC5B,EAAG0D,KAAO,CAAE,EAAAA,EAAG,OAAQwB,EAAK,IAAIxB,CAAC,GAAK,IAAM,EAAIzE,EAAcmG,EAAOpF,CAAC,EAAG,EAAE,EAChF,OAAQc,GAAMoE,EAAK,IAAIpE,EAAE,CAAC,CAAC,EAC3B,KAAKwE,CAAO,EACTE,EAAa5D,EAChB,IAAI,CAAC5B,EAAG0D,KAAO,CAAE,EAAAA,EAAG,MAAO0B,EAAOpF,CAAC,CAAE,EAAE,EACvC,OAAQc,GAAM,CAACoE,EAAK,IAAIpE,EAAE,CAAC,GAAKA,EAAE,MAAQ,CAAC,EAC3C,KAAKwE,CAAO,EACTG,EAAS,CAAC,GAAG3D,EAAS,GAAG0D,CAAU,EAAE,IAAK1E,GAAMA,EAAE,CAAC,EACzD,QAAS4C,EAAI,EAAGA,EAAI9B,EAAK,OAAQ8B,IAAU+B,EAAO,SAAS/B,CAAC,GAAG+B,EAAO,KAAK/B,CAAC,EAC5E,OAAO+B,CACT,CAGA,SAASxD,EAAWjC,EAAmE,CACrF,MAAO,CAACA,EAAE,OAAQA,EAAE,MAAQ,CAAC,GAAG,KAAK,GAAG,GAAIA,EAAE,SAAW,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAClF,CAEA,SAASgB,GAAoB3C,EAAkBiC,EAAiB3B,EAAuBK,EAAgC,CACrH,IAAMoG,EAASpG,GAAa,OACxB;AAAA;AAAA;AAAA,0DAA0EA,EAAY,KAAK,UAAK;AAAA,EAChG,GACJ,MAAO;AAAA;AAAA;AAAA;AAAA,EAIPX;AAAA,EACA+G;AAAA;AAAA;AAAA,EAGA9E;AAAA;AAAA;AAAA;AAAA,aAIW3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0CAab,CAEA,SAAS6C,GACPnD,EACAqH,EACQ,CACR,IAAMC,EAAgBD,EACnB,IAAI1F,GAAK,CAGR,IAAM4F,EAAO,CAAC5F,EAAE,KAAK,MAAQ,UAAUA,EAAE,KAAK,QAAU,GAAIA,EAAE,KAAK,YAAc,YAAYA,EAAE,KAAK,cAAgB,EAAE,EAAE,OAAO,OAAO,EAAE,KAAK,IAAI,EAC3I6F,EAAS,OAAO7F,EAAE,KAAK,gBAAWA,EAAE,KAAK,MAAQ,cAAcA,EAAE,cAAcA,EAAE,OAAO4F,EAAO,KAAKA,KAAU,KAC9GE,EAAU9F,EAAE,KAAK,SAAS,OAAS,YAAYA,EAAE,KAAK,QAAQ,KAAK,IAAI,IAAM,GACnF,MAAO,CAAC6F,EAAQC,EAAS,GAAI9F,EAAE,OAAO,EAAE,OAAO,OAAO,EAAE,KAAK;AAAA,CAAI,CACnE,CAAC,EACA,KAAK;AAAA;AAAA;AAAA;AAAA,CAAa,EAErB,MAAO;AAAA;AAAA;AAAA;AAAA,EAIP3B;AAAA;AAAA,eAEaqH,EAAS;AAAA;AAAA,EAEtBC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yFAOF,CAEA,SAAS1E,GAAgB8E,EAAqD,CAC5E,IAAMC,EAAQD,EAAI,MAAM,cAAc,EACtC,GAAI,CAACC,EAAO,MAAO,CAAC,EACpB,GAAI,CACF,IAAMC,EAAS,KAAK,MAAMD,EAAM,CAAC,CAAC,EAClC,OAAK,MAAM,QAAQC,CAAM,EAClBA,EACJ,OAAQzC,GAAWA,GAAK,OAAOA,EAAE,OAAU,UAAY,OAAOA,EAAE,MAAS,QAAQ,EACjF,IAAKA,IAAY,CAAE,MAAOA,EAAE,MAAO,KAAMA,EAAE,IAAK,EAAE,EAHlB,CAAC,CAItC,MAAE,CACA,MAAO,CAAC,CACV,CACF,CAEA,eAAezC,EAAUmF,EAAgBC,EAAerH,EAAoC,CAG1F,GAAM,CAAE,cAAAsH,EAAe,UAAAC,EAAW,OAAAC,CAAO,EAAI,KAAM,QAAO,IAAI,EACxD,CAAE,OAAAC,CAAO,EAAI,KAAM,QAAO,IAAI,EAC9BC,EAAMpH,EAAQmH,EAAO,EAAG,qBAAqB,QAAQ,KAAK,EAChEF,EAAUG,EAAK,CAAE,UAAW,EAAK,CAAC,EAClC,IAAMC,EAAarH,EAAQoH,EAAK,UAAU,KAAK,IAAI,OAAO,EAC1DJ,EAAcK,EAAYP,CAAM,EAChC,GAAI,CACF,IAAMQ,EAAM,QAAQD,+DAAwEN,6FACtFJ,EAAMY,GAASD,EAAK,CAAE,IAAKE,EAAa,EAAG,SAAU,QAAS,QAAS9H,EAAW,UAAW,EAAI,KAAO,IAAK,CAAC,EACpH,GAAI,CACF,IAAM+H,EAAW,KAAK,MAAMd,CAAG,EAC/B,OAAO,OAAOc,EAAS,QAAUA,EAAS,SAAW,EAAE,CACzD,MAAE,CACA,OAAOd,CACT,CACF,QAAE,CACA,GAAI,CAAEO,EAAOG,EAAY,CAAE,MAAO,EAAK,CAAC,CAAE,MAAE,CAAO,CACrD,CACF,CAKA,eAAsBK,GAAmBC,EAAuC,CAC9E,GAAI,CACF,GAAM,CAAE,iBAAAC,CAAiB,EAAI,KAAM,QAAO,sBAAiB,EAC3D,OAAOA,EAAiBD,CAAU,EAAE,KAAK,MAAM,MACjD,MAAE,CACA,MAAO,EACT,CACF","names":["readFileSync","existsSync","init_seat","resolve","execSync","agenticQuery","question","store","requesterId","opts","selectorModel","synthModel","maxCandidates","maxHops","maxArticles","timeoutMs","log","messagePath","graphWeight","DEFAULT_GRAPH_WEIGHT","catalogPath","resolve","view","scopeView","method","summaries","collectSummaries","base","DEFAULT_SUMMARIES_QUERY","out","summariesQuery","claudeModelCall","pages","a","title","path","p","existsSync","emptyResult","catalog","readFileSync","renderSharedCatalog","selectorStart","candidates","selectorOutput","viaSeat","selectCandidatesViaSeat","c","runClaude","buildSelectorPrompt","parseCandidates","e","selectorMs","walked","walkSubgraph","synthStart","answer","buildSynthesisPrompt","w","synthesisMs","retrieveArticles","pool","catalogPool","matched","scoreAll","buildIndex","catalogDoc","r","rankCatalogPool","status","_question","error","shared","titleIndex","linking","article","sharedPool","byId","s","catalogEntry","key","backlinks","l","b","t","list","m","target","rel","x","SHARED_CATALOG_LINES","i","BACKLINKS_PER_PICK","isShared","ordered","sharedCap","opened","sharedOpened","frontier","deferred","next","names","n","stage","DEFAULT_SHORTLIST","result","askSeat","WIKI_RERANK_SEAT","rerankState","rerankQuestions","picked","toRanking","id","bm25","maxBm25","text","useGraph","branch","ancestryScore","byScore","y","branchOnly","ranked","articles","articlesBlock","from","header","related","raw","match","parsed","prompt","model","writeFileSync","mkdirSync","rmSync","tmpdir","dir","promptPath","cmd","execSync","claudeCliEnv","envelope","sharedQueryEnabled","configPath","loadDaemonConfig"]}