@ultraviolet/ui 3.0.0-beta.2 → 3.0.0-beta.21

package/dist/themes/dist/vanilla/themes.css.js.vanilla.css.cjs

@@ -1 +0,0 @@
-"use strict";

package/dist/themes/dist/vanilla/themes.css.js.vanilla.css.js

@@ -1 +0,0 @@
-

package/dist/themes/dist/vanilla/themes.css.ts.vanilla.css.js.vanilla.css.cjs

@@ -1 +0,0 @@
-"use strict";

package/dist/themes/dist/vanilla/themes.css.ts.vanilla.css.js.vanilla.css.js

@@ -1 +0,0 @@
-

package/dist/utils/capitalize.cjs

@@ -1,3 +0,0 @@
-"use strict";
-const capitalize = (value) => value.charAt(0).toUpperCase() + value.slice(1);
-module.exports = capitalize;

package/dist/utils/capitalize.js

@@ -1,4 +0,0 @@
-const capitalize = (value) => value.charAt(0).toUpperCase() + value.slice(1);
-export {
-  capitalize as default
-};

package/dist/utils/searchAlgorithm.cjs

@@ -1,40 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const normalizeString = (string) => string.normalize("NFD").replace(/[\u0300-\u036F]/g, "").replace(/-/g, " ").toLowerCase();
-const levenshteinDistance = (query, slice) => {
-  if (query.length === 0) {
-    return slice.length;
-  }
-  if (slice.length === 0) {
-    return query.length;
-  }
-  const distancesArray = [];
-  for (let i = 0; i <= slice.length; i += 1) {
-    distancesArray[i] = [i];
-    for (let j = 1; j <= query.length; j += 1) {
-      distancesArray[i][j] = i === 0 ? j : Math.min(distancesArray[i - 1][j] + 1, distancesArray[i][j - 1] + 1, distancesArray[i - 1][j - 1] + (query[j - 1] === slice[i - 1] ? 0 : 1));
-    }
-  }
-  return distancesArray[slice.length][query.length];
-};
-const isFuzzyMatch = (query, target, maxDistance = 1) => {
-  const normQuery = normalizeString(query);
-  const normTarget = normalizeString(target);
-  if (normQuery.length === 0) {
-    return true;
-  }
-  if (normQuery.length > normTarget.length) {
-    return false;
-  }
-  for (let i = 0; i <= normTarget.length - normQuery.length; i += 1) {
-    const slice = normTarget.slice(i, i + normQuery.length);
-    const dist = levenshteinDistance(normQuery, slice);
-    if (dist <= maxDistance) {
-      return true;
-    }
-  }
-  return false;
-};
-exports.isFuzzyMatch = isFuzzyMatch;
-exports.levenshteinDistance = levenshteinDistance;
-exports.normalizeString = normalizeString;

package/dist/utils/searchAlgorithm.d.ts

@@ -1,12 +0,0 @@
-export declare const normalizeString: (string: string) => string;
-export declare const levenshteinDistance: (query: string, slice: string) => number;
-/**
- * Return `true` if there is a fuzz match in a substring
- * By default, allow distance of 1 (which mean, 1 character difference for a match)
- * @example isFuzzyMatch("merr", "mercury") = true
- * isFuzzyMatch("cry", "mercury") = true
- * isFuzzyMatch("mrcury", "mercury") = true
- * isFuzzyMatch("mrecury", "mercury") = false
- * isFuzzyMatch("mrecury", "mercury", 2) = true
- */
-export declare const isFuzzyMatch: (query: string, target: string, maxDistance?: number) => boolean;

package/dist/utils/searchAlgorithm.js

@@ -1,40 +0,0 @@
-const normalizeString = (string) => string.normalize("NFD").replace(/[\u0300-\u036F]/g, "").replace(/-/g, " ").toLowerCase();
-const levenshteinDistance = (query, slice) => {
-  if (query.length === 0) {
-    return slice.length;
-  }
-  if (slice.length === 0) {
-    return query.length;
-  }
-  const distancesArray = [];
-  for (let i = 0; i <= slice.length; i += 1) {
-    distancesArray[i] = [i];
-    for (let j = 1; j <= query.length; j += 1) {
-      distancesArray[i][j] = i === 0 ? j : Math.min(distancesArray[i - 1][j] + 1, distancesArray[i][j - 1] + 1, distancesArray[i - 1][j - 1] + (query[j - 1] === slice[i - 1] ? 0 : 1));
-    }
-  }
-  return distancesArray[slice.length][query.length];
-};
-const isFuzzyMatch = (query, target, maxDistance = 1) => {
-  const normQuery = normalizeString(query);
-  const normTarget = normalizeString(target);
-  if (normQuery.length === 0) {
-    return true;
-  }
-  if (normQuery.length > normTarget.length) {
-    return false;
-  }
-  for (let i = 0; i <= normTarget.length - normQuery.length; i += 1) {
-    const slice = normTarget.slice(i, i + normQuery.length);
-    const dist = levenshteinDistance(normQuery, slice);
-    if (dist <= maxDistance) {
-      return true;
-    }
-  }
-  return false;
-};
-export {
-  isFuzzyMatch,
-  levenshteinDistance,
-  normalizeString
-};