@visulima/string 2.0.3 → 2.0.4

package/dist/utilities.js

@@ -1 +1,54 @@
-var o=Object.defineProperty;var c=(u,t)=>o(u,"name",{value:t,configurable:!0});import{default as x}from"./packem_shared/LRUCache-Bjo6gsbC.js";var p=Object.defineProperty,n=c((u,t)=>p(u,"name",{value:t,configurable:!0}),"n");const h=n(u=>u.replaceAll(/[.*+?^${}()|[\]\\]/g,String.raw`\$&`),"escapeRegExp"),C=n((u,t)=>t.some(F=>u>=F[0]&&u<=F[1]),"inRange"),E=n(u=>/[\u2E80-\u2E99\u2E9B-\u2EF3\u2F00-\u2FD5\u3005\u3007\u3021-\u3029\u3038-\u303B\u3400-\u4DBF\u4E00-\u9FFC\uF900-\uFA6D\uFA70-\uFAD9]|\uD81B[\uDFF0\uDFF1]|[\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883][\uDC00-\uDFFF]|\uD869[\uDC00-\uDEDD\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A]/.test(u),"hasChinese"),g=n(u=>/[\p{P}\p{Z}]/u.test(u),"hasPunctuationOrSpace"),l=n((u,t)=>{const F=[];if(!Array.isArray(t))return F;if(t.forEach(D=>{if(typeof D!="string"||D.length===0)return;let r=0,a;for(;(a=u.indexOf(D,r))>-1;){const i=a+D.length-1;F.push([a,i]),r=a+1}}),F.length===0)return[];F.sort((D,r)=>D[0]-r[0]);const s=[];let e;for(const D of F)e===void 0?e=[...D]:D[0]<=e[1]+1?e[1]=Math.max(e[1],D[1]):(s.push(e),e=[...D]);return e!==void 0&&s.push(e),s},"findStringOccurrences");export{x as LRUCache,h as escapeRegExp,l as findStringOccurrences,E as hasChinese,g as hasPunctuationOrSpace,C as inRange};
+export { default as LRUCache } from './packem_shared/LRUCache-3r3SovvR.js';
+
+const escapeRegExp = (char) => (
+  // $& means the whole matched string
+  char.replaceAll(/[.*+?^${}()|[\]\\]/g, String.raw`\$&`)
+);
+const inRange = (number_, ranges) => ranges.some((range) => number_ >= range[0] && number_ <= range[1]);
+const hasChinese = (char) => /[\u2E80-\u2E99\u2E9B-\u2EF3\u2F00-\u2FD5\u3005\u3007\u3021-\u3029\u3038-\u303B\u3400-\u4DBF\u4E00-\u9FFC\uF900-\uFA6D\uFA70-\uFAD9]|\uD81B[\uDFF0\uDFF1]|[\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883][\uDC00-\uDFFF]|\uD869[\uDC00-\uDEDD\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A]/.test(
+  char
+);
+const hasPunctuationOrSpace = (char) => (
+  // Uses Unicode property escapes for Punctuation and general category for Space
+  /[\p{P}\p{Z}]/u.test(char)
+);
+const findStringOccurrences = (source, needles) => {
+  const ranges = [];
+  if (!Array.isArray(needles)) {
+    return ranges;
+  }
+  needles.forEach((needle) => {
+    if (typeof needle !== "string" || needle.length === 0) {
+      return;
+    }
+    let startIndex = 0;
+    let index;
+    while ((index = source.indexOf(needle, startIndex)) > -1) {
+      const end = index + needle.length - 1;
+      ranges.push([index, end]);
+      startIndex = index + 1;
+    }
+  });
+  if (ranges.length === 0) {
+    return [];
+  }
+  ranges.sort((a, b) => a[0] - b[0]);
+  const merged = [];
+  let currentRange;
+  for (const range of ranges) {
+    if (currentRange === void 0) {
+      currentRange = [...range];
+    } else if (range[0] <= currentRange[1] + 1) {
+      currentRange[1] = Math.max(currentRange[1], range[1]);
+    } else {
+      merged.push(currentRange);
+      currentRange = [...range];
+    }
+  }
+  if (currentRange !== void 0) {
+    merged.push(currentRange);
+  }
+  return merged;
+};
+
+export { escapeRegExp, findStringOccurrences, hasChinese, hasPunctuationOrSpace, inRange };

package/dist/word-similarity-sort.js

@@ -1 +1,22 @@
-var l=Object.defineProperty;var n=(e,r)=>l(e,"name",{value:r,configurable:!0});import{distance as m}from"./packem_shared/closest-uarbVSbs.js";var p=Object.defineProperty,u=n((e,r)=>p(e,"name",{value:r,configurable:!0}),"s");const f=u((e,r,s)=>{const{caseSensitive:i=!1,compareFunction:c=m}=s??{},d=i?e:e.toLowerCase(),t=r.map(o=>{const a=i?o:o.toLowerCase();return{distance:c(d,a),originalWord:o}});return t.sort((o,a)=>o.distance!==a.distance?o.distance-a.distance:o.originalWord.localeCompare(a.originalWord)),t.map(o=>o.originalWord)},"wordSimilaritySort");export{f as wordSimilaritySort};
+import { distance } from './packem_shared/closest-IHuSvnSn.js';
+
+const wordSimilaritySort = (givenWord, possibleWords, options) => {
+  const { caseSensitive = false, compareFunction = distance } = options ?? {};
+  const processedGivenWord = caseSensitive ? givenWord : givenWord.toLowerCase();
+  const wordsWithDistances = possibleWords.map((word) => {
+    const processedWord = caseSensitive ? word : word.toLowerCase();
+    return {
+      distance: compareFunction(processedGivenWord, processedWord),
+      originalWord: word
+    };
+  });
+  wordsWithDistances.sort((a, b) => {
+    if (a.distance !== b.distance) {
+      return a.distance - b.distance;
+    }
+    return a.originalWord.localeCompare(b.originalWord);
+  });
+  return wordsWithDistances.map((item) => item.originalWord);
+};
+
+export { wordSimilaritySort };