@sakibcoolz/core 0.1.1 → 0.2.0

package/dist/digest.js

@@ -0,0 +1,68 @@
+import { serializeScene } from './serialization.js';
+// Document digests (ADR-0028): SHA-256 (FIPS 180-4) of a scene's canonical serialization, so a runtime
+// can check it shows exactly the revision a host approved. Synchronous and dependency-free: `crypto.subtle`
+// exists only on secure origins, and plant LANs often serve plain HTTP. Integrity, not authenticity:
+// signing who approved a revision is the host's job.
+const K = new Uint32Array([
+    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
+    0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
+    0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
+    0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
+]);
+const rotr = (x, n) => (x >>> n) | (x << (32 - n));
+/** SHA-256 of a string's UTF-8 bytes, as 64 lower-case hex digits. */
+export function sha256Hex(text) {
+    const data = new TextEncoder().encode(text);
+    // Message, a 1 bit, zero padding, and the bit length as a 64-bit big-endian number.
+    const blocks = Math.ceil((data.length + 9) / 64);
+    const bytes = new Uint8Array(blocks * 64);
+    bytes.set(data);
+    bytes[data.length] = 0x80;
+    const view = new DataView(bytes.buffer);
+    const bits = data.length * 8;
+    view.setUint32(bytes.length - 8, Math.floor(bits / 0x1_0000_0000));
+    view.setUint32(bytes.length - 4, bits >>> 0);
+    const h = new Uint32Array([0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19]);
+    const w = new Uint32Array(64);
+    for (let offset = 0; offset < bytes.length; offset += 64) {
+        for (let i = 0; i < 16; i++)
+            w[i] = view.getUint32(offset + i * 4);
+        for (let i = 16; i < 64; i++) {
+            const s0 = rotr(w[i - 15], 7) ^ rotr(w[i - 15], 18) ^ (w[i - 15] >>> 3);
+            const s1 = rotr(w[i - 2], 17) ^ rotr(w[i - 2], 19) ^ (w[i - 2] >>> 10);
+            w[i] = (w[i - 16] + s0 + w[i - 7] + s1) >>> 0;
+        }
+        let [a, b, c, d, e, f, g, hh] = h;
+        for (let i = 0; i < 64; i++) {
+            const t1 = (hh + (rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25)) + ((e & f) ^ (~e & g)) + K[i] + w[i]) >>> 0;
+            const t2 = ((rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22)) + ((a & b) ^ (a & c) ^ (b & c))) >>> 0;
+            hh = g;
+            g = f;
+            f = e;
+            e = (d + t1) >>> 0;
+            d = c;
+            c = b;
+            b = a;
+            a = (t1 + t2) >>> 0;
+        }
+        h[0] += a;
+        h[1] += b;
+        h[2] += c;
+        h[3] += d;
+        h[4] += e;
+        h[5] += f;
+        h[6] += g;
+        h[7] += hh;
+    }
+    return Array.from(h, (x) => x.toString(16).padStart(8, '0')).join('');
+}
+/**
+ * The digest a host records when it approves a revision: SHA-256 of `serializeScene(scene)`, so
+ * whitespace and key order in the stored file do not matter. `ScadaRuntime` compares it before drawing.
+ */
+export function sceneDigest(scene) {
+    return sha256Hex(serializeScene(scene));
+}
+//# sourceMappingURL=digest.js.map

package/dist/digest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"digest.js","sourceRoot":"","sources":["../src/digest.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEpD,uGAAuG;AACvG,4GAA4G;AAC5G,qGAAqG;AACrG,qDAAqD;AAErD,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC;IACxB,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9I,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9I,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9I,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9I,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9I,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;CAC/C,CAAC,CAAC;AAEH,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AAEnE,sEAAsE;AACtE,MAAM,UAAU,SAAS,CAAC,IAAY;IACpC,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5C,oFAAoF;IACpF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;IAC1C,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC1B,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC;IACnE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC;IAE7C,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;IAC5H,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IAC9B,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,MAAM,IAAI,EAAE,EAAE,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACnE,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACxE,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YACvE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACtG,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5F,EAAE,GAAG,CAAC,CAAC;YACP,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1F,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACxE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,KAAiB;IAC3C,OAAO,SAAS,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;AAC1C,CAAC","sourcesContent":["import type { ScadaScene } from './scene.js';\nimport { serializeScene } from './serialization.js';\n\n// Document digests (ADR-0028): SHA-256 (FIPS 180-4) of a scene's canonical serialization, so a runtime\n// can check it shows exactly the revision a host approved. Synchronous and dependency-free: `crypto.subtle`\n// exists only on secure origins, and plant LANs often serve plain HTTP. Integrity, not authenticity:\n// signing who approved a revision is the host's job.\n\nconst K = new Uint32Array([\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n  0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n  0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n  0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,\n]);\n\nconst rotr = (x: number, n: number) => (x >>> n) | (x << (32 - n));\n\n/** SHA-256 of a string's UTF-8 bytes, as 64 lower-case hex digits. */\nexport function sha256Hex(text: string): string {\n  const data = new TextEncoder().encode(text);\n  // Message, a 1 bit, zero padding, and the bit length as a 64-bit big-endian number.\n  const blocks = Math.ceil((data.length + 9) / 64);\n  const bytes = new Uint8Array(blocks * 64);\n  bytes.set(data);\n  bytes[data.length] = 0x80;\n  const view = new DataView(bytes.buffer);\n  const bits = data.length * 8;\n  view.setUint32(bytes.length - 8, Math.floor(bits / 0x1_0000_0000));\n  view.setUint32(bytes.length - 4, bits >>> 0);\n\n  const h = new Uint32Array([0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19]);\n  const w = new Uint32Array(64);\n  for (let offset = 0; offset < bytes.length; offset += 64) {\n    for (let i = 0; i < 16; i++) w[i] = view.getUint32(offset + i * 4);\n    for (let i = 16; i < 64; i++) {\n      const s0 = rotr(w[i - 15], 7) ^ rotr(w[i - 15], 18) ^ (w[i - 15] >>> 3);\n      const s1 = rotr(w[i - 2], 17) ^ rotr(w[i - 2], 19) ^ (w[i - 2] >>> 10);\n      w[i] = (w[i - 16] + s0 + w[i - 7] + s1) >>> 0;\n    }\n    let [a, b, c, d, e, f, g, hh] = h;\n    for (let i = 0; i < 64; i++) {\n      const t1 = (hh + (rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25)) + ((e & f) ^ (~e & g)) + K[i] + w[i]) >>> 0;\n      const t2 = ((rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22)) + ((a & b) ^ (a & c) ^ (b & c))) >>> 0;\n      hh = g;\n      g = f;\n      f = e;\n      e = (d + t1) >>> 0;\n      d = c;\n      c = b;\n      b = a;\n      a = (t1 + t2) >>> 0;\n    }\n    h[0] += a; h[1] += b; h[2] += c; h[3] += d; h[4] += e; h[5] += f; h[6] += g; h[7] += hh;\n  }\n  return Array.from(h, (x) => x.toString(16).padStart(8, '0')).join('');\n}\n\n/**\n * The digest a host records when it approves a revision: SHA-256 of `serializeScene(scene)`, so\n * whitespace and key order in the stored file do not matter. `ScadaRuntime` compares it before drawing.\n */\nexport function sceneDigest(scene: ScadaScene): string {\n  return sha256Hex(serializeScene(scene));\n}\n"]}

package/dist/flow.d.ts

@@ -1,5 +1,6 @@
 import type { ScadaScene } from './scene.js';
-export type Quality = 'GOOD' | 'BAD' | 'UNCERTAIN' | 'STALE';
+/** `DISCONNECTED`: the link to the source is down, as distinct from a bad reading (ADR-0024). */
+export type Quality = 'GOOD' | 'BAD' | 'UNCERTAIN' | 'STALE' | 'DISCONNECTED';
 export type ValueSource = 'MEASURED' | 'SIMULATED';
 /** One flow observation supplied by the host. The SDK never fetches readings itself. */
 export interface FlowReading {
@@ -12,7 +13,7 @@ export interface FlowReading {
     sourceTimestamp: string;
 }
 export type FlowDirection = 'forward' | 'reverse' | 'stopped' | 'unknown';
-export type FlowUnknownReason = 'NO_READING' | 'BAD_QUALITY' | 'STALE' | 'INVALID_TIMESTAMP' | 'INVALID_VALUE';
+export type FlowUnknownReason = 'NO_READING' | 'BAD_QUALITY' | 'DISCONNECTED' | 'STALE' | 'INVALID_TIMESTAMP' | 'INVALID_VALUE';
 export type FlowState = {
     connectionId: string;
     direction: Exclude<FlowDirection, 'unknown'>;

package/dist/flow.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"flow.d.ts","sourceRoot":"","sources":["../src/flow.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE7C,MAAM,MAAM,OAAO,GAAG,MAAM,GAAG,KAAK,GAAG,WAAW,GAAG,OAAO,CAAC;AAC7D,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC;AAEnD,wFAAwF;AACxF,MAAM,WAAW,WAAW;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,yGAAyG;IACzG,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,WAAW,CAAC;IACpB,0DAA0D;IAC1D,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,MAAM,aAAa,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;AAC1E,MAAM,MAAM,iBAAiB,GAAG,YAAY,GAAG,aAAa,GAAG,OAAO,GAAG,mBAAmB,GAAG,eAAe,CAAC;AAE/G,MAAM,MAAM,SAAS,GACjB;IACE,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC7C,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,WAAW,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,uFAAuF;IACvF,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,CAAC,EAAE,SAAS,CAAC;CACpB,GACD;IACE,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,SAAS,CAAC;IACrB,MAAM,EAAE,iBAAiB,CAAC;IAC1B,yGAAyG;IACzG,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,IAAI,CAAC,EAAE,SAAS,CAAC;CAClB,CAAC;AAEN,MAAM,WAAW,WAAW;IAC1B,kFAAkF;IAClF,GAAG,EAAE,MAAM,CAAC;IACZ,8FAA8F;IAC9F,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,6DAA6D;IAC7D,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,iFAAiF;IACjF,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,sEAAsE;IACtE,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,cAAc;IAC7B,2DAA2D;IAC3D,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,sFAAsF;IACtF,sBAAsB,EAAE,MAAM,EAAE,CAAC;CAClC;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,WAAW,EAAE,EAAE,OAAO,EAAE,WAAW,GAAG,cAAc,CAkDrH"}
+{"version":3,"file":"flow.d.ts","sourceRoot":"","sources":["../src/flow.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE7C,iGAAiG;AACjG,MAAM,MAAM,OAAO,GAAG,MAAM,GAAG,KAAK,GAAG,WAAW,GAAG,OAAO,GAAG,cAAc,CAAC;AAC9E,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC;AAEnD,wFAAwF;AACxF,MAAM,WAAW,WAAW;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,yGAAyG;IACzG,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,WAAW,CAAC;IACpB,0DAA0D;IAC1D,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,MAAM,aAAa,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;AAC1E,MAAM,MAAM,iBAAiB,GAAG,YAAY,GAAG,aAAa,GAAG,cAAc,GAAG,OAAO,GAAG,mBAAmB,GAAG,eAAe,CAAC;AAEhI,MAAM,MAAM,SAAS,GACjB;IACE,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC7C,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,WAAW,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,uFAAuF;IACvF,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,CAAC,EAAE,SAAS,CAAC;CACpB,GACD;IACE,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,SAAS,CAAC;IACrB,MAAM,EAAE,iBAAiB,CAAC;IAC1B,yGAAyG;IACzG,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,IAAI,CAAC,EAAE,SAAS,CAAC;CAClB,CAAC;AAEN,MAAM,WAAW,WAAW;IAC1B,kFAAkF;IAClF,GAAG,EAAE,MAAM,CAAC;IACZ,8FAA8F;IAC9F,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,6DAA6D;IAC7D,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,iFAAiF;IACjF,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,sEAAsE;IACtE,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,cAAc;IAC7B,2DAA2D;IAC3D,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,sFAAsF;IACtF,sBAAsB,EAAE,MAAM,EAAE,CAAC;CAClC;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,WAAW,EAAE,EAAE,OAAO,EAAE,WAAW,GAAG,cAAc,CAkDrH"}

package/dist/flow.js.map

@@ -1 +1 @@
-{"version":3,"file":"flow.js","sourceRoot":"","sources":["../src/flow.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AA+DzE;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,KAAiB,EAAE,QAAgC,EAAE,OAAoB;IACnG,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,UAAU,CAAC;IAC5C,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,MAAM,CAAC;IACpD,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,KAAK,CAAC;IACvD,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,IAAI,CAAC;IAEpD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;YAC/B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;YAC9B,SAAS;QACX,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,SAAS;QAClC,IAAI,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAa,EAAE;QAC7D,MAAM,YAAY,GAAG,UAAU,CAAC,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACnC,IAAI,CAAC,CAAC;YAAE,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;QAE5E,MAAM,YAAY,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,CAAC,MAAyB,EAAa,EAAE,CAAC,CAAC;YACzD,YAAY;YACZ,SAAS,EAAE,SAAS;YACpB,MAAM;YACN,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/C,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,eAAe,EAAE,CAAC,CAAC,eAAe;SACnC,CAAC,CAAC;QAEH,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAO,OAAO,CAAC,eAAe,CAAC,CAAC;QAC5F,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC,CAAC;QACzF,IAAI,OAAO;YAAE,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;QAErC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;QACrG,OAAO;YACL,YAAY;YACZ,SAAS;YACT,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,eAAe,EAAE,CAAC,CAAC,eAAe;YAClC,SAAS,EAAE,CAAC,CAAC,OAAO,KAAK,WAAW;SACrC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,MAAM,EAAE,sBAAsB,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;AAC5D,CAAC","sourcesContent":["import { assessObservation, isNewer, qualities } from './observation.js';\nimport type { ScadaScene } from './scene.js';\n\nexport type Quality = 'GOOD' | 'BAD' | 'UNCERTAIN' | 'STALE';\nexport type ValueSource = 'MEASURED' | 'SIMULATED';\n\n/** One flow observation supplied by the host. The SDK never fetches readings itself. */\nexport interface FlowReading {\n  connectionId: string;\n  /** Volumetric flow in m³/s, signed: positive runs from the connection's `from` port to its `to` port. */\n  rate: number;\n  quality: Quality;\n  source: ValueSource;\n  /** ISO 8601 time the value was observed at its source. */\n  sourceTimestamp: string;\n}\n\nexport type FlowDirection = 'forward' | 'reverse' | 'stopped' | 'unknown';\nexport type FlowUnknownReason = 'NO_READING' | 'BAD_QUALITY' | 'STALE' | 'INVALID_TIMESTAMP' | 'INVALID_VALUE';\n\nexport type FlowState =\n  | {\n      connectionId: string;\n      direction: Exclude<FlowDirection, 'unknown'>;\n      rate: number;\n      quality: Quality;\n      source: ValueSource;\n      sourceTimestamp: string;\n      /** The reading's quality is UNCERTAIN: show the direction, but mark it as doubtful. */\n      uncertain: boolean;\n      reason?: undefined;\n    }\n  | {\n      connectionId: string;\n      direction: 'unknown';\n      reason: FlowUnknownReason;\n      /** Present when a reading existed but could not be trusted, so the viewer can say why and since when. */\n      quality?: Quality;\n      source?: ValueSource;\n      sourceTimestamp?: string;\n      rate?: undefined;\n    };\n\nexport interface FlowOptions {\n  /** Current time in epoch milliseconds. Passed in so results are deterministic. */\n  now: number;\n  /** Which readings to use. Measured and simulated values are never mixed. Default MEASURED. */\n  source?: ValueSource;\n  /** Readings older than this are STALE. Default 10,000 ms. */\n  staleAfterMs?: number;\n  /** Timestamps further than this in the future are rejected. Default 5,000 ms. */\n  maxClockSkewMs?: number;\n  /** |rate| at or below this (m³/s) counts as stopped. Default 1e-6. */\n  zeroThreshold?: number;\n}\n\nexport interface FlowResolution {\n  /** One state per scene connection, in connection order. */\n  states: FlowState[];\n  /** Connection ids that had readings but are not in the scene, in first-seen order. */\n  unmatchedConnectionIds: string[];\n}\n\n/**\n * Decides the flow direction of every connection from host-supplied readings only. Topology and\n * valve state are never used to infer flow: no trustworthy reading means `unknown`, and a known\n * flow into a tee says nothing about its branches.\n */\nexport function resolveFlow(scene: ScadaScene, readings: readonly FlowReading[], options: FlowOptions): FlowResolution {\n  const source = options.source ?? 'MEASURED';\n  const staleAfterMs = options.staleAfterMs ?? 10_000;\n  const maxClockSkewMs = options.maxClockSkewMs ?? 5_000;\n  const zeroThreshold = options.zeroThreshold ?? 1e-6;\n\n  const known = new Set(scene.connections.map((c) => c.id));\n  const latest = new Map<string, FlowReading>();\n  const unmatched = new Set<string>();\n  for (const r of readings) {\n    if (!known.has(r.connectionId)) {\n      unmatched.add(r.connectionId);\n      continue;\n    }\n    if (r.source !== source) continue;\n    if (isNewer(r, latest.get(r.connectionId))) latest.set(r.connectionId, r);\n  }\n\n  const states = scene.connections.map((connection): FlowState => {\n    const connectionId = connection.id;\n    const r = latest.get(connectionId);\n    if (!r) return { connectionId, direction: 'unknown', reason: 'NO_READING' };\n\n    const validQuality = qualities.includes(r.quality);\n    const unknown = (reason: FlowUnknownReason): FlowState => ({\n      connectionId,\n      direction: 'unknown',\n      reason,\n      ...(validQuality ? { quality: r.quality } : {}),\n      source: r.source,\n      sourceTimestamp: r.sourceTimestamp,\n    });\n\n    if (typeof r.rate !== 'number' || !Number.isFinite(r.rate)) return unknown('INVALID_VALUE');\n    const problem = assessObservation(r, { now: options.now, staleAfterMs, maxClockSkewMs });\n    if (problem) return unknown(problem);\n\n    const direction = Math.abs(r.rate) <= zeroThreshold ? 'stopped' : r.rate > 0 ? 'forward' : 'reverse';\n    return {\n      connectionId,\n      direction,\n      rate: r.rate,\n      quality: r.quality,\n      source: r.source,\n      sourceTimestamp: r.sourceTimestamp,\n      uncertain: r.quality === 'UNCERTAIN',\n    };\n  });\n\n  return { states, unmatchedConnectionIds: [...unmatched] };\n}\n"]}
+{"version":3,"file":"flow.js","sourceRoot":"","sources":["../src/flow.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAgEzE;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,KAAiB,EAAE,QAAgC,EAAE,OAAoB;IACnG,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,UAAU,CAAC;IAC5C,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,MAAM,CAAC;IACpD,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,KAAK,CAAC;IACvD,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,IAAI,CAAC;IAEpD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;YAC/B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;YAC9B,SAAS;QACX,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,SAAS;QAClC,IAAI,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAa,EAAE;QAC7D,MAAM,YAAY,GAAG,UAAU,CAAC,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACnC,IAAI,CAAC,CAAC;YAAE,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;QAE5E,MAAM,YAAY,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,CAAC,MAAyB,EAAa,EAAE,CAAC,CAAC;YACzD,YAAY;YACZ,SAAS,EAAE,SAAS;YACpB,MAAM;YACN,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/C,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,eAAe,EAAE,CAAC,CAAC,eAAe;SACnC,CAAC,CAAC;QAEH,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAO,OAAO,CAAC,eAAe,CAAC,CAAC;QAC5F,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC,CAAC;QACzF,IAAI,OAAO;YAAE,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;QAErC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;QACrG,OAAO;YACL,YAAY;YACZ,SAAS;YACT,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,eAAe,EAAE,CAAC,CAAC,eAAe;YAClC,SAAS,EAAE,CAAC,CAAC,OAAO,KAAK,WAAW;SACrC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,MAAM,EAAE,sBAAsB,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;AAC5D,CAAC","sourcesContent":["import { assessObservation, isNewer, qualities } from './observation.js';\nimport type { ScadaScene } from './scene.js';\n\n/** `DISCONNECTED`: the link to the source is down, as distinct from a bad reading (ADR-0024). */\nexport type Quality = 'GOOD' | 'BAD' | 'UNCERTAIN' | 'STALE' | 'DISCONNECTED';\nexport type ValueSource = 'MEASURED' | 'SIMULATED';\n\n/** One flow observation supplied by the host. The SDK never fetches readings itself. */\nexport interface FlowReading {\n  connectionId: string;\n  /** Volumetric flow in m³/s, signed: positive runs from the connection's `from` port to its `to` port. */\n  rate: number;\n  quality: Quality;\n  source: ValueSource;\n  /** ISO 8601 time the value was observed at its source. */\n  sourceTimestamp: string;\n}\n\nexport type FlowDirection = 'forward' | 'reverse' | 'stopped' | 'unknown';\nexport type FlowUnknownReason = 'NO_READING' | 'BAD_QUALITY' | 'DISCONNECTED' | 'STALE' | 'INVALID_TIMESTAMP' | 'INVALID_VALUE';\n\nexport type FlowState =\n  | {\n      connectionId: string;\n      direction: Exclude<FlowDirection, 'unknown'>;\n      rate: number;\n      quality: Quality;\n      source: ValueSource;\n      sourceTimestamp: string;\n      /** The reading's quality is UNCERTAIN: show the direction, but mark it as doubtful. */\n      uncertain: boolean;\n      reason?: undefined;\n    }\n  | {\n      connectionId: string;\n      direction: 'unknown';\n      reason: FlowUnknownReason;\n      /** Present when a reading existed but could not be trusted, so the viewer can say why and since when. */\n      quality?: Quality;\n      source?: ValueSource;\n      sourceTimestamp?: string;\n      rate?: undefined;\n    };\n\nexport interface FlowOptions {\n  /** Current time in epoch milliseconds. Passed in so results are deterministic. */\n  now: number;\n  /** Which readings to use. Measured and simulated values are never mixed. Default MEASURED. */\n  source?: ValueSource;\n  /** Readings older than this are STALE. Default 10,000 ms. */\n  staleAfterMs?: number;\n  /** Timestamps further than this in the future are rejected. Default 5,000 ms. */\n  maxClockSkewMs?: number;\n  /** |rate| at or below this (m³/s) counts as stopped. Default 1e-6. */\n  zeroThreshold?: number;\n}\n\nexport interface FlowResolution {\n  /** One state per scene connection, in connection order. */\n  states: FlowState[];\n  /** Connection ids that had readings but are not in the scene, in first-seen order. */\n  unmatchedConnectionIds: string[];\n}\n\n/**\n * Decides the flow direction of every connection from host-supplied readings only. Topology and\n * valve state are never used to infer flow: no trustworthy reading means `unknown`, and a known\n * flow into a tee says nothing about its branches.\n */\nexport function resolveFlow(scene: ScadaScene, readings: readonly FlowReading[], options: FlowOptions): FlowResolution {\n  const source = options.source ?? 'MEASURED';\n  const staleAfterMs = options.staleAfterMs ?? 10_000;\n  const maxClockSkewMs = options.maxClockSkewMs ?? 5_000;\n  const zeroThreshold = options.zeroThreshold ?? 1e-6;\n\n  const known = new Set(scene.connections.map((c) => c.id));\n  const latest = new Map<string, FlowReading>();\n  const unmatched = new Set<string>();\n  for (const r of readings) {\n    if (!known.has(r.connectionId)) {\n      unmatched.add(r.connectionId);\n      continue;\n    }\n    if (r.source !== source) continue;\n    if (isNewer(r, latest.get(r.connectionId))) latest.set(r.connectionId, r);\n  }\n\n  const states = scene.connections.map((connection): FlowState => {\n    const connectionId = connection.id;\n    const r = latest.get(connectionId);\n    if (!r) return { connectionId, direction: 'unknown', reason: 'NO_READING' };\n\n    const validQuality = qualities.includes(r.quality);\n    const unknown = (reason: FlowUnknownReason): FlowState => ({\n      connectionId,\n      direction: 'unknown',\n      reason,\n      ...(validQuality ? { quality: r.quality } : {}),\n      source: r.source,\n      sourceTimestamp: r.sourceTimestamp,\n    });\n\n    if (typeof r.rate !== 'number' || !Number.isFinite(r.rate)) return unknown('INVALID_VALUE');\n    const problem = assessObservation(r, { now: options.now, staleAfterMs, maxClockSkewMs });\n    if (problem) return unknown(problem);\n\n    const direction = Math.abs(r.rate) <= zeroThreshold ? 'stopped' : r.rate > 0 ? 'forward' : 'reverse';\n    return {\n      connectionId,\n      direction,\n      rate: r.rate,\n      quality: r.quality,\n      source: r.source,\n      sourceTimestamp: r.sourceTimestamp,\n      uncertain: r.quality === 'UNCERTAIN',\n    };\n  });\n\n  return { states, unmatchedConnectionIds: [...unmatched] };\n}\n"]}

package/dist/graph.d.ts

@@ -1,6 +1,6 @@
-import type { ScadaScene, SceneConnection } from './scene.js';
+import { type ComponentInstance, type ComponentType, type ConnectionPort, type PortKind, type Relationship, type ScadaScene, type SceneAssociation, type SceneConnection } from './scene.js';
 import { type SceneValidationErrorCode, type SceneValidationOptions } from './validation.js';
-export type GraphErrorCode = SceneValidationErrorCode | 'UNKNOWN_CONNECTION';
+export type GraphErrorCode = SceneValidationErrorCode | 'UNKNOWN_CONNECTION' | 'UNKNOWN_ASSOCIATION';
 export interface GraphError {
     code: GraphErrorCode;
     message: string;
@@ -12,21 +12,81 @@ export type GraphResult = {
     ok: false;
     error: GraphError;
 };
-export type GraphOptions = Pick<SceneValidationOptions, 'resolvePorts' | 'resolveBindable' | 'validateProperties' | 'limits'>;
+export type GraphOptions = Pick<SceneValidationOptions, 'resolvePorts' | 'resolveType' | 'resolveBindable' | 'validateProperties' | 'limits'>;
 /**
  * Adds one edge. The candidate scene goes through `validateScene`, so the same rules apply as on
  * load (known ports, compatibility, occupancy, no duplicates). The input scene must already be valid.
  */
 export declare function connect(scene: ScadaScene, connection: SceneConnection, options: GraphOptions): GraphResult;
 export declare function disconnect(scene: ScadaScene, connectionId: string): GraphResult;
-/** Removes a component with every edge that touches it, so no edge is left dangling; its children are freed. */
+/**
+ * Adds one association (ADR-0023), such as "PLC-01 controls VFD-101". Validated like `connect`:
+ * both components exist and differ, the id is unused, and the same fact is not recorded twice.
+ */
+export declare function addAssociation(scene: ScadaScene, association: SceneAssociation, options: GraphOptions): GraphResult;
+/** Removes one association. The list is dropped when it becomes empty, so the file is unchanged by an add and remove. */
+export declare function removeAssociation(scene: ScadaScene, associationId: string): GraphResult;
+/**
+ * Removes a component with every connection and association that touches it, so no edge is left
+ * dangling; its children are freed, data sources and variables keep their description but lose the
+ * link, and its symbol and edge routes leave every view (ADR-0026).
+ */
 export declare function removeComponent(scene: ScadaScene, instanceId: string): GraphResult;
-export declare function connectionsOf(scene: ScadaScene, instanceId: string): SceneConnection[];
+/**
+ * Which edges a graph query follows (ADR-0023). Everything is optional; an empty filter follows
+ * every connection and association in both directions.
+ */
+export interface GraphFilter {
+    /** Connection domains to follow. A connection's domain is its `domain` field, else its from-port's kind via `resolvePorts`. Associations have no domain and are skipped when this is set. */
+    domains?: readonly PortKind[];
+    /** Relationships to follow; edges without a relationship are skipped when this is set. */
+    relationships?: readonly Relationship[];
+    /** Follow connections. Default true. */
+    connections?: boolean;
+    /** Follow associations. Default true for `neighbours`, `relatedComponents` and `pathBetween`. */
+    associations?: boolean;
+    /** `out` follows edges from→to, `in` to→from, `both` (default) either way. */
+    direction?: 'out' | 'in' | 'both';
+    /** Resolves a connection's domain when it has no `domain` field. */
+    resolvePorts?: (type: ComponentType, properties?: ComponentInstance['properties']) => readonly ConnectionPort[] | undefined;
+}
+/** One edge walked by a query, from one component to the next. */
+export interface GraphStep {
+    edge: 'connection' | 'association';
+    /** The connection or association id. */
+    id: string;
+    /** Component walked from and to. */
+    from: string;
+    to: string;
+    /** True when walked in the edge's own from→to direction. */
+    forward: boolean;
+    domain?: PortKind;
+    relationship?: Relationship;
+}
+/** Components one followed edge away from `instanceId`, each once, in edge order. Empty for an unknown id. */
+export declare function neighbours(scene: ScadaScene, instanceId: string, filter?: GraphFilter): string[];
+/**
+ * Every component reachable from `instanceId` through followed edges, breadth first, excluding
+ * `instanceId` itself. For example, with `{ relationships: ['controls', 'drives'], direction: 'out' }`
+ * from a PLC: the drives it controls and the motors they drive. Derived only from explicit edges.
+ */
+export declare function relatedComponents(scene: ScadaScene, instanceId: string, filter?: GraphFilter): string[];
+/**
+ * The shortest chain of followed edges from `fromId` to `toId` (fewest edges; ties go to scene
+ * order), or undefined when there is none. Empty when both ids are the same known component.
+ */
+export declare function pathBetween(scene: ScadaScene, fromId: string, toId: string, filter?: GraphFilter): GraphStep[] | undefined;
+/** Connection filter for the older helpers: optional domains, resolved like `GraphFilter`. Associations are never followed. */
+export type ConnectionFilter = Pick<GraphFilter, 'domains' | 'resolvePorts'>;
+/** Domains whose ports are joined physically (fluid, mechanical and the deprecated `electrical`, as `matesPhysically`): the filter for assemblies, which move parts that are bolted together. */
+export declare const physicalDomains: readonly PortKind[];
+/** Connections touching `instanceId`, optionally only in some domains. Associations are separate (`scene.associations`). */
+export declare function connectionsOf(scene: ScadaScene, instanceId: string, filter?: ConnectionFilter): SceneConnection[];
 /**
  * Component ids connected to `instanceId` through any path, ignoring edge direction, in
  * breadth-first order following scene connection order. Empty for an unknown id.
  */
-export declare function reachableComponents(scene: ScadaScene, instanceId: string): string[];
+export declare function reachableComponents(scene: ScadaScene, instanceId: string, filter?: ConnectionFilter): string[];
 /** Disconnected networks, each in breadth-first order, ordered by their first component in the scene. */
-export declare function connectedGroups(scene: ScadaScene): string[][];
+export declare function connectedGroups(scene: ScadaScene, filter?: ConnectionFilter): string[][];
 //# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAiB,KAAK,wBAAwB,EAAE,KAAK,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAE5G,MAAM,MAAM,cAAc,GAAG,wBAAwB,GAAG,oBAAoB,CAAC;AAE7E,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,cAAc,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,WAAW,GAAG;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAAC;AAE7F,MAAM,MAAM,YAAY,GAAG,IAAI,CAAC,sBAAsB,EAAE,cAAc,GAAG,iBAAiB,GAAG,oBAAoB,GAAG,QAAQ,CAAC,CAAC;AAE9H;;;GAGG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,eAAe,EAAE,OAAO,EAAE,YAAY,GAAG,WAAW,CAO1G;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,GAAG,WAAW,CAM/E;AAED,gHAAgH;AAChH,wBAAgB,eAAe,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,GAAG,WAAW,CAgBlF;AAWD,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,GAAG,eAAe,EAAE,CAEtF;AA0BD;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,CAGnF;AAED,yGAAyG;AACzG,wBAAgB,eAAe,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,EAAE,EAAE,CAQ7D"}
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAa,KAAK,iBAAiB,EAAE,KAAK,aAAa,EAAE,KAAK,cAAc,EAAE,KAAK,QAAQ,EAAE,KAAK,YAAY,EAAE,KAAK,UAAU,EAAE,KAAK,gBAAgB,EAAE,KAAK,eAAe,EAAoC,MAAM,YAAY,CAAC;AAC1O,OAAO,EAAiB,KAAK,wBAAwB,EAAE,KAAK,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAE5G,MAAM,MAAM,cAAc,GAAG,wBAAwB,GAAG,oBAAoB,GAAG,qBAAqB,CAAC;AAErG,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,cAAc,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,WAAW,GAAG;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAAC;AAE7F,MAAM,MAAM,YAAY,GAAG,IAAI,CAAC,sBAAsB,EAAE,cAAc,GAAG,aAAa,GAAG,iBAAiB,GAAG,oBAAoB,GAAG,QAAQ,CAAC,CAAC;AAE9I;;;GAGG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,eAAe,EAAE,OAAO,EAAE,YAAY,GAAG,WAAW,CAO1G;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,GAAG,WAAW,CAM/E;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,gBAAgB,EAAE,OAAO,EAAE,YAAY,GAAG,WAAW,CAOnH;AAED,yHAAyH;AACzH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,GAAG,WAAW,CAKvF;AAQD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,GAAG,WAAW,CAiBlF;AAsDD;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,6LAA6L;IAC7L,OAAO,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC9B,0FAA0F;IAC1F,aAAa,CAAC,EAAE,SAAS,YAAY,EAAE,CAAC;IACxC,wCAAwC;IACxC,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,iGAAiG;IACjG,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,8EAA8E;IAC9E,SAAS,CAAC,EAAE,KAAK,GAAG,IAAI,GAAG,MAAM,CAAC;IAClC,oEAAoE;IACpE,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,aAAa,EAAE,UAAU,CAAC,EAAE,iBAAiB,CAAC,YAAY,CAAC,KAAK,SAAS,cAAc,EAAE,GAAG,SAAS,CAAC;CAC7H;AAED,kEAAkE;AAClE,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,YAAY,GAAG,aAAa,CAAC;IACnC,wCAAwC;IACxC,EAAE,EAAE,MAAM,CAAC;IACX,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,4DAA4D;IAC5D,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,QAAQ,CAAC;IAClB,YAAY,CAAC,EAAE,YAAY,CAAC;CAC7B;AAoCD,8GAA8G;AAC9G,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAE,WAAgB,GAAG,MAAM,EAAE,CAIpG;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAE,WAAgB,GAAG,MAAM,EAAE,CAI3G;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,GAAE,WAAgB,GAAG,SAAS,EAAE,GAAG,SAAS,CAY9H;AAkBD,+HAA+H;AAC/H,MAAM,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS,GAAG,cAAc,CAAC,CAAC;AAE7E,iMAAiM;AACjM,eAAO,MAAM,eAAe,EAAE,SAAS,QAAQ,EAA0C,CAAC;AAE1F,4HAA4H;AAC5H,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAE,gBAAqB,GAAG,eAAe,EAAE,CAGrH;AAqCD;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAE,gBAAqB,GAAG,MAAM,EAAE,CAGlH;AAED,yGAAyG;AACzG,wBAAgB,eAAe,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,GAAE,gBAAqB,GAAG,MAAM,EAAE,EAAE,CAQ5F"}

package/dist/graph.js

@@ -1,3 +1,4 @@
+import { viewKinds } from './scene.js';
 import { validateScene } from './validation.js';
 /**
  * Adds one edge. The candidate scene goes through `validateScene`, so the same rules apply as on
@@ -17,9 +18,38 @@ export function disconnect(scene, connectionId) {
         return { ok: false, error: { code: 'UNKNOWN_CONNECTION', message: `No connection "${connectionId}".` } };
     }
     const next = { ...scene, connections: scene.connections.filter((c) => c.id !== connectionId) };
-    return { ok: true, scene: withoutDanglingBindings(next) };
+    return { ok: true, scene: withoutDanglingViews(withoutDanglingBindings(next)) };
 }
-/** Removes a component with every edge that touches it, so no edge is left dangling; its children are freed. */
+/**
+ * Adds one association (ADR-0023), such as "PLC-01 controls VFD-101". Validated like `connect`:
+ * both components exist and differ, the id is unused, and the same fact is not recorded twice.
+ */
+export function addAssociation(scene, association, options) {
+    const existing = scene.associations ?? [];
+    const index = existing.length;
+    const result = validateScene({ ...scene, associations: [...existing, association] }, options);
+    if (result.ok)
+        return result;
+    const error = result.errors.find((e) => e.path.startsWith(`associations[${index}]`)) ?? result.errors[0];
+    return { ok: false, error: { code: error.code, message: error.message } };
+}
+/** Removes one association. The list is dropped when it becomes empty, so the file is unchanged by an add and remove. */
+export function removeAssociation(scene, associationId) {
+    if (!scene.associations?.some((a) => a.id === associationId)) {
+        return { ok: false, error: { code: 'UNKNOWN_ASSOCIATION', message: `No association "${associationId}".` } };
+    }
+    return { ok: true, scene: withoutDanglingViews(withAssociations(scene, scene.associations.filter((a) => a.id !== associationId))) };
+}
+/** The scene with `associations`, leaving the field out when the list is empty. */
+function withAssociations(scene, associations) {
+    const { associations: _, ...rest } = scene;
+    return associations.length > 0 ? { ...rest, associations } : rest;
+}
+/**
+ * Removes a component with every connection and association that touches it, so no edge is left
+ * dangling; its children are freed, data sources and variables keep their description but lose the
+ * link, and its symbol and edge routes leave every view (ADR-0026).
+ */
 export function removeComponent(scene, instanceId) {
     if (!scene.components.some((c) => c.id === instanceId)) {
         return { ok: false, error: { code: 'UNKNOWN_INSTANCE', message: `No component "${instanceId}".` } };
@@ -36,7 +66,27 @@ export function removeComponent(scene, instanceId) {
         }),
         connections: scene.connections.filter((c) => c.from.instanceId !== instanceId && c.to.instanceId !== instanceId),
     };
-    return { ok: true, scene: withoutDanglingBindings(next) };
+    const kept = scene.associations ? withAssociations(next, scene.associations.filter((a) => a.from !== instanceId && a.to !== instanceId)) : next;
+    return { ok: true, scene: withoutDanglingViews(withoutDanglingBindings(unlinkAcquisition(kept, instanceId))) };
+}
+/**
+ * Clears a removed component's links from data sources (`deviceId`) and runtime variables
+ * (`componentId`), keeping the acquisition description itself (ADR-0024).
+ */
+function unlinkAcquisition(scene, instanceId) {
+    const dataSources = scene.dataSources?.map((s) => {
+        if (s.deviceId !== instanceId)
+            return s;
+        const { deviceId: _, ...rest } = s;
+        return rest;
+    });
+    const runtimeVariables = scene.runtimeVariables?.map((v) => {
+        if (v.componentId !== instanceId)
+            return v;
+        const { componentId: _, ...rest } = v;
+        return rest;
+    });
+    return { ...scene, ...(dataSources ? { dataSources } : {}), ...(runtimeVariables ? { runtimeVariables } : {}) };
 }
 /** Drops tag bindings whose component or connection no longer exists. Absent bindings stay absent. */
 function withoutDanglingBindings(scene) {
@@ -47,12 +97,147 @@ function withoutDanglingBindings(scene) {
     const tagBindings = scene.tagBindings.filter((b) => (b.kind === 'property' ? components.has(b.instanceId) : connections.has(b.connectionId)));
     return { ...scene, tagBindings };
 }
-export function connectionsOf(scene, instanceId) {
-    return scene.connections.filter((c) => c.from.instanceId === instanceId || c.to.instanceId === instanceId);
+/**
+ * Drops view symbols and routes whose component or edge no longer exists (ADR-0026). Layouts, views
+ * and the `views` field that become empty go too; a scene with nothing to drop is returned as is.
+ */
+function withoutDanglingViews(scene) {
+    if (!scene.views)
+        return scene;
+    const components = new Set(scene.components.map((c) => c.id));
+    const edges = new Set([...scene.connections.map((c) => c.id), ...(scene.associations ?? []).map((a) => a.id)]);
+    const keep = (record, known) => record && Object.fromEntries(Object.entries(record).filter(([id]) => known.has(id)));
+    let dropped = false;
+    const views = {};
+    for (const kind of viewKinds) {
+        const layout = scene.views[kind];
+        if (!layout)
+            continue;
+        const symbols = keep(layout.symbols, components), routes = keep(layout.routes, edges);
+        dropped ||= Object.keys(symbols ?? {}).length !== Object.keys(layout.symbols ?? {}).length || Object.keys(routes ?? {}).length !== Object.keys(layout.routes ?? {}).length;
+        const next = { ...(symbols && Object.keys(symbols).length > 0 ? { symbols } : {}), ...(routes && Object.keys(routes).length > 0 ? { routes } : {}) };
+        if (next.symbols || next.routes)
+            views[kind] = next;
+    }
+    if (!dropped)
+        return scene;
+    const { views: _, ...rest } = scene;
+    return Object.keys(views).length > 0 ? { ...rest, views } : rest;
+}
+/** A connection's domain: authored, else the from-port's kind; undefined when it cannot be resolved. */
+function domainOf(c, resolvePorts, byId) {
+    if (c.domain !== undefined)
+        return c.domain;
+    const owner = byId.get(c.from.instanceId);
+    return owner && resolvePorts?.(owner.type, owner.properties)?.find((p) => p.id === c.from.portId)?.kind;
+}
+/** Steps leaving each component under `filter`, in scene order: connections first, then associations. */
+function steps(scene, filter, associationsByDefault) {
+    const out = new Map(scene.components.map((c) => [c.id, []]));
+    const byId = new Map(scene.components.map((c) => [c.id, c]));
+    const direction = filter.direction ?? 'both';
+    const add = (step, a, b) => {
+        if (direction !== 'in')
+            out.get(a)?.push({ ...step, from: a, to: b, forward: true });
+        if (direction !== 'out')
+            out.get(b)?.push({ ...step, from: b, to: a, forward: false });
+    };
+    const relationshipOk = (r) => !filter.relationships || (r !== undefined && filter.relationships.includes(r));
+    if (filter.connections ?? true) {
+        for (const c of scene.connections) {
+            const domain = domainOf(c, filter.resolvePorts, byId);
+            if (filter.domains && (domain === undefined || !filter.domains.includes(domain)))
+                continue;
+            if (!relationshipOk(c.relationship))
+                continue;
+            add({ edge: 'connection', id: c.id, ...(domain ? { domain } : {}), ...(c.relationship ? { relationship: c.relationship } : {}) }, c.from.instanceId, c.to.instanceId);
+        }
+    }
+    if ((filter.associations ?? associationsByDefault) && !filter.domains) {
+        for (const a of scene.associations ?? []) {
+            if (!relationshipOk(a.relationship))
+                continue;
+            add({ edge: 'association', id: a.id, relationship: a.relationship }, a.from, a.to);
+        }
+    }
+    return out;
+}
+/** Components one followed edge away from `instanceId`, each once, in edge order. Empty for an unknown id. */
+export function neighbours(scene, instanceId, filter = {}) {
+    const seen = new Set();
+    for (const step of steps(scene, filter, true).get(instanceId) ?? [])
+        if (step.to !== instanceId)
+            seen.add(step.to);
+    return [...seen];
+}
+/**
+ * Every component reachable from `instanceId` through followed edges, breadth first, excluding
+ * `instanceId` itself. For example, with `{ relationships: ['controls', 'drives'], direction: 'out' }`
+ * from a PLC: the drives it controls and the motors they drive. Derived only from explicit edges.
+ */
+export function relatedComponents(scene, instanceId, filter = {}) {
+    const graph = steps(scene, filter, true);
+    if (!graph.has(instanceId))
+        return [];
+    return walkSteps(graph, instanceId).order.slice(1);
+}
+/**
+ * The shortest chain of followed edges from `fromId` to `toId` (fewest edges; ties go to scene
+ * order), or undefined when there is none. Empty when both ids are the same known component.
+ */
+export function pathBetween(scene, fromId, toId, filter = {}) {
+    const graph = steps(scene, filter, true);
+    if (!graph.has(fromId) || !graph.has(toId))
+        return undefined;
+    const { via } = walkSteps(graph, fromId);
+    if (fromId !== toId && !via.has(toId))
+        return undefined;
+    const path = [];
+    for (let at = toId; at !== fromId;) {
+        const step = via.get(at);
+        path.unshift(step);
+        at = step.from;
+    }
+    return path;
+}
+/** Breadth-first walk over steps: visit order and the step that first reached each component. */
+function walkSteps(graph, start) {
+    const order = [start];
+    const via = new Map();
+    const visited = new Set([start]);
+    for (let i = 0; i < order.length; i++) {
+        for (const step of graph.get(order[i]) ?? []) {
+            if (visited.has(step.to))
+                continue;
+            visited.add(step.to);
+            via.set(step.to, step);
+            order.push(step.to);
+        }
+    }
+    return { order, via };
+}
+/** Domains whose ports are joined physically (fluid, mechanical and the deprecated `electrical`, as `matesPhysically`): the filter for assemblies, which move parts that are bolted together. */
+export const physicalDomains = ['fluid', 'mechanical', 'electrical'];
+/** Connections touching `instanceId`, optionally only in some domains. Associations are separate (`scene.associations`). */
+export function connectionsOf(scene, instanceId, filter = {}) {
+    const keep = connectionMatcher(scene, filter);
+    return scene.connections.filter((c) => (c.from.instanceId === instanceId || c.to.instanceId === instanceId) && keep(c));
+}
+function connectionMatcher(scene, filter) {
+    if (!filter.domains)
+        return () => true;
+    const byId = new Map(scene.components.map((c) => [c.id, c]));
+    return (c) => {
+        const domain = domainOf(c, filter.resolvePorts, byId);
+        return domain !== undefined && filter.domains.includes(domain);
+    };
 }
-function adjacency(scene) {
+function adjacency(scene, filter = {}) {
     const neighbours = new Map(scene.components.map((c) => [c.id, []]));
+    const keep = connectionMatcher(scene, filter);
     for (const c of scene.connections) {
+        if (!keep(c))
+            continue;
         neighbours.get(c.from.instanceId)?.push(c.to.instanceId);
         neighbours.get(c.to.instanceId)?.push(c.from.instanceId);
     }
@@ -76,13 +261,13 @@ function walk(neighbours, start, visited) {
  * Component ids connected to `instanceId` through any path, ignoring edge direction, in
  * breadth-first order following scene connection order. Empty for an unknown id.
  */
-export function reachableComponents(scene, instanceId) {
-    const neighbours = adjacency(scene);
+export function reachableComponents(scene, instanceId, filter = {}) {
+    const neighbours = adjacency(scene, filter);
     return neighbours.has(instanceId) ? walk(neighbours, instanceId, new Set()) : [];
 }
 /** Disconnected networks, each in breadth-first order, ordered by their first component in the scene. */
-export function connectedGroups(scene) {
-    const neighbours = adjacency(scene);
+export function connectedGroups(scene, filter = {}) {
+    const neighbours = adjacency(scene, filter);
     const visited = new Set();
     const groups = [];
     for (const c of scene.components) {

package/dist/graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAA8D,MAAM,iBAAiB,CAAC;AAa5G;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,KAAiB,EAAE,UAA2B,EAAE,OAAqB;IAC3F,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC;IACvC,MAAM,MAAM,GAAG,aAAa,CAAC,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,UAAU,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACrG,IAAI,MAAM,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC;IAC7B,+FAA+F;IAC/F,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,eAAe,KAAK,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACxG,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;AAC5E,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAiB,EAAE,YAAoB;IAChE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,CAAC,EAAE,CAAC;QAC1D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,oBAAoB,EAAE,OAAO,EAAE,kBAAkB,YAAY,IAAI,EAAE,EAAE,CAAC;IAC3G,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,CAAC,EAAE,CAAC;IAC/F,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,uBAAuB,CAAC,IAAI,CAAC,EAAE,CAAC;AAC5D,CAAC;AAED,gHAAgH;AAChH,MAAM,UAAU,eAAe,CAAC,KAAiB,EAAE,UAAkB;IACnE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,EAAE,CAAC;QACvD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,kBAAkB,EAAE,OAAO,EAAE,iBAAiB,UAAU,IAAI,EAAE,EAAE,CAAC;IACtG,CAAC;IACD,MAAM,IAAI,GAAG;QACX,GAAG,KAAK;QACR,UAAU,EAAE,KAAK,CAAC,UAAU;aACzB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC;aAClC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,IAAI,CAAC,CAAC,QAAQ,KAAK,UAAU;gBAAE,OAAO,CAAC,CAAC;YACxC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QACJ,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,UAAU,KAAK,UAAU,CAAC;KACjH,CAAC;IACF,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,uBAAuB,CAAC,IAAI,CAAC,EAAE,CAAC;AAC5D,CAAC;AAED,sGAAsG;AACtG,SAAS,uBAAuB,CAAC,KAAiB;IAChD,IAAI,CAAC,KAAK,CAAC,WAAW;QAAE,OAAO,KAAK,CAAC;IACrC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9I,OAAO,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,CAAC;AACnC,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAiB,EAAE,UAAkB;IACjE,OAAO,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,UAAU,KAAK,UAAU,CAAC,CAAC;AAC7G,CAAC;AAED,SAAS,SAAS,CAAC,KAAiB;IAClC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAmB,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtF,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QAClC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QACzD,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,IAAI,CAAC,UAAiC,EAAE,KAAa,EAAE,OAAoB;IAClF,0GAA0G;IAC1G,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAiB,EAAE,UAAkB;IACvE,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IACpC,OAAO,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACnF,CAAC;AAED,yGAAyG;AACzG,MAAM,UAAU,eAAe,CAAC,KAAiB;IAC/C,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["import type { ScadaScene, SceneConnection } from './scene.js';\nimport { validateScene, type SceneValidationErrorCode, type SceneValidationOptions } from './validation.js';\n\nexport type GraphErrorCode = SceneValidationErrorCode | 'UNKNOWN_CONNECTION';\n\nexport interface GraphError {\n  code: GraphErrorCode;\n  message: string;\n}\n\nexport type GraphResult = { ok: true; scene: ScadaScene } | { ok: false; error: GraphError };\n\nexport type GraphOptions = Pick<SceneValidationOptions, 'resolvePorts' | 'resolveBindable' | 'validateProperties' | 'limits'>;\n\n/**\n * Adds one edge. The candidate scene goes through `validateScene`, so the same rules apply as on\n * load (known ports, compatibility, occupancy, no duplicates). The input scene must already be valid.\n */\nexport function connect(scene: ScadaScene, connection: SceneConnection, options: GraphOptions): GraphResult {\n  const index = scene.connections.length;\n  const result = validateScene({ ...scene, connections: [...scene.connections, connection] }, options);\n  if (result.ok) return result;\n  // Prefer an error about the new edge; anything else means the input scene was already invalid.\n  const error = result.errors.find((e) => e.path.startsWith(`connections[${index}]`)) ?? result.errors[0];\n  return { ok: false, error: { code: error.code, message: error.message } };\n}\n\nexport function disconnect(scene: ScadaScene, connectionId: string): GraphResult {\n  if (!scene.connections.some((c) => c.id === connectionId)) {\n    return { ok: false, error: { code: 'UNKNOWN_CONNECTION', message: `No connection \"${connectionId}\".` } };\n  }\n  const next = { ...scene, connections: scene.connections.filter((c) => c.id !== connectionId) };\n  return { ok: true, scene: withoutDanglingBindings(next) };\n}\n\n/** Removes a component with every edge that touches it, so no edge is left dangling; its children are freed. */\nexport function removeComponent(scene: ScadaScene, instanceId: string): GraphResult {\n  if (!scene.components.some((c) => c.id === instanceId)) {\n    return { ok: false, error: { code: 'UNKNOWN_INSTANCE', message: `No component \"${instanceId}\".` } };\n  }\n  const next = {\n    ...scene,\n    components: scene.components\n      .filter((c) => c.id !== instanceId)\n      .map((c) => {\n        if (c.parentId !== instanceId) return c;\n        const { parentId: _, ...free } = c;\n        return free;\n      }),\n    connections: scene.connections.filter((c) => c.from.instanceId !== instanceId && c.to.instanceId !== instanceId),\n  };\n  return { ok: true, scene: withoutDanglingBindings(next) };\n}\n\n/** Drops tag bindings whose component or connection no longer exists. Absent bindings stay absent. */\nfunction withoutDanglingBindings(scene: ScadaScene): ScadaScene {\n  if (!scene.tagBindings) return scene;\n  const components = new Set(scene.components.map((c) => c.id));\n  const connections = new Set(scene.connections.map((c) => c.id));\n  const tagBindings = scene.tagBindings.filter((b) => (b.kind === 'property' ? components.has(b.instanceId) : connections.has(b.connectionId)));\n  return { ...scene, tagBindings };\n}\n\nexport function connectionsOf(scene: ScadaScene, instanceId: string): SceneConnection[] {\n  return scene.connections.filter((c) => c.from.instanceId === instanceId || c.to.instanceId === instanceId);\n}\n\nfunction adjacency(scene: ScadaScene): Map<string, string[]> {\n  const neighbours = new Map<string, string[]>(scene.components.map((c) => [c.id, []]));\n  for (const c of scene.connections) {\n    neighbours.get(c.from.instanceId)?.push(c.to.instanceId);\n    neighbours.get(c.to.instanceId)?.push(c.from.instanceId);\n  }\n  return neighbours;\n}\n\nfunction walk(neighbours: Map<string, string[]>, start: string, visited: Set<string>): string[] {\n  // Iterative breadth-first search: cycles stop at visited nodes and long chains cannot overflow the stack.\n  const order = [start];\n  visited.add(start);\n  for (let i = 0; i < order.length; i++) {\n    for (const next of neighbours.get(order[i]) ?? []) {\n      if (!visited.has(next)) {\n        visited.add(next);\n        order.push(next);\n      }\n    }\n  }\n  return order;\n}\n\n/**\n * Component ids connected to `instanceId` through any path, ignoring edge direction, in\n * breadth-first order following scene connection order. Empty for an unknown id.\n */\nexport function reachableComponents(scene: ScadaScene, instanceId: string): string[] {\n  const neighbours = adjacency(scene);\n  return neighbours.has(instanceId) ? walk(neighbours, instanceId, new Set()) : [];\n}\n\n/** Disconnected networks, each in breadth-first order, ordered by their first component in the scene. */\nexport function connectedGroups(scene: ScadaScene): string[][] {\n  const neighbours = adjacency(scene);\n  const visited = new Set<string>();\n  const groups: string[][] = [];\n  for (const c of scene.components) {\n    if (!visited.has(c.id)) groups.push(walk(neighbours, c.id, visited));\n  }\n  return groups;\n}\n"]}
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAqM,MAAM,YAAY,CAAC;AAC1O,OAAO,EAAE,aAAa,EAA8D,MAAM,iBAAiB,CAAC;AAa5G;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,KAAiB,EAAE,UAA2B,EAAE,OAAqB;IAC3F,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC;IACvC,MAAM,MAAM,GAAG,aAAa,CAAC,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,UAAU,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACrG,IAAI,MAAM,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC;IAC7B,+FAA+F;IAC/F,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,eAAe,KAAK,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACxG,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;AAC5E,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAiB,EAAE,YAAoB;IAChE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,CAAC,EAAE,CAAC;QAC1D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,oBAAoB,EAAE,OAAO,EAAE,kBAAkB,YAAY,IAAI,EAAE,EAAE,CAAC;IAC3G,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,CAAC,EAAE,CAAC;IAC/F,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,oBAAoB,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;AAClF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAiB,EAAE,WAA6B,EAAE,OAAqB;IACpG,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC;IAC1C,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC9B,MAAM,MAAM,GAAG,aAAa,CAAC,EAAE,GAAG,KAAK,EAAE,YAAY,EAAE,CAAC,GAAG,QAAQ,EAAE,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC9F,IAAI,MAAM,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,gBAAgB,KAAK,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACzG,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;AAC5E,CAAC;AAED,yHAAyH;AACzH,MAAM,UAAU,iBAAiB,CAAC,KAAiB,EAAE,aAAqB;IACxE,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,CAAC;QAC7D,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,qBAAqB,EAAE,OAAO,EAAE,mBAAmB,aAAa,IAAI,EAAE,EAAE,CAAC;IAC9G,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,oBAAoB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;AACtI,CAAC;AAED,mFAAmF;AACnF,SAAS,gBAAgB,CAAC,KAAiB,EAAE,YAAgC;IAC3E,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC;IAC3C,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACpE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAiB,EAAE,UAAkB;IACnE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,EAAE,CAAC;QACvD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,kBAAkB,EAAE,OAAO,EAAE,iBAAiB,UAAU,IAAI,EAAE,EAAE,CAAC;IACtG,CAAC;IACD,MAAM,IAAI,GAAG;QACX,GAAG,KAAK;QACR,UAAU,EAAE,KAAK,CAAC,UAAU;aACzB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC;aAClC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,IAAI,CAAC,CAAC,QAAQ,KAAK,UAAU;gBAAE,OAAO,CAAC,CAAC;YACxC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QACJ,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,UAAU,KAAK,UAAU,CAAC;KACjH,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAChJ,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,oBAAoB,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AACjH,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,KAAiB,EAAE,UAAkB;IAC9D,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/C,IAAI,CAAC,CAAC,QAAQ,KAAK,UAAU;YAAE,OAAO,CAAC,CAAC;QACxC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IACH,MAAM,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACzD,IAAI,CAAC,CAAC,WAAW,KAAK,UAAU;YAAE,OAAO,CAAC,CAAC;QAC3C,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,KAAK,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAClH,CAAC;AAED,sGAAsG;AACtG,SAAS,uBAAuB,CAAC,KAAiB;IAChD,IAAI,CAAC,KAAK,CAAC,WAAW;QAAE,OAAO,KAAK,CAAC;IACrC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9I,OAAO,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,CAAC;AACnC,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,KAAiB;IAC7C,IAAI,CAAC,KAAK,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/G,MAAM,IAAI,GAAG,CAAI,MAAqC,EAAE,KAAkB,EAAE,EAAE,CAC5E,MAAM,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACtF,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAC3K,MAAM,IAAI,GAAe,EAAE,GAAG,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QACjK,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACtD,CAAC;IACD,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC;IACpC,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACnE,CAAC;AAmCD,wGAAwG;AACxG,SAAS,QAAQ,CAAC,CAAkB,EAAE,YAAyC,EAAE,IAAoC;IACnH,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC1C,OAAO,KAAK,IAAI,YAAY,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;AAC1G,CAAC;AAED,yGAAyG;AACzG,SAAS,KAAK,CAAC,KAAiB,EAAE,MAAmB,EAAE,qBAA8B;IACnF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAsB,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAClF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC;IAC7C,MAAM,GAAG,GAAG,CAAC,IAAgD,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;QACrF,IAAI,SAAS,KAAK,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QACrF,IAAI,SAAS,KAAK,KAAK;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;IACzF,CAAC,CAAC;IACF,MAAM,cAAc,GAAG,CAAC,CAA2B,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,aAAa,IAAI,CAAC,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACvI,IAAI,MAAM,CAAC,WAAW,IAAI,IAAI,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;YACtD,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBAAE,SAAS;YAC3F,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,YAAY,CAAC;gBAAE,SAAS;YAC9C,GAAG,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QACxK,CAAC;IACH,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,YAAY,IAAI,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACtE,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,YAAY,CAAC;gBAAE,SAAS;YAC9C,GAAG,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8GAA8G;AAC9G,MAAM,UAAU,UAAU,CAAC,KAAiB,EAAE,UAAkB,EAAE,SAAsB,EAAE;IACxF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE;QAAE,IAAI,IAAI,CAAC,EAAE,KAAK,UAAU;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnH,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAiB,EAAE,UAAkB,EAAE,SAAsB,EAAE;IAC/F,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAO,EAAE,CAAC;IACtC,OAAO,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,KAAiB,EAAE,MAAc,EAAE,IAAY,EAAE,SAAsB,EAAE;IACnG,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7D,MAAM,EAAE,GAAG,EAAE,GAAG,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACzC,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxD,MAAM,IAAI,GAAgB,EAAE,CAAC;IAC7B,KAAK,IAAI,EAAE,GAAG,IAAI,EAAE,EAAE,KAAK,MAAM,GAAI,CAAC;QACpC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC1B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,iGAAiG;AACjG,SAAS,SAAS,CAAC,KAA+B,EAAE,KAAa;IAC/D,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAqB,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AACxB,CAAC;AAKD,iMAAiM;AACjM,MAAM,CAAC,MAAM,eAAe,GAAwB,CAAC,OAAO,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;AAE1F,4HAA4H;AAC5H,MAAM,UAAU,aAAa,CAAC,KAAiB,EAAE,UAAkB,EAAE,SAA2B,EAAE;IAChG,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC9C,OAAO,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,UAAU,KAAK,UAAU,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1H,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAiB,EAAE,MAAwB;IACpE,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,OAAO,CAAC,CAAC,EAAE,EAAE;QACX,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACtD,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,OAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAClE,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,KAAiB,EAAE,SAA2B,EAAE;IACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAmB,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,SAAS;QACvB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QACzD,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,IAAI,CAAC,UAAiC,EAAE,KAAa,EAAE,OAAoB;IAClF,0GAA0G;IAC1G,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAiB,EAAE,UAAkB,EAAE,SAA2B,EAAE;IACtG,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC5C,OAAO,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACnF,CAAC;AAED,yGAAyG;AACzG,MAAM,UAAU,eAAe,CAAC,KAAiB,EAAE,SAA2B,EAAE;IAC9E,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["import { viewKinds, type ComponentInstance, type ComponentType, type ConnectionPort, type PortKind, type Relationship, type ScadaScene, type SceneAssociation, type SceneConnection, type SceneViews, type ViewLayout } from './scene.js';\nimport { validateScene, type SceneValidationErrorCode, type SceneValidationOptions } from './validation.js';\n\nexport type GraphErrorCode = SceneValidationErrorCode | 'UNKNOWN_CONNECTION' | 'UNKNOWN_ASSOCIATION';\n\nexport interface GraphError {\n  code: GraphErrorCode;\n  message: string;\n}\n\nexport type GraphResult = { ok: true; scene: ScadaScene } | { ok: false; error: GraphError };\n\nexport type GraphOptions = Pick<SceneValidationOptions, 'resolvePorts' | 'resolveType' | 'resolveBindable' | 'validateProperties' | 'limits'>;\n\n/**\n * Adds one edge. The candidate scene goes through `validateScene`, so the same rules apply as on\n * load (known ports, compatibility, occupancy, no duplicates). The input scene must already be valid.\n */\nexport function connect(scene: ScadaScene, connection: SceneConnection, options: GraphOptions): GraphResult {\n  const index = scene.connections.length;\n  const result = validateScene({ ...scene, connections: [...scene.connections, connection] }, options);\n  if (result.ok) return result;\n  // Prefer an error about the new edge; anything else means the input scene was already invalid.\n  const error = result.errors.find((e) => e.path.startsWith(`connections[${index}]`)) ?? result.errors[0];\n  return { ok: false, error: { code: error.code, message: error.message } };\n}\n\nexport function disconnect(scene: ScadaScene, connectionId: string): GraphResult {\n  if (!scene.connections.some((c) => c.id === connectionId)) {\n    return { ok: false, error: { code: 'UNKNOWN_CONNECTION', message: `No connection \"${connectionId}\".` } };\n  }\n  const next = { ...scene, connections: scene.connections.filter((c) => c.id !== connectionId) };\n  return { ok: true, scene: withoutDanglingViews(withoutDanglingBindings(next)) };\n}\n\n/**\n * Adds one association (ADR-0023), such as \"PLC-01 controls VFD-101\". Validated like `connect`:\n * both components exist and differ, the id is unused, and the same fact is not recorded twice.\n */\nexport function addAssociation(scene: ScadaScene, association: SceneAssociation, options: GraphOptions): GraphResult {\n  const existing = scene.associations ?? [];\n  const index = existing.length;\n  const result = validateScene({ ...scene, associations: [...existing, association] }, options);\n  if (result.ok) return result;\n  const error = result.errors.find((e) => e.path.startsWith(`associations[${index}]`)) ?? result.errors[0];\n  return { ok: false, error: { code: error.code, message: error.message } };\n}\n\n/** Removes one association. The list is dropped when it becomes empty, so the file is unchanged by an add and remove. */\nexport function removeAssociation(scene: ScadaScene, associationId: string): GraphResult {\n  if (!scene.associations?.some((a) => a.id === associationId)) {\n    return { ok: false, error: { code: 'UNKNOWN_ASSOCIATION', message: `No association \"${associationId}\".` } };\n  }\n  return { ok: true, scene: withoutDanglingViews(withAssociations(scene, scene.associations.filter((a) => a.id !== associationId))) };\n}\n\n/** The scene with `associations`, leaving the field out when the list is empty. */\nfunction withAssociations(scene: ScadaScene, associations: SceneAssociation[]): ScadaScene {\n  const { associations: _, ...rest } = scene;\n  return associations.length > 0 ? { ...rest, associations } : rest;\n}\n\n/**\n * Removes a component with every connection and association that touches it, so no edge is left\n * dangling; its children are freed, data sources and variables keep their description but lose the\n * link, and its symbol and edge routes leave every view (ADR-0026).\n */\nexport function removeComponent(scene: ScadaScene, instanceId: string): GraphResult {\n  if (!scene.components.some((c) => c.id === instanceId)) {\n    return { ok: false, error: { code: 'UNKNOWN_INSTANCE', message: `No component \"${instanceId}\".` } };\n  }\n  const next = {\n    ...scene,\n    components: scene.components\n      .filter((c) => c.id !== instanceId)\n      .map((c) => {\n        if (c.parentId !== instanceId) return c;\n        const { parentId: _, ...free } = c;\n        return free;\n      }),\n    connections: scene.connections.filter((c) => c.from.instanceId !== instanceId && c.to.instanceId !== instanceId),\n  };\n  const kept = scene.associations ? withAssociations(next, scene.associations.filter((a) => a.from !== instanceId && a.to !== instanceId)) : next;\n  return { ok: true, scene: withoutDanglingViews(withoutDanglingBindings(unlinkAcquisition(kept, instanceId))) };\n}\n\n/**\n * Clears a removed component's links from data sources (`deviceId`) and runtime variables\n * (`componentId`), keeping the acquisition description itself (ADR-0024).\n */\nfunction unlinkAcquisition(scene: ScadaScene, instanceId: string): ScadaScene {\n  const dataSources = scene.dataSources?.map((s) => {\n    if (s.deviceId !== instanceId) return s;\n    const { deviceId: _, ...rest } = s;\n    return rest;\n  });\n  const runtimeVariables = scene.runtimeVariables?.map((v) => {\n    if (v.componentId !== instanceId) return v;\n    const { componentId: _, ...rest } = v;\n    return rest;\n  });\n  return { ...scene, ...(dataSources ? { dataSources } : {}), ...(runtimeVariables ? { runtimeVariables } : {}) };\n}\n\n/** Drops tag bindings whose component or connection no longer exists. Absent bindings stay absent. */\nfunction withoutDanglingBindings(scene: ScadaScene): ScadaScene {\n  if (!scene.tagBindings) return scene;\n  const components = new Set(scene.components.map((c) => c.id));\n  const connections = new Set(scene.connections.map((c) => c.id));\n  const tagBindings = scene.tagBindings.filter((b) => (b.kind === 'property' ? components.has(b.instanceId) : connections.has(b.connectionId)));\n  return { ...scene, tagBindings };\n}\n\n/**\n * Drops view symbols and routes whose component or edge no longer exists (ADR-0026). Layouts, views\n * and the `views` field that become empty go too; a scene with nothing to drop is returned as is.\n */\nfunction withoutDanglingViews(scene: ScadaScene): ScadaScene {\n  if (!scene.views) return scene;\n  const components = new Set(scene.components.map((c) => c.id));\n  const edges = new Set([...scene.connections.map((c) => c.id), ...(scene.associations ?? []).map((a) => a.id)]);\n  const keep = <T>(record: Record<string, T> | undefined, known: Set<string>) =>\n    record && Object.fromEntries(Object.entries(record).filter(([id]) => known.has(id)));\n  let dropped = false;\n  const views: SceneViews = {};\n  for (const kind of viewKinds) {\n    const layout = scene.views[kind];\n    if (!layout) continue;\n    const symbols = keep(layout.symbols, components), routes = keep(layout.routes, edges);\n    dropped ||= Object.keys(symbols ?? {}).length !== Object.keys(layout.symbols ?? {}).length || Object.keys(routes ?? {}).length !== Object.keys(layout.routes ?? {}).length;\n    const next: ViewLayout = { ...(symbols && Object.keys(symbols).length > 0 ? { symbols } : {}), ...(routes && Object.keys(routes).length > 0 ? { routes } : {}) };\n    if (next.symbols || next.routes) views[kind] = next;\n  }\n  if (!dropped) return scene;\n  const { views: _, ...rest } = scene;\n  return Object.keys(views).length > 0 ? { ...rest, views } : rest;\n}\n\n/**\n * Which edges a graph query follows (ADR-0023). Everything is optional; an empty filter follows\n * every connection and association in both directions.\n */\nexport interface GraphFilter {\n  /** Connection domains to follow. A connection's domain is its `domain` field, else its from-port's kind via `resolvePorts`. Associations have no domain and are skipped when this is set. */\n  domains?: readonly PortKind[];\n  /** Relationships to follow; edges without a relationship are skipped when this is set. */\n  relationships?: readonly Relationship[];\n  /** Follow connections. Default true. */\n  connections?: boolean;\n  /** Follow associations. Default true for `neighbours`, `relatedComponents` and `pathBetween`. */\n  associations?: boolean;\n  /** `out` follows edges from→to, `in` to→from, `both` (default) either way. */\n  direction?: 'out' | 'in' | 'both';\n  /** Resolves a connection's domain when it has no `domain` field. */\n  resolvePorts?: (type: ComponentType, properties?: ComponentInstance['properties']) => readonly ConnectionPort[] | undefined;\n}\n\n/** One edge walked by a query, from one component to the next. */\nexport interface GraphStep {\n  edge: 'connection' | 'association';\n  /** The connection or association id. */\n  id: string;\n  /** Component walked from and to. */\n  from: string;\n  to: string;\n  /** True when walked in the edge's own from→to direction. */\n  forward: boolean;\n  domain?: PortKind;\n  relationship?: Relationship;\n}\n\n/** A connection's domain: authored, else the from-port's kind; undefined when it cannot be resolved. */\nfunction domainOf(c: SceneConnection, resolvePorts: GraphFilter['resolvePorts'], byId: Map<string, ComponentInstance>): PortKind | undefined {\n  if (c.domain !== undefined) return c.domain;\n  const owner = byId.get(c.from.instanceId);\n  return owner && resolvePorts?.(owner.type, owner.properties)?.find((p) => p.id === c.from.portId)?.kind;\n}\n\n/** Steps leaving each component under `filter`, in scene order: connections first, then associations. */\nfunction steps(scene: ScadaScene, filter: GraphFilter, associationsByDefault: boolean): Map<string, GraphStep[]> {\n  const out = new Map<string, GraphStep[]>(scene.components.map((c) => [c.id, []]));\n  const byId = new Map(scene.components.map((c) => [c.id, c]));\n  const direction = filter.direction ?? 'both';\n  const add = (step: Omit<GraphStep, 'from' | 'to' | 'forward'>, a: string, b: string) => {\n    if (direction !== 'in') out.get(a)?.push({ ...step, from: a, to: b, forward: true });\n    if (direction !== 'out') out.get(b)?.push({ ...step, from: b, to: a, forward: false });\n  };\n  const relationshipOk = (r: Relationship | undefined) => !filter.relationships || (r !== undefined && filter.relationships.includes(r));\n  if (filter.connections ?? true) {\n    for (const c of scene.connections) {\n      const domain = domainOf(c, filter.resolvePorts, byId);\n      if (filter.domains && (domain === undefined || !filter.domains.includes(domain))) continue;\n      if (!relationshipOk(c.relationship)) continue;\n      add({ edge: 'connection', id: c.id, ...(domain ? { domain } : {}), ...(c.relationship ? { relationship: c.relationship } : {}) }, c.from.instanceId, c.to.instanceId);\n    }\n  }\n  if ((filter.associations ?? associationsByDefault) && !filter.domains) {\n    for (const a of scene.associations ?? []) {\n      if (!relationshipOk(a.relationship)) continue;\n      add({ edge: 'association', id: a.id, relationship: a.relationship }, a.from, a.to);\n    }\n  }\n  return out;\n}\n\n/** Components one followed edge away from `instanceId`, each once, in edge order. Empty for an unknown id. */\nexport function neighbours(scene: ScadaScene, instanceId: string, filter: GraphFilter = {}): string[] {\n  const seen = new Set<string>();\n  for (const step of steps(scene, filter, true).get(instanceId) ?? []) if (step.to !== instanceId) seen.add(step.to);\n  return [...seen];\n}\n\n/**\n * Every component reachable from `instanceId` through followed edges, breadth first, excluding\n * `instanceId` itself. For example, with `{ relationships: ['controls', 'drives'], direction: 'out' }`\n * from a PLC: the drives it controls and the motors they drive. Derived only from explicit edges.\n */\nexport function relatedComponents(scene: ScadaScene, instanceId: string, filter: GraphFilter = {}): string[] {\n  const graph = steps(scene, filter, true);\n  if (!graph.has(instanceId)) return [];\n  return walkSteps(graph, instanceId).order.slice(1);\n}\n\n/**\n * The shortest chain of followed edges from `fromId` to `toId` (fewest edges; ties go to scene\n * order), or undefined when there is none. Empty when both ids are the same known component.\n */\nexport function pathBetween(scene: ScadaScene, fromId: string, toId: string, filter: GraphFilter = {}): GraphStep[] | undefined {\n  const graph = steps(scene, filter, true);\n  if (!graph.has(fromId) || !graph.has(toId)) return undefined;\n  const { via } = walkSteps(graph, fromId);\n  if (fromId !== toId && !via.has(toId)) return undefined;\n  const path: GraphStep[] = [];\n  for (let at = toId; at !== fromId; ) {\n    const step = via.get(at)!;\n    path.unshift(step);\n    at = step.from;\n  }\n  return path;\n}\n\n/** Breadth-first walk over steps: visit order and the step that first reached each component. */\nfunction walkSteps(graph: Map<string, GraphStep[]>, start: string): { order: string[]; via: Map<string, GraphStep> } {\n  const order = [start];\n  const via = new Map<string, GraphStep>();\n  const visited = new Set([start]);\n  for (let i = 0; i < order.length; i++) {\n    for (const step of graph.get(order[i]) ?? []) {\n      if (visited.has(step.to)) continue;\n      visited.add(step.to);\n      via.set(step.to, step);\n      order.push(step.to);\n    }\n  }\n  return { order, via };\n}\n\n/** Connection filter for the older helpers: optional domains, resolved like `GraphFilter`. Associations are never followed. */\nexport type ConnectionFilter = Pick<GraphFilter, 'domains' | 'resolvePorts'>;\n\n/** Domains whose ports are joined physically (fluid, mechanical and the deprecated `electrical`, as `matesPhysically`): the filter for assemblies, which move parts that are bolted together. */\nexport const physicalDomains: readonly PortKind[] = ['fluid', 'mechanical', 'electrical'];\n\n/** Connections touching `instanceId`, optionally only in some domains. Associations are separate (`scene.associations`). */\nexport function connectionsOf(scene: ScadaScene, instanceId: string, filter: ConnectionFilter = {}): SceneConnection[] {\n  const keep = connectionMatcher(scene, filter);\n  return scene.connections.filter((c) => (c.from.instanceId === instanceId || c.to.instanceId === instanceId) && keep(c));\n}\n\nfunction connectionMatcher(scene: ScadaScene, filter: ConnectionFilter): (c: SceneConnection) => boolean {\n  if (!filter.domains) return () => true;\n  const byId = new Map(scene.components.map((c) => [c.id, c]));\n  return (c) => {\n    const domain = domainOf(c, filter.resolvePorts, byId);\n    return domain !== undefined && filter.domains!.includes(domain);\n  };\n}\n\nfunction adjacency(scene: ScadaScene, filter: ConnectionFilter = {}): Map<string, string[]> {\n  const neighbours = new Map<string, string[]>(scene.components.map((c) => [c.id, []]));\n  const keep = connectionMatcher(scene, filter);\n  for (const c of scene.connections) {\n    if (!keep(c)) continue;\n    neighbours.get(c.from.instanceId)?.push(c.to.instanceId);\n    neighbours.get(c.to.instanceId)?.push(c.from.instanceId);\n  }\n  return neighbours;\n}\n\nfunction walk(neighbours: Map<string, string[]>, start: string, visited: Set<string>): string[] {\n  // Iterative breadth-first search: cycles stop at visited nodes and long chains cannot overflow the stack.\n  const order = [start];\n  visited.add(start);\n  for (let i = 0; i < order.length; i++) {\n    for (const next of neighbours.get(order[i]) ?? []) {\n      if (!visited.has(next)) {\n        visited.add(next);\n        order.push(next);\n      }\n    }\n  }\n  return order;\n}\n\n/**\n * Component ids connected to `instanceId` through any path, ignoring edge direction, in\n * breadth-first order following scene connection order. Empty for an unknown id.\n */\nexport function reachableComponents(scene: ScadaScene, instanceId: string, filter: ConnectionFilter = {}): string[] {\n  const neighbours = adjacency(scene, filter);\n  return neighbours.has(instanceId) ? walk(neighbours, instanceId, new Set()) : [];\n}\n\n/** Disconnected networks, each in breadth-first order, ordered by their first component in the scene. */\nexport function connectedGroups(scene: ScadaScene, filter: ConnectionFilter = {}): string[][] {\n  const neighbours = adjacency(scene, filter);\n  const visited = new Set<string>();\n  const groups: string[][] = [];\n  for (const c of scene.components) {\n    if (!visited.has(c.id)) groups.push(walk(neighbours, c.id, visited));\n  }\n  return groups;\n}\n"]}