@n8n/utils 1.17.0 → 1.19.0

package/dist/event-bus.d.ts

@@ -1,14 +0,0 @@
-type CallbackFn = (...args: any[]) => any;
-type Payloads<ListenerMap> = {
-    [E in keyof ListenerMap]: unknown;
-};
-type Listener<Payload> = (payload: Payload) => void;
-interface EventBus<ListenerMap extends Payloads<ListenerMap> = Record<string, any>> {
-    on<EventName extends keyof ListenerMap & string>(eventName: EventName, fn: Listener<ListenerMap[EventName]>): void;
-    once<EventName extends keyof ListenerMap & string>(eventName: EventName, fn: Listener<ListenerMap[EventName]>): void;
-    off<EventName extends keyof ListenerMap & string>(eventName: EventName, fn: Listener<ListenerMap[EventName]>): void;
-    emit<EventName extends keyof ListenerMap & string>(eventName: EventName, event?: ListenerMap[EventName]): void;
-}
-declare function createEventBus<ListenerMap extends Payloads<ListenerMap> = Record<string, any>>(): EventBus<ListenerMap>;
-
-export { type CallbackFn, type EventBus, createEventBus };

package/dist/event-bus.js

@@ -1,40 +0,0 @@
-// src/event-bus.ts
-function createEventBus() {
-  const handlers = /* @__PURE__ */ new Map();
-  return {
-    on(eventName, fn) {
-      let eventFns = handlers.get(eventName);
-      if (!eventFns) {
-        eventFns = [fn];
-      } else {
-        eventFns.push(fn);
-      }
-      handlers.set(eventName, eventFns);
-    },
-    once(eventName, fn) {
-      const handler = (payload) => {
-        this.off(eventName, handler);
-        fn(payload);
-      };
-      this.on(eventName, handler);
-    },
-    off(eventName, fn) {
-      const eventFns = handlers.get(eventName);
-      if (eventFns) {
-        eventFns.splice(eventFns.indexOf(fn) >>> 0, 1);
-      }
-    },
-    emit(eventName, event) {
-      const eventFns = handlers.get(eventName);
-      if (eventFns) {
-        eventFns.slice().forEach((handler) => {
-          handler(event);
-        });
-      }
-    }
-  };
-}
-export {
-  createEventBus
-};
-//# sourceMappingURL=event-bus.js.map

package/dist/event-bus.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/event-bus.ts"],"sourcesContent":["// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport type CallbackFn = (...args: any[]) => any;\n\ntype Payloads<ListenerMap> = {\n\t[E in keyof ListenerMap]: unknown;\n};\n\ntype Listener<Payload> = (payload: Payload) => void;\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport interface EventBus<ListenerMap extends Payloads<ListenerMap> = Record<string, any>> {\n\ton<EventName extends keyof ListenerMap & string>(\n\t\teventName: EventName,\n\t\tfn: Listener<ListenerMap[EventName]>,\n\t): void;\n\n\tonce<EventName extends keyof ListenerMap & string>(\n\t\teventName: EventName,\n\t\tfn: Listener<ListenerMap[EventName]>,\n\t): void;\n\n\toff<EventName extends keyof ListenerMap & string>(\n\t\teventName: EventName,\n\t\tfn: Listener<ListenerMap[EventName]>,\n\t): void;\n\n\temit<EventName extends keyof ListenerMap & string>(\n\t\teventName: EventName,\n\t\tevent?: ListenerMap[EventName],\n\t): void;\n}\n\n/**\n * Creates an event bus with the given listener map.\n *\n * @example\n * ```ts\n * const eventBus = createEventBus<{\n *   'user-logged-in': { username: string };\n *   'user-logged-out': never;\n * }>();\n */\nexport function createEventBus<\n\t// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\tListenerMap extends Payloads<ListenerMap> = Record<string, any>,\n>(): EventBus<ListenerMap> {\n\tconst handlers = new Map<string, CallbackFn[]>();\n\n\treturn {\n\t\ton(eventName, fn) {\n\t\t\tlet eventFns = handlers.get(eventName);\n\t\t\tif (!eventFns) {\n\t\t\t\teventFns = [fn];\n\t\t\t} else {\n\t\t\t\teventFns.push(fn);\n\t\t\t}\n\t\t\thandlers.set(eventName, eventFns);\n\t\t},\n\n\t\tonce(eventName, fn) {\n\t\t\tconst handler: typeof fn = (payload) => {\n\t\t\t\tthis.off(eventName, handler);\n\t\t\t\tfn(payload);\n\t\t\t};\n\t\t\tthis.on(eventName, handler);\n\t\t},\n\n\t\toff(eventName, fn) {\n\t\t\tconst eventFns = handlers.get(eventName);\n\t\t\tif (eventFns) {\n\t\t\t\teventFns.splice(eventFns.indexOf(fn) >>> 0, 1);\n\t\t\t}\n\t\t},\n\n\t\temit(eventName, event) {\n\t\t\tconst eventFns = handlers.get(eventName);\n\t\t\tif (eventFns) {\n\t\t\t\teventFns.slice().forEach((handler) => {\n\t\t\t\t\thandler(event);\n\t\t\t\t});\n\t\t\t}\n\t\t},\n\t};\n}\n"],"mappings":";AA0CO,SAAS,iBAGW;AAC1B,QAAM,WAAW,oBAAI,IAA0B;AAE/C,SAAO;AAAA,IACN,GAAG,WAAW,IAAI;AACjB,UAAI,WAAW,SAAS,IAAI,SAAS;AACrC,UAAI,CAAC,UAAU;AACd,mBAAW,CAAC,EAAE;AAAA,MACf,OAAO;AACN,iBAAS,KAAK,EAAE;AAAA,MACjB;AACA,eAAS,IAAI,WAAW,QAAQ;AAAA,IACjC;AAAA,IAEA,KAAK,WAAW,IAAI;AACnB,YAAM,UAAqB,CAAC,YAAY;AACvC,aAAK,IAAI,WAAW,OAAO;AAC3B,WAAG,OAAO;AAAA,MACX;AACA,WAAK,GAAG,WAAW,OAAO;AAAA,IAC3B;AAAA,IAEA,IAAI,WAAW,IAAI;AAClB,YAAM,WAAW,SAAS,IAAI,SAAS;AACvC,UAAI,UAAU;AACb,iBAAS,OAAO,SAAS,QAAQ,EAAE,MAAM,GAAG,CAAC;AAAA,MAC9C;AAAA,IACD;AAAA,IAEA,KAAK,WAAW,OAAO;AACtB,YAAM,WAAW,SAAS,IAAI,SAAS;AACvC,UAAI,UAAU;AACb,iBAAS,MAAM,EAAE,QAAQ,CAAC,YAAY;AACrC,kBAAQ,KAAK;AAAA,QACd,CAAC;AAAA,MACF;AAAA,IACD;AAAA,EACD;AACD;","names":[]}

package/dist/event-queue.cjs.map

@@ -1 +0,0 @@
-{"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.ts

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

package/dist/event-queue.js

@@ -1,30 +0,0 @@
-// 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

@@ -1 +0,0 @@
-{"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/number/smartDecimal.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/number/smartDecimal.cjs","../../src/number/smartDecimal.ts"],"names":[],"mappings":"AAAA;ACAO,IAAM,aAAA,EAAe,CAAC,KAAA,EAAe,SAAA,EAAW,CAAA,EAAA,GAAc;AAEpE,EAAA,GAAA,CAAI,MAAA,CAAO,SAAA,CAAU,KAAK,CAAA,EAAG;AAC5B,IAAA,OAAO,KAAA;AAAA,EACR;AAGA,EAAA,GAAA,CAAI,KAAA,CAAM,QAAA,CAAS,CAAA,CAAE,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,CAAA,CAAE,OAAA,GAAU,QAAA,EAAU;AACtD,IAAA,OAAO,KAAA;AAAA,EACR;AAEA,EAAA,OAAO,MAAA,CAAO,KAAA,CAAM,OAAA,CAAQ,QAAQ,CAAC,CAAA;AACtC,CAAA;ADFA;AACE;AACF,oCAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/number/smartDecimal.cjs","sourcesContent":[null,"export const smartDecimal = (value: number, decimals = 2): number => {\n\t// Check if integer\n\tif (Number.isInteger(value)) {\n\t\treturn value;\n\t}\n\n\t// Check if it has only one decimal place\n\tif (value.toString().split('.')[1].length <= decimals) {\n\t\treturn value;\n\t}\n\n\treturn Number(value.toFixed(decimals));\n};\n"]}

package/dist/number/smartDecimal.d.ts

@@ -1,3 +0,0 @@
-declare const smartDecimal: (value: number, decimals?: number) => number;
-
-export { smartDecimal };

package/dist/number/smartDecimal.js

@@ -1,14 +0,0 @@
-// src/number/smartDecimal.ts
-var smartDecimal = (value, decimals = 2) => {
-  if (Number.isInteger(value)) {
-    return value;
-  }
-  if (value.toString().split(".")[1].length <= decimals) {
-    return value;
-  }
-  return Number(value.toFixed(decimals));
-};
-export {
-  smartDecimal
-};
-//# sourceMappingURL=smartDecimal.js.map

package/dist/number/smartDecimal.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/number/smartDecimal.ts"],"sourcesContent":["export const smartDecimal = (value: number, decimals = 2): number => {\n\t// Check if integer\n\tif (Number.isInteger(value)) {\n\t\treturn value;\n\t}\n\n\t// Check if it has only one decimal place\n\tif (value.toString().split('.')[1].length <= decimals) {\n\t\treturn value;\n\t}\n\n\treturn Number(value.toFixed(decimals));\n};\n"],"mappings":";AAAO,IAAM,eAAe,CAAC,OAAe,WAAW,MAAc;AAEpE,MAAI,OAAO,UAAU,KAAK,GAAG;AAC5B,WAAO;AAAA,EACR;AAGA,MAAI,MAAM,SAAS,EAAE,MAAM,GAAG,EAAE,CAAC,EAAE,UAAU,UAAU;AACtD,WAAO;AAAA,EACR;AAEA,SAAO,OAAO,MAAM,QAAQ,QAAQ,CAAC;AACtC;","names":[]}

package/dist/retry.cjs.map

@@ -1 +0,0 @@
-{"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.js

@@ -1,31 +0,0 @@
-// 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

@@ -1 +0,0 @@
-{"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/reRankSearchResults.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/search/reRankSearchResults.cjs","../../src/search/reRankSearchResults.ts"],"names":[],"mappings":"AAAA;ACAO,SAAS,mBAAA,CACf,aAAA,EACA,iBAAA,EACoC;AACpC,EAAA,OAAO,aAAA,CACL,GAAA,CAAI,CAAC,EAAE,KAAA,EAAO,KAAK,CAAA,EAAA,GAAM;AAGzB,IAAA,MAAM,gBAAA,EAAkB,MAAA,CAAO,OAAA,CAAQ,iBAAiB,CAAA,CAAE,MAAA,CAAO,CAAC,GAAA,EAAK,CAAC,CAAA,EAAG,YAAY,CAAA,EAAA,GAAM;AAC5F,MAAA,MAAM,YAAA,EAAc,YAAA,CAAa,IAAA,CAAK,GAAG,CAAA;AACzC,MAAA,GAAA,CAAI,WAAA,EAAa;AAChB,QAAA,OAAO,IAAA,EAAM,WAAA;AAAA,MACd;AAEA,MAAA,OAAO,GAAA;AAAA,IACR,CAAA,EAAG,CAAC,CAAA;AAEJ,IAAA,OAAO;AAAA,MACN,KAAA,EAAO,MAAA,EAAQ,eAAA;AAAA,MACf;AAAA,IACD,CAAA;AAAA,EACD,CAAC,CAAA,CACA,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM;AACf,IAAA,OAAO,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,KAAA;AAAA,EACpB,CAAC,CAAA;AACH;ADPA;AACE;AACF,kDAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/search/reRankSearchResults.cjs","sourcesContent":[null,"export function reRankSearchResults<T extends { key: string }>(\n\tsearchResults: Array<{ score: number; item: T }>,\n\tadditionalFactors: Record<string, Record<string, number>>,\n): Array<{ score: number; item: T }> {\n\treturn searchResults\n\t\t.map(({ score, item }) => {\n\t\t\t// For each additional factor, we check if it exists for the item and type,\n\t\t\t// and if so, we add the score to the item's score.\n\t\t\tconst additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {\n\t\t\t\tconst factorScore = factorScores[item.key];\n\t\t\t\tif (factorScore) {\n\t\t\t\t\treturn acc + factorScore;\n\t\t\t\t}\n\n\t\t\t\treturn acc;\n\t\t\t}, 0);\n\n\t\t\treturn {\n\t\t\t\tscore: score + additionalScore,\n\t\t\t\titem,\n\t\t\t};\n\t\t})\n\t\t.sort((a, b) => {\n\t\t\treturn b.score - a.score;\n\t\t});\n}\n"]}

package/dist/search/reRankSearchResults.d.ts

@@ -1,11 +0,0 @@
-declare function reRankSearchResults<T extends {
-    key: string;
-}>(searchResults: Array<{
-    score: number;
-    item: T;
-}>, additionalFactors: Record<string, Record<string, number>>): Array<{
-    score: number;
-    item: T;
-}>;
-
-export { reRankSearchResults };

package/dist/search/reRankSearchResults.js

@@ -1,22 +0,0 @@
-// src/search/reRankSearchResults.ts
-function reRankSearchResults(searchResults, additionalFactors) {
-  return searchResults.map(({ score, item }) => {
-    const additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {
-      const factorScore = factorScores[item.key];
-      if (factorScore) {
-        return acc + factorScore;
-      }
-      return acc;
-    }, 0);
-    return {
-      score: score + additionalScore,
-      item
-    };
-  }).sort((a, b) => {
-    return b.score - a.score;
-  });
-}
-export {
-  reRankSearchResults
-};
-//# sourceMappingURL=reRankSearchResults.js.map

package/dist/search/reRankSearchResults.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/search/reRankSearchResults.ts"],"sourcesContent":["export function reRankSearchResults<T extends { key: string }>(\n\tsearchResults: Array<{ score: number; item: T }>,\n\tadditionalFactors: Record<string, Record<string, number>>,\n): Array<{ score: number; item: T }> {\n\treturn searchResults\n\t\t.map(({ score, item }) => {\n\t\t\t// For each additional factor, we check if it exists for the item and type,\n\t\t\t// and if so, we add the score to the item's score.\n\t\t\tconst additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {\n\t\t\t\tconst factorScore = factorScores[item.key];\n\t\t\t\tif (factorScore) {\n\t\t\t\t\treturn acc + factorScore;\n\t\t\t\t}\n\n\t\t\t\treturn acc;\n\t\t\t}, 0);\n\n\t\t\treturn {\n\t\t\t\tscore: score + additionalScore,\n\t\t\t\titem,\n\t\t\t};\n\t\t})\n\t\t.sort((a, b) => {\n\t\t\treturn b.score - a.score;\n\t\t});\n}\n"],"mappings":";AAAO,SAAS,oBACf,eACA,mBACoC;AACpC,SAAO,cACL,IAAI,CAAC,EAAE,OAAO,KAAK,MAAM;AAGzB,UAAM,kBAAkB,OAAO,QAAQ,iBAAiB,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,YAAY,MAAM;AAC5F,YAAM,cAAc,aAAa,KAAK,GAAG;AACzC,UAAI,aAAa;AAChB,eAAO,MAAM;AAAA,MACd;AAEA,aAAO;AAAA,IACR,GAAG,CAAC;AAEJ,WAAO;AAAA,MACN,OAAO,QAAQ;AAAA,MACf;AAAA,IACD;AAAA,EACD,CAAC,EACA,KAAK,CAAC,GAAG,MAAM;AACf,WAAO,EAAE,QAAQ,EAAE;AAAA,EACpB,CAAC;AACH;","names":[]}

package/dist/search/sublimeSearch.cjs.map

@@ -1 +0,0 @@
-{"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.d.ts

@@ -1,13 +0,0 @@
-declare const DEFAULT_KEYS: {
-    key: string;
-    weight: number;
-}[];
-declare function sublimeSearch<T extends object>(filter: string, data: readonly T[], keys?: Array<{
-    key: string;
-    weight: number;
-}>): Array<{
-    score: number;
-    item: T;
-}>;
-
-export { DEFAULT_KEYS, sublimeSearch };

package/dist/search/sublimeSearch.js

@@ -1,198 +0,0 @@
-// src/search/sublimeSearch.ts
-var SEQUENTIAL_BONUS = 60;
-var SEPARATOR_BONUS = 38;
-var CAMEL_BONUS = 30;
-var FIRST_LETTER_BONUS = 15;
-var LEADING_LETTER_PENALTY = -20;
-var MAX_LEADING_LETTER_PENALTY = -200;
-var UNMATCHED_LETTER_PENALTY = -5;
-var DEFAULT_KEYS = [
-  { key: "properties.displayName", weight: 1.3 },
-  { key: "properties.codex.alias", weight: 1 }
-];
-function fuzzyMatchSimple(pattern, target) {
-  let patternIdx = 0;
-  let strIdx = 0;
-  while (patternIdx < pattern.length && strIdx < target.length) {
-    const patternChar = pattern.charAt(patternIdx).toLowerCase();
-    const targetChar = target.charAt(strIdx).toLowerCase();
-    if (patternChar === targetChar) {
-      patternIdx++;
-    }
-    ++strIdx;
-  }
-  return pattern.length !== 0 && target.length !== 0 && patternIdx === pattern.length;
-}
-function fuzzyMatchRecursive(pattern, target, patternCurIndex, targetCurrIndex, targetMatches, matches, maxMatches, nextMatch, recursionCount, recursionLimit) {
-  let outScore = 0;
-  if (++recursionCount >= recursionLimit) {
-    return { matched: false, outScore };
-  }
-  if (patternCurIndex === pattern.length || targetCurrIndex === target.length) {
-    return { matched: false, outScore };
-  }
-  let recursiveMatch = false;
-  let bestRecursiveMatches = [];
-  let bestRecursiveScore = 0;
-  let firstMatch = true;
-  while (patternCurIndex < pattern.length && targetCurrIndex < target.length) {
-    if (pattern[patternCurIndex].toLowerCase() === target[targetCurrIndex].toLowerCase()) {
-      if (nextMatch >= maxMatches) {
-        return { matched: false, outScore };
-      }
-      if (firstMatch && targetMatches) {
-        matches = [...targetMatches];
-        firstMatch = false;
-      }
-      const recursiveMatches = [];
-      const recursiveResult = fuzzyMatchRecursive(
-        pattern,
-        target,
-        patternCurIndex,
-        targetCurrIndex + 1,
-        matches,
-        recursiveMatches,
-        maxMatches,
-        nextMatch,
-        recursionCount,
-        recursionLimit
-      );
-      const recursiveScore = recursiveResult.outScore;
-      if (recursiveResult.matched) {
-        if (!recursiveMatch || recursiveScore > bestRecursiveScore) {
-          bestRecursiveMatches = [...recursiveMatches];
-          bestRecursiveScore = recursiveScore;
-        }
-        recursiveMatch = true;
-      }
-      matches[nextMatch++] = targetCurrIndex;
-      ++patternCurIndex;
-    }
-    ++targetCurrIndex;
-  }
-  const matched = patternCurIndex === pattern.length;
-  if (matched) {
-    outScore = 100;
-    if (!target.toLowerCase().startsWith("n8n")) {
-      let penalty = LEADING_LETTER_PENALTY * matches[0];
-      penalty = penalty < MAX_LEADING_LETTER_PENALTY ? MAX_LEADING_LETTER_PENALTY : penalty;
-      outScore += penalty;
-    }
-    const unmatched = target.length - nextMatch;
-    outScore += UNMATCHED_LETTER_PENALTY * unmatched;
-    for (let i = 0; i < nextMatch; i++) {
-      const currIdx = matches[i];
-      if (i > 0) {
-        const prevIdx = matches[i - 1];
-        if (currIdx === prevIdx + 1) {
-          outScore += SEQUENTIAL_BONUS;
-        }
-      }
-      if (currIdx > 0) {
-        const neighbor = target[currIdx - 1];
-        const curr = target[currIdx];
-        if (neighbor !== neighbor.toUpperCase() && curr !== curr.toLowerCase()) {
-          outScore += CAMEL_BONUS;
-        }
-        const isNeighbourSeparator = neighbor === "_" || neighbor === " ";
-        if (isNeighbourSeparator) {
-          outScore += SEPARATOR_BONUS;
-        }
-      } else {
-        outScore += FIRST_LETTER_BONUS;
-      }
-    }
-    if (recursiveMatch && (!matched || bestRecursiveScore > outScore)) {
-      matches = [...bestRecursiveMatches];
-      outScore = bestRecursiveScore;
-      return { matched: true, outScore };
-    } else if (matched) {
-      return { matched: true, outScore };
-    } else {
-      return { matched: false, outScore };
-    }
-  }
-  return { matched: false, outScore };
-}
-function fuzzyMatch(pattern, target) {
-  const recursionCount = 0;
-  const recursionLimit = 5;
-  const matches = [];
-  const maxMatches = 256;
-  return fuzzyMatchRecursive(
-    pattern,
-    target,
-    0,
-    0,
-    null,
-    matches,
-    maxMatches,
-    0,
-    recursionCount,
-    recursionLimit
-  );
-}
-function getValue(obj, prop) {
-  if (obj.hasOwnProperty(prop)) {
-    return obj[prop];
-  }
-  const segments = prop.split(".");
-  let result = obj;
-  let i = 0;
-  while (result && i < segments.length) {
-    const key = segments[i];
-    result = result[key];
-    i++;
-  }
-  return result;
-}
-function sublimeSearch(filter, data, keys = DEFAULT_KEYS) {
-  const results = data.reduce((accu, item) => {
-    let values = [];
-    keys.forEach(({ key, weight }) => {
-      const value = getValue(item, key);
-      if (Array.isArray(value)) {
-        values = values.concat(value.map((v) => ({ value: v, weight })));
-      } else if (typeof value === "string") {
-        values.push({
-          value,
-          weight
-        });
-      }
-    });
-    const itemMatch = values.reduce(
-      (result, { value, weight }) => {
-        if (!fuzzyMatchSimple(filter, value)) {
-          return result;
-        }
-        const match = fuzzyMatch(filter, value);
-        match.outScore *= weight;
-        const { matched, outScore } = match;
-        if (!result && matched) {
-          return match;
-        }
-        if (matched && result && outScore > result.outScore) {
-          return match;
-        }
-        return result;
-      },
-      null
-    );
-    if (itemMatch) {
-      accu.push({
-        score: itemMatch.outScore,
-        item
-      });
-    }
-    return accu;
-  }, []);
-  results.sort((a, b) => {
-    return b.score - a.score;
-  });
-  return results;
-}
-export {
-  DEFAULT_KEYS,
-  sublimeSearch
-};
-//# sourceMappingURL=sublimeSearch.js.map

package/dist/search/sublimeSearch.js.map

@@ -1 +0,0 @@
-{"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/dist/sort/sortByProperty.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/sort/sortByProperty.cjs","../../src/sort/sortByProperty.ts"],"names":[],"mappings":"AAAA;ACAO,IAAM,eAAA,EAAiB,CAC7B,QAAA,EACA,GAAA,EACA,MAAA,EAAwB,KAAA,EAAA,GAExB,GAAA,CAAI,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM;AAClB,EAAA,MAAM,OAAA,EAAS,MAAA,CAAO,CAAA,CAAE,QAAQ,CAAC,CAAA,CAAE,aAAA,CAAc,MAAA,CAAO,CAAA,CAAE,QAAQ,CAAC,CAAA,EAAG,KAAA,CAAA,EAAW;AAAA,IAChF,OAAA,EAAS,IAAA;AAAA,IACT,WAAA,EAAa;AAAA,EACd,CAAC,CAAA;AACD,EAAA,OAAO,MAAA,IAAU,MAAA,EAAQ,OAAA,EAAS,CAAC,MAAA;AACpC,CAAC,CAAA;ADHF;AACE;AACF,wCAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/sort/sortByProperty.cjs","sourcesContent":[null,"export const sortByProperty = <T>(\n\tproperty: keyof T,\n\tarr: T[],\n\torder: 'asc' | 'desc' = 'asc',\n): T[] =>\n\tarr.sort((a, b) => {\n\t\tconst result = String(a[property]).localeCompare(String(b[property]), undefined, {\n\t\t\tnumeric: true,\n\t\t\tsensitivity: 'base',\n\t\t});\n\t\treturn order === 'asc' ? result : -result;\n\t});\n"]}

package/dist/sort/sortByProperty.d.ts

@@ -1,3 +0,0 @@
-declare const sortByProperty: <T>(property: keyof T, arr: T[], order?: "asc" | "desc") => T[];
-
-export { sortByProperty };

package/dist/sort/sortByProperty.js

@@ -1,12 +0,0 @@
-// src/sort/sortByProperty.ts
-var sortByProperty = (property, arr, order = "asc") => arr.sort((a, b) => {
-  const result = String(a[property]).localeCompare(String(b[property]), void 0, {
-    numeric: true,
-    sensitivity: "base"
-  });
-  return order === "asc" ? result : -result;
-});
-export {
-  sortByProperty
-};
-//# sourceMappingURL=sortByProperty.js.map

package/dist/sort/sortByProperty.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/sort/sortByProperty.ts"],"sourcesContent":["export const sortByProperty = <T>(\n\tproperty: keyof T,\n\tarr: T[],\n\torder: 'asc' | 'desc' = 'asc',\n): T[] =>\n\tarr.sort((a, b) => {\n\t\tconst result = String(a[property]).localeCompare(String(b[property]), undefined, {\n\t\t\tnumeric: true,\n\t\t\tsensitivity: 'base',\n\t\t});\n\t\treturn order === 'asc' ? result : -result;\n\t});\n"],"mappings":";AAAO,IAAM,iBAAiB,CAC7B,UACA,KACA,QAAwB,UAExB,IAAI,KAAK,CAAC,GAAG,MAAM;AAClB,QAAM,SAAS,OAAO,EAAE,QAAQ,CAAC,EAAE,cAAc,OAAO,EAAE,QAAQ,CAAC,GAAG,QAAW;AAAA,IAChF,SAAS;AAAA,IACT,aAAa;AAAA,EACd,CAAC;AACD,SAAO,UAAU,QAAQ,SAAS,CAAC;AACpC,CAAC;","names":[]}

package/dist/string/truncate.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/string/truncate.cjs","../../src/string/truncate.ts"],"names":[],"mappings":"AAAA;ACAO,IAAM,SAAA,EAAW,CAAC,IAAA,EAAc,OAAA,EAAS,EAAA,EAAA,GAC/C,IAAA,CAAK,OAAA,EAAS,OAAA,EAAS,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,MAAM,EAAA,EAAI,MAAA,EAAQ,IAAA;AAQjD,SAAS,kBAAA,CAAmB,IAAA,EAAc,SAAA,EAA2B;AAC3E,EAAA,MAAM,MAAA,EAAkB,CAAC,CAAA;AAEzB,EAAA,MAAM,UAAA,EAAY,IAAI,IAAA,CAAK,SAAA,CAAU,KAAA,CAAA,EAAW,EAAE,WAAA,EAAa,WAAW,CAAC,CAAA;AAE3E,EAAA,IAAA,CAAA,MAAW,EAAE,QAAQ,EAAA,GAAK,SAAA,CAAU,OAAA,CAAQ,IAAI,CAAA,EAAG;AAClD,IAAA,KAAA,CAAM,IAAA,CAAK,OAAO,CAAA;AAAA,EACnB;AAEA,EAAA,GAAA,CAAI,KAAA,CAAM,OAAA,GAAU,SAAA,EAAW;AAC9B,IAAA,OAAO,IAAA;AAAA,EACR;AAEA,EAAA,MAAM,oBAAA,EAAsB,KAAA,CAAM,aAAA,CAAc,CAAC,EAAA,EAAA,GAAO,EAAA,CAAG,KAAA,CAAM,OAAO,CAAC,CAAA;AACzE,EAAA,MAAM,cAAA,EAAgB,oBAAA,EAAsB,CAAA;AAC5C,EAAA,MAAM,SAAA,EAAW,KAAA,CAAM,KAAA,CAAM,aAAa,CAAA;AAC1C,EAAA,MAAM,SAAA,EAAW,QAAA;AACjB,EAAA,MAAM,eAAA,EAAiB,QAAA,CAAS,MAAA;AAEhC,EAAA,GAAA,CAAI,QAAA,CAAS,OAAA,EAAS,EAAA,EAAI;AACzB,IAAA,MAAM,cAAA,EAAgB,KAAA,CAAM,OAAA,EAAS,UAAA,EAAY,cAAA;AACjD,IAAA,MAAM,oBAAA,EAAsB,aAAA;AAC5B,IAAA,MAAM,WAAA,EAAa,oBAAA,EAAsB,aAAA;AAEzC,IAAA,GAAA,CAAI,WAAA,EAAa,CAAA,EAAG;AACnB,MAAA,OACC,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA,CAAE,IAAA,CAAK,EAAE,EAAA,EAAI,SAAA,EAAW,KAAA,CAAM,KAAA,CAAM,mBAAmB,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA;AAAA,IAE3F;AAAA,EACD;AAEA,EAAA,OACC,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,UAAA,EAAY,EAAA,EAAI,cAAc,CAAA,CAAE,IAAA,CAAK,EAAE,EAAA,EAAI,SAAA,EAAW,KAAA,CAAM,KAAA,CAAM,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA;AAE9F;ADjBA;AACE;AACA;AACF,6EAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/string/truncate.cjs","sourcesContent":[null,"export const truncate = (text: string, length = 30): string =>\n\ttext.length > length ? text.slice(0, length) + '...' : text;\n\n/**\n * Replace part of given text with ellipsis following the rules below:\n *\n * - Remove chars just before the last word, as long as the last word is under 15 chars\n * - Otherwise preserve the last 5 chars of the name and remove chars before that\n */\nexport function truncateBeforeLast(text: string, maxLength: number): string {\n\tconst chars: string[] = [];\n\n\tconst segmenter = new Intl.Segmenter(undefined, { granularity: 'grapheme' });\n\n\tfor (const { segment } of segmenter.segment(text)) {\n\t\tchars.push(segment);\n\t}\n\n\tif (chars.length <= maxLength) {\n\t\treturn text;\n\t}\n\n\tconst lastWhitespaceIndex = chars.findLastIndex((ch) => ch.match(/^\\s+$/));\n\tconst lastWordIndex = lastWhitespaceIndex + 1;\n\tconst lastWord = chars.slice(lastWordIndex);\n\tconst ellipsis = '…';\n\tconst ellipsisLength = ellipsis.length;\n\n\tif (lastWord.length < 15) {\n\t\tconst charsToRemove = chars.length - maxLength + ellipsisLength;\n\t\tconst indexBeforeLastWord = lastWordIndex;\n\t\tconst keepLength = indexBeforeLastWord - charsToRemove;\n\n\t\tif (keepLength > 0) {\n\t\t\treturn (\n\t\t\t\tchars.slice(0, keepLength).join('') + ellipsis + chars.slice(indexBeforeLastWord).join('')\n\t\t\t);\n\t\t}\n\t}\n\n\treturn (\n\t\tchars.slice(0, maxLength - 5 - ellipsisLength).join('') + ellipsis + chars.slice(-5).join('')\n\t);\n}\n"]}

package/dist/string/truncate.js

@@ -1,31 +0,0 @@
-// src/string/truncate.ts
-var truncate = (text, length = 30) => text.length > length ? text.slice(0, length) + "..." : text;
-function truncateBeforeLast(text, maxLength) {
-  const chars = [];
-  const segmenter = new Intl.Segmenter(void 0, { granularity: "grapheme" });
-  for (const { segment } of segmenter.segment(text)) {
-    chars.push(segment);
-  }
-  if (chars.length <= maxLength) {
-    return text;
-  }
-  const lastWhitespaceIndex = chars.findLastIndex((ch) => ch.match(/^\s+$/));
-  const lastWordIndex = lastWhitespaceIndex + 1;
-  const lastWord = chars.slice(lastWordIndex);
-  const ellipsis = "\u2026";
-  const ellipsisLength = ellipsis.length;
-  if (lastWord.length < 15) {
-    const charsToRemove = chars.length - maxLength + ellipsisLength;
-    const indexBeforeLastWord = lastWordIndex;
-    const keepLength = indexBeforeLastWord - charsToRemove;
-    if (keepLength > 0) {
-      return chars.slice(0, keepLength).join("") + ellipsis + chars.slice(indexBeforeLastWord).join("");
-    }
-  }
-  return chars.slice(0, maxLength - 5 - ellipsisLength).join("") + ellipsis + chars.slice(-5).join("");
-}
-export {
-  truncate,
-  truncateBeforeLast
-};
-//# sourceMappingURL=truncate.js.map

package/dist/string/truncate.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/string/truncate.ts"],"sourcesContent":["export const truncate = (text: string, length = 30): string =>\n\ttext.length > length ? text.slice(0, length) + '...' : text;\n\n/**\n * Replace part of given text with ellipsis following the rules below:\n *\n * - Remove chars just before the last word, as long as the last word is under 15 chars\n * - Otherwise preserve the last 5 chars of the name and remove chars before that\n */\nexport function truncateBeforeLast(text: string, maxLength: number): string {\n\tconst chars: string[] = [];\n\n\tconst segmenter = new Intl.Segmenter(undefined, { granularity: 'grapheme' });\n\n\tfor (const { segment } of segmenter.segment(text)) {\n\t\tchars.push(segment);\n\t}\n\n\tif (chars.length <= maxLength) {\n\t\treturn text;\n\t}\n\n\tconst lastWhitespaceIndex = chars.findLastIndex((ch) => ch.match(/^\\s+$/));\n\tconst lastWordIndex = lastWhitespaceIndex + 1;\n\tconst lastWord = chars.slice(lastWordIndex);\n\tconst ellipsis = '…';\n\tconst ellipsisLength = ellipsis.length;\n\n\tif (lastWord.length < 15) {\n\t\tconst charsToRemove = chars.length - maxLength + ellipsisLength;\n\t\tconst indexBeforeLastWord = lastWordIndex;\n\t\tconst keepLength = indexBeforeLastWord - charsToRemove;\n\n\t\tif (keepLength > 0) {\n\t\t\treturn (\n\t\t\t\tchars.slice(0, keepLength).join('') + ellipsis + chars.slice(indexBeforeLastWord).join('')\n\t\t\t);\n\t\t}\n\t}\n\n\treturn (\n\t\tchars.slice(0, maxLength - 5 - ellipsisLength).join('') + ellipsis + chars.slice(-5).join('')\n\t);\n}\n"],"mappings":";AAAO,IAAM,WAAW,CAAC,MAAc,SAAS,OAC/C,KAAK,SAAS,SAAS,KAAK,MAAM,GAAG,MAAM,IAAI,QAAQ;AAQjD,SAAS,mBAAmB,MAAc,WAA2B;AAC3E,QAAM,QAAkB,CAAC;AAEzB,QAAM,YAAY,IAAI,KAAK,UAAU,QAAW,EAAE,aAAa,WAAW,CAAC;AAE3E,aAAW,EAAE,QAAQ,KAAK,UAAU,QAAQ,IAAI,GAAG;AAClD,UAAM,KAAK,OAAO;AAAA,EACnB;AAEA,MAAI,MAAM,UAAU,WAAW;AAC9B,WAAO;AAAA,EACR;AAEA,QAAM,sBAAsB,MAAM,cAAc,CAAC,OAAO,GAAG,MAAM,OAAO,CAAC;AACzE,QAAM,gBAAgB,sBAAsB;AAC5C,QAAM,WAAW,MAAM,MAAM,aAAa;AAC1C,QAAM,WAAW;AACjB,QAAM,iBAAiB,SAAS;AAEhC,MAAI,SAAS,SAAS,IAAI;AACzB,UAAM,gBAAgB,MAAM,SAAS,YAAY;AACjD,UAAM,sBAAsB;AAC5B,UAAM,aAAa,sBAAsB;AAEzC,QAAI,aAAa,GAAG;AACnB,aACC,MAAM,MAAM,GAAG,UAAU,EAAE,KAAK,EAAE,IAAI,WAAW,MAAM,MAAM,mBAAmB,EAAE,KAAK,EAAE;AAAA,IAE3F;AAAA,EACD;AAEA,SACC,MAAM,MAAM,GAAG,YAAY,IAAI,cAAc,EAAE,KAAK,EAAE,IAAI,WAAW,MAAM,MAAM,EAAE,EAAE,KAAK,EAAE;AAE9F;","names":[]}