zidane 8.2.1 → 8.2.2

package/dist/{skills-use-D68a1gyZ.js → skills-use-CssTEaIj.js}

@@ -4,6 +4,379 @@ import { t as escapeXml } from "./xml-gcHcz2Yh.js";
 import { n as stripShellInterpolations, s as validateResourcePathReal, t as interpolateShellCommands } from "./interpolate-DD1y8j36.js";
 import { t as containsNullByte } from "./binary-detect-Dtj5NGns.js";
 import { toolPrompts } from "./tools/prompts.js";
+import { Buffer } from "node:buffer";
+import { deflateSync, inflateSync } from "node:zlib";
+//#region src/media/image-size.ts
+/**
+* Pixel dimensions from an image's header bytes: PNG, JPEG, GIF, WebP.
+*
+* Header-only — nothing is decoded, so the cost is constant for PNG / GIF /
+* WebP and a marker walk for JPEG. Used to enforce provider dimension rules
+* (Anthropic's 2000 px per-image cap once a request carries more than 20
+* images) on media the harness cannot re-encode itself.
+*/
+/** Dimensions of a PNG / JPEG / GIF / WebP payload, or `undefined` when unknown. */
+function imageSize(bytes) {
+	if (bytes.length < 10) return void 0;
+	if (bytes[0] === 137 && bytes[1] === 80 && bytes[2] === 78 && bytes[3] === 71) {
+		if (bytes.length < 24) return void 0;
+		return positive(readU32BE(bytes, 16), readU32BE(bytes, 20));
+	}
+	if (bytes[0] === 71 && bytes[1] === 73 && bytes[2] === 70) return positive(bytes[6] | bytes[7] << 8, bytes[8] | bytes[9] << 8);
+	if (bytes.length >= 30 && bytes[0] === 82 && bytes[1] === 73 && bytes[8] === 87 && bytes[9] === 69) return webpSize(bytes);
+	if (bytes[0] === 255 && bytes[1] === 216) return jpegSize(bytes);
+}
+/**
+* {@link imageSize} over a base64 payload. Decodes a bounded prefix first and
+* falls back to the whole payload only for JPEGs whose frame header sits
+* past it (large EXIF / ICC segments).
+*/
+function imageSizeFromBase64(b64) {
+	const small = imageSize(Buffer.from(b64.slice(0, 44), "base64"));
+	if (small) return small;
+	const head = Buffer.from(b64.slice(0, 87384), "base64");
+	const size = imageSize(head);
+	if (size || head.length < 65536 || head[0] !== 255) return size;
+	return imageSize(Buffer.from(b64, "base64"));
+}
+function webpSize(b) {
+	const chunk = String.fromCharCode(b[12], b[13], b[14], b[15]);
+	if (chunk === "VP8X") return positive(1 + (b[24] | b[25] << 8 | b[26] << 16), 1 + (b[27] | b[28] << 8 | b[29] << 16));
+	if (chunk === "VP8L") {
+		const bits = b[21] | b[22] << 8 | b[23] << 16 | b[24] << 24;
+		return positive((bits & 16383) + 1, (bits >>> 14 & 16383) + 1);
+	}
+	if (chunk === "VP8 ") return positive((b[26] | b[27] << 8) & 16383, (b[28] | b[29] << 8) & 16383);
+}
+function jpegSize(b) {
+	let i = 2;
+	while (i + 9 < b.length) {
+		if (b[i] !== 255) {
+			i++;
+			continue;
+		}
+		const marker = b[i + 1];
+		if (marker === 255 || marker === 1 || marker >= 208 && marker <= 217) {
+			i++;
+			continue;
+		}
+		if (marker >= 192 && marker <= 207 && marker !== 196 && marker !== 200 && marker !== 204) return positive(b[i + 7] << 8 | b[i + 8], b[i + 5] << 8 | b[i + 6]);
+		i += 2 + (b[i + 2] << 8 | b[i + 3]);
+	}
+}
+function readU32BE(b, o) {
+	return (b[o] << 24 >>> 0) + (b[o + 1] << 16) + (b[o + 2] << 8) + b[o + 3];
+}
+function positive(width, height) {
+	return width > 0 && height > 0 ? {
+		width,
+		height
+	} : void 0;
+}
+//#endregion
+//#region src/media/png-downscale.ts
+/**
+* Dependency-free PNG downscaling on `node:zlib`.
+*
+* Retina screenshots (2400×1600, 2960×1840) are the bulk of the oversize
+* images agents read. Past 2000 px they make a request carrying more than 20
+* images fail outright (Anthropic's many-image rule), and they cost upload
+* bytes and first-token latency for detail the model mostly can't use
+* (2576 px max on Claude 4.7+, 1568 px before). Shrinking once,
+* when the image enters the session, keeps the persisted bytes (and therefore
+* the prompt-cache prefix) identical on every later request.
+*
+* Scope is deliberately narrow: non-interlaced 8-bit PNGs (gray, RGB,
+* palette, gray+alpha, RGBA). Anything else returns `undefined` and the
+* caller keeps the original — this module never loses an image.
+*/
+/** Refuse to decode beyond this many pixels (~400 MB of RGBA float scratch). */
+const MAX_SOURCE_PIXELS = 25e6;
+const SIGNATURE = Buffer.from([
+	137,
+	80,
+	78,
+	71,
+	13,
+	10,
+	26,
+	10
+]);
+/**
+* Shrink a base64 image so its longest edge is at most `maxEdge`. Returns the
+* replacement payload, or `undefined` when the image already fits, is not a
+* PNG this module can decode, or anything goes wrong.
+*/
+function shrinkImageBase64(data, mediaType, maxEdge) {
+	if (!(maxEdge > 0) || mediaType !== "image/png") return void 0;
+	const size = imageSizeFromBase64(data);
+	if (!size || Math.max(size.width, size.height) <= maxEdge) return void 0;
+	const out = downscalePng(Buffer.from(data, "base64"), maxEdge);
+	return out ? {
+		data: out.toString("base64"),
+		mediaType: "image/png"
+	} : void 0;
+}
+/** Downscale PNG bytes to fit `maxEdge`; `undefined` when unsupported or already small enough. */
+function downscalePng(bytes, maxEdge) {
+	try {
+		const src = decodePng(bytes);
+		if (!src) return void 0;
+		const scale = maxEdge / Math.max(src.width, src.height);
+		if (scale >= 1) return void 0;
+		const width = Math.max(1, Math.round(src.width * scale));
+		const height = Math.max(1, Math.round(src.height * scale));
+		return encodePng({
+			width,
+			height,
+			channels: src.channels,
+			pixels: resizeArea(src, width, height)
+		});
+	} catch {
+		return;
+	}
+}
+function decodePng(bytes) {
+	const buf = Buffer.from(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+	if (buf.length < 33 || !buf.subarray(0, 8).equals(SIGNATURE)) return void 0;
+	let width = 0;
+	let height = 0;
+	let colorType = -1;
+	let palette;
+	let trns;
+	const idat = [];
+	for (let o = 8; o + 8 <= buf.length;) {
+		const len = buf.readUInt32BE(o);
+		const type = buf.toString("latin1", o + 4, o + 8);
+		const body = buf.subarray(o + 8, o + 8 + len);
+		if (body.length !== len) return void 0;
+		if (type === "IHDR") {
+			width = body.readUInt32BE(0);
+			height = body.readUInt32BE(4);
+			colorType = body[9];
+			if (body[8] !== 8 || body[10] !== 0 || body[11] !== 0 || body[12] !== 0) return void 0;
+		} else if (type === "PLTE") palette = body;
+		else if (type === "tRNS") trns = body;
+		else if (type === "IDAT") idat.push(body);
+		else if (type === "IEND") break;
+		o += 12 + len;
+	}
+	const srcChannels = {
+		0: 1,
+		2: 3,
+		3: 1,
+		4: 2,
+		6: 4
+	}[colorType];
+	if (!srcChannels || width === 0 || height === 0 || width * height > MAX_SOURCE_PIXELS || idat.length === 0) return void 0;
+	if (trns && colorType !== 3) return void 0;
+	if (colorType === 3 && !palette) return void 0;
+	const stride = width * srcChannels;
+	const raw = inflateSync(Buffer.concat(idat), { maxOutputLength: (stride + 1) * height });
+	if (raw.length < (stride + 1) * height) return void 0;
+	const rows = unfilter(raw, width, height, srcChannels);
+	if (colorType !== 3) return {
+		width,
+		height,
+		channels: srcChannels,
+		pixels: rows
+	};
+	const channels = trns ? 4 : 3;
+	const pixels = new Uint8Array(width * height * channels);
+	for (let i = 0, p = 0; i < rows.length; i++, p += channels) {
+		const idx = rows[i];
+		pixels[p] = palette[idx * 3] ?? 0;
+		pixels[p + 1] = palette[idx * 3 + 1] ?? 0;
+		pixels[p + 2] = palette[idx * 3 + 2] ?? 0;
+		if (channels === 4) pixels[p + 3] = idx < trns.length ? trns[idx] : 255;
+	}
+	return {
+		width,
+		height,
+		channels,
+		pixels
+	};
+}
+function unfilter(raw, width, height, bpp) {
+	const stride = width * bpp;
+	const out = new Uint8Array(stride * height);
+	for (let y = 0; y < height; y++) {
+		const filter = raw[y * (stride + 1)];
+		const src = y * (stride + 1) + 1;
+		const row = y * stride;
+		const prev = row - stride;
+		for (let x = 0; x < stride; x++) {
+			const a = x >= bpp ? out[row + x - bpp] : 0;
+			const b = y > 0 ? out[prev + x] : 0;
+			const c = x >= bpp && y > 0 ? out[prev + x - bpp] : 0;
+			const v = raw[src + x];
+			switch (filter) {
+				case 0:
+					out[row + x] = v;
+					break;
+				case 1:
+					out[row + x] = v + a;
+					break;
+				case 2:
+					out[row + x] = v + b;
+					break;
+				case 3:
+					out[row + x] = v + (a + b >> 1);
+					break;
+				case 4:
+					out[row + x] = v + paeth(a, b, c);
+					break;
+				default: throw new Error(`bad PNG filter ${filter}`);
+			}
+		}
+	}
+	return out;
+}
+function paeth(a, b, c) {
+	const p = a + b - c;
+	const pa = Math.abs(p - a);
+	const pb = Math.abs(p - b);
+	const pc = Math.abs(p - c);
+	return pa <= pb && pa <= pc ? a : pb <= pc ? b : c;
+}
+/**
+* Area-average (box) resample: every output pixel is the coverage-weighted
+* mean of the source pixels under it — the standard high-quality downscale.
+* Separable (horizontal then vertical). Color is alpha-weighted so
+* transparent pixels don't bleed their (meaningless) color into edges.
+*/
+function resizeArea(src, width, height) {
+	const { channels: ch } = src;
+	const alpha = ch === 2 || ch === 4 ? ch - 1 : -1;
+	const xs = coverage(src.width, width);
+	const ys = coverage(src.height, height);
+	const mid = new Float32Array(src.height * width * ch);
+	for (let y = 0; y < src.height; y++) {
+		const srow = y * src.width * ch;
+		const mrow = y * width * ch;
+		for (let x = 0; x < width; x++) {
+			const { start, weights } = xs[x];
+			for (let k = 0; k < weights.length; k++) {
+				const s = srow + (start + k) * ch;
+				const w = weights[k];
+				const aw = alpha >= 0 ? w * src.pixels[s + alpha] / 255 : w;
+				for (let c = 0; c < ch; c++) mid[mrow + x * ch + c] += (c === alpha ? w : aw) * src.pixels[s + c];
+			}
+		}
+	}
+	const out = new Uint8Array(width * height * ch);
+	const acc = new Float64Array(ch);
+	for (let y = 0; y < height; y++) {
+		const { start, weights } = ys[y];
+		for (let x = 0; x < width; x++) {
+			acc.fill(0);
+			for (let k = 0; k < weights.length; k++) {
+				const m = ((start + k) * width + x) * ch;
+				for (let c = 0; c < ch; c++) acc[c] += weights[k] * mid[m + c];
+			}
+			const o = (y * width + x) * ch;
+			const a = alpha >= 0 ? acc[alpha] : 255;
+			for (let c = 0; c < ch; c++) {
+				const v = c === alpha ? acc[c] : alpha >= 0 ? a > 0 ? acc[c] * 255 / a : 0 : acc[c];
+				out[o + c] = Math.min(255, Math.max(0, Math.round(v)));
+			}
+		}
+	}
+	return out;
+}
+/** Per output index: the first source index it covers and normalized weights. */
+function coverage(srcLen, dstLen) {
+	const ratio = srcLen / dstLen;
+	const result = [];
+	for (let i = 0; i < dstLen; i++) {
+		const lo = i * ratio;
+		const hi = Math.min(srcLen, (i + 1) * ratio);
+		const start = Math.floor(lo);
+		const end = Math.ceil(hi);
+		const weights = new Float32Array(end - start);
+		for (let s = start; s < end; s++) weights[s - start] = (Math.min(hi, s + 1) - Math.max(lo, s)) / ratio;
+		result.push({
+			start,
+			weights
+		});
+	}
+	return result;
+}
+function encodePng(img) {
+	const { width, height, channels: ch, pixels } = img;
+	const colorType = {
+		1: 0,
+		2: 4,
+		3: 2,
+		4: 6
+	}[ch];
+	const stride = width * ch;
+	const filtered = Buffer.alloc((stride + 1) * height);
+	const candidate = Buffer.alloc(stride);
+	for (let y = 0; y < height; y++) {
+		const row = y * stride;
+		let best = Number.POSITIVE_INFINITY;
+		let bestFilter = 0;
+		let bestBytes = Buffer.alloc(0);
+		for (let f = 0; f < 5; f++) {
+			let score = 0;
+			for (let x = 0; x < stride; x++) {
+				const a = x >= ch ? pixels[row + x - ch] : 0;
+				const b = y > 0 ? pixels[row - stride + x] : 0;
+				const c = x >= ch && y > 0 ? pixels[row - stride + x - ch] : 0;
+				const v = pixels[row + x];
+				const r = (f === 0 ? v : f === 1 ? v - a : f === 2 ? v - b : f === 3 ? v - (a + b >> 1) : v - paeth(a, b, c)) & 255;
+				candidate[x] = r;
+				score += r < 128 ? r : 256 - r;
+			}
+			if (score < best) {
+				best = score;
+				bestFilter = f;
+				bestBytes = Buffer.from(candidate);
+			}
+		}
+		filtered[y * (stride + 1)] = bestFilter;
+		bestBytes.copy(filtered, y * (stride + 1) + 1);
+	}
+	const ihdr = Buffer.alloc(13);
+	ihdr.writeUInt32BE(width, 0);
+	ihdr.writeUInt32BE(height, 4);
+	ihdr[8] = 8;
+	ihdr[9] = colorType;
+	return Buffer.concat([
+		SIGNATURE,
+		chunk("IHDR", ihdr),
+		chunk("IDAT", deflateSync(filtered)),
+		chunk("IEND", Buffer.alloc(0))
+	]);
+}
+function chunk(type, body) {
+	const head = Buffer.alloc(8);
+	head.writeUInt32BE(body.length, 0);
+	head.write(type, 4, "latin1");
+	const crc = Buffer.alloc(4);
+	crc.writeUInt32BE(crc32(Buffer.concat([head.subarray(4), body])), 0);
+	return Buffer.concat([
+		head,
+		body,
+		crc
+	]);
+}
+let crcTable;
+function crc32(bytes) {
+	if (!crcTable) {
+		crcTable = /* @__PURE__ */ new Uint32Array(256);
+		for (let n = 0; n < 256; n++) {
+			let c = n;
+			for (let k = 0; k < 8; k++) c = c & 1 ? 3988292384 ^ c >>> 1 : c >>> 1;
+			crcTable[n] = c >>> 0;
+		}
+	}
+	let c = 4294967295;
+	for (let i = 0; i < bytes.length; i++) c = crcTable[(c ^ bytes[i]) & 255] ^ c >>> 8;
+	return (c ^ 4294967295) >>> 0;
+}
+//#endregion
 //#region src/tools/tool-search.ts
 const DEFAULT_LIMIT = 20;
 function rankByQuery(catalog, query) {
@@ -419,6 +792,6 @@ function createSkillsUseTool(options) {
 	};
 }
 //#endregion
-export { createToolSearchTool as a, applyToolSearchToUnlocked as i, createSkillsRunScriptTool as n, selectToolSearchMatches as o, createSkillsReadTool as r, createSkillsUseTool as t };
+export { createToolSearchTool as a, imageSizeFromBase64 as c, applyToolSearchToUnlocked as i, createSkillsRunScriptTool as n, selectToolSearchMatches as o, createSkillsReadTool as r, shrinkImageBase64 as s, createSkillsUseTool as t };
 
-//# sourceMappingURL=skills-use-D68a1gyZ.js.map
+//# sourceMappingURL=skills-use-CssTEaIj.js.map

package/dist/skills-use-CssTEaIj.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"skills-use-CssTEaIj.js","names":[],"sources":["../src/media/image-size.ts","../src/media/png-downscale.ts","../src/tools/tool-search.ts","../src/tools/skills-read.ts","../src/tools/skills-run-script.ts","../src/tools/skills-use.ts"],"sourcesContent":["/**\n * Pixel dimensions from an image's header bytes: PNG, JPEG, GIF, WebP.\n *\n * Header-only — nothing is decoded, so the cost is constant for PNG / GIF /\n * WebP and a marker walk for JPEG. Used to enforce provider dimension rules\n * (Anthropic's 2000 px per-image cap once a request carries more than 20\n * images) on media the harness cannot re-encode itself.\n */\n\nimport { Buffer } from 'node:buffer'\n\nexport interface ImageSize {\n  width: number\n  height: number\n}\n\n/** Dimensions of a PNG / JPEG / GIF / WebP payload, or `undefined` when unknown. */\nexport function imageSize(bytes: Uint8Array): ImageSize | undefined {\n  if (bytes.length < 10)\n    return undefined\n  // PNG: signature, then the IHDR chunk (width/height big-endian at 16/20).\n  if (bytes[0] === 0x89 && bytes[1] === 0x50 && bytes[2] === 0x4E && bytes[3] === 0x47) {\n    if (bytes.length < 24)\n      return undefined\n    return positive(readU32BE(bytes, 16), readU32BE(bytes, 20))\n  }\n  // GIF: logical screen size, little-endian at 6/8.\n  if (bytes[0] === 0x47 && bytes[1] === 0x49 && bytes[2] === 0x46)\n    return positive(bytes[6]! | (bytes[7]! << 8), bytes[8]! | (bytes[9]! << 8))\n  // WebP: RIFF container; the first chunk says which bitstream follows.\n  if (bytes.length >= 30 && bytes[0] === 0x52 && bytes[1] === 0x49 && bytes[8] === 0x57 && bytes[9] === 0x45)\n    return webpSize(bytes)\n  if (bytes[0] === 0xFF && bytes[1] === 0xD8)\n    return jpegSize(bytes)\n  return undefined\n}\n\n/**\n * {@link imageSize} over a base64 payload. Decodes a bounded prefix first and\n * falls back to the whole payload only for JPEGs whose frame header sits\n * past it (large EXIF / ICC segments).\n */\nexport function imageSizeFromBase64(b64: string): ImageSize | undefined {\n  // PNG / GIF / WebP fit in the first 32 bytes; this runs per image per\n  // request, so only JPEG pays for a larger decode.\n  const small = imageSize(Buffer.from(b64.slice(0, 44), 'base64'))\n  if (small)\n    return small\n  const head = Buffer.from(b64.slice(0, 87_384), 'base64')\n  const size = imageSize(head)\n  if (size || head.length < 65_536 || head[0] !== 0xFF)\n    return size\n  return imageSize(Buffer.from(b64, 'base64'))\n}\n\nfunction webpSize(b: Uint8Array): ImageSize | undefined {\n  const chunk = String.fromCharCode(b[12]!, b[13]!, b[14]!, b[15]!)\n  if (chunk === 'VP8X')\n    return positive(1 + (b[24]! | (b[25]! << 8) | (b[26]! << 16)), 1 + (b[27]! | (b[28]! << 8) | (b[29]! << 16)))\n  if (chunk === 'VP8L') {\n    const bits = b[21]! | (b[22]! << 8) | (b[23]! << 16) | (b[24]! << 24)\n    return positive((bits & 0x3FFF) + 1, ((bits >>> 14) & 0x3FFF) + 1)\n  }\n  if (chunk === 'VP8 ')\n    return positive((b[26]! | (b[27]! << 8)) & 0x3FFF, (b[28]! | (b[29]! << 8)) & 0x3FFF)\n  return undefined\n}\n\nfunction jpegSize(b: Uint8Array): ImageSize | undefined {\n  let i = 2\n  while (i + 9 < b.length) {\n    if (b[i] !== 0xFF) {\n      i++\n      continue\n    }\n    const marker = b[i + 1]!\n    // Fill bytes and standalone markers carry no length.\n    if (marker === 0xFF || marker === 0x01 || (marker >= 0xD0 && marker <= 0xD9)) {\n      i++\n      continue\n    }\n    // SOF0–SOF15 except DHT (C4), JPG (C8) and DAC (CC): height then width.\n    if (marker >= 0xC0 && marker <= 0xCF && marker !== 0xC4 && marker !== 0xC8 && marker !== 0xCC)\n      return positive((b[i + 7]! << 8) | b[i + 8]!, (b[i + 5]! << 8) | b[i + 6]!)\n    i += 2 + ((b[i + 2]! << 8) | b[i + 3]!)\n  }\n  return undefined\n}\n\nfunction readU32BE(b: Uint8Array, o: number): number {\n  return ((b[o]! << 24) >>> 0) + (b[o + 1]! << 16) + (b[o + 2]! << 8) + b[o + 3]!\n}\n\nfunction positive(width: number, height: number): ImageSize | undefined {\n  return width > 0 && height > 0 ? { width, height } : undefined\n}\n","/**\n * Dependency-free PNG downscaling on `node:zlib`.\n *\n * Retina screenshots (2400×1600, 2960×1840) are the bulk of the oversize\n * images agents read. Past 2000 px they make a request carrying more than 20\n * images fail outright (Anthropic's many-image rule), and they cost upload\n * bytes and first-token latency for detail the model mostly can't use\n * (2576 px max on Claude 4.7+, 1568 px before). Shrinking once,\n * when the image enters the session, keeps the persisted bytes (and therefore\n * the prompt-cache prefix) identical on every later request.\n *\n * Scope is deliberately narrow: non-interlaced 8-bit PNGs (gray, RGB,\n * palette, gray+alpha, RGBA). Anything else returns `undefined` and the\n * caller keeps the original — this module never loses an image.\n */\n\nimport { Buffer } from 'node:buffer'\nimport { deflateSync, inflateSync } from 'node:zlib'\nimport { imageSizeFromBase64 } from './image-size'\n\n/** Refuse to decode beyond this many pixels (~400 MB of RGBA float scratch). */\nconst MAX_SOURCE_PIXELS = 25_000_000\n\nconst SIGNATURE = Buffer.from([0x89, 0x50, 0x4E, 0x47, 0x0D, 0x0A, 0x1A, 0x0A])\n\ninterface DecodedPng {\n  width: number\n  height: number\n  /** 1 gray, 2 gray+alpha, 3 RGB, 4 RGBA. */\n  channels: number\n  pixels: Uint8Array\n}\n\n/**\n * Shrink a base64 image so its longest edge is at most `maxEdge`. Returns the\n * replacement payload, or `undefined` when the image already fits, is not a\n * PNG this module can decode, or anything goes wrong.\n */\nexport function shrinkImageBase64(\n  data: string,\n  mediaType: string,\n  maxEdge: number,\n): { data: string, mediaType: string } | undefined {\n  if (!(maxEdge > 0) || mediaType !== 'image/png')\n    return undefined\n  const size = imageSizeFromBase64(data)\n  if (!size || Math.max(size.width, size.height) <= maxEdge)\n    return undefined\n  const out = downscalePng(Buffer.from(data, 'base64'), maxEdge)\n  return out ? { data: out.toString('base64'), mediaType: 'image/png' } : undefined\n}\n\n/** Downscale PNG bytes to fit `maxEdge`; `undefined` when unsupported or already small enough. */\nexport function downscalePng(bytes: Uint8Array, maxEdge: number): Buffer | undefined {\n  try {\n    const src = decodePng(bytes)\n    if (!src)\n      return undefined\n    const scale = maxEdge / Math.max(src.width, src.height)\n    if (scale >= 1)\n      return undefined\n    const width = Math.max(1, Math.round(src.width * scale))\n    const height = Math.max(1, Math.round(src.height * scale))\n    return encodePng({ width, height, channels: src.channels, pixels: resizeArea(src, width, height) })\n  }\n  catch {\n    return undefined\n  }\n}\n\nexport function decodePng(bytes: Uint8Array): DecodedPng | undefined {\n  const buf = Buffer.from(bytes.buffer, bytes.byteOffset, bytes.byteLength)\n  if (buf.length < 33 || !buf.subarray(0, 8).equals(SIGNATURE))\n    return undefined\n  let width = 0\n  let height = 0\n  let colorType = -1\n  let palette: Buffer | undefined\n  let trns: Buffer | undefined\n  const idat: Buffer[] = []\n  for (let o = 8; o + 8 <= buf.length;) {\n    const len = buf.readUInt32BE(o)\n    const type = buf.toString('latin1', o + 4, o + 8)\n    const body = buf.subarray(o + 8, o + 8 + len)\n    if (body.length !== len)\n      return undefined\n    if (type === 'IHDR') {\n      width = body.readUInt32BE(0)\n      height = body.readUInt32BE(4)\n      colorType = body[9]!\n      // 8-bit depth, deflate, standard filtering, no interlace only.\n      if (body[8] !== 8 || body[10] !== 0 || body[11] !== 0 || body[12] !== 0)\n        return undefined\n    }\n    else if (type === 'PLTE') { palette = body }\n    else if (type === 'tRNS') { trns = body }\n    else if (type === 'IDAT') { idat.push(body) }\n    else if (type === 'IEND') { break }\n    o += 12 + len\n  }\n  const srcChannels = ({ 0: 1, 2: 3, 3: 1, 4: 2, 6: 4 } as Record<number, number>)[colorType]\n  if (!srcChannels || width === 0 || height === 0 || width * height > MAX_SOURCE_PIXELS || idat.length === 0)\n    return undefined\n  // A single transparent color key on gray/RGB would be lost by averaging.\n  if (trns && colorType !== 3)\n    return undefined\n  if (colorType === 3 && !palette)\n    return undefined\n\n  const stride = width * srcChannels\n  // Cap the inflate at the size IHDR implies: a tiny crafted IDAT could\n  // otherwise expand to gigabytes before the length check below. Overflow throws.\n  const raw = inflateSync(Buffer.concat(idat), { maxOutputLength: (stride + 1) * height })\n  if (raw.length < (stride + 1) * height)\n    return undefined\n  const rows = unfilter(raw, width, height, srcChannels)\n\n  if (colorType !== 3)\n    return { width, height, channels: srcChannels, pixels: rows }\n  // Expand palette indices to RGB, or RGBA when the palette carries alpha.\n  const channels = trns ? 4 : 3\n  const pixels = new Uint8Array(width * height * channels)\n  for (let i = 0, p = 0; i < rows.length; i++, p += channels) {\n    const idx = rows[i]!\n    pixels[p] = palette![idx * 3] ?? 0\n    pixels[p + 1] = palette![idx * 3 + 1] ?? 0\n    pixels[p + 2] = palette![idx * 3 + 2] ?? 0\n    if (channels === 4)\n      pixels[p + 3] = idx < trns!.length ? trns![idx]! : 255\n  }\n  return { width, height, channels, pixels }\n}\n\nfunction unfilter(raw: Uint8Array, width: number, height: number, bpp: number): Uint8Array {\n  const stride = width * bpp\n  const out = new Uint8Array(stride * height)\n  for (let y = 0; y < height; y++) {\n    const filter = raw[y * (stride + 1)]!\n    const src = y * (stride + 1) + 1\n    const row = y * stride\n    const prev = row - stride\n    for (let x = 0; x < stride; x++) {\n      const a = x >= bpp ? out[row + x - bpp]! : 0\n      const b = y > 0 ? out[prev + x]! : 0\n      const c = x >= bpp && y > 0 ? out[prev + x - bpp]! : 0\n      const v = raw[src + x]!\n      switch (filter) {\n        case 0: out[row + x] = v; break\n        case 1: out[row + x] = v + a; break\n        case 2: out[row + x] = v + b; break\n        case 3: out[row + x] = v + ((a + b) >> 1); break\n        case 4: out[row + x] = v + paeth(a, b, c); break\n        default: throw new Error(`bad PNG filter ${filter}`)\n      }\n    }\n  }\n  return out\n}\n\nfunction paeth(a: number, b: number, c: number): number {\n  const p = a + b - c\n  const pa = Math.abs(p - a)\n  const pb = Math.abs(p - b)\n  const pc = Math.abs(p - c)\n  return pa <= pb && pa <= pc ? a : pb <= pc ? b : c\n}\n\n/**\n * Area-average (box) resample: every output pixel is the coverage-weighted\n * mean of the source pixels under it — the standard high-quality downscale.\n * Separable (horizontal then vertical). Color is alpha-weighted so\n * transparent pixels don't bleed their (meaningless) color into edges.\n */\nfunction resizeArea(src: DecodedPng, width: number, height: number): Uint8Array {\n  const { channels: ch } = src\n  const alpha = ch === 2 || ch === 4 ? ch - 1 : -1\n  const xs = coverage(src.width, width)\n  const ys = coverage(src.height, height)\n\n  // Pass 1: rows → width columns, alpha-premultiplied floats.\n  const mid = new Float32Array(src.height * width * ch)\n  for (let y = 0; y < src.height; y++) {\n    const srow = y * src.width * ch\n    const mrow = y * width * ch\n    for (let x = 0; x < width; x++) {\n      const { start, weights } = xs[x]!\n      for (let k = 0; k < weights.length; k++) {\n        const s = srow + (start + k) * ch\n        const w = weights[k]!\n        const aw = alpha >= 0 ? w * src.pixels[s + alpha]! / 255 : w\n        for (let c = 0; c < ch; c++)\n          mid[mrow + x * ch + c]! += (c === alpha ? w : aw) * src.pixels[s + c]!\n      }\n    }\n  }\n\n  // Pass 2: columns → height rows, then un-premultiply.\n  const out = new Uint8Array(width * height * ch)\n  const acc = new Float64Array(ch)\n  for (let y = 0; y < height; y++) {\n    const { start, weights } = ys[y]!\n    for (let x = 0; x < width; x++) {\n      acc.fill(0)\n      for (let k = 0; k < weights.length; k++) {\n        const m = ((start + k) * width + x) * ch\n        for (let c = 0; c < ch; c++)\n          acc[c]! += weights[k]! * mid[m + c]!\n      }\n      const o = (y * width + x) * ch\n      const a = alpha >= 0 ? acc[alpha]! : 255\n      for (let c = 0; c < ch; c++) {\n        const v = c === alpha ? acc[c]! : alpha >= 0 ? (a > 0 ? acc[c]! * 255 / a : 0) : acc[c]!\n        out[o + c] = Math.min(255, Math.max(0, Math.round(v)))\n      }\n    }\n  }\n  return out\n}\n\n/** Per output index: the first source index it covers and normalized weights. */\nfunction coverage(srcLen: number, dstLen: number): Array<{ start: number, weights: Float32Array }> {\n  const ratio = srcLen / dstLen\n  const result: Array<{ start: number, weights: Float32Array }> = []\n  for (let i = 0; i < dstLen; i++) {\n    const lo = i * ratio\n    const hi = Math.min(srcLen, (i + 1) * ratio)\n    const start = Math.floor(lo)\n    const end = Math.ceil(hi)\n    const weights = new Float32Array(end - start)\n    for (let s = start; s < end; s++)\n      weights[s - start] = (Math.min(hi, s + 1) - Math.max(lo, s)) / ratio\n    result.push({ start, weights })\n  }\n  return result\n}\n\nexport function encodePng(img: DecodedPng): Buffer {\n  const { width, height, channels: ch, pixels } = img\n  const colorType = ({ 1: 0, 2: 4, 3: 2, 4: 6 } as Record<number, number>)[ch]!\n  const stride = width * ch\n  const filtered = Buffer.alloc((stride + 1) * height)\n  const candidate = Buffer.alloc(stride)\n  // Per-row adaptive filter: keep whichever of the five minimizes the sum of\n  // absolute signed residuals (libpng's default heuristic).\n  for (let y = 0; y < height; y++) {\n    const row = y * stride\n    let best = Number.POSITIVE_INFINITY\n    let bestFilter = 0\n    let bestBytes = Buffer.alloc(0)\n    for (let f = 0; f < 5; f++) {\n      let score = 0\n      for (let x = 0; x < stride; x++) {\n        const a = x >= ch ? pixels[row + x - ch]! : 0\n        const b = y > 0 ? pixels[row - stride + x]! : 0\n        const c = x >= ch && y > 0 ? pixels[row - stride + x - ch]! : 0\n        const v = pixels[row + x]!\n        const r = (f === 0 ? v : f === 1 ? v - a : f === 2 ? v - b : f === 3 ? v - ((a + b) >> 1) : v - paeth(a, b, c)) & 0xFF\n        candidate[x] = r\n        score += r < 128 ? r : 256 - r\n      }\n      if (score < best) {\n        best = score\n        bestFilter = f\n        bestBytes = Buffer.from(candidate)\n      }\n    }\n    filtered[y * (stride + 1)] = bestFilter\n    bestBytes.copy(filtered, y * (stride + 1) + 1)\n  }\n  const ihdr = Buffer.alloc(13)\n  ihdr.writeUInt32BE(width, 0)\n  ihdr.writeUInt32BE(height, 4)\n  ihdr[8] = 8\n  ihdr[9] = colorType\n  return Buffer.concat([\n    SIGNATURE,\n    chunk('IHDR', ihdr),\n    chunk('IDAT', deflateSync(filtered)),\n    chunk('IEND', Buffer.alloc(0)),\n  ])\n}\n\nfunction chunk(type: string, body: Buffer): Buffer {\n  const head = Buffer.alloc(8)\n  head.writeUInt32BE(body.length, 0)\n  head.write(type, 4, 'latin1')\n  const crc = Buffer.alloc(4)\n  crc.writeUInt32BE(crc32(Buffer.concat([head.subarray(4), body])), 0)\n  return Buffer.concat([head, body, crc])\n}\n\nlet crcTable: Uint32Array | undefined\nfunction crc32(bytes: Uint8Array): number {\n  if (!crcTable) {\n    crcTable = new Uint32Array(256)\n    for (let n = 0; n < 256; n++) {\n      let c = n\n      for (let k = 0; k < 8; k++)\n        c = c & 1 ? 0xEDB88320 ^ (c >>> 1) : c >>> 1\n      crcTable[n] = c >>> 0\n    }\n  }\n  let c = 0xFFFFFFFF\n  for (let i = 0; i < bytes.length; i++)\n    c = crcTable[(c ^ bytes[i]!) & 0xFF]! ^ (c >>> 8)\n  return (c ^ 0xFFFFFFFF) >>> 0\n}\n","/**\n * `tool_search` — progressive tool disclosure.\n *\n * Counterpart to `skills_use` for the MCP tool surface: the catalog (name +\n * description) lives in the system prompt; full `inputSchema` payloads load\n * lazily through this tool. After a successful match, the matched tools'\n * canonical names are added to the per-run \"unlocked\" set and become callable\n * immediately (the loop rebuilds `formattedTools` before the next provider\n * request, advertising the unlocked tools to the provider).\n *\n * Aliasing: the tool advertises and matches on the **wire** (alias-rewritten)\n * name — the only name the model ever sees. Internally each lazy entry also\n * carries its `canonicalName`, which is what gets added to the `unlocked` set\n * (the loop's tool registry is keyed by canonical name).\n *\n * Result shape: structured pseudo-XML wrapping a JSON `inputSchema` payload.\n * The schema is inlined verbatim (NOT XML-escaped) so the model can reuse it\n * directly when constructing arguments — escaping the JSON would force the\n * model to mentally un-escape `&quot;` etc. when reasoning about field types.\n */\n\nimport type { ToolContext, ToolDef } from './types'\nimport { escapeXml } from '../xml'\nimport { toolPrompts } from './prompts'\n\n/** A tool the model can discover through `tool_search` and unlock on demand. */\nexport interface LazyToolEntry {\n  /**\n   * Wire name (after `toolAliases` rewrite). What the model sees in the\n   * catalog, what `tool_search` matches against, and what the provider's\n   * tool list will carry once the entry is unlocked.\n   */\n  name: string\n  /**\n   * Canonical (registry-key) name used for unlock-set membership and for the\n   * loop's `ctx.tools[name]` dispatch lookup. Equal to `name` when no alias\n   * is configured for this tool.\n   */\n  canonicalName: string\n  /** Tool description matched by the search. */\n  description: string\n  /** JSON Schema of the tool input, returned inline when the tool is unlocked. */\n  inputSchema: Record<string, unknown>\n  /** Source MCP server, when applicable. Used for `server`-bulk unlock. */\n  server?: string\n}\n\n/** Options for {@link createToolSearchTool}. */\nexport interface ToolSearchToolOptions {\n  /**\n   * Snapshot of every lazy tool the model can discover. Built once per run by\n   * the agent — the tool closes over this array and never mutates it.\n   */\n  catalog: readonly LazyToolEntry[]\n  /**\n   * Mutable per-run set of unlocked **canonical** tool names. The tool adds\n   * matches in place; the loop reads the set when rebuilding the wire-level\n   * tool list. Keyed by canonical (not wire) so dispatch lookups stay\n   * alias-stable.\n   *\n   * Prefer `addUnlock` for cache-stable wire-tool ordering: writes through a\n   * Set lose unlock order, so the wire-level rebuild that filters by `unlocked`\n   * has to fall back to registry iteration order — which moves entries every\n   * time a lazy tool earlier in the registry is unlocked, breaking provider\n   * prompt-cache breakpoints. The agent passes both when it owns the unlock\n   * tracker, with `addUnlock` mirroring writes into an ordered log.\n   */\n  unlocked: Set<string>\n  /**\n   * Optional callback fired for every canonical name the tool unlocks. When\n   * set, the agent uses this to maintain an append-only `dynamicUnlockOrder`\n   * so the wire-level tool list emits new unlocks at the tail and keeps the\n   * provider prefix cache warm. Idempotent on repeat unlocks of the same\n   * name — callers may dedupe internally.\n   *\n   * Invoked **in addition to** the `unlocked.add` (which still happens, for\n   * callers that only watch the Set).\n   */\n  addUnlock?: (canonical: string) => void\n  /** Default cap on returned matches when the model omits `limit`. */\n  defaultLimit?: number\n  /**\n   * Dispatch mode (`toolSearch.mode: 'dispatch'`): surfaced tools are NOT\n   * appended to the wire tools array; the model invokes them through this\n   * envelope tool. The description and result footer say so — without it the\n   * model would emit a direct `tool_use` the provider has never been told\n   * about.\n   */\n  dispatcherName?: string\n}\n\nconst DEFAULT_LIMIT = 20\n\nfunction rankByQuery(catalog: readonly LazyToolEntry[], query: string): LazyToolEntry[] {\n  const q = query.trim().toLowerCase()\n  if (!q)\n    return [...catalog]\n\n  // Two-tier ranking: name hits beat description hits. Within each tier we\n  // preserve registration order so deterministic catalogs produce\n  // deterministic results.\n  const nameHits: LazyToolEntry[] = []\n  const descHits: LazyToolEntry[] = []\n  for (const entry of catalog) {\n    if (entry.name.toLowerCase().includes(q))\n      nameHits.push(entry)\n    else if (entry.description.toLowerCase().includes(q))\n      descHits.push(entry)\n  }\n  return [...nameHits, ...descHits]\n}\n\n/**\n * Sanitise a JSON-stringified schema for embedding inside a pseudo-XML tag.\n *\n * The schema is inlined verbatim (NOT XML-escaped) so the model can reuse\n * field types directly when constructing arguments. The only transformation\n * we apply is replacing `<` with `\\u003c` inside string literals — this\n * keeps the JSON byte-equivalent for the model (JSON parsers decode the\n * escape) while preventing a hostile or buggy `inputSchema` from injecting\n * apparent XML tags (`</input_schema>`, `<evil>…`) that would muddle the\n * model's read of the surrounding result envelope.\n *\n * The substitution is safe because `<` is only meaningful when it appears\n * literally; the `\\u003c` form is not a tag character and is identical to\n * `<` after JSON parsing.\n */\nfunction sanitiseSchemaForXml(schemaJson: string): string {\n  return schemaJson.replace(/</g, '\\\\u003c')\n}\n\nfunction formatMatch(entry: LazyToolEntry): string {\n  const schema = sanitiseSchemaForXml(JSON.stringify(entry.inputSchema))\n  const serverAttr = entry.server ? ` server=\"${escapeXml(entry.server)}\"` : ''\n  return [\n    `  <tool name=\"${escapeXml(entry.name)}\"${serverAttr}>`,\n    `    <description>${escapeXml(entry.description)}</description>`,\n    `    <input_schema>${schema}</input_schema>`,\n    `  </tool>`,\n  ].join('\\n')\n}\n\ninterface SelectionResult {\n  /** Matches kept after the `limit` cap. */\n  shown: LazyToolEntry[]\n  /** Number of matches before the cap. */\n  total: number\n  /** Whether the cap dropped some matches. */\n  truncated: boolean\n  /** Requested `names` that are not in the catalog. */\n  misses: string[]\n  /** The trimmed `query`, if one was given. */\n  query: string | undefined\n  /** The `server` filter, if one was given. */\n  server: string | undefined\n}\n\n/**\n * Pure resolver for a `tool_search` invocation. Mirrors the matching the\n * execute path performs (`names` → `server` → `query` → unconstrained fallback,\n * then cap by `limit`). Extracted so the unlock side-effect can be replayed\n * deterministically when a session is resumed — `run()` walks the persisted\n * `tool_search` tool_calls and feeds each historical input through here to\n * rebuild the `unlocked` set seeded by prior runs.\n *\n * Returns the entries the original call would have shown (post-limit), not the\n * full pre-cap match set — the cap is part of what the model actually saw.\n */\nexport function selectToolSearchMatches(\n  catalog: readonly LazyToolEntry[],\n  input: Record<string, unknown>,\n  defaultLimit: number = DEFAULT_LIMIT,\n): SelectionResult {\n  const byName = new Map(catalog.map(e => [e.name, e]))\n  const byServer = new Map<string, LazyToolEntry[]>()\n  for (const entry of catalog) {\n    if (!entry.server)\n      continue\n    const list = byServer.get(entry.server) ?? []\n    list.push(entry)\n    byServer.set(entry.server, list)\n  }\n  const maxLimit = Math.max(catalog.length, 1)\n\n  const rawQuery = typeof input.query === 'string' ? input.query.trim() : undefined\n  const query = rawQuery || undefined\n  const namesIn = Array.isArray(input.names)\n    ? input.names.filter((n): n is string => typeof n === 'string' && n.length > 0)\n    : undefined\n  const server = typeof input.server === 'string' && input.server.length > 0 ? input.server : undefined\n  const limitIn = typeof input.limit === 'number' && Number.isFinite(input.limit) && input.limit > 0\n    ? Math.floor(input.limit as number)\n    : defaultLimit\n  const limit = Math.min(limitIn, maxLimit)\n\n  const matches: LazyToolEntry[] = []\n  const seen = new Set<string>()\n  const misses: string[] = []\n\n  if (namesIn && namesIn.length > 0) {\n    for (const n of namesIn) {\n      if (seen.has(n))\n        continue\n      const entry = byName.get(n)\n      if (entry) {\n        matches.push(entry)\n        seen.add(n)\n      }\n      else {\n        misses.push(n)\n      }\n    }\n  }\n\n  if (server) {\n    const list = byServer.get(server) ?? []\n    for (const entry of list) {\n      if (seen.has(entry.name))\n        continue\n      matches.push(entry)\n      seen.add(entry.name)\n    }\n  }\n\n  if (query !== undefined) {\n    for (const entry of rankByQuery(catalog, query)) {\n      if (seen.has(entry.name))\n        continue\n      matches.push(entry)\n      seen.add(entry.name)\n    }\n  }\n\n  if (!namesIn?.length && !server && query === undefined) {\n    for (const entry of catalog) {\n      matches.push(entry)\n      seen.add(entry.name)\n    }\n  }\n\n  const truncated = matches.length > limit\n  const shown = truncated ? matches.slice(0, limit) : matches\n  return { shown, total: matches.length, truncated, misses, query, server }\n}\n\n/**\n * Replay the unlock side-effect of a single historical `tool_search` call.\n *\n * Used on session resume: every run starts with a fresh `unlocked` set\n * (seeded with eager tools only), but the resumed conversation already\n * shows the model that some lazy tools are callable. Without this replay\n * the model emits a `tool_use` for a tool the gate then refuses with\n * \"load via tool_search first\".\n *\n * Safe to call repeatedly with the same input; the `Set` add is idempotent.\n * Lookups missing from the current catalog (host changed `mcpServers` or\n * `disclosure` between runs) are silently dropped — the model will get a\n * normal \"tool not callable\" error on its next attempt, which is the\n * correct response when a tool genuinely no longer exists.\n */\nexport function applyToolSearchToUnlocked(\n  catalog: readonly LazyToolEntry[],\n  input: Record<string, unknown>,\n  unlocked: Set<string>,\n  defaultLimit?: number,\n  addUnlock?: (canonical: string) => void,\n): void {\n  const { shown } = selectToolSearchMatches(catalog, input, defaultLimit ?? DEFAULT_LIMIT)\n  for (const entry of shown) {\n    unlocked.add(entry.canonicalName)\n    addUnlock?.(entry.canonicalName)\n  }\n}\n\n/**\n * Factory for `tool_search`. Auto-injected by the agent when\n * `behavior.toolDisclosure === 'lazy'` and at least one MCP tool is in the\n * registry. Opt out via `behavior.toolSearch.tool === false`.\n * @param options - Lazy tool catalog, unlock set and callbacks. See {@link ToolSearchToolOptions}.\n */\nexport function createToolSearchTool(options: ToolSearchToolOptions): ToolDef {\n  const defaultLimit = options.defaultLimit ?? DEFAULT_LIMIT\n  const dispatcher = options.dispatcherName\n\n  return {\n    // Read-only over the in-memory catalog — fan out with other reads.\n    isConcurrencySafe: true,\n    spec: {\n      name: 'tool_search',\n      description: [\n        toolPrompts.tool_search.core,\n        dispatcher ? toolPrompts.tool_search.callableVia(dispatcher) : toolPrompts.tool_search.callable,\n      ].join(' '),\n      inputSchema: {\n        type: 'object',\n        properties: {\n          query: {\n            type: 'string',\n            description: 'Substring to match against tool name + description (case-insensitive).',\n          },\n          names: {\n            type: 'array',\n            items: { type: 'string' },\n            description: 'Explicit tool names to load (bypasses ranking). Use the names shown in <searchable_tools>.',\n          },\n          server: {\n            type: 'string',\n            description: 'MCP server name: load every tool from this server.',\n          },\n          limit: {\n            type: 'integer',\n            minimum: 1,\n            description: `Cap on returned matches. Default: ${defaultLimit}.`,\n          },\n        },\n        additionalProperties: false,\n      },\n    },\n\n    async execute(input, ctx: ToolContext): Promise<string> {\n      // Cheap signal check — refuses cleanly if the run was aborted between\n      // the model emitting the call and the executor running it.\n      if (ctx.signal?.aborted)\n        return '<tool_search_results matches=\"0\" aborted=\"true\">Run aborted.</tool_search_results>'\n\n      if (options.catalog.length === 0)\n        return '<tool_search_results matches=\"0\">No lazy tools registered for this run.</tool_search_results>'\n\n      const { shown, total, truncated, misses, query, server } = selectToolSearchMatches(\n        options.catalog,\n        input,\n        defaultLimit,\n      )\n\n      // Unlock by canonical name — the loop's tool registry is keyed on\n      // canonical, so this is what `buildFormattedTools` checks. The\n      // `addUnlock` callback (when wired by the agent) also records the\n      // canonical into the per-run dynamic-unlock log so the wire-level\n      // rebuild can emit fresh unlocks at the tail rather than at their\n      // registry position, keeping the provider prefix cache warm.\n      for (const entry of shown) {\n        options.unlocked.add(entry.canonicalName)\n        options.addUnlock?.(entry.canonicalName)\n      }\n\n      const parts: string[] = []\n      const queryAttr = query ? ` query=\"${escapeXml(query)}\"` : ''\n      const serverAttr = server ? ` server=\"${escapeXml(server)}\"` : ''\n      parts.push(`<tool_search_results matches=\"${shown.length}\" total=\"${total}\"${queryAttr}${serverAttr}>`)\n      if (shown.length === 0) {\n        parts.push('  No matches. Try a broader query, or omit all parameters to list everything.')\n      }\n      else {\n        for (const entry of shown)\n          parts.push(formatMatch(entry))\n        parts.push('')\n        parts.push(dispatcher\n          ? `  These tools are now callable through \\`${dispatcher}\\`: pass the tool name as \\`name\\` and an object matching its schema as \\`arguments\\`.`\n          : '  These tools are now callable. Invoke them by name in subsequent turns.')\n        if (truncated) {\n          parts.push(`  ${total - shown.length} additional matches were truncated; refine the query or raise \\`limit\\`.`)\n        }\n      }\n      if (misses.length > 0) {\n        parts.push(`  <misses>${misses.map(escapeXml).join(', ')}</misses>`)\n      }\n      parts.push('</tool_search_results>')\n\n      return parts.join('\\n')\n    },\n  }\n}\n","/**\n * `skills_read` tool — reads a bundled resource file from an active skill.\n *\n * Requires the skill to be active (model must have called `skills_use` first).\n * Paths are validated against the skill's `baseDir` to prevent directory\n * traversal. File I/O goes through `ctx.execution.readFile` so docker/sandbox\n * execution contexts work identically to in-process.\n */\n\nimport type { SkillActivationState } from '../skills/activation'\nimport type { SkillConfig } from '../skills/types'\nimport type { ToolContext, ToolDef } from './types'\nimport { errorMessage } from '../errors'\nimport { validateResourcePathReal } from '../skills/validate'\nimport { containsNullByte } from './binary-detect'\nimport { toolPrompts } from './prompts'\n\n/** Options for {@link createSkillsReadTool}. */\nexport interface SkillsReadToolOptions {\n  /** Resolved skills the model may read from. */\n  catalog: readonly SkillConfig[]\n  /** Activation state. Only active skills can be read. */\n  state: SkillActivationState\n}\n\n/**\n * Creates the `skills_read` tool, which reads a bundled resource file of an active skill. Unknown skill names are rejected at runtime.\n *\n * @param options - Skill catalog and activation state.\n */\nexport function createSkillsReadTool(options: SkillsReadToolOptions): ToolDef {\n  const byName = new Map(options.catalog.map(s => [s.name, s]))\n\n  return {\n    // Read-only over the skill catalog — concurrency-safe.\n    isConcurrencySafe: true,\n    spec: {\n      name: 'skills_read',\n      description: toolPrompts.skills_read,\n      inputSchema: {\n        type: 'object',\n        properties: {\n          name: {\n            type: 'string',\n            description: 'The name of the active skill, as listed in the <available_skills> catalog.',\n          },\n          path: {\n            type: 'string',\n            description: 'Path to the resource, relative to the skill root. Cannot escape the skill directory.',\n          },\n        },\n        required: ['name', 'path'],\n        additionalProperties: false,\n      },\n    },\n\n    async execute(input, ctx: ToolContext): Promise<string> {\n      const skillName = input.name as string\n      const relPath = input.path as string\n\n      const skill = byName.get(skillName)\n      if (!skill) {\n        const available = [...byName.keys()].join(', ') || '<none>'\n        return `Error: unknown skill \"${skillName}\". Available skills: ${available}.`\n      }\n\n      if (!options.state.isActive(skillName))\n        return `Error: skill \"${skillName}\" is not active. Call skills_use with name: \"${skillName}\" first.`\n\n      if (!skill.baseDir) {\n        return (\n          `Error: skill \"${skillName}\" has no base directory `\n          + '(likely an inline skill without bundled resources); cannot read files.'\n        )\n      }\n\n      const validated = await validateResourcePathReal(relPath, skill.baseDir)\n      if (!validated.valid)\n        return `Error: ${validated.error}`\n\n      let content: string\n      try {\n        content = await ctx.execution.readFile(ctx.handle, validated.absolutePath)\n      }\n      catch (err) {\n        return `Error reading \"${relPath}\" in skill \"${skillName}\": ${errorMessage(err)}`\n      }\n\n      if (containsNullByte(content)) {\n        // `ExecutionContext.readFile` returns a UTF-8 string — invalid UTF-8\n        // bytes get replacement chars, so a round-trip through base64 would\n        // corrupt the payload. Instead of pretending we can deliver binary\n        // bytes, return a descriptor that tells the agent where the file is.\n        // This tool reads through the text-based `readFile` only (it does not\n        // use the optional `ExecutionContext.readFileBinary`), so host\n        // adapters needing binaries should stream them out-of-band.\n        return JSON.stringify({\n          kind: 'binary-unsupported',\n          path: validated.absolutePath,\n          note:\n            'This file appears to be binary. The skills_read tool returns text only; '\n            + 'binary files are not delivered through the execution context\\'s text-based readFile API.',\n        })\n      }\n\n      return content\n    },\n  }\n}\n","/**\n * `skills_run_script` tool — executes a script from an active skill's\n * `scripts/` directory via the agent's execution context.\n *\n * Path is validated against the skill's `baseDir` and constrained to the\n * `scripts/` subdirectory. Timeout is configurable via\n * `SkillsConfig.scriptTimeoutMs` (default 60 s).\n */\n\nimport type { SkillActivationState } from '../skills/activation'\nimport type { SkillConfig } from '../skills/types'\nimport type { ToolContext, ToolDef } from './types'\nimport { errorMessage } from '../errors'\nimport { validateResourcePathReal } from '../skills/validate'\nimport { toolPrompts } from './prompts'\nimport { alwaysQuote } from './shell-quote'\n\n/** Options for {@link createSkillsRunScriptTool}. */\nexport interface SkillsRunScriptToolOptions {\n  /** Resolved skills whose scripts the model may run. */\n  catalog: readonly SkillConfig[]\n  /** Activation state. Only active skills can run scripts. */\n  state: SkillActivationState\n  /** Script timeout in milliseconds. Default 60000. */\n  scriptTimeoutMs?: number\n}\n\nconst ABS_WINDOWS_RE = /^[a-z]:[\\\\/]/i\nconst COLLAPSE_SLASHES_RE = /\\/+/g\n\n/**\n * Creates the `skills_run_script` tool, which runs a script from an active skill's `scripts/` directory in the execution context.\n *\n * @param options - Skill catalog, activation state and script timeout.\n */\nexport function createSkillsRunScriptTool(options: SkillsRunScriptToolOptions): ToolDef {\n  const byName = new Map(options.catalog.map(s => [s.name, s]))\n  const timeoutMs = options.scriptTimeoutMs ?? 60_000\n\n  return {\n    spec: {\n      name: 'skills_run_script',\n      description: toolPrompts.skills_run_script,\n      inputSchema: {\n        type: 'object',\n        properties: {\n          name: {\n            type: 'string',\n            description: 'The name of the active skill, as listed in the <available_skills> catalog.',\n          },\n          script: {\n            type: 'string',\n            description: 'Path to the script relative to the skill\\'s scripts/ directory (e.g. \"extract.py\", \"merge.sh\").',\n          },\n          args: {\n            type: 'array',\n            items: { type: 'string' },\n            description: 'Optional argv array passed to the script.',\n          },\n        },\n        required: ['name', 'script'],\n        additionalProperties: false,\n      },\n    },\n\n    async execute(input, ctx: ToolContext): Promise<string> {\n      const skillName = input.name as string\n      const scriptRel = input.script as string\n      const args = (input.args as string[] | undefined) ?? []\n\n      const skill = byName.get(skillName)\n      if (!skill) {\n        const available = [...byName.keys()].join(', ') || '<none>'\n        return `Error: unknown skill \"${skillName}\". Available skills: ${available}.`\n      }\n\n      if (!options.state.isActive(skillName))\n        return `Error: skill \"${skillName}\" is not active. Call skills_use with name: \"${skillName}\" first.`\n\n      if (!skill.baseDir)\n        return `Error: skill \"${skillName}\" has no base directory (likely an inline skill); cannot run scripts.`\n\n      // Reject absolute script paths up front — otherwise they'd be spuriously\n      // \"normalized\" under scripts/ by the join below.\n      if (scriptRel.startsWith('/') || ABS_WINDOWS_RE.test(scriptRel))\n        return `Error: Absolute paths are not allowed (\"${scriptRel}\").`\n\n      // Resolve under scripts/ and validate — rejects escapes via `..`.\n      const joinedPath = `scripts/${scriptRel}`.replace(COLLAPSE_SLASHES_RE, '/')\n      const validated = await validateResourcePathReal(joinedPath, skill.baseDir)\n      if (!validated.valid)\n        return `Error: ${validated.error}`\n\n      // Build a shell command that honors shebang (via POSIX exec). For\n      // languages without shebang (e.g. Python on Windows-authored files),\n      // the script's first-line `#!/usr/bin/env python3` handles it.\n      const cmd = [validated.absolutePath, ...args].map(alwaysQuote).join(' ')\n      try {\n        // Forward `ctx.signal` so a per-call cancel (or run abort) sends\n        // SIGTERM to the script — same rationale as the shell tool: without\n        // it, a long-running script keeps consuming compute after the\n        // model has already moved on with the cancellation marker.\n        const result = await ctx.execution.exec(ctx.handle, cmd, {\n          timeout: Math.max(1, Math.round(timeoutMs / 1000)),\n          signal: ctx.signal,\n        })\n        return JSON.stringify({\n          exitCode: result.exitCode,\n          stdout: result.stdout,\n          stderr: result.stderr,\n        })\n      }\n      catch (err) {\n        return `Error running script \"${scriptRel}\" for skill \"${skillName}\": ${errorMessage(err)}`\n      }\n    },\n  }\n}\n","/**\n * `skills_use` tool — activates or deactivates a skill from the model side.\n *\n * Implements tier 2 of progressive disclosure per the Agent Skills spec.\n *\n * Two modes:\n *\n *   - `mode: \"activate\"` (default, spec-mandated) — loads the skill's full\n *     instructions, fires `skills:activate` with `via: 'model'`, and\n *     returns the frontmatter-stripped body wrapped in `<skill_content>`\n *     tags. Shell-interpolation (`!`` `cmd` ``) runs per-activation so\n *     values like `gh pr diff` reflect the current state.\n *   - `mode: \"deactivate\"` (zidane extension) — releases an active skill,\n *     fires `skills:deactivate` with `reason: 'model'`. The matching\n *     skill's `allowed-tools` restrictions stop applying on the next\n *     dispatch. Use this when the skill's job is done and its tool\n *     allow-list is now blocking unrelated follow-up work.\n *\n * The deactivate mode is what lets the model recover from a stuck\n * `AgentToolNotAllowedError` (the canonical hint of which points the\n * model right back here) without waiting for a run boundary.\n */\n\nimport type { Hookable } from 'hookable'\nimport type { AgentHooks } from '../agent'\nimport type { SkillActivationState } from '../skills/activation'\nimport type { ShellInterpolationApproval, SkillConfig } from '../skills/types'\nimport type { ToolContext, ToolDef } from './types'\nimport { interpolateShellCommands, stripShellInterpolations } from '../skills/interpolate'\nimport { escapeXml } from '../xml'\nimport { toolPrompts } from './prompts'\n\n/** Options for {@link createSkillsUseTool}. */\nexport interface SkillsUseToolOptions {\n  /** Resolved skills catalog for this run. */\n  catalog: readonly SkillConfig[]\n  /** Per-agent activation state the tool mutates. */\n  state: SkillActivationState\n  /** Agent hooks — used to fire `skills:activate` on first activation. */\n  hooks: Hookable<AgentHooks>\n  /**\n   * Execute `!\\`cmd\\`` shell interpolation on activation. Mirrors\n   * `SkillsConfig.allowShellInterpolation`. Default `true`. Interpolation\n   * runs arbitrary shell from (possibly third-party) skill content, outside\n   * the allowed-tools gate — set `false` for locked-down hosts. When off,\n   * patterns are replaced with a `[shell interpolation disabled]`\n   * placeholder.\n   */\n  allowShellInterpolation?: boolean\n  /**\n   * Optional approval gate for `!\\`cmd\\`` shell interpolation. Invoked once\n   * per (skill, command) the first time a skill with embedded shell is\n   * activated, BEFORE the command runs. Return `false` to skip that command\n   * (it is replaced with a `[shell interpolation not approved]` placeholder).\n   * When omitted, interpolation runs without prompting. Hosts\n   * (TUI/GUI) can wire this to an interactive confirmation.\n   */\n  approveShellInterpolation?: (request: ShellInterpolationApproval) => boolean | Promise<boolean>\n}\n\nexport type { ShellInterpolationApproval } from '../skills/types'\n\nconst MAX_RESOURCE_LIST = 50\n\nfunction buildSkillContentWrapper(skill: SkillConfig, body: string): string {\n  const parts: string[] = []\n  parts.push(`<skill_content name=\"${escapeXml(skill.name)}\" spec_version=\"0.1\">`)\n  parts.push(body)\n\n  if (skill.baseDir) {\n    parts.push('')\n    parts.push(`Skill directory: ${skill.baseDir}`)\n    parts.push('Relative paths resolve against this directory.')\n  }\n\n  if (skill.resources?.length) {\n    parts.push('')\n    parts.push('<skill_resources>')\n    const shown = skill.resources.slice(0, MAX_RESOURCE_LIST)\n    for (const res of shown) {\n      parts.push(`  <file type=\"${res.type}\">${escapeXml(res.path)}</file>`)\n    }\n    if (skill.resources.length > MAX_RESOURCE_LIST) {\n      parts.push(`  <!-- …(${skill.resources.length - MAX_RESOURCE_LIST} more) -->`)\n    }\n    parts.push('</skill_resources>')\n  }\n\n  if (skill.compatibility) {\n    parts.push('')\n    parts.push(`Compatibility: ${skill.compatibility}`)\n  }\n\n  if (skill.allowedTools?.length) {\n    parts.push(`Allowed tools: ${skill.allowedTools.join(' ')}`)\n  }\n\n  parts.push('</skill_content>')\n  return parts.join('\\n')\n}\n\n/**\n * Factory for `skills_use`. Auto-injected into the agent's tool set by the\n * agent runtime when a non-empty skills catalog is available (unless\n * `SkillsConfig.tool === false`).\n *\n * The `name` property carries no `enum` so the tool list stays byte-stable\n * across catalogs; unknown names are rejected at runtime with the list of\n * available skills.\n * @param options - Skill catalog, activation state, hooks and shell interpolation settings.\n */\nexport function createSkillsUseTool(options: SkillsUseToolOptions): ToolDef {\n  const byName = new Map(options.catalog.map(s => [s.name, s]))\n  // Cache interpolated bodies for the lifetime of this tool instance. The\n  // agent rebuilds skills tools per-run, so this cache naturally resets on\n  // each run boundary — avoiding stale shell output from a prior run.\n  const interpolatedBodyCache = new Map<string, string>()\n\n  return {\n    spec: {\n      name: 'skills_use',\n      description: toolPrompts.skills_use,\n      inputSchema: {\n        type: 'object',\n        properties: {\n          name: {\n            type: 'string',\n            description: 'The name of the skill to activate or deactivate, as listed in the <available_skills> catalog.',\n          },\n          mode: {\n            type: 'string',\n            enum: ['activate', 'deactivate'],\n            description: 'Whether to activate (load + apply the skill) or deactivate (release an active skill). Default: \"activate\".',\n          },\n        },\n        required: ['name'],\n        additionalProperties: false,\n      },\n    },\n\n    async execute(input, ctx: ToolContext): Promise<string> {\n      const skillName = input.name as string\n      const skill = byName.get(skillName)\n      if (!skill) {\n        const available = [...byName.keys()].join(', ') || '<none>'\n        return `Error: unknown skill \"${skillName}\". Available skills: ${available}.`\n      }\n\n      const mode = (input.mode as string | undefined) ?? 'activate'\n\n      if (mode === 'deactivate') {\n        const removed = options.state.deactivate(skillName)\n        if (!removed) {\n          // Idempotent: deactivating a non-active skill is a no-op rather\n          // than an error — the model has no reliable way to know whether a\n          // prior run-end pass already cleared the activation, and a\n          // confirmation is more useful than a failure here.\n          return `Skill \"${skillName}\" was not active: nothing to deactivate.`\n        }\n        await options.hooks.callHook('skills:deactivate', { skill: removed.skill, reason: 'model' })\n        const remaining = options.state.active().map(a => a.skill.name)\n        const tail = remaining.length > 0\n          ? ` Remaining active skills: ${remaining.join(', ')}.`\n          : ' No skills are currently active.'\n        return `Skill \"${skillName}\" deactivated: its allowed-tools restrictions no longer apply.${tail}`\n      }\n\n      const wasActive = options.state.isActive(skillName)\n\n      if (!wasActive) {\n        const outcome = options.state.activate(skill, 'model')\n        if (outcome === 'cap-reached') {\n          const activeNames = options.state.active().map(a => a.skill.name).join(', ')\n          return (\n            `Error: cannot activate \"${skillName}\": the maxActive skill cap has been reached. `\n            + `Currently active: ${activeNames}. Call \\`skills_use\\` with \\`mode: \"deactivate\"\\` and one of those names first.`\n          )\n        }\n        await options.hooks.callHook('skills:activate', { skill, via: 'model' })\n      }\n\n      // Interpolate `!\\`cmd\\`` once per (skill, tool-instance). A second\n      // `skills_use` call on the same skill returns the cached body.\n      // Interpolation runs unless `allowShellInterpolation: false`; when\n      // disabled the patterns are neutralized with a placeholder. An optional\n      // `approveShellInterpolation` gate can veto individual commands.\n      let body = interpolatedBodyCache.get(skillName)\n      if (body === undefined) {\n        if (!skill.instructions.includes('!`')) {\n          body = skill.instructions\n        }\n        else if (options.allowShellInterpolation !== false) {\n          const failures: string[] = []\n          const approve = options.approveShellInterpolation\n          body = await interpolateShellCommands(skill.instructions, ctx.execution, ctx.handle, {\n            onFailure: command => failures.push(command),\n            ...(approve\n              ? { approve: (command: string) => approve({ skillName, source: skill.source, command }) }\n              : {}),\n          })\n          // Surface partial interpolation failure in the activation result —\n          // the inline `[command failed …]` markers alone are easy to read\n          // past, and the model should know the content may be incomplete.\n          if (failures.length > 0) {\n            body += `\\n\\nWarning: ${failures.length} shell interpolation command${failures.length === 1 ? '' : 's'} failed during activation (${failures.map(c => `\\`${c}\\``).join(', ')}). The instructions above may be missing dynamic content; see the inline [command failed …] markers.`\n          }\n        }\n        else {\n          body = stripShellInterpolations(skill.instructions)\n        }\n        interpolatedBodyCache.set(skillName, body)\n      }\n\n      return buildSkillContentWrapper(skill, body)\n    },\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAiBA,SAAgB,UAAU,OAA0C;CAClE,IAAI,MAAM,SAAS,IACjB,OAAO,KAAA;CAET,IAAI,MAAM,OAAO,OAAQ,MAAM,OAAO,MAAQ,MAAM,OAAO,MAAQ,MAAM,OAAO,IAAM;EACpF,IAAI,MAAM,SAAS,IACjB,OAAO,KAAA;EACT,OAAO,SAAS,UAAU,OAAO,EAAE,GAAG,UAAU,OAAO,EAAE,CAAC;CAC5D;CAEA,IAAI,MAAM,OAAO,MAAQ,MAAM,OAAO,MAAQ,MAAM,OAAO,IACzD,OAAO,SAAS,MAAM,KAAO,MAAM,MAAO,GAAI,MAAM,KAAO,MAAM,MAAO,CAAE;CAE5E,IAAI,MAAM,UAAU,MAAM,MAAM,OAAO,MAAQ,MAAM,OAAO,MAAQ,MAAM,OAAO,MAAQ,MAAM,OAAO,IACpG,OAAO,SAAS,KAAK;CACvB,IAAI,MAAM,OAAO,OAAQ,MAAM,OAAO,KACpC,OAAO,SAAS,KAAK;AAEzB;;;;;;AAOA,SAAgB,oBAAoB,KAAoC;CAGtE,MAAM,QAAQ,UAAU,OAAO,KAAK,IAAI,MAAM,GAAG,EAAE,GAAG,QAAQ,CAAC;CAC/D,IAAI,OACF,OAAO;CACT,MAAM,OAAO,OAAO,KAAK,IAAI,MAAM,GAAG,KAAM,GAAG,QAAQ;CACvD,MAAM,OAAO,UAAU,IAAI;CAC3B,IAAI,QAAQ,KAAK,SAAS,SAAU,KAAK,OAAO,KAC9C,OAAO;CACT,OAAO,UAAU,OAAO,KAAK,KAAK,QAAQ,CAAC;AAC7C;AAEA,SAAS,SAAS,GAAsC;CACtD,MAAM,QAAQ,OAAO,aAAa,EAAE,KAAM,EAAE,KAAM,EAAE,KAAM,EAAE,GAAI;CAChE,IAAI,UAAU,QACZ,OAAO,SAAS,KAAK,EAAE,MAAQ,EAAE,OAAQ,IAAM,EAAE,OAAQ,KAAM,KAAK,EAAE,MAAQ,EAAE,OAAQ,IAAM,EAAE,OAAQ,GAAI;CAC9G,IAAI,UAAU,QAAQ;EACpB,MAAM,OAAO,EAAE,MAAQ,EAAE,OAAQ,IAAM,EAAE,OAAQ,KAAO,EAAE,OAAQ;EAClE,OAAO,UAAU,OAAO,SAAU,IAAK,SAAS,KAAM,SAAU,CAAC;CACnE;CACA,IAAI,UAAU,QACZ,OAAO,UAAU,EAAE,MAAQ,EAAE,OAAQ,KAAM,QAAS,EAAE,MAAQ,EAAE,OAAQ,KAAM,KAAM;AAExF;AAEA,SAAS,SAAS,GAAsC;CACtD,IAAI,IAAI;CACR,OAAO,IAAI,IAAI,EAAE,QAAQ;EACvB,IAAI,EAAE,OAAO,KAAM;GACjB;GACA;EACF;EACA,MAAM,SAAS,EAAE,IAAI;EAErB,IAAI,WAAW,OAAQ,WAAW,KAAS,UAAU,OAAQ,UAAU,KAAO;GAC5E;GACA;EACF;EAEA,IAAI,UAAU,OAAQ,UAAU,OAAQ,WAAW,OAAQ,WAAW,OAAQ,WAAW,KACvF,OAAO,SAAU,EAAE,IAAI,MAAO,IAAK,EAAE,IAAI,IAAM,EAAE,IAAI,MAAO,IAAK,EAAE,IAAI,EAAG;EAC5E,KAAK,KAAM,EAAE,IAAI,MAAO,IAAK,EAAE,IAAI;CACrC;AAEF;AAEA,SAAS,UAAU,GAAe,GAAmB;CACnD,QAAS,EAAE,MAAO,OAAQ,MAAM,EAAE,IAAI,MAAO,OAAO,EAAE,IAAI,MAAO,KAAK,EAAE,IAAI;AAC9E;AAEA,SAAS,SAAS,OAAe,QAAuC;CACtE,OAAO,QAAQ,KAAK,SAAS,IAAI;EAAE;EAAO;CAAO,IAAI,KAAA;AACvD;;;;;;;;;;;;;;;;;;;AC1EA,MAAM,oBAAoB;AAE1B,MAAM,YAAY,OAAO,KAAK;CAAC;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;AAAI,CAAC;;;;;;AAe9E,SAAgB,kBACd,MACA,WACA,SACiD;CACjD,IAAI,EAAE,UAAU,MAAM,cAAc,aAClC,OAAO,KAAA;CACT,MAAM,OAAO,oBAAoB,IAAI;CACrC,IAAI,CAAC,QAAQ,KAAK,IAAI,KAAK,OAAO,KAAK,MAAM,KAAK,SAChD,OAAO,KAAA;CACT,MAAM,MAAM,aAAa,OAAO,KAAK,MAAM,QAAQ,GAAG,OAAO;CAC7D,OAAO,MAAM;EAAE,MAAM,IAAI,SAAS,QAAQ;EAAG,WAAW;CAAY,IAAI,KAAA;AAC1E;;AAGA,SAAgB,aAAa,OAAmB,SAAqC;CACnF,IAAI;EACF,MAAM,MAAM,UAAU,KAAK;EAC3B,IAAI,CAAC,KACH,OAAO,KAAA;EACT,MAAM,QAAQ,UAAU,KAAK,IAAI,IAAI,OAAO,IAAI,MAAM;EACtD,IAAI,SAAS,GACX,OAAO,KAAA;EACT,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,QAAQ,KAAK,CAAC;EACvD,MAAM,SAAS,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,SAAS,KAAK,CAAC;EACzD,OAAO,UAAU;GAAE;GAAO;GAAQ,UAAU,IAAI;GAAU,QAAQ,WAAW,KAAK,OAAO,MAAM;EAAE,CAAC;CACpG,QACM;EACJ;CACF;AACF;AAEA,SAAgB,UAAU,OAA2C;CACnE,MAAM,MAAM,OAAO,KAAK,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU;CACxE,IAAI,IAAI,SAAS,MAAM,CAAC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,OAAO,SAAS,GACzD,OAAO,KAAA;CACT,IAAI,QAAQ;CACZ,IAAI,SAAS;CACb,IAAI,YAAY;CAChB,IAAI;CACJ,IAAI;CACJ,MAAM,OAAiB,CAAC;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,SAAS;EACpC,MAAM,MAAM,IAAI,aAAa,CAAC;EAC9B,MAAM,OAAO,IAAI,SAAS,UAAU,IAAI,GAAG,IAAI,CAAC;EAChD,MAAM,OAAO,IAAI,SAAS,IAAI,GAAG,IAAI,IAAI,GAAG;EAC5C,IAAI,KAAK,WAAW,KAClB,OAAO,KAAA;EACT,IAAI,SAAS,QAAQ;GACnB,QAAQ,KAAK,aAAa,CAAC;GAC3B,SAAS,KAAK,aAAa,CAAC;GAC5B,YAAY,KAAK;GAEjB,IAAI,KAAK,OAAO,KAAK,KAAK,QAAQ,KAAK,KAAK,QAAQ,KAAK,KAAK,QAAQ,GACpE,OAAO,KAAA;EACX,OACK,IAAI,SAAS,QAAU,UAAU;OACjC,IAAI,SAAS,QAAU,OAAO;OAC9B,IAAI,SAAS,QAAU,KAAK,KAAK,IAAI;OACrC,IAAI,SAAS,QAAU;EAC5B,KAAK,KAAK;CACZ;CACA,MAAM,cAAe;EAAE,GAAG;EAAG,GAAG;EAAG,GAAG;EAAG,GAAG;EAAG,GAAG;CAAE,EAA6B;CACjF,IAAI,CAAC,eAAe,UAAU,KAAK,WAAW,KAAK,QAAQ,SAAS,qBAAqB,KAAK,WAAW,GACvG,OAAO,KAAA;CAET,IAAI,QAAQ,cAAc,GACxB,OAAO,KAAA;CACT,IAAI,cAAc,KAAK,CAAC,SACtB,OAAO,KAAA;CAET,MAAM,SAAS,QAAQ;CAGvB,MAAM,MAAM,YAAY,OAAO,OAAO,IAAI,GAAG,EAAE,kBAAkB,SAAS,KAAK,OAAO,CAAC;CACvF,IAAI,IAAI,UAAU,SAAS,KAAK,QAC9B,OAAO,KAAA;CACT,MAAM,OAAO,SAAS,KAAK,OAAO,QAAQ,WAAW;CAErD,IAAI,cAAc,GAChB,OAAO;EAAE;EAAO;EAAQ,UAAU;EAAa,QAAQ;CAAK;CAE9D,MAAM,WAAW,OAAO,IAAI;CAC5B,MAAM,SAAS,IAAI,WAAW,QAAQ,SAAS,QAAQ;CACvD,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,KAAK,UAAU;EAC1D,MAAM,MAAM,KAAK;EACjB,OAAO,KAAK,QAAS,MAAM,MAAM;EACjC,OAAO,IAAI,KAAK,QAAS,MAAM,IAAI,MAAM;EACzC,OAAO,IAAI,KAAK,QAAS,MAAM,IAAI,MAAM;EACzC,IAAI,aAAa,GACf,OAAO,IAAI,KAAK,MAAM,KAAM,SAAS,KAAM,OAAQ;CACvD;CACA,OAAO;EAAE;EAAO;EAAQ;EAAU;CAAO;AAC3C;AAEA,SAAS,SAAS,KAAiB,OAAe,QAAgB,KAAyB;CACzF,MAAM,SAAS,QAAQ;CACvB,MAAM,MAAM,IAAI,WAAW,SAAS,MAAM;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;EAC/B,MAAM,SAAS,IAAI,KAAK,SAAS;EACjC,MAAM,MAAM,KAAK,SAAS,KAAK;EAC/B,MAAM,MAAM,IAAI;EAChB,MAAM,OAAO,MAAM;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,IAAI,KAAK,MAAM,IAAI,MAAM,IAAI,OAAQ;GAC3C,MAAM,IAAI,IAAI,IAAI,IAAI,OAAO,KAAM;GACnC,MAAM,IAAI,KAAK,OAAO,IAAI,IAAI,IAAI,OAAO,IAAI,OAAQ;GACrD,MAAM,IAAI,IAAI,MAAM;GACpB,QAAQ,QAAR;IACE,KAAK;KAAG,IAAI,MAAM,KAAK;KAAG;IAC1B,KAAK;KAAG,IAAI,MAAM,KAAK,IAAI;KAAG;IAC9B,KAAK;KAAG,IAAI,MAAM,KAAK,IAAI;KAAG;IAC9B,KAAK;KAAG,IAAI,MAAM,KAAK,KAAM,IAAI,KAAM;KAAI;IAC3C,KAAK;KAAG,IAAI,MAAM,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC;KAAG;IAC3C,SAAS,MAAM,IAAI,MAAM,kBAAkB,QAAQ;GACrD;EACF;CACF;CACA,OAAO;AACT;AAEA,SAAS,MAAM,GAAW,GAAW,GAAmB;CACtD,MAAM,IAAI,IAAI,IAAI;CAClB,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;CACzB,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;CACzB,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;CACzB,OAAO,MAAM,MAAM,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI;AACnD;;;;;;;AAQA,SAAS,WAAW,KAAiB,OAAe,QAA4B;CAC9E,MAAM,EAAE,UAAU,OAAO;CACzB,MAAM,QAAQ,OAAO,KAAK,OAAO,IAAI,KAAK,IAAI;CAC9C,MAAM,KAAK,SAAS,IAAI,OAAO,KAAK;CACpC,MAAM,KAAK,SAAS,IAAI,QAAQ,MAAM;CAGtC,MAAM,MAAM,IAAI,aAAa,IAAI,SAAS,QAAQ,EAAE;CACpD,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,MAAM,OAAO,IAAI,IAAI,QAAQ;EAC7B,MAAM,OAAO,IAAI,QAAQ;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,EAAE,OAAO,YAAY,GAAG;GAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;IACvC,MAAM,IAAI,QAAQ,QAAQ,KAAK;IAC/B,MAAM,IAAI,QAAQ;IAClB,MAAM,KAAK,SAAS,IAAI,IAAI,IAAI,OAAO,IAAI,SAAU,MAAM;IAC3D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACtB,IAAI,OAAO,IAAI,KAAK,OAAQ,MAAM,QAAQ,IAAI,MAAM,IAAI,OAAO,IAAI;GACvE;EACF;CACF;CAGA,MAAM,MAAM,IAAI,WAAW,QAAQ,SAAS,EAAE;CAC9C,MAAM,MAAM,IAAI,aAAa,EAAE;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;EAC/B,MAAM,EAAE,OAAO,YAAY,GAAG;EAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,IAAI,KAAK,CAAC;GACV,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;IACvC,MAAM,MAAM,QAAQ,KAAK,QAAQ,KAAK;IACtC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACtB,IAAI,MAAO,QAAQ,KAAM,IAAI,IAAI;GACrC;GACA,MAAM,KAAK,IAAI,QAAQ,KAAK;GAC5B,MAAM,IAAI,SAAS,IAAI,IAAI,SAAU;GACrC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;IAC3B,MAAM,IAAI,MAAM,QAAQ,IAAI,KAAM,SAAS,IAAK,IAAI,IAAI,IAAI,KAAM,MAAM,IAAI,IAAK,IAAI;IACrF,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC;GACvD;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAS,SAAS,QAAgB,QAAiE;CACjG,MAAM,QAAQ,SAAS;CACvB,MAAM,SAA0D,CAAC;CACjE,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;EAC/B,MAAM,KAAK,IAAI;EACf,MAAM,KAAK,KAAK,IAAI,SAAS,IAAI,KAAK,KAAK;EAC3C,MAAM,QAAQ,KAAK,MAAM,EAAE;EAC3B,MAAM,MAAM,KAAK,KAAK,EAAE;EACxB,MAAM,UAAU,IAAI,aAAa,MAAM,KAAK;EAC5C,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAC3B,QAAQ,IAAI,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK;EACjE,OAAO,KAAK;GAAE;GAAO;EAAQ,CAAC;CAChC;CACA,OAAO;AACT;AAEA,SAAgB,UAAU,KAAyB;CACjD,MAAM,EAAE,OAAO,QAAQ,UAAU,IAAI,WAAW;CAChD,MAAM,YAAa;EAAE,GAAG;EAAG,GAAG;EAAG,GAAG;EAAG,GAAG;CAAE,EAA6B;CACzE,MAAM,SAAS,QAAQ;CACvB,MAAM,WAAW,OAAO,OAAO,SAAS,KAAK,MAAM;CACnD,MAAM,YAAY,OAAO,MAAM,MAAM;CAGrC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;EAC/B,MAAM,MAAM,IAAI;EAChB,IAAI,OAAO,OAAO;EAClB,IAAI,aAAa;EACjB,IAAI,YAAY,OAAO,MAAM,CAAC;EAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GAC1B,IAAI,QAAQ;GACZ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,IAAI,KAAK,KAAK,OAAO,MAAM,IAAI,MAAO;IAC5C,MAAM,IAAI,IAAI,IAAI,OAAO,MAAM,SAAS,KAAM;IAC9C,MAAM,IAAI,KAAK,MAAM,IAAI,IAAI,OAAO,MAAM,SAAS,IAAI,MAAO;IAC9D,MAAM,IAAI,OAAO,MAAM;IACvB,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,KAAM,IAAI,KAAM,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,KAAK;IAClH,UAAU,KAAK;IACf,SAAS,IAAI,MAAM,IAAI,MAAM;GAC/B;GACA,IAAI,QAAQ,MAAM;IAChB,OAAO;IACP,aAAa;IACb,YAAY,OAAO,KAAK,SAAS;GACnC;EACF;EACA,SAAS,KAAK,SAAS,MAAM;EAC7B,UAAU,KAAK,UAAU,KAAK,SAAS,KAAK,CAAC;CAC/C;CACA,MAAM,OAAO,OAAO,MAAM,EAAE;CAC5B,KAAK,cAAc,OAAO,CAAC;CAC3B,KAAK,cAAc,QAAQ,CAAC;CAC5B,KAAK,KAAK;CACV,KAAK,KAAK;CACV,OAAO,OAAO,OAAO;EACnB;EACA,MAAM,QAAQ,IAAI;EAClB,MAAM,QAAQ,YAAY,QAAQ,CAAC;EACnC,MAAM,QAAQ,OAAO,MAAM,CAAC,CAAC;CAC/B,CAAC;AACH;AAEA,SAAS,MAAM,MAAc,MAAsB;CACjD,MAAM,OAAO,OAAO,MAAM,CAAC;CAC3B,KAAK,cAAc,KAAK,QAAQ,CAAC;CACjC,KAAK,MAAM,MAAM,GAAG,QAAQ;CAC5B,MAAM,MAAM,OAAO,MAAM,CAAC;CAC1B,IAAI,cAAc,MAAM,OAAO,OAAO,CAAC,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC;CACnE,OAAO,OAAO,OAAO;EAAC;EAAM;EAAM;CAAG,CAAC;AACxC;AAEA,IAAI;AACJ,SAAS,MAAM,OAA2B;CACxC,IAAI,CAAC,UAAU;EACb,2BAAW,IAAI,YAAY,GAAG;EAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;GAC5B,IAAI,IAAI;GACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,IAAI,IAAI,IAAI,aAAc,MAAM,IAAK,MAAM;GAC7C,SAAS,KAAK,MAAM;EACtB;CACF;CACA,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,IAAI,UAAU,IAAI,MAAM,MAAO,OAAU,MAAM;CACjD,QAAQ,IAAI,gBAAgB;AAC9B;;;ACvNA,MAAM,gBAAgB;AAEtB,SAAS,YAAY,SAAmC,OAAgC;CACtF,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC,YAAY;CACnC,IAAI,CAAC,GACH,OAAO,CAAC,GAAG,OAAO;CAKpB,MAAM,WAA4B,CAAC;CACnC,MAAM,WAA4B,CAAC;CACnC,KAAK,MAAM,SAAS,SAClB,IAAI,MAAM,KAAK,YAAY,CAAC,CAAC,SAAS,CAAC,GACrC,SAAS,KAAK,KAAK;MAChB,IAAI,MAAM,YAAY,YAAY,CAAC,CAAC,SAAS,CAAC,GACjD,SAAS,KAAK,KAAK;CAEvB,OAAO,CAAC,GAAG,UAAU,GAAG,QAAQ;AAClC;;;;;;;;;;;;;;;;AAiBA,SAAS,qBAAqB,YAA4B;CACxD,OAAO,WAAW,QAAQ,MAAM,SAAS;AAC3C;AAEA,SAAS,YAAY,OAA8B;CACjD,MAAM,SAAS,qBAAqB,KAAK,UAAU,MAAM,WAAW,CAAC;CACrE,MAAM,aAAa,MAAM,SAAS,YAAY,UAAU,MAAM,MAAM,EAAE,KAAK;CAC3E,OAAO;EACL,iBAAiB,UAAU,MAAM,IAAI,EAAE,GAAG,WAAW;EACrD,oBAAoB,UAAU,MAAM,WAAW,EAAE;EACjD,qBAAqB,OAAO;EAC5B;CACF,CAAC,CAAC,KAAK,IAAI;AACb;;;;;;;;;;;;AA4BA,SAAgB,wBACd,SACA,OACA,eAAuB,eACN;CACjB,MAAM,SAAS,IAAI,IAAI,QAAQ,KAAI,MAAK,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACpD,MAAM,2BAAW,IAAI,IAA6B;CAClD,KAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,CAAC,MAAM,QACT;EACF,MAAM,OAAO,SAAS,IAAI,MAAM,MAAM,KAAK,CAAC;EAC5C,KAAK,KAAK,KAAK;EACf,SAAS,IAAI,MAAM,QAAQ,IAAI;CACjC;CACA,MAAM,WAAW,KAAK,IAAI,QAAQ,QAAQ,CAAC;CAG3C,MAAM,SADW,OAAO,MAAM,UAAU,WAAW,MAAM,MAAM,KAAK,IAAI,KAAA,MAC9C,KAAA;CAC1B,MAAM,UAAU,MAAM,QAAQ,MAAM,KAAK,IACrC,MAAM,MAAM,QAAQ,MAAmB,OAAO,MAAM,YAAY,EAAE,SAAS,CAAC,IAC5E,KAAA;CACJ,MAAM,SAAS,OAAO,MAAM,WAAW,YAAY,MAAM,OAAO,SAAS,IAAI,MAAM,SAAS,KAAA;CAC5F,MAAM,UAAU,OAAO,MAAM,UAAU,YAAY,OAAO,SAAS,MAAM,KAAK,KAAK,MAAM,QAAQ,IAC7F,KAAK,MAAM,MAAM,KAAe,IAChC;CACJ,MAAM,QAAQ,KAAK,IAAI,SAAS,QAAQ;CAExC,MAAM,UAA2B,CAAC;CAClC,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,SAAmB,CAAC;CAE1B,IAAI,WAAW,QAAQ,SAAS,GAC9B,KAAK,MAAM,KAAK,SAAS;EACvB,IAAI,KAAK,IAAI,CAAC,GACZ;EACF,MAAM,QAAQ,OAAO,IAAI,CAAC;EAC1B,IAAI,OAAO;GACT,QAAQ,KAAK,KAAK;GAClB,KAAK,IAAI,CAAC;EACZ,OAEE,OAAO,KAAK,CAAC;CAEjB;CAGF,IAAI,QAAQ;EACV,MAAM,OAAO,SAAS,IAAI,MAAM,KAAK,CAAC;EACtC,KAAK,MAAM,SAAS,MAAM;GACxB,IAAI,KAAK,IAAI,MAAM,IAAI,GACrB;GACF,QAAQ,KAAK,KAAK;GAClB,KAAK,IAAI,MAAM,IAAI;EACrB;CACF;CAEA,IAAI,UAAU,KAAA,GACZ,KAAK,MAAM,SAAS,YAAY,SAAS,KAAK,GAAG;EAC/C,IAAI,KAAK,IAAI,MAAM,IAAI,GACrB;EACF,QAAQ,KAAK,KAAK;EAClB,KAAK,IAAI,MAAM,IAAI;CACrB;CAGF,IAAI,CAAC,SAAS,UAAU,CAAC,UAAU,UAAU,KAAA,GAC3C,KAAK,MAAM,SAAS,SAAS;EAC3B,QAAQ,KAAK,KAAK;EAClB,KAAK,IAAI,MAAM,IAAI;CACrB;CAGF,MAAM,YAAY,QAAQ,SAAS;CAEnC,OAAO;EAAE,OADK,YAAY,QAAQ,MAAM,GAAG,KAAK,IAAI;EACpC,OAAO,QAAQ;EAAQ;EAAW;EAAQ;EAAO;CAAO;AAC1E;;;;;;;;;;;;;;;;AAiBA,SAAgB,0BACd,SACA,OACA,UACA,cACA,WACM;CACN,MAAM,EAAE,UAAU,wBAAwB,SAAS,OAAO,gBAAgB,aAAa;CACvF,KAAK,MAAM,SAAS,OAAO;EACzB,SAAS,IAAI,MAAM,aAAa;EAChC,YAAY,MAAM,aAAa;CACjC;AACF;;;;;;;AAQA,SAAgB,qBAAqB,SAAyC;CAC5E,MAAM,eAAe,QAAQ,gBAAgB;CAC7C,MAAM,aAAa,QAAQ;CAE3B,OAAO;EAEL,mBAAmB;EACnB,MAAM;GACJ,MAAM;GACN,aAAa,CACX,YAAY,YAAY,MACxB,aAAa,YAAY,YAAY,YAAY,UAAU,IAAI,YAAY,YAAY,QACzF,CAAC,CAAC,KAAK,GAAG;GACV,aAAa;IACX,MAAM;IACN,YAAY;KACV,OAAO;MACL,MAAM;MACN,aAAa;KACf;KACA,OAAO;MACL,MAAM;MACN,OAAO,EAAE,MAAM,SAAS;MACxB,aAAa;KACf;KACA,QAAQ;MACN,MAAM;MACN,aAAa;KACf;KACA,OAAO;MACL,MAAM;MACN,SAAS;MACT,aAAa,qCAAqC,aAAa;KACjE;IACF;IACA,sBAAsB;GACxB;EACF;EAEA,MAAM,QAAQ,OAAO,KAAmC;GAGtD,IAAI,IAAI,QAAQ,SACd,OAAO;GAET,IAAI,QAAQ,QAAQ,WAAW,GAC7B,OAAO;GAET,MAAM,EAAE,OAAO,OAAO,WAAW,QAAQ,OAAO,WAAW,wBACzD,QAAQ,SACR,OACA,YACF;GAQA,KAAK,MAAM,SAAS,OAAO;IACzB,QAAQ,SAAS,IAAI,MAAM,aAAa;IACxC,QAAQ,YAAY,MAAM,aAAa;GACzC;GAEA,MAAM,QAAkB,CAAC;GACzB,MAAM,YAAY,QAAQ,WAAW,UAAU,KAAK,EAAE,KAAK;GAC3D,MAAM,aAAa,SAAS,YAAY,UAAU,MAAM,EAAE,KAAK;GAC/D,MAAM,KAAK,iCAAiC,MAAM,OAAO,WAAW,MAAM,GAAG,YAAY,WAAW,EAAE;GACtG,IAAI,MAAM,WAAW,GACnB,MAAM,KAAK,+EAA+E;QAEvF;IACH,KAAK,MAAM,SAAS,OAClB,MAAM,KAAK,YAAY,KAAK,CAAC;IAC/B,MAAM,KAAK,EAAE;IACb,MAAM,KAAK,aACP,4CAA4C,WAAW,0FACvD,0EAA0E;IAC9E,IAAI,WACF,MAAM,KAAK,KAAK,QAAQ,MAAM,OAAO,yEAAyE;GAElH;GACA,IAAI,OAAO,SAAS,GAClB,MAAM,KAAK,aAAa,OAAO,IAAI,SAAS,CAAC,CAAC,KAAK,IAAI,EAAE,UAAU;GAErE,MAAM,KAAK,wBAAwB;GAEnC,OAAO,MAAM,KAAK,IAAI;EACxB;CACF;AACF;;;;;;;;ACrVA,SAAgB,qBAAqB,SAAyC;CAC5E,MAAM,SAAS,IAAI,IAAI,QAAQ,QAAQ,KAAI,MAAK,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CAE5D,OAAO;EAEL,mBAAmB;EACnB,MAAM;GACJ,MAAM;GACN,aAAa,YAAY;GACzB,aAAa;IACX,MAAM;IACN,YAAY;KACV,MAAM;MACJ,MAAM;MACN,aAAa;KACf;KACA,MAAM;MACJ,MAAM;MACN,aAAa;KACf;IACF;IACA,UAAU,CAAC,QAAQ,MAAM;IACzB,sBAAsB;GACxB;EACF;EAEA,MAAM,QAAQ,OAAO,KAAmC;GACtD,MAAM,YAAY,MAAM;GACxB,MAAM,UAAU,MAAM;GAEtB,MAAM,QAAQ,OAAO,IAAI,SAAS;GAClC,IAAI,CAAC,OAEH,OAAO,yBAAyB,UAAU,uBADxB,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,SACwB;GAG7E,IAAI,CAAC,QAAQ,MAAM,SAAS,SAAS,GACnC,OAAO,iBAAiB,UAAU,+CAA+C,UAAU;GAE7F,IAAI,CAAC,MAAM,SACT,OACE,iBAAiB,UAAU;GAK/B,MAAM,YAAY,MAAM,yBAAyB,SAAS,MAAM,OAAO;GACvE,IAAI,CAAC,UAAU,OACb,OAAO,UAAU,UAAU;GAE7B,IAAI;GACJ,IAAI;IACF,UAAU,MAAM,IAAI,UAAU,SAAS,IAAI,QAAQ,UAAU,YAAY;GAC3E,SACO,KAAK;IACV,OAAO,kBAAkB,QAAQ,cAAc,UAAU,KAAK,aAAa,GAAG;GAChF;GAEA,IAAI,iBAAiB,OAAO,GAQ1B,OAAO,KAAK,UAAU;IACpB,MAAM;IACN,MAAM,UAAU;IAChB,MACE;GAEJ,CAAC;GAGH,OAAO;EACT;CACF;AACF;;;ACjFA,MAAM,iBAAiB;AACvB,MAAM,sBAAsB;;;;;;AAO5B,SAAgB,0BAA0B,SAA8C;CACtF,MAAM,SAAS,IAAI,IAAI,QAAQ,QAAQ,KAAI,MAAK,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CAC5D,MAAM,YAAY,QAAQ,mBAAmB;CAE7C,OAAO;EACL,MAAM;GACJ,MAAM;GACN,aAAa,YAAY;GACzB,aAAa;IACX,MAAM;IACN,YAAY;KACV,MAAM;MACJ,MAAM;MACN,aAAa;KACf;KACA,QAAQ;MACN,MAAM;MACN,aAAa;KACf;KACA,MAAM;MACJ,MAAM;MACN,OAAO,EAAE,MAAM,SAAS;MACxB,aAAa;KACf;IACF;IACA,UAAU,CAAC,QAAQ,QAAQ;IAC3B,sBAAsB;GACxB;EACF;EAEA,MAAM,QAAQ,OAAO,KAAmC;GACtD,MAAM,YAAY,MAAM;GACxB,MAAM,YAAY,MAAM;GACxB,MAAM,OAAQ,MAAM,QAAiC,CAAC;GAEtD,MAAM,QAAQ,OAAO,IAAI,SAAS;GAClC,IAAI,CAAC,OAEH,OAAO,yBAAyB,UAAU,uBADxB,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,SACwB;GAG7E,IAAI,CAAC,QAAQ,MAAM,SAAS,SAAS,GACnC,OAAO,iBAAiB,UAAU,+CAA+C,UAAU;GAE7F,IAAI,CAAC,MAAM,SACT,OAAO,iBAAiB,UAAU;GAIpC,IAAI,UAAU,WAAW,GAAG,KAAK,eAAe,KAAK,SAAS,GAC5D,OAAO,2CAA2C,UAAU;GAG9D,MAAM,aAAa,WAAW,YAAY,QAAQ,qBAAqB,GAAG;GAC1E,MAAM,YAAY,MAAM,yBAAyB,YAAY,MAAM,OAAO;GAC1E,IAAI,CAAC,UAAU,OACb,OAAO,UAAU,UAAU;GAK7B,MAAM,MAAM,CAAC,UAAU,cAAc,GAAG,IAAI,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,KAAK,GAAG;GACvE,IAAI;IAKF,MAAM,SAAS,MAAM,IAAI,UAAU,KAAK,IAAI,QAAQ,KAAK;KACvD,SAAS,KAAK,IAAI,GAAG,KAAK,MAAM,YAAY,GAAI,CAAC;KACjD,QAAQ,IAAI;IACd,CAAC;IACD,OAAO,KAAK,UAAU;KACpB,UAAU,OAAO;KACjB,QAAQ,OAAO;KACf,QAAQ,OAAO;IACjB,CAAC;GACH,SACO,KAAK;IACV,OAAO,yBAAyB,UAAU,eAAe,UAAU,KAAK,aAAa,GAAG;GAC1F;EACF;CACF;AACF;;;ACvDA,MAAM,oBAAoB;AAE1B,SAAS,yBAAyB,OAAoB,MAAsB;CAC1E,MAAM,QAAkB,CAAC;CACzB,MAAM,KAAK,wBAAwB,UAAU,MAAM,IAAI,EAAE,sBAAsB;CAC/E,MAAM,KAAK,IAAI;CAEf,IAAI,MAAM,SAAS;EACjB,MAAM,KAAK,EAAE;EACb,MAAM,KAAK,oBAAoB,MAAM,SAAS;EAC9C,MAAM,KAAK,gDAAgD;CAC7D;CAEA,IAAI,MAAM,WAAW,QAAQ;EAC3B,MAAM,KAAK,EAAE;EACb,MAAM,KAAK,mBAAmB;EAC9B,MAAM,QAAQ,MAAM,UAAU,MAAM,GAAG,iBAAiB;EACxD,KAAK,MAAM,OAAO,OAChB,MAAM,KAAK,iBAAiB,IAAI,KAAK,IAAI,UAAU,IAAI,IAAI,EAAE,QAAQ;EAEvE,IAAI,MAAM,UAAU,SAAS,mBAC3B,MAAM,KAAK,YAAY,MAAM,UAAU,SAAS,kBAAkB,WAAW;EAE/E,MAAM,KAAK,oBAAoB;CACjC;CAEA,IAAI,MAAM,eAAe;EACvB,MAAM,KAAK,EAAE;EACb,MAAM,KAAK,kBAAkB,MAAM,eAAe;CACpD;CAEA,IAAI,MAAM,cAAc,QACtB,MAAM,KAAK,kBAAkB,MAAM,aAAa,KAAK,GAAG,GAAG;CAG7D,MAAM,KAAK,kBAAkB;CAC7B,OAAO,MAAM,KAAK,IAAI;AACxB;;;;;;;;;;;AAYA,SAAgB,oBAAoB,SAAwC;CAC1E,MAAM,SAAS,IAAI,IAAI,QAAQ,QAAQ,KAAI,MAAK,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CAI5D,MAAM,wCAAwB,IAAI,IAAoB;CAEtD,OAAO;EACL,MAAM;GACJ,MAAM;GACN,aAAa,YAAY;GACzB,aAAa;IACX,MAAM;IACN,YAAY;KACV,MAAM;MACJ,MAAM;MACN,aAAa;KACf;KACA,MAAM;MACJ,MAAM;MACN,MAAM,CAAC,YAAY,YAAY;MAC/B,aAAa;KACf;IACF;IACA,UAAU,CAAC,MAAM;IACjB,sBAAsB;GACxB;EACF;EAEA,MAAM,QAAQ,OAAO,KAAmC;GACtD,MAAM,YAAY,MAAM;GACxB,MAAM,QAAQ,OAAO,IAAI,SAAS;GAClC,IAAI,CAAC,OAEH,OAAO,yBAAyB,UAAU,uBADxB,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,SACwB;GAK7E,KAFc,MAAM,QAA+B,gBAEtC,cAAc;IACzB,MAAM,UAAU,QAAQ,MAAM,WAAW,SAAS;IAClD,IAAI,CAAC,SAKH,OAAO,UAAU,UAAU;IAE7B,MAAM,QAAQ,MAAM,SAAS,qBAAqB;KAAE,OAAO,QAAQ;KAAO,QAAQ;IAAQ,CAAC;IAC3F,MAAM,YAAY,QAAQ,MAAM,OAAO,CAAC,CAAC,KAAI,MAAK,EAAE,MAAM,IAAI;IAI9D,OAAO,UAAU,UAAU,gEAHd,UAAU,SAAS,IAC5B,6BAA6B,UAAU,KAAK,IAAI,EAAE,KAClD;GAEN;GAIA,IAAI,CAFc,QAAQ,MAAM,SAAS,SAE5B,GAAG;IAEd,IADgB,QAAQ,MAAM,SAAS,OAAO,OACpC,MAAM,eAEd,OACE,2BAA2B,UAAU,iEAFnB,QAAQ,MAAM,OAAO,CAAC,CAAC,KAAI,MAAK,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,IAGpC,EAAE;IAGvC,MAAM,QAAQ,MAAM,SAAS,mBAAmB;KAAE;KAAO,KAAK;IAAQ,CAAC;GACzE;GAOA,IAAI,OAAO,sBAAsB,IAAI,SAAS;GAC9C,IAAI,SAAS,KAAA,GAAW;IACtB,IAAI,CAAC,MAAM,aAAa,SAAS,IAAI,GACnC,OAAO,MAAM;SAEV,IAAI,QAAQ,4BAA4B,OAAO;KAClD,MAAM,WAAqB,CAAC;KAC5B,MAAM,UAAU,QAAQ;KACxB,OAAO,MAAM,yBAAyB,MAAM,cAAc,IAAI,WAAW,IAAI,QAAQ;MACnF,YAAW,YAAW,SAAS,KAAK,OAAO;MAC3C,GAAI,UACA,EAAE,UAAU,YAAoB,QAAQ;OAAE;OAAW,QAAQ,MAAM;OAAQ;MAAQ,CAAC,EAAE,IACtF,CAAC;KACP,CAAC;KAID,IAAI,SAAS,SAAS,GACpB,QAAQ,gBAAgB,SAAS,OAAO,8BAA8B,SAAS,WAAW,IAAI,KAAK,IAAI,6BAA6B,SAAS,KAAI,MAAK,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;IAEjL,OAEE,OAAO,yBAAyB,MAAM,YAAY;IAEpD,sBAAsB,IAAI,WAAW,IAAI;GAC3C;GAEA,OAAO,yBAAyB,OAAO,IAAI;EAC7C;CACF;AACF"}

package/dist/skills.d.ts

@@ -1,2 +1,2 @@
-import { $d as SkillInstallError, Af as SkillPickGroup, Bd as matchesAllowedTool, Bf as IMPLICITLY_ALLOWED_SKILL_TOOLS, Cf as SkillBrowseErrorCode, Df as RecommendedSkillSource, Ef as RECOMMENDED_SKILL_SOURCES, Fd as SkillTokenWeights, Ff as githubPreviewImageUrl, Gd as validateSkillName, Hd as validateResourcePath, Id as skillTokenWeights, If as groupSkillPicks, Jd as interpolateShellCommands, Kd as resolveSkills, Ld as SkillValidationIssue, Lf as skillCategory, Md as defineSkill, Mf as SkillSourceListing, Nd as writeSkillToDisk, Nf as SkillSourceSkill, Of as SkillInstallTarget, Pd as writeSkillsToDisk, Pf as githubAvatarUrl, Qd as SkillInstallCandidate, Rd as SkillValidationResult, Rf as skillPickKey, Sf as SkillBrowseError, Tf as clearSkillSourceCache, Ud as validateResourcePathReal, Vd as parseAllowedToolPattern, Vf as installAllowedToolsGate, Wd as validateSkillForWrite, Xd as SKILL_PROVENANCE_FILE, Yd as stripShellInterpolations, Zd as SkillCandidateDetail, _f as SKILL_CANDIDATE_MAX_DEPTH, aE as SkillConfig, af as listSkillCandidates, ax as createSkillActivationState, bf as skillCandidatesFromPaths, cE as SkillSource, cf as SourcedScanPath, df as inferSource, ef as SkillInstallErrorCode, ex as ActivationVia, ff as parseFrontmatter, gf as skillCatalogEntry, hf as buildCatalog, iE as ShellInterpolationApproval, if as installSkillFromSpec, ix as SkillActivationStateOptions, jf as SkillSourceInfo, kf as SkillPick, lE as SkillsConfig, lf as discoverSkills, mf as parseSkillFile, nf as SkillInstallResult, nx as DeactivationReason, oE as SkillDiagnostic, of as parseSkillInstallSpec, pf as parseSkillContent, qd as InterpolateShellCommandsOptions, rf as SkillInstallSpec, rx as SkillActivationState, sE as SkillResource, sf as readSkillProvenance, tf as SkillInstallOptions, tx as ActiveSkill, uf as getDefaultScanPaths, vf as SkillPathCandidate, wf as browseSkillSource, xf as BrowseSkillSourceOptions, yf as sanitizeSkillName, zd as isToolAllowedByUnion, zf as skillPickOf } from "./index-CidMTcxS.js";
+import { $d as stripShellInterpolations, Af as RECOMMENDED_SKILL_SOURCES, Bd as skillTokenWeights, Bf as groupSkillPicks, CE as SkillDiagnostic, Cf as sanitizeSkillName, Df as SkillBrowseErrorCode, EE as SkillsConfig, Ef as SkillBrowseError, Ff as SkillSourceInfo, Gd as parseAllowedToolPattern, Gf as installAllowedToolsGate, Hd as SkillValidationResult, Hf as skillPickKey, Id as defineSkill, If as SkillSourceListing, Jd as validateSkillForWrite, Kd as validateResourcePath, Ld as writeSkillToDisk, Lf as SkillSourceSkill, Mf as SkillInstallTarget, Nf as SkillPick, Of as browseSkillSource, Pf as SkillPickGroup, Qd as interpolateShellCommands, Rd as writeSkillsToDisk, Rf as githubAvatarUrl, SE as SkillConfig, Sf as SkillPathCandidate, TE as SkillSource, Tf as BrowseSkillSourceOptions, Ud as isToolAllowedByUnion, Uf as skillPickOf, Vd as SkillValidationIssue, Vf as skillCategory, Wd as matchesAllowedTool, Wf as IMPLICITLY_ALLOWED_SKILL_TOOLS, Xd as resolveSkills, Yd as validateSkillName, Zd as InterpolateShellCommandsOptions, _f as parseSkillContent, af as SkillInstallOptions, ax as ActiveSkill, bf as skillCatalogEntry, cf as installSkillFromSpec, cx as SkillActivationStateOptions, df as readSkillProvenance, ef as SKILL_PROVENANCE_FILE, ff as SourcedScanPath, gf as parseFrontmatter, hf as inferSource, if as SkillInstallErrorCode, ix as ActivationVia, jf as RecommendedSkillSource, kf as clearSkillSourceCache, lf as listSkillCandidates, lx as createSkillActivationState, mf as getDefaultScanPaths, nf as SkillInstallCandidate, of as SkillInstallResult, ox as DeactivationReason, pf as discoverSkills, qd as validateResourcePathReal, rf as SkillInstallError, sf as SkillInstallSpec, sx as SkillActivationState, tf as SkillCandidateDetail, uf as parseSkillInstallSpec, vf as parseSkillFile, wE as SkillResource, wf as skillCandidatesFromPaths, xE as ShellInterpolationApproval, xf as SKILL_CANDIDATE_MAX_DEPTH, yf as buildCatalog, zd as SkillTokenWeights, zf as githubPreviewImageUrl } from "./index-DyQyDLX1.js";
 export { type ActivationVia, type ActiveSkill, type BrowseSkillSourceOptions, type DeactivationReason, IMPLICITLY_ALLOWED_SKILL_TOOLS, type InterpolateShellCommandsOptions, RECOMMENDED_SKILL_SOURCES, type RecommendedSkillSource, SKILL_CANDIDATE_MAX_DEPTH, SKILL_PROVENANCE_FILE, type ShellInterpolationApproval, type SkillActivationState, type SkillActivationStateOptions, SkillBrowseError, type SkillBrowseErrorCode, type SkillCandidateDetail, type SkillConfig, type SkillDiagnostic, type SkillInstallCandidate, SkillInstallError, type SkillInstallErrorCode, type SkillInstallOptions, type SkillInstallResult, type SkillInstallSpec, type SkillInstallTarget, type SkillPathCandidate, type SkillPick, type SkillPickGroup, type SkillResource, type SkillSource, type SkillSourceInfo, type SkillSourceListing, type SkillSourceSkill, type SkillTokenWeights, type SkillValidationIssue, type SkillValidationResult, type SkillsConfig, type SourcedScanPath, browseSkillSource, buildCatalog, clearSkillSourceCache, createSkillActivationState, defineSkill, discoverSkills, getDefaultScanPaths, githubAvatarUrl, githubPreviewImageUrl, groupSkillPicks, inferSource, installAllowedToolsGate, installSkillFromSpec, interpolateShellCommands, isToolAllowedByUnion, listSkillCandidates, matchesAllowedTool, parseAllowedToolPattern, parseFrontmatter, parseSkillContent, parseSkillFile, parseSkillInstallSpec, readSkillProvenance, resolveSkills, sanitizeSkillName, skillCandidatesFromPaths, skillCatalogEntry, skillCategory, skillPickKey, skillPickOf, skillTokenWeights, stripShellInterpolations, validateResourcePath, validateResourcePathReal, validateSkillForWrite, validateSkillName, writeSkillToDisk, writeSkillsToDisk };