@rsconcept/domain 1.0.0 → 1.1.0

package/dist/lezer-tree-iS7LpLBJ.d.ts

@@ -0,0 +1,14 @@
+import { NodeType, Tree, TreeCursor } from "@lezer/common";
+
+//#region src/parsing/lezer-tree.d.ts
+/** Represents syntax tree node data. */
+interface CMSyntaxNode {
+  type: NodeType;
+  from: number;
+  to: number;
+}
+/** Prints tree to compact string. */
+declare function printTree(tree: Tree): string;
+//#endregion
+export { TreeCursor as n, printTree as r, CMSyntaxNode as t };
+//# sourceMappingURL=lezer-tree-iS7LpLBJ.d.ts.map

package/dist/library/folder-tree.d.ts

@@ -1,3 +1,4 @@
+//#region src/library/folder-tree.d.ts
 /**
  * Module: Folder tree data structure. Does not support deletions.
  */
@@ -5,28 +6,29 @@
  * Represents single node of a {@link FolderTree}.
  */
 declare class FolderNode {
-    rank: number;
-    text: string;
-    children: Map<string, FolderNode>;
-    parent: FolderNode | null;
-    filesInside: number;
-    filesTotal: number;
-    constructor(text: string, parent?: FolderNode | null);
-    addChild(text: string): FolderNode;
-    hasPredecessor(target: FolderNode): boolean;
-    incrementFiles(count?: number): void;
-    incrementTotal(count?: number): void;
-    getPath(): string;
+  rank: number;
+  text: string;
+  children: Map<string, FolderNode>;
+  parent: FolderNode | null;
+  filesInside: number;
+  filesTotal: number;
+  constructor(text: string, parent?: FolderNode | null);
+  addChild(text: string): FolderNode;
+  hasPredecessor(target: FolderNode): boolean;
+  incrementFiles(count?: number): void;
+  incrementTotal(count?: number): void;
+  getPath(): string;
 }
 /** Represents a FolderTree. */
 declare class FolderTree {
-    roots: Map<string, FolderNode>;
-    constructor(arr?: string[]);
-    at(path: string): FolderNode | undefined;
-    getTree(): FolderNode[];
-    private visitNode;
-    addPath(path: string, filesCount?: number): FolderNode;
-    private addNode;
+  roots: Map<string, FolderNode>;
+  constructor(arr?: string[]);
+  at(path: string): FolderNode | undefined;
+  getTree(): FolderNode[];
+  private visitNode;
+  addPath(path: string, filesCount?: number): FolderNode;
+  private addNode;
 }
-
+//#endregion
 export { FolderNode, FolderTree };
+//# sourceMappingURL=folder-tree.d.ts.map

package/dist/library/folder-tree.js

@@ -1,136 +1,114 @@
-// src/library/folder-tree.ts
-var FolderNode = class _FolderNode {
-  rank = 0;
-  text;
-  children;
-  parent;
-  filesInside = 0;
-  filesTotal = 0;
-  constructor(text, parent = null) {
-    this.text = text;
-    this.parent = parent;
-    this.children = /* @__PURE__ */ new Map();
-    if (parent) {
-      this.rank = parent.rank + 1;
-    }
-  }
-  addChild(text) {
-    const node = new _FolderNode(text, this);
-    this.children.set(text, node);
-    return node;
-  }
-  hasPredecessor(target) {
-    if (this.parent === target) {
-      return true;
-    } else if (!this.parent) {
-      return false;
-    }
-    let node = this.parent;
-    while (node.parent) {
-      if (node.parent === target) {
-        return true;
-      }
-      node = node.parent;
-    }
-    return false;
-  }
-  incrementFiles(count = 1) {
-    this.filesInside = this.filesInside + count;
-    this.incrementTotal(count);
-  }
-  incrementTotal(count = 1) {
-    this.filesTotal = this.filesTotal + count;
-    if (this.parent) {
-      this.parent.incrementTotal(count);
-    }
-  }
-  getPath() {
-    const suffix = this.text ? `/${this.text}` : "";
-    if (!this.parent) {
-      return suffix;
-    } else {
-      return this.parent.getPath() + suffix;
-    }
-  }
+//#region src/library/folder-tree.ts
+/**
+* Module: Folder tree data structure. Does not support deletions.
+*/
+/**
+* Represents single node of a {@link FolderTree}.
+*/
+var FolderNode = class FolderNode {
+	rank = 0;
+	text;
+	children;
+	parent;
+	filesInside = 0;
+	filesTotal = 0;
+	constructor(text, parent = null) {
+		this.text = text;
+		this.parent = parent;
+		this.children = /* @__PURE__ */ new Map();
+		if (parent) this.rank = parent.rank + 1;
+	}
+	addChild(text) {
+		const node = new FolderNode(text, this);
+		this.children.set(text, node);
+		return node;
+	}
+	hasPredecessor(target) {
+		if (this.parent === target) return true;
+		else if (!this.parent) return false;
+		let node = this.parent;
+		while (node.parent) {
+			if (node.parent === target) return true;
+			node = node.parent;
+		}
+		return false;
+	}
+	incrementFiles(count = 1) {
+		this.filesInside = this.filesInside + count;
+		this.incrementTotal(count);
+	}
+	incrementTotal(count = 1) {
+		this.filesTotal = this.filesTotal + count;
+		if (this.parent) this.parent.incrementTotal(count);
+	}
+	getPath() {
+		const suffix = this.text ? `/${this.text}` : "";
+		if (!this.parent) return suffix;
+		else return this.parent.getPath() + suffix;
+	}
 };
+/** Represents a FolderTree. */
 var FolderTree = class {
-  roots = /* @__PURE__ */ new Map();
-  constructor(arr) {
-    arr?.forEach((path) => this.addPath(path));
-  }
-  at(path) {
-    let parse = ChopPathHead(path);
-    if (!this.roots.has(parse.head)) {
-      return void 0;
-    }
-    let node = this.roots.get(parse.head);
-    while (parse.tail !== "") {
-      parse = ChopPathHead(parse.tail);
-      if (!node.children.has(parse.head)) {
-        return void 0;
-      }
-      node = node.children.get(parse.head);
-    }
-    return node;
-  }
-  getTree() {
-    const result = [];
-    this.roots.forEach((root) => this.visitNode(root, result));
-    return result;
-  }
-  visitNode(target, result) {
-    result.push(target);
-    [...target.children.keys()].sort((a, b) => a.localeCompare(b)).forEach((key) => this.visitNode(target.children.get(key), result));
-  }
-  addPath(path, filesCount = 1) {
-    let parse = ChopPathHead(path);
-    if (!parse.head) {
-      throw Error(`Invalid path ${path}`);
-    }
-    let node = this.roots.has(parse.head) ? this.roots.get(parse.head) : this.addNode(parse.head);
-    while (parse.tail !== "") {
-      parse = ChopPathHead(parse.tail);
-      if (node.children.has(parse.head)) {
-        node = node.children.get(parse.head);
-      } else {
-        node = this.addNode(parse.head, node);
-      }
-    }
-    node.incrementFiles(filesCount);
-    return node;
-  }
-  addNode(text, parent) {
-    if (!parent) {
-      const newNode = new FolderNode(text);
-      this.roots.set(text, newNode);
-      return newNode;
-    } else {
-      return parent.addChild(text);
-    }
-  }
+	roots = /* @__PURE__ */ new Map();
+	constructor(arr) {
+		arr?.forEach((path) => this.addPath(path));
+	}
+	at(path) {
+		let parse = ChopPathHead(path);
+		if (!this.roots.has(parse.head)) return;
+		let node = this.roots.get(parse.head);
+		while (parse.tail !== "") {
+			parse = ChopPathHead(parse.tail);
+			if (!node.children.has(parse.head)) return;
+			node = node.children.get(parse.head);
+		}
+		return node;
+	}
+	getTree() {
+		const result = [];
+		this.roots.forEach((root) => this.visitNode(root, result));
+		return result;
+	}
+	visitNode(target, result) {
+		result.push(target);
+		[...target.children.keys()].sort((a, b) => a.localeCompare(b)).forEach((key) => this.visitNode(target.children.get(key), result));
+	}
+	addPath(path, filesCount = 1) {
+		let parse = ChopPathHead(path);
+		if (!parse.head) throw Error(`Invalid path ${path}`);
+		let node = this.roots.has(parse.head) ? this.roots.get(parse.head) : this.addNode(parse.head);
+		while (parse.tail !== "") {
+			parse = ChopPathHead(parse.tail);
+			if (node.children.has(parse.head)) node = node.children.get(parse.head);
+			else node = this.addNode(parse.head, node);
+		}
+		node.incrementFiles(filesCount);
+		return node;
+	}
+	addNode(text, parent) {
+		if (!parent) {
+			const newNode = new FolderNode(text);
+			this.roots.set(text, newNode);
+			return newNode;
+		} else return parent.addChild(text);
+	}
 };
 function ChopPathHead(path) {
-  if (path?.at(0) !== "/") {
-    return {
-      head: "",
-      tail: ""
-    };
-  }
-  const slash = path.indexOf("/", 1);
-  if (slash === -1) {
-    return {
-      head: path.substring(1),
-      tail: ""
-    };
-  } else {
-    return {
-      head: path.substring(1, slash),
-      tail: path.substring(slash)
-    };
-  }
+	if (path?.at(0) !== "/") return {
+		head: "",
+		tail: ""
+	};
+	const slash = path.indexOf("/", 1);
+	if (slash === -1) return {
+		head: path.substring(1),
+		tail: ""
+	};
+	else return {
+		head: path.substring(1, slash),
+		tail: path.substring(slash)
+	};
 }
-export {
-  FolderNode,
-  FolderTree
-};
+//#endregion
+export { FolderNode, FolderTree };
+
 //# sourceMappingURL=folder-tree.js.map

package/dist/library/folder-tree.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/library/folder-tree.ts"],"sourcesContent":["/**\n * Module: Folder tree data structure. Does not support deletions.\n */\n\n/**\n * Represents single node of a {@link FolderTree}.\n */\nexport class FolderNode {\n  rank: number = 0;\n  text: string;\n  children: Map<string, FolderNode>;\n  parent: FolderNode | null;\n\n  filesInside: number = 0;\n  filesTotal: number = 0;\n\n  constructor(text: string, parent: FolderNode | null = null) {\n    this.text = text;\n    this.parent = parent;\n    this.children = new Map();\n    if (parent) {\n      this.rank = parent.rank + 1;\n    }\n  }\n\n  addChild(text: string): FolderNode {\n    const node = new FolderNode(text, this);\n    this.children.set(text, node);\n    return node;\n  }\n\n  hasPredecessor(target: FolderNode): boolean {\n    if (this.parent === target) {\n      return true;\n    } else if (!this.parent) {\n      return false;\n    }\n    let node = this.parent;\n    while (node.parent) {\n      if (node.parent === target) {\n        return true;\n      }\n      node = node.parent;\n    }\n    return false;\n  }\n\n  incrementFiles(count: number = 1): void {\n    this.filesInside = this.filesInside + count;\n    this.incrementTotal(count);\n  }\n\n  incrementTotal(count: number = 1): void {\n    this.filesTotal = this.filesTotal + count;\n    if (this.parent) {\n      this.parent.incrementTotal(count);\n    }\n  }\n\n  getPath(): string {\n    const suffix = this.text ? `/${this.text}` : '';\n    if (!this.parent) {\n      return suffix;\n    } else {\n      return this.parent.getPath() + suffix;\n    }\n  }\n}\n\n/** Represents a FolderTree. */\nexport class FolderTree {\n  roots = new Map<string, FolderNode>();\n\n  constructor(arr?: string[]) {\n    arr?.forEach(path => this.addPath(path));\n  }\n\n  at(path: string): FolderNode | undefined {\n    let parse = ChopPathHead(path);\n    if (!this.roots.has(parse.head)) {\n      return undefined;\n    }\n    let node = this.roots.get(parse.head)!;\n    while (parse.tail !== '') {\n      parse = ChopPathHead(parse.tail);\n      if (!node.children.has(parse.head)) {\n        return undefined;\n      }\n      node = node.children.get(parse.head)!;\n    }\n    return node;\n  }\n\n  getTree(): FolderNode[] {\n    const result: FolderNode[] = [];\n    this.roots.forEach(root => this.visitNode(root, result));\n    return result;\n  }\n\n  private visitNode(target: FolderNode, result: FolderNode[]) {\n    result.push(target);\n    [...target.children.keys()]\n      .sort((a, b) => a.localeCompare(b))\n      .forEach(key => this.visitNode(target.children.get(key)!, result));\n  }\n\n  addPath(path: string, filesCount: number = 1): FolderNode {\n    let parse = ChopPathHead(path);\n    if (!parse.head) {\n      throw Error(`Invalid path ${path}`);\n    }\n    let node = this.roots.has(parse.head) ? this.roots.get(parse.head)! : this.addNode(parse.head);\n    while (parse.tail !== '') {\n      parse = ChopPathHead(parse.tail);\n      if (node.children.has(parse.head)) {\n        node = node.children.get(parse.head)!;\n      } else {\n        node = this.addNode(parse.head, node);\n      }\n    }\n    node.incrementFiles(filesCount);\n    return node;\n  }\n\n  private addNode(text: string, parent?: FolderNode): FolderNode {\n    if (!parent) {\n      const newNode = new FolderNode(text);\n      this.roots.set(text, newNode);\n      return newNode;\n    } else {\n      return parent.addChild(text);\n    }\n  }\n}\n\n// ========= Internals =======\nfunction ChopPathHead(path: string) {\n  if (path?.at(0) !== '/') {\n    return {\n      head: '',\n      tail: ''\n    };\n  }\n  const slash = path.indexOf('/', 1);\n  if (slash === -1) {\n    return {\n      head: path.substring(1),\n      tail: ''\n    };\n  } else {\n    return {\n      head: path.substring(1, slash),\n      tail: path.substring(slash)\n    };\n  }\n}\n"],"mappings":";AAOO,IAAM,aAAN,MAAM,YAAW;AAAA,EACtB,OAAe;AAAA,EACf;AAAA,EACA;AAAA,EACA;AAAA,EAEA,cAAsB;AAAA,EACtB,aAAqB;AAAA,EAErB,YAAY,MAAc,SAA4B,MAAM;AAC1D,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,SAAK,WAAW,oBAAI,IAAI;AACxB,QAAI,QAAQ;AACV,WAAK,OAAO,OAAO,OAAO;AAAA,IAC5B;AAAA,EACF;AAAA,EAEA,SAAS,MAA0B;AACjC,UAAM,OAAO,IAAI,YAAW,MAAM,IAAI;AACtC,SAAK,SAAS,IAAI,MAAM,IAAI;AAC5B,WAAO;AAAA,EACT;AAAA,EAEA,eAAe,QAA6B;AAC1C,QAAI,KAAK,WAAW,QAAQ;AAC1B,aAAO;AAAA,IACT,WAAW,CAAC,KAAK,QAAQ;AACvB,aAAO;AAAA,IACT;AACA,QAAI,OAAO,KAAK;AAChB,WAAO,KAAK,QAAQ;AAClB,UAAI,KAAK,WAAW,QAAQ;AAC1B,eAAO;AAAA,MACT;AACA,aAAO,KAAK;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA,EAEA,eAAe,QAAgB,GAAS;AACtC,SAAK,cAAc,KAAK,cAAc;AACtC,SAAK,eAAe,KAAK;AAAA,EAC3B;AAAA,EAEA,eAAe,QAAgB,GAAS;AACtC,SAAK,aAAa,KAAK,aAAa;AACpC,QAAI,KAAK,QAAQ;AACf,WAAK,OAAO,eAAe,KAAK;AAAA,IAClC;AAAA,EACF;AAAA,EAEA,UAAkB;AAChB,UAAM,SAAS,KAAK,OAAO,IAAI,KAAK,IAAI,KAAK;AAC7C,QAAI,CAAC,KAAK,QAAQ;AAChB,aAAO;AAAA,IACT,OAAO;AACL,aAAO,KAAK,OAAO,QAAQ,IAAI;AAAA,IACjC;AAAA,EACF;AACF;AAGO,IAAM,aAAN,MAAiB;AAAA,EACtB,QAAQ,oBAAI,IAAwB;AAAA,EAEpC,YAAY,KAAgB;AAC1B,SAAK,QAAQ,UAAQ,KAAK,QAAQ,IAAI,CAAC;AAAA,EACzC;AAAA,EAEA,GAAG,MAAsC;AACvC,QAAI,QAAQ,aAAa,IAAI;AAC7B,QAAI,CAAC,KAAK,MAAM,IAAI,MAAM,IAAI,GAAG;AAC/B,aAAO;AAAA,IACT;AACA,QAAI,OAAO,KAAK,MAAM,IAAI,MAAM,IAAI;AACpC,WAAO,MAAM,SAAS,IAAI;AACxB,cAAQ,aAAa,MAAM,IAAI;AAC/B,UAAI,CAAC,KAAK,SAAS,IAAI,MAAM,IAAI,GAAG;AAClC,eAAO;AAAA,MACT;AACA,aAAO,KAAK,SAAS,IAAI,MAAM,IAAI;AAAA,IACrC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,UAAwB;AACtB,UAAM,SAAuB,CAAC;AAC9B,SAAK,MAAM,QAAQ,UAAQ,KAAK,UAAU,MAAM,MAAM,CAAC;AACvD,WAAO;AAAA,EACT;AAAA,EAEQ,UAAU,QAAoB,QAAsB;AAC1D,WAAO,KAAK,MAAM;AAClB,KAAC,GAAG,OAAO,SAAS,KAAK,CAAC,EACvB,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,EACjC,QAAQ,SAAO,KAAK,UAAU,OAAO,SAAS,IAAI,GAAG,GAAI,MAAM,CAAC;AAAA,EACrE;AAAA,EAEA,QAAQ,MAAc,aAAqB,GAAe;AACxD,QAAI,QAAQ,aAAa,IAAI;AAC7B,QAAI,CAAC,MAAM,MAAM;AACf,YAAM,MAAM,gBAAgB,IAAI,EAAE;AAAA,IACpC;AACA,QAAI,OAAO,KAAK,MAAM,IAAI,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI,MAAM,IAAI,IAAK,KAAK,QAAQ,MAAM,IAAI;AAC7F,WAAO,MAAM,SAAS,IAAI;AACxB,cAAQ,aAAa,MAAM,IAAI;AAC/B,UAAI,KAAK,SAAS,IAAI,MAAM,IAAI,GAAG;AACjC,eAAO,KAAK,SAAS,IAAI,MAAM,IAAI;AAAA,MACrC,OAAO;AACL,eAAO,KAAK,QAAQ,MAAM,MAAM,IAAI;AAAA,MACtC;AAAA,IACF;AACA,SAAK,eAAe,UAAU;AAC9B,WAAO;AAAA,EACT;AAAA,EAEQ,QAAQ,MAAc,QAAiC;AAC7D,QAAI,CAAC,QAAQ;AACX,YAAM,UAAU,IAAI,WAAW,IAAI;AACnC,WAAK,MAAM,IAAI,MAAM,OAAO;AAC5B,aAAO;AAAA,IACT,OAAO;AACL,aAAO,OAAO,SAAS,IAAI;AAAA,IAC7B;AAAA,EACF;AACF;AAGA,SAAS,aAAa,MAAc;AAClC,MAAI,MAAM,GAAG,CAAC,MAAM,KAAK;AACvB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AACA,QAAM,QAAQ,KAAK,QAAQ,KAAK,CAAC;AACjC,MAAI,UAAU,IAAI;AAChB,WAAO;AAAA,MACL,MAAM,KAAK,UAAU,CAAC;AAAA,MACtB,MAAM;AAAA,IACR;AAAA,EACF,OAAO;AACL,WAAO;AAAA,MACL,MAAM,KAAK,UAAU,GAAG,KAAK;AAAA,MAC7B,MAAM,KAAK,UAAU,KAAK;AAAA,IAC5B;AAAA,EACF;AACF;","names":[]}
+{"version":3,"file":"folder-tree.js","names":[],"sources":["../../src/library/folder-tree.ts"],"sourcesContent":["/**\n * Module: Folder tree data structure. Does not support deletions.\n */\n\n/**\n * Represents single node of a {@link FolderTree}.\n */\nexport class FolderNode {\n  rank: number = 0;\n  text: string;\n  children: Map<string, FolderNode>;\n  parent: FolderNode | null;\n\n  filesInside: number = 0;\n  filesTotal: number = 0;\n\n  constructor(text: string, parent: FolderNode | null = null) {\n    this.text = text;\n    this.parent = parent;\n    this.children = new Map();\n    if (parent) {\n      this.rank = parent.rank + 1;\n    }\n  }\n\n  addChild(text: string): FolderNode {\n    const node = new FolderNode(text, this);\n    this.children.set(text, node);\n    return node;\n  }\n\n  hasPredecessor(target: FolderNode): boolean {\n    if (this.parent === target) {\n      return true;\n    } else if (!this.parent) {\n      return false;\n    }\n    let node = this.parent;\n    while (node.parent) {\n      if (node.parent === target) {\n        return true;\n      }\n      node = node.parent;\n    }\n    return false;\n  }\n\n  incrementFiles(count: number = 1): void {\n    this.filesInside = this.filesInside + count;\n    this.incrementTotal(count);\n  }\n\n  incrementTotal(count: number = 1): void {\n    this.filesTotal = this.filesTotal + count;\n    if (this.parent) {\n      this.parent.incrementTotal(count);\n    }\n  }\n\n  getPath(): string {\n    const suffix = this.text ? `/${this.text}` : '';\n    if (!this.parent) {\n      return suffix;\n    } else {\n      return this.parent.getPath() + suffix;\n    }\n  }\n}\n\n/** Represents a FolderTree. */\nexport class FolderTree {\n  roots = new Map<string, FolderNode>();\n\n  constructor(arr?: string[]) {\n    arr?.forEach(path => this.addPath(path));\n  }\n\n  at(path: string): FolderNode | undefined {\n    let parse = ChopPathHead(path);\n    if (!this.roots.has(parse.head)) {\n      return undefined;\n    }\n    let node = this.roots.get(parse.head)!;\n    while (parse.tail !== '') {\n      parse = ChopPathHead(parse.tail);\n      if (!node.children.has(parse.head)) {\n        return undefined;\n      }\n      node = node.children.get(parse.head)!;\n    }\n    return node;\n  }\n\n  getTree(): FolderNode[] {\n    const result: FolderNode[] = [];\n    this.roots.forEach(root => this.visitNode(root, result));\n    return result;\n  }\n\n  private visitNode(target: FolderNode, result: FolderNode[]) {\n    result.push(target);\n    [...target.children.keys()]\n      .sort((a, b) => a.localeCompare(b))\n      .forEach(key => this.visitNode(target.children.get(key)!, result));\n  }\n\n  addPath(path: string, filesCount: number = 1): FolderNode {\n    let parse = ChopPathHead(path);\n    if (!parse.head) {\n      throw Error(`Invalid path ${path}`);\n    }\n    let node = this.roots.has(parse.head) ? this.roots.get(parse.head)! : this.addNode(parse.head);\n    while (parse.tail !== '') {\n      parse = ChopPathHead(parse.tail);\n      if (node.children.has(parse.head)) {\n        node = node.children.get(parse.head)!;\n      } else {\n        node = this.addNode(parse.head, node);\n      }\n    }\n    node.incrementFiles(filesCount);\n    return node;\n  }\n\n  private addNode(text: string, parent?: FolderNode): FolderNode {\n    if (!parent) {\n      const newNode = new FolderNode(text);\n      this.roots.set(text, newNode);\n      return newNode;\n    } else {\n      return parent.addChild(text);\n    }\n  }\n}\n\n// ========= Internals =======\nfunction ChopPathHead(path: string) {\n  if (path?.at(0) !== '/') {\n    return {\n      head: '',\n      tail: ''\n    };\n  }\n  const slash = path.indexOf('/', 1);\n  if (slash === -1) {\n    return {\n      head: path.substring(1),\n      tail: ''\n    };\n  } else {\n    return {\n      head: path.substring(1, slash),\n      tail: path.substring(slash)\n    };\n  }\n}\n"],"mappings":";;;;;;;AAOA,IAAa,aAAb,MAAa,WAAW;CACtB,OAAe;CACf;CACA;CACA;CAEA,cAAsB;CACtB,aAAqB;CAErB,YAAY,MAAc,SAA4B,MAAM;EAC1D,KAAK,OAAO;EACZ,KAAK,SAAS;EACd,KAAK,2BAAW,IAAI,IAAI;EACxB,IAAI,QACF,KAAK,OAAO,OAAO,OAAO;CAE9B;CAEA,SAAS,MAA0B;EACjC,MAAM,OAAO,IAAI,WAAW,MAAM,IAAI;EACtC,KAAK,SAAS,IAAI,MAAM,IAAI;EAC5B,OAAO;CACT;CAEA,eAAe,QAA6B;EAC1C,IAAI,KAAK,WAAW,QAClB,OAAO;OACF,IAAI,CAAC,KAAK,QACf,OAAO;EAET,IAAI,OAAO,KAAK;EAChB,OAAO,KAAK,QAAQ;GAClB,IAAI,KAAK,WAAW,QAClB,OAAO;GAET,OAAO,KAAK;EACd;EACA,OAAO;CACT;CAEA,eAAe,QAAgB,GAAS;EACtC,KAAK,cAAc,KAAK,cAAc;EACtC,KAAK,eAAe,KAAK;CAC3B;CAEA,eAAe,QAAgB,GAAS;EACtC,KAAK,aAAa,KAAK,aAAa;EACpC,IAAI,KAAK,QACP,KAAK,OAAO,eAAe,KAAK;CAEpC;CAEA,UAAkB;EAChB,MAAM,SAAS,KAAK,OAAO,IAAI,KAAK,SAAS;EAC7C,IAAI,CAAC,KAAK,QACR,OAAO;OAEP,OAAO,KAAK,OAAO,QAAQ,IAAI;CAEnC;AACF;;AAGA,IAAa,aAAb,MAAwB;CACtB,wBAAQ,IAAI,IAAwB;CAEpC,YAAY,KAAgB;EAC1B,KAAK,SAAQ,SAAQ,KAAK,QAAQ,IAAI,CAAC;CACzC;CAEA,GAAG,MAAsC;EACvC,IAAI,QAAQ,aAAa,IAAI;EAC7B,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,IAAI,GAC5B;EAEF,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM,IAAI;EACpC,OAAO,MAAM,SAAS,IAAI;GACxB,QAAQ,aAAa,MAAM,IAAI;GAC/B,IAAI,CAAC,KAAK,SAAS,IAAI,MAAM,IAAI,GAC/B;GAEF,OAAO,KAAK,SAAS,IAAI,MAAM,IAAI;EACrC;EACA,OAAO;CACT;CAEA,UAAwB;EACtB,MAAM,SAAuB,CAAC;EAC9B,KAAK,MAAM,SAAQ,SAAQ,KAAK,UAAU,MAAM,MAAM,CAAC;EACvD,OAAO;CACT;CAEA,UAAkB,QAAoB,QAAsB;EAC1D,OAAO,KAAK,MAAM;EAClB,CAAC,GAAG,OAAO,SAAS,KAAK,CAAC,CAAC,CACxB,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAClC,SAAQ,QAAO,KAAK,UAAU,OAAO,SAAS,IAAI,GAAG,GAAI,MAAM,CAAC;CACrE;CAEA,QAAQ,MAAc,aAAqB,GAAe;EACxD,IAAI,QAAQ,aAAa,IAAI;EAC7B,IAAI,CAAC,MAAM,MACT,MAAM,MAAM,gBAAgB,MAAM;EAEpC,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI,MAAM,IAAI,IAAK,KAAK,QAAQ,MAAM,IAAI;EAC7F,OAAO,MAAM,SAAS,IAAI;GACxB,QAAQ,aAAa,MAAM,IAAI;GAC/B,IAAI,KAAK,SAAS,IAAI,MAAM,IAAI,GAC9B,OAAO,KAAK,SAAS,IAAI,MAAM,IAAI;QAEnC,OAAO,KAAK,QAAQ,MAAM,MAAM,IAAI;EAExC;EACA,KAAK,eAAe,UAAU;EAC9B,OAAO;CACT;CAEA,QAAgB,MAAc,QAAiC;EAC7D,IAAI,CAAC,QAAQ;GACX,MAAM,UAAU,IAAI,WAAW,IAAI;GACnC,KAAK,MAAM,IAAI,MAAM,OAAO;GAC5B,OAAO;EACT,OACE,OAAO,OAAO,SAAS,IAAI;CAE/B;AACF;AAGA,SAAS,aAAa,MAAc;CAClC,IAAI,MAAM,GAAG,CAAC,MAAM,KAClB,OAAO;EACL,MAAM;EACN,MAAM;CACR;CAEF,MAAM,QAAQ,KAAK,QAAQ,KAAK,CAAC;CACjC,IAAI,UAAU,IACZ,OAAO;EACL,MAAM,KAAK,UAAU,CAAC;EACtB,MAAM;CACR;MAEA,OAAO;EACL,MAAM,KAAK,UAAU,GAAG,KAAK;EAC7B,MAAM,KAAK,UAAU,KAAK;CAC5B;AAEJ"}

package/dist/library/index.d.ts

@@ -1,17 +1,8 @@
-export { FolderNode, FolderTree } from './folder-tree.js';
-export { AccessPolicy, CurrentVersion, LibraryItem, LibraryItemReference, LibraryItemType, LocationHead, VersionInfo } from './library.js';
-export { Block, CstSubstituteInfo, NodeType, Operation, OperationInput, OperationSchema, OperationSchemaStats, OperationSynthesis, OperationType, OssItem, SubstitutionErrorDescription, SubstitutionErrorType } from './oss.js';
-export { OssLayout, Position2D } from './oss-layout.js';
-export { RSEngine } from './rsengine.js';
-export { ArgumentValue, Attribution, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats, Substitution, TypeInfo } from './rsform.js';
-export { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats } from './rsmodel.js';
-import '../graph/graph.js';
-import '../parsing/ast.js';
-import '@lezer/common';
-import '../rslang/eval/calculator.js';
-import '../rslang/error.js';
-import '../rslang/semantic/typification.js';
-import '../shared/branded.js';
-import '../rslang/eval/value.js';
-import '../rslang/semantic/analyzer.js';
-import '../rslang/semantic/value-class.js';
+import { FolderNode, FolderTree } from "./folder-tree.js";
+import { a as LibraryItemType, i as LibraryItemReference, n as CurrentVersion, o as LocationHead, r as LibraryItem, s as VersionInfo, t as AccessPolicy } from "../library-CYun28Xz.js";
+import { n as OssLayout, r as Position2D } from "../oss-layout-3glgAqfn.js";
+import { Block, CstSubstituteInfo, NodeType, Operation, OperationInput, OperationSchema, OperationSchemaStats, OperationSynthesis, OperationType, OssItem, SubstitutionErrorDescription, SubstitutionErrorType } from "./oss.js";
+import { ArgumentValue, Attribution, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats, Substitution, TypeInfo } from "./rsform.js";
+import { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats } from "./rsmodel.js";
+import { RSEngine } from "./rsengine.js";
+export { AccessPolicy, type ArgumentValue, type Attribution, type BasicBinding, type BasicsContext, type Block, type Constituenta, CstClass, CstStatus, type CstSubstituteInfo, CstType, type CurrentVersion, DEFAULT_VALUE_TEXT, EvalStatus, FolderNode, FolderTree, type LibraryItem, type LibraryItemReference, LibraryItemType, LocationHead, NodeType, type Operation, type OperationInput, type OperationSchema, type OperationSchemaStats, type OperationSynthesis, OperationType, type OssItem, type OssLayout, type Position2D, RSEngine, type RSForm, type RSFormStats, type RSModel, type RSModelStats, type Substitution, type SubstitutionErrorDescription, SubstitutionErrorType, type TypeInfo, type VersionInfo };