@visulima/string 3.0.0-alpha.8 → 3.0.0

package/dist/packem_shared/generate-cache-key-DdayDfjV.js

@@ -1,6 +0,0 @@
-const generateCacheKey = (value, options) => (
-  // Only include options that affect the output
-  `${value}::${options?.joiner ?? ""}::${options?.locale ?? ""}::${options?.knownAcronyms?.join(",") ?? ""}::${options?.normalize ? "true" : "false"}`
-);
-
-export { generateCacheKey as g };

package/dist/packem_shared/joinSegments-BStLas0c.js

@@ -1,44 +0,0 @@
-import { R as RE_FAST_ANSI } from './constants-D5qaproB.js';
-
-const joinSegments = (segments, joiner) => {
-  const { length } = segments;
-  if (length === 0) {
-    return "";
-  }
-  if (length === 1) {
-    return segments[0];
-  }
-  const result = [];
-  let ansiStart = "";
-  let currentContent = "";
-  for (let index = 0; index < length; index++) {
-    const segment = segments[index];
-    if (RE_FAST_ANSI.test(segment)) {
-      if (ansiStart) {
-        result.push(ansiStart + currentContent + segment);
-        ansiStart = "";
-        currentContent = "";
-      } else {
-        if (result.length > 0) {
-          result.push(joiner);
-        }
-        ansiStart = segment;
-      }
-      continue;
-    }
-    if (ansiStart) {
-      if (currentContent) {
-        currentContent += joiner;
-      }
-      currentContent += segment;
-    } else {
-      if (result.length > 0) {
-        result.push(joiner);
-      }
-      result.push(segment);
-    }
-  }
-  return result.join("");
-};
-
-export { joinSegments as default };

package/dist/packem_shared/lru-cache.d-BsP6kbVJ.d.ts

@@ -1,13 +0,0 @@
-declare class LRUCache<K, V> {
-  private readonly capacity;
-  private readonly cache;
-  private keyOrder;
-  constructor(capacity: number);
-  get(key: K): V | undefined;
-  has(key: K): boolean;
-  set(key: K, value: V): void;
-  delete(key: K): void;
-  clear(): void;
-  size(): number;
-}
-export { LRUCache as L };

package/dist/packem_shared/normalize-german-eszett-DEB8-ZPT.js

@@ -1,7 +0,0 @@
-const normalizeGermanEszett = (value) => (
-  // Replace "SS" with "ß" only when both letters are uppercase
-  // This uses a positive lookbehind to ensure we don't convert "ss" or "Ss"
-  value.replaceAll(/(?<![a-zß])SS(?![a-z])/g, "ß")
-);
-
-export { normalizeGermanEszett as n };

package/dist/packem_shared/replaceString-BVlxk27d.js

@@ -1,190 +0,0 @@
-const mergeIntervals = (intervals) => {
-  if (intervals.length === 0) {
-    return [];
-  }
-  const merged = [];
-  let currentMerge = [...intervals[0]];
-  for (let index = 1; index < intervals.length; index++) {
-    const next = intervals[index];
-    if (next && next[0] <= currentMerge[1] + 1) {
-      currentMerge[1] = Math.max(currentMerge[1], next[1]);
-    } else {
-      merged.push(currentMerge);
-      currentMerge = [...next];
-    }
-  }
-  merged.push(currentMerge);
-  return merged;
-};
-const replaceString = (source, searches, ignoreRanges) => {
-  if (!source) {
-    return "";
-  }
-  const potentialMatches = [];
-  let matchIdCounter = 0;
-  for (const item of searches) {
-    if (!item || item.length < 2) {
-      continue;
-    }
-    const [searchKey, replacementValue] = item;
-    if (replacementValue === void 0) {
-      continue;
-    }
-    try {
-      if (searchKey instanceof RegExp) {
-        const searchPattern = new RegExp(searchKey.source, `${searchKey.flags.replace("g", "")}g`);
-        let match;
-        while ((match = searchPattern.exec(source)) !== null) {
-          const start = match.index;
-          const original = match[0];
-          if (original.length === 0 && searchPattern.lastIndex === match.index) {
-            searchPattern.lastIndex += 1;
-          }
-          const end = start + original.length - 1;
-          const finalReplacement = replacementValue.replaceAll(/\$([\d&$`'])/g, (substringFound, capturedSymbolOrDigits) => {
-            if (capturedSymbolOrDigits === "&") {
-              return original;
-            }
-            if (capturedSymbolOrDigits === "$") {
-              return "$";
-            }
-            if (capturedSymbolOrDigits === "`") {
-              return source.slice(0, Math.max(0, start));
-            }
-            if (capturedSymbolOrDigits === "'") {
-              return source.slice(Math.max(0, start + original.length));
-            }
-            const groupIndex = Number.parseInt(capturedSymbolOrDigits, 10);
-            if (match && groupIndex > 0 && groupIndex < match.length) {
-              return match[groupIndex] ?? "";
-            }
-            return substringFound;
-          });
-          potentialMatches.push({ end, id: matchIdCounter++, original, replacement: finalReplacement, start });
-          if (original.length === 0 && searchPattern.lastIndex === start) {
-            searchPattern.lastIndex += 1;
-          }
-        }
-      } else if (typeof searchKey === "string" && searchKey.length > 0) {
-        for (let index = 0; (index = source.indexOf(searchKey, index)) !== -1; index++) {
-          const start = index;
-          const original = searchKey;
-          const end = start + original.length - 1;
-          const mockMatch = Object.assign([original], { index: start, input: source });
-          const finalReplacement = replacementValue.replaceAll(/\$(\d+|&|\$)/g, (substringFound, capturedSymbolOrDigits) => {
-            if (capturedSymbolOrDigits === "&") {
-              return original;
-            }
-            if (capturedSymbolOrDigits === "$") {
-              return "$";
-            }
-            const groupIndex = Number.parseInt(capturedSymbolOrDigits, 10);
-            if (mockMatch && groupIndex > 0 && groupIndex < mockMatch.length) {
-              return mockMatch[groupIndex] ?? "";
-            }
-            return substringFound;
-          });
-          potentialMatches.push({ end, id: matchIdCounter++, original, replacement: finalReplacement, start });
-        }
-      } else {
-        continue;
-      }
-    } catch {
-      continue;
-    }
-  }
-  potentialMatches.sort((a, b) => {
-    if (a.start !== b.start) {
-      return a.start - b.start;
-    }
-    return b.end - a.end;
-  });
-  const sortedIgnores = ignoreRanges.toSorted((a, b) => a[0] - b[0]);
-  const mergedIgnores = mergeIntervals(sortedIgnores);
-  const processedChars = source.split("").map((char, index) => {
-    return {
-      appliedMatchId: void 0,
-      char,
-      index,
-      insertBeforeReplacement: void 0,
-      isIgnored: false,
-      isMatchStart: false,
-      matchReplacement: void 0
-    };
-  });
-  for (const range of mergedIgnores) {
-    for (let index = range[0]; index <= range[1]; index++) {
-      if (processedChars[index]) {
-        processedChars[index].isIgnored = true;
-      }
-    }
-  }
-  let insertionAfterEnd = "";
-  for (const match of potentialMatches) {
-    if (match.original.length === 0 && match.start >= 0 && match.start <= processedChars.length) {
-      const targetIndex = match.start;
-      if (processedChars[targetIndex]) {
-        const targetChar = processedChars[targetIndex];
-        if (!targetChar.isIgnored) {
-          targetChar.insertBeforeReplacement = (targetChar.insertBeforeReplacement ?? "") + match.replacement;
-        }
-      } else if (targetIndex === processedChars.length) {
-        insertionAfterEnd += match.replacement;
-      }
-    }
-  }
-  for (const match of potentialMatches) {
-    if (match.original.length === 0) {
-      continue;
-    }
-    let canApply = true;
-    for (let index = match.start; index <= match.end; index++) {
-      if (!processedChars[index] || processedChars[index].isIgnored || processedChars[index].appliedMatchId !== void 0) {
-        canApply = false;
-        break;
-      }
-    }
-    if (canApply && match.start >= 0 && match.start < processedChars.length) {
-      for (let index = match.start; index <= match.end; index++) {
-        if (processedChars[index]) {
-          processedChars[index].appliedMatchId = match.id;
-        }
-      }
-      if (processedChars[match.start]) {
-        processedChars[match.start].isMatchStart = true;
-        processedChars[match.start].matchReplacement = match.replacement;
-      }
-    }
-  }
-  let result = "";
-  let currentIndex = 0;
-  while (currentIndex < processedChars.length) {
-    const pChar = processedChars[currentIndex];
-    if (pChar.insertBeforeReplacement !== void 0) {
-      result += pChar.insertBeforeReplacement;
-    }
-    if (pChar.isMatchStart && pChar.appliedMatchId !== void 0) {
-      result += pChar.matchReplacement ?? "";
-      let matchEndIndex = currentIndex;
-      for (let index = currentIndex + 1; index < processedChars.length; index++) {
-        if (processedChars[index]?.appliedMatchId === pChar.appliedMatchId) {
-          matchEndIndex = index;
-        } else {
-          break;
-        }
-      }
-      currentIndex = matchEndIndex + 1;
-    } else if (pChar.appliedMatchId === void 0) {
-      result += pChar.char;
-      currentIndex += 1;
-    } else {
-      currentIndex += 1;
-    }
-  }
-  if (insertionAfterEnd.length > 0) {
-    result += insertionAfterEnd;
-  }
-  return result;
-};
-
-export { replaceString as default };