@bpmn-io/form-js-playground 1.9.1 → 1.9.2

package/dist/form-playground.umd.js

@@ -1987,7 +1987,7 @@
    * rm {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).
    * [more] {boolean} Whether the result of division was truncated.
    */
-  function round$2(x, sd, rm, more) {
+  function round$1(x, sd, rm, more) {
     var xc = x.c;
     if (rm === UNDEFINED$1) rm = x.constructor.RM;
     if (rm !== 0 && rm !== 1 && rm !== 2 && rm !== 3) {
@@ -2208,7 +2208,7 @@
     }
 
     // Round?
-    if (qi > p) round$2(q, p, Big.RM, r[0] !== UNDEFINED$1);
+    if (qi > p) round$1(q, p, Big.RM, r[0] !== UNDEFINED$1);
     return q;
   };
 
@@ -2497,7 +2497,7 @@
     if (sd !== ~~sd || sd < 1 || sd > MAX_DP$1) {
       throw Error(INVALID$4 + 'precision');
     }
-    return round$2(new this.constructor(this), sd, rm);
+    return round$1(new this.constructor(this), sd, rm);
   };
 
   /*
@@ -2513,7 +2513,7 @@
     if (dp === UNDEFINED$1) dp = 0;else if (dp !== ~~dp || dp < -MAX_DP$1 || dp > MAX_DP$1) {
       throw Error(INVALID_DP$1);
     }
-    return round$2(new this.constructor(this), dp + this.e + 1, rm);
+    return round$1(new this.constructor(this), dp + this.e + 1, rm);
   };
 
   /*
@@ -2559,7 +2559,7 @@
       t = r;
       r = half.times(t.plus(x.div(t)));
     } while (t.c.slice(0, e).join('') !== r.c.slice(0, e).join(''));
-    return round$2(r, (Big.DP -= 4) + r.e + 1, Big.RM);
+    return round$1(r, (Big.DP -= 4) + r.e + 1, Big.RM);
   };
 
   /*
@@ -2642,7 +2642,7 @@
       if (dp !== ~~dp || dp < 0 || dp > MAX_DP$1) {
         throw Error(INVALID_DP$1);
       }
-      x = round$2(new x.constructor(x), ++dp, rm);
+      x = round$1(new x.constructor(x), ++dp, rm);
       for (; x.c.length < dp;) x.c.push(0);
     }
     return stringify$1(x, true, !!n);
@@ -2665,7 +2665,7 @@
       if (dp !== ~~dp || dp < 0 || dp > MAX_DP$1) {
         throw Error(INVALID_DP$1);
       }
-      x = round$2(new x.constructor(x), dp + x.e + 1, rm);
+      x = round$1(new x.constructor(x), dp + x.e + 1, rm);
 
       // x.e may have changed if the value is rounded up.
       for (dp = dp + x.e + 1; x.c.length < dp;) x.c.push(0);
@@ -2713,7 +2713,7 @@
       if (sd !== ~~sd || sd < 1 || sd > MAX_DP$1) {
         throw Error(INVALID$4 + 'precision');
       }
-      x = round$2(new Big(x), sd, rm);
+      x = round$1(new Big(x), sd, rm);
       for (; x.c.length < sd;) x.c.push(0);
     }
     return stringify$1(x, sd <= x.e || x.e <= Big.NE || x.e >= Big.PE, !!n);
@@ -28778,13 +28778,15 @@
       let {
         parser
       } = this.p;
+      let lookaheadRecord = this.reducePos < this.pos - 25 /* Lookahead.Margin */;
+      if (lookaheadRecord) this.setLookAhead(this.pos);
       let dPrec = parser.dynamicPrecedence(type);
       if (dPrec) this.score += dPrec;
       if (depth == 0) {
         this.pushState(parser.getGoto(this.state, type, true), this.reducePos);
         // Zero-depth reductions are a special case—they add stuff to
         // the stack without popping anything off.
-        if (type < parser.minRepeatTerm) this.storeNode(type, this.reducePos, this.reducePos, 4, true);
+        if (type < parser.minRepeatTerm) this.storeNode(type, this.reducePos, this.reducePos, lookaheadRecord ? 8 : 4, true);
         this.reduceContext(type, this.reducePos);
         return;
       }
@@ -28829,7 +28831,7 @@
     /**
     @internal
     */
-    storeNode(term, start, end, size = 4, isReduce = false) {
+    storeNode(term, start, end, size = 4, mustSink = false) {
       if (term == 0 /* Term.Err */ && (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {
         // Try to omit/merge adjacent error nodes
         let cur = this,
@@ -28846,20 +28848,29 @@
           }
         }
       }
-      if (!isReduce || this.pos == end) {
+      if (!mustSink || this.pos == end) {
         // Simple case, just append
         this.buffer.push(term, start, end, size);
       } else {
         // There may be skipped nodes that have to be moved forward
         let index = this.buffer.length;
-        if (index > 0 && this.buffer[index - 4] != 0 /* Term.Err */) while (index > 0 && this.buffer[index - 2] > end) {
-          // Move this record forward
-          this.buffer[index] = this.buffer[index - 4];
-          this.buffer[index + 1] = this.buffer[index - 3];
-          this.buffer[index + 2] = this.buffer[index - 2];
-          this.buffer[index + 3] = this.buffer[index - 1];
-          index -= 4;
-          if (size > 4) size -= 4;
+        if (index > 0 && this.buffer[index - 4] != 0 /* Term.Err */) {
+          let mustMove = false;
+          for (let scan = index; scan > 0 && this.buffer[scan - 2] > end; scan -= 4) {
+            if (this.buffer[scan - 1] >= 0) {
+              mustMove = true;
+              break;
+            }
+          }
+          if (mustMove) while (index > 0 && this.buffer[index - 2] > end) {
+            // Move this record forward
+            this.buffer[index] = this.buffer[index - 4];
+            this.buffer[index + 1] = this.buffer[index - 3];
+            this.buffer[index + 2] = this.buffer[index - 2];
+            this.buffer[index + 3] = this.buffer[index - 1];
+            index -= 4;
+            if (size > 4) size -= 4;
+          }
         }
         this.buffer[index] = term;
         this.buffer[index + 1] = start;
@@ -29610,7 +29621,7 @@
     cursor.moveTo(pos);
     for (;;) {
       if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos))) for (;;) {
-        if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError) return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Safety.Margin */)) : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Safety.Margin */));
+        if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError) return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Lookahead.Margin */)) : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Lookahead.Margin */));
         if (side < 0 ? cursor.prevSibling() : cursor.nextSibling()) break;
         if (!cursor.parent()) return side < 0 ? 0 : tree.length;
       }
@@ -29726,7 +29737,7 @@
           token.mask = mask;
           token.context = context;
         }
-        if (token.lookAhead > token.end + 25 /* Safety.Margin */) lookAhead = Math.max(token.lookAhead, lookAhead);
+        if (token.lookAhead > token.end + 25 /* Lookahead.Margin */) lookAhead = Math.max(token.lookAhead, lookAhead);
         if (token.value != 0 /* Term.Err */) {
           let startIndex = actionIndex;
           if (token.extended > -1) actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);
@@ -32249,6 +32260,7 @@
     },
     dynamicPrecedences: {
       "31": -1,
+      "67": 1,
       "71": -1,
       "73": -1
     },
@@ -32855,10 +32867,10 @@
     // 10.3.4.5 Numeric functions
     'decimal': fn(function (n, scale) {
       if (!scale) {
-        return round$1(n);
+        return bankersRound(n);
       }
       const offset = Math.pow(10, scale);
-      return round$1(n * offset) / offset;
+      return bankersRound(n * offset) / offset;
     }, ['number', 'number']),
     'floor': fn(function (n, scale = 0) {
       if (scale === null) {
@@ -32997,7 +33009,8 @@
     }, ['list', 'function']),
     // 10.3.4.10 Context function
     'get value': fn(function (m, key) {
-      return getFromContext(key, m) || null;
+      const value = getFromContext(key, m);
+      return value != undefined ? value : null;
     }, ['context', 'string']),
     'get entries': fn(function (m) {
       if (arguments.length !== 1) {
@@ -33274,13 +33287,13 @@
     // cf. https://mathiasbynens.be/notes/javascript-unicode
     return str.replace(/[\uD800-\uDBFF][\uDC00-\uDFFF]/g, '_').length;
   }
-  function round$1(n) {
-    const integral = Math.trunc(n);
-    if (n - integral > .5) {
-      return integral + 1;
-    } else {
-      return integral;
+  function bankersRound(n) {
+    const floored = Math.floor(n);
+    const decimalPart = n - floored;
+    if (decimalPart === 0.5) {
+      return floored % 2 === 0 ? floored : floored + 1;
     }
+    return Math.round(n);
   }
   // adapted from https://stackoverflow.com/a/53577159
   function stddev(array) {
@@ -33463,6 +33476,12 @@
           switch (input) {
             case '+':
               return nullable((a, b) => {
+                // flip these as luxon operations with durations aren't commutative
+                if (isDuration(a) && !isDuration(b)) {
+                  const tmp = a;
+                  a = b;
+                  b = tmp;
+                }
                 if (isType(a, 'time') && isDuration(b)) {
                   return a.plus(b).set({
                     year: 1900,
@@ -67911,6 +67930,7 @@
       const hasChildren = repeaterField.components && repeaterField.components.length > 0;
       const showRemove = repeaterField.allowAddRemove && hasChildren;
       const displayValues = isCollapsed ? values.slice(0, nonCollapsedItems) : values;
+      const hiddenValues = isCollapsed ? values.slice(nonCollapsedItems) : [];
       const onDeleteItem = index => {
         const updatedValues = values.slice();
         updatedValues.splice(index, 1);
@@ -67922,7 +67942,7 @@
       };
       const parentExpressionContextInfo = F$1(LocalExpressionContext);
       return e(d$1, {
-        children: displayValues.map((itemValue, itemIndex) => e(RepetitionScaffold, {
+        children: [displayValues.map((itemValue, itemIndex) => e(RepetitionScaffold, {
           itemIndex: itemIndex,
           itemValue: itemValue,
           parentExpressionContextInfo: parentExpressionContextInfo,
@@ -67932,7 +67952,20 @@
           onDeleteItem: onDeleteItem,
           showRemove: showRemove,
           ...restProps
-        }, itemIndex))
+        }, itemIndex)), hiddenValues.length > 0 ? e("div", {
+          className: "fjs-repeat-row-collapsed",
+          children: hiddenValues.map((itemValue, itemIndex) => e(RepetitionScaffold, {
+            itemIndex: itemIndex + nonCollapsedItems,
+            itemValue: itemValue,
+            parentExpressionContextInfo: parentExpressionContextInfo,
+            repeaterField: repeaterField,
+            RowsRenderer: RowsRenderer,
+            indexes: indexes,
+            onDeleteItem: onDeleteItem,
+            showRemove: showRemove,
+            ...restProps
+          }, itemIndex))
+        }) : null]
       });
     }
     RepeatFooter(props) {
@@ -75769,6 +75802,9 @@
       let targetParentId;
       if (formFieldNode) {
         formField = this._formFieldRegistry.get(formFieldNode.dataset.id);
+        if (!formField) {
+          return 'No associated form field in the registry';
+        }
         columns = (formField.layout || {}).columns;
 
         // (1) check for row constraints

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@bpmn-io/form-js-playground",
-  "version": "1.9.1",
+  "version": "1.9.2",
   "description": "A form-js playground",
   "files": [
     "dist"
@@ -45,8 +45,8 @@
     "url": "https://github.com/bpmn-io"
   },
   "dependencies": {
-    "@bpmn-io/form-js-editor": "^1.9.1",
-    "@bpmn-io/form-js-viewer": "^1.9.1",
+    "@bpmn-io/form-js-editor": "^1.9.2",
+    "@bpmn-io/form-js-viewer": "^1.9.2",
     "@codemirror/autocomplete": "^6.16.0",
     "@codemirror/commands": "^6.5.0",
     "@codemirror/lang-json": "^6.0.1",
@@ -70,5 +70,6 @@
     "min-dom": "^4.1.0",
     "rollup-plugin-css-only": "^4.5.2",
     "style-loader": "^4.0.0"
-  }
+  },
+  "gitHead": "74ba40e6fad356dad63315d3270b4ee61aec4058"
 }