@rsconcept/domain 1.0.0 → 1.2.0

package/dist/parsing/index.js

@@ -1,141 +1,3 @@
-// src/parsing/ast.ts
-var TOKEN_ERROR = 0;
-function buildTree(cursor) {
-  let nextUid = 1;
-  function genUid() {
-    return nextUid++;
-  }
-  return buildTreeInternal(cursor, null, genUid);
-}
-function flattenAst(node, parent = null, out = []) {
-  out.push({
-    uid: node.uid,
-    parent,
-    typeID: node.typeID,
-    from: node.from,
-    to: node.to,
-    data: node.data,
-    annotation: node.annotation
-  });
-  for (const child of node.children) {
-    flattenAst(child, node.uid, out);
-  }
-  return out;
-}
-function visitAstDFS(node, callback) {
-  for (const child of node.children) {
-    visitAstDFS(child, callback);
-  }
-  callback(node);
-}
-function findByUid(root, uid) {
-  let found = null;
-  visitAstDFS(root, (node) => {
-    if (node.uid === uid && !found) {
-      found = node;
-    }
-  });
-  return found;
-}
-function printAst(node, printNode) {
-  let children = "";
-  for (const child of node.children) {
-    children += `${printAst(child, printNode)}`;
-  }
-  return `[${printNode(node)}${children}]`;
-}
-function getNodeText(node) {
-  if (node.data.dataType === "string" && typeof node.data.value === "string") {
-    return node.data.value;
-  }
-  return `NO DATA NODE: ${node.typeID}`;
-}
-function getNodeIndices(node) {
-  if (node.data.dataType === "string[]" && Array.isArray(node.data.value)) {
-    return node.data.value.map((s) => parseInt(s, 10)).filter((n) => !isNaN(n));
-  }
-  return [];
-}
-function buildTreeInternal(cursor, parent = null, genUid) {
-  const node = cursor.node;
-  const result = {
-    uid: genUid(),
-    typeID: node.type.isError ? 0 : node.type.id,
-    from: node.from,
-    to: node.to,
-    hasError: node.type.isError,
-    data: node.type.isError ? { dataType: "null", value: null } : { dataType: "string", value: node.type.name },
-    parent,
-    children: []
-  };
-  if (cursor.firstChild()) {
-    do {
-      const child = buildTreeInternal(cursor, result, genUid);
-      if (child.hasError) {
-        result.hasError = true;
-      }
-      result.children.push(child);
-    } while (cursor.nextSibling());
-    cursor.parent();
-  }
-  return result;
-}
-
-// src/parsing/lezer-tree.ts
-function printTree(tree) {
-  const state = {
-    output: "",
-    prefixes: []
-  };
-  traverseTree(tree, {
-    onEnter: (node) => {
-      state.output += "[";
-      state.output += node.type.name;
-    },
-    onLeave: () => {
-      state.output += "]";
-    }
-  });
-  return state.output;
-}
-function cursorNode({ type, from, to }, isLeaf = false) {
-  return { type, from, to, isLeaf };
-}
-function traverseTree(tree, { beforeEnter, onEnter, onLeave }) {
-  const cursor = tree.cursor();
-  for (; ; ) {
-    let node = cursorNode(cursor);
-    let leave = false;
-    const enter = !node.type.isAnonymous;
-    if (enter && beforeEnter) beforeEnter(cursor);
-    node.isLeaf = !cursor.firstChild();
-    if (enter) {
-      leave = true;
-      if (onEnter(node) === false) return;
-    }
-    if (!node.isLeaf) continue;
-    for (; ; ) {
-      node = cursorNode(cursor, node.isLeaf);
-      if (leave && onLeave) {
-        if (onLeave(node) === false) return;
-      }
-      leave = cursor.type.isAnonymous;
-      node.isLeaf = false;
-      if (cursor.nextSibling()) break;
-      if (!cursor.parent()) return;
-      leave = true;
-    }
-  }
-}
-export {
-  TOKEN_ERROR,
-  buildTree,
-  findByUid,
-  flattenAst,
-  getNodeIndices,
-  getNodeText,
-  printAst,
-  printTree,
-  visitAstDFS
-};
-//# sourceMappingURL=index.js.map
+import { TOKEN_ERROR, buildTree, findByUid, flattenAst, getNodeIndices, getNodeText, printAst, visitAstDFS } from "./ast.js";
+import { printTree } from "./lezer-tree.js";
+export { TOKEN_ERROR, buildTree, findByUid, flattenAst, getNodeIndices, getNodeText, printAst, printTree, visitAstDFS };

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

@@ -1,13 +1,2 @@
-import { NodeType, Tree } from '@lezer/common';
-export { TreeCursor } from '@lezer/common';
-
-/** Represents syntax tree node data. */
-interface CMSyntaxNode {
-    type: NodeType;
-    from: number;
-    to: number;
-}
-/** Prints tree to compact string. */
-declare function printTree(tree: Tree): string;
-
-export { type CMSyntaxNode, printTree };
+import { n as TreeCursor, r as printTree, t as CMSyntaxNode } from "../lezer-tree-iS7LpLBJ.js";
+export { CMSyntaxNode, type TreeCursor, printTree };

package/dist/parsing/lezer-tree.js

@@ -1,50 +1,57 @@
-// src/parsing/lezer-tree.ts
+//#region src/parsing/lezer-tree.ts
+/** Prints tree to compact string. */
 function printTree(tree) {
-  const state = {
-    output: "",
-    prefixes: []
-  };
-  traverseTree(tree, {
-    onEnter: (node) => {
-      state.output += "[";
-      state.output += node.type.name;
-    },
-    onLeave: () => {
-      state.output += "]";
-    }
-  });
-  return state.output;
+	const state = {
+		output: "",
+		prefixes: []
+	};
+	traverseTree(tree, {
+		onEnter: (node) => {
+			state.output += "[";
+			state.output += node.type.name;
+		},
+		onLeave: () => {
+			state.output += "]";
+		}
+	});
+	return state.output;
 }
 function cursorNode({ type, from, to }, isLeaf = false) {
-  return { type, from, to, isLeaf };
+	return {
+		type,
+		from,
+		to,
+		isLeaf
+	};
 }
+/** Implements depth-first traversal. */
 function traverseTree(tree, { beforeEnter, onEnter, onLeave }) {
-  const cursor = tree.cursor();
-  for (; ; ) {
-    let node = cursorNode(cursor);
-    let leave = false;
-    const enter = !node.type.isAnonymous;
-    if (enter && beforeEnter) beforeEnter(cursor);
-    node.isLeaf = !cursor.firstChild();
-    if (enter) {
-      leave = true;
-      if (onEnter(node) === false) return;
-    }
-    if (!node.isLeaf) continue;
-    for (; ; ) {
-      node = cursorNode(cursor, node.isLeaf);
-      if (leave && onLeave) {
-        if (onLeave(node) === false) return;
-      }
-      leave = cursor.type.isAnonymous;
-      node.isLeaf = false;
-      if (cursor.nextSibling()) break;
-      if (!cursor.parent()) return;
-      leave = true;
-    }
-  }
+	const cursor = tree.cursor();
+	for (;;) {
+		let node = cursorNode(cursor);
+		let leave = false;
+		const enter = !node.type.isAnonymous;
+		if (enter && beforeEnter) beforeEnter(cursor);
+		node.isLeaf = !cursor.firstChild();
+		if (enter) {
+			leave = true;
+			if (onEnter(node) === false) return;
+		}
+		if (!node.isLeaf) continue;
+		for (;;) {
+			node = cursorNode(cursor, node.isLeaf);
+			if (leave && onLeave) {
+				if (onLeave(node) === false) return;
+			}
+			leave = cursor.type.isAnonymous;
+			node.isLeaf = false;
+			if (cursor.nextSibling()) break;
+			if (!cursor.parent()) return;
+			leave = true;
+		}
+	}
 }
-export {
-  printTree
-};
+//#endregion
+export { printTree };
+
 //# sourceMappingURL=lezer-tree.js.map

package/dist/parsing/lezer-tree.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/parsing/lezer-tree.ts"],"sourcesContent":["import { type NodeType, type Tree, type TreeCursor } from '@lezer/common';\nexport { type TreeCursor } from '@lezer/common';\n\n/** Represents syntax tree node data. */\nexport interface CMSyntaxNode {\n  type: NodeType;\n  from: number;\n  to: number;\n}\n\n/** Prints tree to compact string. */\nexport function printTree(tree: Tree): string {\n  const state = {\n    output: '',\n    prefixes: [] as string[]\n  };\n  traverseTree(tree, {\n    onEnter: node => {\n      state.output += '[';\n      state.output += node.type.name;\n    },\n    onLeave: () => {\n      state.output += ']';\n    }\n  });\n  return state.output;\n}\n\n// ======== Internals ========\n\ninterface CursorNode extends CMSyntaxNode {\n  isLeaf: boolean;\n}\n\nfunction cursorNode({ type, from, to }: TreeCursor, isLeaf = false): CursorNode {\n  return { type, from, to, isLeaf };\n}\n\ninterface TreeTraversalOptions {\n  beforeEnter?: (cursor: TreeCursor) => void;\n  onEnter: (node: CursorNode) => false | void;\n  onLeave?: (node: CursorNode) => false | void;\n}\n\n/** Implements depth-first traversal. */\nfunction traverseTree(tree: Tree, { beforeEnter, onEnter, onLeave }: TreeTraversalOptions) {\n  const cursor = tree.cursor();\n  for (;;) {\n    let node = cursorNode(cursor);\n    let leave = false;\n    const enter = !node.type.isAnonymous;\n    if (enter && beforeEnter) beforeEnter(cursor);\n    node.isLeaf = !cursor.firstChild();\n    if (enter) {\n      leave = true;\n      if (onEnter(node) === false) return;\n    }\n    if (!node.isLeaf) continue;\n    for (;;) {\n      node = cursorNode(cursor, node.isLeaf);\n      if (leave && onLeave) if (onLeave(node) === false) return;\n      leave = cursor.type.isAnonymous;\n      node.isLeaf = false;\n      if (cursor.nextSibling()) break;\n      if (!cursor.parent()) return;\n      leave = true;\n    }\n  }\n}\n"],"mappings":";AAWO,SAAS,UAAU,MAAoB;AAC5C,QAAM,QAAQ;AAAA,IACZ,QAAQ;AAAA,IACR,UAAU,CAAC;AAAA,EACb;AACA,eAAa,MAAM;AAAA,IACjB,SAAS,UAAQ;AACf,YAAM,UAAU;AAChB,YAAM,UAAU,KAAK,KAAK;AAAA,IAC5B;AAAA,IACA,SAAS,MAAM;AACb,YAAM,UAAU;AAAA,IAClB;AAAA,EACF,CAAC;AACD,SAAO,MAAM;AACf;AAQA,SAAS,WAAW,EAAE,MAAM,MAAM,GAAG,GAAe,SAAS,OAAmB;AAC9E,SAAO,EAAE,MAAM,MAAM,IAAI,OAAO;AAClC;AASA,SAAS,aAAa,MAAY,EAAE,aAAa,SAAS,QAAQ,GAAyB;AACzF,QAAM,SAAS,KAAK,OAAO;AAC3B,aAAS;AACP,QAAI,OAAO,WAAW,MAAM;AAC5B,QAAI,QAAQ;AACZ,UAAM,QAAQ,CAAC,KAAK,KAAK;AACzB,QAAI,SAAS,YAAa,aAAY,MAAM;AAC5C,SAAK,SAAS,CAAC,OAAO,WAAW;AACjC,QAAI,OAAO;AACT,cAAQ;AACR,UAAI,QAAQ,IAAI,MAAM,MAAO;AAAA,IAC/B;AACA,QAAI,CAAC,KAAK,OAAQ;AAClB,eAAS;AACP,aAAO,WAAW,QAAQ,KAAK,MAAM;AACrC,UAAI,SAAS;AAAS,YAAI,QAAQ,IAAI,MAAM,MAAO;AAAA;AACnD,cAAQ,OAAO,KAAK;AACpB,WAAK,SAAS;AACd,UAAI,OAAO,YAAY,EAAG;AAC1B,UAAI,CAAC,OAAO,OAAO,EAAG;AACtB,cAAQ;AAAA,IACV;AAAA,EACF;AACF;","names":[]}
+{"version":3,"file":"lezer-tree.js","names":[],"sources":["../../src/parsing/lezer-tree.ts"],"sourcesContent":["import { type NodeType, type Tree, type TreeCursor } from '@lezer/common';\nexport { type TreeCursor } from '@lezer/common';\n\n/** Represents syntax tree node data. */\nexport interface CMSyntaxNode {\n  type: NodeType;\n  from: number;\n  to: number;\n}\n\n/** Prints tree to compact string. */\nexport function printTree(tree: Tree): string {\n  const state = {\n    output: '',\n    prefixes: [] as string[]\n  };\n  traverseTree(tree, {\n    onEnter: node => {\n      state.output += '[';\n      state.output += node.type.name;\n    },\n    onLeave: () => {\n      state.output += ']';\n    }\n  });\n  return state.output;\n}\n\n// ======== Internals ========\n\ninterface CursorNode extends CMSyntaxNode {\n  isLeaf: boolean;\n}\n\nfunction cursorNode({ type, from, to }: TreeCursor, isLeaf = false): CursorNode {\n  return { type, from, to, isLeaf };\n}\n\ninterface TreeTraversalOptions {\n  beforeEnter?: (cursor: TreeCursor) => void;\n  onEnter: (node: CursorNode) => false | void;\n  onLeave?: (node: CursorNode) => false | void;\n}\n\n/** Implements depth-first traversal. */\nfunction traverseTree(tree: Tree, { beforeEnter, onEnter, onLeave }: TreeTraversalOptions) {\n  const cursor = tree.cursor();\n  for (;;) {\n    let node = cursorNode(cursor);\n    let leave = false;\n    const enter = !node.type.isAnonymous;\n    if (enter && beforeEnter) beforeEnter(cursor);\n    node.isLeaf = !cursor.firstChild();\n    if (enter) {\n      leave = true;\n      if (onEnter(node) === false) return;\n    }\n    if (!node.isLeaf) continue;\n    for (;;) {\n      node = cursorNode(cursor, node.isLeaf);\n      if (leave && onLeave) if (onLeave(node) === false) return;\n      leave = cursor.type.isAnonymous;\n      node.isLeaf = false;\n      if (cursor.nextSibling()) break;\n      if (!cursor.parent()) return;\n      leave = true;\n    }\n  }\n}\n"],"mappings":";;AAWA,SAAgB,UAAU,MAAoB;CAC5C,MAAM,QAAQ;EACZ,QAAQ;EACR,UAAU,CAAC;CACb;CACA,aAAa,MAAM;EACjB,UAAS,SAAQ;GACf,MAAM,UAAU;GAChB,MAAM,UAAU,KAAK,KAAK;EAC5B;EACA,eAAe;GACb,MAAM,UAAU;EAClB;CACF,CAAC;CACD,OAAO,MAAM;AACf;AAQA,SAAS,WAAW,EAAE,MAAM,MAAM,MAAkB,SAAS,OAAmB;CAC9E,OAAO;EAAE;EAAM;EAAM;EAAI;CAAO;AAClC;;AASA,SAAS,aAAa,MAAY,EAAE,aAAa,SAAS,WAAiC;CACzF,MAAM,SAAS,KAAK,OAAO;CAC3B,SAAS;EACP,IAAI,OAAO,WAAW,MAAM;EAC5B,IAAI,QAAQ;EACZ,MAAM,QAAQ,CAAC,KAAK,KAAK;EACzB,IAAI,SAAS,aAAa,YAAY,MAAM;EAC5C,KAAK,SAAS,CAAC,OAAO,WAAW;EACjC,IAAI,OAAO;GACT,QAAQ;GACR,IAAI,QAAQ,IAAI,MAAM,OAAO;EAC/B;EACA,IAAI,CAAC,KAAK,QAAQ;EAClB,SAAS;GACP,OAAO,WAAW,QAAQ,KAAK,MAAM;GACrC,IAAI,SAAS;QAAa,QAAQ,IAAI,MAAM,OAAO;GAAA;GACnD,QAAQ,OAAO,KAAK;GACpB,KAAK,SAAS;GACd,IAAI,OAAO,YAAY,GAAG;GAC1B,IAAI,CAAC,OAAO,OAAO,GAAG;GACtB,QAAQ;EACV;CACF;AACF"}

package/dist/rslang/api.d.ts

@@ -1,14 +1,8 @@
-import { AstNode } from '../parsing/ast.js';
-import { ArgumentsType } from './semantic/arguments-extractor.js';
-export { generateExpressionFromAst } from './parser/expression-generator.js';
-import '@lezer/common';
-import './semantic/typification.js';
-import '../shared/branded.js';
-
-/**
- * Module: API for RSLanguage.
- */
+import { t as AstNode } from "../ast-C8sIpKdL.js";
+import { n as ArgumentsType } from "../arguments-extractor-1acwjQNc.js";
+import { generateExpressionFromAst } from "./parser/expression-generator.js";
 
+//#region src/rslang/api.d.ts
 /** Represents alias mapping. */
 type AliasMapping = Record<string, string>;
 /** Extract arguments from AST. */
@@ -34,8 +28,8 @@ declare function isSetTypification(text: string): boolean;
  * // result: `{ head: 'header', body: 'body content' }`
  */
 declare function splitTemplateDefinition(target: string): {
-    head: string;
-    body: string;
+  head: string;
+  body: string;
 };
 /**
  * Substitutes values for template arguments in a given expression.
@@ -49,5 +43,6 @@ declare function substituteTemplateArgs(expression: string, mapping: AliasMappin
 declare function applyAliasMapping(target: string, mapping: AliasMapping): string;
 /** Apply alias typification mapping. */
 declare function applyTypificationMapping(target: string, mapping: AliasMapping): string;
-
-export { type AliasMapping, applyAliasMapping, applyTypificationMapping, extractArguments, extractGlobals, isSetTypification, isSimpleExpression, splitTemplateDefinition, substituteTemplateArgs };
+//#endregion
+export { AliasMapping, applyAliasMapping, applyTypificationMapping, extractArguments, extractGlobals, generateExpressionFromAst, isSetTypification, isSimpleExpression, splitTemplateDefinition, substituteTemplateArgs };
+//# sourceMappingURL=api.d.ts.map