@64mb/freelens-power 1.4.0 → 1.5.0

package/out/renderer/resource-search-model.js.map

@@ -1 +1 @@
-{"version":3,"file":"resource-search-model.js","names":[],"sources":["../../src/renderer/resource-search-model.ts"],"sourcesContent":["import { boundedNameDistance } from \"./resource-search-distance\";\n\nimport type { SearchField } from \"./resource-search-fields\";\nexport interface SearchResource {\n  kind: string;\n  name: string;\n  namespace?: string;\n  labels: Record<string, string>;\n  path: string;\n  fields?: SearchField[];\n}\n\nexport const RESOURCE_SEARCH_MAX_DOCUMENT_CHARS = 4096;\nexport const queryTokens = (query: string) =>\n  query.slice(0, 300).toLocaleLowerCase().trim().split(/\\s+/).filter(Boolean);\nconst metadataText = (resource: SearchResource) =>\n  [\n    resource.kind,\n    resource.name,\n    resource.namespace ?? \"\",\n    ...Object.entries(resource.labels).map(([key, value]) => `${key}=${value}`),\n  ].join(\" \");\nfunction rankResources(resources: SearchResource[], tokens: string[]) {\n  const score = (resource: SearchResource) =>\n    tokens.reduce((total, token) => {\n      const name = resource.name.toLocaleLowerCase();\n      const kind = resource.kind.toLocaleLowerCase();\n      const namespace = (resource.namespace ?? \"\").toLocaleLowerCase();\n      return (\n        total +\n        (name === token\n          ? 0\n          : name.startsWith(token)\n            ? 1\n            : kind === token\n              ? 2\n              : name.includes(token)\n                ? 3\n                : kind.includes(token)\n                  ? 4\n                  : namespace.includes(token)\n                    ? 5\n                    : 6)\n      );\n    }, 0);\n\n  return resources.sort((a, b) => score(a) - score(b) || a.kind.localeCompare(b.kind) || a.name.localeCompare(b.name));\n}\n\nexport function createResourceSearchIndex(resources: SearchResource[]) {\n  const documents = resources.filter((resource) => resource.kind !== \"Secret\" && resource.kind !== \"ConfigMap\");\n  const vocabulary = new Map<string, Set<number>>();\n  const names = new Map<number, Map<string, Set<number>>>();\n  let lastQuery: string | undefined;\n  let lastResults: SearchResource[] = [];\n  let similarPaths = new Set<string>();\n  let partsPaths = new Set<string>();\n  const nameParts = new Map<number, string[]>();\n  const partVocabulary = new Map<string, Set<number>>();\n  const snippets = new Map<string, SearchField[]>();\n  const metadata = new Map<string, string>();\n  documents.forEach((resource, id) => {\n    const parts = resource.name.toLocaleLowerCase().split(/[-._]/).filter(Boolean).slice(0, 16);\n    nameParts.set(id, parts);\n    for (const part of parts) {\n      let ids = partVocabulary.get(part);\n      if (!ids) {\n        ids = new Set();\n        partVocabulary.set(part, ids);\n      }\n      ids.add(id);\n    }\n    for (const name of new Set(\n      [resource.name, ...resource.name.split(/[-.]/)].map((name) => name.toLocaleLowerCase()),\n    )) {\n      if (name.length < 3 || name.length > 64) continue;\n      let bucket = names.get(name.length);\n      if (!bucket) {\n        bucket = new Map();\n        names.set(name.length, bucket);\n      }\n      let ids = bucket.get(name);\n      if (!ids) {\n        ids = new Set();\n        bucket.set(name, ids);\n      }\n      ids.add(id);\n    }\n    const identity = metadataText(resource).slice(0, RESOURCE_SEARCH_MAX_DOCUMENT_CHARS);\n    metadata.set(resource.path, identity.toLocaleLowerCase());\n    let remaining = RESOURCE_SEARCH_MAX_DOCUMENT_CHARS - identity.length;\n    const fields: SearchField[] = [];\n    for (const field of resource.fields ?? []) {\n      if (remaining <= 1) break;\n      const text = field.text.slice(0, remaining - 1);\n      fields.push({ label: field.label, text });\n      remaining -= text.length + 1;\n    }\n    snippets.set(resource.path, fields);\n    for (const word of new Set(\n      [identity, ...fields.map((field) => field.text)].join(\" \").toLocaleLowerCase().split(/\\s+/),\n    )) {\n      if (!word) continue;\n      let ids = vocabulary.get(word);\n      if (!ids) {\n        ids = new Set();\n        vocabulary.set(word, ids);\n      }\n      ids.add(id);\n    }\n  });\n  return {\n    search(query: string): SearchResource[] {\n      query = query.slice(0, 300);\n      if (lastQuery === query) return lastResults;\n      lastQuery = query;\n      similarPaths = new Set();\n      partsPaths = new Set();\n      lastResults = [];\n      const tokens = queryTokens(query);\n      const penalties = new Map<number, number>();\n      let candidates: Set<number> | undefined;\n      for (const token of tokens) {\n        const found = new Set<number>();\n        for (const [word, ids] of vocabulary) if (word.includes(token)) for (const id of ids) found.add(id);\n        if (/^[a-z0-9]+(?:[-._][a-z0-9]+)+$/.test(token)) {\n          const parts = token.split(/[-._]/);\n          if (parts.length <= 16) {\n            let possible: Set<number> | undefined;\n            for (const part of parts) {\n              const ids = partVocabulary.get(part) ?? new Set<number>();\n              possible = possible === undefined ? ids : new Set([...possible].filter((id) => ids.has(id)));\n            }\n            for (const id of possible ?? []) {\n              if (found.has(id)) continue;\n              let offset = 0;\n              for (const part of nameParts.get(id) ?? []) if (part === parts[offset]) offset++;\n              if (offset === parts.length) {\n                found.add(id);\n                penalties.set(id, (penalties.get(id) ?? 0) + 1);\n                partsPaths.add(documents[id].path);\n              }\n            }\n          }\n        }\n        const exact = new Set(found);\n        const limit = token.length >= 7 && token.length <= 64 ? 2 : token.length >= 4 && token.length <= 6 ? 1 : 0;\n        if (limit) {\n          const distances = new Map<number, number>();\n          for (let length = token.length - limit; length <= token.length + limit; length++) {\n            for (const [name, ids] of names.get(length) ?? []) {\n              const distance = boundedNameDistance(token, name, limit);\n              if (distance > limit) continue;\n              for (const id of ids)\n                if (!exact.has(id)) distances.set(id, Math.min(distances.get(id) ?? Infinity, distance));\n            }\n          }\n          for (const [id, distance] of distances) {\n            found.add(id);\n            penalties.set(id, (penalties.get(id) ?? 0) + 10 * distance);\n            similarPaths.add(documents[id].path);\n          }\n        }\n        candidates = candidates === undefined ? found : new Set([...candidates].filter((id) => found.has(id)));\n        if (!candidates.size) return [];\n      }\n      lastResults = rankResources(\n        candidates === undefined ? [...documents] : [...candidates].map((id) => documents[id]),\n        tokens,\n      );\n      const penaltyByPath = new Map([...penalties].map(([id, penalty]) => [documents[id].path, penalty]));\n      lastResults.sort((left, right) => (penaltyByPath.get(left.path) ?? 0) - (penaltyByPath.get(right.path) ?? 0));\n      return lastResults;\n    },\n    nameParts(resource: SearchResource): boolean {\n      return partsPaths.has(resource.path);\n    },\n    similarName(resource: SearchResource): boolean {\n      return similarPaths.has(resource.path);\n    },\n    snippet(resource: SearchResource, query: string): SearchField | undefined {\n      const tokens = queryTokens(query);\n      const identity = metadata.get(resource.path) ?? \"\";\n      const bodyTokens = tokens.filter((token) => !identity.includes(token));\n      if (!bodyTokens.length) return;\n      const field = snippets\n        .get(resource.path)\n        ?.find((item) => bodyTokens.some((token) => item.text.toLocaleLowerCase().includes(token)));\n      if (!field) return;\n      const offset = Math.max(\n        0,\n        Math.min(\n          ...bodyTokens.map((token) => field.text.toLocaleLowerCase().indexOf(token)).filter((index) => index >= 0),\n        ) - 35,\n      );\n      return {\n        label: field.label,\n        text:\n          (offset ? \"…\" : \"\") + field.text.slice(offset, offset + 150) + (field.text.length > offset + 150 ? \"…\" : \"\"),\n      };\n    },\n  };\n}\n\nexport function matchResources(resources: SearchResource[], query: string): SearchResource[] {\n  return createResourceSearchIndex(resources).search(query);\n}\n\nexport function createDoubleShift() {\n  let last = 0;\n  let held = false;\n  const otherKeys = new Set<string>();\n  return (\n    event: Pick<KeyboardEvent, \"key\" | \"type\" | \"repeat\" | \"altKey\" | \"ctrlKey\" | \"metaKey\"> &\n      Partial<Pick<KeyboardEvent, \"code\">>,\n    now: number,\n  ) => {\n    const physicalKey = event.code || event.key;\n    if (event.type === \"keyup\") {\n      if (event.key === \"Shift\") held = false;\n      else otherKeys.delete(physicalKey);\n      if (event.key === \"Meta\") {\n        otherKeys.clear();\n        held = false;\n        last = 0;\n      }\n      return false;\n    }\n    if (event.key !== \"Shift\") otherKeys.add(physicalKey);\n    if (event.key !== \"Shift\" || otherKeys.size > 0 || event.altKey || event.ctrlKey || event.metaKey) {\n      last = 0;\n      return false;\n    }\n    if (event.repeat || held) return false;\n    held = true;\n    const hit = last > 0 && now - last <= 400;\n    last = hit ? 0 : now;\n    return hit;\n  };\n}\n"],"mappings":";;AAYA,IAAa,qCAAqC;AAClD,IAAa,eAAe,UAC1B,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO;AAC5E,IAAM,gBAAgB,aACpB;CACE,SAAS;CACT,SAAS;CACT,SAAS,aAAa;CACtB,GAAG,OAAO,QAAQ,SAAS,MAAM,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,GAAG,IAAI,GAAG,OAAO;AAC5E,CAAC,CAAC,KAAK,GAAG;AACZ,SAAS,cAAc,WAA6B,QAAkB;CACpE,MAAM,SAAS,aACb,OAAO,QAAQ,OAAO,UAAU;EAC9B,MAAM,OAAO,SAAS,KAAK,kBAAkB;EAC7C,MAAM,OAAO,SAAS,KAAK,kBAAkB;EAC7C,MAAM,aAAa,SAAS,aAAa,GAAA,CAAI,kBAAkB;EAC/D,OACE,SACC,SAAS,QACN,IACA,KAAK,WAAW,KAAK,IACnB,IACA,SAAS,QACP,IACA,KAAK,SAAS,KAAK,IACjB,IACA,KAAK,SAAS,KAAK,IACjB,IACA,UAAU,SAAS,KAAK,IACtB,IACA;CAElB,GAAG,CAAC;CAEN,OAAO,UAAU,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,KAAK,cAAc,EAAE,IAAI,KAAK,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AACrH;AAEA,SAAgB,0BAA0B,WAA6B;CACrE,MAAM,YAAY,UAAU,QAAQ,aAAa,SAAS,SAAS,YAAY,SAAS,SAAS,WAAW;CAC5G,MAAM,6BAAa,IAAI,IAAyB;CAChD,MAAM,wBAAQ,IAAI,IAAsC;CACxD,IAAI;CACJ,IAAI,cAAgC,CAAC;CACrC,IAAI,+BAAe,IAAI,IAAY;CACnC,IAAI,6BAAa,IAAI,IAAY;CACjC,MAAM,4BAAY,IAAI,IAAsB;CAC5C,MAAM,iCAAiB,IAAI,IAAyB;CACpD,MAAM,2BAAW,IAAI,IAA2B;CAChD,MAAM,2BAAW,IAAI,IAAoB;CACzC,UAAU,SAAS,UAAU,OAAO;EAClC,MAAM,QAAQ,SAAS,KAAK,kBAAkB,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,MAAM,GAAG,EAAE;EAC1F,UAAU,IAAI,IAAI,KAAK;EACvB,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,MAAM,eAAe,IAAI,IAAI;GACjC,IAAI,CAAC,KAAK;IACR,sBAAM,IAAI,IAAI;IACd,eAAe,IAAI,MAAM,GAAG;GAC9B;GACA,IAAI,IAAI,EAAE;EACZ;EACA,KAAK,MAAM,QAAQ,IAAI,IACrB,CAAC,SAAS,MAAM,GAAG,SAAS,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,KAAK,SAAS,KAAK,kBAAkB,CAAC,CACxF,GAAG;GACD,IAAI,KAAK,SAAS,KAAK,KAAK,SAAS,IAAI;GACzC,IAAI,SAAS,MAAM,IAAI,KAAK,MAAM;GAClC,IAAI,CAAC,QAAQ;IACX,yBAAS,IAAI,IAAI;IACjB,MAAM,IAAI,KAAK,QAAQ,MAAM;GAC/B;GACA,IAAI,MAAM,OAAO,IAAI,IAAI;GACzB,IAAI,CAAC,KAAK;IACR,sBAAM,IAAI,IAAI;IACd,OAAO,IAAI,MAAM,GAAG;GACtB;GACA,IAAI,IAAI,EAAE;EACZ;EACA,MAAM,WAAW,aAAa,QAAQ,CAAC,CAAC,MAAM,GAAG,kCAAkC;EACnF,SAAS,IAAI,SAAS,MAAM,SAAS,kBAAkB,CAAC;EACxD,IAAI,YAAY,qCAAqC,SAAS;EAC9D,MAAM,SAAwB,CAAC;EAC/B,KAAK,MAAM,SAAS,SAAS,UAAU,CAAC,GAAG;GACzC,IAAI,aAAa,GAAG;GACpB,MAAM,OAAO,MAAM,KAAK,MAAM,GAAG,YAAY,CAAC;GAC9C,OAAO,KAAK;IAAE,OAAO,MAAM;IAAO;GAAK,CAAC;GACxC,aAAa,KAAK,SAAS;EAC7B;EACA,SAAS,IAAI,SAAS,MAAM,MAAM;EAClC,KAAK,MAAM,QAAQ,IAAI,IACrB,CAAC,UAAU,GAAG,OAAO,KAAK,UAAU,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,kBAAkB,CAAC,CAAC,MAAM,KAAK,CAC5F,GAAG;GACD,IAAI,CAAC,MAAM;GACX,IAAI,MAAM,WAAW,IAAI,IAAI;GAC7B,IAAI,CAAC,KAAK;IACR,sBAAM,IAAI,IAAI;IACd,WAAW,IAAI,MAAM,GAAG;GAC1B;GACA,IAAI,IAAI,EAAE;EACZ;CACF,CAAC;CACD,OAAO;EACL,OAAO,OAAiC;GACtC,QAAQ,MAAM,MAAM,GAAG,GAAG;GAC1B,IAAI,cAAc,OAAO,OAAO;GAChC,YAAY;GACZ,+BAAe,IAAI,IAAI;GACvB,6BAAa,IAAI,IAAI;GACrB,cAAc,CAAC;GACf,MAAM,SAAS,YAAY,KAAK;GAChC,MAAM,4BAAY,IAAI,IAAoB;GAC1C,IAAI;GACJ,KAAK,MAAM,SAAS,QAAQ;IAC1B,MAAM,wBAAQ,IAAI,IAAY;IAC9B,KAAK,MAAM,CAAC,MAAM,QAAQ,YAAY,IAAI,KAAK,SAAS,KAAK,GAAG,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,EAAE;IAClG,IAAI,iCAAiC,KAAK,KAAK,GAAG;KAChD,MAAM,QAAQ,MAAM,MAAM,OAAO;KACjC,IAAI,MAAM,UAAU,IAAI;MACtB,IAAI;MACJ,KAAK,MAAM,QAAQ,OAAO;OACxB,MAAM,MAAM,eAAe,IAAI,IAAI,qBAAK,IAAI,IAAY;OACxD,WAAW,aAAa,KAAA,IAAY,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,QAAQ,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;MAC7F;MACA,KAAK,MAAM,MAAM,YAAY,CAAC,GAAG;OAC/B,IAAI,MAAM,IAAI,EAAE,GAAG;OACnB,IAAI,SAAS;OACb,KAAK,MAAM,QAAQ,UAAU,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,SAAS,MAAM,SAAS;OACxE,IAAI,WAAW,MAAM,QAAQ;QAC3B,MAAM,IAAI,EAAE;QACZ,UAAU,IAAI,KAAK,UAAU,IAAI,EAAE,KAAK,KAAK,CAAC;QAC9C,WAAW,IAAI,UAAU,GAAG,CAAC,IAAI;OACnC;MACF;KACF;IACF;IACA,MAAM,QAAQ,IAAI,IAAI,KAAK;IAC3B,MAAM,QAAQ,MAAM,UAAU,KAAK,MAAM,UAAU,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,UAAU,IAAI,IAAI;IACzG,IAAI,OAAO;KACT,MAAM,4BAAY,IAAI,IAAoB;KAC1C,KAAK,IAAI,SAAS,MAAM,SAAS,OAAO,UAAU,MAAM,SAAS,OAAO,UACtE,KAAK,MAAM,CAAC,MAAM,QAAQ,MAAM,IAAI,MAAM,KAAK,CAAC,GAAG;MACjD,MAAM,WAAW,iCAAA,oBAAoB,OAAO,MAAM,KAAK;MACvD,IAAI,WAAW,OAAO;MACtB,KAAK,MAAM,MAAM,KACf,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG,UAAU,IAAI,IAAI,KAAK,IAAI,UAAU,IAAI,EAAE,KAAK,UAAU,QAAQ,CAAC;KAC3F;KAEF,KAAK,MAAM,CAAC,IAAI,aAAa,WAAW;MACtC,MAAM,IAAI,EAAE;MACZ,UAAU,IAAI,KAAK,UAAU,IAAI,EAAE,KAAK,KAAK,KAAK,QAAQ;MAC1D,aAAa,IAAI,UAAU,GAAG,CAAC,IAAI;KACrC;IACF;IACA,aAAa,eAAe,KAAA,IAAY,QAAQ,IAAI,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,QAAQ,OAAO,MAAM,IAAI,EAAE,CAAC,CAAC;IACrG,IAAI,CAAC,WAAW,MAAM,OAAO,CAAC;GAChC;GACA,cAAc,cACZ,eAAe,KAAA,IAAY,CAAC,GAAG,SAAS,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,KAAK,OAAO,UAAU,GAAG,GACrF,MACF;GACA,MAAM,gBAAgB,IAAI,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,UAAU,GAAG,CAAC,MAAM,OAAO,CAAC,CAAC;GAClG,YAAY,MAAM,MAAM,WAAW,cAAc,IAAI,KAAK,IAAI,KAAK,MAAM,cAAc,IAAI,MAAM,IAAI,KAAK,EAAE;GAC5G,OAAO;EACT;EACA,UAAU,UAAmC;GAC3C,OAAO,WAAW,IAAI,SAAS,IAAI;EACrC;EACA,YAAY,UAAmC;GAC7C,OAAO,aAAa,IAAI,SAAS,IAAI;EACvC;EACA,QAAQ,UAA0B,OAAwC;GACxE,MAAM,SAAS,YAAY,KAAK;GAChC,MAAM,WAAW,SAAS,IAAI,SAAS,IAAI,KAAK;GAChD,MAAM,aAAa,OAAO,QAAQ,UAAU,CAAC,SAAS,SAAS,KAAK,CAAC;GACrE,IAAI,CAAC,WAAW,QAAQ;GACxB,MAAM,QAAQ,SACX,IAAI,SAAS,IAAI,CAAC,EACjB,MAAM,SAAS,WAAW,MAAM,UAAU,KAAK,KAAK,kBAAkB,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC;GAC5F,IAAI,CAAC,OAAO;GACZ,MAAM,SAAS,KAAK,IAClB,GACA,KAAK,IACH,GAAG,WAAW,KAAK,UAAU,MAAM,KAAK,kBAAkB,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,QAAQ,UAAU,SAAS,CAAC,CAC1G,IAAI,EACN;GACA,OAAO;IACL,OAAO,MAAM;IACb,OACG,SAAS,MAAM,MAAM,MAAM,KAAK,MAAM,QAAQ,SAAS,GAAG,KAAK,MAAM,KAAK,SAAS,SAAS,MAAM,MAAM;GAC7G;EACF;CACF;AACF;AAMA,SAAgB,oBAAoB;CAClC,IAAI,OAAO;CACX,IAAI,OAAO;CACX,MAAM,4BAAY,IAAI,IAAY;CAClC,QACE,OAEA,QACG;EACH,MAAM,cAAc,MAAM,QAAQ,MAAM;EACxC,IAAI,MAAM,SAAS,SAAS;GAC1B,IAAI,MAAM,QAAQ,SAAS,OAAO;QAC7B,UAAU,OAAO,WAAW;GACjC,IAAI,MAAM,QAAQ,QAAQ;IACxB,UAAU,MAAM;IAChB,OAAO;IACP,OAAO;GACT;GACA,OAAO;EACT;EACA,IAAI,MAAM,QAAQ,SAAS,UAAU,IAAI,WAAW;EACpD,IAAI,MAAM,QAAQ,WAAW,UAAU,OAAO,KAAK,MAAM,UAAU,MAAM,WAAW,MAAM,SAAS;GACjG,OAAO;GACP,OAAO;EACT;EACA,IAAI,MAAM,UAAU,MAAM,OAAO;EACjC,OAAO;EACP,MAAM,MAAM,OAAO,KAAK,MAAM,QAAQ;EACtC,OAAO,MAAM,IAAI;EACjB,OAAO;CACT;AACF"}
+{"version":3,"file":"resource-search-model.js","names":[],"sources":["../../src/renderer/resource-search-model.ts"],"sourcesContent":["import { boundedNameDistance } from \"./resource-search-distance\";\n\nimport type { SearchField } from \"./resource-search-fields\";\nexport interface SearchResource {\n  kind: string;\n  aliases?: string[];\n  name: string;\n  namespace?: string;\n  labels: Record<string, string>;\n  path: string;\n  fields?: SearchField[];\n}\n\nexport const RESOURCE_SEARCH_MAX_DOCUMENT_CHARS = 4096;\nexport const queryTokens = (query: string) =>\n  query.slice(0, 300).toLocaleLowerCase().trim().split(/\\s+/).filter(Boolean);\nconst metadataText = (resource: SearchResource) =>\n  [\n    resource.kind,\n    ...(resource.aliases ?? []),\n    resource.name,\n    resource.namespace ?? \"\",\n    ...Object.entries(resource.labels).map(([key, value]) => `${key}=${value}`),\n  ].join(\" \");\nfunction rankResources(resources: SearchResource[], tokens: string[]) {\n  const score = (resource: SearchResource) =>\n    tokens.reduce((total, token) => {\n      const name = resource.name.toLocaleLowerCase();\n      const kind = resource.kind.toLocaleLowerCase();\n      const namespace = (resource.namespace ?? \"\").toLocaleLowerCase();\n      return (\n        total +\n        (name === token\n          ? 0\n          : name.startsWith(token)\n            ? 1\n            : kind === token\n              ? 2\n              : name.includes(token)\n                ? 3\n                : kind.includes(token)\n                  ? 4\n                  : namespace.includes(token)\n                    ? 5\n                    : 6)\n      );\n    }, 0);\n\n  return resources.sort((a, b) => score(a) - score(b) || a.kind.localeCompare(b.kind) || a.name.localeCompare(b.name));\n}\n\nexport function createResourceSearchIndex(resources: SearchResource[]) {\n  const documents = resources;\n  const vocabulary = new Map<string, Set<number>>();\n  const names = new Map<number, Map<string, Set<number>>>();\n  let lastQuery: string | undefined;\n  let lastResults: SearchResource[] = [];\n  let similarPaths = new Set<string>();\n  let partsPaths = new Set<string>();\n  const nameParts = new Map<number, string[]>();\n  const partVocabulary = new Map<string, Set<number>>();\n  const snippets = new Map<string, SearchField[]>();\n  const metadata = new Map<string, string>();\n  documents.forEach((resource, id) => {\n    const parts = resource.name.toLocaleLowerCase().split(/[-._]/).filter(Boolean).slice(0, 16);\n    nameParts.set(id, parts);\n    for (const part of parts) {\n      let ids = partVocabulary.get(part);\n      if (!ids) {\n        ids = new Set();\n        partVocabulary.set(part, ids);\n      }\n      ids.add(id);\n    }\n    for (const name of new Set(\n      [resource.name, ...resource.name.split(/[-.]/)].map((name) => name.toLocaleLowerCase()),\n    )) {\n      if (name.length < 3 || name.length > 64) continue;\n      let bucket = names.get(name.length);\n      if (!bucket) {\n        bucket = new Map();\n        names.set(name.length, bucket);\n      }\n      let ids = bucket.get(name);\n      if (!ids) {\n        ids = new Set();\n        bucket.set(name, ids);\n      }\n      ids.add(id);\n    }\n    const identity = metadataText(resource).slice(0, RESOURCE_SEARCH_MAX_DOCUMENT_CHARS);\n    metadata.set(resource.path, identity.toLocaleLowerCase());\n    let remaining = RESOURCE_SEARCH_MAX_DOCUMENT_CHARS - identity.length;\n    const fields: SearchField[] = [];\n    for (const field of resource.fields ?? []) {\n      if (remaining <= 1) break;\n      const text = field.text.slice(0, remaining - 1);\n      fields.push({ label: field.label, text });\n      remaining -= text.length + 1;\n    }\n    snippets.set(resource.path, fields);\n    for (const word of new Set(\n      [identity, ...fields.map((field) => field.text)].join(\" \").toLocaleLowerCase().split(/\\s+/),\n    )) {\n      if (!word) continue;\n      let ids = vocabulary.get(word);\n      if (!ids) {\n        ids = new Set();\n        vocabulary.set(word, ids);\n      }\n      ids.add(id);\n    }\n  });\n  return {\n    search(query: string): SearchResource[] {\n      query = query.slice(0, 300);\n      if (lastQuery === query) return lastResults;\n      lastQuery = query;\n      similarPaths = new Set();\n      partsPaths = new Set();\n      lastResults = [];\n      const tokens = queryTokens(query);\n      const penalties = new Map<number, number>();\n      let candidates: Set<number> | undefined;\n      for (const token of tokens) {\n        const found = new Set<number>();\n        for (const [word, ids] of vocabulary) if (word.includes(token)) for (const id of ids) found.add(id);\n        if (/^[a-z0-9]+(?:[-._][a-z0-9]+)+$/.test(token)) {\n          const parts = token.split(/[-._]/);\n          if (parts.length <= 16) {\n            let possible: Set<number> | undefined;\n            for (const part of parts) {\n              const ids = partVocabulary.get(part) ?? new Set<number>();\n              possible = possible === undefined ? ids : new Set([...possible].filter((id) => ids.has(id)));\n            }\n            for (const id of possible ?? []) {\n              if (found.has(id)) continue;\n              let offset = 0;\n              for (const part of nameParts.get(id) ?? []) if (part === parts[offset]) offset++;\n              if (offset === parts.length) {\n                found.add(id);\n                penalties.set(id, (penalties.get(id) ?? 0) + 1);\n                partsPaths.add(documents[id].path);\n              }\n            }\n          }\n        }\n        const exact = new Set(found);\n        const limit = token.length >= 7 && token.length <= 64 ? 2 : token.length >= 4 && token.length <= 6 ? 1 : 0;\n        if (limit) {\n          const distances = new Map<number, number>();\n          for (let length = token.length - limit; length <= token.length + limit; length++) {\n            for (const [name, ids] of names.get(length) ?? []) {\n              const distance = boundedNameDistance(token, name, limit);\n              if (distance > limit) continue;\n              for (const id of ids)\n                if (!exact.has(id)) distances.set(id, Math.min(distances.get(id) ?? Infinity, distance));\n            }\n          }\n          for (const [id, distance] of distances) {\n            found.add(id);\n            penalties.set(id, (penalties.get(id) ?? 0) + 10 * distance);\n            similarPaths.add(documents[id].path);\n          }\n        }\n        candidates = candidates === undefined ? found : new Set([...candidates].filter((id) => found.has(id)));\n        if (!candidates.size) return [];\n      }\n      lastResults = rankResources(\n        candidates === undefined ? [...documents] : [...candidates].map((id) => documents[id]),\n        tokens,\n      );\n      const penaltyByPath = new Map([...penalties].map(([id, penalty]) => [documents[id].path, penalty]));\n      lastResults.sort((left, right) => (penaltyByPath.get(left.path) ?? 0) - (penaltyByPath.get(right.path) ?? 0));\n      return lastResults;\n    },\n    nameParts(resource: SearchResource): boolean {\n      return partsPaths.has(resource.path);\n    },\n    similarName(resource: SearchResource): boolean {\n      return similarPaths.has(resource.path);\n    },\n    snippet(resource: SearchResource, query: string): SearchField | undefined {\n      const tokens = queryTokens(query);\n      const identity = metadata.get(resource.path) ?? \"\";\n      const bodyTokens = tokens.filter((token) => !identity.includes(token));\n      if (!bodyTokens.length) return;\n      const field = snippets\n        .get(resource.path)\n        ?.find((item) => bodyTokens.some((token) => item.text.toLocaleLowerCase().includes(token)));\n      if (!field) return;\n      const offset = Math.max(\n        0,\n        Math.min(\n          ...bodyTokens.map((token) => field.text.toLocaleLowerCase().indexOf(token)).filter((index) => index >= 0),\n        ) - 35,\n      );\n      return {\n        label: field.label,\n        text:\n          (offset ? \"…\" : \"\") + field.text.slice(offset, offset + 150) + (field.text.length > offset + 150 ? \"…\" : \"\"),\n      };\n    },\n  };\n}\n\nexport function matchResources(resources: SearchResource[], query: string): SearchResource[] {\n  return createResourceSearchIndex(resources).search(query);\n}\n\nexport function createDoubleShift() {\n  let last = 0;\n  let held = false;\n  const otherKeys = new Set<string>();\n  return (\n    event: Pick<KeyboardEvent, \"key\" | \"type\" | \"repeat\" | \"altKey\" | \"ctrlKey\" | \"metaKey\"> &\n      Partial<Pick<KeyboardEvent, \"code\">>,\n    now: number,\n  ) => {\n    const physicalKey = event.code || event.key;\n    if (event.type === \"keyup\") {\n      if (event.key === \"Shift\") held = false;\n      else otherKeys.delete(physicalKey);\n      if (event.key === \"Meta\") {\n        otherKeys.clear();\n        held = false;\n        last = 0;\n      }\n      return false;\n    }\n    if (event.key !== \"Shift\") otherKeys.add(physicalKey);\n    if (event.key !== \"Shift\" || otherKeys.size > 0 || event.altKey || event.ctrlKey || event.metaKey) {\n      last = 0;\n      return false;\n    }\n    if (event.repeat || held) return false;\n    held = true;\n    const hit = last > 0 && now - last <= 400;\n    last = hit ? 0 : now;\n    return hit;\n  };\n}\n"],"mappings":";;AAaA,IAAa,qCAAqC;AAClD,IAAa,eAAe,UAC1B,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO;AAC5E,IAAM,gBAAgB,aACpB;CACE,SAAS;CACT,GAAI,SAAS,WAAW,CAAC;CACzB,SAAS;CACT,SAAS,aAAa;CACtB,GAAG,OAAO,QAAQ,SAAS,MAAM,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,GAAG,IAAI,GAAG,OAAO;AAC5E,CAAC,CAAC,KAAK,GAAG;AACZ,SAAS,cAAc,WAA6B,QAAkB;CACpE,MAAM,SAAS,aACb,OAAO,QAAQ,OAAO,UAAU;EAC9B,MAAM,OAAO,SAAS,KAAK,kBAAkB;EAC7C,MAAM,OAAO,SAAS,KAAK,kBAAkB;EAC7C,MAAM,aAAa,SAAS,aAAa,GAAA,CAAI,kBAAkB;EAC/D,OACE,SACC,SAAS,QACN,IACA,KAAK,WAAW,KAAK,IACnB,IACA,SAAS,QACP,IACA,KAAK,SAAS,KAAK,IACjB,IACA,KAAK,SAAS,KAAK,IACjB,IACA,UAAU,SAAS,KAAK,IACtB,IACA;CAElB,GAAG,CAAC;CAEN,OAAO,UAAU,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,KAAK,cAAc,EAAE,IAAI,KAAK,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AACrH;AAEA,SAAgB,0BAA0B,WAA6B;CACrE,MAAM,YAAY;CAClB,MAAM,6BAAa,IAAI,IAAyB;CAChD,MAAM,wBAAQ,IAAI,IAAsC;CACxD,IAAI;CACJ,IAAI,cAAgC,CAAC;CACrC,IAAI,+BAAe,IAAI,IAAY;CACnC,IAAI,6BAAa,IAAI,IAAY;CACjC,MAAM,4BAAY,IAAI,IAAsB;CAC5C,MAAM,iCAAiB,IAAI,IAAyB;CACpD,MAAM,2BAAW,IAAI,IAA2B;CAChD,MAAM,2BAAW,IAAI,IAAoB;CACzC,UAAU,SAAS,UAAU,OAAO;EAClC,MAAM,QAAQ,SAAS,KAAK,kBAAkB,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,MAAM,GAAG,EAAE;EAC1F,UAAU,IAAI,IAAI,KAAK;EACvB,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,MAAM,eAAe,IAAI,IAAI;GACjC,IAAI,CAAC,KAAK;IACR,sBAAM,IAAI,IAAI;IACd,eAAe,IAAI,MAAM,GAAG;GAC9B;GACA,IAAI,IAAI,EAAE;EACZ;EACA,KAAK,MAAM,QAAQ,IAAI,IACrB,CAAC,SAAS,MAAM,GAAG,SAAS,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,KAAK,SAAS,KAAK,kBAAkB,CAAC,CACxF,GAAG;GACD,IAAI,KAAK,SAAS,KAAK,KAAK,SAAS,IAAI;GACzC,IAAI,SAAS,MAAM,IAAI,KAAK,MAAM;GAClC,IAAI,CAAC,QAAQ;IACX,yBAAS,IAAI,IAAI;IACjB,MAAM,IAAI,KAAK,QAAQ,MAAM;GAC/B;GACA,IAAI,MAAM,OAAO,IAAI,IAAI;GACzB,IAAI,CAAC,KAAK;IACR,sBAAM,IAAI,IAAI;IACd,OAAO,IAAI,MAAM,GAAG;GACtB;GACA,IAAI,IAAI,EAAE;EACZ;EACA,MAAM,WAAW,aAAa,QAAQ,CAAC,CAAC,MAAM,GAAG,kCAAkC;EACnF,SAAS,IAAI,SAAS,MAAM,SAAS,kBAAkB,CAAC;EACxD,IAAI,YAAY,qCAAqC,SAAS;EAC9D,MAAM,SAAwB,CAAC;EAC/B,KAAK,MAAM,SAAS,SAAS,UAAU,CAAC,GAAG;GACzC,IAAI,aAAa,GAAG;GACpB,MAAM,OAAO,MAAM,KAAK,MAAM,GAAG,YAAY,CAAC;GAC9C,OAAO,KAAK;IAAE,OAAO,MAAM;IAAO;GAAK,CAAC;GACxC,aAAa,KAAK,SAAS;EAC7B;EACA,SAAS,IAAI,SAAS,MAAM,MAAM;EAClC,KAAK,MAAM,QAAQ,IAAI,IACrB,CAAC,UAAU,GAAG,OAAO,KAAK,UAAU,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,kBAAkB,CAAC,CAAC,MAAM,KAAK,CAC5F,GAAG;GACD,IAAI,CAAC,MAAM;GACX,IAAI,MAAM,WAAW,IAAI,IAAI;GAC7B,IAAI,CAAC,KAAK;IACR,sBAAM,IAAI,IAAI;IACd,WAAW,IAAI,MAAM,GAAG;GAC1B;GACA,IAAI,IAAI,EAAE;EACZ;CACF,CAAC;CACD,OAAO;EACL,OAAO,OAAiC;GACtC,QAAQ,MAAM,MAAM,GAAG,GAAG;GAC1B,IAAI,cAAc,OAAO,OAAO;GAChC,YAAY;GACZ,+BAAe,IAAI,IAAI;GACvB,6BAAa,IAAI,IAAI;GACrB,cAAc,CAAC;GACf,MAAM,SAAS,YAAY,KAAK;GAChC,MAAM,4BAAY,IAAI,IAAoB;GAC1C,IAAI;GACJ,KAAK,MAAM,SAAS,QAAQ;IAC1B,MAAM,wBAAQ,IAAI,IAAY;IAC9B,KAAK,MAAM,CAAC,MAAM,QAAQ,YAAY,IAAI,KAAK,SAAS,KAAK,GAAG,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,EAAE;IAClG,IAAI,iCAAiC,KAAK,KAAK,GAAG;KAChD,MAAM,QAAQ,MAAM,MAAM,OAAO;KACjC,IAAI,MAAM,UAAU,IAAI;MACtB,IAAI;MACJ,KAAK,MAAM,QAAQ,OAAO;OACxB,MAAM,MAAM,eAAe,IAAI,IAAI,qBAAK,IAAI,IAAY;OACxD,WAAW,aAAa,KAAA,IAAY,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,QAAQ,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;MAC7F;MACA,KAAK,MAAM,MAAM,YAAY,CAAC,GAAG;OAC/B,IAAI,MAAM,IAAI,EAAE,GAAG;OACnB,IAAI,SAAS;OACb,KAAK,MAAM,QAAQ,UAAU,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,SAAS,MAAM,SAAS;OACxE,IAAI,WAAW,MAAM,QAAQ;QAC3B,MAAM,IAAI,EAAE;QACZ,UAAU,IAAI,KAAK,UAAU,IAAI,EAAE,KAAK,KAAK,CAAC;QAC9C,WAAW,IAAI,UAAU,GAAG,CAAC,IAAI;OACnC;MACF;KACF;IACF;IACA,MAAM,QAAQ,IAAI,IAAI,KAAK;IAC3B,MAAM,QAAQ,MAAM,UAAU,KAAK,MAAM,UAAU,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,UAAU,IAAI,IAAI;IACzG,IAAI,OAAO;KACT,MAAM,4BAAY,IAAI,IAAoB;KAC1C,KAAK,IAAI,SAAS,MAAM,SAAS,OAAO,UAAU,MAAM,SAAS,OAAO,UACtE,KAAK,MAAM,CAAC,MAAM,QAAQ,MAAM,IAAI,MAAM,KAAK,CAAC,GAAG;MACjD,MAAM,WAAW,iCAAA,oBAAoB,OAAO,MAAM,KAAK;MACvD,IAAI,WAAW,OAAO;MACtB,KAAK,MAAM,MAAM,KACf,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG,UAAU,IAAI,IAAI,KAAK,IAAI,UAAU,IAAI,EAAE,KAAK,UAAU,QAAQ,CAAC;KAC3F;KAEF,KAAK,MAAM,CAAC,IAAI,aAAa,WAAW;MACtC,MAAM,IAAI,EAAE;MACZ,UAAU,IAAI,KAAK,UAAU,IAAI,EAAE,KAAK,KAAK,KAAK,QAAQ;MAC1D,aAAa,IAAI,UAAU,GAAG,CAAC,IAAI;KACrC;IACF;IACA,aAAa,eAAe,KAAA,IAAY,QAAQ,IAAI,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,QAAQ,OAAO,MAAM,IAAI,EAAE,CAAC,CAAC;IACrG,IAAI,CAAC,WAAW,MAAM,OAAO,CAAC;GAChC;GACA,cAAc,cACZ,eAAe,KAAA,IAAY,CAAC,GAAG,SAAS,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,KAAK,OAAO,UAAU,GAAG,GACrF,MACF;GACA,MAAM,gBAAgB,IAAI,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,UAAU,GAAG,CAAC,MAAM,OAAO,CAAC,CAAC;GAClG,YAAY,MAAM,MAAM,WAAW,cAAc,IAAI,KAAK,IAAI,KAAK,MAAM,cAAc,IAAI,MAAM,IAAI,KAAK,EAAE;GAC5G,OAAO;EACT;EACA,UAAU,UAAmC;GAC3C,OAAO,WAAW,IAAI,SAAS,IAAI;EACrC;EACA,YAAY,UAAmC;GAC7C,OAAO,aAAa,IAAI,SAAS,IAAI;EACvC;EACA,QAAQ,UAA0B,OAAwC;GACxE,MAAM,SAAS,YAAY,KAAK;GAChC,MAAM,WAAW,SAAS,IAAI,SAAS,IAAI,KAAK;GAChD,MAAM,aAAa,OAAO,QAAQ,UAAU,CAAC,SAAS,SAAS,KAAK,CAAC;GACrE,IAAI,CAAC,WAAW,QAAQ;GACxB,MAAM,QAAQ,SACX,IAAI,SAAS,IAAI,CAAC,EACjB,MAAM,SAAS,WAAW,MAAM,UAAU,KAAK,KAAK,kBAAkB,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC;GAC5F,IAAI,CAAC,OAAO;GACZ,MAAM,SAAS,KAAK,IAClB,GACA,KAAK,IACH,GAAG,WAAW,KAAK,UAAU,MAAM,KAAK,kBAAkB,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,QAAQ,UAAU,SAAS,CAAC,CAC1G,IAAI,EACN;GACA,OAAO;IACL,OAAO,MAAM;IACb,OACG,SAAS,MAAM,MAAM,MAAM,KAAK,MAAM,QAAQ,SAAS,GAAG,KAAK,MAAM,KAAK,SAAS,SAAS,MAAM,MAAM;GAC7G;EACF;CACF;AACF;AAMA,SAAgB,oBAAoB;CAClC,IAAI,OAAO;CACX,IAAI,OAAO;CACX,MAAM,4BAAY,IAAI,IAAY;CAClC,QACE,OAEA,QACG;EACH,MAAM,cAAc,MAAM,QAAQ,MAAM;EACxC,IAAI,MAAM,SAAS,SAAS;GAC1B,IAAI,MAAM,QAAQ,SAAS,OAAO;QAC7B,UAAU,OAAO,WAAW;GACjC,IAAI,MAAM,QAAQ,QAAQ;IACxB,UAAU,MAAM;IAChB,OAAO;IACP,OAAO;GACT;GACA,OAAO;EACT;EACA,IAAI,MAAM,QAAQ,SAAS,UAAU,IAAI,WAAW;EACpD,IAAI,MAAM,QAAQ,WAAW,UAAU,OAAO,KAAK,MAAM,UAAU,MAAM,WAAW,MAAM,SAAS;GACjG,OAAO;GACP,OAAO;EACT;EACA,IAAI,MAAM,UAAU,MAAM,OAAO;EACjC,OAAO;EACP,MAAM,MAAM,OAAO,KAAK,MAAM,QAAQ;EACtC,OAAO,MAAM,IAAI;EACjB,OAAO;CACT;AACF"}

package/out/renderer/resource-search-routing.js

@@ -0,0 +1,78 @@
+const require_extensions = require("./_virtual/_global-external_@freelensapp/extensions.js");
+const require_resource_search_client = require("./resource-search-client.js");
+const require_resource_search_discovery = require("./resource-search-discovery.js");
+//#region src/renderer/resource-search-routing.ts
+var fallback;
+var openingEpoch = 0;
+function closeSearchResourceFallback() {
+	openingEpoch++;
+	fallback?.remove();
+	fallback = void 0;
+}
+async function openSearchResource(resource) {
+	closeSearchResourceFallback();
+	const epoch = openingEpoch;
+	const contextId = require_resource_search_client.searchContextId();
+	const clusterId = require_extensions.Renderer.Catalog.activeCluster.get()?.metadata.uid;
+	if (!clusterId) throw new Error("No active cluster");
+	const valid = () => epoch === openingEpoch && require_extensions.Renderer.Catalog.activeCluster.get()?.metadata.uid === clusterId && require_resource_search_client.searchContextId() === contextId;
+	await new Promise((resolve) => window.setTimeout(resolve, 0));
+	if (!valid()) return;
+	const selfLink = decodeURIComponent(resource.path);
+	const nativePath = new URL(selfLink, window.location.origin);
+	const api = nativePath.pathname === selfLink && !nativePath.search && !nativePath.hash ? require_extensions.Renderer.K8sApi.apiManager.getApi(selfLink) : void 0;
+	if (api && require_extensions.Renderer.K8sApi.apiManager.getStore(api)) {
+		await require_extensions.Renderer.Navigation.showDetails(selfLink);
+		return;
+	}
+	const transport = require_resource_search_client.createResourceSearchTransport(clusterId);
+	let metadata;
+	try {
+		metadata = await transport.get(resource.path, void 0, { Accept: "application/json;as=PartialObjectMetadata;g=meta.k8s.io;v=v1" });
+	} catch (error) {
+		if (!valid()) return;
+		if (require_resource_search_discovery.searchErrorStatus(error) !== 406 || !resource.group) throw error;
+		metadata = await transport.get(resource.path, void 0, { Accept: "application/json" });
+	}
+	if (!valid()) return;
+	const safe = require_resource_search_discovery.projectMetadataPage({
+		...resource,
+		namespaced: !!resource.namespace,
+		aliases: []
+	}, { items: [metadata] })[0];
+	if (!safe) throw new Error("Resource metadata unavailable");
+	closeSearchResourceFallback();
+	const dialog = document.createElement("dialog");
+	fallback = dialog;
+	dialog.setAttribute("aria-label", `${safe.kind} ${safe.name}`);
+	dialog.style.cssText = "max-width:640px;width:80%;padding:24px;background:var(--mainBackground,#222);color:var(--textColorPrimary,#eee);border:1px solid var(--borderColor,#555);border-radius:8px";
+	const title = document.createElement("h2");
+	title.textContent = `${safe.kind}: ${safe.name}`;
+	const description = document.createElement("p");
+	description.textContent = "Resource metadata. A native detail view is unavailable for this API.";
+	const fields = document.createElement("pre");
+	fields.style.cssText = "white-space:pre-wrap;overflow-wrap:anywhere";
+	fields.textContent = JSON.stringify({
+		apiVersion: [safe.group, safe.version].filter(Boolean).join("/"),
+		kind: safe.kind,
+		metadata: {
+			name: safe.name,
+			namespace: safe.namespace,
+			uid: safe.uid,
+			labels: safe.labels
+		}
+	}, null, 2);
+	const close = document.createElement("button");
+	close.type = "button";
+	close.textContent = "Close";
+	close.onclick = closeSearchResourceFallback;
+	dialog.append(title, description, fields, close);
+	dialog.addEventListener("close", closeSearchResourceFallback, { once: true });
+	document.body.append(dialog);
+	dialog.showModal();
+}
+//#endregion
+exports.closeSearchResourceFallback = closeSearchResourceFallback;
+exports.openSearchResource = openSearchResource;
+
+//# sourceMappingURL=resource-search-routing.js.map

package/out/renderer/resource-search-routing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resource-search-routing.js","names":[],"sources":["../../src/renderer/resource-search-routing.ts"],"sourcesContent":["import { Renderer } from \"@freelensapp/extensions\";\nimport { createResourceSearchTransport, searchContextId } from \"./resource-search-client\";\nimport { projectMetadataPage, searchErrorStatus } from \"./resource-search-discovery\";\n\nimport type { SearchDocument } from \"../common/resource-search\";\n\nlet fallback: HTMLDialogElement | undefined;\nlet openingEpoch = 0;\nexport function closeSearchResourceFallback() {\n  openingEpoch++;\n  fallback?.remove();\n  fallback = undefined;\n}\nexport async function openSearchResource(resource: SearchDocument): Promise<void> {\n  closeSearchResourceFallback();\n  const epoch = openingEpoch;\n  const contextId = searchContextId();\n  const clusterId = Renderer.Catalog.activeCluster.get()?.metadata.uid;\n  if (!clusterId) throw new Error(\"No active cluster\");\n  const valid = () =>\n    epoch === openingEpoch &&\n    Renderer.Catalog.activeCluster.get()?.metadata.uid === clusterId &&\n    searchContextId() === contextId;\n  await new Promise<void>((resolve) => window.setTimeout(resolve, 0));\n  if (!valid()) return;\n  // native stores parse raw self-links without decoding names, while HTTP requests use the encoded path\n  const selfLink = decodeURIComponent(resource.path);\n  const nativePath = new URL(selfLink, window.location.origin);\n  const nativeCompatible = nativePath.pathname === selfLink && !nativePath.search && !nativePath.hash;\n  const api = nativeCompatible ? Renderer.K8sApi.apiManager.getApi(selfLink) : undefined;\n  if (api && Renderer.K8sApi.apiManager.getStore(api)) {\n    await Renderer.Navigation.showDetails(selfLink);\n    return;\n  }\n  const transport = createResourceSearchTransport(clusterId);\n  let metadata: { metadata?: { name?: string; namespace?: string; uid?: string; labels?: Record<string, unknown> } };\n  try {\n    metadata = await transport.get(resource.path, undefined, {\n      Accept: \"application/json;as=PartialObjectMetadata;g=meta.k8s.io;v=v1\",\n    });\n  } catch (error) {\n    if (!valid()) return;\n    if (searchErrorStatus(error) !== 406 || !resource.group) throw error;\n    metadata = await transport.get(resource.path, undefined, { Accept: \"application/json\" });\n  }\n  if (!valid()) return;\n  const safe = projectMetadataPage(\n    { ...resource, namespaced: !!resource.namespace, aliases: [] },\n    { items: [metadata] },\n  )[0];\n  if (!safe) throw new Error(\"Resource metadata unavailable\");\n  closeSearchResourceFallback();\n  const dialog = document.createElement(\"dialog\");\n  fallback = dialog;\n  dialog.setAttribute(\"aria-label\", `${safe.kind} ${safe.name}`);\n  dialog.style.cssText =\n    \"max-width:640px;width:80%;padding:24px;background:var(--mainBackground,#222);color:var(--textColorPrimary,#eee);border:1px solid var(--borderColor,#555);border-radius:8px\";\n  const title = document.createElement(\"h2\");\n  title.textContent = `${safe.kind}: ${safe.name}`;\n  const description = document.createElement(\"p\");\n  description.textContent = \"Resource metadata. A native detail view is unavailable for this API.\";\n  const fields = document.createElement(\"pre\");\n  fields.style.cssText = \"white-space:pre-wrap;overflow-wrap:anywhere\";\n  fields.textContent = JSON.stringify(\n    {\n      apiVersion: [safe.group, safe.version].filter(Boolean).join(\"/\"),\n      kind: safe.kind,\n      metadata: { name: safe.name, namespace: safe.namespace, uid: safe.uid, labels: safe.labels },\n    },\n    null,\n    2,\n  );\n  const close = document.createElement(\"button\");\n  close.type = \"button\";\n  close.textContent = \"Close\";\n  close.onclick = closeSearchResourceFallback;\n  dialog.append(title, description, fields, close);\n  dialog.addEventListener(\"close\", closeSearchResourceFallback, { once: true });\n  document.body.append(dialog);\n  dialog.showModal();\n}\n"],"mappings":";;;;AAMA,IAAI;AACJ,IAAI,eAAe;AACnB,SAAgB,8BAA8B;CAC5C;CACA,UAAU,OAAO;CACjB,WAAW,KAAA;AACb;AACA,eAAsB,mBAAmB,UAAyC;CAChF,4BAA4B;CAC5B,MAAM,QAAQ;CACd,MAAM,YAAY,+BAAA,gBAAgB;CAClC,MAAM,YAAY,mBAAA,SAAS,QAAQ,cAAc,IAAI,CAAC,EAAE,SAAS;CACjE,IAAI,CAAC,WAAW,MAAM,IAAI,MAAM,mBAAmB;CACnD,MAAM,cACJ,UAAU,gBACV,mBAAA,SAAS,QAAQ,cAAc,IAAI,CAAC,EAAE,SAAS,QAAQ,aACvD,+BAAA,gBAAgB,MAAM;CACxB,MAAM,IAAI,SAAe,YAAY,OAAO,WAAW,SAAS,CAAC,CAAC;CAClE,IAAI,CAAC,MAAM,GAAG;CAEd,MAAM,WAAW,mBAAmB,SAAS,IAAI;CACjD,MAAM,aAAa,IAAI,IAAI,UAAU,OAAO,SAAS,MAAM;CAE3D,MAAM,MADmB,WAAW,aAAa,YAAY,CAAC,WAAW,UAAU,CAAC,WAAW,OAChE,mBAAA,SAAS,OAAO,WAAW,OAAO,QAAQ,IAAI,KAAA;CAC7E,IAAI,OAAO,mBAAA,SAAS,OAAO,WAAW,SAAS,GAAG,GAAG;EACnD,MAAM,mBAAA,SAAS,WAAW,YAAY,QAAQ;EAC9C;CACF;CACA,MAAM,YAAY,+BAAA,8BAA8B,SAAS;CACzD,IAAI;CACJ,IAAI;EACF,WAAW,MAAM,UAAU,IAAI,SAAS,MAAM,KAAA,GAAW,EACvD,QAAQ,+DACV,CAAC;CACH,SAAS,OAAO;EACd,IAAI,CAAC,MAAM,GAAG;EACd,IAAI,kCAAA,kBAAkB,KAAK,MAAM,OAAO,CAAC,SAAS,OAAO,MAAM;EAC/D,WAAW,MAAM,UAAU,IAAI,SAAS,MAAM,KAAA,GAAW,EAAE,QAAQ,mBAAmB,CAAC;CACzF;CACA,IAAI,CAAC,MAAM,GAAG;CACd,MAAM,OAAO,kCAAA,oBACX;EAAE,GAAG;EAAU,YAAY,CAAC,CAAC,SAAS;EAAW,SAAS,CAAC;CAAE,GAC7D,EAAE,OAAO,CAAC,QAAQ,EAAE,CACtB,CAAC,CAAC;CACF,IAAI,CAAC,MAAM,MAAM,IAAI,MAAM,+BAA+B;CAC1D,4BAA4B;CAC5B,MAAM,SAAS,SAAS,cAAc,QAAQ;CAC9C,WAAW;CACX,OAAO,aAAa,cAAc,GAAG,KAAK,KAAK,GAAG,KAAK,MAAM;CAC7D,OAAO,MAAM,UACX;CACF,MAAM,QAAQ,SAAS,cAAc,IAAI;CACzC,MAAM,cAAc,GAAG,KAAK,KAAK,IAAI,KAAK;CAC1C,MAAM,cAAc,SAAS,cAAc,GAAG;CAC9C,YAAY,cAAc;CAC1B,MAAM,SAAS,SAAS,cAAc,KAAK;CAC3C,OAAO,MAAM,UAAU;CACvB,OAAO,cAAc,KAAK,UACxB;EACE,YAAY,CAAC,KAAK,OAAO,KAAK,OAAO,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG;EAC/D,MAAM,KAAK;EACX,UAAU;GAAE,MAAM,KAAK;GAAM,WAAW,KAAK;GAAW,KAAK,KAAK;GAAK,QAAQ,KAAK;EAAO;CAC7F,GACA,MACA,CACF;CACA,MAAM,QAAQ,SAAS,cAAc,QAAQ;CAC7C,MAAM,OAAO;CACb,MAAM,cAAc;CACpB,MAAM,UAAU;CAChB,OAAO,OAAO,OAAO,aAAa,QAAQ,KAAK;CAC/C,OAAO,iBAAiB,SAAS,6BAA6B,EAAE,MAAM,KAAK,CAAC;CAC5E,SAAS,KAAK,OAAO,MAAM;CAC3B,OAAO,UAAU;AACnB"}

package/out/renderer/resource-search-sync.js

@@ -0,0 +1,199 @@
+const require_resource_search_discovery = require("./resource-search-discovery.js");
+//#region src/renderer/resource-search-sync.ts
+var SEARCH_STORAGE_FULL_MESSAGE = "Search storage is full; clear the local search cache to continue";
+var isSearchStorageFull = (error) => error instanceof Error && error.message.endsWith("Search storage is full; clear the local search cache to continue");
+var metadataAccept = { Accept: "application/json;as=PartialObjectMetadataList;g=meta.k8s.io;v=v1" };
+function createSearchSynchronizer(options) {
+	const { transport, sink, signal } = options;
+	const status = {
+		scanned: 0,
+		discovered: 0,
+		denied: 0,
+		unavailable: 0,
+		unsupported: 0,
+		indexing: true
+	};
+	const emit = () => options.onStatus({ ...status });
+	const delay = options.delay ?? ((milliseconds) => new Promise((resolve) => {
+		if (signal.aborted) {
+			resolve();
+			return;
+		}
+		const done = () => {
+			clearTimeout(timer);
+			signal.removeEventListener("abort", done);
+			resolve();
+		};
+		const timer = setTimeout(done, milliseconds);
+		signal.addEventListener("abort", done, { once: true });
+	}));
+	let sequence = 0;
+	let nextRequest = 0;
+	const request = async (path, query, headers) => {
+		await delay(Math.max(0, nextRequest - Date.now()));
+		if (signal.aborted) throw new Error("Search synchronization canceled");
+		nextRequest = Date.now() + 500;
+		for (let attempt = 0;; attempt++) try {
+			return await transport.get(path, query, headers);
+		} catch (error) {
+			const code = require_resource_search_discovery.searchErrorStatus(error);
+			if (signal.aborted || attempt >= 3 || code !== 429 && code < 500) throw error;
+			const retry = error.retryAfter;
+			const retryMilliseconds = retry ? /^\d+$/.test(retry) ? Number(retry) * 1e3 : Date.parse(retry) - Date.now() : NaN;
+			await delay(Number.isFinite(retryMilliseconds) ? Math.min(864e5, Math.max(0, retryMilliseconds)) : Math.min(3e4, 1e3 * 2 ** attempt) + Math.random() * 250);
+		}
+	};
+	const limited = { get: request };
+	const scan = async (type, namespace) => {
+		const scope = `${type.group}/${type.resource}/${namespace ?? "*"}`;
+		for (let restart = 0; restart < 2; restart++) {
+			const scanId = `${Date.now()}-${++sequence}`;
+			await sink.begin(scope, scanId);
+			let continuation = "";
+			let pageSize = 250;
+			const seen = /* @__PURE__ */ new Set();
+			try {
+				do {
+					let page;
+					for (;;) {
+						const query = {
+							limit: pageSize,
+							...continuation ? { continue: continuation } : {}
+						};
+						try {
+							try {
+								page = await request(require_resource_search_discovery.collectionPath(type, namespace), query, metadataAccept);
+							} catch (error) {
+								if (require_resource_search_discovery.searchErrorStatus(error) !== 406 || !type.group) throw error;
+								page = await request(require_resource_search_discovery.collectionPath(type, namespace), query, { Accept: "application/json" });
+							}
+							break;
+						} catch (error) {
+							if (!error.oversized || pageSize === 1) throw error;
+							pageSize = Math.max(1, Math.floor(pageSize / 2));
+						}
+					}
+					if (signal.aborted) return;
+					const documents = require_resource_search_discovery.projectMetadataPage(type, page);
+					status.namespaces = [.../* @__PURE__ */ new Set([...status.namespaces ?? [], ...documents.flatMap((document) => document.namespace ? [document.namespace] : [])])].sort();
+					await sink.append(scope, scanId, documents);
+					continuation = page.metadata?.continue ?? "";
+					if (continuation && seen.has(continuation)) throw new Error("Repeated inventory continuation");
+					seen.add(continuation);
+				} while (continuation);
+				if (!signal.aborted) await sink.complete(scope, scanId);
+				return;
+			} catch (error) {
+				const code = require_resource_search_discovery.searchErrorStatus(error);
+				if (code === 410 && restart === 0) continue;
+				if (code === 403) await sink.invalidate(scope);
+				throw error;
+			}
+		}
+	};
+	return { async run() {
+		try {
+			while (!signal.aborted) {
+				status.indexing = true;
+				status.scanned = 0;
+				status.denied = 0;
+				status.unavailable = 0;
+				status.unsupported = 0;
+				status.message = void 0;
+				emit();
+				let discoveryFailures = 0;
+				const collections = await require_resource_search_discovery.discoverSearchCollections(limited, () => {
+					discoveryFailures++;
+					status.unavailable++;
+					emit();
+				});
+				if (signal.aborted) return;
+				if (discoveryFailures === 0) await sink.reconcile?.(collections.map((type) => `${type.group}/${type.resource}`));
+				else status.message = "API discovery incomplete; cached resource types may be stale";
+				status.kinds = [...new Set(collections.map((type) => type.kind))].sort();
+				status.discovered = collections.length;
+				emit();
+				let fallbackNamespaces;
+				for (const type of collections) {
+					if (signal.aborted) return;
+					try {
+						await scan(type);
+					} catch (error) {
+						if (signal.aborted) return;
+						if (isSearchStorageFull(error)) throw error;
+						if (require_resource_search_discovery.searchErrorStatus(error) === 403) {
+							status.denied++;
+							if (type.namespaced) {
+								let namespaces = fallbackNamespaces ?? options.namespaces?.() ?? [];
+								if (fallbackNamespaces === void 0) {
+									try {
+										const namespaceType = {
+											group: "",
+											version: "v1",
+											resource: "namespaces",
+											kind: "Namespace",
+											namespaced: false,
+											aliases: []
+										};
+										let token = "";
+										let limit = 250;
+										const seen = /* @__PURE__ */ new Set();
+										do {
+											let page;
+											for (;;) try {
+												page = await request(require_resource_search_discovery.collectionPath(namespaceType), {
+													limit,
+													...token ? { continue: token } : {}
+												}, metadataAccept);
+												break;
+											} catch (error) {
+												if (!error.oversized || limit === 1) throw error;
+												limit = Math.max(1, Math.floor(limit / 2));
+											}
+											namespaces = [.../* @__PURE__ */ new Set([...namespaces, ...(page.items ?? []).flatMap((item) => item.metadata?.name ? [item.metadata.name] : [])])];
+											token = page.metadata?.continue ?? "";
+											if (token && seen.has(token)) throw new Error("Repeated namespace continuation");
+											seen.add(token);
+										} while (token);
+									} catch {
+										status.message = "Namespace discovery denied or incomplete; add a known namespace to continue";
+									}
+									fallbackNamespaces = namespaces;
+								}
+								for (const namespace of namespaces) {
+									if (signal.aborted) return;
+									try {
+										await scan(type, namespace);
+									} catch (failure) {
+										if (isSearchStorageFull(failure)) throw failure;
+										if (require_resource_search_discovery.searchErrorStatus(failure) === 403) status.denied++;
+										else status.unavailable++;
+									}
+								}
+							}
+						} else if (require_resource_search_discovery.searchErrorStatus(error) === 406) status.unsupported++;
+						else status.unavailable++;
+					}
+					status.scanned++;
+					emit();
+				}
+				status.indexing = false;
+				status.completedAt = Date.now();
+				emit();
+				await delay(options.refreshMs ?? 600 * 1e3);
+			}
+		} catch (error) {
+			if (!isSearchStorageFull(error)) throw error;
+			status.indexing = false;
+			status.storageFull = true;
+			status.message = SEARCH_STORAGE_FULL_MESSAGE;
+			emit();
+		}
+	} };
+}
+//#endregion
+exports.SEARCH_STORAGE_FULL_MESSAGE = SEARCH_STORAGE_FULL_MESSAGE;
+exports.createSearchSynchronizer = createSearchSynchronizer;
+exports.isSearchStorageFull = isSearchStorageFull;
+
+//# sourceMappingURL=resource-search-sync.js.map

package/out/renderer/resource-search-sync.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resource-search-sync.js","names":[],"sources":["../../src/renderer/resource-search-sync.ts"],"sourcesContent":["import {\n  collectionPath,\n  discoverSearchCollections,\n  type MetadataPage,\n  projectMetadataPage,\n  type SearchCollection,\n  type SearchTransport,\n  searchErrorStatus,\n} from \"./resource-search-discovery\";\n\nimport type { SearchDocument } from \"../common/resource-search\";\n\nexport interface SearchSink {\n  begin(scope: string, scanId: string): Promise<unknown>;\n  append(scope: string, scanId: string, documents: SearchDocument[]): Promise<unknown>;\n  complete(scope: string, scanId: string): Promise<unknown>;\n  invalidate(scope: string): Promise<unknown>;\n  reconcile?(resources: string[]): Promise<unknown>;\n}\nexport interface SearchCoverage {\n  scanned: number;\n  discovered: number;\n  denied: number;\n  unavailable: number;\n  unsupported: number;\n  indexing: boolean;\n  message?: string;\n  kinds?: string[];\n  namespaces?: string[];\n  completedAt?: number;\n  storageFull?: boolean;\n}\nexport const SEARCH_STORAGE_FULL_MESSAGE = \"Search storage is full; clear the local search cache to continue\";\nexport const isSearchStorageFull = (error: unknown): boolean =>\n  error instanceof Error && error.message.endsWith(SEARCH_STORAGE_FULL_MESSAGE);\nconst metadataAccept = { Accept: \"application/json;as=PartialObjectMetadataList;g=meta.k8s.io;v=v1\" };\nexport function createSearchSynchronizer(options: {\n  transport: SearchTransport;\n  sink: SearchSink;\n  signal: AbortSignal;\n  onStatus(status: SearchCoverage): void;\n  namespaces?: () => string[];\n  delay?: (milliseconds: number) => Promise<void>;\n  refreshMs?: number;\n}) {\n  const { transport, sink, signal } = options;\n  const status: SearchCoverage = {\n    scanned: 0,\n    discovered: 0,\n    denied: 0,\n    unavailable: 0,\n    unsupported: 0,\n    indexing: true,\n  };\n  const emit = () => options.onStatus({ ...status });\n  const delay =\n    options.delay ??\n    ((milliseconds: number) =>\n      new Promise<void>((resolve) => {\n        if (signal.aborted) {\n          resolve();\n          return;\n        }\n        const done = () => {\n          clearTimeout(timer);\n          signal.removeEventListener(\"abort\", done);\n          resolve();\n        };\n        const timer = setTimeout(done, milliseconds);\n        signal.addEventListener(\"abort\", done, { once: true });\n      }));\n  let sequence = 0;\n  let nextRequest = 0;\n  const request = async <T>(\n    path: string,\n    query?: Record<string, string | number>,\n    headers?: Record<string, string>,\n  ): Promise<T> => {\n    await delay(Math.max(0, nextRequest - Date.now()));\n    if (signal.aborted) throw new Error(\"Search synchronization canceled\");\n    nextRequest = Date.now() + 500;\n    for (let attempt = 0; ; attempt++) {\n      try {\n        return await transport.get<T>(path, query, headers);\n      } catch (error) {\n        const code = searchErrorStatus(error);\n        if (signal.aborted || attempt >= 3 || (code !== 429 && code < 500)) throw error;\n        const retry = (error as { headers?: { get?(name: string): string | null }; retryAfter?: string }).retryAfter;\n        const retryMilliseconds = retry\n          ? /^\\d+$/.test(retry)\n            ? Number(retry) * 1000\n            : Date.parse(retry) - Date.now()\n          : NaN;\n        await delay(\n          Number.isFinite(retryMilliseconds)\n            ? Math.min(86400000, Math.max(0, retryMilliseconds))\n            : Math.min(30000, 1000 * 2 ** attempt) + Math.random() * 250,\n        );\n      }\n    }\n  };\n  const limited: SearchTransport = { get: request };\n  const scan = async (type: SearchCollection, namespace?: string): Promise<void> => {\n    const scope = `${type.group}/${type.resource}/${namespace ?? \"*\"}`;\n    for (let restart = 0; restart < 2; restart++) {\n      const scanId = `${Date.now()}-${++sequence}`;\n      await sink.begin(scope, scanId);\n      let continuation = \"\";\n      let pageSize = 250;\n      const seen = new Set<string>();\n      try {\n        do {\n          let page: MetadataPage;\n          for (;;) {\n            const query = { limit: pageSize, ...(continuation ? { continue: continuation } : {}) };\n            try {\n              try {\n                page = await request<MetadataPage>(collectionPath(type, namespace), query, metadataAccept);\n              } catch (error) {\n                if (searchErrorStatus(error) !== 406 || !type.group) throw error;\n                page = await request<MetadataPage>(collectionPath(type, namespace), query, {\n                  Accept: \"application/json\",\n                });\n              }\n              break;\n            } catch (error) {\n              if (!(error as { oversized?: boolean }).oversized || pageSize === 1) throw error;\n              pageSize = Math.max(1, Math.floor(pageSize / 2));\n            }\n          }\n          if (signal.aborted) return;\n          const documents = projectMetadataPage(type, page);\n          status.namespaces = [\n            ...new Set([\n              ...(status.namespaces ?? []),\n              ...documents.flatMap((document) => (document.namespace ? [document.namespace] : [])),\n            ]),\n          ].sort();\n          await sink.append(scope, scanId, documents);\n          continuation = page.metadata?.continue ?? \"\";\n          if (continuation && seen.has(continuation)) throw new Error(\"Repeated inventory continuation\");\n          seen.add(continuation);\n        } while (continuation);\n        if (!signal.aborted) await sink.complete(scope, scanId);\n        return;\n      } catch (error) {\n        const code = searchErrorStatus(error);\n        if (code === 410 && restart === 0) continue;\n        if (code === 403) await sink.invalidate(scope);\n        throw error;\n      }\n    }\n  };\n  return {\n    async run(): Promise<void> {\n      try {\n        while (!signal.aborted) {\n          status.indexing = true;\n          status.scanned = 0;\n          status.denied = 0;\n          status.unavailable = 0;\n          status.unsupported = 0;\n          status.message = undefined;\n          emit();\n          let discoveryFailures = 0;\n          const collections = await discoverSearchCollections(limited, () => {\n            discoveryFailures++;\n            status.unavailable++;\n            emit();\n          });\n          if (signal.aborted) return;\n          if (discoveryFailures === 0)\n            await sink.reconcile?.(collections.map((type) => `${type.group}/${type.resource}`));\n          else status.message = \"API discovery incomplete; cached resource types may be stale\";\n          status.kinds = [...new Set(collections.map((type) => type.kind))].sort();\n          status.discovered = collections.length;\n          emit();\n          let fallbackNamespaces: string[] | undefined;\n          for (const type of collections) {\n            if (signal.aborted) return;\n            try {\n              await scan(type);\n            } catch (error) {\n              if (signal.aborted) return;\n              if (isSearchStorageFull(error)) throw error;\n              if (searchErrorStatus(error) === 403) {\n                status.denied++;\n                if (type.namespaced) {\n                  let namespaces = fallbackNamespaces ?? options.namespaces?.() ?? [];\n                  if (fallbackNamespaces === undefined) {\n                    try {\n                      const namespaceType: SearchCollection = {\n                        group: \"\",\n                        version: \"v1\",\n                        resource: \"namespaces\",\n                        kind: \"Namespace\",\n                        namespaced: false,\n                        aliases: [],\n                      };\n                      let token = \"\";\n                      let limit = 250;\n                      const seen = new Set<string>();\n                      do {\n                        let page: MetadataPage;\n                        for (;;) {\n                          try {\n                            page = await request<MetadataPage>(\n                              collectionPath(namespaceType),\n                              { limit, ...(token ? { continue: token } : {}) },\n                              metadataAccept,\n                            );\n                            break;\n                          } catch (error) {\n                            if (!(error as { oversized?: boolean }).oversized || limit === 1) throw error;\n                            limit = Math.max(1, Math.floor(limit / 2));\n                          }\n                        }\n                        namespaces = [\n                          ...new Set([\n                            ...namespaces,\n                            ...(page.items ?? []).flatMap((item) => (item.metadata?.name ? [item.metadata.name] : [])),\n                          ]),\n                        ];\n                        token = page.metadata?.continue ?? \"\";\n                        if (token && seen.has(token)) throw new Error(\"Repeated namespace continuation\");\n                        seen.add(token);\n                      } while (token);\n                    } catch {\n                      status.message = \"Namespace discovery denied or incomplete; add a known namespace to continue\";\n                    }\n                    fallbackNamespaces = namespaces;\n                  }\n                  for (const namespace of namespaces) {\n                    if (signal.aborted) return;\n                    try {\n                      await scan(type, namespace);\n                    } catch (failure) {\n                      if (isSearchStorageFull(failure)) throw failure;\n                      if (searchErrorStatus(failure) === 403) status.denied++;\n                      else status.unavailable++;\n                    }\n                  }\n                }\n              } else if (searchErrorStatus(error) === 406) status.unsupported++;\n              else status.unavailable++;\n            }\n            status.scanned++;\n            emit();\n          }\n          status.indexing = false;\n          status.completedAt = Date.now();\n          emit();\n          await delay(options.refreshMs ?? 10 * 60 * 1000);\n        }\n      } catch (error) {\n        if (!isSearchStorageFull(error)) throw error;\n        status.indexing = false;\n        status.storageFull = true;\n        status.message = SEARCH_STORAGE_FULL_MESSAGE;\n        emit();\n      }\n    },\n  };\n}\n"],"mappings":";;AAgCA,IAAa,8BAA8B;AAC3C,IAAa,uBAAuB,UAClC,iBAAiB,SAAS,MAAM,QAAQ,SAAA,kEAAoC;AAC9E,IAAM,iBAAiB,EAAE,QAAQ,mEAAmE;AACpG,SAAgB,yBAAyB,SAQtC;CACD,MAAM,EAAE,WAAW,MAAM,WAAW;CACpC,MAAM,SAAyB;EAC7B,SAAS;EACT,YAAY;EACZ,QAAQ;EACR,aAAa;EACb,aAAa;EACb,UAAU;CACZ;CACA,MAAM,aAAa,QAAQ,SAAS,EAAE,GAAG,OAAO,CAAC;CACjD,MAAM,QACJ,QAAQ,WACN,iBACA,IAAI,SAAe,YAAY;EAC7B,IAAI,OAAO,SAAS;GAClB,QAAQ;GACR;EACF;EACA,MAAM,aAAa;GACjB,aAAa,KAAK;GAClB,OAAO,oBAAoB,SAAS,IAAI;GACxC,QAAQ;EACV;EACA,MAAM,QAAQ,WAAW,MAAM,YAAY;EAC3C,OAAO,iBAAiB,SAAS,MAAM,EAAE,MAAM,KAAK,CAAC;CACvD,CAAC;CACL,IAAI,WAAW;CACf,IAAI,cAAc;CAClB,MAAM,UAAU,OACd,MACA,OACA,YACe;EACf,MAAM,MAAM,KAAK,IAAI,GAAG,cAAc,KAAK,IAAI,CAAC,CAAC;EACjD,IAAI,OAAO,SAAS,MAAM,IAAI,MAAM,iCAAiC;EACrE,cAAc,KAAK,IAAI,IAAI;EAC3B,KAAK,IAAI,UAAU,IAAK,WACtB,IAAI;GACF,OAAO,MAAM,UAAU,IAAO,MAAM,OAAO,OAAO;EACpD,SAAS,OAAO;GACd,MAAM,OAAO,kCAAA,kBAAkB,KAAK;GACpC,IAAI,OAAO,WAAW,WAAW,KAAM,SAAS,OAAO,OAAO,KAAM,MAAM;GAC1E,MAAM,QAAS,MAAmF;GAClG,MAAM,oBAAoB,QACtB,QAAQ,KAAK,KAAK,IAChB,OAAO,KAAK,IAAI,MAChB,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,IAC/B;GACJ,MAAM,MACJ,OAAO,SAAS,iBAAiB,IAC7B,KAAK,IAAI,OAAU,KAAK,IAAI,GAAG,iBAAiB,CAAC,IACjD,KAAK,IAAI,KAAO,MAAO,KAAK,OAAO,IAAI,KAAK,OAAO,IAAI,GAC7D;EACF;CAEJ;CACA,MAAM,UAA2B,EAAE,KAAK,QAAQ;CAChD,MAAM,OAAO,OAAO,MAAwB,cAAsC;EAChF,MAAM,QAAQ,GAAG,KAAK,MAAM,GAAG,KAAK,SAAS,GAAG,aAAa;EAC7D,KAAK,IAAI,UAAU,GAAG,UAAU,GAAG,WAAW;GAC5C,MAAM,SAAS,GAAG,KAAK,IAAI,EAAE,GAAG,EAAE;GAClC,MAAM,KAAK,MAAM,OAAO,MAAM;GAC9B,IAAI,eAAe;GACnB,IAAI,WAAW;GACf,MAAM,uBAAO,IAAI,IAAY;GAC7B,IAAI;IACF,GAAG;KACD,IAAI;KACJ,SAAS;MACP,MAAM,QAAQ;OAAE,OAAO;OAAU,GAAI,eAAe,EAAE,UAAU,aAAa,IAAI,CAAC;MAAG;MACrF,IAAI;OACF,IAAI;QACF,OAAO,MAAM,QAAsB,kCAAA,eAAe,MAAM,SAAS,GAAG,OAAO,cAAc;OAC3F,SAAS,OAAO;QACd,IAAI,kCAAA,kBAAkB,KAAK,MAAM,OAAO,CAAC,KAAK,OAAO,MAAM;QAC3D,OAAO,MAAM,QAAsB,kCAAA,eAAe,MAAM,SAAS,GAAG,OAAO,EACzE,QAAQ,mBACV,CAAC;OACH;OACA;MACF,SAAS,OAAO;OACd,IAAI,CAAE,MAAkC,aAAa,aAAa,GAAG,MAAM;OAC3E,WAAW,KAAK,IAAI,GAAG,KAAK,MAAM,WAAW,CAAC,CAAC;MACjD;KACF;KACA,IAAI,OAAO,SAAS;KACpB,MAAM,YAAY,kCAAA,oBAAoB,MAAM,IAAI;KAChD,OAAO,aAAa,CAClB,mBAAG,IAAI,IAAI,CACT,GAAI,OAAO,cAAc,CAAC,GAC1B,GAAG,UAAU,SAAS,aAAc,SAAS,YAAY,CAAC,SAAS,SAAS,IAAI,CAAC,CAAE,CACrF,CAAC,CACH,CAAC,CAAC,KAAK;KACP,MAAM,KAAK,OAAO,OAAO,QAAQ,SAAS;KAC1C,eAAe,KAAK,UAAU,YAAY;KAC1C,IAAI,gBAAgB,KAAK,IAAI,YAAY,GAAG,MAAM,IAAI,MAAM,iCAAiC;KAC7F,KAAK,IAAI,YAAY;IACvB,SAAS;IACT,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,OAAO,MAAM;IACtD;GACF,SAAS,OAAO;IACd,MAAM,OAAO,kCAAA,kBAAkB,KAAK;IACpC,IAAI,SAAS,OAAO,YAAY,GAAG;IACnC,IAAI,SAAS,KAAK,MAAM,KAAK,WAAW,KAAK;IAC7C,MAAM;GACR;EACF;CACF;CACA,OAAO,EACL,MAAM,MAAqB;EACzB,IAAI;GACF,OAAO,CAAC,OAAO,SAAS;IACtB,OAAO,WAAW;IAClB,OAAO,UAAU;IACjB,OAAO,SAAS;IAChB,OAAO,cAAc;IACrB,OAAO,cAAc;IACrB,OAAO,UAAU,KAAA;IACjB,KAAK;IACL,IAAI,oBAAoB;IACxB,MAAM,cAAc,MAAM,kCAAA,0BAA0B,eAAe;KACjE;KACA,OAAO;KACP,KAAK;IACP,CAAC;IACD,IAAI,OAAO,SAAS;IACpB,IAAI,sBAAsB,GACxB,MAAM,KAAK,YAAY,YAAY,KAAK,SAAS,GAAG,KAAK,MAAM,GAAG,KAAK,UAAU,CAAC;SAC/E,OAAO,UAAU;IACtB,OAAO,QAAQ,CAAC,GAAG,IAAI,IAAI,YAAY,KAAK,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;IACvE,OAAO,aAAa,YAAY;IAChC,KAAK;IACL,IAAI;IACJ,KAAK,MAAM,QAAQ,aAAa;KAC9B,IAAI,OAAO,SAAS;KACpB,IAAI;MACF,MAAM,KAAK,IAAI;KACjB,SAAS,OAAO;MACd,IAAI,OAAO,SAAS;MACpB,IAAI,oBAAoB,KAAK,GAAG,MAAM;MACtC,IAAI,kCAAA,kBAAkB,KAAK,MAAM,KAAK;OACpC,OAAO;OACP,IAAI,KAAK,YAAY;QACnB,IAAI,aAAa,sBAAsB,QAAQ,aAAa,KAAK,CAAC;QAClE,IAAI,uBAAuB,KAAA,GAAW;SACpC,IAAI;UACF,MAAM,gBAAkC;WACtC,OAAO;WACP,SAAS;WACT,UAAU;WACV,MAAM;WACN,YAAY;WACZ,SAAS,CAAC;UACZ;UACA,IAAI,QAAQ;UACZ,IAAI,QAAQ;UACZ,MAAM,uBAAO,IAAI,IAAY;UAC7B,GAAG;WACD,IAAI;WACJ,SACE,IAAI;YACF,OAAO,MAAM,QACX,kCAAA,eAAe,aAAa,GAC5B;aAAE;aAAO,GAAI,QAAQ,EAAE,UAAU,MAAM,IAAI,CAAC;YAAG,GAC/C,cACF;YACA;WACF,SAAS,OAAO;YACd,IAAI,CAAE,MAAkC,aAAa,UAAU,GAAG,MAAM;YACxE,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,CAAC,CAAC;WAC3C;WAEF,aAAa,CACX,mBAAG,IAAI,IAAI,CACT,GAAG,YACH,IAAI,KAAK,SAAS,CAAC,EAAA,CAAG,SAAS,SAAU,KAAK,UAAU,OAAO,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,CAAE,CAC3F,CAAC,CACH;WACA,QAAQ,KAAK,UAAU,YAAY;WACnC,IAAI,SAAS,KAAK,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,iCAAiC;WAC/E,KAAK,IAAI,KAAK;UAChB,SAAS;SACX,QAAQ;UACN,OAAO,UAAU;SACnB;SACA,qBAAqB;QACvB;QACA,KAAK,MAAM,aAAa,YAAY;SAClC,IAAI,OAAO,SAAS;SACpB,IAAI;UACF,MAAM,KAAK,MAAM,SAAS;SAC5B,SAAS,SAAS;UAChB,IAAI,oBAAoB,OAAO,GAAG,MAAM;UACxC,IAAI,kCAAA,kBAAkB,OAAO,MAAM,KAAK,OAAO;eAC1C,OAAO;SACd;QACF;OACF;MACF,OAAO,IAAI,kCAAA,kBAAkB,KAAK,MAAM,KAAK,OAAO;WAC/C,OAAO;KACd;KACA,OAAO;KACP,KAAK;IACP;IACA,OAAO,WAAW;IAClB,OAAO,cAAc,KAAK,IAAI;IAC9B,KAAK;IACL,MAAM,MAAM,QAAQ,aAAa,MAAU,GAAI;GACjD;EACF,SAAS,OAAO;GACd,IAAI,CAAC,oBAAoB,KAAK,GAAG,MAAM;GACvC,OAAO,WAAW;GAClB,OAAO,cAAc;GACrB,OAAO,UAAU;GACjB,KAAK;EACP;CACF,EACF;AACF"}