@optique/core 1.0.16-dev.2975 → 1.0.16-dev.2986

package/dist/input-trace.cjs

@@ -22,23 +22,102 @@ function serializePath(path) {
 	if (path.length === 0) return "";
 	return path.map(serializeKey).join("");
 }
+function height(node$1) {
+	return node$1?.height ?? 0;
+}
+function node(key, entry, left, right) {
+	return {
+		key,
+		entry,
+		left,
+		right,
+		height: 1 + Math.max(height(left), height(right))
+	};
+}
+function balance(key, entry, left, right) {
+	if (height(left) - height(right) > 1 && left != null) {
+		const pivot = left.right;
+		if (height(pivot) > height(left.left) && pivot != null) return node(pivot.key, pivot.entry, node(left.key, left.entry, left.left, pivot.left), node(key, entry, pivot.right, right));
+		return node(left.key, left.entry, left.left, node(key, entry, left.right, right));
+	}
+	if (height(right) - height(left) > 1 && right != null) {
+		const pivot = right.left;
+		if (height(pivot) > height(right.right) && pivot != null) return node(pivot.key, pivot.entry, node(key, entry, left, pivot.left), node(right.key, right.entry, pivot.right, right.right));
+		return node(right.key, right.entry, node(key, entry, left, right.left), right.right);
+	}
+	return node(key, entry, left, right);
+}
+function setEntry(root, key, entry) {
+	if (root == null) return node(key, entry, void 0, void 0);
+	if (key === root.key) return entry === root.entry ? root : {
+		...root,
+		entry
+	};
+	if (key < root.key) {
+		const left = setEntry(root.left, key, entry);
+		return left === root.left ? root : balance(root.key, root.entry, left, root.right);
+	}
+	const right = setEntry(root.right, key, entry);
+	return right === root.right ? root : balance(root.key, root.entry, root.left, right);
+}
+function popMin(root) {
+	if (root.left == null) return [root, root.right];
+	const [minimum, left] = popMin(root.left);
+	return [minimum, balance(root.key, root.entry, left, root.right)];
+}
+function deleteEntry(root, key) {
+	if (root == null) return void 0;
+	if (key === root.key) {
+		if (root.left == null) return root.right;
+		if (root.right == null) return root.left;
+		const [successor, right$1] = popMin(root.right);
+		return balance(successor.key, successor.entry, root.left, right$1);
+	}
+	if (key < root.key) {
+		const left = deleteEntry(root.left, key);
+		return left === root.left ? root : balance(root.key, root.entry, left, root.right);
+	}
+	const right = deleteEntry(root.right, key);
+	return right === root.right ? root : balance(root.key, root.entry, root.left, right);
+}
+function inspectNode(root, lower, upper) {
+	if (root == null) return {
+		size: 0,
+		height: 0
+	};
+	if (lower !== void 0 && root.key <= lower || upper !== void 0 && root.key >= upper) throw new TypeError("Input trace keys are not strictly ordered.");
+	const left = inspectNode(root.left, lower, root.key);
+	const right = inspectNode(root.right, root.key, upper);
+	const actualHeight = 1 + Math.max(left.height, right.height);
+	if (root.height !== actualHeight || Math.abs(left.height - right.height) > 1) throw new TypeError("Input trace heights or balance are invalid.");
+	return {
+		size: 1 + left.size + right.size,
+		height: actualHeight
+	};
+}
 var InputTraceImpl = class InputTraceImpl {
-	#entries;
-	constructor(entries) {
-		this.#entries = entries ?? /* @__PURE__ */ new Map();
+	#root;
+	constructor(root) {
+		this.#root = root;
 	}
 	get(path) {
-		return this.#entries.get(serializePath(path));
+		const key = serializePath(path);
+		let current = this.#root;
+		while (current != null) {
+			if (key === current.key) return current.entry;
+			current = key < current.key ? current.left : current.right;
+		}
+		return void 0;
 	}
 	set(path, entry) {
-		const copy = new Map(this.#entries);
-		copy.set(serializePath(path), entry);
-		return new InputTraceImpl(copy);
+		return new InputTraceImpl(setEntry(this.#root, serializePath(path), entry));
 	}
 	delete(path) {
-		const copy = new Map(this.#entries);
-		copy.delete(serializePath(path));
-		return new InputTraceImpl(copy);
+		return new InputTraceImpl(deleteEntry(this.#root, serializePath(path)));
+	}
+	static inspect(trace) {
+		if (!(trace instanceof InputTraceImpl)) throw new TypeError("Expected an Optique input trace.");
+		return inspectNode(trace.#root);
 	}
 };
 /**

package/dist/input-trace.d.cts

@@ -67,11 +67,14 @@ interface InputTrace {
   delete(path: readonly PropertyKey[]): InputTrace;
 }
 /**
- * Creates a new empty {@link InputTrace}.
+ * Checks private tree invariants without exposing mutable nodes.
+ * This module is not a package export; the checker is used by internal tests.
  *
- * @returns An empty immutable input trace.
+ * @param trace The trace to inspect.
+ * @returns Its size and verified height.
+ * @throws {TypeError} If the trace is foreign or its tree invariants are invalid.
  * @internal
- * @since 1.0.0
+ * @since 1.0.16
  */
 //#endregion
 export { InputTrace };

package/dist/input-trace.d.ts

@@ -67,11 +67,14 @@ interface InputTrace {
   delete(path: readonly PropertyKey[]): InputTrace;
 }
 /**
- * Creates a new empty {@link InputTrace}.
+ * Checks private tree invariants without exposing mutable nodes.
+ * This module is not a package export; the checker is used by internal tests.
  *
- * @returns An empty immutable input trace.
+ * @param trace The trace to inspect.
+ * @returns Its size and verified height.
+ * @throws {TypeError} If the trace is foreign or its tree invariants are invalid.
  * @internal
- * @since 1.0.0
+ * @since 1.0.16
  */
 //#endregion
 export { InputTrace };

package/dist/input-trace.js

@@ -21,23 +21,102 @@ function serializePath(path) {
 	if (path.length === 0) return "";
 	return path.map(serializeKey).join("");
 }
+function height(node$1) {
+	return node$1?.height ?? 0;
+}
+function node(key, entry, left, right) {
+	return {
+		key,
+		entry,
+		left,
+		right,
+		height: 1 + Math.max(height(left), height(right))
+	};
+}
+function balance(key, entry, left, right) {
+	if (height(left) - height(right) > 1 && left != null) {
+		const pivot = left.right;
+		if (height(pivot) > height(left.left) && pivot != null) return node(pivot.key, pivot.entry, node(left.key, left.entry, left.left, pivot.left), node(key, entry, pivot.right, right));
+		return node(left.key, left.entry, left.left, node(key, entry, left.right, right));
+	}
+	if (height(right) - height(left) > 1 && right != null) {
+		const pivot = right.left;
+		if (height(pivot) > height(right.right) && pivot != null) return node(pivot.key, pivot.entry, node(key, entry, left, pivot.left), node(right.key, right.entry, pivot.right, right.right));
+		return node(right.key, right.entry, node(key, entry, left, right.left), right.right);
+	}
+	return node(key, entry, left, right);
+}
+function setEntry(root, key, entry) {
+	if (root == null) return node(key, entry, void 0, void 0);
+	if (key === root.key) return entry === root.entry ? root : {
+		...root,
+		entry
+	};
+	if (key < root.key) {
+		const left = setEntry(root.left, key, entry);
+		return left === root.left ? root : balance(root.key, root.entry, left, root.right);
+	}
+	const right = setEntry(root.right, key, entry);
+	return right === root.right ? root : balance(root.key, root.entry, root.left, right);
+}
+function popMin(root) {
+	if (root.left == null) return [root, root.right];
+	const [minimum, left] = popMin(root.left);
+	return [minimum, balance(root.key, root.entry, left, root.right)];
+}
+function deleteEntry(root, key) {
+	if (root == null) return void 0;
+	if (key === root.key) {
+		if (root.left == null) return root.right;
+		if (root.right == null) return root.left;
+		const [successor, right$1] = popMin(root.right);
+		return balance(successor.key, successor.entry, root.left, right$1);
+	}
+	if (key < root.key) {
+		const left = deleteEntry(root.left, key);
+		return left === root.left ? root : balance(root.key, root.entry, left, root.right);
+	}
+	const right = deleteEntry(root.right, key);
+	return right === root.right ? root : balance(root.key, root.entry, root.left, right);
+}
+function inspectNode(root, lower, upper) {
+	if (root == null) return {
+		size: 0,
+		height: 0
+	};
+	if (lower !== void 0 && root.key <= lower || upper !== void 0 && root.key >= upper) throw new TypeError("Input trace keys are not strictly ordered.");
+	const left = inspectNode(root.left, lower, root.key);
+	const right = inspectNode(root.right, root.key, upper);
+	const actualHeight = 1 + Math.max(left.height, right.height);
+	if (root.height !== actualHeight || Math.abs(left.height - right.height) > 1) throw new TypeError("Input trace heights or balance are invalid.");
+	return {
+		size: 1 + left.size + right.size,
+		height: actualHeight
+	};
+}
 var InputTraceImpl = class InputTraceImpl {
-	#entries;
-	constructor(entries) {
-		this.#entries = entries ?? /* @__PURE__ */ new Map();
+	#root;
+	constructor(root) {
+		this.#root = root;
 	}
 	get(path) {
-		return this.#entries.get(serializePath(path));
+		const key = serializePath(path);
+		let current = this.#root;
+		while (current != null) {
+			if (key === current.key) return current.entry;
+			current = key < current.key ? current.left : current.right;
+		}
+		return void 0;
 	}
 	set(path, entry) {
-		const copy = new Map(this.#entries);
-		copy.set(serializePath(path), entry);
-		return new InputTraceImpl(copy);
+		return new InputTraceImpl(setEntry(this.#root, serializePath(path), entry));
 	}
 	delete(path) {
-		const copy = new Map(this.#entries);
-		copy.delete(serializePath(path));
-		return new InputTraceImpl(copy);
+		return new InputTraceImpl(deleteEntry(this.#root, serializePath(path)));
+	}
+	static inspect(trace) {
+		if (!(trace instanceof InputTraceImpl)) throw new TypeError("Expected an Optique input trace.");
+		return inspectNode(trace.#root);
 	}
 };
 /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@optique/core",
-  "version": "1.0.16-dev.2975",
+  "version": "1.0.16-dev.2986",
   "description": "Type-safe combinatorial command-line interface parser",
   "keywords": [
     "CLI",