@loopstack/loopstack-studio 0.27.0 → 0.29.0

package/dist/node_modules/langium/lib/utils/caching.js

@@ -1,91 +0,0 @@
-var DisposableCache = class {
-	constructor() {
-		this.toDispose = [], this.isDisposed = !1;
-	}
-	onDispose(e) {
-		this.toDispose.push(e);
-	}
-	dispose() {
-		this.throwIfDisposed(), this.clear(), this.isDisposed = !0, this.toDispose.forEach((e) => e.dispose());
-	}
-	throwIfDisposed() {
-		if (this.isDisposed) throw Error("This cache has already been disposed");
-	}
-}, SimpleCache = class extends DisposableCache {
-	constructor() {
-		super(...arguments), this.cache = /* @__PURE__ */ new Map();
-	}
-	has(e) {
-		return this.throwIfDisposed(), this.cache.has(e);
-	}
-	set(e, n) {
-		this.throwIfDisposed(), this.cache.set(e, n);
-	}
-	get(e, n) {
-		if (this.throwIfDisposed(), this.cache.has(e)) return this.cache.get(e);
-		if (n) {
-			let r = n();
-			return this.cache.set(e, r), r;
-		} else return;
-	}
-	delete(e) {
-		return this.throwIfDisposed(), this.cache.delete(e);
-	}
-	clear() {
-		this.throwIfDisposed(), this.cache.clear();
-	}
-}, ContextCache = class extends DisposableCache {
-	constructor(e) {
-		super(), this.cache = /* @__PURE__ */ new Map(), this.converter = e ?? ((e) => e);
-	}
-	has(e, n) {
-		return this.throwIfDisposed(), this.cacheForContext(e).has(n);
-	}
-	set(e, n, r) {
-		this.throwIfDisposed(), this.cacheForContext(e).set(n, r);
-	}
-	get(e, n, r) {
-		this.throwIfDisposed();
-		let i = this.cacheForContext(e);
-		if (i.has(n)) return i.get(n);
-		if (r) {
-			let e = r();
-			return i.set(n, e), e;
-		} else return;
-	}
-	delete(e, n) {
-		return this.throwIfDisposed(), this.cacheForContext(e).delete(n);
-	}
-	clear(e) {
-		if (this.throwIfDisposed(), e) {
-			let n = this.converter(e);
-			this.cache.delete(n);
-		} else this.cache.clear();
-	}
-	cacheForContext(e) {
-		let n = this.converter(e), r = this.cache.get(n);
-		return r || (r = /* @__PURE__ */ new Map(), this.cache.set(n, r)), r;
-	}
-}, DocumentCache = class extends ContextCache {
-	constructor(e, n) {
-		super((e) => e.toString()), n ? (this.toDispose.push(e.workspace.DocumentBuilder.onDocumentPhase(n, (e) => {
-			this.clear(e.uri.toString());
-		})), this.toDispose.push(e.workspace.DocumentBuilder.onUpdate((e, n) => {
-			for (let e of n) this.clear(e);
-		}))) : this.toDispose.push(e.workspace.DocumentBuilder.onUpdate((e, n) => {
-			let r = e.concat(n);
-			for (let e of r) this.clear(e);
-		}));
-	}
-}, WorkspaceCache = class extends SimpleCache {
-	constructor(e, n) {
-		super(), n ? (this.toDispose.push(e.workspace.DocumentBuilder.onBuildPhase(n, () => {
-			this.clear();
-		})), this.toDispose.push(e.workspace.DocumentBuilder.onUpdate((e, n) => {
-			n.length > 0 && this.clear();
-		}))) : this.toDispose.push(e.workspace.DocumentBuilder.onUpdate(() => {
-			this.clear();
-		}));
-	}
-};
-export { ContextCache, DisposableCache, DocumentCache, SimpleCache, WorkspaceCache };

package/dist/node_modules/langium/lib/utils/cancellation.js

@@ -1,5 +0,0 @@
-import { __reExport, __toESM } from "../../../../_virtual/rolldown_runtime.js";
-import { require_cancellation } from "../../../vscode-jsonrpc/lib/common/cancellation.js";
-var cancellation_exports = {};
-__reExport(cancellation_exports, /* @__PURE__ */ __toESM(require_cancellation(), 1), void 0, 1);
-export { cancellation_exports };

package/dist/node_modules/langium/lib/utils/collections.js

@@ -1,85 +0,0 @@
-import { EMPTY_STREAM, Reduction, stream } from "./stream.js";
-var MultiMap = class {
-	constructor(e) {
-		if (this.map = /* @__PURE__ */ new Map(), e) for (let [n, r] of e) this.add(n, r);
-	}
-	get size() {
-		return Reduction.sum(stream(this.map.values()).map((e) => e.length));
-	}
-	clear() {
-		this.map.clear();
-	}
-	delete(e, n) {
-		if (n === void 0) return this.map.delete(e);
-		{
-			let r = this.map.get(e);
-			if (r) {
-				let i = r.indexOf(n);
-				if (i >= 0) return r.length === 1 ? this.map.delete(e) : r.splice(i, 1), !0;
-			}
-			return !1;
-		}
-	}
-	get(e) {
-		return this.map.get(e) ?? [];
-	}
-	getStream(n) {
-		let i = this.map.get(n);
-		return i ? stream(i) : EMPTY_STREAM;
-	}
-	has(e, n) {
-		if (n === void 0) return this.map.has(e);
-		{
-			let r = this.map.get(e);
-			return r ? r.indexOf(n) >= 0 : !1;
-		}
-	}
-	add(e, n) {
-		return this.map.has(e) ? this.map.get(e).push(n) : this.map.set(e, [n]), this;
-	}
-	addAll(e, n) {
-		return this.map.has(e) ? this.map.get(e).push(...n) : this.map.set(e, Array.from(n)), this;
-	}
-	forEach(e) {
-		this.map.forEach((n, r) => n.forEach((n) => e(n, r, this)));
-	}
-	[Symbol.iterator]() {
-		return this.entries().iterator();
-	}
-	entries() {
-		return stream(this.map.entries()).flatMap(([e, n]) => n.map((n) => [e, n]));
-	}
-	keys() {
-		return stream(this.map.keys());
-	}
-	values() {
-		return stream(this.map.values()).flat();
-	}
-	entriesGroupedByKey() {
-		return stream(this.map.entries());
-	}
-}, BiMap = class {
-	get size() {
-		return this.map.size;
-	}
-	constructor(e) {
-		if (this.map = /* @__PURE__ */ new Map(), this.inverse = /* @__PURE__ */ new Map(), e) for (let [n, r] of e) this.set(n, r);
-	}
-	clear() {
-		this.map.clear(), this.inverse.clear();
-	}
-	set(e, n) {
-		return this.map.set(e, n), this.inverse.set(n, e), this;
-	}
-	get(e) {
-		return this.map.get(e);
-	}
-	getKey(e) {
-		return this.inverse.get(e);
-	}
-	delete(e) {
-		let n = this.map.get(e);
-		return n === void 0 ? !1 : (this.map.delete(e), this.inverse.delete(n), !0);
-	}
-};
-export { BiMap, MultiMap };

package/dist/node_modules/langium/lib/utils/cst-utils.js

@@ -1,190 +0,0 @@
-import { __export } from "../../../../_virtual/rolldown_runtime.js";
-import { isCompositeCstNode, isLeafCstNode, isRootCstNode } from "../syntax-tree.js";
-import { TreeStreamImpl } from "./stream.js";
-import { getContainerOfType } from "./ast-utils.js";
-import { isParserRule } from "../languages/generated/ast.js";
-var cst_utils_exports = /* @__PURE__ */ __export({
-	DefaultNameRegexp: () => DefaultNameRegexp,
-	RangeComparison: () => RangeComparison,
-	compareRange: () => compareRange,
-	findCommentNode: () => findCommentNode,
-	findDeclarationNodeAtOffset: () => findDeclarationNodeAtOffset,
-	findLeafNodeAtOffset: () => findLeafNodeAtOffset,
-	findLeafNodeBeforeOffset: () => findLeafNodeBeforeOffset,
-	flattenCst: () => flattenCst,
-	getDatatypeNode: () => getDatatypeNode,
-	getInteriorNodes: () => getInteriorNodes,
-	getNextNode: () => getNextNode,
-	getPreviousNode: () => getPreviousNode,
-	getStartlineNode: () => getStartlineNode,
-	inRange: () => inRange,
-	isChildNode: () => isChildNode,
-	isCommentNode: () => isCommentNode,
-	streamCst: () => streamCst,
-	toDocumentSegment: () => toDocumentSegment,
-	tokenToRange: () => tokenToRange
-}, 1);
-function getDatatypeNode(e) {
-	let C = e, w = !1;
-	for (; C;) {
-		let e = getContainerOfType(C.grammarSource, isParserRule);
-		if (e && e.dataType) C = C.container, w = !0;
-		else if (w) return C;
-		else return;
-	}
-}
-function streamCst(e) {
-	return new TreeStreamImpl(e, (e) => isCompositeCstNode(e) ? e.content : [], { includeRoot: !0 });
-}
-function flattenCst(e) {
-	return streamCst(e).filter(isLeafCstNode);
-}
-function isChildNode(e, C) {
-	for (; e.container;) if (e = e.container, e === C) return !0;
-	return !1;
-}
-function tokenToRange(e) {
-	return {
-		start: {
-			character: e.startColumn - 1,
-			line: e.startLine - 1
-		},
-		end: {
-			character: e.endColumn,
-			line: e.endLine - 1
-		}
-	};
-}
-function toDocumentSegment(e) {
-	if (!e) return;
-	let { offset: C, end: w, range: T } = e;
-	return {
-		range: T,
-		offset: C,
-		end: w,
-		length: w - C
-	};
-}
-var RangeComparison;
-(function(e) {
-	e[e.Before = 0] = "Before", e[e.After = 1] = "After", e[e.OverlapFront = 2] = "OverlapFront", e[e.OverlapBack = 3] = "OverlapBack", e[e.Inside = 4] = "Inside", e[e.Outside = 5] = "Outside";
-})(RangeComparison ||= {});
-function compareRange(e, C) {
-	if (e.end.line < C.start.line || e.end.line === C.start.line && e.end.character <= C.start.character) return RangeComparison.Before;
-	if (e.start.line > C.end.line || e.start.line === C.end.line && e.start.character >= C.end.character) return RangeComparison.After;
-	let w = e.start.line > C.start.line || e.start.line === C.start.line && e.start.character >= C.start.character, T = e.end.line < C.end.line || e.end.line === C.end.line && e.end.character <= C.end.character;
-	return w && T ? RangeComparison.Inside : w ? RangeComparison.OverlapBack : T ? RangeComparison.OverlapFront : RangeComparison.Outside;
-}
-function inRange(e, C) {
-	return compareRange(e, C) > RangeComparison.After;
-}
-const DefaultNameRegexp = /^[\w\p{L}]$/u;
-function findDeclarationNodeAtOffset(e, C, w = DefaultNameRegexp) {
-	if (e) {
-		if (C > 0) {
-			let T = C - e.offset, E = e.text.charAt(T);
-			w.test(E) || C--;
-		}
-		return findLeafNodeAtOffset(e, C);
-	}
-}
-function findCommentNode(e, C) {
-	if (e) {
-		let w = getPreviousNode(e, !0);
-		if (w && isCommentNode(w, C)) return w;
-		if (isRootCstNode(e)) {
-			let w = e.content.findIndex((e) => !e.hidden);
-			for (let T = w - 1; T >= 0; T--) {
-				let w = e.content[T];
-				if (isCommentNode(w, C)) return w;
-			}
-		}
-	}
-}
-function isCommentNode(e, C) {
-	return isLeafCstNode(e) && C.includes(e.tokenType.name);
-}
-function findLeafNodeAtOffset(e, T) {
-	if (isLeafCstNode(e)) return e;
-	if (isCompositeCstNode(e)) {
-		let C = binarySearch(e, T, !1);
-		if (C) return findLeafNodeAtOffset(C, T);
-	}
-}
-function findLeafNodeBeforeOffset(e, T) {
-	if (isLeafCstNode(e)) return e;
-	if (isCompositeCstNode(e)) {
-		let C = binarySearch(e, T, !0);
-		if (C) return findLeafNodeBeforeOffset(C, T);
-	}
-}
-function binarySearch(e, C, w) {
-	let T = 0, E = e.content.length - 1, D;
-	for (; T <= E;) {
-		let O = Math.floor((T + E) / 2), k = e.content[O];
-		if (k.offset <= C && k.end > C) return k;
-		k.end <= C ? (D = w ? k : void 0, T = O + 1) : E = O - 1;
-	}
-	return D;
-}
-function getPreviousNode(e, C = !0) {
-	for (; e.container;) {
-		let w = e.container, T = w.content.indexOf(e);
-		for (; T > 0;) {
-			T--;
-			let e = w.content[T];
-			if (C || !e.hidden) return e;
-		}
-		e = w;
-	}
-}
-function getNextNode(e, C = !0) {
-	for (; e.container;) {
-		let w = e.container, T = w.content.indexOf(e), E = w.content.length - 1;
-		for (; T < E;) {
-			T++;
-			let e = w.content[T];
-			if (C || !e.hidden) return e;
-		}
-		e = w;
-	}
-}
-function getStartlineNode(e) {
-	if (e.range.start.character === 0) return e;
-	let C = e.range.start.line, w = e, T;
-	for (; e.container;) {
-		let E = e.container, D = T ?? E.content.indexOf(e);
-		if (D === 0 ? (e = E, T = void 0) : (T = D - 1, e = E.content[T]), e.range.start.line !== C) break;
-		w = e;
-	}
-	return w;
-}
-function getInteriorNodes(e, C) {
-	let w = getCommonParent(e, C);
-	return w ? w.parent.content.slice(w.a + 1, w.b) : [];
-}
-function getCommonParent(e, C) {
-	let w = getParentChain(e), T = getParentChain(C), E;
-	for (let e = 0; e < w.length && e < T.length; e++) {
-		let C = w[e], D = T[e];
-		if (C.parent === D.parent) E = {
-			parent: C.parent,
-			a: C.index,
-			b: D.index
-		};
-		else break;
-	}
-	return E;
-}
-function getParentChain(e) {
-	let C = [];
-	for (; e.container;) {
-		let w = e.container, T = w.content.indexOf(e);
-		C.push({
-			parent: w,
-			index: T
-		}), e = w;
-	}
-	return C.reverse();
-}
-export { DefaultNameRegexp, cst_utils_exports, findCommentNode, inRange, isChildNode, streamCst, toDocumentSegment, tokenToRange };

package/dist/node_modules/langium/lib/utils/disposable.js

@@ -1,8 +0,0 @@
-var Disposable;
-(function(e) {
-	function t(e) {
-		return { dispose: async () => await e() };
-	}
-	e.create = t;
-})(Disposable ||= {});
-export { Disposable };

package/dist/node_modules/langium/lib/utils/errors.js

@@ -1,12 +0,0 @@
-var ErrorWithLocation = class extends Error {
-	constructor(e, n) {
-		super(e ? `${n} at ${e.range.start.line}:${e.range.start.character}` : n);
-	}
-};
-function assertUnreachable(e, n = "Error: Got unexpected value.") {
-	throw Error(n);
-}
-function assertCondition(e, n = "Error: Condition is violated.") {
-	if (!e) throw Error(n);
-}
-export { ErrorWithLocation, assertCondition, assertUnreachable };

package/dist/node_modules/langium/lib/utils/event.js

@@ -1,5 +0,0 @@
-import { __reExport, __toESM } from "../../../../_virtual/rolldown_runtime.js";
-import { require_events } from "../../../vscode-jsonrpc/lib/common/events.js";
-var event_exports = {};
-__reExport(event_exports, /* @__PURE__ */ __toESM(require_events(), 1), void 0, 1);
-export { event_exports };

package/dist/node_modules/langium/lib/utils/grammar-loader.js

@@ -1,22 +0,0 @@
-import { LangiumGrammarAstReflection } from "../languages/generated/ast.js";
-import { URI } from "../../../vscode-uri/lib/esm/index.js";
-import { createDefaultCoreModule, createDefaultSharedCoreModule } from "../default-module.js";
-import { inject } from "../dependency-injection.js";
-import { EmptyFileSystem } from "../workspace/file-system-provider.js";
-var minimalGrammarModule = {
-	Grammar: () => void 0,
-	LanguageMetaData: () => ({
-		caseInsensitive: !1,
-		fileExtensions: [".langium"],
-		languageId: "langium"
-	})
-}, minimalSharedGrammarModule = { AstReflection: () => new LangiumGrammarAstReflection() };
-function createMinimalGrammarServices() {
-	let e = inject(createDefaultSharedCoreModule(EmptyFileSystem), minimalSharedGrammarModule), s = inject(createDefaultCoreModule({ shared: e }), minimalGrammarModule);
-	return e.ServiceRegistry.register(s), s;
-}
-function loadGrammarFromJson(e) {
-	let c = createMinimalGrammarServices(), l = c.serializer.JsonSerializer.deserialize(e);
-	return c.shared.workspace.LangiumDocumentFactory.fromModel(l, URI.parse(`memory:/${l.name ?? "grammar"}.langium`)), l;
-}
-export { loadGrammarFromJson };