bpmn-js 18.18.0 → 18.19.0

package/dist/bpmn-modeler.development.js

@@ -1,5 +1,5 @@
 /*!
- * bpmn-js - bpmn-modeler v18.18.0
+ * bpmn-js - bpmn-modeler v18.19.0
  *
  * Copyright (c) 2014-present, camunda Services GmbH
  *
@@ -8,7 +8,7 @@
  *
  * Source Code: https://github.com/bpmn-io/bpmn-js
  *
- * Date: 2026-06-08
+ * Date: 2026-06-24
  */
 (function (global, factory) {
 	typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
@@ -29050,22 +29050,43 @@
 	 * spliced in. Recurses into step entries so the whole tree uses the array
 	 * shape downstream.
 	 *
+	 * Leaf entries inherit the `search` terms of their ancestors, so a leaf can be
+	 * found by keywords declared on any of its parents.
+	 *
 	 * @param {import('./PopupMenuProvider').PopupMenuEntries} entriesMap
+	 * @param {string[]} [search]
 	 *
 	 * @return {import('./PopupMenuProvider').PopupMenuEntry[]}
 	 */
-	function flattenEntries(entriesMap) {
+	function flattenEntries(entriesMap, search = []) {
 	  return Object.entries(entriesMap).map(([ id, value ]) => {
 	    const entry = { id, ...value };
 
 	    if (entry.entries) {
-	      entry.entries = flattenEntries(entry.entries);
+	      entry.entries = flattenEntries(
+	        entry.entries,
+	        [ ...search, ...asArray(entry.search) ]
+	      );
+	    } else if (search.length) {
+	      entry.search = [ ...search, ...asArray(entry.search) ];
 	    }
 
 	    return entry;
 	  });
 	}
 
+	/**
+	 * @param {string | string[]} [value]
+	 * @return {string[]}
+	 */
+	function asArray(value) {
+	  if (!value) {
+	    return [];
+	  }
+
+	  return isArray$2(value) ? value : [ value ];
+	}
+
 	/**
 	 * @typedef { {
 	 *   index: number;