@oomol-lab/open-flow 0.1.0-alpha.10 → 0.1.0-alpha.13

package/dist/common/licenses.md

@@ -1,27 +1,3 @@
 # Licenses
 
-The app bundles dependencies which contain the following licenses:
-
-## dequal - 2.0.3 (MIT)
-
-The MIT License (MIT)
-
-Copyright (c) Luke Edwards <luke.edwards05@gmail.com> (lukeed.com)
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
+The app does not bundle any dependencies with licenses.

package/dist/common/localization.d.ts

@@ -0,0 +1,21 @@
+export declare const uiLanguages: readonly ['en', 'zh-CN', 'zh-TW', 'ja', 'ko', 'ru', 'fr'];
+export type UiLanguage = (typeof uiLanguages)[number];
+export declare const defaultUiLanguage: UiLanguage;
+/** Endonyms, shown in language pickers regardless of the current UI language. */
+export declare const uiLanguageNames: Readonly<Record<UiLanguage, string>>;
+export declare function isUiLanguage(value: unknown): value is UiLanguage;
+/**
+ * BCP 47 aware resolution over candidates such as `navigator.languages`: an exact tag match
+ * (case-insensitive) wins; for zh an explicit script subtag beats the region (zh-Hant-* to zh-TW,
+ * zh-Hans-* to zh-CN), then zh-TW, zh-HK and zh-MO map to zh-TW and any other zh* to zh-CN; en, ja,
+ * ko, ru and fr also match on their primary subtag (fr-CA to fr, ja-JP to ja).
+ */
+export declare function resolveUiLanguage(candidates: Iterable<string | null | undefined>, fallback?: UiLanguage): UiLanguage;
+/** Languages written with CJK scripts: zh-CN, zh-TW, ja and ko. */
+export declare function isCjkLanguage(language: string): boolean;
+/**
+ * Lookup order for package-author locale files (`oo-locales/<lang>.json`), which only exist for en
+ * and zh-CN today. Traditional Chinese readers prefer Simplified Chinese over English; every other
+ * language falls back to English first. The chain never repeats a locale.
+ */
+export declare function userLocaleFallbackChain(language: string): readonly string[];

package/dist/common/localization.js

@@ -0,0 +1,62 @@
+//#region src/localization/common/languages.ts
+var e = [
+	"en",
+	"zh-CN",
+	"zh-TW",
+	"ja",
+	"ko",
+	"ru",
+	"fr"
+], t = "en", n = {
+	en: "English",
+	"zh-CN": "简体中文",
+	"zh-TW": "繁體中文",
+	ja: "日本語",
+	ko: "한국어",
+	ru: "Русский",
+	fr: "Français"
+}, r = new Map(e.map((e) => [e.toLowerCase(), e])), i = /* @__PURE__ */ new Set([
+	"hk",
+	"mo",
+	"tw"
+]), a = /* @__PURE__ */ new Set([
+	"zh-CN",
+	"zh-TW",
+	"ja",
+	"ko"
+]);
+function o(e) {
+	return typeof e == "string" && r.get(e.toLowerCase()) == e;
+}
+function s(e, t = "en") {
+	for (let t of e) {
+		let e = t == null ? void 0 : u(t);
+		if (e != null) return e;
+	}
+	return t;
+}
+function c(e) {
+	let t = u(e);
+	return t != null && a.has(t);
+}
+function l(e) {
+	return e == "zh-TW" ? [
+		"zh-TW",
+		"zh-CN",
+		"en"
+	] : e == "zh-CN" ? ["zh-CN", "en"] : e == "en" ? ["en", "zh-CN"] : [
+		e,
+		"en",
+		"zh-CN"
+	];
+}
+function u(e) {
+	let t = e.trim().toLowerCase();
+	if (t.length == 0) return;
+	let n = r.get(t);
+	if (n != null) return n;
+	let a = t.split("-");
+	return a[0] == "zh" ? a.includes("hant") ? "zh-TW" : a.includes("hans") ? "zh-CN" : a.some((e) => i.has(e)) ? "zh-TW" : "zh-CN" : r.get(a[0]);
+}
+//#endregion
+export { t as defaultUiLanguage, c as isCjkLanguage, o as isUiLanguage, s as resolveUiLanguage, n as uiLanguageNames, e as uiLanguages, l as userLocaleFallbackChain };

package/dist/common/scheduler.d.ts

@@ -86,6 +86,7 @@ export interface SchedulerFailure {
     readonly message: string;
 }
 export interface FlowRunOptions {
+    readonly bindingValues?: Readonly<Record<string, string>>;
     readonly createId: () => string;
     readonly emit?: (event: SchedulerEvent) => Effect.Effect<void, Error>;
     readonly flowId: string;

package/dist/common/scheduler.js

@@ -3,7 +3,7 @@ import * as t from "effect/Exit";
 import * as n from "effect/FiberSet";
 //#region src/flow/common/change.ts
 function r(e) {
-	return Object.fromEntries(e.map((e) => [e.handle, e]));
+	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
 }
 //#endregion
 //#region src/execution/common/scheduler.ts
@@ -173,21 +173,27 @@ function _(a, o, m, v, b, x = {}, S, C) {
 			runId: m,
 			type: "run.started"
 		});
-		let w = p(o.graph), T = w.length, E = new Map(Object.entries(o.graph.nodes).map(([e, t]) => [e, new s(e, t, c(a.prepared, t))])), D = /* @__PURE__ */ new Map(), O = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map();
-		for (let [e, t] of Object.entries(o.graph.nodes)) for (let [n, r] of Object.entries(t.inputs)) if (r.kind == "sources") for (let t of r.sources) if (t.kind == "flow") {
+		let w = p(o.graph), T = w.length, E = new Map(Object.entries(o.graph.nodes).map(([e, t]) => [e, new s(e, t, c(a.prepared, t))])), D = /* @__PURE__ */ new Map(), O = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ new Map();
+		for (let [e, t] of Object.entries(o.graph.nodes)) for (let [n, r] of Object.entries(t.inputs)) if (r.kind == "sources") for (let t of r.sources) if (t.kind == "binding") {
+			let r = O.get(t.bindingId) ?? [];
+			r.push({
+				handle: n,
+				nodeId: e
+			}), O.set(t.bindingId, r);
+		} else if (t.kind == "flow") {
 			let r = D.get(t.input) ?? [];
 			r.push({
 				handle: n,
 				nodeId: e
 			}), D.set(t.input, r);
-		} else t.kind == "node" && d(O, t.nodeId, t.output, {
+		} else t.kind == "node" && d(k, t.nodeId, t.output, {
 			handle: n,
 			nodeId: e
 		});
-		for (let [e, t] of Object.entries(o.outputs)) for (let n of t.sources) n.kind == "node" && d(k, n.nodeId, n.output, e);
-		let A = /* @__PURE__ */ new Map(), j = yield* n.make(), M = yield* n.runtime(j)(), N = /* @__PURE__ */ new Map(), P = /* @__PURE__ */ new Map(), F = /* @__PURE__ */ new Map(), I = /* @__PURE__ */ new Set(), L, R, z, B = (e, t) => {
-			L ?? (E.get(e.nodeId).push(e.handle, t), z(e.nodeId));
-		}, V = (t, n, r, i) => e.gen(function* () {
+		for (let [e, t] of Object.entries(o.outputs)) for (let n of t.sources) n.kind == "node" && d(A, n.nodeId, n.output, e);
+		let j = /* @__PURE__ */ new Map(), M = yield* n.make(), N = yield* n.runtime(M)(), P = /* @__PURE__ */ new Map(), F = /* @__PURE__ */ new Map(), I = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Set(), R, z, B, V = (e, t) => {
+			R ?? (E.get(e.nodeId).push(e.handle, t), B(e.nodeId));
+		}, H = (t, n, r, i) => e.gen(function* () {
 			yield* a.emit({
 				handle: r,
 				jobId: n,
@@ -196,13 +202,16 @@ function _(a, o, m, v, b, x = {}, S, C) {
 				type: "node.output",
 				value: i
 			});
-			for (let e of f(O, t, r)) B(e, i);
-			for (let e of f(k, t, r)) F.set(e, i), S != null && (yield* S(e, i));
-		}), H = (t, n, i, o) => {
+			for (let e of f(k, t, r)) V(e, i);
+			for (let e of f(A, t, r)) I.set(e, i), S != null && (yield* S(e, i));
+		}), U = (t, n, i, o) => {
 			let s = e.gen(function* () {
-				let s = u(a.prepared, n), c = l(a.prepared, n);
+				let s = u(a.prepared, n), c = l(a.prepared, n), d = Object.fromEntries(Object.entries(o).filter(([e]) => {
+					let t = n.inputs[e];
+					return t?.kind != "sources" || t.sources.every((e) => e.kind != "binding");
+				}));
 				yield* a.emit({
-					inputs: o,
+					inputs: d,
 					jobId: i,
 					nodeId: t,
 					nodeKind: s,
@@ -210,7 +219,7 @@ function _(a, o, m, v, b, x = {}, S, C) {
 					runId: m,
 					type: "node.started"
 				});
-				let d;
+				let f;
 				switch (n.kind) {
 					case "condition": {
 						let e = n.cases.find((e) => {
@@ -218,16 +227,16 @@ function _(a, o, m, v, b, x = {}, S, C) {
 							let t = e.expressions.map((e) => h(n, e, o));
 							return e.relation == "all" ? t.every(Boolean) : t.some(Boolean);
 						})?.output ?? n.defaultOutput;
-						d = e == null ? {} : { [e]: o[n.input.handle] ?? null }, e != null && (yield* V(t, i, e, d[e]));
+						f = e == null ? {} : { [e]: o[n.input.handle] ?? null }, e != null && (yield* H(t, i, e, f[e]));
 						break;
 					}
 					case "value":
-						d = Object.fromEntries(n.values.map((e) => [e.handle, e.value ?? null]));
-						for (let [e, n] of Object.entries(d)) yield* V(t, i, e, n);
+						f = Object.fromEntries(n.values.map((e) => [e.handle, e.value ?? null]));
+						for (let [e, n] of Object.entries(f)) yield* H(t, i, e, n);
 						break;
 					case "subflow": {
 						let e = a.prepared.subflows[n.subflowId];
-						d = yield* _(a, {
+						f = yield* _(a, {
 							flowId: n.subflowId,
 							graph: y(e.graph),
 							inputs: r(e.inputs),
@@ -236,7 +245,7 @@ function _(a, o, m, v, b, x = {}, S, C) {
 						}, a.createId(), o, {
 							jobId: i,
 							runId: m
-						}, {}, (e, n) => V(t, i, e, n));
+						}, {}, (e, n) => H(t, i, e, n));
 						break;
 					}
 					case "task": {
@@ -251,11 +260,11 @@ function _(a, o, m, v, b, x = {}, S, C) {
 								moduleId: n.task.moduleId
 							}
 						});
-						d = yield* e.try({
+						f = yield* e.try({
 							try: () => g(r, t),
 							catch: (e) => e instanceof Error ? e : Error(String(e))
 						});
-						for (let [e, n] of Object.entries(d)) yield* V(t, i, e, n);
+						for (let [e, n] of Object.entries(f)) yield* H(t, i, e, n);
 						break;
 					}
 				}
@@ -264,31 +273,31 @@ function _(a, o, m, v, b, x = {}, S, C) {
 					nodeId: t,
 					runId: m,
 					type: "node.completed"
-				}), d;
+				}), f;
 			});
 			return n.timeoutMs == null ? s : s.pipe(e.timeoutOrElse({
 				duration: n.timeoutMs,
 				orElse: () => e.fail(/* @__PURE__ */ Error(`Node "${t}" timed out.`))
 			}));
-		}, U = (t) => {
-			let n = o.graph.nodes[t], r = E.get(t).take(), s = a.createId(), c = P.get(t) ?? 0;
-			P.set(t, c + 1), A.set(t, (A.get(t) ?? 0) + 1), M(H(t, n, s, r).pipe(e.tap((n) => e.gen(function* () {
-				let e = N.get(t) ?? [];
+		}, W = (t) => {
+			let n = o.graph.nodes[t], r = E.get(t).take(), s = a.createId(), c = F.get(t) ?? 0;
+			F.set(t, c + 1), j.set(t, (j.get(t) ?? 0) + 1), N(U(t, n, s, r).pipe(e.tap((n) => e.gen(function* () {
+				let e = P.get(t) ?? [];
 				e.push({
 					jobId: s,
 					order: c,
 					outputs: n
-				}), N.set(t, e), I.has(t) || (I.add(t), yield* a.emit({
+				}), P.set(t, e), L.has(t) || (L.add(t), yield* a.emit({
 					...b == null ? {} : {
 						parentJobId: b.jobId,
 						parentRunId: b.runId
 					},
-					progress: I.size / T * 100,
+					progress: L.size / T * 100,
 					runId: m,
 					type: "run.progress"
 				}));
 			})), e.tapError((n) => e.gen(function* () {
-				L ?? (R ??= n);
+				R ?? (z ??= n);
 				let r = i(n, a.projectFailure);
 				yield* a.emit({
 					...r,
@@ -298,39 +307,43 @@ function _(a, o, m, v, b, x = {}, S, C) {
 					type: "node.failed"
 				}).pipe(e.ignore);
 			})), e.tapCause((t) => e.sync(() => {
-				L ??= t;
+				R ??= t;
 			})), e.ensuring(e.sync(() => {
-				A.set(t, (A.get(t) ?? 1) - 1), z(t);
+				j.set(t, (j.get(t) ?? 1) - 1), B(t);
 			}))));
 		};
-		z = (e) => {
-			if (L != null) return;
+		B = (e) => {
+			if (R != null) return;
 			let t = o.graph.nodes[e], n = E.get(e);
-			for (; n.ready && (A.get(e) ?? 0) < t.concurrency;) U(e);
+			for (; n.ready && (j.get(e) ?? 0) < t.concurrency;) W(e);
 		};
 		for (let [e, t] of Object.entries(x)) {
 			let n = E.get(e);
 			if (n != null) for (let [e, r] of Object.entries(t)) n.launch(e, r);
 		}
+		for (let [t, n] of O) {
+			if (!Object.hasOwn(a.bindingValues, t)) return yield* e.fail(/* @__PURE__ */ Error(`Variable binding "${t}" is unresolved.`));
+			for (let e of n) V(e, a.bindingValues[t]);
+		}
 		for (let [e, t] of Object.entries(o.inputs)) {
 			let n = Object.hasOwn(v, e) ? v[e] : t.value;
 			if (n !== void 0) {
-				for (let t of Object.entries(o.outputs)) t[1].sources.some((t) => t.kind == "flow" && t.input == e) && (F.set(t[0], n), S != null && (yield* S(t[0], n)));
-				for (let t of D.get(e) ?? []) B(t, n);
+				for (let t of Object.entries(o.outputs)) t[1].sources.some((t) => t.kind == "flow" && t.input == e) && (I.set(t[0], n), S != null && (yield* S(t[0], n)));
+				for (let t of D.get(e) ?? []) V(t, n);
 			}
 		}
-		if (C != null) for (let e of f(O, C.nodeId, "payload")) B(e, C.payload);
-		for (let e of w) z(e);
-		let W = yield* e.raceFirst(n.awaitEmpty(j), n.join(j)).pipe(e.exit);
-		if (R != null) return yield* n.clear(j), yield* a.emit({
-			message: R.message,
+		if (C != null) for (let e of f(k, C.nodeId, "payload")) V(e, C.payload);
+		for (let e of w) B(e);
+		let G = yield* e.raceFirst(n.awaitEmpty(M), n.join(M)).pipe(e.exit);
+		if (z != null) return yield* n.clear(M), yield* a.emit({
+			message: z.message,
 			runId: m,
 			type: "run.failed"
-		}).pipe(e.ignore), yield* e.fail(R);
-		if (L != null) return yield* n.clear(j), yield* e.failCause(L);
-		if (t.isFailure(W)) return yield* e.failCause(W.cause);
+		}).pipe(e.ignore), yield* e.fail(z);
+		if (R != null) return yield* n.clear(M), yield* e.failCause(R);
+		if (t.isFailure(G)) return yield* e.failCause(G.cause);
 		if (o.kind == "subflow") {
-			let e = Object.fromEntries(F);
+			let e = Object.fromEntries(I);
 			return yield* a.emit({
 				result: {
 					kind: "function-outputs",
@@ -341,10 +354,10 @@ function _(a, o, m, v, b, x = {}, S, C) {
 				type: "run.completed"
 			}), e;
 		}
-		let G = new Set(Object.values(o.graph.nodes).flatMap((e) => Object.values(e.inputs).flatMap((e) => e.kind == "sources" ? e.sources.filter((e) => e.kind == "node").map((e) => e.nodeId) : []))), K = {
+		let K = new Set(Object.values(o.graph.nodes).flatMap((e) => Object.values(e.inputs).flatMap((e) => e.kind == "sources" ? e.sources.filter((e) => e.kind == "node").map((e) => e.nodeId) : []))), q = {
 			kind: "node-results",
-			nodes: w.filter((e) => !G.has(e)).map((e) => ({
-				jobs: (N.get(e) ?? []).toSorted((e, t) => e.order - t.order).map(({ jobId: e, outputs: t }) => ({
+			nodes: w.filter((e) => !K.has(e)).map((e) => ({
+				jobs: (P.get(e) ?? []).toSorted((e, t) => e.order - t.order).map(({ jobId: e, outputs: t }) => ({
 					jobId: e,
 					outputs: t
 				})),
@@ -352,10 +365,10 @@ function _(a, o, m, v, b, x = {}, S, C) {
 			}))
 		};
 		return yield* a.emit({
-			result: K,
+			result: q,
 			runId: m,
 			type: "run.completed"
-		}), K;
+		}), q;
 	}));
 }
 function v(t, n) {
@@ -363,6 +376,7 @@ function v(t, n) {
 	return e.gen(function* () {
 		let i = n.trigger == null ? void 0 : t.graph.nodes[n.trigger.nodeId];
 		return n.trigger != null && (i == null || "inputs" in i) ? yield* e.fail(/* @__PURE__ */ Error(`Node "${n.trigger.nodeId}" is not a TriggerNode in Flow "${n.flowId}".`)) : yield* _({
+			bindingValues: n.bindingValues ?? {},
 			createId: n.createId,
 			emit: r,
 			invokeTask: n.invokeTask,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@oomol-lab/open-flow",
-  "version": "0.1.0-alpha.10",
+  "version": "0.1.0-alpha.13",
   "description": "TypeScript contracts and Browser runtime for Open Flow.",
   "license": "Apache-2.0",
   "repository": {
@@ -37,6 +37,10 @@
       "types": "./dist/common/integration-trigger.d.ts",
       "import": "./dist/common/integration-trigger.js"
     },
+    "./localization": {
+      "types": "./dist/common/localization.d.ts",
+      "import": "./dist/common/localization.js"
+    },
     "./poll-trigger": {
       "types": "./dist/common/poll-trigger.d.ts",
       "import": "./dist/common/poll-trigger.js"
@@ -88,6 +92,10 @@
     "./workbench.css": {
       "types": "./dist/browser/workbench.css.d.ts",
       "default": "./dist/browser/workbench.css"
+    },
+    "./theme.css": {
+      "types": "./dist/browser/theme.css.d.ts",
+      "default": "./dist/browser/theme.css"
     }
   },
   "files": [