bpmn-js 16.0.0 → 16.1.0

package/README.md

@@ -8,8 +8,8 @@ View and edit BPMN 2.0 diagrams in the browser.
 
 ## Installation
 
-Use the library [pre-packaged](https://github.com/bpmn-io/bpmn-js-examples/tree/master/pre-packaged)
-or include it [via npm](https://github.com/bpmn-io/bpmn-js-examples/tree/master/bundling)
+Use the library [pre-packaged](https://github.com/bpmn-io/bpmn-js-examples/tree/main/pre-packaged)
+or include it [via npm](https://github.com/bpmn-io/bpmn-js-examples/tree/main/bundling)
 into your node-style web-application.
 
 ## Usage
@@ -88,15 +88,6 @@ bpmn-js builds on top of a few powerful tools:
 * [bpmn-moddle](https://github.com/bpmn-io/bpmn-moddle): Read / write support for BPMN 2.0 XML in the browsers
 * [diagram-js](https://github.com/bpmn-io/diagram-js): Diagram rendering and editing toolkit
 
-## Contributing
-
-Please checkout our [contributing guidelines](./.github/CONTRIBUTING.md) if you plan to
-file an issue or pull request.
-
-## Code of Conduct
-
-By participating to this project, please uphold to our [Code of Conduct](https://github.com/bpmn-io/.github/blob/master/.github/CODE_OF_CONDUCT.md).
-
 ## License
 
 Use under the terms of the [bpmn.io license](http://bpmn.io/license).

package/dist/bpmn-modeler.development.js

@@ -1,5 +1,5 @@
 /*!
- * bpmn-js - bpmn-modeler v16.0.0
+ * bpmn-js - bpmn-modeler v16.1.0
  *
  * Copyright (c) 2014-present, camunda Services GmbH
  *
@@ -8,7 +8,7 @@
  *
  * Source Code: https://github.com/bpmn-io/bpmn-js
  *
- * Date: 2023-12-11
+ * Date: 2023-12-14
  */
 (function (global, factory) {
   typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
@@ -3650,10 +3650,6 @@
     };
   }
 
-  function getDefaultExportFromCjs (x) {
-  	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-  }
-
   /**
    * This file contains source code adapted from Snap.svg (licensed Apache-2.0).
    *
@@ -3718,7 +3714,7 @@
 
       count.length >= 1e3 && delete cache[count.shift()];
       count.push(args);
-      cache[args] = f.apply(0, arg);
+      cache[args] = f(...arguments);
 
       return cache[args];
     }
@@ -3755,13 +3751,13 @@
         });
 
         if (name == 'm' && params.length > 2) {
-          data.push([b].concat(params.splice(0, 2)));
+          data.push([ b, ...params.splice(0, 2) ]);
           name = 'l';
           b = b == 'm' ? 'l' : 'L';
         }
 
         while (params.length >= paramCounts[name]) {
-          data.push([b].concat(params.splice(0, paramCounts[name])));
+          data.push([ b, ...params.splice(0, paramCounts[name]) ]);
           if (!paramCounts[name]) {
             break;
           }
@@ -3844,7 +3840,7 @@
 
   function bezierBBox(points) {
 
-    var bbox = curveBBox.apply(null, points);
+    var bbox = curveBBox(...points);
 
     return rectBBox(
       bbox.x0,
@@ -3894,8 +3890,8 @@
 
     var z2 = z / 2,
         n = 12,
-        Tvalues = [-.1252,.1252,-.3678,.3678,-.5873,.5873,-.7699,.7699,-.9041,.9041,-.9816,.9816],
-        Cvalues = [0.2491,0.2491,0.2335,0.2335,0.2032,0.2032,0.1601,0.1601,0.1069,0.1069,0.0472,0.0472],
+        Tvalues = [ -.1252,.1252,-.3678,.3678,-.5873,.5873,-.7699,.7699,-.9041,.9041,-.9816,.9816 ],
+        Cvalues = [ 0.2491,0.2491,0.2335,0.2335,0.2032,0.2032,0.1601,0.1601,0.1069,0.1069,0.0472,0.0472 ],
         sum = 0;
 
     for (var i = 0; i < n; i++) {
@@ -3965,8 +3961,8 @@
 
     // As an optimization, lines will have only 1 segment
 
-    var l1 = bezlen.apply(0, bez1),
-        l2 = bezlen.apply(0, bez2),
+    var l1 = bezlen(...bez1),
+        l2 = bezlen(...bez2),
         n1 = isLine(bez1) ? 1 : ~~(l1 / 5) || 1,
         n2 = isLine(bez2) ? 1 : ~~(l2 / 5) || 1,
         dots1 = [],
@@ -3975,12 +3971,12 @@
         res = justCount ? 0 : [];
 
     for (var i = 0; i < n1 + 1; i++) {
-      var p = findDotsAtSegment.apply(0, bez1.concat(i / n1));
+      var p = findDotsAtSegment(...bez1, i / n1);
       dots1.push({ x: p.x, y: p.y, t: i / n1 });
     }
 
     for (i = 0; i < n2 + 1; i++) {
-      p = findDotsAtSegment.apply(0, bez2.concat(i / n2));
+      p = findDotsAtSegment(...bez2, i / n2);
       dots2.push({ x: p.x, y: p.y, t: i / n2 });
     }
 
@@ -4075,11 +4071,11 @@
       } else {
 
         if (pi[0] == 'C') {
-          bez1 = [x1, y1].concat(pi.slice(1));
+          bez1 = [ x1, y1, ...pi.slice(1) ];
           x1 = bez1[6];
           y1 = bez1[7];
         } else {
-          bez1 = [x1, y1, x1, y1, x1m, y1m, x1m, y1m];
+          bez1 = [ x1, y1, x1, y1, x1m, y1m, x1m, y1m ];
           x1 = x1m;
           y1 = y1m;
         }
@@ -4093,11 +4089,11 @@
           } else {
 
             if (pj[0] == 'C') {
-              bez2 = [x2, y2].concat(pj.slice(1));
+              bez2 = [ x2, y2, ...pj.slice(1) ];
               x2 = bez2[6];
               y2 = bez2[7];
             } else {
-              bez2 = [x2, y2, x2, y2, x2m, y2m, x2m, y2m];
+              bez2 = [ x2, y2, x2, y2, x2m, y2m, x2m, y2m ];
               x2 = x2m;
               y2 = y2m;
             }
@@ -4138,7 +4134,7 @@
     }
 
     if (!pathArray || !pathArray.length) {
-      return [['M', 0, 0]];
+      return [ [ 'M', 0, 0 ] ];
     }
 
     var res = [],
@@ -4155,7 +4151,7 @@
       mx = x;
       my = y;
       start++;
-      res[0] = ['M', x, y];
+      res[0] = [ 'M', x, y ];
     }
 
     for (var r, pa, i = start, ii = pathArray.length; i < ii; i++) {
@@ -4324,7 +4320,7 @@
       f2 = f1 + _120 * (sweep_flag && f2 > f1 ? 1 : -1);
       x2 = cx + rx * math.cos(f2);
       y2 = cy + ry * math.sin(f2);
-      res = arcToCurve(x2, y2, rx, ry, angle, 0, sweep_flag, x2old, y2old, [f2, f2old, cx, cy]);
+      res = arcToCurve(x2, y2, rx, ry, angle, 0, sweep_flag, x2old, y2old, [ f2, f2old, cx, cy ]);
     }
 
     df = f2 - f1;
@@ -4336,18 +4332,18 @@
         t = math.tan(df / 4),
         hx = 4 / 3 * rx * t,
         hy = 4 / 3 * ry * t,
-        m1 = [x1, y1],
-        m2 = [x1 + hx * s1, y1 - hy * c1],
-        m3 = [x2 + hx * s2, y2 - hy * c2],
-        m4 = [x2, y2];
+        m1 = [ x1, y1 ],
+        m2 = [ x1 + hx * s1, y1 - hy * c1 ],
+        m3 = [ x2 + hx * s2, y2 - hy * c2 ],
+        m4 = [ x2, y2 ];
 
     m2[0] = 2 * m1[0] - m2[0];
     m2[1] = 2 * m1[1] - m2[1];
 
     if (recursive) {
-      return [m2, m3, m4].concat(res);
+      return [ m2, m3, m4 ].concat(res);
     } else {
-      res = [m2, m3, m4].concat(res).join().split(',');
+      res = [ m2, m3, m4 ].concat(res).join().split(',');
       var newres = [];
 
       for (var i = 0, ii = res.length; i < ii; i++) {
@@ -4364,7 +4360,7 @@
   // Modifications: https://github.com/timo22345
   function curveBBox(x0, y0, x1, y1, x2, y2, x3, y3) {
     var tvalues = [],
-        bounds = [[], []],
+        bounds = [ [], [] ],
         a, b, c, t, t1, t2, b2ac, sqrtb2ac;
 
     for (var i = 0; i < 2; ++i) {
@@ -4432,10 +4428,10 @@
     bounds[0].length = bounds[1].length = jlen + 2;
 
     return {
-      x0: mmin.apply(0, bounds[0]),
-      y0: mmin.apply(0, bounds[1]),
-      x1: mmax.apply(0, bounds[0]),
-      y1: mmax.apply(0, bounds[1])
+      x0: mmin(...bounds[0]),
+      y0: mmin(...bounds[1]),
+      x1: mmax(...bounds[0]),
+      y1: mmax(...bounds[1])
     };
   }
 
@@ -4454,7 +4450,7 @@
           var nx, ny;
 
           if (!path) {
-            return ['C', d.x, d.y, d.x, d.y, d.x, d.y];
+            return [ 'C', d.x, d.y, d.x, d.y, d.x, d.y ];
           }
 
           !(path[0] in { T: 1, Q: 1 }) && (d.qx = d.qy = null);
@@ -4465,7 +4461,7 @@
             d.Y = path[2];
             break;
           case 'A':
-            path = ['C'].concat(arcToCurve.apply(0, [d.x, d.y].concat(path.slice(1))));
+            path = [ 'C', ...arcToCurve(d.x, d.y, ...path.slice(1)) ];
             break;
           case 'S':
             if (pathCommand == 'C' || pathCommand == 'S') {
@@ -4484,7 +4480,7 @@
               nx = d.x;
               ny = d.y;
             }
-            path = ['C', nx, ny].concat(path.slice(1));
+            path = [ 'C', nx, ny, ...path.slice(1) ];
             break;
           case 'T':
             if (pathCommand == 'Q' || pathCommand == 'T') {
@@ -4503,24 +4499,24 @@
               d.qx = d.x;
               d.qy = d.y;
             }
-            path = ['C'].concat(qubicToCurve(d.x, d.y, d.qx, d.qy, path[1], path[2]));
+            path = [ 'C', ...qubicToCurve(d.x, d.y, d.qx, d.qy, path[1], path[2]) ];
             break;
           case 'Q':
             d.qx = path[1];
             d.qy = path[2];
-            path = ['C'].concat(qubicToCurve(d.x, d.y, path[1], path[2], path[3], path[4]));
+            path = [ 'C', ...qubicToCurve(d.x, d.y, path[1], path[2], path[3], path[4]) ];
             break;
           case 'L':
-            path = ['C'].concat(lineToCurve(d.x, d.y, path[1], path[2]));
+            path = [ 'C', ...lineToCurve(d.x, d.y, path[1], path[2]) ];
             break;
           case 'H':
-            path = ['C'].concat(lineToCurve(d.x, d.y, path[1], d.y));
+            path = [ 'C', ...lineToCurve(d.x, d.y, path[1], d.y) ];
             break;
           case 'V':
-            path = ['C'].concat(lineToCurve(d.x, d.y, d.x, path[1]));
+            path = [ 'C', ...lineToCurve(d.x, d.y, d.x, path[1]) ];
             break;
           case 'Z':
-            path = ['C'].concat(lineToCurve(d.x, d.y, d.X, d.Y));
+            path = [ 'C', ...lineToCurve(d.x, d.y, d.X, d.Y) ];
             break;
           }
 
@@ -4535,7 +4531,7 @@
 
             while (pi.length) {
               pathCommands[i] = 'A'; // if created multiple C:s, their original seg is saved
-              pp.splice(i++, 0, ['C'].concat(pi.splice(0, 6)));
+              pp.splice(i++, 0, [ 'C', ...pi.splice(0, 6) ]);
             }
 
             pp.splice(i, 1);
@@ -4578,10 +4574,6 @@
     return curvedPath;
   }
 
-  var intersect = findPathIntersections;
-
-  var intersectPaths = /*@__PURE__*/getDefaultExportFromCjs(intersect);
-
   /**
    * Checks whether a value is an instance of Connection.
    *
@@ -4859,7 +4851,7 @@
 
 
   function getIntersections(a, b) {
-    return intersectPaths(a, b);
+    return findPathIntersections(a, b);
   }
 
 
@@ -6646,32 +6638,17 @@
     }
   };
 
-  var objectRefs = {exports: {}};
-
-  var collection = {};
-
-  /**
-   * An empty collection stub. Use {@link RefsCollection.extend} to extend a
-   * collection with ref semantics.
-   *
-   * @class RefsCollection
-   */
-
   /**
    * Extends a collection with {@link Refs} aware methods
    *
-   * @memberof RefsCollection
-   * @static
-   *
-   * @param  {Array<Object>} collection
-   * @param  {Refs} refs instance
-   * @param  {Object} property represented by the collection
-   * @param  {Object} target object the collection is attached to
+   * @param {Array<Object>} collection
+   * @param {Refs} refs instance
+   * @param {Object} property represented by the collection
+   * @param {Object} target object the collection is attached to
    *
    * @return {RefsCollection<Object>} the extended array
    */
   function extend(collection, refs, property, target) {
-
     var inverseProperty = property.inverse;
 
     /**
@@ -6682,7 +6659,7 @@
      * @param {Object} element the element to remove
      */
     Object.defineProperty(collection, 'remove', {
-      value: function(element) {
+      value: function (element) {
         var idx = this.indexOf(element);
         if (idx !== -1) {
           this.splice(idx, 1);
@@ -6690,7 +6667,6 @@
           // unset inverse
           refs.unset(element, inverseProperty, target);
         }
-
         return element;
       }
     });
@@ -6703,7 +6679,7 @@
      * @param {Object} element the element to check for
      */
     Object.defineProperty(collection, 'contains', {
-      value: function(element) {
+      value: function (element) {
         return this.indexOf(element) !== -1;
       }
     });
@@ -6718,12 +6694,9 @@
      *                 (possibly moving other elements around)
      */
     Object.defineProperty(collection, 'add', {
-      value: function(element, idx) {
-
+      value: function (element, idx) {
         var currentIdx = this.indexOf(element);
-
         if (typeof idx === 'undefined') {
-
           if (currentIdx !== -1) {
             // element already in collection (!)
             return;
@@ -6735,14 +6708,12 @@
 
         // handle already in collection
         if (currentIdx !== -1) {
-
           // remove element from currentIdx
           this.splice(currentIdx, 1);
         }
 
         // add element at idx
         this.splice(idx, 0, element);
-
         if (currentIdx === -1) {
           // set inverse, unless element was
           // in collection already
@@ -6756,69 +6727,53 @@
     Object.defineProperty(collection, '__refs_collection', {
       value: true
     });
-
     return collection;
   }
 
-
+  /**
+   * Checks if a given collection is extended
+   *
+   * @param {Array<Object>} collection
+   *
+   * @return {boolean}
+   */
   function isExtended(collection) {
     return collection.__refs_collection === true;
   }
 
-  collection.extend = extend;
-
-  collection.isExtended = isExtended;
-
-  var Collection = collection;
-
   function hasOwnProperty$1(e, property) {
     return Object.prototype.hasOwnProperty.call(e, property.name || property);
   }
-
   function defineCollectionProperty(ref, property, target) {
-
-    var collection = Collection.extend(target[property.name] || [], ref, property, target);
-
+    var collection = extend(target[property.name] || [], ref, property, target);
     Object.defineProperty(target, property.name, {
       enumerable: property.enumerable,
       value: collection
     });
-
     if (collection.length) {
-
-      collection.forEach(function(o) {
+      collection.forEach(function (o) {
         ref.set(o, property.inverse, target);
       });
     }
   }
-
-
   function defineProperty$1(ref, property, target) {
-
     var inverseProperty = property.inverse;
-
     var _value = target[property.name];
-
     Object.defineProperty(target, property.name, {
       configurable: property.configurable,
       enumerable: property.enumerable,
-
-      get: function() {
+      get: function () {
         return _value;
       },
-
-      set: function(value) {
-
+      set: function (value) {
         // return if we already performed all changes
         if (value === _value) {
           return;
         }
-
         var old = _value;
 
         // temporary set null
         _value = null;
-
         if (old) {
           ref.unset(old, inverseProperty, target);
         }
@@ -6830,7 +6785,6 @@
         ref.set(_value, inverseProperty, target);
       }
     });
-
   }
 
   /**
@@ -6876,16 +6830,14 @@
    *
    * wheels[0].car // undefined
    */
-  function Refs$1(a, b) {
-
-    if (!(this instanceof Refs$1)) {
-      return new Refs$1(a, b);
+  function Refs(a, b) {
+    if (!(this instanceof Refs)) {
+      return new Refs(a, b);
     }
 
     // link
     a.inverse = b;
     b.inverse = a;
-
     this.props = {};
     this.props[a.name] = a;
     this.props[b.name] = b;
@@ -6900,43 +6852,34 @@
    * @param  {Object} target
    * @param  {String} property
    */
-  Refs$1.prototype.bind = function(target, property) {
+  Refs.prototype.bind = function (target, property) {
     if (typeof property === 'string') {
       if (!this.props[property]) {
         throw new Error('no property <' + property + '> in ref');
       }
       property = this.props[property];
     }
-
     if (property.collection) {
       defineCollectionProperty(this, property, target);
     } else {
       defineProperty$1(this, property, target);
     }
   };
-
-  Refs$1.prototype.ensureRefsCollection = function(target, property) {
-
+  Refs.prototype.ensureRefsCollection = function (target, property) {
     var collection = target[property.name];
-
-    if (!Collection.isExtended(collection)) {
+    if (!isExtended(collection)) {
       defineCollectionProperty(this, property, target);
     }
-
     return collection;
   };
-
-  Refs$1.prototype.ensureBound = function(target, property) {
+  Refs.prototype.ensureBound = function (target, property) {
     if (!hasOwnProperty$1(target, property)) {
       this.bind(target, property);
     }
   };
-
-  Refs$1.prototype.unset = function(target, property, value) {
-
+  Refs.prototype.unset = function (target, property, value) {
     if (target) {
       this.ensureBound(target, property);
-
       if (property.collection) {
         this.ensureRefsCollection(target, property).remove(value);
       } else {
@@ -6944,12 +6887,9 @@
       }
     }
   };
-
-  Refs$1.prototype.set = function(target, property, value) {
-
+  Refs.prototype.set = function (target, property, value) {
     if (target) {
       this.ensureBound(target, property);
-
       if (property.collection) {
         this.ensureRefsCollection(target, property).add(value);
       } else {
@@ -6958,15 +6898,6 @@
     }
   };
 
-  var refs = Refs$1;
-
-  objectRefs.exports = refs;
-
-  objectRefs.exports.Collection = collection;
-
-  var objectRefsExports = objectRefs.exports;
-  var Refs = /*@__PURE__*/getDefaultExportFromCjs(objectRefsExports);
-
   var parentRefs = new Refs({ name: 'children', enumerable: true, collection: true }, { name: 'parent' }),
       labelRefs = new Refs({ name: 'labels', enumerable: true, collection: true }, { name: 'labelTarget' }),
       attacherRefs = new Refs({ name: 'attachers', collection: true }, { name: 'host' }),
@@ -26371,6 +26302,10 @@
     NavigatedViewer.prototype._navigationModules
   );
 
+  function getDefaultExportFromCjs (x) {
+  	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+  }
+
   var hammer = {exports: {}};
 
   /*! Hammer.JS - v2.0.7 - 2016-04-22
@@ -30431,6 +30366,10 @@
           return (entry.rank || 0) >= 0;
         }
 
+        if (entry.searchable === false) {
+          return false;
+        }
+
         const search = [
           entry.description || '',
           entry.label || '',
@@ -33728,7 +33667,7 @@
    */
   function getPathIntersection(waypoints, reference) {
 
-    var intersections = intersectPaths(circlePath(reference, INTERSECTION_THRESHOLD$1), linePath(waypoints));
+    var intersections = findPathIntersections(circlePath(reference, INTERSECTION_THRESHOLD$1), linePath(waypoints));
 
     var a = intersections[0],
         b = intersections[intersections.length - 1],