iobroker.javascript 10.2.5 → 10.3.0

package/build/lib/fb/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/lib/fb/graph.ts"],"names":[],"mappings":";;;AAqCA,kCASC;AAGD,wCAMC;AAGD,sCASC;AAED,8BAYC;AAGD,wCAOC;AAED,gCAYC;AAQD,oCAEC;AAGD,4BAYC;AAMD,kCA4BC;AAGD,wCAmEC;AAMD,gCAiBC;AAGD,kCAQC;AAED,wCAEC;AAhRD,uCAAwC;AACxC,mCAYiB;AAEjB,yEAAyE;AAC5D,QAAA,eAAe,GAAG,SAAS,CAAC;AAE5B,QAAA,mBAAmB,GAAG,GAAG,CAAC;AAC1B,QAAA,eAAe,GAAG,EAAE,CAAC;AACrB,QAAA,eAAe,GAAG,KAAK,CAAC;AAErC,oGAAoG;AACvF,QAAA,aAAa,GAAG,0BAA0B,CAAC;AAExD,MAAM,YAAY,GAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;AAY/E,SAAgB,WAAW;IACvB,OAAO;QACH,MAAM,EAAE,iBAAS;QACjB,OAAO,EAAE,0BAAkB;QAC3B,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,2BAAmB,EAAE;QAChD,MAAM,EAAE,EAAE;QACV,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE,EAAE;KACf,CAAC;AACN,CAAC;AAED,8CAA8C;AAC9C,SAAgB,cAAc,CAAC,KAAc,EAAE,IAAe,EAAE,GAAgB;IAC5E,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;QACzG,OAAO,YAAY,CAAC,QAAQ,CAAC,KAAqB,CAAC,CAAC,CAAC,CAAE,KAAsB,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3F,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,8CAA8C;AAC9C,SAAgB,aAAa,CAAC,KAAc,EAAE,GAAe;IACzD,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC;QAClB,OAAO,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3C,OAAO,IAAI,CAAC,GAAG,CACX,GAAG,CAAC,UAAU,CAAC,GAAG,EAClB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAChG,CAAC;AACN,CAAC;AAED,SAAgB,SAAS,CAAC,KAAc,EAAE,GAAG,GAAG,IAAA,qBAAW,EAAC,KAAK,CAAC,IAAI,CAAC;IACnE,IAAI,CAAC,GAAG,EAAE,CAAC;QACP,OAAO,EAAE,CAAC;IACd,CAAC;IACD,MAAM,MAAM,GAAY,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACxG,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QACjB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,CAAC;QACxG,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,kEAAkE;AAClE,SAAgB,cAAc,CAAC,KAAc,EAAE,GAAe;IAC1D,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC;QACzB,OAAO,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC;IAC9B,CAAC;IACD,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,iBAAiB,CAAC;IAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC1F,CAAC;AAED,SAAgB,UAAU,CAAC,KAAc,EAAE,GAAG,GAAG,IAAA,qBAAW,EAAC,KAAK,CAAC,IAAI,CAAC;IACpE,IAAI,CAAC,GAAG,EAAE,CAAC;QACP,OAAO,EAAE,CAAC;IACd,CAAC;IACD,MAAM,OAAO,GAAY,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1G,IAAI,GAAG,CAAC,iBAAiB,EAAE,CAAC;QACxB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,iBAAiB,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,IAA0B,EAAE,EAAwB;IAC7E,OAAO,EAAE,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,EAAE,KAAK,MAAM,CAAC,CAAC;AAC9F,CAAC;AAED,oDAAoD;AACpD,SAAgB,QAAQ,CAAC,MAAc,EAAE,IAAsB;IAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC5B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACrB,IAAI,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9C,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;gBACjC,GAAG,GAAG,CAAC,CAAC;YACZ,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,GAAG,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,IAAY,EAAE,GAAqB,EAAE,KAAc;IAC3E,MAAM,GAAG,GAAG,IAAA,qBAAW,EAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAChD,MAAM,EAAE,GAAG,QAAQ,CACf,GAAG,EACH,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CACtC,CAAC;IACF,gEAAgE;IAChE,MAAM,IAAI,GAAG,QAAQ,CACjB,GAAG,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAClE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CACxC,CAAC;IACF,MAAM,KAAK,GAAY,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;IAC/C,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE;QACzB,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAC9B,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;QACrC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,IAAI,GAAG,EAAE,UAAU,EAAE,CAAC;QAClB,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;IAC/D,CAAC;IACD,IAAI,GAAG,EAAE,iBAAiB,EAAE,CAAC;QACzB,MAAM,CAAC,OAAO,GAAG,GAAG,CAAC,iBAAiB,CAAC,KAAK,IAAI,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC;IAC9E,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IAC1B,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,yEAAyE;AACzE,SAAgB,cAAc,CAAC,IAAyC;IACpE,MAAM,KAAK,GAAG,WAAW,EAAE,CAAC;IAC5B,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QACpC,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,KAAK,CAAC,MAAM,GAAG,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAS,CAAC;IACzE,KAAK,CAAC,OAAO,GAAG,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,0BAAkB,CAAC;IACrF,IAAI,IAAI,CAAC,KAAK,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC/C,KAAK,CAAC,KAAK,GAAG;YACV,IAAI,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM;YACtF,EAAE,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,2BAAmB;SAC9E,CAAC;IACN,CAAC;IACD,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACjH,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACzB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;QACnC,CAAC,CAAC,IAAI,CAAC,KAAK;aACL,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC1E,GAAG,CAAC,IAAI,CAAC,EAAE;YACR,MAAM,KAAK,GAAW,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;YACpE,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACtB,CAAC;YACD,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtD,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACpC,CAAC;YACD,OAAO,KAAK,CAAC;QACjB,CAAC,CAAC;QACR,CAAC,CAAC,EAAE,CAAC;IACT,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAElG,MAAM,IAAI,GAAG,CAAC,KAAuC,EAAsB,EAAE,CACzE,KAAK,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;QACrE,CAAC,CAAC;YACI,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,OAAO,EAAE,OAAO,KAAK,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9D,GAAG,CAAC,OAAO,KAAK,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvF;QACH,CAAC,CAAC,IAAI,CAAC;IAEf,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;IACxB,CAAC;IACD,IAAI,IAAI,CAAC,UAAU,IAAI,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;QACzD,MAAM,UAAU,GAAgC,EAAE,CAAC;QACnD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACnD,gEAAgE;gBAChE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnF,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YACrD,CAAC;QACL,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,EAAE,CAAC;YACjC,KAAK,CAAC,UAAU,GAAG,UAAU,CAAC;QAClC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CAAC,MAAiC;IACxD,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QAClB,OAAO,WAAW,EAAE,CAAC;IACzB,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,uBAAe,CAAC,CAAC;IAChD,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;QACtD,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,MAAM,IAAI,GAAG,MAAM;SACd,SAAS,CAAC,GAAG,GAAG,uBAAe,CAAC,MAAM,CAAC;SACvC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACd,IAAI,EAAE,CAAC;IACZ,IAAI,CAAC;QACD,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAqB,CAAC,CAAC;IAChE,CAAC;IAAC,MAAM,CAAC;QACL,OAAO,IAAI,CAAC;IAChB,CAAC;AACL,CAAC;AAED,0EAA0E;AAC1E,SAAgB,WAAW,CAAC,MAAiC;IACzD,IAAI,CAAC,MAAM,EAAE,CAAC;QACV,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,gEAAgE;IAChE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,uBAAe,CAAC,CAAC;AAClE,CAAC;AAED,SAAgB,cAAc,CAAC,KAAc;IACzC,OAAO,GAAG,uBAAe,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;AACxD,CAAC","sourcesContent":["import { getBlockDef } from './library';\nimport {\n    FB_FORMAT,\n    FB_RUNTIME_VERSION,\n    type FbBlock,\n    type FbBlockDef,\n    type FbBlockInfo,\n    type FbGraph,\n    type FbLink,\n    type FbUserBlock,\n    type FbPinType,\n    type FbSignalType,\n    type FbValue,\n} from './types';\n\n/** The last line of the script source holds the graph: `//#fbd:{...}` */\nexport const FB_GRAPH_MARKER = '//#fbd:';\n\nexport const FB_CYCLE_DEFAULT_MS = 200;\nexport const FB_CYCLE_MIN_MS = 50;\nexport const FB_CYCLE_MAX_MS = 10000;\n\n/** IDs end up in the generated code (`I.b7`, `S['b7.Q']`), so they are restricted to identifiers */\nexport const FB_ID_PATTERN = /^[A-Za-z_][A-Za-z0-9_]*$/;\n\nconst SIGNAL_TYPES: FbSignalType[] = ['BOOL', 'INT', 'REAL', 'TIME', 'STRING'];\n\n/** A pin of a concrete block: extensible inputs are expanded and parameter types resolved */\nexport interface FbPin {\n    id: string;\n    /** `ANY` only for inputs that take every type */\n    type: FbSignalType | 'ANY';\n    param?: boolean;\n    default?: FbValue;\n    clock?: boolean;\n}\n\nexport function createGraph(): FbGraph {\n    return {\n        format: FB_FORMAT,\n        runtime: FB_RUNTIME_VERSION,\n        cycle: { mode: 'auto', ms: FB_CYCLE_DEFAULT_MS },\n        blocks: [],\n        links: [],\n        comments: [],\n    };\n}\n\n/** The signal type a pin has in this block */\nexport function resolvePinType(block: FbBlock, type: FbPinType, def?: FbBlockDef): FbSignalType | 'ANY' {\n    if (typeof type === 'object') {\n        const value = block.params?.[type.param] ?? def?.params?.find(param => param.id === type.param)?.default;\n        return SIGNAL_TYPES.includes(value as FbSignalType) ? (value as FbSignalType) : 'REAL';\n    }\n    return type;\n}\n\n/** Number of inputs of an extensible block */\nexport function getInputCount(block: FbBlock, def: FbBlockDef): number {\n    if (!def.extensible) {\n        return def.inputs.length;\n    }\n    const count = Number(block.params?.inputs);\n    return Math.max(\n        def.extensible.min,\n        Math.min(def.extensible.max, Math.round(Number.isFinite(count) ? count : def.extensible.min)),\n    );\n}\n\nexport function getInputs(block: FbBlock, def = getBlockDef(block.type)): FbPin[] {\n    if (!def) {\n        return [];\n    }\n    const inputs: FbPin[] = def.inputs.map(pin => ({ ...pin, type: resolvePinType(block, pin.type, def) }));\n    if (def.extensible) {\n        const { prefix, type, default: defaultValue } = def.extensible;\n        for (let i = 1; i <= getInputCount(block, def); i++) {\n            inputs.push({ id: `${prefix}${i}`, type: resolvePinType(block, type, def), default: defaultValue });\n        }\n    }\n    return inputs;\n}\n\n/** Number of outputs of a block with a variable number of them */\nexport function getOutputCount(block: FbBlock, def: FbBlockDef): number {\n    if (!def.extensibleOutputs) {\n        return def.outputs.length;\n    }\n    const { min, max } = def.extensibleOutputs;\n    const count = Number(block.params?.outputs);\n    return Math.max(min, Math.min(max, Math.round(Number.isFinite(count) ? count : min)));\n}\n\nexport function getOutputs(block: FbBlock, def = getBlockDef(block.type)): FbPin[] {\n    if (!def) {\n        return [];\n    }\n    const outputs: FbPin[] = def.outputs.map(pin => ({ ...pin, type: resolvePinType(block, pin.type, def) }));\n    if (def.extensibleOutputs) {\n        const { prefix, type } = def.extensibleOutputs;\n        for (let i = 1; i <= getOutputCount(block, def); i++) {\n            outputs.push({ id: `${prefix}${i}`, type: resolvePinType(block, type, def) });\n        }\n    }\n    return outputs;\n}\n\n/**\n * Whether an output of type `from` may drive an input of type `to`.\n *\n * Only widening happens by itself (INT to REAL); everything else needs a block that converts. An\n * output of the type ANY - of a JS block, whose code decides - goes anywhere.\n */\nexport function isCompatible(from: FbSignalType | 'ANY', to: FbSignalType | 'ANY'): boolean {\n    return to === 'ANY' || from === 'ANY' || from === to || (from === 'INT' && to === 'REAL');\n}\n\n/** A new ID that is not in `used`: `<prefix><n>` */\nexport function createId(prefix: string, used: Iterable<string>): string {\n    const taken = new Set(used);\n    let max = 0;\n    for (const id of taken) {\n        if (id.startsWith(prefix)) {\n            const n = Number(id.substring(prefix.length));\n            if (Number.isInteger(n) && n > max) {\n                max = n;\n            }\n        }\n    }\n    return `${prefix}${max + 1}`;\n}\n\n/**\n * A new block of a type, with the parameters at their defaults. A user block must be in\n * `graph.userBlocks` already.\n */\nexport function createBlock(type: string, pos: [number, number], graph: FbGraph): FbBlock {\n    const def = getBlockDef(type, graph.userBlocks);\n    const id = createId(\n        'b',\n        graph.blocks.map(block => block.id),\n    );\n    // a user block is named after its name, not after `@userFb/...`\n    const name = createId(\n        `${def?.user ? def.user.name.trim().replace(/\\s+/g, '_') : type}_`,\n        graph.blocks.map(block => block.name),\n    );\n    const block: FbBlock = { id, type, name, pos };\n    const params: Record<string, FbValue> = {};\n    def?.params?.forEach(param => {\n        if (param.default !== undefined) {\n            params[param.id] = param.default;\n        }\n    });\n    if (def?.extensible) {\n        params.inputs = def.extensible.count ?? def.extensible.min;\n    }\n    if (def?.extensibleOutputs) {\n        params.outputs = def.extensibleOutputs.count ?? def.extensibleOutputs.min;\n    }\n    if (Object.keys(params).length) {\n        block.params = params;\n    }\n    return block;\n}\n\n/** Brings a parsed graph into shape: missing parts get their defaults */\nexport function normalizeGraph(data: Partial<FbGraph> | null | undefined): FbGraph {\n    const graph = createGraph();\n    if (!data || typeof data !== 'object') {\n        return graph;\n    }\n    graph.format = typeof data.format === 'number' ? data.format : FB_FORMAT;\n    graph.runtime = typeof data.runtime === 'string' ? data.runtime : FB_RUNTIME_VERSION;\n    if (data.cycle && typeof data.cycle === 'object') {\n        graph.cycle = {\n            mode: ['auto', 'cyclic', 'event'].includes(data.cycle.mode) ? data.cycle.mode : 'auto',\n            ms: typeof data.cycle.ms === 'number' ? data.cycle.ms : FB_CYCLE_DEFAULT_MS,\n        };\n    }\n    graph.blocks = Array.isArray(data.blocks) ? data.blocks.filter(block => block && typeof block === 'object') : [];\n    graph.blocks.forEach(block => {\n        if (!Array.isArray(block.pos) || block.pos.length !== 2) {\n            block.pos = [0, 0];\n        }\n        if (typeof block.name !== 'string') {\n            block.name = String(block.id);\n        }\n    });\n    graph.links = Array.isArray(data.links)\n        ? data.links\n              .filter(link => link && Array.isArray(link.from) && Array.isArray(link.to))\n              .map(link => {\n                  const clean: FbLink = { id: link.id, from: link.from, to: link.to };\n                  if (link.mark === true) {\n                      clean.mark = true;\n                  }\n                  if (typeof link.label === 'string' && link.label.trim()) {\n                      clean.label = link.label.trim();\n                  }\n                  return clean;\n              })\n        : [];\n    graph.comments = Array.isArray(data.comments) ? data.comments.filter(comment => comment?.id) : [];\n\n    const info = (value: Partial<FbBlockInfo> | undefined): FbBlockInfo | null =>\n        value && typeof value.type === 'string' && typeof value.name === 'string'\n            ? {\n                  type: value.type,\n                  name: value.name,\n                  version: typeof value.version === 'number' ? value.version : 1,\n                  ...(typeof value.description === 'string' ? { description: value.description } : {}),\n              }\n            : null;\n\n    const block = info(data.block);\n    if (block) {\n        graph.block = block;\n    }\n    if (data.userBlocks && typeof data.userBlocks === 'object') {\n        const userBlocks: Record<string, FbUserBlock> = {};\n        for (const [type, user] of Object.entries(data.userBlocks)) {\n            const userInfo = info(user);\n            if (userInfo && userInfo.type === type && user.graph) {\n                // the copies carry neither a block info nor copies of their own\n                const { block: _block, userBlocks: _inner, ...inner } = normalizeGraph(user.graph);\n                userBlocks[type] = { ...userInfo, graph: inner };\n            }\n        }\n        if (Object.keys(userBlocks).length) {\n            graph.userBlocks = userBlocks;\n        }\n    }\n    return graph;\n}\n\n/**\n * Reads the graph out of a script source. Returns `null` when the source holds no graph; an empty\n * source gives an empty graph, which is what a new script starts with.\n */\nexport function parseGraph(source: string | null | undefined): FbGraph | null {\n    if (!source?.trim()) {\n        return createGraph();\n    }\n    const pos = source.lastIndexOf(FB_GRAPH_MARKER);\n    if (pos === -1 || (pos > 0 && source[pos - 1] !== '\\n')) {\n        return null;\n    }\n    const line = source\n        .substring(pos + FB_GRAPH_MARKER.length)\n        .split('\\n')[0]\n        .trim();\n    try {\n        return normalizeGraph(JSON.parse(line) as Partial<FbGraph>);\n    } catch {\n        return null;\n    }\n}\n\n/** Whether a script source was generated from a function block diagram */\nexport function isFbdSource(source: string | null | undefined): boolean {\n    if (!source) {\n        return false;\n    }\n    // no trimEnd(): the editor compiles this with an ES2018 library\n    const trimmed = source.replace(/\\s+$/, '');\n    const pos = trimmed.lastIndexOf('\\n');\n    return trimmed.substring(pos + 1).startsWith(FB_GRAPH_MARKER);\n}\n\nexport function serializeGraph(graph: FbGraph): string {\n    return `${FB_GRAPH_MARKER}${JSON.stringify(graph)}`;\n}\n"]}

package/build/lib/fb/index.js

@@ -0,0 +1,57 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fbBlocks = void 0;
+/**
+ * fb-core: the model, the block library, the checks and the code generator of function block
+ * diagrams. No React, no DOM, no Node - the editor and the adapter both use it.
+ *
+ * The runtime the generated code calls is `./runtime`, which is Node only and not exported here. Its
+ * blocks are, as `fbBlocks` - the editor runs them for the preview of a block.
+ */
+exports.fbBlocks = __importStar(require("./blocks"));
+__exportStar(require("./types"), exports);
+__exportStar(require("./library"), exports);
+__exportStar(require("./graph"), exports);
+__exportStar(require("./analyze"), exports);
+__exportStar(require("./generate"), exports);
+__exportStar(require("./time"), exports);
+__exportStar(require("./js"), exports);
+__exportStar(require("./user"), exports);
+__exportStar(require("./layout"), exports);
+//# sourceMappingURL=index.js.map

package/build/lib/fb/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/lib/fb/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;GAMG;AACH,qDAAqC;AACrC,0CAAwB;AACxB,4CAA0B;AAC1B,0CAAwB;AACxB,4CAA0B;AAC1B,6CAA2B;AAC3B,yCAAuB;AACvB,uCAAqB;AACrB,yCAAuB;AACvB,2CAAyB","sourcesContent":["/**\n * fb-core: the model, the block library, the checks and the code generator of function block\n * diagrams. No React, no DOM, no Node - the editor and the adapter both use it.\n *\n * The runtime the generated code calls is `./runtime`, which is Node only and not exported here. Its\n * blocks are, as `fbBlocks` - the editor runs them for the preview of a block.\n */\nexport * as fbBlocks from './blocks';\nexport * from './types';\nexport * from './library';\nexport * from './graph';\nexport * from './analyze';\nexport * from './generate';\nexport * from './time';\nexport * from './js';\nexport * from './user';\nexport * from './layout';\n"]}

package/build/lib/fb/js.js

@@ -0,0 +1,33 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.jsParameters = jsParameters;
+exports.jsCode = jsCode;
+exports.checkJsCode = checkJsCode;
+/**
+ * The JS block: code of the user that becomes a function of the generated script. Its parameters are
+ * the inputs of the block, then `dt`, `firstScan` and `state`.
+ */
+const graph_1 = require("./graph");
+/** The names the code of a JS block sees, in the order the function gets them */
+function jsParameters(block, def) {
+    return [...(0, graph_1.getInputs)(block, def).map(pin => pin.id), 'dt', 'firstScan', 'state'];
+}
+/** The code of a JS block */
+function jsCode(block, def) {
+    const code = block.params?.code ?? def.params?.find(param => param.id === 'code')?.default;
+    return typeof code === 'string' ? code : '';
+}
+/**
+ * The syntax error of the code of a JS block, or `null`. The body is parsed on its own, so code that
+ * closes the function early is an error too and cannot break the script around it.
+ */
+function checkJsCode(code, parameters) {
+    try {
+        new Function(...parameters, code);
+        return null;
+    }
+    catch (error) {
+        return error?.message || String(error);
+    }
+}
+//# sourceMappingURL=js.js.map

package/build/lib/fb/js.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"js.js","sourceRoot":"","sources":["../../../src/lib/fb/js.ts"],"names":[],"mappings":";;AAQA,oCAEC;AAGD,wBAGC;AAMD,kCAOC;AA7BD;;;GAGG;AACH,mCAAoC;AAGpC,iFAAiF;AACjF,SAAgB,YAAY,CAAC,KAAc,EAAE,GAAe;IACxD,OAAO,CAAC,GAAG,IAAA,iBAAS,EAAC,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;AACrF,CAAC;AAED,6BAA6B;AAC7B,SAAgB,MAAM,CAAC,KAAc,EAAE,GAAe;IAClD,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,IAAI,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC;IAC3F,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,IAAY,EAAE,UAAoB;IAC1D,IAAI,CAAC;QACD,IAAI,QAAQ,CAAC,GAAG,UAAU,EAAE,IAAI,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC;IAChB,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACtB,OAAQ,KAAe,EAAE,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC;AACL,CAAC","sourcesContent":["/**\n * The JS block: code of the user that becomes a function of the generated script. Its parameters are\n * the inputs of the block, then `dt`, `firstScan` and `state`.\n */\nimport { getInputs } from './graph';\nimport type { FbBlock, FbBlockDef } from './types';\n\n/** The names the code of a JS block sees, in the order the function gets them */\nexport function jsParameters(block: FbBlock, def: FbBlockDef): string[] {\n    return [...getInputs(block, def).map(pin => pin.id), 'dt', 'firstScan', 'state'];\n}\n\n/** The code of a JS block */\nexport function jsCode(block: FbBlock, def: FbBlockDef): string {\n    const code = block.params?.code ?? def.params?.find(param => param.id === 'code')?.default;\n    return typeof code === 'string' ? code : '';\n}\n\n/**\n * The syntax error of the code of a JS block, or `null`. The body is parsed on its own, so code that\n * closes the function early is an error too and cannot break the script around it.\n */\nexport function checkJsCode(code: string, parameters: string[]): string | null {\n    try {\n        new Function(...parameters, code);\n        return null;\n    } catch (error: unknown) {\n        return (error as Error)?.message || String(error);\n    }\n}\n"]}

package/build/lib/fb/layout.js

@@ -0,0 +1,205 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.layoutGraph = layoutGraph;
+/**
+ * Arranges the blocks of a diagram automatically: in columns along the data flow, inputs on the
+ * left, outputs on the right, and each block as level as it can be with the blocks it is linked to,
+ * so the links run straight where possible.
+ *
+ * A layered layout in the manner of Sugiyama, kept small: columns by the longest path, the order in a
+ * column by the positions of the neighbours, and the positions by the mean of what the blocks of a
+ * column want, without overlaps. Links that lead back (feedback) do not count.
+ */
+const analyze_1 = require("./analyze");
+const graph_1 = require("./graph");
+const library_1 = require("./library");
+const DEFAULT_METRICS = { header: 22, detail: 18, pin: 20, frame: 6 };
+const DEFAULT_WIDTH = 160;
+/** Room between the columns - for the links, and the values of open inputs left of a block */
+const GAP_X = 100;
+const GAP_Y = 30;
+const GRID = 10;
+/** Rounds from one side to the other and back */
+const PASSES = 4;
+/** Blocks with a line under the type (state, value, pin, version) are that much higher */
+function pinTop(def, metrics) {
+    return metrics.header + (def?.user || def?.params?.length ? metrics.detail : 0);
+}
+/** The top of a group of blocks that touch: the mean of what each of them wants */
+function settle(cluster) {
+    let offset = 0;
+    let sum = 0;
+    cluster.ids.forEach((_id, i) => {
+        sum += cluster.wants[i] - offset;
+        offset += cluster.heights[i] + GAP_Y;
+    });
+    cluster.top = sum / cluster.ids.length;
+}
+function clusterHeight(cluster) {
+    return cluster.heights.reduce((sum, height) => sum + height + GAP_Y, 0) - GAP_Y;
+}
+/**
+ * New positions for the blocks of a diagram, by ID. The comments stay where they are; the top left
+ * corner of the blocks stays where it was.
+ */
+function layoutGraph(graph, options = {}) {
+    if (!graph.blocks.length) {
+        return {};
+    }
+    const analysis = (0, analyze_1.analyzeGraph)(graph);
+    const feedback = new Set(analysis.feedback);
+    const links = analysis.links.filter(link => !feedback.has(link.id) && link.from[0] !== link.to[0]);
+    const metrics = options.metrics || DEFAULT_METRICS;
+    const PIN_HEIGHT = metrics.pin;
+    const items = new Map();
+    for (const block of graph.blocks) {
+        const def = (0, library_1.getBlockDef)(block.type, graph.userBlocks);
+        const rows = Math.max((0, graph_1.getInputs)(block, def).length, (0, graph_1.getOutputs)(block, def).length, 1);
+        const top = pinTop(def, metrics);
+        const size = options.sizes?.[block.id];
+        items.set(block.id, {
+            id: block.id,
+            block,
+            def,
+            width: size?.width || DEFAULT_WIDTH,
+            height: size?.height || top + rows * PIN_HEIGHT + metrics.frame,
+            pinTop: top,
+        });
+    }
+    const incoming = new Map();
+    const outgoing = new Map();
+    for (const link of links) {
+        incoming.set(link.to[0], [...(incoming.get(link.to[0]) || []), link]);
+        outgoing.set(link.from[0], [...(outgoing.get(link.from[0]) || []), link]);
+    }
+    // the pins, from the top of their block
+    const outputY = (link) => {
+        const item = items.get(link.from[0]);
+        const index = (0, graph_1.getOutputs)(item.block, item.def).findIndex(pin => pin.id === link.from[1]);
+        return item.pinTop + Math.max(index, 0) * PIN_HEIGHT + PIN_HEIGHT / 2;
+    };
+    const inputY = (link) => {
+        const item = items.get(link.to[0]);
+        const index = (0, graph_1.getInputs)(item.block, item.def).findIndex(pin => pin.id === link.to[1]);
+        return item.pinTop + Math.max(index, 0) * PIN_HEIGHT + PIN_HEIGHT / 2;
+    };
+    // Columns by the longest path. The execution order is a topological order of the links that do
+    // not lead back; blocks that cannot run (an unknown type) come last.
+    const sequence = graph.blocks
+        .map(block => block.id)
+        .sort((a, b) => (analysis.order[a] ?? Infinity) - (analysis.order[b] ?? Infinity));
+    const column = new Map();
+    for (const id of sequence) {
+        let index = 0;
+        for (const link of incoming.get(id) || []) {
+            index = Math.max(index, (column.get(link.from[0]) ?? 0) + 1);
+        }
+        column.set(id, index);
+    }
+    // a block that only gives a value, like CONST, goes next to where it is used
+    for (const id of [...sequence].reverse()) {
+        const type = items.get(id).block.type;
+        const next = outgoing.get(id) || [];
+        if (!incoming.get(id)?.length && next.length && type !== 'STATE_IN' && type !== 'FB_IN') {
+            column.set(id, Math.max(0, Math.min(...next.map(link => column.get(link.to[0]))) - 1));
+        }
+    }
+    // the outputs of the diagram in the last column
+    const last = Math.max(...column.values());
+    for (const id of sequence) {
+        const type = items.get(id).block.type;
+        if ((type === 'STATE_OUT' || type === 'FB_OUT') && !outgoing.get(id)?.length) {
+            column.set(id, last);
+        }
+    }
+    // the columns, at first in the order the blocks have from top to bottom
+    const columns = Array.from({ length: last + 1 }, () => []);
+    graph.blocks
+        .slice()
+        .sort((a, b) => a.pos[1] - b.pos[1] || a.pos[0] - b.pos[0])
+        .forEach(block => columns[column.get(block.id)].push(block.id));
+    const y = new Map();
+    for (const ids of columns) {
+        let top = 0;
+        for (const id of ids) {
+            y.set(id, top);
+            top += items.get(id).height + GAP_Y;
+        }
+    }
+    /**
+     * Places the blocks of a column where they want to be, without overlaps: blocks that would
+     * overlap form a group, which sits at the mean of what its blocks want.
+     */
+    const place = (ids, want) => {
+        const wishes = ids
+            .map((id, i) => ({ id, i, want: want(id) ?? y.get(id) }))
+            .sort((a, b) => a.want - b.want || a.i - b.i);
+        const clusters = [];
+        for (const wish of wishes) {
+            const cluster = {
+                ids: [wish.id],
+                wants: [wish.want],
+                heights: [items.get(wish.id).height],
+                top: wish.want,
+            };
+            clusters.push(cluster);
+            // merge with the groups above as long as they overlap
+            while (clusters.length > 1) {
+                const current = clusters[clusters.length - 1];
+                const above = clusters[clusters.length - 2];
+                if (above.top + clusterHeight(above) + GAP_Y <= current.top) {
+                    break;
+                }
+                above.ids.push(...current.ids);
+                above.wants.push(...current.wants);
+                above.heights.push(...current.heights);
+                settle(above);
+                clusters.pop();
+            }
+        }
+        ids.length = 0;
+        for (const cluster of clusters) {
+            let top = cluster.top;
+            cluster.ids.forEach((id, i) => {
+                y.set(id, top);
+                top += cluster.heights[i] + GAP_Y;
+                ids.push(id);
+            });
+        }
+    };
+    const mean = (values) => values.length ? values.reduce((sum, value) => sum + value, 0) / values.length : null;
+    // level with the outputs that feed it
+    const fromLeft = (id) => mean((incoming.get(id) || []).map(link => y.get(link.from[0]) + outputY(link) - inputY(link)));
+    // level with the inputs it feeds
+    const fromRight = (id) => mean((outgoing.get(id) || []).map(link => y.get(link.to[0]) + inputY(link) - outputY(link)));
+    for (let pass = 0; pass < PASSES; pass++) {
+        for (let i = 1; i < columns.length; i++) {
+            place(columns[i], fromLeft);
+        }
+        for (let i = columns.length - 2; i >= 0; i--) {
+            place(columns[i], fromRight);
+        }
+    }
+    // the last round from left to right: the links of a chain run straight
+    for (let i = 1; i < columns.length; i++) {
+        place(columns[i], fromLeft);
+    }
+    // the columns side by side, each as wide as its widest block
+    const left = Math.min(...graph.blocks.map(block => block.pos[0]));
+    const top = Math.min(...graph.blocks.map(block => block.pos[1]));
+    const minY = Math.min(...y.values());
+    const positions = {};
+    let x = Math.round(left / GRID) * GRID;
+    for (const ids of columns) {
+        if (!ids.length) {
+            continue;
+        }
+        for (const id of ids) {
+            // not on the grid vertically: a link between pins at different heights would get a kink
+            positions[id] = [x, Math.round(top + y.get(id) - minY)];
+        }
+        x += Math.round((Math.max(...ids.map(id => items.get(id).width)) + GAP_X) / GRID) * GRID;
+    }
+    return positions;
+}
+//# sourceMappingURL=layout.js.map

package/build/lib/fb/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../../src/lib/fb/layout.ts"],"names":[],"mappings":";;AAoFA,kCA4KC;AAhQD;;;;;;;;GAQG;AACH,uCAAyC;AACzC,mCAAgD;AAChD,uCAAwC;AAsBxC,MAAM,eAAe,GAAmB,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AACtF,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,8FAA8F;AAC9F,MAAM,KAAK,GAAG,GAAG,CAAC;AAClB,MAAM,KAAK,GAAG,EAAE,CAAC;AACjB,MAAM,IAAI,GAAG,EAAE,CAAC;AAChB,iDAAiD;AACjD,MAAM,MAAM,GAAG,CAAC,CAAC;AAYjB,0FAA0F;AAC1F,SAAS,MAAM,CAAC,GAA2B,EAAE,OAAuB;IAChE,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,IAAI,IAAI,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpF,CAAC;AASD,mFAAmF;AACnF,SAAS,MAAM,CAAC,OAAgB;IAC5B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC3B,GAAG,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACjC,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACzC,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;AAC3C,CAAC;AAED,SAAS,aAAa,CAAC,OAAgB;IACnC,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;AACpF,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,KAAc,EAAE,UAA2B,EAAE;IACrE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC;IACd,CAAC;IACD,MAAM,QAAQ,GAAG,IAAA,sBAAY,EAAC,KAAK,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnG,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,eAAe,CAAC;IACnD,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAA,qBAAW,EAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAA,iBAAS,EAAC,KAAK,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,IAAA,kBAAU,EAAC,KAAK,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACtF,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;YAChB,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,KAAK;YACL,GAAG;YACH,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,aAAa;YACnC,MAAM,EAAE,IAAI,EAAE,MAAM,IAAI,GAAG,GAAG,IAAI,GAAG,UAAU,GAAG,OAAO,CAAC,KAAK;YAC/D,MAAM,EAAE,GAAG;SACd,CAAC,CAAC;IACP,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACtE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,wCAAwC;IACxC,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC;QACtC,MAAM,KAAK,GAAG,IAAA,kBAAU,EAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC;IAC1E,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,IAAY,EAAU,EAAE;QACpC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;QACpC,MAAM,KAAK,GAAG,IAAA,iBAAS,EAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC;IAC1E,CAAC,CAAC;IAEF,+FAA+F;IAC/F,qEAAqE;IACrE,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM;SACxB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;SACtB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IACvF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QACxB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC1B,CAAC;IACD,6EAA6E;IAC7E,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC,IAAI,CAAC;QACvC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YACtF,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5F,CAAC;IACL,CAAC;IACD,gDAAgD;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC,IAAI,CAAC;QACvC,IAAI,CAAC,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;YAC3E,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;IAED,wEAAwE;IACxE,MAAM,OAAO,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACvE,KAAK,CAAC,MAAM;SACP,KAAK,EAAE;SACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1D,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAErE,MAAM,CAAC,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACnB,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACf,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,MAAM,GAAG,KAAK,CAAC;QACzC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,MAAM,KAAK,GAAG,CAAC,GAAa,EAAE,IAAmC,EAAQ,EAAE;QACvE,MAAM,MAAM,GAAG,GAAG;aACb,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC,CAAC;aACzD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,OAAO,GAAY;gBACrB,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACd,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClB,OAAO,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,MAAM,CAAC;gBACrC,GAAG,EAAE,IAAI,CAAC,IAAI;aACjB,CAAC;YACF,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,sDAAsD;YACtD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC5C,IAAI,KAAK,CAAC,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,KAAK,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC;oBAC1D,MAAM;gBACV,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;gBAC/B,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;gBACnC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;gBACvC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACd,QAAQ,CAAC,GAAG,EAAE,CAAC;YACnB,CAAC;QACL,CAAC;QACD,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;gBAC1B,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;gBACf,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;gBAClC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC,CAAC,CAAC;QACP,CAAC;IACL,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,MAAgB,EAAiB,EAAE,CAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IACzF,sCAAsC;IACtC,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAiB,EAAE,CAC3C,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpG,iCAAiC;IACjC,MAAM,SAAS,GAAG,CAAC,EAAU,EAAiB,EAAE,CAC5C,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAElG,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IACD,uEAAuE;IACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,6DAA6D;IAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACrC,MAAM,SAAS,GAAqC,EAAE,CAAC;IACvD,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IACvC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;YACd,SAAS;QACb,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACnB,wFAAwF;YACxF,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IAC9F,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC","sourcesContent":["/**\n * Arranges the blocks of a diagram automatically: in columns along the data flow, inputs on the\n * left, outputs on the right, and each block as level as it can be with the blocks it is linked to,\n * so the links run straight where possible.\n *\n * A layered layout in the manner of Sugiyama, kept small: columns by the longest path, the order in a\n * column by the positions of the neighbours, and the positions by the mean of what the blocks of a\n * column want, without overlaps. Links that lead back (feedback) do not count.\n */\nimport { analyzeGraph } from './analyze';\nimport { getInputs, getOutputs } from './graph';\nimport { getBlockDef } from './library';\nimport type { FbBlock, FbBlockDef, FbGraph, FbLink } from './types';\n\n/** How the editor draws a block, in pixels */\nexport interface FbBlockMetrics {\n    /** From the top of the block to the line under the type */\n    header: number;\n    /** The line under the type: the state, the value, the pin, the version */\n    detail: number;\n    /** One row of pins */\n    pin: number;\n    /** Below the last row */\n    frame: number;\n}\n\nexport interface FbLayoutOptions {\n    /** The sizes of the blocks as they are drawn, by ID; estimated where missing */\n    sizes?: Record<string, { width: number; height: number }>;\n    /** Where the pins are - by default as the first editor drew them */\n    metrics?: FbBlockMetrics;\n}\n\nconst DEFAULT_METRICS: FbBlockMetrics = { header: 22, detail: 18, pin: 20, frame: 6 };\nconst DEFAULT_WIDTH = 160;\n\n/** Room between the columns - for the links, and the values of open inputs left of a block */\nconst GAP_X = 100;\nconst GAP_Y = 30;\nconst GRID = 10;\n/** Rounds from one side to the other and back */\nconst PASSES = 4;\n\ninterface Item {\n    id: string;\n    block: FbBlock;\n    def: FbBlockDef | undefined;\n    width: number;\n    height: number;\n    /** From the top of the block to the first pin */\n    pinTop: number;\n}\n\n/** Blocks with a line under the type (state, value, pin, version) are that much higher */\nfunction pinTop(def: FbBlockDef | undefined, metrics: FbBlockMetrics): number {\n    return metrics.header + (def?.user || def?.params?.length ? metrics.detail : 0);\n}\n\ninterface Cluster {\n    ids: string[];\n    wants: number[];\n    heights: number[];\n    top: number;\n}\n\n/** The top of a group of blocks that touch: the mean of what each of them wants */\nfunction settle(cluster: Cluster): void {\n    let offset = 0;\n    let sum = 0;\n    cluster.ids.forEach((_id, i) => {\n        sum += cluster.wants[i] - offset;\n        offset += cluster.heights[i] + GAP_Y;\n    });\n    cluster.top = sum / cluster.ids.length;\n}\n\nfunction clusterHeight(cluster: Cluster): number {\n    return cluster.heights.reduce((sum, height) => sum + height + GAP_Y, 0) - GAP_Y;\n}\n\n/**\n * New positions for the blocks of a diagram, by ID. The comments stay where they are; the top left\n * corner of the blocks stays where it was.\n */\nexport function layoutGraph(graph: FbGraph, options: FbLayoutOptions = {}): Record<string, [number, number]> {\n    if (!graph.blocks.length) {\n        return {};\n    }\n    const analysis = analyzeGraph(graph);\n    const feedback = new Set(analysis.feedback);\n    const links = analysis.links.filter(link => !feedback.has(link.id) && link.from[0] !== link.to[0]);\n\n    const metrics = options.metrics || DEFAULT_METRICS;\n    const PIN_HEIGHT = metrics.pin;\n    const items = new Map<string, Item>();\n    for (const block of graph.blocks) {\n        const def = getBlockDef(block.type, graph.userBlocks);\n        const rows = Math.max(getInputs(block, def).length, getOutputs(block, def).length, 1);\n        const top = pinTop(def, metrics);\n        const size = options.sizes?.[block.id];\n        items.set(block.id, {\n            id: block.id,\n            block,\n            def,\n            width: size?.width || DEFAULT_WIDTH,\n            height: size?.height || top + rows * PIN_HEIGHT + metrics.frame,\n            pinTop: top,\n        });\n    }\n\n    const incoming = new Map<string, FbLink[]>();\n    const outgoing = new Map<string, FbLink[]>();\n    for (const link of links) {\n        incoming.set(link.to[0], [...(incoming.get(link.to[0]) || []), link]);\n        outgoing.set(link.from[0], [...(outgoing.get(link.from[0]) || []), link]);\n    }\n\n    // the pins, from the top of their block\n    const outputY = (link: FbLink): number => {\n        const item = items.get(link.from[0])!;\n        const index = getOutputs(item.block, item.def).findIndex(pin => pin.id === link.from[1]);\n        return item.pinTop + Math.max(index, 0) * PIN_HEIGHT + PIN_HEIGHT / 2;\n    };\n    const inputY = (link: FbLink): number => {\n        const item = items.get(link.to[0])!;\n        const index = getInputs(item.block, item.def).findIndex(pin => pin.id === link.to[1]);\n        return item.pinTop + Math.max(index, 0) * PIN_HEIGHT + PIN_HEIGHT / 2;\n    };\n\n    // Columns by the longest path. The execution order is a topological order of the links that do\n    // not lead back; blocks that cannot run (an unknown type) come last.\n    const sequence = graph.blocks\n        .map(block => block.id)\n        .sort((a, b) => (analysis.order[a] ?? Infinity) - (analysis.order[b] ?? Infinity));\n    const column = new Map<string, number>();\n    for (const id of sequence) {\n        let index = 0;\n        for (const link of incoming.get(id) || []) {\n            index = Math.max(index, (column.get(link.from[0]) ?? 0) + 1);\n        }\n        column.set(id, index);\n    }\n    // a block that only gives a value, like CONST, goes next to where it is used\n    for (const id of [...sequence].reverse()) {\n        const type = items.get(id)!.block.type;\n        const next = outgoing.get(id) || [];\n        if (!incoming.get(id)?.length && next.length && type !== 'STATE_IN' && type !== 'FB_IN') {\n            column.set(id, Math.max(0, Math.min(...next.map(link => column.get(link.to[0])!)) - 1));\n        }\n    }\n    // the outputs of the diagram in the last column\n    const last = Math.max(...column.values());\n    for (const id of sequence) {\n        const type = items.get(id)!.block.type;\n        if ((type === 'STATE_OUT' || type === 'FB_OUT') && !outgoing.get(id)?.length) {\n            column.set(id, last);\n        }\n    }\n\n    // the columns, at first in the order the blocks have from top to bottom\n    const columns: string[][] = Array.from({ length: last + 1 }, () => []);\n    graph.blocks\n        .slice()\n        .sort((a, b) => a.pos[1] - b.pos[1] || a.pos[0] - b.pos[0])\n        .forEach(block => columns[column.get(block.id)!].push(block.id));\n\n    const y = new Map<string, number>();\n    for (const ids of columns) {\n        let top = 0;\n        for (const id of ids) {\n            y.set(id, top);\n            top += items.get(id)!.height + GAP_Y;\n        }\n    }\n\n    /**\n     * Places the blocks of a column where they want to be, without overlaps: blocks that would\n     * overlap form a group, which sits at the mean of what its blocks want.\n     */\n    const place = (ids: string[], want: (id: string) => number | null): void => {\n        const wishes = ids\n            .map((id, i) => ({ id, i, want: want(id) ?? y.get(id)! }))\n            .sort((a, b) => a.want - b.want || a.i - b.i);\n        const clusters: Cluster[] = [];\n        for (const wish of wishes) {\n            const cluster: Cluster = {\n                ids: [wish.id],\n                wants: [wish.want],\n                heights: [items.get(wish.id)!.height],\n                top: wish.want,\n            };\n            clusters.push(cluster);\n            // merge with the groups above as long as they overlap\n            while (clusters.length > 1) {\n                const current = clusters[clusters.length - 1];\n                const above = clusters[clusters.length - 2];\n                if (above.top + clusterHeight(above) + GAP_Y <= current.top) {\n                    break;\n                }\n                above.ids.push(...current.ids);\n                above.wants.push(...current.wants);\n                above.heights.push(...current.heights);\n                settle(above);\n                clusters.pop();\n            }\n        }\n        ids.length = 0;\n        for (const cluster of clusters) {\n            let top = cluster.top;\n            cluster.ids.forEach((id, i) => {\n                y.set(id, top);\n                top += cluster.heights[i] + GAP_Y;\n                ids.push(id);\n            });\n        }\n    };\n\n    const mean = (values: number[]): number | null =>\n        values.length ? values.reduce((sum, value) => sum + value, 0) / values.length : null;\n    // level with the outputs that feed it\n    const fromLeft = (id: string): number | null =>\n        mean((incoming.get(id) || []).map(link => y.get(link.from[0])! + outputY(link) - inputY(link)));\n    // level with the inputs it feeds\n    const fromRight = (id: string): number | null =>\n        mean((outgoing.get(id) || []).map(link => y.get(link.to[0])! + inputY(link) - outputY(link)));\n\n    for (let pass = 0; pass < PASSES; pass++) {\n        for (let i = 1; i < columns.length; i++) {\n            place(columns[i], fromLeft);\n        }\n        for (let i = columns.length - 2; i >= 0; i--) {\n            place(columns[i], fromRight);\n        }\n    }\n    // the last round from left to right: the links of a chain run straight\n    for (let i = 1; i < columns.length; i++) {\n        place(columns[i], fromLeft);\n    }\n\n    // the columns side by side, each as wide as its widest block\n    const left = Math.min(...graph.blocks.map(block => block.pos[0]));\n    const top = Math.min(...graph.blocks.map(block => block.pos[1]));\n    const minY = Math.min(...y.values());\n    const positions: Record<string, [number, number]> = {};\n    let x = Math.round(left / GRID) * GRID;\n    for (const ids of columns) {\n        if (!ids.length) {\n            continue;\n        }\n        for (const id of ids) {\n            // not on the grid vertically: a link between pins at different heights would get a kink\n            positions[id] = [x, Math.round(top + y.get(id)! - minY)];\n        }\n        x += Math.round((Math.max(...ids.map(id => items.get(id)!.width)) + GAP_X) / GRID) * GRID;\n    }\n    return positions;\n}\n"]}