dsh-diff-approval 0.19.3 → 0.20.1

package/lib/index.js

@@ -1,9 +1,873 @@
+import { createRequire } from "node:module";
 import { mkdir, readFile, readdir, rename, rm, writeFile } from "node:fs/promises";
 import { dirname, isAbsolute, join, relative, resolve, sep } from "node:path";
 import { dshHomePath, expandHomePath } from "@deepseek-ai/dsh-home-paths";
-import { SessionId } from "@deepseek-ai/dsh-session";
+import "@deepseek-ai/cordis";
 import { spawn } from "node:child_process";
 import { existsSync } from "node:fs";
+//#region node_modules/.pnpm/@deepseek-ai+cosmokit@1.8.2/node_modules/@deepseek-ai/cosmokit/lib/index.js
+/** Return true when a value is `null` or `undefined`. */
+function isNullable(value) {
+	return value === null || value === void 0;
+}
+/** Return true for non-array object values. */
+function isPlainObject(data) {
+	return data && typeof data === "object" && !Array.isArray(data);
+}
+/** Filter object entries and return a new object. */
+function filterKeys(object, filter) {
+	return Object.fromEntries(Object.entries(object).filter(([key, value]) => filter(key, value)));
+}
+/** Map object values while preserving the original key set. */
+function mapValues(object, transform) {
+	return Object.fromEntries(Object.entries(object).map(([key, value]) => [key, transform(value, key)]));
+}
+/** Pick selected keys from an object, optionally including `undefined` values. */
+function pick(source, keys, forced) {
+	if (!keys) return { ...source };
+	const result = {};
+	for (const key of keys) if (forced || source[key] !== void 0) result[key] = source[key];
+	return result;
+}
+/** Test values using `instanceof` with a `toStringTag` fallback. */
+function is(type, value) {
+	if (arguments.length === 1) return (value) => is(type, value);
+	return type in globalThis && value instanceof globalThis[type] || Object.prototype.toString.call(value).slice(8, -1) === type;
+}
+function isArrayBufferLike(value) {
+	return is("ArrayBuffer", value) || is("SharedArrayBuffer", value);
+}
+function isArrayBufferSource(value) {
+	return isArrayBufferLike(value) || ArrayBuffer.isView(value);
+}
+/** Binary source detection and base64/hex conversion helpers. */
+var Binary;
+(function(Binary) {
+	Binary.is = isArrayBufferLike;
+	Binary.isSource = isArrayBufferSource;
+	function fromSource(source) {
+		if (ArrayBuffer.isView(source)) return source.buffer.slice(source.byteOffset, source.byteOffset + source.byteLength);
+		else return source;
+	}
+	Binary.fromSource = fromSource;
+	function toBase64(source) {
+		source = fromSource(source);
+		if (typeof Buffer !== "undefined") return Buffer.from(source).toString("base64");
+		let binary = "";
+		const bytes = new Uint8Array(source);
+		for (let i = 0; i < bytes.byteLength; i++) binary += String.fromCharCode(bytes[i]);
+		return btoa(binary);
+	}
+	Binary.toBase64 = toBase64;
+	function fromBase64(source) {
+		if (typeof Buffer !== "undefined") return fromSource(Buffer.from(source, "base64"));
+		return Uint8Array.from(atob(source), (c) => c.charCodeAt(0));
+	}
+	Binary.fromBase64 = fromBase64;
+	function toHex(source) {
+		source = fromSource(source);
+		if (typeof Buffer !== "undefined") return Buffer.from(source).toString("hex");
+		return Array.from(new Uint8Array(source), (byte) => byte.toString(16).padStart(2, "0")).join("");
+	}
+	Binary.toHex = toHex;
+	function fromHex(source) {
+		if (typeof Buffer !== "undefined") return fromSource(Buffer.from(source, "hex"));
+		const hex = source.length % 2 === 0 ? source : source.slice(0, source.length - 1);
+		const buffer = [];
+		for (let i = 0; i < hex.length; i += 2) buffer.push(parseInt(`${hex[i]}${hex[i + 1]}`, 16));
+		return Uint8Array.from(buffer).buffer;
+	}
+	Binary.fromHex = fromHex;
+})(Binary || (Binary = {}));
+Binary.fromBase64;
+Binary.toBase64;
+Binary.fromHex;
+Binary.toHex;
+/** Deep-clone common JavaScript values while preserving prototypes and cycles. */
+function clone(source, refs = /* @__PURE__ */ new Map()) {
+	if (!source || typeof source !== "object") return source;
+	if (is("Date", source)) return new Date(source.valueOf());
+	if (is("RegExp", source)) return new RegExp(source.source, source.flags);
+	if (isArrayBufferLike(source)) return source.slice(0);
+	if (ArrayBuffer.isView(source)) return source.buffer.slice(source.byteOffset, source.byteOffset + source.byteLength);
+	const cached = refs.get(source);
+	if (cached) return cached;
+	if (Array.isArray(source)) {
+		const result = [];
+		refs.set(source, result);
+		source.forEach((value, index) => {
+			result[index] = Reflect.apply(clone, null, [value, refs]);
+		});
+		return result;
+	}
+	const result = Object.create(Object.getPrototypeOf(source));
+	refs.set(source, result);
+	for (const key of Reflect.ownKeys(source)) {
+		const descriptor = { ...Reflect.getOwnPropertyDescriptor(source, key) };
+		if ("value" in descriptor) descriptor.value = Reflect.apply(clone, null, [descriptor.value, refs]);
+		Reflect.defineProperty(result, key, descriptor);
+	}
+	return result;
+}
+/** Deeply compare arrays, dates, regexps, buffers, and plain object fields. */
+function deepEqual(a, b, strict) {
+	if (a === b) return true;
+	if (!strict && isNullable(a) && isNullable(b)) return true;
+	if (typeof a !== typeof b) return false;
+	if (typeof a !== "object") return false;
+	if (!a || !b) return false;
+	function check(test, then) {
+		return test(a) ? test(b) ? then(a, b) : false : test(b) ? false : void 0;
+	}
+	return check(Array.isArray, (a, b) => a.length === b.length && a.every((item, index) => deepEqual(item, b[index]))) ?? check(is("Date"), (a, b) => a.valueOf() === b.valueOf()) ?? check(is("RegExp"), (a, b) => a.source === b.source && a.flags === b.flags) ?? check(isArrayBufferLike, (a, b) => {
+		if (a.byteLength !== b.byteLength) return false;
+		const viewA = new Uint8Array(a);
+		const viewB = new Uint8Array(b);
+		for (let i = 0; i < viewA.length; i++) if (viewA[i] !== viewB[i]) return false;
+		return true;
+	}) ?? Object.keys({
+		...a,
+		...b
+	}).every((key) => deepEqual(a[key], b[key], strict));
+}
+/** Time constants plus parsing and formatting helpers. */
+var Time;
+(function(Time) {
+	Time.millisecond = 1;
+	Time.second = 1e3;
+	Time.minute = Time.second * 60;
+	Time.hour = Time.minute * 60;
+	Time.day = Time.hour * 24;
+	Time.week = Time.day * 7;
+	let timezoneOffset = (/* @__PURE__ */ new Date()).getTimezoneOffset();
+	function setTimezoneOffset(offset) {
+		timezoneOffset = offset;
+	}
+	Time.setTimezoneOffset = setTimezoneOffset;
+	function getTimezoneOffset() {
+		return timezoneOffset;
+	}
+	Time.getTimezoneOffset = getTimezoneOffset;
+	function getDateNumber(date = /* @__PURE__ */ new Date(), offset) {
+		if (typeof date === "number") date = new Date(date);
+		if (offset === void 0) offset = timezoneOffset;
+		return Math.floor((date.valueOf() / Time.minute - offset) / 1440);
+	}
+	Time.getDateNumber = getDateNumber;
+	function fromDateNumber(value, offset) {
+		const date = new Date(value * Time.day);
+		if (offset === void 0) offset = timezoneOffset;
+		return new Date(+date + offset * Time.minute);
+	}
+	Time.fromDateNumber = fromDateNumber;
+	const numeric = /\d+(?:\.\d+)?/.source;
+	const timeRegExp = new RegExp(`^${[
+		"w(?:eek(?:s)?)?",
+		"d(?:ay(?:s)?)?",
+		"h(?:our(?:s)?)?",
+		"m(?:in(?:ute)?(?:s)?)?",
+		"s(?:ec(?:ond)?(?:s)?)?"
+	].map((unit) => `(${numeric}${unit})?`).join("")}$`);
+	function parseTime(source) {
+		const capture = timeRegExp.exec(source);
+		if (!capture) return 0;
+		return (parseFloat(capture[1]) * Time.week || 0) + (parseFloat(capture[2]) * Time.day || 0) + (parseFloat(capture[3]) * Time.hour || 0) + (parseFloat(capture[4]) * Time.minute || 0) + (parseFloat(capture[5]) * Time.second || 0);
+	}
+	Time.parseTime = parseTime;
+	function parseDate(date) {
+		const parsed = parseTime(date);
+		if (parsed) date = Date.now() + parsed;
+		else if (/^\d{1,2}(:\d{1,2}){1,2}$/.test(date)) date = `${(/* @__PURE__ */ new Date()).toLocaleDateString()}-${date}`;
+		else if (/^\d{1,2}-\d{1,2}-\d{1,2}(:\d{1,2}){1,2}$/.test(date)) date = `${(/* @__PURE__ */ new Date()).getFullYear()}-${date}`;
+		return date ? new Date(date) : /* @__PURE__ */ new Date();
+	}
+	Time.parseDate = parseDate;
+	function format(ms) {
+		const abs = Math.abs(ms);
+		if (abs >= Time.day - Time.hour / 2) return Math.round(ms / Time.day) + "d";
+		else if (abs >= Time.hour - Time.minute / 2) return Math.round(ms / Time.hour) + "h";
+		else if (abs >= Time.minute - Time.second / 2) return Math.round(ms / Time.minute) + "m";
+		else if (abs >= Time.second) return Math.round(ms / Time.second) + "s";
+		return ms + "ms";
+	}
+	Time.format = format;
+	function toDigits(source, length = 2) {
+		return source.toString().padStart(length, "0");
+	}
+	Time.toDigits = toDigits;
+	function template(template, time = /* @__PURE__ */ new Date()) {
+		return template.replace("yyyy", time.getFullYear().toString()).replace("yy", time.getFullYear().toString().slice(2)).replace("MM", toDigits(time.getMonth() + 1)).replace("dd", toDigits(time.getDate())).replace("hh", toDigits(time.getHours())).replace("mm", toDigits(time.getMinutes())).replace("ss", toDigits(time.getSeconds())).replace("SSS", toDigits(time.getMilliseconds(), 3));
+	}
+	Time.template = template;
+})(Time || (Time = {}));
+//#endregion
+//#region node_modules/.pnpm/@deepseek-ai+schemastery@3.18.1/node_modules/@deepseek-ai/schemastery/lib/index.mjs
+const kSchema = Symbol.for("schemastery");
+const kValidationError = Symbol.for("ValidationError");
+globalThis.__schemastery_index__ ??= 0;
+globalThis.__schemastery_refs__ = void 0;
+var ValidationError = class extends TypeError {
+	options;
+	name = "ValidationError";
+	constructor(message, options) {
+		let prefix = "$";
+		for (const segment of options.path || []) if (typeof segment === "string") prefix += "." + segment;
+		else if (typeof segment === "number") prefix += "[" + segment + "]";
+		else if (typeof segment === "symbol") prefix += `[Symbol(${segment.toString()})]`;
+		if (prefix.startsWith(".")) prefix = prefix.slice(1);
+		super((prefix === "$" ? "" : `${prefix} `) + message);
+		this.options = options;
+	}
+	static is(error) {
+		return !!error?.[kValidationError];
+	}
+};
+Object.defineProperty(ValidationError.prototype, kValidationError, { value: true });
+const Schema = function(options) {
+	const schema = function(data, options = {}) {
+		return Schema.resolve(data, schema, options)[0];
+	};
+	if (options.refs) {
+		const refs = mapValues(options.refs, (options) => new Schema(options));
+		const getRef = (uid) => refs[uid];
+		for (const key in refs) {
+			const options = refs[key];
+			options.sKey = getRef(options.sKey);
+			options.inner = getRef(options.inner);
+			options.list = options.list && options.list.map(getRef);
+			options.dict = options.dict && mapValues(options.dict, getRef);
+		}
+		return refs[options.uid];
+	}
+	Object.assign(schema, options);
+	if (typeof schema.callback === "string") try {
+		schema.callback = new Function("return " + schema.callback)();
+	} catch {}
+	Object.defineProperty(schema, "uid", { value: globalThis.__schemastery_index__++ });
+	Object.setPrototypeOf(schema, Schema.prototype);
+	schema.meta ||= {};
+	schema.toString = schema.toString.bind(schema);
+	return schema;
+};
+Schema.prototype = Object.create(Function.prototype);
+Schema.prototype[kSchema] = true;
+Object.defineProperty(Schema.prototype, "~standard", { get() {
+	return {
+		version: 1,
+		vendor: "schemastery",
+		validate: (value) => {
+			try {
+				return { value: Schema.resolve(value, this, {})[0] };
+			} catch (error) {
+				if (ValidationError.is(error)) return { issues: [{
+					message: error.message,
+					path: error.options.path
+				}] };
+				throw error;
+			}
+		}
+	};
+} });
+Schema.ValidationError = ValidationError;
+Schema.prototype.toJSON = function toJSON() {
+	if (globalThis.__schemastery_refs__) {
+		globalThis.__schemastery_refs__[this.uid] ??= JSON.parse(JSON.stringify({ ...this }));
+		return this.uid;
+	}
+	globalThis.__schemastery_refs__ = { [this.uid]: { ...this } };
+	globalThis.__schemastery_refs__[this.uid] = JSON.parse(JSON.stringify({ ...this }));
+	const result = {
+		uid: this.uid,
+		refs: globalThis.__schemastery_refs__
+	};
+	globalThis.__schemastery_refs__ = void 0;
+	return result;
+};
+Schema.prototype.set = function set(key, value) {
+	this.dict[key] = value;
+	return this;
+};
+Schema.prototype.push = function push(value) {
+	this.list.push(value);
+	return this;
+};
+function mergeDesc(original, messages) {
+	const result = typeof original === "string" ? { "": original } : { ...original };
+	for (const locale in messages) {
+		const value = messages[locale];
+		if (value?.$description || value?.$desc) result[locale] = value.$description || value.$desc;
+		else if (typeof value === "string") result[locale] = value;
+	}
+	return result;
+}
+function getInner(value) {
+	return value?.$value ?? value?.$inner;
+}
+function extractKeys(data) {
+	return filterKeys(data ?? {}, (key) => !key.startsWith("$"));
+}
+Schema.prototype.i18n = function i18n(messages) {
+	const schema = Schema(this);
+	const desc = mergeDesc(schema.meta.description, messages);
+	if (Object.keys(desc).length) schema.meta.description = desc;
+	if (schema.dict) schema.dict = mapValues(schema.dict, (inner, key) => {
+		return inner.i18n(mapValues(messages, (data) => getInner(data)?.[key] ?? data?.[key]));
+	});
+	if (schema.list) schema.list = schema.list.map((inner, index) => {
+		return inner.i18n(mapValues(messages, (data = {}) => {
+			if (Array.isArray(getInner(data))) return getInner(data)[index];
+			if (Array.isArray(data)) return data[index];
+			return extractKeys(data);
+		}));
+	});
+	if (schema.inner) schema.inner = schema.inner.i18n(mapValues(messages, (data) => {
+		if (getInner(data)) return getInner(data);
+		return extractKeys(data);
+	}));
+	if (schema.sKey) schema.sKey = schema.sKey.i18n(mapValues(messages, (data) => data?.$key));
+	return schema;
+};
+Schema.prototype.extra = function extra(key, value) {
+	const schema = Schema(this);
+	schema.meta = {
+		...schema.meta,
+		[key]: value
+	};
+	return schema;
+};
+for (const key of [
+	"required",
+	"disabled",
+	"collapse",
+	"hidden",
+	"loose"
+]) Object.assign(Schema.prototype, { [key](value = true) {
+	const schema = Schema(this);
+	schema.meta = {
+		...schema.meta,
+		[key]: value
+	};
+	return schema;
+} });
+Schema.prototype.deprecated = function deprecated() {
+	const schema = Schema(this);
+	schema.meta.badges ||= [];
+	schema.meta.badges.push({
+		text: "deprecated",
+		type: "danger"
+	});
+	return schema;
+};
+Schema.prototype.experimental = function experimental() {
+	const schema = Schema(this);
+	schema.meta.badges ||= [];
+	schema.meta.badges.push({
+		text: "experimental",
+		type: "warning"
+	});
+	return schema;
+};
+Schema.prototype.pattern = function pattern(regexp) {
+	const schema = Schema(this);
+	const pattern = pick(regexp, ["source", "flags"]);
+	schema.meta = {
+		...schema.meta,
+		pattern
+	};
+	return schema;
+};
+Schema.prototype.simplify = function simplify(value) {
+	if (deepEqual(value, this.meta.default, this.type === "dict")) return null;
+	if (isNullable(value)) return value;
+	if (this.type === "object" || this.type === "dict") {
+		const result = {};
+		for (const key in value) {
+			const item = (this.type === "object" ? this.dict[key] : this.inner)?.simplify(value[key]);
+			if (this.type === "dict" || !isNullable(item)) result[key] = item;
+		}
+		if (deepEqual(result, this.meta.default, this.type === "dict")) return null;
+		return result;
+	} else if (this.type === "array" || this.type === "tuple") {
+		const result = [];
+		value.forEach((value, index) => {
+			const schema = this.type === "array" ? this.inner : this.list[index];
+			const item = schema ? schema.simplify(value) : value;
+			result.push(item);
+		});
+		return result;
+	} else if (this.type === "intersect") {
+		const result = {};
+		for (const item of this.list) Object.assign(result, item.simplify(value));
+		return result;
+	} else if (this.type === "union") for (const schema of this.list) try {
+		Schema.resolve(value, schema, {});
+		return schema.simplify(value);
+	} catch {}
+	return value;
+};
+Schema.prototype.toString = function toString(inline) {
+	return formatters[this.type]?.(this, inline) ?? `Schema<${this.type}>`;
+};
+Schema.prototype.role = function role(role, extra) {
+	const schema = Schema(this);
+	schema.meta = {
+		...schema.meta,
+		role,
+		extra
+	};
+	return schema;
+};
+for (const key of [
+	"default",
+	"link",
+	"comment",
+	"description",
+	"max",
+	"min",
+	"step"
+]) Object.assign(Schema.prototype, { [key](value) {
+	const schema = Schema(this);
+	schema.meta = {
+		...schema.meta,
+		[key]: value
+	};
+	return schema;
+} });
+const resolvers = {};
+Schema.extend = function extend(type, resolve) {
+	resolvers[type] = resolve;
+};
+Schema.resolve = function resolve(data, schema, options = {}, strict = false) {
+	if (!schema) return [data];
+	if (options.ignore?.(data, schema)) return [data];
+	if (isNullable(data) && schema.type !== "lazy") {
+		if (schema.meta.required) throw new ValidationError(`missing required value`, options);
+		let current = schema;
+		let fallback = schema.meta.default;
+		while (current?.type === "intersect" && isNullable(fallback)) {
+			current = current.list[0];
+			fallback = current?.meta.default;
+		}
+		if (isNullable(fallback)) return [data];
+		data = clone(fallback);
+	}
+	const callback = resolvers[schema.type];
+	if (!callback) throw new ValidationError(`unsupported type "${schema.type}"`, options);
+	try {
+		return callback(data, schema, options, strict);
+	} catch (error) {
+		if (!schema.meta.loose) throw error;
+		return [schema.meta.default];
+	}
+};
+Schema.from = function from(source) {
+	if (isNullable(source)) return Schema.any();
+	else if ([
+		"string",
+		"number",
+		"boolean"
+	].includes(typeof source)) return Schema.const(source).required();
+	else if (source[kSchema]) return source;
+	else if (typeof source === "function") switch (source) {
+		case String: return Schema.string().required();
+		case Number: return Schema.number().required();
+		case Boolean: return Schema.boolean().required();
+		case Function: return Schema.function().required();
+		default: return Schema.is(source).required();
+	}
+	else throw new TypeError(`cannot infer schema from ${source}`);
+};
+Schema.lazy = function lazy(builder) {
+	const toJSON = () => {
+		if (!schema.inner[kSchema]) {
+			schema.inner = schema.builder();
+			schema.inner.meta = {
+				...schema.meta,
+				...schema.inner.meta
+			};
+		}
+		return schema.inner.toJSON();
+	};
+	const schema = new Schema({
+		type: "lazy",
+		builder,
+		inner: { toJSON }
+	});
+	return schema;
+};
+Schema.natural = function natural() {
+	return Schema.number().step(1).min(0);
+};
+Schema.percent = function percent() {
+	return Schema.number().step(.01).min(0).max(1).role("slider");
+};
+Schema.date = function date() {
+	return Schema.union([Schema.is(Date), Schema.transform(Schema.string().role("datetime"), (value, options) => {
+		const date = new Date(value);
+		if (isNaN(+date)) throw new ValidationError(`invalid date "${value}"`, options);
+		return date;
+	}, true)]);
+};
+Schema.regExp = function regExp(flag = "") {
+	return Schema.union([Schema.is(RegExp), Schema.transform(Schema.string().role("regexp", { flag }), (value, options) => {
+		try {
+			return new RegExp(value, flag);
+		} catch (e) {
+			throw new ValidationError(e.message, options);
+		}
+	}, true)]);
+};
+Schema.arrayBuffer = function arrayBuffer(encoding) {
+	return Schema.union([
+		Schema.is(ArrayBuffer),
+		Schema.is(SharedArrayBuffer),
+		Schema.transform(Schema.any(), (value, options) => {
+			if (Binary.isSource(value)) return Binary.fromSource(value);
+			throw new ValidationError(`expected ArrayBufferSource but got ${value}`, options);
+		}, true),
+		...encoding ? [Schema.transform(Schema.string(), (value, options) => {
+			try {
+				return encoding === "base64" ? Binary.fromBase64(value) : Binary.fromHex(value);
+			} catch (e) {
+				throw new ValidationError(e.message, options);
+			}
+		}, true)] : []
+	]);
+};
+Schema.extend("lazy", (data, schema, options, strict) => {
+	if (!schema.inner[kSchema]) {
+		schema.inner = schema.builder();
+		schema.inner.meta = {
+			...schema.meta,
+			...schema.inner.meta
+		};
+	}
+	return Schema.resolve(data, schema.inner, options, strict);
+});
+Schema.extend("any", (data) => {
+	return [data];
+});
+Schema.extend("never", (data, _, options) => {
+	throw new ValidationError(`expected nullable but got ${data}`, options);
+});
+Schema.extend("const", (data, { value }, options) => {
+	if (deepEqual(data, value)) return [value];
+	throw new ValidationError(`expected ${value} but got ${data}`, options);
+});
+function checkWithinRange(data, meta, description, options, skipMin = false) {
+	const { max = Infinity, min = -Infinity } = meta;
+	if (data > max) throw new ValidationError(`expected ${description} <= ${max} but got ${data}`, options);
+	if (data < min && !skipMin) throw new ValidationError(`expected ${description} >= ${min} but got ${data}`, options);
+}
+Schema.extend("string", (data, { meta }, options) => {
+	if (typeof data !== "string") throw new ValidationError(`expected string but got ${data}`, options);
+	if (meta.pattern) {
+		const regexp = new RegExp(meta.pattern.source, meta.pattern.flags);
+		if (!regexp.test(data)) throw new ValidationError(`expect string to match regexp ${regexp}`, options);
+	}
+	checkWithinRange(data.length, meta, "string length", options);
+	return [data];
+});
+function decimalShift(data, digits) {
+	const str = data.toString();
+	if (str.includes("e")) return data * Math.pow(10, digits);
+	const index = str.indexOf(".");
+	if (index === -1) return data * Math.pow(10, digits);
+	const frac = str.slice(index + 1);
+	const integer = str.slice(0, index);
+	if (frac.length <= digits) return +(integer + frac.padEnd(digits, "0"));
+	return +(integer + frac.slice(0, digits) + "." + frac.slice(digits));
+}
+function isMultipleOf(data, min, step) {
+	step = Math.abs(step);
+	if (!/^\d+\.\d+$/.test(step.toString())) return (data - min) % step === 0;
+	const index = step.toString().indexOf(".");
+	const digits = step.toString().slice(index + 1).length;
+	return Math.abs(decimalShift(data, digits) - decimalShift(min, digits)) % decimalShift(step, digits) === 0;
+}
+Schema.extend("number", (data, { meta }, options) => {
+	if (typeof data !== "number") throw new ValidationError(`expected number but got ${data}`, options);
+	checkWithinRange(data, meta, "number", options);
+	const { step } = meta;
+	if (step && !isMultipleOf(data, meta.min ?? 0, step)) throw new ValidationError(`expected number multiple of ${step} but got ${data}`, options);
+	return [data];
+});
+Schema.extend("boolean", (data, _, options) => {
+	if (typeof data === "boolean") return [data];
+	throw new ValidationError(`expected boolean but got ${data}`, options);
+});
+Schema.extend("bitset", (data, { bits, meta }, options) => {
+	let value = 0, keys = [];
+	if (typeof data === "number") {
+		value = data;
+		for (const key in bits) if (data & bits[key]) keys.push(key);
+	} else if (Array.isArray(data)) {
+		keys = data;
+		for (const key of keys) {
+			if (typeof key !== "string") throw new ValidationError(`expected string but got ${key}`, options);
+			if (key in bits) value |= bits[key];
+		}
+	} else throw new ValidationError(`expected number or array but got ${data}`, options);
+	if (value === meta.default) return [value];
+	return [value, keys];
+});
+Schema.extend("function", (data, _, options) => {
+	if (typeof data === "function") return [data];
+	throw new ValidationError(`expected function but got ${data}`, options);
+});
+Schema.extend("is", (data, { constructor }, options) => {
+	if (typeof constructor === "function") {
+		if (data instanceof constructor) return [data];
+		throw new ValidationError(`expected ${constructor.name} but got ${data}`, options);
+	} else {
+		if (isNullable(data)) throw new ValidationError(`expected ${constructor} but got ${data}`, options);
+		let prototype = Object.getPrototypeOf(data);
+		while (prototype) {
+			if (prototype.constructor?.name === constructor) return [data];
+			prototype = Object.getPrototypeOf(prototype);
+		}
+		throw new ValidationError(`expected ${constructor} but got ${data}`, options);
+	}
+});
+function property(data, key, schema, options) {
+	try {
+		const [value, adapted] = Schema.resolve(data[key], schema, {
+			...options,
+			path: [...options.path || [], key]
+		});
+		if (adapted !== void 0) data[key] = adapted;
+		return value;
+	} catch (e) {
+		if (!options?.autofix) throw e;
+		delete data[key];
+		return schema.meta.default;
+	}
+}
+Schema.extend("array", (data, { inner, meta }, options) => {
+	if (!Array.isArray(data)) throw new ValidationError(`expected array but got ${data}`, options);
+	checkWithinRange(data.length, meta, "array length", options, !isNullable(inner.meta.default));
+	return [data.map((_, index) => property(data, index, inner, options))];
+});
+Schema.extend("dict", (data, { inner, sKey }, options, strict) => {
+	if (!isPlainObject(data)) throw new ValidationError(`expected object but got ${data}`, options);
+	const result = {};
+	for (const key in data) {
+		let rKey;
+		try {
+			rKey = Schema.resolve(key, sKey, options)[0];
+		} catch (error) {
+			if (strict) continue;
+			throw error;
+		}
+		result[rKey] = property(data, key, inner, options);
+		data[rKey] = data[key];
+		if (key !== rKey) delete data[key];
+	}
+	return [result];
+});
+Schema.extend("tuple", (data, { list }, options, strict) => {
+	if (!Array.isArray(data)) throw new ValidationError(`expected array but got ${data}`, options);
+	const result = list.map((inner, index) => property(data, index, inner, options));
+	if (strict) return [result];
+	result.push(...data.slice(list.length));
+	return [result];
+});
+function merge(result, data) {
+	for (const key in data) {
+		if (key in result) continue;
+		result[key] = data[key];
+	}
+}
+Schema.extend("object", (data, { dict }, options, strict) => {
+	if (!isPlainObject(data)) throw new ValidationError(`expected object but got ${data}`, options);
+	const result = {};
+	for (const key in dict) {
+		const value = property(data, key, dict[key], options);
+		if (!isNullable(value) || key in data) result[key] = value;
+	}
+	if (!strict) merge(result, data);
+	return [result];
+});
+Schema.extend("union", (data, { list, toString }, options, strict) => {
+	const messages = [];
+	for (const inner of list) try {
+		return Schema.resolve(data, inner, options, strict);
+	} catch (error) {
+		messages.push(error);
+	}
+	throw new ValidationError(`expected ${toString()} but got ${JSON.stringify(data)}`, options);
+});
+Schema.extend("intersect", (data, { list, toString }, options, strict) => {
+	if (!list.length) return [data];
+	let result;
+	for (const inner of list) {
+		const value = Schema.resolve(data, inner, options, true)[0];
+		if (isNullable(value)) continue;
+		if (isNullable(result)) result = value;
+		else if (typeof result !== typeof value) throw new ValidationError(`expected ${toString()} but got ${JSON.stringify(data)}`, options);
+		else if (typeof value === "object") merge(result ??= {}, value);
+		else if (result !== value) throw new ValidationError(`expected ${toString()} but got ${JSON.stringify(data)}`, options);
+	}
+	if (!strict && isPlainObject(data)) merge(result, data);
+	return [result];
+});
+Schema.extend("transform", (data, { inner, callback, preserve }, options) => {
+	const [result, adapted = data] = Schema.resolve(data, inner, options, true);
+	if (preserve) return [callback(result)];
+	else return [callback(result), callback(adapted)];
+});
+const formatters = {};
+function defineMethod(name, keys, format) {
+	formatters[name] = format;
+	Object.assign(Schema, { [name](...args) {
+		const schema = new Schema({ type: name });
+		keys.forEach((key, index) => {
+			switch (key) {
+				case "sKey":
+					schema.sKey = args[index] ?? Schema.string();
+					break;
+				case "inner":
+					schema.inner = Schema.from(args[index]);
+					break;
+				case "list":
+					schema.list = args[index].map(Schema.from);
+					break;
+				case "dict":
+					schema.dict = mapValues(args[index], Schema.from);
+					break;
+				case "bits":
+					schema.bits = {};
+					for (const key in args[index]) {
+						if (typeof args[index][key] !== "number") continue;
+						schema.bits[key] = args[index][key];
+					}
+					break;
+				case "callback": {
+					const callback = schema.callback = args[index];
+					callback["toJSON"] ||= () => callback.toString();
+					break;
+				}
+				case "constructor": {
+					const constructor = schema.constructor = args[index];
+					if (typeof constructor === "function") constructor["toJSON"] ||= () => constructor["name"];
+					break;
+				}
+				default: schema[key] = args[index];
+			}
+		});
+		if (name === "object" || name === "dict") schema.meta.default = {};
+		else if (name === "array" || name === "tuple") schema.meta.default = [];
+		else if (name === "bitset") schema.meta.default = 0;
+		return schema;
+	} });
+}
+defineMethod("is", ["constructor"], ({ constructor }) => {
+	if (typeof constructor === "function") return constructor.name;
+	else return constructor;
+});
+defineMethod("any", [], () => "any");
+defineMethod("never", [], () => "never");
+defineMethod("const", ["value"], ({ value }) => typeof value === "string" ? JSON.stringify(value) : value);
+defineMethod("string", [], () => "string");
+defineMethod("number", [], () => "number");
+defineMethod("boolean", [], () => "boolean");
+defineMethod("bitset", ["bits"], () => "bitset");
+defineMethod("function", [], () => "function");
+defineMethod("array", ["inner"], ({ inner }) => `${inner.toString(true)}[]`);
+defineMethod("dict", ["inner", "sKey"], ({ inner, sKey }) => `{ [key: ${sKey.toString()}]: ${inner.toString()} }`);
+defineMethod("tuple", ["list"], ({ list }) => `[${list.map((inner) => inner.toString()).join(", ")}]`);
+defineMethod("object", ["dict"], ({ dict }) => {
+	if (Object.keys(dict).length === 0) return "{}";
+	return `{ ${Object.entries(dict).map(([key, inner]) => {
+		return `${key}${inner.meta.required ? "" : "?"}: ${inner.toString()}`;
+	}).join(", ")} }`;
+});
+defineMethod("union", ["list"], ({ list }, inline) => {
+	const result = list.map(({ toString: format }) => format()).join(" | ");
+	return inline ? `(${result})` : result;
+});
+defineMethod("intersect", ["list"], ({ list }) => {
+	return `${list.map((inner) => inner.toString(true)).join(" & ")}`;
+});
+defineMethod("transform", [
+	"inner",
+	"callback",
+	"preserve"
+], ({ inner }, isInner) => inner.toString(isInner));
+//#endregion
+//#region node_modules/.pnpm/@deepseek-ai+dsh-timeout@0.1.0-rc.6_@deepseek-ai+cordis@4.0.1_@deepseek-ai+dsh-invarian_8c173ab999b05cf1db05d479dd44e888/node_modules/@deepseek-ai/dsh-timeout/lib/index.js
+/** Largest delay Node schedules without clamping it to one millisecond. */
+const MAX_TIMER_DELAY_MS = 2147483647;
+//#endregion
+//#region node_modules/.pnpm/@deepseek-ai+dsh-llm@0.1.0-rc.6_@deepseek-ai+cordis@4.0.1_@deepseek-ai+dsh-attachment@0_4ed4e5c71eb965b0bd6912871e829940/node_modules/@deepseek-ai/dsh-llm/lib/index.js
+/**
+* Canonical provider-neutral code for a response that completed normally but
+* carried no content blocks at all. Providers occasionally emit a degenerate
+* completion (a terminal stop with zero output); adapters classify it as this
+* failure instead of yielding an empty assistant message, because an empty
+* message silently ends the turn with nothing for the user or the loop to act
+* on. The attempt produced nothing durable, so retry policy treats it as safe
+* to repeat.
+*/
+const EMPTY_RESPONSE_CODE = "EMPTY_RESPONSE";
+new RegExp(String.raw`(?:^|[^a-z0-9])context[\s_-](?:length|window)[\s_-]` + String.raw`(?:exceed(?:ed|s)?|overflow(?:ed)?|limit[\s_-]exceeded)(?:$|[^a-z0-9])`, "i");
+new RegExp(String.raw`\b(?:request|prompt|input|messages?)\s+(?:is\s+|are\s+)?` + String.raw`too\s+(?:large|long)\s+for\s+(?:(?:this|the)\s+)?` + String.raw`(?:model(?:'s)?\s+)?context(?:\s+window)?\b`, "i");
+new RegExp(String.raw`\b(?:input|prompt|request|messages?)\b.{0,40}` + String.raw`\b(?:exceed(?:s|ed)?|overflows?|is\s+larger\s+than)\b.{0,40}` + String.raw`\b(?:the\s+)?(?:model(?:'s)?\s+)?context(?:\s+(?:length|window))?\b`, "i");
+/**
+* Provider-owned request-retry policy configuration and resolution.
+*
+* Adapters expose one resolved policy per registered provider route; the
+* optional dsh-llm-retry plugin executes it on the agent's failed-step extension point.
+*
+* @module @deepseek-ai/dsh-llm/retry-policy
+*/
+const DEFAULT_MAX_RETRIES = 2;
+const DEFAULT_INITIAL_DELAY_MS = 500;
+const DEFAULT_MAX_DELAY_MS = 1e4;
+const DEFAULT_JITTER_RATIO = .1;
+const DEFAULT_RETRYABLE_CODES = Object.freeze([
+	EMPTY_RESPONSE_CODE,
+	"RATE_LIMIT",
+	"SERVER",
+	"TIMEOUT",
+	"TRANSPORT"
+]);
+const backoffSchema = Schema.object({
+	initialDelayMs: Schema.number().max(MAX_TIMER_DELAY_MS).default(DEFAULT_INITIAL_DELAY_MS),
+	maxDelayMs: Schema.number().max(MAX_TIMER_DELAY_MS).default(DEFAULT_MAX_DELAY_MS),
+	jitterRatio: Schema.number().min(0).max(1).default(DEFAULT_JITTER_RATIO)
+});
+const normalPolicySchema = Schema.object({
+	mode: Schema.const("normal").required(),
+	maxRetries: Schema.number().step(1).min(0).max(Number.MAX_SAFE_INTEGER).default(DEFAULT_MAX_RETRIES),
+	retryableCodes: Schema.array(Schema.string()).default([...DEFAULT_RETRYABLE_CODES]),
+	backoff: backoffSchema
+});
+const alwaysPolicySchema = Schema.object({
+	mode: Schema.const("always").required(),
+	backoff: backoffSchema
+});
+Schema.union([normalPolicySchema, alwaysPolicySchema]);
+/**
+* Centralize the non-secret product identity every provider request sends as `User-Agent`, keeping
+* adapters from drifting. See
+* `.agents/notes/implemented/architecture/2026-06-21-mandatory-app-attribution-headers.md`.
+*
+* App-attribution vocabulary for provider requests.
+* @module @deepseek-ai/dsh-llm/attribution
+*/
+const { version } = createRequire(import.meta.url)("../package.json");
+//#endregion
+//#region node_modules/.pnpm/@deepseek-ai+dsh-session@0.1.0-rc.6_6fd26f59436a18b115f326d6060415e6/node_modules/@deepseek-ai/dsh-session/lib/index.js
+/**
+* Brand a string as a {@link SessionId}.
+* @param id - the raw session id string.
+* @returns the same string, branded (a compile-time cast — no runtime cost).
+*/
+function SessionId(id) {
+	return id;
+}
+//#endregion
 //#region lib/types/pending.js
 /**
 * In-memory pending-diff store: one entry per file path, globally, holding the
@@ -138,6 +1002,18 @@ var PendingDiffStore = class {
 		return true;
 	}
 	/**
+	* Admit one entry into the list without the change guard {@link fold} applies.
+	* A listed entry may carry no diff at all: a path the user added by hand has
+	* no local change until one appears, and a fully-resolved file has already
+	* folded its diff away. This is the guard-free put {@link restore} performs,
+	* named for its other caller.
+	* @param entry - the entry to insert or replace by path.
+	* @returns whether the store changed.
+	*/
+	insert(entry) {
+		return this.restore(entry);
+	}
+	/**
 	* Merge persisted entries into the store, one per path after folding. A live
 	* entry wins over a persisted one only when its time is newer (folders are
 	* applied in capture order, so a later persisted capture is strictly newer).
@@ -820,6 +1696,50 @@ function writeOutcomeOf(value) {
 function errorMessage(error) {
 	return error instanceof Error ? error.message : String(error);
 }
+/** Directories one browse level hides: VCS/build noise a review list never wants.
+*  The path box can still reach them by typing the path outright. */
+const BROWSE_HIDDEN_NAMES = /* @__PURE__ */ new Set([".git", "node_modules"]);
+/** Cap on one browse level's children: the panel renders a list, not a dump of a
+*  huge directory, and it reports `truncated` rather than silently cutting. */
+const BROWSE_ENTRY_CAP = 500;
+/** Cap on the files one no-change walk reads: ticking the box on a directory
+*  asks for "everything under here", which must not mean reading a whole tree
+*  (every file's text) inside one call. */
+const ADD_UNCHANGED_CAP = 300;
+/**
+* One absolute path as a workspace-relative path with `/` separators, or
+* `undefined` when it lies outside the root. `''` is the root itself.
+* @param root - the workspace root.
+* @param absolute - the path to express relative to it.
+* @returns the relative path, or undefined when outside.
+*/
+function workspaceRelativeOf(root, absolute) {
+	const rel = relative(resolve(root), resolve(absolute));
+	if (rel === "") return "";
+	if (isAbsolute(rel)) return void 0;
+	const parts = rel.split(/[\\/]/);
+	if (parts[0] === "..") return void 0;
+	return parts.join("/");
+}
+/**
+* Resolve one caller-supplied path against the workspace root. A relative path
+* is taken as workspace-relative; an absolute one must still land inside.
+* @param root - the workspace root.
+* @param input - the caller's path (absolute or workspace-relative).
+* @returns the absolute path, or undefined when it escapes the workspace.
+*/
+function resolveInsideWorkspace(root, input) {
+	const absolute = isAbsolute(input) ? resolve(input) : resolve(root, input);
+	return workspaceRelativeOf(root, absolute) === void 0 ? void 0 : absolute;
+}
+/** The workspace-relative parent of a relative directory path (`''` at the root). */
+/** Fold one path for comparison: absolute, `/`-separated, case-folded on Windows.
+*  Entries are keyed by the path spelling their capture carried (a tool's display
+*  path or a scan's absolute one), so an equality test has to normalize first. */
+function pathIdentity(absolute) {
+	const unified = resolve(absolute).split(/[\\/]/).join("/");
+	return process.platform === "win32" ? unified.toLowerCase() : unified;
+}
 /** Narrow a tool-execution-shaped value to its name, call id, and agent. */
 function actorOf(value) {
 	if (typeof value !== "object" || value === null) return void 0;
@@ -1103,6 +2023,138 @@ function apply(ctx, config) {
 		};
 	}
 	/**
+	* Fold a batch of entries into one session's list as a single undoable action.
+	* Nothing touches the files, so the batch is undone by restoring each affected
+	* path's pre-fold entry (or removing it when the path was not listed), which is
+	* what the import and the hand-add path both want.
+	* @param sessionId - the session whose list gains the entries.
+	* @param entries - the entries to fold, in capture order.
+	* @param admitNoDiff - also admit entries that carry no diff at all (the
+	*        guard-free insert), which is how a hand-added clean path is listed.
+	* @returns how many entries landed; 0 leaves the store, persistence, and the
+	*          undo queue untouched.
+	*/
+	async function foldBatch(sessionId, entries, admitNoDiff = false) {
+		await ensureLoaded();
+		const before = new Map(store.list(sessionId).map((entry) => [entry.path, entry]));
+		let folded = 0;
+		const changedPaths = [];
+		for (const entry of entries) if (entry.oldText === entry.newText ? admitNoDiff && store.insert(entry) : store.fold(entry)) {
+			folded += 1;
+			changedPaths.push(entry.path);
+		}
+		if (folded === 0) return 0;
+		persistSession(true);
+		const after = new Map(store.list(sessionId).map((entry) => [entry.path, entry]));
+		const batchBefore = [];
+		const batchAfter = [];
+		for (const path of changedPaths) {
+			const final = after.get(path);
+			if (final === void 0) continue;
+			const pre = before.get(path);
+			batchAfter.push({
+				id: final.id,
+				path,
+				entry: final,
+				fileText: void 0
+			});
+			batchBefore.push({
+				id: final.id,
+				path,
+				entry: pre,
+				fileText: void 0
+			});
+		}
+		if (batchBefore.length > 0) pushUndo(sessionId, {
+			id: batchBefore[0].id,
+			path: batchBefore[0].path,
+			entry: void 0,
+			fileText: void 0,
+			batch: batchBefore
+		}, {
+			id: batchAfter[0].id,
+			path: batchAfter[0].path,
+			entry: void 0,
+			fileText: void 0,
+			batch: batchAfter
+		});
+		return folded;
+	}
+	/**
+	* One path's text, or `undefined` when it is absent or not readable as text
+	* (a binary, an unreadable permission). An empty file reads as `''`, which is
+	* a value: a listed entry may carry no content at all.
+	* @param absolute - the path to read.
+	* @param signal - caller lifetime.
+	* @returns the text, or undefined.
+	*/
+	async function readTextOrNone(absolute, signal) {
+		try {
+			return await ctx.fs.readText(await ctx.fs.resolve(absolute, { signal }), signal);
+		} catch {
+			return;
+		}
+	}
+	/**
+	* Every regular file under one directory, with its text. Breadth-first in the
+	* backend's name order, hiding the browse's noise names, skipping whatever is
+	* not readable as text, and stopping at {@link ADD_UNCHANGED_CAP} files so
+	* "include paths with no change" cannot read an unbounded tree in one call.
+	* Symlinked directories are followed once, so a cycle ends rather than loops.
+	* @param root - the resolved directory target to walk.
+	* @param rootAbsolute - that directory's absolute path.
+	* @param signal - caller lifetime.
+	* @returns the files found and whether the cap cut the walk short.
+	*/
+	async function collectFilesUnder(root, rootAbsolute, signal) {
+		const files = [];
+		const visited = /* @__PURE__ */ new Set();
+		if (typeof root.targetKey === "string" && root.targetKey !== "") visited.add(root.targetKey);
+		const queue = [{
+			absolute: rootAbsolute,
+			target: root
+		}];
+		while (queue.length > 0) {
+			const current = queue.shift();
+			if (current === void 0) break;
+			let children;
+			try {
+				children = await ctx.fs.listDir(current.target, signal);
+			} catch {
+				continue;
+			}
+			for (const child of children) {
+				if (BROWSE_HIDDEN_NAMES.has(child.name)) continue;
+				const absolute = resolve(current.absolute, child.name);
+				if (child.type === "directory") {
+					const key = child.target.targetKey;
+					if (typeof key === "string" && key !== "") {
+						if (visited.has(key)) continue;
+						visited.add(key);
+					}
+					queue.push({
+						absolute,
+						target: child.target
+					});
+					continue;
+				}
+				if (child.type !== "file") continue;
+				if (files.length >= ADD_UNCHANGED_CAP) return {
+					files,
+					truncated: true
+				};
+				files.push({
+					path: absolute,
+					content: await readTextOrNone(absolute, signal)
+				});
+			}
+		}
+		return {
+			files,
+			truncated: false
+		};
+	}
+	/**
 	* The workspace whose session account holds `sessionId`. Web sessions are
 	* attached to a workspace at creation, so an unowned session is the
 	* memory-only edge (its entries never persist).
@@ -1690,66 +2742,19 @@ function apply(ctx, config) {
 				} catch (error) {
 					return rpcError(`import failed: ${errorMessage(error)}`);
 				}
-				await ensureLoaded();
-				const before = new Map(store.list(sessionId).map((entry) => [entry.path, entry]));
-				let imported = 0;
-				const changedPaths = [];
-				for (const change of changes) {
-					const entry = {
-						id: change.path,
-						sessionId,
-						path: change.path,
-						kind: change.kind,
-						oldText: change.oldText,
-						newText: change.newText,
-						updatedAt: Date.now(),
-						sessionIds: [sessionId]
-					};
-					if (store.fold(entry)) {
-						imported += 1;
-						changedPaths.push(change.path);
-					}
-				}
-				if (imported > 0) {
-					persistSession();
-					const after = new Map(store.list(sessionId).map((entry) => [entry.path, entry]));
-					const batchBefore = [];
-					const batchAfter = [];
-					for (const path of changedPaths) {
-						const final = after.get(path);
-						if (final === void 0) continue;
-						const pre = before.get(path);
-						batchAfter.push({
-							id: final.id,
-							path,
-							entry: final,
-							fileText: void 0
-						});
-						batchBefore.push({
-							id: final.id,
-							path,
-							entry: pre,
-							fileText: void 0
-						});
-					}
-					if (batchBefore.length > 0) pushUndo(sessionId, {
-						id: batchBefore[0].id,
-						path: batchBefore[0].path,
-						entry: void 0,
-						fileText: void 0,
-						batch: batchBefore
-					}, {
-						id: batchAfter[0].id,
-						path: batchAfter[0].path,
-						entry: void 0,
-						fileText: void 0,
-						batch: batchAfter
-					});
-				}
 				return {
 					ok: true,
 					value: {
-						imported,
+						imported: await foldBatch(sessionId, changes.map((change) => ({
+							id: change.path,
+							sessionId,
+							path: change.path,
+							kind: change.kind,
+							oldText: change.oldText,
+							newText: change.newText,
+							updatedAt: Date.now(),
+							sessionIds: [sessionId]
+						}))),
 						detected: true
 					}
 				};
@@ -1787,8 +2792,7 @@ function apply(ctx, config) {
 				} catch (error) {
 					return rpcError(`refresh failed: ${errorMessage(error)}`);
 				}
-				const folded = (value) => process.platform === "win32" ? resolve(value).toLowerCase() : resolve(value);
-				const change = changes.find((candidate) => folded(candidate.path) === folded(entry.path));
+				const change = changes.find((candidate) => pathIdentity(candidate.path) === pathIdentity(entry.path));
 				if (change === void 0) return {
 					ok: true,
 					value: { outcome: "no-change" }
@@ -1822,6 +2826,175 @@ function apply(ctx, config) {
 					value: { outcome: "refreshed" }
 				};
 			}
+			case "list-path": {
+				const sessionId = sessionOf(payload);
+				if (sessionId === void 0) return rpcError("sessionId must be a non-empty string");
+				const workspace = workspaceOf(sessionId);
+				if (workspace === void 0) return rpcError("browse unavailable: the session has no workspace");
+				const requested = pathFieldOf(payload) ?? "";
+				const absolute = resolveInsideWorkspace(workspace.path, requested);
+				if (absolute === void 0) return rpcError("browse failed: the path is outside the workspace");
+				let children;
+				try {
+					const target = await ctx.fs.resolve(absolute, { signal });
+					const info = await ctx.fs.stat(target, signal);
+					if (info === void 0 || info.type !== "directory") return rpcError("browse failed: not a directory");
+					children = await ctx.fs.listDir(target, signal);
+				} catch (error) {
+					return rpcError(`browse failed: ${errorMessage(error)}`);
+				}
+				const entries = [];
+				for (const child of children) {
+					if (BROWSE_HIDDEN_NAMES.has(child.name)) continue;
+					const childAbsolute = resolve(absolute, child.name);
+					if (workspaceRelativeOf(workspace.path, childAbsolute) === void 0) continue;
+					entries.push({
+						name: child.name,
+						type: child.type === "directory" ? "directory" : child.type === "file" ? "file" : "other",
+						path: childAbsolute,
+						size: child.type === "file" ? child.size : void 0
+					});
+				}
+				entries.sort((left, right) => {
+					const rank = (value) => value.type === "directory" ? 0 : 1;
+					const byKind = rank(left) - rank(right);
+					return byKind !== 0 ? byKind : left.name.localeCompare(right.name, void 0, {
+						numeric: true,
+						sensitivity: "base"
+					});
+				});
+				const truncated = entries.length > BROWSE_ENTRY_CAP;
+				return {
+					ok: true,
+					value: {
+						path: absolute,
+						entries: truncated ? entries.slice(0, BROWSE_ENTRY_CAP) : entries,
+						truncated
+					}
+				};
+			}
+			case "add-path": {
+				const target = addTargetOf(payload);
+				if (target === void 0) return rpcError("sessionId and path must be non-empty strings");
+				const workspace = workspaceOf(target.sessionId);
+				if (workspace === void 0) return rpcError("add unavailable: the session has no workspace");
+				const absolute = resolveInsideWorkspace(workspace.path, target.path);
+				if (absolute === void 0) return {
+					ok: true,
+					value: {
+						outcome: "outside",
+						added: 0,
+						duplicates: 0
+					}
+				};
+				await ensureLoaded();
+				let info;
+				try {
+					const target = await ctx.fs.resolve(absolute, { signal });
+					info = await ctx.fs.stat(target, signal);
+				} catch (error) {
+					return rpcError(`add failed: ${errorMessage(error)}`);
+				}
+				if (info === void 0 || info.type === "other") return {
+					ok: true,
+					value: {
+						outcome: "missing",
+						added: 0,
+						duplicates: 0
+					}
+				};
+				const isDirectory = info.type === "directory";
+				const root = detectVcsRoot(workspace.path);
+				if (root === void 0) return {
+					ok: true,
+					value: {
+						outcome: "no-vcs",
+						added: 0,
+						duplicates: 0
+					}
+				};
+				const shell = ctx.get("shell");
+				if (shell === void 0) return rpcError("add unavailable: the deployment has no shell executor");
+				let changes;
+				try {
+					changes = await listVcsChanges({
+						kind: root.kind,
+						root: root.root,
+						workspaceRoot: workspace.path,
+						includeUntracked: true,
+						scope: absolute,
+						shell,
+						readText: (path) => readFile(path, "utf8").catch(() => void 0),
+						signal
+					});
+				} catch (error) {
+					return {
+						ok: true,
+						value: {
+							outcome: "failed",
+							added: 0,
+							duplicates: 0,
+							message: errorMessage(error)
+						}
+					};
+				}
+				const now = Date.now();
+				const candidates = changes.map((change) => ({
+					id: change.path,
+					sessionId: target.sessionId,
+					path: change.path,
+					kind: change.kind,
+					oldText: change.oldText,
+					newText: change.newText,
+					updatedAt: now,
+					sessionIds: [target.sessionId]
+				}));
+				let truncated = false;
+				if (target.includeUnchanged) {
+					const scanned = new Set(candidates.map((entry) => pathIdentity(entry.path)));
+					const found = isDirectory ? await collectFilesUnder(await ctx.fs.resolve(absolute, { signal }), absolute, signal) : {
+						files: [{
+							path: absolute,
+							content: await readTextOrNone(absolute, signal)
+						}],
+						truncated: false
+					};
+					truncated = found.truncated;
+					for (const file of found.files) {
+						if (file.content === void 0) continue;
+						if (scanned.has(pathIdentity(file.path))) continue;
+						scanned.add(pathIdentity(file.path));
+						candidates.push({
+							id: file.path,
+							sessionId: target.sessionId,
+							path: file.path,
+							kind: "edit",
+							oldText: file.content,
+							newText: file.content,
+							updatedAt: now,
+							sessionIds: [target.sessionId]
+						});
+					}
+				}
+				const listed = new Set(store.list(target.sessionId).map((entry) => pathIdentity(entry.path)));
+				const fresh = candidates.filter((entry) => !listed.has(pathIdentity(entry.path)));
+				const duplicates = candidates.length - fresh.length;
+				const added = await foldBatch(target.sessionId, fresh, true);
+				const outcome = added > 0 ? "added" : duplicates > 0 ? "duplicate" : isDirectory ? "empty" : "unchanged";
+				return {
+					ok: true,
+					value: truncated ? {
+						outcome,
+						added,
+						duplicates,
+						truncated
+					} : {
+						outcome,
+						added,
+						duplicates
+					}
+				};
+			}
 			case "open": {
 				const target = openTargetOf(payload);
 				if (target === void 0) return rpcError("sessionId, id, and action must be valid");
@@ -1980,6 +3153,24 @@ function previewImageTargetOf(payload) {
 		path
 	};
 }
+/** One payload's optional `path` field; absent (or not a string) is undefined. */
+function pathFieldOf(payload) {
+	if (typeof payload !== "object" || payload === null || Array.isArray(payload)) return void 0;
+	const path = payload.path;
+	return typeof path === "string" ? path : void 0;
+}
+/** Narrow a wire payload to one hand-added path. */
+function addTargetOf(payload) {
+	const sessionId = sessionOf(payload);
+	if (sessionId === void 0) return void 0;
+	const path = pathFieldOf(payload)?.trim();
+	if (path === void 0 || path === "") return void 0;
+	return {
+		sessionId,
+		path,
+		includeUnchanged: payload.includeUnchanged === true
+	};
+}
 /** Narrow a wire payload to one open target: the keep/revert pair plus the action. */
 function openTargetOf(payload) {
 	const target = targetOf(payload);