@n8n/utils 1.8.0 → 1.10.0

package/dist/event-queue.cjs

@@ -0,0 +1,30 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/event-queue.ts
+function createEventQueue(processEvent) {
+  const queue = [];
+  let processing = false;
+  async function processNext() {
+    if (processing || queue.length === 0) {
+      return;
+    }
+    processing = true;
+    const currentEvent = queue.shift();
+    if (currentEvent !== void 0) {
+      try {
+        await processEvent(currentEvent);
+      } catch (error) {
+        console.error("Error processing event:", error);
+      }
+    }
+    processing = false;
+    await processNext();
+  }
+  function enqueue(event) {
+    queue.push(event);
+    void processNext();
+  }
+  return { enqueue };
+}
+
+
+exports.createEventQueue = createEventQueue;
+//# sourceMappingURL=event-queue.cjs.map

package/dist/event-queue.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/event-queue.cjs","../src/event-queue.ts"],"names":[],"mappings":"AAAA;ACMO,SAAS,gBAAA,CAAoB,YAAA,EAA2C;AAE9E,EAAA,MAAM,MAAA,EAAa,CAAC,CAAA;AAGpB,EAAA,IAAI,WAAA,EAAa,KAAA;AAKjB,EAAA,MAAA,SAAe,WAAA,CAAA,EAA6B;AAC3C,IAAA,GAAA,CAAI,WAAA,GAAc,KAAA,CAAM,OAAA,IAAW,CAAA,EAAG;AACrC,MAAA,MAAA;AAAA,IACD;AAEA,IAAA,WAAA,EAAa,IAAA;AACb,IAAA,MAAM,aAAA,EAAe,KAAA,CAAM,KAAA,CAAM,CAAA;AAEjC,IAAA,GAAA,CAAI,aAAA,IAAiB,KAAA,CAAA,EAAW;AAC/B,MAAA,IAAI;AACH,QAAA,MAAM,YAAA,CAAa,YAAY,CAAA;AAAA,MAChC,EAAA,MAAA,CAAS,KAAA,EAAO;AACf,QAAA,OAAA,CAAQ,KAAA,CAAM,yBAAA,EAA2B,KAAK,CAAA;AAAA,MAC/C;AAAA,IACD;AAEA,IAAA,WAAA,EAAa,KAAA;AAGb,IAAA,MAAM,WAAA,CAAY,CAAA;AAAA,EACnB;AAOA,EAAA,SAAS,OAAA,CAAQ,KAAA,EAAgB;AAChC,IAAA,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AAChB,IAAA,KAAK,WAAA,CAAY,CAAA;AAAA,EAClB;AAEA,EAAA,OAAO,EAAE,QAAQ,CAAA;AAClB;ADvBA;AACE;AACF,4CAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/event-queue.cjs","sourcesContent":[null,"/**\n * Create an event queue that processes events sequentially.\n *\n * @param processEvent - Async function that processes a single event.\n * @returns A function that enqueues events for processing.\n */\nexport function createEventQueue<T>(processEvent: (event: T) => Promise<void>) {\n\t// The internal queue holding events.\n\tconst queue: T[] = [];\n\n\t// Flag to indicate whether an event is currently being processed.\n\tlet processing = false;\n\n\t/**\n\t * Process the next event in the queue (if not already processing).\n\t */\n\tasync function processNext(): Promise<void> {\n\t\tif (processing || queue.length === 0) {\n\t\t\treturn;\n\t\t}\n\n\t\tprocessing = true;\n\t\tconst currentEvent = queue.shift();\n\n\t\tif (currentEvent !== undefined) {\n\t\t\ttry {\n\t\t\t\tawait processEvent(currentEvent);\n\t\t\t} catch (error) {\n\t\t\t\tconsole.error('Error processing event:', error);\n\t\t\t}\n\t\t}\n\n\t\tprocessing = false;\n\n\t\t// Recursively process the next event.\n\t\tawait processNext();\n\t}\n\n\t/**\n\t * Enqueue an event and trigger processing.\n\t *\n\t * @param event - The event to enqueue.\n\t */\n\tfunction enqueue(event: T): void {\n\t\tqueue.push(event);\n\t\tvoid processNext();\n\t}\n\n\treturn { enqueue };\n}\n"]}

package/dist/event-queue.d.cts

@@ -0,0 +1,5 @@
+declare function createEventQueue<T>(processEvent: (event: T) => Promise<void>): {
+    enqueue: (event: T) => void;
+};
+
+export { createEventQueue };

package/dist/event-queue.d.ts

@@ -0,0 +1,5 @@
+declare function createEventQueue<T>(processEvent: (event: T) => Promise<void>): {
+    enqueue: (event: T) => void;
+};
+
+export { createEventQueue };

package/dist/event-queue.js

@@ -0,0 +1,30 @@
+// src/event-queue.ts
+function createEventQueue(processEvent) {
+  const queue = [];
+  let processing = false;
+  async function processNext() {
+    if (processing || queue.length === 0) {
+      return;
+    }
+    processing = true;
+    const currentEvent = queue.shift();
+    if (currentEvent !== void 0) {
+      try {
+        await processEvent(currentEvent);
+      } catch (error) {
+        console.error("Error processing event:", error);
+      }
+    }
+    processing = false;
+    await processNext();
+  }
+  function enqueue(event) {
+    queue.push(event);
+    void processNext();
+  }
+  return { enqueue };
+}
+export {
+  createEventQueue
+};
+//# sourceMappingURL=event-queue.js.map

package/dist/event-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/event-queue.ts"],"sourcesContent":["/**\n * Create an event queue that processes events sequentially.\n *\n * @param processEvent - Async function that processes a single event.\n * @returns A function that enqueues events for processing.\n */\nexport function createEventQueue<T>(processEvent: (event: T) => Promise<void>) {\n\t// The internal queue holding events.\n\tconst queue: T[] = [];\n\n\t// Flag to indicate whether an event is currently being processed.\n\tlet processing = false;\n\n\t/**\n\t * Process the next event in the queue (if not already processing).\n\t */\n\tasync function processNext(): Promise<void> {\n\t\tif (processing || queue.length === 0) {\n\t\t\treturn;\n\t\t}\n\n\t\tprocessing = true;\n\t\tconst currentEvent = queue.shift();\n\n\t\tif (currentEvent !== undefined) {\n\t\t\ttry {\n\t\t\t\tawait processEvent(currentEvent);\n\t\t\t} catch (error) {\n\t\t\t\tconsole.error('Error processing event:', error);\n\t\t\t}\n\t\t}\n\n\t\tprocessing = false;\n\n\t\t// Recursively process the next event.\n\t\tawait processNext();\n\t}\n\n\t/**\n\t * Enqueue an event and trigger processing.\n\t *\n\t * @param event - The event to enqueue.\n\t */\n\tfunction enqueue(event: T): void {\n\t\tqueue.push(event);\n\t\tvoid processNext();\n\t}\n\n\treturn { enqueue };\n}\n"],"mappings":";AAMO,SAAS,iBAAoB,cAA2C;AAE9E,QAAM,QAAa,CAAC;AAGpB,MAAI,aAAa;AAKjB,iBAAe,cAA6B;AAC3C,QAAI,cAAc,MAAM,WAAW,GAAG;AACrC;AAAA,IACD;AAEA,iBAAa;AACb,UAAM,eAAe,MAAM,MAAM;AAEjC,QAAI,iBAAiB,QAAW;AAC/B,UAAI;AACH,cAAM,aAAa,YAAY;AAAA,MAChC,SAAS,OAAO;AACf,gBAAQ,MAAM,2BAA2B,KAAK;AAAA,MAC/C;AAAA,IACD;AAEA,iBAAa;AAGb,UAAM,YAAY;AAAA,EACnB;AAOA,WAAS,QAAQ,OAAgB;AAChC,UAAM,KAAK,KAAK;AAChB,SAAK,YAAY;AAAA,EAClB;AAEA,SAAO,EAAE,QAAQ;AAClB;","names":[]}

package/dist/retry.cjs

@@ -0,0 +1,31 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/retry.ts
+async function retry(fn, interval = 1e3, maxRetries = 3, backoff = "linear") {
+  let attempt = 0;
+  while (attempt < maxRetries) {
+    attempt++;
+    try {
+      const result = await fn();
+      if (result) {
+        return true;
+      }
+    } catch (error) {
+      console.error("Error during retry:", error);
+      throw error;
+    }
+    if (attempt < maxRetries) {
+      let computedInterval = interval;
+      if (backoff === "linear") {
+        computedInterval = interval * attempt;
+      } else if (backoff === "exponential") {
+        computedInterval = Math.pow(2, attempt - 1) * interval;
+        computedInterval = Math.min(computedInterval, 3e4);
+      }
+      await new Promise((resolve) => setTimeout(resolve, computedInterval));
+    }
+  }
+  return false;
+}
+
+
+exports.retry = retry;
+//# sourceMappingURL=retry.cjs.map

package/dist/retry.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/retry.cjs","../src/retry.ts"],"names":[],"mappings":"AAAA;ACcA,MAAA,SAAsB,KAAA,CACrB,EAAA,EACA,SAAA,EAAmB,GAAA,EACnB,WAAA,EAAqB,CAAA,EACrB,QAAA,EAA2C,QAAA,EACxB;AACnB,EAAA,IAAI,QAAA,EAAU,CAAA;AAEd,EAAA,MAAA,CAAO,QAAA,EAAU,UAAA,EAAY;AAC5B,IAAA,OAAA,EAAA;AACA,IAAA,IAAI;AACH,MAAA,MAAM,OAAA,EAAS,MAAM,EAAA,CAAG,CAAA;AACxB,MAAA,GAAA,CAAI,MAAA,EAAQ;AACX,QAAA,OAAO,IAAA;AAAA,MACR;AAAA,IACD,EAAA,MAAA,CAAS,KAAA,EAAO;AACf,MAAA,OAAA,CAAQ,KAAA,CAAM,qBAAA,EAAuB,KAAK,CAAA;AAC1C,MAAA,MAAM,KAAA;AAAA,IACP;AAGA,IAAA,GAAA,CAAI,QAAA,EAAU,UAAA,EAAY;AACzB,MAAA,IAAI,iBAAA,EAAmB,QAAA;AAEvB,MAAA,GAAA,CAAI,QAAA,IAAY,QAAA,EAAU;AACzB,QAAA,iBAAA,EAAmB,SAAA,EAAW,OAAA;AAAA,MAC/B,EAAA,KAAA,GAAA,CAAW,QAAA,IAAY,aAAA,EAAe;AACrC,QAAA,iBAAA,EAAmB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAA,EAAU,CAAC,EAAA,EAAI,QAAA;AAC9C,QAAA,iBAAA,EAAmB,IAAA,CAAK,GAAA,CAAI,gBAAA,EAAkB,GAAK,CAAA;AAAA,MACpD;AAEA,MAAA,MAAM,IAAI,OAAA,CAAc,CAAC,OAAA,EAAA,GAAY,UAAA,CAAW,OAAA,EAAS,gBAAgB,CAAC,CAAA;AAAA,IAC3E;AAAA,EACD;AAEA,EAAA,OAAO,KAAA;AACR;ADvBA;AACE;AACF,sBAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/retry.cjs","sourcesContent":[null,"type RetryFn = () => boolean | Promise<boolean>;\n\n/**\n * A utility that retries a function every `interval` milliseconds\n * until the function returns true or the maximum number of retries is reached.\n *\n * @param fn - A function that returns a boolean or a Promise resolving to a boolean.\n * @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.\n * @param maxRetries - The maximum number of retry attempts. Defaults to 3.\n * @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.\n * @returns {Promise<boolean>} - A promise that resolves to:\n *   - true: If the function returns true before reaching maxRetries.\n *   - false: If the function never returns true or if an error occurs.\n */\nexport async function retry(\n\tfn: RetryFn,\n\tinterval: number = 1000,\n\tmaxRetries: number = 3,\n\tbackoff: 'exponential' | 'linear' | null = 'linear',\n): Promise<boolean> {\n\tlet attempt = 0;\n\n\twhile (attempt < maxRetries) {\n\t\tattempt++;\n\t\ttry {\n\t\t\tconst result = await fn();\n\t\t\tif (result) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t} catch (error) {\n\t\t\tconsole.error('Error during retry:', error);\n\t\t\tthrow error;\n\t\t}\n\n\t\t// Wait for the specified interval before the next attempt, if any attempts remain.\n\t\tif (attempt < maxRetries) {\n\t\t\tlet computedInterval = interval;\n\n\t\t\tif (backoff === 'linear') {\n\t\t\t\tcomputedInterval = interval * attempt;\n\t\t\t} else if (backoff === 'exponential') {\n\t\t\t\tcomputedInterval = Math.pow(2, attempt - 1) * interval;\n\t\t\t\tcomputedInterval = Math.min(computedInterval, 30000); // Cap the maximum interval to 30 seconds\n\t\t\t}\n\n\t\t\tawait new Promise<void>((resolve) => setTimeout(resolve, computedInterval));\n\t\t}\n\t}\n\n\treturn false;\n}\n"]}

package/dist/retry.d.cts

@@ -0,0 +1,4 @@
+type RetryFn = () => boolean | Promise<boolean>;
+declare function retry(fn: RetryFn, interval?: number, maxRetries?: number, backoff?: 'exponential' | 'linear' | null): Promise<boolean>;
+
+export { retry };

package/dist/retry.d.ts

@@ -0,0 +1,4 @@
+type RetryFn = () => boolean | Promise<boolean>;
+declare function retry(fn: RetryFn, interval?: number, maxRetries?: number, backoff?: 'exponential' | 'linear' | null): Promise<boolean>;
+
+export { retry };

package/dist/retry.js

@@ -0,0 +1,31 @@
+// src/retry.ts
+async function retry(fn, interval = 1e3, maxRetries = 3, backoff = "linear") {
+  let attempt = 0;
+  while (attempt < maxRetries) {
+    attempt++;
+    try {
+      const result = await fn();
+      if (result) {
+        return true;
+      }
+    } catch (error) {
+      console.error("Error during retry:", error);
+      throw error;
+    }
+    if (attempt < maxRetries) {
+      let computedInterval = interval;
+      if (backoff === "linear") {
+        computedInterval = interval * attempt;
+      } else if (backoff === "exponential") {
+        computedInterval = Math.pow(2, attempt - 1) * interval;
+        computedInterval = Math.min(computedInterval, 3e4);
+      }
+      await new Promise((resolve) => setTimeout(resolve, computedInterval));
+    }
+  }
+  return false;
+}
+export {
+  retry
+};
+//# sourceMappingURL=retry.js.map

package/dist/retry.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/retry.ts"],"sourcesContent":["type RetryFn = () => boolean | Promise<boolean>;\n\n/**\n * A utility that retries a function every `interval` milliseconds\n * until the function returns true or the maximum number of retries is reached.\n *\n * @param fn - A function that returns a boolean or a Promise resolving to a boolean.\n * @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.\n * @param maxRetries - The maximum number of retry attempts. Defaults to 3.\n * @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.\n * @returns {Promise<boolean>} - A promise that resolves to:\n *   - true: If the function returns true before reaching maxRetries.\n *   - false: If the function never returns true or if an error occurs.\n */\nexport async function retry(\n\tfn: RetryFn,\n\tinterval: number = 1000,\n\tmaxRetries: number = 3,\n\tbackoff: 'exponential' | 'linear' | null = 'linear',\n): Promise<boolean> {\n\tlet attempt = 0;\n\n\twhile (attempt < maxRetries) {\n\t\tattempt++;\n\t\ttry {\n\t\t\tconst result = await fn();\n\t\t\tif (result) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t} catch (error) {\n\t\t\tconsole.error('Error during retry:', error);\n\t\t\tthrow error;\n\t\t}\n\n\t\t// Wait for the specified interval before the next attempt, if any attempts remain.\n\t\tif (attempt < maxRetries) {\n\t\t\tlet computedInterval = interval;\n\n\t\t\tif (backoff === 'linear') {\n\t\t\t\tcomputedInterval = interval * attempt;\n\t\t\t} else if (backoff === 'exponential') {\n\t\t\t\tcomputedInterval = Math.pow(2, attempt - 1) * interval;\n\t\t\t\tcomputedInterval = Math.min(computedInterval, 30000); // Cap the maximum interval to 30 seconds\n\t\t\t}\n\n\t\t\tawait new Promise<void>((resolve) => setTimeout(resolve, computedInterval));\n\t\t}\n\t}\n\n\treturn false;\n}\n"],"mappings":";AAcA,eAAsB,MACrB,IACA,WAAmB,KACnB,aAAqB,GACrB,UAA2C,UACxB;AACnB,MAAI,UAAU;AAEd,SAAO,UAAU,YAAY;AAC5B;AACA,QAAI;AACH,YAAM,SAAS,MAAM,GAAG;AACxB,UAAI,QAAQ;AACX,eAAO;AAAA,MACR;AAAA,IACD,SAAS,OAAO;AACf,cAAQ,MAAM,uBAAuB,KAAK;AAC1C,YAAM;AAAA,IACP;AAGA,QAAI,UAAU,YAAY;AACzB,UAAI,mBAAmB;AAEvB,UAAI,YAAY,UAAU;AACzB,2BAAmB,WAAW;AAAA,MAC/B,WAAW,YAAY,eAAe;AACrC,2BAAmB,KAAK,IAAI,GAAG,UAAU,CAAC,IAAI;AAC9C,2BAAmB,KAAK,IAAI,kBAAkB,GAAK;AAAA,MACpD;AAEA,YAAM,IAAI,QAAc,CAAC,YAAY,WAAW,SAAS,gBAAgB,CAAC;AAAA,IAC3E;AAAA,EACD;AAEA,SAAO;AACR;","names":[]}

package/dist/search/sublimeSearch.cjs

@@ -1,6 +1,6 @@
 "use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/search/sublimeSearch.ts
 var SEQUENTIAL_BONUS = 60;
-var SEPARATOR_BONUS = 30;
+var SEPARATOR_BONUS = 38;
 var CAMEL_BONUS = 30;
 var FIRST_LETTER_BONUS = 15;
 var LEADING_LETTER_PENALTY = -20;

package/dist/search/sublimeSearch.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/search/sublimeSearch.cjs","../../src/search/sublimeSearch.ts"],"names":[],"mappings":"AAAA;ACKA,IAAM,iBAAA,EAAmB,EAAA;AACzB,IAAM,gBAAA,EAAkB,EAAA;AACxB,IAAM,YAAA,EAAc,EAAA;AACpB,IAAM,mBAAA,EAAqB,EAAA;AAE3B,IAAM,uBAAA,EAAyB,CAAA,EAAA;AAC/B,IAAM,2BAAA,EAA6B,CAAA,GAAA;AACnC,IAAM,yBAAA,EAA2B,CAAA,CAAA;AAE1B,IAAM,aAAA,EAAe;AAAA,EAC3B,EAAE,GAAA,EAAK,wBAAA,EAA0B,MAAA,EAAQ,IAAI,CAAA;AAAA,EAC7C,EAAE,GAAA,EAAK,wBAAA,EAA0B,MAAA,EAAQ,EAAE;AAC5C,CAAA;AAOA,SAAS,gBAAA,CAAiB,OAAA,EAAiB,MAAA,EAAyB;AACnE,EAAA,IAAI,WAAA,EAAa,CAAA;AACjB,EAAA,IAAI,OAAA,EAAS,CAAA;AAEb,EAAA,MAAA,CAAO,WAAA,EAAa,OAAA,CAAQ,OAAA,GAAU,OAAA,EAAS,MAAA,CAAO,MAAA,EAAQ;AAC7D,IAAA,MAAM,YAAA,EAAc,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,CAAE,WAAA,CAAY,CAAA;AAC3D,IAAA,MAAM,WAAA,EAAa,MAAA,CAAO,MAAA,CAAO,MAAM,CAAA,CAAE,WAAA,CAAY,CAAA;AACrD,IAAA,GAAA,CAAI,YAAA,IAAgB,UAAA,EAAY;AAC/B,MAAA,UAAA,EAAA;AAAA,IACD;AACA,IAAA,EAAE,MAAA;AAAA,EACH;AAEA,EAAA,OAAO,OAAA,CAAQ,OAAA,IAAW,EAAA,GAAK,MAAA,CAAO,OAAA,IAAW,EAAA,GAAK,WAAA,IAAe,OAAA,CAAQ,MAAA;AAC9E;AAEA,SAAS,mBAAA,CACR,OAAA,EACA,MAAA,EACA,eAAA,EACA,eAAA,EACA,aAAA,EACA,OAAA,EACA,UAAA,EACA,SAAA,EACA,cAAA,EACA,cAAA,EACyC;AACzC,EAAA,IAAI,SAAA,EAAW,CAAA;AAGf,EAAA,GAAA,CAAI,EAAE,eAAA,GAAkB,cAAA,EAAgB;AACvC,IAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AAAA,EACnC;AAGA,EAAA,GAAA,CAAI,gBAAA,IAAoB,OAAA,CAAQ,OAAA,GAAU,gBAAA,IAAoB,MAAA,CAAO,MAAA,EAAQ;AAC5E,IAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AAAA,EACnC;AAGA,EAAA,IAAI,eAAA,EAAiB,KAAA;AACrB,EAAA,IAAI,qBAAA,EAAiC,CAAC,CAAA;AACtC,EAAA,IAAI,mBAAA,EAAqB,CAAA;AAGzB,EAAA,IAAI,WAAA,EAAa,IAAA;AACjB,EAAA,MAAA,CAAO,gBAAA,EAAkB,OAAA,CAAQ,OAAA,GAAU,gBAAA,EAAkB,MAAA,CAAO,MAAA,EAAQ;AAE3E,IAAA,GAAA,CAAI,OAAA,CAAQ,eAAe,CAAA,CAAE,WAAA,CAAY,EAAA,IAAM,MAAA,CAAO,eAAe,CAAA,CAAE,WAAA,CAAY,CAAA,EAAG;AACrF,MAAA,GAAA,CAAI,UAAA,GAAa,UAAA,EAAY;AAC5B,QAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AAAA,MACnC;AAEA,MAAA,GAAA,CAAI,WAAA,GAAc,aAAA,EAAe;AAChC,QAAA,QAAA,EAAU,CAAC,GAAG,aAAa,CAAA;AAC3B,QAAA,WAAA,EAAa,KAAA;AAAA,MACd;AAEA,MAAA,MAAM,iBAAA,EAA6B,CAAC,CAAA;AACpC,MAAA,MAAM,gBAAA,EAAkB,mBAAA;AAAA,QACvB,OAAA;AAAA,QACA,MAAA;AAAA,QACA,eAAA;AAAA,QACA,gBAAA,EAAkB,CAAA;AAAA,QAClB,OAAA;AAAA,QACA,gBAAA;AAAA,QACA,UAAA;AAAA,QACA,SAAA;AAAA,QACA,cAAA;AAAA,QACA;AAAA,MACD,CAAA;AAEA,MAAA,MAAM,eAAA,EAAiB,eAAA,CAAgB,QAAA;AACvC,MAAA,GAAA,CAAI,eAAA,CAAgB,OAAA,EAAS;AAE5B,QAAA,GAAA,CAAI,CAAC,eAAA,GAAkB,eAAA,EAAiB,kBAAA,EAAoB;AAC3D,UAAA,qBAAA,EAAuB,CAAC,GAAG,gBAAgB,CAAA;AAC3C,UAAA,mBAAA,EAAqB,cAAA;AAAA,QACtB;AACA,QAAA,eAAA,EAAiB,IAAA;AAAA,MAClB;AAEA,MAAA,OAAA,CAAQ,SAAA,EAAW,EAAA,EAAI,eAAA;AACvB,MAAA,EAAE,eAAA;AAAA,IACH;AACA,IAAA,EAAE,eAAA;AAAA,EACH;AAEA,EAAA,MAAM,QAAA,EAAU,gBAAA,IAAoB,OAAA,CAAQ,MAAA;AAE5C,EAAA,GAAA,CAAI,OAAA,EAAS;AACZ,IAAA,SAAA,EAAW,GAAA;AAGX,IAAA,GAAA,CAAI,CAAC,MAAA,CAAO,WAAA,CAAY,CAAA,CAAE,UAAA,CAAW,KAAK,CAAA,EAAG;AAC5C,MAAA,IAAI,QAAA,EAAU,uBAAA,EAAyB,OAAA,CAAQ,CAAC,CAAA;AAChD,MAAA,QAAA,EAAU,QAAA,EAAU,2BAAA,EAA6B,2BAAA,EAA6B,OAAA;AAC9E,MAAA,SAAA,GAAY,OAAA;AAAA,IACb;AAGA,IAAA,MAAM,UAAA,EAAY,MAAA,CAAO,OAAA,EAAS,SAAA;AAClC,IAAA,SAAA,GAAY,yBAAA,EAA2B,SAAA;AAGvC,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,SAAA,EAAW,CAAA,EAAA,EAAK;AACnC,MAAA,MAAM,QAAA,EAAU,OAAA,CAAQ,CAAC,CAAA;AAEzB,MAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG;AACV,QAAA,MAAM,QAAA,EAAU,OAAA,CAAQ,EAAA,EAAI,CAAC,CAAA;AAC7B,QAAA,GAAA,CAAI,QAAA,IAAY,QAAA,EAAU,CAAA,EAAG;AAC5B,UAAA,SAAA,GAAY,gBAAA;AAAA,QACb;AAAA,MACD;AAGA,MAAA,GAAA,CAAI,QAAA,EAAU,CAAA,EAAG;AAEhB,QAAA,MAAM,SAAA,EAAW,MAAA,CAAO,QAAA,EAAU,CAAC,CAAA;AACnC,QAAA,MAAM,KAAA,EAAO,MAAA,CAAO,OAAO,CAAA;AAC3B,QAAA,GAAA,CAAI,SAAA,IAAa,QAAA,CAAS,WAAA,CAAY,EAAA,GAAK,KAAA,IAAS,IAAA,CAAK,WAAA,CAAY,CAAA,EAAG;AACvE,UAAA,SAAA,GAAY,WAAA;AAAA,QACb;AACA,QAAA,MAAM,qBAAA,EAAuB,SAAA,IAAa,IAAA,GAAO,SAAA,IAAa,GAAA;AAC9D,QAAA,GAAA,CAAI,oBAAA,EAAsB;AACzB,UAAA,SAAA,GAAY,eAAA;AAAA,QACb;AAAA,MACD,EAAA,KAAO;AAEN,QAAA,SAAA,GAAY,kBAAA;AAAA,MACb;AAAA,IACD;AAGA,IAAA,GAAA,CAAI,eAAA,GAAA,CAAmB,CAAC,QAAA,GAAW,mBAAA,EAAqB,QAAA,CAAA,EAAW;AAElE,MAAA,QAAA,EAAU,CAAC,GAAG,oBAAoB,CAAA;AAClC,MAAA,SAAA,EAAW,kBAAA;AACX,MAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,SAAS,CAAA;AAAA,IAClC,EAAA,KAAA,GAAA,CAAW,OAAA,EAAS;AAEnB,MAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,SAAS,CAAA;AAAA,IAClC,EAAA,KAAO;AACN,MAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AAAA,IACnC;AAAA,EACD;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AACnC;AASA,SAAS,UAAA,CAAW,OAAA,EAAiB,MAAA,EAAwD;AAC5F,EAAA,MAAM,eAAA,EAAiB,CAAA;AACvB,EAAA,MAAM,eAAA,EAAiB,CAAA;AACvB,EAAA,MAAM,QAAA,EAAoB,CAAC,CAAA;AAC3B,EAAA,MAAM,WAAA,EAAa,GAAA;AAEnB,EAAA,OAAO,mBAAA;AAAA,IACN,OAAA;AAAA,IACA,MAAA;AAAA,IACA,CAAA;AAAA,IACA,CAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA;AAAA,IACA,CAAA;AAAA,IACA,cAAA;AAAA,IACA;AAAA,EACD,CAAA;AACD;AAKA,SAAS,QAAA,CAA2B,GAAA,EAAQ,IAAA,EAAuB;AAClE,EAAA,GAAA,CAAI,GAAA,CAAI,cAAA,CAAe,IAAI,CAAA,EAAG;AAC7B,IAAA,OAAO,GAAA,CAAI,IAAe,CAAA;AAAA,EAC3B;AAEA,EAAA,MAAM,SAAA,EAAW,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAE/B,EAAA,IAAI,OAAA,EAAS,GAAA;AACb,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,MAAA,CAAO,OAAA,GAAU,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ;AACrC,IAAA,MAAM,IAAA,EAAM,QAAA,CAAS,CAAC,CAAA;AACtB,IAAA,OAAA,EAAS,MAAA,CAAO,GAAG,CAAA;AACnB,IAAA,CAAA,EAAA;AAAA,EACD;AACA,EAAA,OAAO,MAAA;AACR;AAEO,SAAS,aAAA,CACf,MAAA,EACA,IAAA,EACA,KAAA,EAA+C,YAAA,EACX;AACpC,EAAA,MAAM,QAAA,EAAU,IAAA,CAAK,MAAA,CAAO,CAAC,IAAA,EAAyC,IAAA,EAAA,GAAY;AACjF,IAAA,IAAI,OAAA,EAAmD,CAAC,CAAA;AACxD,IAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,EAAE,GAAA,EAAK,OAAO,CAAA,EAAA,GAAM;AACjC,MAAA,MAAM,MAAA,EAAQ,QAAA,CAAS,IAAA,EAAM,GAAG,CAAA;AAChC,MAAA,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAEzB,QAAA,OAAA,EAAS,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,EAAA,GAAA,CAAO,EAAE,KAAA,EAAO,CAAA,EAAG,OAAO,CAAA,CAAE,CAAC,CAAA;AAAA,MAChE,EAAA,KAAA,GAAA,CAAW,OAAO,MAAA,IAAU,QAAA,EAAU;AACrC,QAAA,MAAA,CAAO,IAAA,CAAK;AAAA,UACX,KAAA;AAAA,UACA;AAAA,QACD,CAAC,CAAA;AAAA,MACF;AAAA,IACD,CAAC,CAAA;AAGD,IAAA,MAAM,UAAA,EAAY,MAAA,CAAO,MAAA;AAAA,MACxB,CACC,MAAA,EACA,EAAE,KAAA,EAAO,OAAO,CAAA,EAAA,GACZ;AACJ,QAAA,GAAA,CAAI,CAAC,gBAAA,CAAiB,MAAA,EAAQ,KAAK,CAAA,EAAG;AACrC,UAAA,OAAO,MAAA;AAAA,QACR;AAEA,QAAA,MAAM,MAAA,EAAQ,UAAA,CAAW,MAAA,EAAQ,KAAK,CAAA;AACtC,QAAA,KAAA,CAAM,SAAA,GAAY,MAAA;AAElB,QAAA,MAAM,EAAE,OAAA,EAAS,SAAS,EAAA,EAAI,KAAA;AAC9B,QAAA,GAAA,CAAI,CAAC,OAAA,GAAU,OAAA,EAAS;AACvB,UAAA,OAAO,KAAA;AAAA,QACR;AACA,QAAA,GAAA,CAAI,QAAA,GAAW,OAAA,GAAU,SAAA,EAAW,MAAA,CAAO,QAAA,EAAU;AACpD,UAAA,OAAO,KAAA;AAAA,QACR;AACA,QAAA,OAAO,MAAA;AAAA,MACR,CAAA;AAAA,MACA;AAAA,IACD,CAAA;AAEA,IAAA,GAAA,CAAI,SAAA,EAAW;AACd,MAAA,IAAA,CAAK,IAAA,CAAK;AAAA,QACT,KAAA,EAAO,SAAA,CAAU,QAAA;AAAA,QACjB;AAAA,MACD,CAAC,CAAA;AAAA,IACF;AAEA,IAAA,OAAO,IAAA;AAAA,EACR,CAAA,EAAG,CAAC,CAAC,CAAA;AAEL,EAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM;AACtB,IAAA,OAAO,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,KAAA;AAAA,EACpB,CAAC,CAAA;AAED,EAAA,OAAO,OAAA;AACR;ADxFA;AACE;AACA;AACF,2EAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/search/sublimeSearch.cjs","sourcesContent":[null,"/*\n * Constants and utility functions used for searching for node types in node creator component\n * based on https://github.com/forrestthewoods/lib_fts/blob/master/code/fts_fuzzy_match.js\n */\n\nconst SEQUENTIAL_BONUS = 60; // bonus for adjacent matches\nconst SEPARATOR_BONUS = 30; // bonus if match occurs after a separator\nconst CAMEL_BONUS = 30; // bonus if match is uppercase and prev is lower\nconst FIRST_LETTER_BONUS = 15; // bonus if the first letter is matched\n\nconst LEADING_LETTER_PENALTY = -20; // penalty applied for every letter in str before the first match\nconst MAX_LEADING_LETTER_PENALTY = -200; // maximum penalty for leading letters\nconst UNMATCHED_LETTER_PENALTY = -5;\n\nexport const DEFAULT_KEYS = [\n\t{ key: 'properties.displayName', weight: 1.3 },\n\t{ key: 'properties.codex.alias', weight: 1 },\n];\n\n/**\n * Returns true if each character in pattern is found sequentially within target\n * @param {*} pattern string\n * @param {*} target string\n */\nfunction fuzzyMatchSimple(pattern: string, target: string): boolean {\n\tlet patternIdx = 0;\n\tlet strIdx = 0;\n\n\twhile (patternIdx < pattern.length && strIdx < target.length) {\n\t\tconst patternChar = pattern.charAt(patternIdx).toLowerCase();\n\t\tconst targetChar = target.charAt(strIdx).toLowerCase();\n\t\tif (patternChar === targetChar) {\n\t\t\tpatternIdx++;\n\t\t}\n\t\t++strIdx;\n\t}\n\n\treturn pattern.length !== 0 && target.length !== 0 && patternIdx === pattern.length;\n}\n\nfunction fuzzyMatchRecursive(\n\tpattern: string,\n\ttarget: string,\n\tpatternCurIndex: number,\n\ttargetCurrIndex: number,\n\ttargetMatches: null | number[],\n\tmatches: number[],\n\tmaxMatches: number,\n\tnextMatch: number,\n\trecursionCount: number,\n\trecursionLimit: number,\n): { matched: boolean; outScore: number } {\n\tlet outScore = 0;\n\n\t// Return if recursion limit is reached.\n\tif (++recursionCount >= recursionLimit) {\n\t\treturn { matched: false, outScore };\n\t}\n\n\t// Return if we reached ends of strings.\n\tif (patternCurIndex === pattern.length || targetCurrIndex === target.length) {\n\t\treturn { matched: false, outScore };\n\t}\n\n\t// Recursion params\n\tlet recursiveMatch = false;\n\tlet bestRecursiveMatches: number[] = [];\n\tlet bestRecursiveScore = 0;\n\n\t// Loop through pattern and str looking for a match.\n\tlet firstMatch = true;\n\twhile (patternCurIndex < pattern.length && targetCurrIndex < target.length) {\n\t\t// Match found.\n\t\tif (pattern[patternCurIndex].toLowerCase() === target[targetCurrIndex].toLowerCase()) {\n\t\t\tif (nextMatch >= maxMatches) {\n\t\t\t\treturn { matched: false, outScore };\n\t\t\t}\n\n\t\t\tif (firstMatch && targetMatches) {\n\t\t\t\tmatches = [...targetMatches];\n\t\t\t\tfirstMatch = false;\n\t\t\t}\n\n\t\t\tconst recursiveMatches: number[] = [];\n\t\t\tconst recursiveResult = fuzzyMatchRecursive(\n\t\t\t\tpattern,\n\t\t\t\ttarget,\n\t\t\t\tpatternCurIndex,\n\t\t\t\ttargetCurrIndex + 1,\n\t\t\t\tmatches,\n\t\t\t\trecursiveMatches,\n\t\t\t\tmaxMatches,\n\t\t\t\tnextMatch,\n\t\t\t\trecursionCount,\n\t\t\t\trecursionLimit,\n\t\t\t);\n\n\t\t\tconst recursiveScore = recursiveResult.outScore;\n\t\t\tif (recursiveResult.matched) {\n\t\t\t\t// Pick best recursive score.\n\t\t\t\tif (!recursiveMatch || recursiveScore > bestRecursiveScore) {\n\t\t\t\t\tbestRecursiveMatches = [...recursiveMatches];\n\t\t\t\t\tbestRecursiveScore = recursiveScore;\n\t\t\t\t}\n\t\t\t\trecursiveMatch = true;\n\t\t\t}\n\n\t\t\tmatches[nextMatch++] = targetCurrIndex;\n\t\t\t++patternCurIndex;\n\t\t}\n\t\t++targetCurrIndex;\n\t}\n\n\tconst matched = patternCurIndex === pattern.length;\n\n\tif (matched) {\n\t\toutScore = 100;\n\n\t\t// Apply leading letter penalty (if not n8n-prefixed)\n\t\tif (!target.toLowerCase().startsWith('n8n')) {\n\t\t\tlet penalty = LEADING_LETTER_PENALTY * matches[0];\n\t\t\tpenalty = penalty < MAX_LEADING_LETTER_PENALTY ? MAX_LEADING_LETTER_PENALTY : penalty;\n\t\t\toutScore += penalty;\n\t\t}\n\n\t\t//Apply unmatched penalty\n\t\tconst unmatched = target.length - nextMatch;\n\t\toutScore += UNMATCHED_LETTER_PENALTY * unmatched;\n\n\t\t// Apply ordering bonuses\n\t\tfor (let i = 0; i < nextMatch; i++) {\n\t\t\tconst currIdx = matches[i];\n\n\t\t\tif (i > 0) {\n\t\t\t\tconst prevIdx = matches[i - 1];\n\t\t\t\tif (currIdx === prevIdx + 1) {\n\t\t\t\t\toutScore += SEQUENTIAL_BONUS;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Check for bonuses based on neighbor character value.\n\t\t\tif (currIdx > 0) {\n\t\t\t\t// Camel case\n\t\t\t\tconst neighbor = target[currIdx - 1];\n\t\t\t\tconst curr = target[currIdx];\n\t\t\t\tif (neighbor !== neighbor.toUpperCase() && curr !== curr.toLowerCase()) {\n\t\t\t\t\toutScore += CAMEL_BONUS;\n\t\t\t\t}\n\t\t\t\tconst isNeighbourSeparator = neighbor === '_' || neighbor === ' ';\n\t\t\t\tif (isNeighbourSeparator) {\n\t\t\t\t\toutScore += SEPARATOR_BONUS;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// First letter\n\t\t\t\toutScore += FIRST_LETTER_BONUS;\n\t\t\t}\n\t\t}\n\n\t\t// Return best result\n\t\tif (recursiveMatch && (!matched || bestRecursiveScore > outScore)) {\n\t\t\t// Recursive score is better than \"this\"\n\t\t\tmatches = [...bestRecursiveMatches];\n\t\t\toutScore = bestRecursiveScore;\n\t\t\treturn { matched: true, outScore };\n\t\t} else if (matched) {\n\t\t\t// \"this\" score is better than recursive\n\t\t\treturn { matched: true, outScore };\n\t\t} else {\n\t\t\treturn { matched: false, outScore };\n\t\t}\n\t}\n\treturn { matched: false, outScore };\n}\n\n/**\n * Does a fuzzy search to find pattern inside a string.\n * @param {*} pattern string        pattern to search for\n * @param {*} target     string        string which is being searched\n * @returns [boolean, number]       a boolean which tells if pattern was\n *                                  found or not and a search score\n */\nfunction fuzzyMatch(pattern: string, target: string): { matched: boolean; outScore: number } {\n\tconst recursionCount = 0;\n\tconst recursionLimit = 5;\n\tconst matches: number[] = [];\n\tconst maxMatches = 256;\n\n\treturn fuzzyMatchRecursive(\n\t\tpattern,\n\t\ttarget,\n\t\t0 /* patternCurIndex */,\n\t\t0 /* strCurrIndex */,\n\t\tnull /* srcMatces */,\n\t\tmatches,\n\t\tmaxMatches,\n\t\t0 /* nextMatch */,\n\t\trecursionCount,\n\t\trecursionLimit,\n\t);\n}\n\n// prop = 'key'\n// prop = 'key1.key2'\n// prop = ['key1', 'key2']\nfunction getValue<T extends object>(obj: T, prop: string): unknown {\n\tif (obj.hasOwnProperty(prop)) {\n\t\treturn obj[prop as keyof T];\n\t}\n\n\tconst segments = prop.split('.');\n\n\tlet result = obj;\n\tlet i = 0;\n\twhile (result && i < segments.length) {\n\t\tconst key = segments[i] as keyof T;\n\t\tresult = result[key] as T;\n\t\ti++;\n\t}\n\treturn result;\n}\n\nexport function sublimeSearch<T extends object>(\n\tfilter: string,\n\tdata: Readonly<T[]>,\n\tkeys: Array<{ key: string; weight: number }> = DEFAULT_KEYS,\n): Array<{ score: number; item: T }> {\n\tconst results = data.reduce((accu: Array<{ score: number; item: T }>, item: T) => {\n\t\tlet values: Array<{ value: string; weight: number }> = [];\n\t\tkeys.forEach(({ key, weight }) => {\n\t\t\tconst value = getValue(item, key);\n\t\t\tif (Array.isArray(value)) {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n\t\t\t\tvalues = values.concat(value.map((v) => ({ value: v, weight })));\n\t\t\t} else if (typeof value === 'string') {\n\t\t\t\tvalues.push({\n\t\t\t\t\tvalue,\n\t\t\t\t\tweight,\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\t// for each item, check every key and get maximum score\n\t\tconst itemMatch = values.reduce(\n\t\t\t(\n\t\t\t\tresult: null | { matched: boolean; outScore: number },\n\t\t\t\t{ value, weight }: { value: string; weight: number },\n\t\t\t) => {\n\t\t\t\tif (!fuzzyMatchSimple(filter, value)) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tconst match = fuzzyMatch(filter, value);\n\t\t\t\tmatch.outScore *= weight;\n\n\t\t\t\tconst { matched, outScore } = match;\n\t\t\t\tif (!result && matched) {\n\t\t\t\t\treturn match;\n\t\t\t\t}\n\t\t\t\tif (matched && result && outScore > result.outScore) {\n\t\t\t\t\treturn match;\n\t\t\t\t}\n\t\t\t\treturn result;\n\t\t\t},\n\t\t\tnull,\n\t\t);\n\n\t\tif (itemMatch) {\n\t\t\taccu.push({\n\t\t\t\tscore: itemMatch.outScore,\n\t\t\t\titem,\n\t\t\t});\n\t\t}\n\n\t\treturn accu;\n\t}, []);\n\n\tresults.sort((a, b) => {\n\t\treturn b.score - a.score;\n\t});\n\n\treturn results;\n}\n"]}
+{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/search/sublimeSearch.cjs","../../src/search/sublimeSearch.ts"],"names":[],"mappings":"AAAA;ACKA,IAAM,iBAAA,EAAmB,EAAA;AACzB,IAAM,gBAAA,EAAkB,EAAA;AACxB,IAAM,YAAA,EAAc,EAAA;AACpB,IAAM,mBAAA,EAAqB,EAAA;AAE3B,IAAM,uBAAA,EAAyB,CAAA,EAAA;AAC/B,IAAM,2BAAA,EAA6B,CAAA,GAAA;AACnC,IAAM,yBAAA,EAA2B,CAAA,CAAA;AAE1B,IAAM,aAAA,EAAe;AAAA,EAC3B,EAAE,GAAA,EAAK,wBAAA,EAA0B,MAAA,EAAQ,IAAI,CAAA;AAAA,EAC7C,EAAE,GAAA,EAAK,wBAAA,EAA0B,MAAA,EAAQ,EAAE;AAC5C,CAAA;AAOA,SAAS,gBAAA,CAAiB,OAAA,EAAiB,MAAA,EAAyB;AACnE,EAAA,IAAI,WAAA,EAAa,CAAA;AACjB,EAAA,IAAI,OAAA,EAAS,CAAA;AAEb,EAAA,MAAA,CAAO,WAAA,EAAa,OAAA,CAAQ,OAAA,GAAU,OAAA,EAAS,MAAA,CAAO,MAAA,EAAQ;AAC7D,IAAA,MAAM,YAAA,EAAc,OAAA,CAAQ,MAAA,CAAO,UAAU,CAAA,CAAE,WAAA,CAAY,CAAA;AAC3D,IAAA,MAAM,WAAA,EAAa,MAAA,CAAO,MAAA,CAAO,MAAM,CAAA,CAAE,WAAA,CAAY,CAAA;AACrD,IAAA,GAAA,CAAI,YAAA,IAAgB,UAAA,EAAY;AAC/B,MAAA,UAAA,EAAA;AAAA,IACD;AACA,IAAA,EAAE,MAAA;AAAA,EACH;AAEA,EAAA,OAAO,OAAA,CAAQ,OAAA,IAAW,EAAA,GAAK,MAAA,CAAO,OAAA,IAAW,EAAA,GAAK,WAAA,IAAe,OAAA,CAAQ,MAAA;AAC9E;AAEA,SAAS,mBAAA,CACR,OAAA,EACA,MAAA,EACA,eAAA,EACA,eAAA,EACA,aAAA,EACA,OAAA,EACA,UAAA,EACA,SAAA,EACA,cAAA,EACA,cAAA,EACyC;AACzC,EAAA,IAAI,SAAA,EAAW,CAAA;AAGf,EAAA,GAAA,CAAI,EAAE,eAAA,GAAkB,cAAA,EAAgB;AACvC,IAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AAAA,EACnC;AAGA,EAAA,GAAA,CAAI,gBAAA,IAAoB,OAAA,CAAQ,OAAA,GAAU,gBAAA,IAAoB,MAAA,CAAO,MAAA,EAAQ;AAC5E,IAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AAAA,EACnC;AAGA,EAAA,IAAI,eAAA,EAAiB,KAAA;AACrB,EAAA,IAAI,qBAAA,EAAiC,CAAC,CAAA;AACtC,EAAA,IAAI,mBAAA,EAAqB,CAAA;AAGzB,EAAA,IAAI,WAAA,EAAa,IAAA;AACjB,EAAA,MAAA,CAAO,gBAAA,EAAkB,OAAA,CAAQ,OAAA,GAAU,gBAAA,EAAkB,MAAA,CAAO,MAAA,EAAQ;AAE3E,IAAA,GAAA,CAAI,OAAA,CAAQ,eAAe,CAAA,CAAE,WAAA,CAAY,EAAA,IAAM,MAAA,CAAO,eAAe,CAAA,CAAE,WAAA,CAAY,CAAA,EAAG;AACrF,MAAA,GAAA,CAAI,UAAA,GAAa,UAAA,EAAY;AAC5B,QAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AAAA,MACnC;AAEA,MAAA,GAAA,CAAI,WAAA,GAAc,aAAA,EAAe;AAChC,QAAA,QAAA,EAAU,CAAC,GAAG,aAAa,CAAA;AAC3B,QAAA,WAAA,EAAa,KAAA;AAAA,MACd;AAEA,MAAA,MAAM,iBAAA,EAA6B,CAAC,CAAA;AACpC,MAAA,MAAM,gBAAA,EAAkB,mBAAA;AAAA,QACvB,OAAA;AAAA,QACA,MAAA;AAAA,QACA,eAAA;AAAA,QACA,gBAAA,EAAkB,CAAA;AAAA,QAClB,OAAA;AAAA,QACA,gBAAA;AAAA,QACA,UAAA;AAAA,QACA,SAAA;AAAA,QACA,cAAA;AAAA,QACA;AAAA,MACD,CAAA;AAEA,MAAA,MAAM,eAAA,EAAiB,eAAA,CAAgB,QAAA;AACvC,MAAA,GAAA,CAAI,eAAA,CAAgB,OAAA,EAAS;AAE5B,QAAA,GAAA,CAAI,CAAC,eAAA,GAAkB,eAAA,EAAiB,kBAAA,EAAoB;AAC3D,UAAA,qBAAA,EAAuB,CAAC,GAAG,gBAAgB,CAAA;AAC3C,UAAA,mBAAA,EAAqB,cAAA;AAAA,QACtB;AACA,QAAA,eAAA,EAAiB,IAAA;AAAA,MAClB;AAEA,MAAA,OAAA,CAAQ,SAAA,EAAW,EAAA,EAAI,eAAA;AACvB,MAAA,EAAE,eAAA;AAAA,IACH;AACA,IAAA,EAAE,eAAA;AAAA,EACH;AAEA,EAAA,MAAM,QAAA,EAAU,gBAAA,IAAoB,OAAA,CAAQ,MAAA;AAE5C,EAAA,GAAA,CAAI,OAAA,EAAS;AACZ,IAAA,SAAA,EAAW,GAAA;AAGX,IAAA,GAAA,CAAI,CAAC,MAAA,CAAO,WAAA,CAAY,CAAA,CAAE,UAAA,CAAW,KAAK,CAAA,EAAG;AAC5C,MAAA,IAAI,QAAA,EAAU,uBAAA,EAAyB,OAAA,CAAQ,CAAC,CAAA;AAChD,MAAA,QAAA,EAAU,QAAA,EAAU,2BAAA,EAA6B,2BAAA,EAA6B,OAAA;AAC9E,MAAA,SAAA,GAAY,OAAA;AAAA,IACb;AAGA,IAAA,MAAM,UAAA,EAAY,MAAA,CAAO,OAAA,EAAS,SAAA;AAClC,IAAA,SAAA,GAAY,yBAAA,EAA2B,SAAA;AAGvC,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,SAAA,EAAW,CAAA,EAAA,EAAK;AACnC,MAAA,MAAM,QAAA,EAAU,OAAA,CAAQ,CAAC,CAAA;AAEzB,MAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG;AACV,QAAA,MAAM,QAAA,EAAU,OAAA,CAAQ,EAAA,EAAI,CAAC,CAAA;AAC7B,QAAA,GAAA,CAAI,QAAA,IAAY,QAAA,EAAU,CAAA,EAAG;AAC5B,UAAA,SAAA,GAAY,gBAAA;AAAA,QACb;AAAA,MACD;AAGA,MAAA,GAAA,CAAI,QAAA,EAAU,CAAA,EAAG;AAEhB,QAAA,MAAM,SAAA,EAAW,MAAA,CAAO,QAAA,EAAU,CAAC,CAAA;AACnC,QAAA,MAAM,KAAA,EAAO,MAAA,CAAO,OAAO,CAAA;AAC3B,QAAA,GAAA,CAAI,SAAA,IAAa,QAAA,CAAS,WAAA,CAAY,EAAA,GAAK,KAAA,IAAS,IAAA,CAAK,WAAA,CAAY,CAAA,EAAG;AACvE,UAAA,SAAA,GAAY,WAAA;AAAA,QACb;AACA,QAAA,MAAM,qBAAA,EAAuB,SAAA,IAAa,IAAA,GAAO,SAAA,IAAa,GAAA;AAC9D,QAAA,GAAA,CAAI,oBAAA,EAAsB;AACzB,UAAA,SAAA,GAAY,eAAA;AAAA,QACb;AAAA,MACD,EAAA,KAAO;AAEN,QAAA,SAAA,GAAY,kBAAA;AAAA,MACb;AAAA,IACD;AAGA,IAAA,GAAA,CAAI,eAAA,GAAA,CAAmB,CAAC,QAAA,GAAW,mBAAA,EAAqB,QAAA,CAAA,EAAW;AAElE,MAAA,QAAA,EAAU,CAAC,GAAG,oBAAoB,CAAA;AAClC,MAAA,SAAA,EAAW,kBAAA;AACX,MAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,SAAS,CAAA;AAAA,IAClC,EAAA,KAAA,GAAA,CAAW,OAAA,EAAS;AAEnB,MAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,SAAS,CAAA;AAAA,IAClC,EAAA,KAAO;AACN,MAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AAAA,IACnC;AAAA,EACD;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,SAAS,CAAA;AACnC;AASA,SAAS,UAAA,CAAW,OAAA,EAAiB,MAAA,EAAwD;AAC5F,EAAA,MAAM,eAAA,EAAiB,CAAA;AACvB,EAAA,MAAM,eAAA,EAAiB,CAAA;AACvB,EAAA,MAAM,QAAA,EAAoB,CAAC,CAAA;AAC3B,EAAA,MAAM,WAAA,EAAa,GAAA;AAEnB,EAAA,OAAO,mBAAA;AAAA,IACN,OAAA;AAAA,IACA,MAAA;AAAA,IACA,CAAA;AAAA,IACA,CAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA;AAAA,IACA,CAAA;AAAA,IACA,cAAA;AAAA,IACA;AAAA,EACD,CAAA;AACD;AAKA,SAAS,QAAA,CAA2B,GAAA,EAAQ,IAAA,EAAuB;AAClE,EAAA,GAAA,CAAI,GAAA,CAAI,cAAA,CAAe,IAAI,CAAA,EAAG;AAC7B,IAAA,OAAO,GAAA,CAAI,IAAe,CAAA;AAAA,EAC3B;AAEA,EAAA,MAAM,SAAA,EAAW,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAE/B,EAAA,IAAI,OAAA,EAAS,GAAA;AACb,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,MAAA,CAAO,OAAA,GAAU,EAAA,EAAI,QAAA,CAAS,MAAA,EAAQ;AACrC,IAAA,MAAM,IAAA,EAAM,QAAA,CAAS,CAAC,CAAA;AACtB,IAAA,OAAA,EAAS,MAAA,CAAO,GAAG,CAAA;AACnB,IAAA,CAAA,EAAA;AAAA,EACD;AACA,EAAA,OAAO,MAAA;AACR;AAEO,SAAS,aAAA,CACf,MAAA,EACA,IAAA,EACA,KAAA,EAA+C,YAAA,EACX;AACpC,EAAA,MAAM,QAAA,EAAU,IAAA,CAAK,MAAA,CAAO,CAAC,IAAA,EAAyC,IAAA,EAAA,GAAY;AACjF,IAAA,IAAI,OAAA,EAAmD,CAAC,CAAA;AACxD,IAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,EAAE,GAAA,EAAK,OAAO,CAAA,EAAA,GAAM;AACjC,MAAA,MAAM,MAAA,EAAQ,QAAA,CAAS,IAAA,EAAM,GAAG,CAAA;AAChC,MAAA,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAEzB,QAAA,OAAA,EAAS,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,EAAA,GAAA,CAAO,EAAE,KAAA,EAAO,CAAA,EAAG,OAAO,CAAA,CAAE,CAAC,CAAA;AAAA,MAChE,EAAA,KAAA,GAAA,CAAW,OAAO,MAAA,IAAU,QAAA,EAAU;AACrC,QAAA,MAAA,CAAO,IAAA,CAAK;AAAA,UACX,KAAA;AAAA,UACA;AAAA,QACD,CAAC,CAAA;AAAA,MACF;AAAA,IACD,CAAC,CAAA;AAGD,IAAA,MAAM,UAAA,EAAY,MAAA,CAAO,MAAA;AAAA,MACxB,CACC,MAAA,EACA,EAAE,KAAA,EAAO,OAAO,CAAA,EAAA,GACZ;AACJ,QAAA,GAAA,CAAI,CAAC,gBAAA,CAAiB,MAAA,EAAQ,KAAK,CAAA,EAAG;AACrC,UAAA,OAAO,MAAA;AAAA,QACR;AAEA,QAAA,MAAM,MAAA,EAAQ,UAAA,CAAW,MAAA,EAAQ,KAAK,CAAA;AACtC,QAAA,KAAA,CAAM,SAAA,GAAY,MAAA;AAElB,QAAA,MAAM,EAAE,OAAA,EAAS,SAAS,EAAA,EAAI,KAAA;AAC9B,QAAA,GAAA,CAAI,CAAC,OAAA,GAAU,OAAA,EAAS;AACvB,UAAA,OAAO,KAAA;AAAA,QACR;AACA,QAAA,GAAA,CAAI,QAAA,GAAW,OAAA,GAAU,SAAA,EAAW,MAAA,CAAO,QAAA,EAAU;AACpD,UAAA,OAAO,KAAA;AAAA,QACR;AACA,QAAA,OAAO,MAAA;AAAA,MACR,CAAA;AAAA,MACA;AAAA,IACD,CAAA;AAEA,IAAA,GAAA,CAAI,SAAA,EAAW;AACd,MAAA,IAAA,CAAK,IAAA,CAAK;AAAA,QACT,KAAA,EAAO,SAAA,CAAU,QAAA;AAAA,QACjB;AAAA,MACD,CAAC,CAAA;AAAA,IACF;AAEA,IAAA,OAAO,IAAA;AAAA,EACR,CAAA,EAAG,CAAC,CAAC,CAAA;AAEL,EAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM;AACtB,IAAA,OAAO,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,KAAA;AAAA,EACpB,CAAC,CAAA;AAED,EAAA,OAAO,OAAA;AACR;ADxFA;AACE;AACA;AACF,2EAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/search/sublimeSearch.cjs","sourcesContent":[null,"/*\n * Constants and utility functions used for searching for node types in node creator component\n * based on https://github.com/forrestthewoods/lib_fts/blob/master/code/fts_fuzzy_match.js\n */\n\nconst SEQUENTIAL_BONUS = 60; // bonus for adjacent matches\nconst SEPARATOR_BONUS = 38; // bonus if match occurs after a separator\nconst CAMEL_BONUS = 30; // bonus if match is uppercase and prev is lower\nconst FIRST_LETTER_BONUS = 15; // bonus if the first letter is matched\n\nconst LEADING_LETTER_PENALTY = -20; // penalty applied for every letter in str before the first match\nconst MAX_LEADING_LETTER_PENALTY = -200; // maximum penalty for leading letters\nconst UNMATCHED_LETTER_PENALTY = -5;\n\nexport const DEFAULT_KEYS = [\n\t{ key: 'properties.displayName', weight: 1.3 },\n\t{ key: 'properties.codex.alias', weight: 1 },\n];\n\n/**\n * Returns true if each character in pattern is found sequentially within target\n * @param {*} pattern string\n * @param {*} target string\n */\nfunction fuzzyMatchSimple(pattern: string, target: string): boolean {\n\tlet patternIdx = 0;\n\tlet strIdx = 0;\n\n\twhile (patternIdx < pattern.length && strIdx < target.length) {\n\t\tconst patternChar = pattern.charAt(patternIdx).toLowerCase();\n\t\tconst targetChar = target.charAt(strIdx).toLowerCase();\n\t\tif (patternChar === targetChar) {\n\t\t\tpatternIdx++;\n\t\t}\n\t\t++strIdx;\n\t}\n\n\treturn pattern.length !== 0 && target.length !== 0 && patternIdx === pattern.length;\n}\n\nfunction fuzzyMatchRecursive(\n\tpattern: string,\n\ttarget: string,\n\tpatternCurIndex: number,\n\ttargetCurrIndex: number,\n\ttargetMatches: null | number[],\n\tmatches: number[],\n\tmaxMatches: number,\n\tnextMatch: number,\n\trecursionCount: number,\n\trecursionLimit: number,\n): { matched: boolean; outScore: number } {\n\tlet outScore = 0;\n\n\t// Return if recursion limit is reached.\n\tif (++recursionCount >= recursionLimit) {\n\t\treturn { matched: false, outScore };\n\t}\n\n\t// Return if we reached ends of strings.\n\tif (patternCurIndex === pattern.length || targetCurrIndex === target.length) {\n\t\treturn { matched: false, outScore };\n\t}\n\n\t// Recursion params\n\tlet recursiveMatch = false;\n\tlet bestRecursiveMatches: number[] = [];\n\tlet bestRecursiveScore = 0;\n\n\t// Loop through pattern and str looking for a match.\n\tlet firstMatch = true;\n\twhile (patternCurIndex < pattern.length && targetCurrIndex < target.length) {\n\t\t// Match found.\n\t\tif (pattern[patternCurIndex].toLowerCase() === target[targetCurrIndex].toLowerCase()) {\n\t\t\tif (nextMatch >= maxMatches) {\n\t\t\t\treturn { matched: false, outScore };\n\t\t\t}\n\n\t\t\tif (firstMatch && targetMatches) {\n\t\t\t\tmatches = [...targetMatches];\n\t\t\t\tfirstMatch = false;\n\t\t\t}\n\n\t\t\tconst recursiveMatches: number[] = [];\n\t\t\tconst recursiveResult = fuzzyMatchRecursive(\n\t\t\t\tpattern,\n\t\t\t\ttarget,\n\t\t\t\tpatternCurIndex,\n\t\t\t\ttargetCurrIndex + 1,\n\t\t\t\tmatches,\n\t\t\t\trecursiveMatches,\n\t\t\t\tmaxMatches,\n\t\t\t\tnextMatch,\n\t\t\t\trecursionCount,\n\t\t\t\trecursionLimit,\n\t\t\t);\n\n\t\t\tconst recursiveScore = recursiveResult.outScore;\n\t\t\tif (recursiveResult.matched) {\n\t\t\t\t// Pick best recursive score.\n\t\t\t\tif (!recursiveMatch || recursiveScore > bestRecursiveScore) {\n\t\t\t\t\tbestRecursiveMatches = [...recursiveMatches];\n\t\t\t\t\tbestRecursiveScore = recursiveScore;\n\t\t\t\t}\n\t\t\t\trecursiveMatch = true;\n\t\t\t}\n\n\t\t\tmatches[nextMatch++] = targetCurrIndex;\n\t\t\t++patternCurIndex;\n\t\t}\n\t\t++targetCurrIndex;\n\t}\n\n\tconst matched = patternCurIndex === pattern.length;\n\n\tif (matched) {\n\t\toutScore = 100;\n\n\t\t// Apply leading letter penalty (if not n8n-prefixed)\n\t\tif (!target.toLowerCase().startsWith('n8n')) {\n\t\t\tlet penalty = LEADING_LETTER_PENALTY * matches[0];\n\t\t\tpenalty = penalty < MAX_LEADING_LETTER_PENALTY ? MAX_LEADING_LETTER_PENALTY : penalty;\n\t\t\toutScore += penalty;\n\t\t}\n\n\t\t//Apply unmatched penalty\n\t\tconst unmatched = target.length - nextMatch;\n\t\toutScore += UNMATCHED_LETTER_PENALTY * unmatched;\n\n\t\t// Apply ordering bonuses\n\t\tfor (let i = 0; i < nextMatch; i++) {\n\t\t\tconst currIdx = matches[i];\n\n\t\t\tif (i > 0) {\n\t\t\t\tconst prevIdx = matches[i - 1];\n\t\t\t\tif (currIdx === prevIdx + 1) {\n\t\t\t\t\toutScore += SEQUENTIAL_BONUS;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Check for bonuses based on neighbor character value.\n\t\t\tif (currIdx > 0) {\n\t\t\t\t// Camel case\n\t\t\t\tconst neighbor = target[currIdx - 1];\n\t\t\t\tconst curr = target[currIdx];\n\t\t\t\tif (neighbor !== neighbor.toUpperCase() && curr !== curr.toLowerCase()) {\n\t\t\t\t\toutScore += CAMEL_BONUS;\n\t\t\t\t}\n\t\t\t\tconst isNeighbourSeparator = neighbor === '_' || neighbor === ' ';\n\t\t\t\tif (isNeighbourSeparator) {\n\t\t\t\t\toutScore += SEPARATOR_BONUS;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// First letter\n\t\t\t\toutScore += FIRST_LETTER_BONUS;\n\t\t\t}\n\t\t}\n\n\t\t// Return best result\n\t\tif (recursiveMatch && (!matched || bestRecursiveScore > outScore)) {\n\t\t\t// Recursive score is better than \"this\"\n\t\t\tmatches = [...bestRecursiveMatches];\n\t\t\toutScore = bestRecursiveScore;\n\t\t\treturn { matched: true, outScore };\n\t\t} else if (matched) {\n\t\t\t// \"this\" score is better than recursive\n\t\t\treturn { matched: true, outScore };\n\t\t} else {\n\t\t\treturn { matched: false, outScore };\n\t\t}\n\t}\n\treturn { matched: false, outScore };\n}\n\n/**\n * Does a fuzzy search to find pattern inside a string.\n * @param {*} pattern string        pattern to search for\n * @param {*} target     string        string which is being searched\n * @returns [boolean, number]       a boolean which tells if pattern was\n *                                  found or not and a search score\n */\nfunction fuzzyMatch(pattern: string, target: string): { matched: boolean; outScore: number } {\n\tconst recursionCount = 0;\n\tconst recursionLimit = 5;\n\tconst matches: number[] = [];\n\tconst maxMatches = 256;\n\n\treturn fuzzyMatchRecursive(\n\t\tpattern,\n\t\ttarget,\n\t\t0 /* patternCurIndex */,\n\t\t0 /* strCurrIndex */,\n\t\tnull /* srcMatces */,\n\t\tmatches,\n\t\tmaxMatches,\n\t\t0 /* nextMatch */,\n\t\trecursionCount,\n\t\trecursionLimit,\n\t);\n}\n\n// prop = 'key'\n// prop = 'key1.key2'\n// prop = ['key1', 'key2']\nfunction getValue<T extends object>(obj: T, prop: string): unknown {\n\tif (obj.hasOwnProperty(prop)) {\n\t\treturn obj[prop as keyof T];\n\t}\n\n\tconst segments = prop.split('.');\n\n\tlet result = obj;\n\tlet i = 0;\n\twhile (result && i < segments.length) {\n\t\tconst key = segments[i] as keyof T;\n\t\tresult = result[key] as T;\n\t\ti++;\n\t}\n\treturn result;\n}\n\nexport function sublimeSearch<T extends object>(\n\tfilter: string,\n\tdata: Readonly<T[]>,\n\tkeys: Array<{ key: string; weight: number }> = DEFAULT_KEYS,\n): Array<{ score: number; item: T }> {\n\tconst results = data.reduce((accu: Array<{ score: number; item: T }>, item: T) => {\n\t\tlet values: Array<{ value: string; weight: number }> = [];\n\t\tkeys.forEach(({ key, weight }) => {\n\t\t\tconst value = getValue(item, key);\n\t\t\tif (Array.isArray(value)) {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n\t\t\t\tvalues = values.concat(value.map((v) => ({ value: v, weight })));\n\t\t\t} else if (typeof value === 'string') {\n\t\t\t\tvalues.push({\n\t\t\t\t\tvalue,\n\t\t\t\t\tweight,\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\t// for each item, check every key and get maximum score\n\t\tconst itemMatch = values.reduce(\n\t\t\t(\n\t\t\t\tresult: null | { matched: boolean; outScore: number },\n\t\t\t\t{ value, weight }: { value: string; weight: number },\n\t\t\t) => {\n\t\t\t\tif (!fuzzyMatchSimple(filter, value)) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tconst match = fuzzyMatch(filter, value);\n\t\t\t\tmatch.outScore *= weight;\n\n\t\t\t\tconst { matched, outScore } = match;\n\t\t\t\tif (!result && matched) {\n\t\t\t\t\treturn match;\n\t\t\t\t}\n\t\t\t\tif (matched && result && outScore > result.outScore) {\n\t\t\t\t\treturn match;\n\t\t\t\t}\n\t\t\t\treturn result;\n\t\t\t},\n\t\t\tnull,\n\t\t);\n\n\t\tif (itemMatch) {\n\t\t\taccu.push({\n\t\t\t\tscore: itemMatch.outScore,\n\t\t\t\titem,\n\t\t\t});\n\t\t}\n\n\t\treturn accu;\n\t}, []);\n\n\tresults.sort((a, b) => {\n\t\treturn b.score - a.score;\n\t});\n\n\treturn results;\n}\n"]}

package/dist/search/sublimeSearch.js

@@ -1,6 +1,6 @@
 // src/search/sublimeSearch.ts
 var SEQUENTIAL_BONUS = 60;
-var SEPARATOR_BONUS = 30;
+var SEPARATOR_BONUS = 38;
 var CAMEL_BONUS = 30;
 var FIRST_LETTER_BONUS = 15;
 var LEADING_LETTER_PENALTY = -20;

package/dist/search/sublimeSearch.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/search/sublimeSearch.ts"],"sourcesContent":["/*\n * Constants and utility functions used for searching for node types in node creator component\n * based on https://github.com/forrestthewoods/lib_fts/blob/master/code/fts_fuzzy_match.js\n */\n\nconst SEQUENTIAL_BONUS = 60; // bonus for adjacent matches\nconst SEPARATOR_BONUS = 30; // bonus if match occurs after a separator\nconst CAMEL_BONUS = 30; // bonus if match is uppercase and prev is lower\nconst FIRST_LETTER_BONUS = 15; // bonus if the first letter is matched\n\nconst LEADING_LETTER_PENALTY = -20; // penalty applied for every letter in str before the first match\nconst MAX_LEADING_LETTER_PENALTY = -200; // maximum penalty for leading letters\nconst UNMATCHED_LETTER_PENALTY = -5;\n\nexport const DEFAULT_KEYS = [\n\t{ key: 'properties.displayName', weight: 1.3 },\n\t{ key: 'properties.codex.alias', weight: 1 },\n];\n\n/**\n * Returns true if each character in pattern is found sequentially within target\n * @param {*} pattern string\n * @param {*} target string\n */\nfunction fuzzyMatchSimple(pattern: string, target: string): boolean {\n\tlet patternIdx = 0;\n\tlet strIdx = 0;\n\n\twhile (patternIdx < pattern.length && strIdx < target.length) {\n\t\tconst patternChar = pattern.charAt(patternIdx).toLowerCase();\n\t\tconst targetChar = target.charAt(strIdx).toLowerCase();\n\t\tif (patternChar === targetChar) {\n\t\t\tpatternIdx++;\n\t\t}\n\t\t++strIdx;\n\t}\n\n\treturn pattern.length !== 0 && target.length !== 0 && patternIdx === pattern.length;\n}\n\nfunction fuzzyMatchRecursive(\n\tpattern: string,\n\ttarget: string,\n\tpatternCurIndex: number,\n\ttargetCurrIndex: number,\n\ttargetMatches: null | number[],\n\tmatches: number[],\n\tmaxMatches: number,\n\tnextMatch: number,\n\trecursionCount: number,\n\trecursionLimit: number,\n): { matched: boolean; outScore: number } {\n\tlet outScore = 0;\n\n\t// Return if recursion limit is reached.\n\tif (++recursionCount >= recursionLimit) {\n\t\treturn { matched: false, outScore };\n\t}\n\n\t// Return if we reached ends of strings.\n\tif (patternCurIndex === pattern.length || targetCurrIndex === target.length) {\n\t\treturn { matched: false, outScore };\n\t}\n\n\t// Recursion params\n\tlet recursiveMatch = false;\n\tlet bestRecursiveMatches: number[] = [];\n\tlet bestRecursiveScore = 0;\n\n\t// Loop through pattern and str looking for a match.\n\tlet firstMatch = true;\n\twhile (patternCurIndex < pattern.length && targetCurrIndex < target.length) {\n\t\t// Match found.\n\t\tif (pattern[patternCurIndex].toLowerCase() === target[targetCurrIndex].toLowerCase()) {\n\t\t\tif (nextMatch >= maxMatches) {\n\t\t\t\treturn { matched: false, outScore };\n\t\t\t}\n\n\t\t\tif (firstMatch && targetMatches) {\n\t\t\t\tmatches = [...targetMatches];\n\t\t\t\tfirstMatch = false;\n\t\t\t}\n\n\t\t\tconst recursiveMatches: number[] = [];\n\t\t\tconst recursiveResult = fuzzyMatchRecursive(\n\t\t\t\tpattern,\n\t\t\t\ttarget,\n\t\t\t\tpatternCurIndex,\n\t\t\t\ttargetCurrIndex + 1,\n\t\t\t\tmatches,\n\t\t\t\trecursiveMatches,\n\t\t\t\tmaxMatches,\n\t\t\t\tnextMatch,\n\t\t\t\trecursionCount,\n\t\t\t\trecursionLimit,\n\t\t\t);\n\n\t\t\tconst recursiveScore = recursiveResult.outScore;\n\t\t\tif (recursiveResult.matched) {\n\t\t\t\t// Pick best recursive score.\n\t\t\t\tif (!recursiveMatch || recursiveScore > bestRecursiveScore) {\n\t\t\t\t\tbestRecursiveMatches = [...recursiveMatches];\n\t\t\t\t\tbestRecursiveScore = recursiveScore;\n\t\t\t\t}\n\t\t\t\trecursiveMatch = true;\n\t\t\t}\n\n\t\t\tmatches[nextMatch++] = targetCurrIndex;\n\t\t\t++patternCurIndex;\n\t\t}\n\t\t++targetCurrIndex;\n\t}\n\n\tconst matched = patternCurIndex === pattern.length;\n\n\tif (matched) {\n\t\toutScore = 100;\n\n\t\t// Apply leading letter penalty (if not n8n-prefixed)\n\t\tif (!target.toLowerCase().startsWith('n8n')) {\n\t\t\tlet penalty = LEADING_LETTER_PENALTY * matches[0];\n\t\t\tpenalty = penalty < MAX_LEADING_LETTER_PENALTY ? MAX_LEADING_LETTER_PENALTY : penalty;\n\t\t\toutScore += penalty;\n\t\t}\n\n\t\t//Apply unmatched penalty\n\t\tconst unmatched = target.length - nextMatch;\n\t\toutScore += UNMATCHED_LETTER_PENALTY * unmatched;\n\n\t\t// Apply ordering bonuses\n\t\tfor (let i = 0; i < nextMatch; i++) {\n\t\t\tconst currIdx = matches[i];\n\n\t\t\tif (i > 0) {\n\t\t\t\tconst prevIdx = matches[i - 1];\n\t\t\t\tif (currIdx === prevIdx + 1) {\n\t\t\t\t\toutScore += SEQUENTIAL_BONUS;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Check for bonuses based on neighbor character value.\n\t\t\tif (currIdx > 0) {\n\t\t\t\t// Camel case\n\t\t\t\tconst neighbor = target[currIdx - 1];\n\t\t\t\tconst curr = target[currIdx];\n\t\t\t\tif (neighbor !== neighbor.toUpperCase() && curr !== curr.toLowerCase()) {\n\t\t\t\t\toutScore += CAMEL_BONUS;\n\t\t\t\t}\n\t\t\t\tconst isNeighbourSeparator = neighbor === '_' || neighbor === ' ';\n\t\t\t\tif (isNeighbourSeparator) {\n\t\t\t\t\toutScore += SEPARATOR_BONUS;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// First letter\n\t\t\t\toutScore += FIRST_LETTER_BONUS;\n\t\t\t}\n\t\t}\n\n\t\t// Return best result\n\t\tif (recursiveMatch && (!matched || bestRecursiveScore > outScore)) {\n\t\t\t// Recursive score is better than \"this\"\n\t\t\tmatches = [...bestRecursiveMatches];\n\t\t\toutScore = bestRecursiveScore;\n\t\t\treturn { matched: true, outScore };\n\t\t} else if (matched) {\n\t\t\t// \"this\" score is better than recursive\n\t\t\treturn { matched: true, outScore };\n\t\t} else {\n\t\t\treturn { matched: false, outScore };\n\t\t}\n\t}\n\treturn { matched: false, outScore };\n}\n\n/**\n * Does a fuzzy search to find pattern inside a string.\n * @param {*} pattern string        pattern to search for\n * @param {*} target     string        string which is being searched\n * @returns [boolean, number]       a boolean which tells if pattern was\n *                                  found or not and a search score\n */\nfunction fuzzyMatch(pattern: string, target: string): { matched: boolean; outScore: number } {\n\tconst recursionCount = 0;\n\tconst recursionLimit = 5;\n\tconst matches: number[] = [];\n\tconst maxMatches = 256;\n\n\treturn fuzzyMatchRecursive(\n\t\tpattern,\n\t\ttarget,\n\t\t0 /* patternCurIndex */,\n\t\t0 /* strCurrIndex */,\n\t\tnull /* srcMatces */,\n\t\tmatches,\n\t\tmaxMatches,\n\t\t0 /* nextMatch */,\n\t\trecursionCount,\n\t\trecursionLimit,\n\t);\n}\n\n// prop = 'key'\n// prop = 'key1.key2'\n// prop = ['key1', 'key2']\nfunction getValue<T extends object>(obj: T, prop: string): unknown {\n\tif (obj.hasOwnProperty(prop)) {\n\t\treturn obj[prop as keyof T];\n\t}\n\n\tconst segments = prop.split('.');\n\n\tlet result = obj;\n\tlet i = 0;\n\twhile (result && i < segments.length) {\n\t\tconst key = segments[i] as keyof T;\n\t\tresult = result[key] as T;\n\t\ti++;\n\t}\n\treturn result;\n}\n\nexport function sublimeSearch<T extends object>(\n\tfilter: string,\n\tdata: Readonly<T[]>,\n\tkeys: Array<{ key: string; weight: number }> = DEFAULT_KEYS,\n): Array<{ score: number; item: T }> {\n\tconst results = data.reduce((accu: Array<{ score: number; item: T }>, item: T) => {\n\t\tlet values: Array<{ value: string; weight: number }> = [];\n\t\tkeys.forEach(({ key, weight }) => {\n\t\t\tconst value = getValue(item, key);\n\t\t\tif (Array.isArray(value)) {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n\t\t\t\tvalues = values.concat(value.map((v) => ({ value: v, weight })));\n\t\t\t} else if (typeof value === 'string') {\n\t\t\t\tvalues.push({\n\t\t\t\t\tvalue,\n\t\t\t\t\tweight,\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\t// for each item, check every key and get maximum score\n\t\tconst itemMatch = values.reduce(\n\t\t\t(\n\t\t\t\tresult: null | { matched: boolean; outScore: number },\n\t\t\t\t{ value, weight }: { value: string; weight: number },\n\t\t\t) => {\n\t\t\t\tif (!fuzzyMatchSimple(filter, value)) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tconst match = fuzzyMatch(filter, value);\n\t\t\t\tmatch.outScore *= weight;\n\n\t\t\t\tconst { matched, outScore } = match;\n\t\t\t\tif (!result && matched) {\n\t\t\t\t\treturn match;\n\t\t\t\t}\n\t\t\t\tif (matched && result && outScore > result.outScore) {\n\t\t\t\t\treturn match;\n\t\t\t\t}\n\t\t\t\treturn result;\n\t\t\t},\n\t\t\tnull,\n\t\t);\n\n\t\tif (itemMatch) {\n\t\t\taccu.push({\n\t\t\t\tscore: itemMatch.outScore,\n\t\t\t\titem,\n\t\t\t});\n\t\t}\n\n\t\treturn accu;\n\t}, []);\n\n\tresults.sort((a, b) => {\n\t\treturn b.score - a.score;\n\t});\n\n\treturn results;\n}\n"],"mappings":";AAKA,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AACxB,IAAM,cAAc;AACpB,IAAM,qBAAqB;AAE3B,IAAM,yBAAyB;AAC/B,IAAM,6BAA6B;AACnC,IAAM,2BAA2B;AAE1B,IAAM,eAAe;AAAA,EAC3B,EAAE,KAAK,0BAA0B,QAAQ,IAAI;AAAA,EAC7C,EAAE,KAAK,0BAA0B,QAAQ,EAAE;AAC5C;AAOA,SAAS,iBAAiB,SAAiB,QAAyB;AACnE,MAAI,aAAa;AACjB,MAAI,SAAS;AAEb,SAAO,aAAa,QAAQ,UAAU,SAAS,OAAO,QAAQ;AAC7D,UAAM,cAAc,QAAQ,OAAO,UAAU,EAAE,YAAY;AAC3D,UAAM,aAAa,OAAO,OAAO,MAAM,EAAE,YAAY;AACrD,QAAI,gBAAgB,YAAY;AAC/B;AAAA,IACD;AACA,MAAE;AAAA,EACH;AAEA,SAAO,QAAQ,WAAW,KAAK,OAAO,WAAW,KAAK,eAAe,QAAQ;AAC9E;AAEA,SAAS,oBACR,SACA,QACA,iBACA,iBACA,eACA,SACA,YACA,WACA,gBACA,gBACyC;AACzC,MAAI,WAAW;AAGf,MAAI,EAAE,kBAAkB,gBAAgB;AACvC,WAAO,EAAE,SAAS,OAAO,SAAS;AAAA,EACnC;AAGA,MAAI,oBAAoB,QAAQ,UAAU,oBAAoB,OAAO,QAAQ;AAC5E,WAAO,EAAE,SAAS,OAAO,SAAS;AAAA,EACnC;AAGA,MAAI,iBAAiB;AACrB,MAAI,uBAAiC,CAAC;AACtC,MAAI,qBAAqB;AAGzB,MAAI,aAAa;AACjB,SAAO,kBAAkB,QAAQ,UAAU,kBAAkB,OAAO,QAAQ;AAE3E,QAAI,QAAQ,eAAe,EAAE,YAAY,MAAM,OAAO,eAAe,EAAE,YAAY,GAAG;AACrF,UAAI,aAAa,YAAY;AAC5B,eAAO,EAAE,SAAS,OAAO,SAAS;AAAA,MACnC;AAEA,UAAI,cAAc,eAAe;AAChC,kBAAU,CAAC,GAAG,aAAa;AAC3B,qBAAa;AAAA,MACd;AAEA,YAAM,mBAA6B,CAAC;AACpC,YAAM,kBAAkB;AAAA,QACvB;AAAA,QACA;AAAA,QACA;AAAA,QACA,kBAAkB;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACD;AAEA,YAAM,iBAAiB,gBAAgB;AACvC,UAAI,gBAAgB,SAAS;AAE5B,YAAI,CAAC,kBAAkB,iBAAiB,oBAAoB;AAC3D,iCAAuB,CAAC,GAAG,gBAAgB;AAC3C,+BAAqB;AAAA,QACtB;AACA,yBAAiB;AAAA,MAClB;AAEA,cAAQ,WAAW,IAAI;AACvB,QAAE;AAAA,IACH;AACA,MAAE;AAAA,EACH;AAEA,QAAM,UAAU,oBAAoB,QAAQ;AAE5C,MAAI,SAAS;AACZ,eAAW;AAGX,QAAI,CAAC,OAAO,YAAY,EAAE,WAAW,KAAK,GAAG;AAC5C,UAAI,UAAU,yBAAyB,QAAQ,CAAC;AAChD,gBAAU,UAAU,6BAA6B,6BAA6B;AAC9E,kBAAY;AAAA,IACb;AAGA,UAAM,YAAY,OAAO,SAAS;AAClC,gBAAY,2BAA2B;AAGvC,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AACnC,YAAM,UAAU,QAAQ,CAAC;AAEzB,UAAI,IAAI,GAAG;AACV,cAAM,UAAU,QAAQ,IAAI,CAAC;AAC7B,YAAI,YAAY,UAAU,GAAG;AAC5B,sBAAY;AAAA,QACb;AAAA,MACD;AAGA,UAAI,UAAU,GAAG;AAEhB,cAAM,WAAW,OAAO,UAAU,CAAC;AACnC,cAAM,OAAO,OAAO,OAAO;AAC3B,YAAI,aAAa,SAAS,YAAY,KAAK,SAAS,KAAK,YAAY,GAAG;AACvE,sBAAY;AAAA,QACb;AACA,cAAM,uBAAuB,aAAa,OAAO,aAAa;AAC9D,YAAI,sBAAsB;AACzB,sBAAY;AAAA,QACb;AAAA,MACD,OAAO;AAEN,oBAAY;AAAA,MACb;AAAA,IACD;AAGA,QAAI,mBAAmB,CAAC,WAAW,qBAAqB,WAAW;AAElE,gBAAU,CAAC,GAAG,oBAAoB;AAClC,iBAAW;AACX,aAAO,EAAE,SAAS,MAAM,SAAS;AAAA,IAClC,WAAW,SAAS;AAEnB,aAAO,EAAE,SAAS,MAAM,SAAS;AAAA,IAClC,OAAO;AACN,aAAO,EAAE,SAAS,OAAO,SAAS;AAAA,IACnC;AAAA,EACD;AACA,SAAO,EAAE,SAAS,OAAO,SAAS;AACnC;AASA,SAAS,WAAW,SAAiB,QAAwD;AAC5F,QAAM,iBAAiB;AACvB,QAAM,iBAAiB;AACvB,QAAM,UAAoB,CAAC;AAC3B,QAAM,aAAa;AAEnB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AAKA,SAAS,SAA2B,KAAQ,MAAuB;AAClE,MAAI,IAAI,eAAe,IAAI,GAAG;AAC7B,WAAO,IAAI,IAAe;AAAA,EAC3B;AAEA,QAAM,WAAW,KAAK,MAAM,GAAG;AAE/B,MAAI,SAAS;AACb,MAAI,IAAI;AACR,SAAO,UAAU,IAAI,SAAS,QAAQ;AACrC,UAAM,MAAM,SAAS,CAAC;AACtB,aAAS,OAAO,GAAG;AACnB;AAAA,EACD;AACA,SAAO;AACR;AAEO,SAAS,cACf,QACA,MACA,OAA+C,cACX;AACpC,QAAM,UAAU,KAAK,OAAO,CAAC,MAAyC,SAAY;AACjF,QAAI,SAAmD,CAAC;AACxD,SAAK,QAAQ,CAAC,EAAE,KAAK,OAAO,MAAM;AACjC,YAAM,QAAQ,SAAS,MAAM,GAAG;AAChC,UAAI,MAAM,QAAQ,KAAK,GAAG;AAEzB,iBAAS,OAAO,OAAO,MAAM,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,EAAE,CAAC;AAAA,MAChE,WAAW,OAAO,UAAU,UAAU;AACrC,eAAO,KAAK;AAAA,UACX;AAAA,UACA;AAAA,QACD,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAGD,UAAM,YAAY,OAAO;AAAA,MACxB,CACC,QACA,EAAE,OAAO,OAAO,MACZ;AACJ,YAAI,CAAC,iBAAiB,QAAQ,KAAK,GAAG;AACrC,iBAAO;AAAA,QACR;AAEA,cAAM,QAAQ,WAAW,QAAQ,KAAK;AACtC,cAAM,YAAY;AAElB,cAAM,EAAE,SAAS,SAAS,IAAI;AAC9B,YAAI,CAAC,UAAU,SAAS;AACvB,iBAAO;AAAA,QACR;AACA,YAAI,WAAW,UAAU,WAAW,OAAO,UAAU;AACpD,iBAAO;AAAA,QACR;AACA,eAAO;AAAA,MACR;AAAA,MACA;AAAA,IACD;AAEA,QAAI,WAAW;AACd,WAAK,KAAK;AAAA,QACT,OAAO,UAAU;AAAA,QACjB;AAAA,MACD,CAAC;AAAA,IACF;AAEA,WAAO;AAAA,EACR,GAAG,CAAC,CAAC;AAEL,UAAQ,KAAK,CAAC,GAAG,MAAM;AACtB,WAAO,EAAE,QAAQ,EAAE;AAAA,EACpB,CAAC;AAED,SAAO;AACR;","names":[]}
+{"version":3,"sources":["../../src/search/sublimeSearch.ts"],"sourcesContent":["/*\n * Constants and utility functions used for searching for node types in node creator component\n * based on https://github.com/forrestthewoods/lib_fts/blob/master/code/fts_fuzzy_match.js\n */\n\nconst SEQUENTIAL_BONUS = 60; // bonus for adjacent matches\nconst SEPARATOR_BONUS = 38; // bonus if match occurs after a separator\nconst CAMEL_BONUS = 30; // bonus if match is uppercase and prev is lower\nconst FIRST_LETTER_BONUS = 15; // bonus if the first letter is matched\n\nconst LEADING_LETTER_PENALTY = -20; // penalty applied for every letter in str before the first match\nconst MAX_LEADING_LETTER_PENALTY = -200; // maximum penalty for leading letters\nconst UNMATCHED_LETTER_PENALTY = -5;\n\nexport const DEFAULT_KEYS = [\n\t{ key: 'properties.displayName', weight: 1.3 },\n\t{ key: 'properties.codex.alias', weight: 1 },\n];\n\n/**\n * Returns true if each character in pattern is found sequentially within target\n * @param {*} pattern string\n * @param {*} target string\n */\nfunction fuzzyMatchSimple(pattern: string, target: string): boolean {\n\tlet patternIdx = 0;\n\tlet strIdx = 0;\n\n\twhile (patternIdx < pattern.length && strIdx < target.length) {\n\t\tconst patternChar = pattern.charAt(patternIdx).toLowerCase();\n\t\tconst targetChar = target.charAt(strIdx).toLowerCase();\n\t\tif (patternChar === targetChar) {\n\t\t\tpatternIdx++;\n\t\t}\n\t\t++strIdx;\n\t}\n\n\treturn pattern.length !== 0 && target.length !== 0 && patternIdx === pattern.length;\n}\n\nfunction fuzzyMatchRecursive(\n\tpattern: string,\n\ttarget: string,\n\tpatternCurIndex: number,\n\ttargetCurrIndex: number,\n\ttargetMatches: null | number[],\n\tmatches: number[],\n\tmaxMatches: number,\n\tnextMatch: number,\n\trecursionCount: number,\n\trecursionLimit: number,\n): { matched: boolean; outScore: number } {\n\tlet outScore = 0;\n\n\t// Return if recursion limit is reached.\n\tif (++recursionCount >= recursionLimit) {\n\t\treturn { matched: false, outScore };\n\t}\n\n\t// Return if we reached ends of strings.\n\tif (patternCurIndex === pattern.length || targetCurrIndex === target.length) {\n\t\treturn { matched: false, outScore };\n\t}\n\n\t// Recursion params\n\tlet recursiveMatch = false;\n\tlet bestRecursiveMatches: number[] = [];\n\tlet bestRecursiveScore = 0;\n\n\t// Loop through pattern and str looking for a match.\n\tlet firstMatch = true;\n\twhile (patternCurIndex < pattern.length && targetCurrIndex < target.length) {\n\t\t// Match found.\n\t\tif (pattern[patternCurIndex].toLowerCase() === target[targetCurrIndex].toLowerCase()) {\n\t\t\tif (nextMatch >= maxMatches) {\n\t\t\t\treturn { matched: false, outScore };\n\t\t\t}\n\n\t\t\tif (firstMatch && targetMatches) {\n\t\t\t\tmatches = [...targetMatches];\n\t\t\t\tfirstMatch = false;\n\t\t\t}\n\n\t\t\tconst recursiveMatches: number[] = [];\n\t\t\tconst recursiveResult = fuzzyMatchRecursive(\n\t\t\t\tpattern,\n\t\t\t\ttarget,\n\t\t\t\tpatternCurIndex,\n\t\t\t\ttargetCurrIndex + 1,\n\t\t\t\tmatches,\n\t\t\t\trecursiveMatches,\n\t\t\t\tmaxMatches,\n\t\t\t\tnextMatch,\n\t\t\t\trecursionCount,\n\t\t\t\trecursionLimit,\n\t\t\t);\n\n\t\t\tconst recursiveScore = recursiveResult.outScore;\n\t\t\tif (recursiveResult.matched) {\n\t\t\t\t// Pick best recursive score.\n\t\t\t\tif (!recursiveMatch || recursiveScore > bestRecursiveScore) {\n\t\t\t\t\tbestRecursiveMatches = [...recursiveMatches];\n\t\t\t\t\tbestRecursiveScore = recursiveScore;\n\t\t\t\t}\n\t\t\t\trecursiveMatch = true;\n\t\t\t}\n\n\t\t\tmatches[nextMatch++] = targetCurrIndex;\n\t\t\t++patternCurIndex;\n\t\t}\n\t\t++targetCurrIndex;\n\t}\n\n\tconst matched = patternCurIndex === pattern.length;\n\n\tif (matched) {\n\t\toutScore = 100;\n\n\t\t// Apply leading letter penalty (if not n8n-prefixed)\n\t\tif (!target.toLowerCase().startsWith('n8n')) {\n\t\t\tlet penalty = LEADING_LETTER_PENALTY * matches[0];\n\t\t\tpenalty = penalty < MAX_LEADING_LETTER_PENALTY ? MAX_LEADING_LETTER_PENALTY : penalty;\n\t\t\toutScore += penalty;\n\t\t}\n\n\t\t//Apply unmatched penalty\n\t\tconst unmatched = target.length - nextMatch;\n\t\toutScore += UNMATCHED_LETTER_PENALTY * unmatched;\n\n\t\t// Apply ordering bonuses\n\t\tfor (let i = 0; i < nextMatch; i++) {\n\t\t\tconst currIdx = matches[i];\n\n\t\t\tif (i > 0) {\n\t\t\t\tconst prevIdx = matches[i - 1];\n\t\t\t\tif (currIdx === prevIdx + 1) {\n\t\t\t\t\toutScore += SEQUENTIAL_BONUS;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Check for bonuses based on neighbor character value.\n\t\t\tif (currIdx > 0) {\n\t\t\t\t// Camel case\n\t\t\t\tconst neighbor = target[currIdx - 1];\n\t\t\t\tconst curr = target[currIdx];\n\t\t\t\tif (neighbor !== neighbor.toUpperCase() && curr !== curr.toLowerCase()) {\n\t\t\t\t\toutScore += CAMEL_BONUS;\n\t\t\t\t}\n\t\t\t\tconst isNeighbourSeparator = neighbor === '_' || neighbor === ' ';\n\t\t\t\tif (isNeighbourSeparator) {\n\t\t\t\t\toutScore += SEPARATOR_BONUS;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// First letter\n\t\t\t\toutScore += FIRST_LETTER_BONUS;\n\t\t\t}\n\t\t}\n\n\t\t// Return best result\n\t\tif (recursiveMatch && (!matched || bestRecursiveScore > outScore)) {\n\t\t\t// Recursive score is better than \"this\"\n\t\t\tmatches = [...bestRecursiveMatches];\n\t\t\toutScore = bestRecursiveScore;\n\t\t\treturn { matched: true, outScore };\n\t\t} else if (matched) {\n\t\t\t// \"this\" score is better than recursive\n\t\t\treturn { matched: true, outScore };\n\t\t} else {\n\t\t\treturn { matched: false, outScore };\n\t\t}\n\t}\n\treturn { matched: false, outScore };\n}\n\n/**\n * Does a fuzzy search to find pattern inside a string.\n * @param {*} pattern string        pattern to search for\n * @param {*} target     string        string which is being searched\n * @returns [boolean, number]       a boolean which tells if pattern was\n *                                  found or not and a search score\n */\nfunction fuzzyMatch(pattern: string, target: string): { matched: boolean; outScore: number } {\n\tconst recursionCount = 0;\n\tconst recursionLimit = 5;\n\tconst matches: number[] = [];\n\tconst maxMatches = 256;\n\n\treturn fuzzyMatchRecursive(\n\t\tpattern,\n\t\ttarget,\n\t\t0 /* patternCurIndex */,\n\t\t0 /* strCurrIndex */,\n\t\tnull /* srcMatces */,\n\t\tmatches,\n\t\tmaxMatches,\n\t\t0 /* nextMatch */,\n\t\trecursionCount,\n\t\trecursionLimit,\n\t);\n}\n\n// prop = 'key'\n// prop = 'key1.key2'\n// prop = ['key1', 'key2']\nfunction getValue<T extends object>(obj: T, prop: string): unknown {\n\tif (obj.hasOwnProperty(prop)) {\n\t\treturn obj[prop as keyof T];\n\t}\n\n\tconst segments = prop.split('.');\n\n\tlet result = obj;\n\tlet i = 0;\n\twhile (result && i < segments.length) {\n\t\tconst key = segments[i] as keyof T;\n\t\tresult = result[key] as T;\n\t\ti++;\n\t}\n\treturn result;\n}\n\nexport function sublimeSearch<T extends object>(\n\tfilter: string,\n\tdata: Readonly<T[]>,\n\tkeys: Array<{ key: string; weight: number }> = DEFAULT_KEYS,\n): Array<{ score: number; item: T }> {\n\tconst results = data.reduce((accu: Array<{ score: number; item: T }>, item: T) => {\n\t\tlet values: Array<{ value: string; weight: number }> = [];\n\t\tkeys.forEach(({ key, weight }) => {\n\t\t\tconst value = getValue(item, key);\n\t\t\tif (Array.isArray(value)) {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n\t\t\t\tvalues = values.concat(value.map((v) => ({ value: v, weight })));\n\t\t\t} else if (typeof value === 'string') {\n\t\t\t\tvalues.push({\n\t\t\t\t\tvalue,\n\t\t\t\t\tweight,\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\t// for each item, check every key and get maximum score\n\t\tconst itemMatch = values.reduce(\n\t\t\t(\n\t\t\t\tresult: null | { matched: boolean; outScore: number },\n\t\t\t\t{ value, weight }: { value: string; weight: number },\n\t\t\t) => {\n\t\t\t\tif (!fuzzyMatchSimple(filter, value)) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\n\t\t\t\tconst match = fuzzyMatch(filter, value);\n\t\t\t\tmatch.outScore *= weight;\n\n\t\t\t\tconst { matched, outScore } = match;\n\t\t\t\tif (!result && matched) {\n\t\t\t\t\treturn match;\n\t\t\t\t}\n\t\t\t\tif (matched && result && outScore > result.outScore) {\n\t\t\t\t\treturn match;\n\t\t\t\t}\n\t\t\t\treturn result;\n\t\t\t},\n\t\t\tnull,\n\t\t);\n\n\t\tif (itemMatch) {\n\t\t\taccu.push({\n\t\t\t\tscore: itemMatch.outScore,\n\t\t\t\titem,\n\t\t\t});\n\t\t}\n\n\t\treturn accu;\n\t}, []);\n\n\tresults.sort((a, b) => {\n\t\treturn b.score - a.score;\n\t});\n\n\treturn results;\n}\n"],"mappings":";AAKA,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AACxB,IAAM,cAAc;AACpB,IAAM,qBAAqB;AAE3B,IAAM,yBAAyB;AAC/B,IAAM,6BAA6B;AACnC,IAAM,2BAA2B;AAE1B,IAAM,eAAe;AAAA,EAC3B,EAAE,KAAK,0BAA0B,QAAQ,IAAI;AAAA,EAC7C,EAAE,KAAK,0BAA0B,QAAQ,EAAE;AAC5C;AAOA,SAAS,iBAAiB,SAAiB,QAAyB;AACnE,MAAI,aAAa;AACjB,MAAI,SAAS;AAEb,SAAO,aAAa,QAAQ,UAAU,SAAS,OAAO,QAAQ;AAC7D,UAAM,cAAc,QAAQ,OAAO,UAAU,EAAE,YAAY;AAC3D,UAAM,aAAa,OAAO,OAAO,MAAM,EAAE,YAAY;AACrD,QAAI,gBAAgB,YAAY;AAC/B;AAAA,IACD;AACA,MAAE;AAAA,EACH;AAEA,SAAO,QAAQ,WAAW,KAAK,OAAO,WAAW,KAAK,eAAe,QAAQ;AAC9E;AAEA,SAAS,oBACR,SACA,QACA,iBACA,iBACA,eACA,SACA,YACA,WACA,gBACA,gBACyC;AACzC,MAAI,WAAW;AAGf,MAAI,EAAE,kBAAkB,gBAAgB;AACvC,WAAO,EAAE,SAAS,OAAO,SAAS;AAAA,EACnC;AAGA,MAAI,oBAAoB,QAAQ,UAAU,oBAAoB,OAAO,QAAQ;AAC5E,WAAO,EAAE,SAAS,OAAO,SAAS;AAAA,EACnC;AAGA,MAAI,iBAAiB;AACrB,MAAI,uBAAiC,CAAC;AACtC,MAAI,qBAAqB;AAGzB,MAAI,aAAa;AACjB,SAAO,kBAAkB,QAAQ,UAAU,kBAAkB,OAAO,QAAQ;AAE3E,QAAI,QAAQ,eAAe,EAAE,YAAY,MAAM,OAAO,eAAe,EAAE,YAAY,GAAG;AACrF,UAAI,aAAa,YAAY;AAC5B,eAAO,EAAE,SAAS,OAAO,SAAS;AAAA,MACnC;AAEA,UAAI,cAAc,eAAe;AAChC,kBAAU,CAAC,GAAG,aAAa;AAC3B,qBAAa;AAAA,MACd;AAEA,YAAM,mBAA6B,CAAC;AACpC,YAAM,kBAAkB;AAAA,QACvB;AAAA,QACA;AAAA,QACA;AAAA,QACA,kBAAkB;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACD;AAEA,YAAM,iBAAiB,gBAAgB;AACvC,UAAI,gBAAgB,SAAS;AAE5B,YAAI,CAAC,kBAAkB,iBAAiB,oBAAoB;AAC3D,iCAAuB,CAAC,GAAG,gBAAgB;AAC3C,+BAAqB;AAAA,QACtB;AACA,yBAAiB;AAAA,MAClB;AAEA,cAAQ,WAAW,IAAI;AACvB,QAAE;AAAA,IACH;AACA,MAAE;AAAA,EACH;AAEA,QAAM,UAAU,oBAAoB,QAAQ;AAE5C,MAAI,SAAS;AACZ,eAAW;AAGX,QAAI,CAAC,OAAO,YAAY,EAAE,WAAW,KAAK,GAAG;AAC5C,UAAI,UAAU,yBAAyB,QAAQ,CAAC;AAChD,gBAAU,UAAU,6BAA6B,6BAA6B;AAC9E,kBAAY;AAAA,IACb;AAGA,UAAM,YAAY,OAAO,SAAS;AAClC,gBAAY,2BAA2B;AAGvC,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AACnC,YAAM,UAAU,QAAQ,CAAC;AAEzB,UAAI,IAAI,GAAG;AACV,cAAM,UAAU,QAAQ,IAAI,CAAC;AAC7B,YAAI,YAAY,UAAU,GAAG;AAC5B,sBAAY;AAAA,QACb;AAAA,MACD;AAGA,UAAI,UAAU,GAAG;AAEhB,cAAM,WAAW,OAAO,UAAU,CAAC;AACnC,cAAM,OAAO,OAAO,OAAO;AAC3B,YAAI,aAAa,SAAS,YAAY,KAAK,SAAS,KAAK,YAAY,GAAG;AACvE,sBAAY;AAAA,QACb;AACA,cAAM,uBAAuB,aAAa,OAAO,aAAa;AAC9D,YAAI,sBAAsB;AACzB,sBAAY;AAAA,QACb;AAAA,MACD,OAAO;AAEN,oBAAY;AAAA,MACb;AAAA,IACD;AAGA,QAAI,mBAAmB,CAAC,WAAW,qBAAqB,WAAW;AAElE,gBAAU,CAAC,GAAG,oBAAoB;AAClC,iBAAW;AACX,aAAO,EAAE,SAAS,MAAM,SAAS;AAAA,IAClC,WAAW,SAAS;AAEnB,aAAO,EAAE,SAAS,MAAM,SAAS;AAAA,IAClC,OAAO;AACN,aAAO,EAAE,SAAS,OAAO,SAAS;AAAA,IACnC;AAAA,EACD;AACA,SAAO,EAAE,SAAS,OAAO,SAAS;AACnC;AASA,SAAS,WAAW,SAAiB,QAAwD;AAC5F,QAAM,iBAAiB;AACvB,QAAM,iBAAiB;AACvB,QAAM,UAAoB,CAAC;AAC3B,QAAM,aAAa;AAEnB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AAKA,SAAS,SAA2B,KAAQ,MAAuB;AAClE,MAAI,IAAI,eAAe,IAAI,GAAG;AAC7B,WAAO,IAAI,IAAe;AAAA,EAC3B;AAEA,QAAM,WAAW,KAAK,MAAM,GAAG;AAE/B,MAAI,SAAS;AACb,MAAI,IAAI;AACR,SAAO,UAAU,IAAI,SAAS,QAAQ;AACrC,UAAM,MAAM,SAAS,CAAC;AACtB,aAAS,OAAO,GAAG;AACnB;AAAA,EACD;AACA,SAAO;AACR;AAEO,SAAS,cACf,QACA,MACA,OAA+C,cACX;AACpC,QAAM,UAAU,KAAK,OAAO,CAAC,MAAyC,SAAY;AACjF,QAAI,SAAmD,CAAC;AACxD,SAAK,QAAQ,CAAC,EAAE,KAAK,OAAO,MAAM;AACjC,YAAM,QAAQ,SAAS,MAAM,GAAG;AAChC,UAAI,MAAM,QAAQ,KAAK,GAAG;AAEzB,iBAAS,OAAO,OAAO,MAAM,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,EAAE,CAAC;AAAA,MAChE,WAAW,OAAO,UAAU,UAAU;AACrC,eAAO,KAAK;AAAA,UACX;AAAA,UACA;AAAA,QACD,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAGD,UAAM,YAAY,OAAO;AAAA,MACxB,CACC,QACA,EAAE,OAAO,OAAO,MACZ;AACJ,YAAI,CAAC,iBAAiB,QAAQ,KAAK,GAAG;AACrC,iBAAO;AAAA,QACR;AAEA,cAAM,QAAQ,WAAW,QAAQ,KAAK;AACtC,cAAM,YAAY;AAElB,cAAM,EAAE,SAAS,SAAS,IAAI;AAC9B,YAAI,CAAC,UAAU,SAAS;AACvB,iBAAO;AAAA,QACR;AACA,YAAI,WAAW,UAAU,WAAW,OAAO,UAAU;AACpD,iBAAO;AAAA,QACR;AACA,eAAO;AAAA,MACR;AAAA,MACA;AAAA,IACD;AAEA,QAAI,WAAW;AACd,WAAK,KAAK;AAAA,QACT,OAAO,UAAU;AAAA,QACjB;AAAA,MACD,CAAC;AAAA,IACF;AAEA,WAAO;AAAA,EACR,GAAG,CAAC,CAAC;AAEL,UAAQ,KAAK,CAAC,GAAG,MAAM;AACtB,WAAO,EAAE,QAAQ,EAAE;AAAA,EACpB,CAAC;AAED,SAAO;AACR;","names":[]}

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@n8n/utils",
   "type": "module",
-  "version": "1.8.0",
+  "version": "1.10.0",
   "files": [
     "dist",
     "LICENSE.md",
@@ -19,11 +19,11 @@
     "@testing-library/user-event": "^14.6.1",
     "tsup": "^8.4.0",
     "typescript": "^5.8.2",
-    "vite": "^6.2.0",
-    "vitest": "^3.0.7",
-    "@n8n/eslint-config": "0.0.1",
+    "vite": "^6.3.5",
+    "vitest": "^3.1.3",
+    "@n8n/typescript-config": "1.2.0",
     "@n8n/vitest-config": "1.2.0",
-    "@n8n/typescript-config": "1.2.0"
+    "@n8n/eslint-config": "0.0.1"
   },
   "license": "SEE LICENSE IN LICENSE.md",
   "homepage": "https://n8n.io",