@tempots/std 0.20.0 → 0.22.0

package/string.d.ts

@@ -4,15 +4,6 @@
  * Use by importing the desired utility from "@tempots/std" or directly from "@tempots/std/string".
  * @public
  */
-/**
- * Replaces all occurrances of `placeholder` in `subject` with the value `replacement`.
- * @param subject - The string to search in.
- * @param placeholder - The string to search for.
- * @param replacement - The string to replace `placeholder` with.
- * @returns The string with all occurrances of `placeholder` replaced by `replacement`.
- * @public
- */
-export declare const replaceAll: (subject: string, placeholder: string, replacement: string) => string;
 /**
  * `substringAfter` searches for the first occurrance of `searchFor` and returns the text after that.
  * If `searchFor` is not found, an empty string is returned.
@@ -87,16 +78,7 @@ export declare const canonicalizeNewlines: (value: string) => string;
  * @returns A negative number if `a` is less than `b`, zero if they are equal, or a positive number if `a` is greater than `b`.
  * @public
  */
-export declare const compareCaseInsensitive: (a: string, b: string) => number;
-/**
- * Checks if a string ends with a specified suffix.
- *
- * @param s - The string to check.
- * @param end - The suffix to check against.
- * @returns `true` if the string ends with the specified suffix, `false` otherwise.
- * @public
- */
-export declare const stringEndsWith: (s: string, end: string) => boolean;
+export declare const compareCaseInsensitive: (a: string | null | undefined, b: string | null | undefined) => number;
 /**
  * Checks if a string ends with another string in a case-insensitive manner.
  *
@@ -106,15 +88,6 @@ export declare const stringEndsWith: (s: string, end: string) => boolean;
  * @public
  */
 export declare const textEndsWithCaseInsensitive: (s: string, end: string) => boolean;
-/**
- * Checks if a string starts with a specified substring.
- *
- * @param s - The string to check.
- * @param start - The substring to check for at the beginning of the string.
- * @returns `true` if the string starts with the specified substring, `false` otherwise.
- * @public
- */
-export declare const stringStartsWith: (s: string, start: string) => boolean;
 /**
  * Checks if a string starts with another string in a case-insensitive manner.
  *
@@ -172,15 +145,6 @@ export declare const compareStrings: (a: string, b: string) => number;
  * @public
  */
 export declare const textContainsCaseInsensitive: (s: string, test: string) => boolean;
-/**
- * `textContains` returns `true` if `s` contains one or more occurrences of `test`.
- *
- * @param s - The string to search in.
- * @param test - The string to search for.
- * @returns `true` if `s` contains `test`, `false` otherwise.
- * @public
- */
-export declare const stringContains: (s: string, test: string) => boolean;
 /**
  * Return the number of occurrences of `test` in `s`.
  *
@@ -417,7 +381,7 @@ export declare const lowerCaseFirst: (value: string) => string;
  * @returns The random substring.
  * @public
  */
-export declare const randomString: (value: string, length?: number) => string;
+export declare const randomSubString: (value: string, length?: number) => string;
 /**
  * Returns a random sampling of the specified length from the seed string.
  *
@@ -490,20 +454,6 @@ export declare const deleteStringBefore: (value: string, toremove: string) => st
  * @public
  */
 export declare const deleteFirstFromString: (value: string, toremove: string) => string;
-/**
- * `repeatString` builds a new string by repeating the argument `s`, n `times`.
- *
- * @example
- * ```ts
- * repeatString('Xy', 3) // generates 'XyXyXy'
- * ```
- *
- * @param s - The string to repeat.
- * @param times - The number of times to repeat the string.
- * @returns The repeated string.
- * @public
- */
-export declare const repeatString: (s: string, times: number) => string;
 /**
  * Returns a new string whose characters are in reverse order.
  *
@@ -570,14 +520,6 @@ export declare const stringStartsWithAny: (s: string, values: string[]) => boole
  * @public
  */
 export declare const surroundString: (s: string, left: string, right?: string) => string;
-/**
- * It transforms a string into an `Array` of characters.
- *
- * @param s - The string to transform.
- * @returns An array of characters.
- * @public
- */
-export declare const stringToChars: (s: string) => string[];
 /**
  * It transforms a string into an `Array` of char codes in integer format.
  *

package/string.js

@@ -1,206 +1,199 @@
-import { anyElement as l, allElements as b, generateArray as S, createFilledArray as O } from "./array.js";
-import { MissingImplementationError as A } from "./error.js";
-import { mapRegExp as h } from "./regexp.js";
-const u = (t, n, e) => t.split(n).join(e), X = (t, n) => {
+import { MissingImplementationError as p } from "./error.js";
+import { mapRegExp as l } from "./regexp.js";
+const Z = (t, n) => {
   const e = t.indexOf(n);
   return e < 0 ? "" : t.substring(e + n.length);
-}, Y = (t, n) => {
+}, D = (t, n) => {
   const e = t.lastIndexOf(n);
   return e < 0 ? "" : t.substring(e + n.length);
-}, v = (t, n) => {
+}, P = (t, n) => {
   const e = t.indexOf(n);
   return e < 0 ? "" : t.substring(0, e);
-}, tt = (t, n) => {
+}, R = (t, n) => {
   const e = t.lastIndexOf(n);
   return e < 0 ? "" : t.substring(0, e);
-}, p = (t) => t.substring(0, 1).toUpperCase() + t.substring(1), d = (t) => t.toUpperCase(), nt = (t, n = !1) => n ? h(p(t), F, d) : h(p(t), D, d), et = (t) => t.replace(K, `
-`), rt = (t, n) => t == null && n == null ? 0 : t == null ? -1 : n == null ? 1 : W(t.toLowerCase(), n.toLowerCase()), L = (t, n) => t.substring(0, t.length - n.length) === n, st = (t, n) => t.substring(0, t.length - n.length).toLowerCase() === n.toLowerCase(), x = (t, n) => t.substring(0, n.length) === n, it = (t, n) => t.substring(0, n.length).toLowerCase() === n.toLowerCase(), ot = (t, n) => B(
+}, g = (t) => t.substring(0, 1).toUpperCase() + t.substring(1), f = (t) => t.toUpperCase(), F = (t, n = !1) => n ? l(g(t), _, f) : l(g(t), z, f), G = (t) => t.replace($, `
+`), Q = (t, n) => t == null && n == null ? 0 : t == null ? -1 : n == null ? 1 : b(t.toLowerCase(), n.toLowerCase()), K = (t, n) => t.substring(t.length - n.length).toLowerCase() === n.toLowerCase(), q = (t, n) => t.substring(0, n.length).toLowerCase() === n.toLowerCase(), J = (t, n) => S(
   t.toLowerCase(),
   n.map((e) => e.toLowerCase())
-), ct = (t, n) => M(
+), V = (t, n) => y(
   t.toLowerCase(),
   n.map((e) => e.toLowerCase())
-), ut = (t) => t.trim().replace(m, " "), W = (t, n) => t < n ? -1 : t > n ? 1 : 0, w = (t, n) => t.toLowerCase().includes(n.toLowerCase()), a = (t, n) => t.includes(n), gt = (t, n) => t.split(n).length - 1, lt = (t, n) => l(n, (e) => w(t, e)), at = (t, n) => l(n, (e) => a(t, e)), ft = (t, n) => b(n, (e) => w(t, e)), ht = (t, n) => b(n, (e) => a(t, e)), pt = (t) => t.replace("_", "-"), dt = (t, n) => {
+), X = (t) => t.trim().replace(d, " "), b = (t, n) => t < n ? -1 : t > n ? 1 : 0, h = (t, n) => t.toLowerCase().includes(n.toLowerCase()), Y = (t, n) => t.split(n).length - 1, v = (t, n) => n.some((e) => h(t, e)), tt = (t, n) => n.some((e) => t.includes(e)), nt = (t, n) => n.every((e) => h(t, e)), et = (t, n) => n.every((e) => t.includes(e)), rt = (t) => t.replace(/_/g, "-"), st = (t, n) => {
   if (t === n) return -1;
   const e = Math.min(t.length, n.length);
   for (let r = 0; r < e; r++)
     if (t.substring(r, r + 1) !== n.substring(r, r + 1)) return r;
   return e;
-}, y = (t, n = 20, e = "…") => {
+}, A = (t, n = 20, e = "…") => {
   const r = t.length, s = e.length;
   return r > n ? n < s ? e.slice(s - n, n) : t.slice(0, n - s) + e : t;
-}, Ct = (t, n = 20, e = "…") => {
+}, it = (t, n = 20, e = "…") => {
   const r = t.length, s = e.length;
   if (r > n) {
     if (n <= s)
-      return y(t, n, e);
-    const c = Math.ceil((n - s) / 2), g = Math.floor((n - s) / 2);
-    return t.slice(0, c) + e + t.slice(r - g);
+      return A(t, n, e);
+    const c = Math.ceil((n - s) / 2), u = Math.floor((n - s) / 2);
+    return t.slice(0, c) + e + t.slice(r - u);
   } else return t;
-}, B = (t, n) => l(n, (e) => L(t, e)), bt = (t, n) => f(t).filter(n).join(""), St = (t, n) => _(t).filter(n).map((r) => String.fromCharCode(r)).join(""), At = (t, n = 2166136261) => {
+}, S = (t, n) => n.some((e) => t.endsWith(e)), ot = (t, n) => Array.from(t).filter(n).join(""), ct = (t, n) => x(t).filter(n).map((r) => String.fromCharCode(r)).join(""), ut = (t, n = 2166136261) => {
   let e = n;
   for (let r = 0, s = t.length; r < s; r++)
     e ^= t.charCodeAt(r), e += (e << 1) + (e << 4) + (e << 7) + (e << 8) + (e << 24);
   return e >>> 0;
-}, Lt = (t) => t != null && t.length > 0, wt = (t) => u(k(t), "_", " "), It = (t) => t.length > 0 && !R.test(t), mt = (t) => G.test(t), Et = (t) => !P.test(t), Ot = (t) => t.toLowerCase() === t, xt = (t) => t.toUpperCase() === t, Wt = (t, n) => t != null && t !== "" ? t : n, yt = (t) => Q.test(t), Bt = (t) => t == null || t === "", zt = (t) => t.substring(0, 1).toLowerCase() + t.substring(1), z = (t, n = 1) => t.substring(
-  Math.floor((t.length - n + 1) * Math.random()),
-  n
-), T = (t, n) => S(n, () => z(t)).join(""), Tt = (t) => T(Z, t), jt = (t, n) => f(n).map(t), Nt = (t, n) => u(t, n, ""), Mt = (t, n) => L(t, n) ? t.substring(0, t.length - n.length) : t, _t = (t, n, e) => t.substring(0, n) + t.substring(n + e), Ut = (t, n) => x(t, n) ? t.substring(n.length) : t, $t = (t, n) => {
+}, lt = (t) => t != null && t.length > 0, gt = (t) => E(t).split("_").join(" "), ft = (t) => t.length > 0 && !N.test(t), at = (t) => M.test(t), pt = (t) => !T.test(t), ht = (t) => t.toLowerCase() === t, dt = (t) => t.toUpperCase() === t, Ct = (t, n) => t != null && t !== "" ? t : n, bt = (t) => U.test(t), At = (t) => t == null || t === "", St = (t) => t.substring(0, 1).toLowerCase() + t.substring(1), L = (t, n = 1) => {
+  const e = Math.floor((t.length - n + 1) * Math.random());
+  return t.substring(e, e + n);
+}, m = (t, n) => Array.from({ length: n }, () => L(t)).join(""), Lt = (t) => m(j, t), mt = (t, n) => Array.from(n).map(t), wt = (t, n) => t.split(n).join(""), It = (t, n) => t.endsWith(n) ? t.substring(0, t.length - n.length) : t, yt = (t, n, e) => t.substring(0, n) + t.substring(n + e), xt = (t, n) => t.startsWith(n) ? t.substring(n.length) : t, Ot = (t, n) => {
   const e = t.indexOf(n);
   return e < 0 ? t : t.substring(0, e) + t.substring(e + n.length);
-}, I = (t, n) => O(n, t).join(""), kt = (t) => {
-  const n = f(t);
+}, Wt = (t) => {
+  const n = Array.from(t);
   return n.reverse(), n.join("");
-}, j = (t, n = "'") => n === "'" ? t.includes("'") ? t.includes('"') ? "'" + u(t, "'", "\\'") + "'" : '"' + t + '"' : "'" + t + "'" : t.includes('"') ? t.includes("'") ? '"' + u(t, '"', '\\"') + '"' : "'" + t + "'" : '"' + t + '"', N = (t, n = "'") => n + u(t, n, "\\" + n) + n, Ht = (t, n = "'") => t.indexOf(`
-`) >= 0 ? N(t, "`") : j(t, n), Zt = (t, n) => {
+}, w = (t, n = "'") => n === "'" ? t.includes("'") ? t.includes('"') ? "'" + t.split("'").join("\\'") + "'" : '"' + t + '"' : "'" + t + "'" : t.includes('"') ? t.includes("'") ? '"' + t.split('"').join('\\"') + '"' : "'" + t + "'" : '"' + t + '"', I = (t, n = "'") => n + t.split(n).join("\\" + n) + n, Et = (t, n = "'") => t.indexOf(`
+`) >= 0 ? I(t, "`") : w(t, n), Bt = (t, n) => {
   const e = t.indexOf(n);
   return e < 0 ? [t] : [t.substring(0, e), t.substring(e + n.length)];
-}, M = (t, n) => l(n, (e) => t.startsWith(e)), Dt = (t, n, e = n) => `${n}${t}${e}`, f = (t) => t.split(""), _ = (t) => S(t.length, (n) => t.charCodeAt(n)), Pt = (t, n) => {
+}, y = (t, n) => n.some((e) => t.startsWith(e)), jt = (t, n, e = n) => `${n}${t}${e}`, x = (t) => Array.from({ length: t.length }, (n, e) => t.charCodeAt(e)), zt = (t, n) => {
   const e = [];
   for (; t.length > 0; )
     e.push(t.substring(0, n)), t = t.substring(n, t.length - n);
   return e;
-}, Rt = (t) => t.split(E), Ft = (t, n) => $(U(t, n), n), U = (t, n) => {
+}, Tt = (t) => t.split(C), Nt = (t, n) => W(O(t, n), n), O = (t, n) => {
   let e = 0;
-  for (let r = 0; r < t.length && a(n, t.charAt(r)); r++)
+  for (let r = 0; r < t.length && n.includes(t.charAt(r)); r++)
     e++;
   return t.substring(e);
-}, $ = (t, n) => {
+}, W = (t, n) => {
   const e = t.length;
   let r = e, s;
-  for (let c = 0; c < e && (s = e - c - 1, a(n, t.charAt(s))); c++)
+  for (let c = 0; c < e && (s = e - c - 1, n.includes(t.charAt(s))); c++)
     r = s;
   return t.substring(0, r);
-}, k = (t) => (t = t.replace(/::/g, "/"), t = t.replace(/([A-Z]+)([A-Z][a-z])/g, "$1_$2"), t = t.replace(/([a-z\d])([A-Z])/g, "$1_$2"), t = t.replace(/-/g, "_"), t.toLowerCase()), Gt = (t) => t.substring(0, 1).toUpperCase() + t.substring(1), Qt = (t, n = 78, e = "", r = `
-`) => t.split(E).map(
-  (s) => H(s.replace(m, " ").trim(), n, e, r)
-).join(r), C = (t, n) => {
+}, E = (t) => (t = t.replace(/::/g, "/"), t = t.replace(/([A-Z]+)([A-Z][a-z])/g, "$1_$2"), t = t.replace(/([a-z\d])([A-Z])/g, "$1_$2"), t = t.replace(/-/g, "_"), t.toLowerCase()), _t = (t) => t.substring(0, 1).toUpperCase() + t.substring(1), Mt = (t, n = 78, e = "", r = `
+`) => t.split(C).map(
+  (s) => B(s.replace(d, " ").trim(), n, e, r)
+).join(r), a = (t, n) => {
   if (n < 0 || n >= t.length) return !1;
   const e = t.charCodeAt(n);
   return e === 9 || e === 10 || e === 11 || e === 12 || e === 13 || e === 32;
-}, Kt = (t) => {
+}, Ut = (t) => {
   if (typeof Buffer < "u")
     return Buffer.from(t).toString("base64");
   if (typeof btoa < "u")
     return btoa(t);
-  throw new A(
+  throw new p(
     "No implementation found for base64 encoding"
   );
-}, qt = (t) => {
+}, $t = (t) => {
   if (typeof Buffer < "u")
     return Buffer.from(t, "base64").toString("utf8");
   if (typeof atob < "u")
     return atob(t);
-  throw new A(
+  throw new p(
     "No implementation found for base64 decoding"
   );
-}, H = (t, n, e, r) => {
-  const s = [], c = t.length, g = e.length;
+}, B = (t, n, e, r) => {
+  const s = [], c = t.length, u = e.length;
   let o = 0;
-  for (n -= g; ; ) {
-    if (o + n >= c - g) {
+  for (n -= u; ; ) {
+    if (o + n >= c - u) {
       s.push(t.substring(o));
       break;
     }
     let i = 0;
-    for (; !C(t, o + n - i) && i < n; ) i++;
+    for (; !a(t, o + n - i) && i < n; ) i++;
     if (i === n) {
-      for (i = 0; !C(t, o + n + i) && o + n + i < c; ) i++;
+      for (i = 0; !a(t, o + n + i) && o + n + i < c; ) i++;
       s.push(t.substring(o, o + n + i)), o += n + i + 1;
     } else
       s.push(t.substring(o, o + n - i)), o += n - i + 1;
   }
   return e + s.join(r + e);
-}, Jt = (t, n, e) => {
+}, kt = (t, n, e) => {
   const r = e - t.length;
-  return r > 0 ? I(n, r) + t : t;
-}, Vt = (t, n, e) => {
+  return r > 0 ? n.repeat(r) + t : t;
+}, Ht = (t, n, e) => {
   const r = e - t.length;
-  return r > 0 ? t + I(n, r) : t;
-}, Xt = (t, n) => {
+  return r > 0 ? t + n.repeat(r) : t;
+}, Zt = (t, n) => {
   const e = t.lastIndexOf(n);
   return e >= 0 ? [t.substring(0, e), t.substring(e + n.length)] : [t];
-}, Yt = (t, n) => {
+}, Dt = (t, n) => {
   const e = t.indexOf(n);
   return e >= 0 ? [t.substring(0, e), t.substring(e + n.length)] : [t];
-}, Z = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", D = /[^a-zA-Z]([a-z])/g, P = /[^\t\n\r ]/, R = /[^a-zA-Z]/, F = /[ \t\r\n][a-z]/g, G = /^[a-z0-9]+$/i, Q = /^[0-9]+$/, m = /[ \t\r\n]+/g, E = /\r\n|\n\r|\n|\r/g, K = /\r\n|\n\r|\r/g;
+}, j = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", z = /[^a-zA-Z]([a-z])/g, T = /[^\t\n\r ]/, N = /[^a-zA-Z]/, _ = /[ \t\r\n][a-z]/g, M = /^[a-z0-9]+$/i, U = /^[0-9]+$/, d = /[ \t\r\n]+/g, C = /\r\n|\n\r|\n|\r/g, $ = /\r\n|\n\r|\r/g;
 export {
-  et as canonicalizeNewlines,
-  p as capitalize,
-  nt as capitalizeWords,
-  Pt as chunkString,
-  ut as collapseText,
-  rt as compareCaseInsensitive,
-  W as compareStrings,
-  ht as containsAllText,
-  ft as containsAllTextCaseInsensitive,
-  at as containsAnyText,
-  lt as containsAnyTextCaseInsensitive,
-  gt as countStringOccurrences,
-  pt as dasherize,
-  qt as decodeBase64,
-  $t as deleteFirstFromString,
-  Mt as deleteStringAfter,
-  Ut as deleteStringBefore,
-  Nt as deleteSubstring,
-  y as ellipsis,
-  Ct as ellipsisMiddle,
-  Kt as encodeBase64,
-  St as filterCharcodes,
-  bt as filterChars,
-  wt as humanize,
-  Wt as ifEmptyString,
-  It as isAlpha,
-  mt as isAlphaNum,
-  Et as isBreakingWhitespace,
-  yt as isDigitsOnly,
-  Bt as isEmptyString,
-  Ot as isLowerCase,
-  C as isSpaceAt,
-  xt as isUpperCase,
-  Ht as jsQuote,
-  zt as lowerCaseFirst,
-  Jt as lpad,
-  jt as mapChars,
-  N as quote,
-  z as randomString,
-  T as randomStringSequence,
-  Tt as randomStringSequenceBase64,
-  I as repeatString,
-  u as replaceAll,
-  kt as reverseString,
-  Vt as rpad,
-  j as smartQuote,
-  Yt as splitStringOnFirst,
-  Xt as splitStringOnLast,
-  Zt as splitStringOnce,
-  a as stringContains,
-  L as stringEndsWith,
-  B as stringEndsWithAny,
-  Lt as stringHasContent,
-  At as stringHashCode,
-  x as stringStartsWith,
-  M as stringStartsWithAny,
-  _ as stringToCharcodes,
-  f as stringToChars,
-  dt as stringsDifferAtIndex,
-  X as substringAfter,
-  Y as substringAfterLast,
-  v as substringBefore,
-  tt as substringBeforeLast,
-  Dt as surroundString,
-  w as textContainsCaseInsensitive,
-  ot as textEndsWithAnyCaseInsensitive,
-  st as textEndsWithCaseInsensitive,
-  ct as textStartsWithAnyCaseInsensitive,
-  it as textStartsWithCaseInsensitive,
-  Rt as textToLines,
-  Ft as trimChars,
-  U as trimCharsLeft,
-  $ as trimCharsRight,
-  _t as trimStringSlice,
-  k as underscore,
-  Gt as upperCaseFirst,
-  Qt as wrapColumns,
-  H as wrapLine
+  G as canonicalizeNewlines,
+  g as capitalize,
+  F as capitalizeWords,
+  zt as chunkString,
+  X as collapseText,
+  Q as compareCaseInsensitive,
+  b as compareStrings,
+  et as containsAllText,
+  nt as containsAllTextCaseInsensitive,
+  tt as containsAnyText,
+  v as containsAnyTextCaseInsensitive,
+  Y as countStringOccurrences,
+  rt as dasherize,
+  $t as decodeBase64,
+  Ot as deleteFirstFromString,
+  It as deleteStringAfter,
+  xt as deleteStringBefore,
+  wt as deleteSubstring,
+  A as ellipsis,
+  it as ellipsisMiddle,
+  Ut as encodeBase64,
+  ct as filterCharcodes,
+  ot as filterChars,
+  gt as humanize,
+  Ct as ifEmptyString,
+  ft as isAlpha,
+  at as isAlphaNum,
+  pt as isBreakingWhitespace,
+  bt as isDigitsOnly,
+  At as isEmptyString,
+  ht as isLowerCase,
+  a as isSpaceAt,
+  dt as isUpperCase,
+  Et as jsQuote,
+  St as lowerCaseFirst,
+  kt as lpad,
+  mt as mapChars,
+  I as quote,
+  m as randomStringSequence,
+  Lt as randomStringSequenceBase64,
+  L as randomSubString,
+  Wt as reverseString,
+  Ht as rpad,
+  w as smartQuote,
+  Dt as splitStringOnFirst,
+  Zt as splitStringOnLast,
+  Bt as splitStringOnce,
+  S as stringEndsWithAny,
+  lt as stringHasContent,
+  ut as stringHashCode,
+  y as stringStartsWithAny,
+  x as stringToCharcodes,
+  st as stringsDifferAtIndex,
+  Z as substringAfter,
+  D as substringAfterLast,
+  P as substringBefore,
+  R as substringBeforeLast,
+  jt as surroundString,
+  h as textContainsCaseInsensitive,
+  J as textEndsWithAnyCaseInsensitive,
+  K as textEndsWithCaseInsensitive,
+  V as textStartsWithAnyCaseInsensitive,
+  q as textStartsWithCaseInsensitive,
+  Tt as textToLines,
+  Nt as trimChars,
+  O as trimCharsLeft,
+  W as trimCharsRight,
+  yt as trimStringSlice,
+  E as underscore,
+  _t as upperCaseFirst,
+  Mt as wrapColumns,
+  B as wrapLine
 };

package/url.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=t=>{try{return new URL(t)}catch{return null}},u=(t,e)=>{if(!e||Object.keys(e).length===0)return t;const n=new URL(t);for(const[r,s]of Object.entries(e))n.searchParams.set(r,s);return n.toString()},g=t=>{try{const e=new URL(t),n={};for(const[r,s]of e.searchParams)n[r]=s;return n}catch{return{}}},h=(t,e,n)=>{try{const r=new URL(t);return r.searchParams.set(e,n),r.toString()}catch{return t}},f=(t,e)=>{try{const n=new URL(t);return n.searchParams.delete(e),n.toString()}catch{return t}},m=t=>{try{return new URL(t),!0}catch{return!1}},P=(...t)=>{if(t.length===0)return"";const e=t.filter(a=>a.length>0);if(e.length===0)return"";const n=e[0].startsWith("/"),r=e[e.length-1].endsWith("/"),o=e.map(a=>a.replace(/^\/+|\/+$/g,"")).filter(a=>a.length>0).join("/");return(n?"/":"")+o+(r?"/":"")},y=t=>{if(!t)return"";const e=t.startsWith("/"),n=t.split("/").filter(o=>o.length>0),r=[];for(const o of n)o!=="."&&(o===".."?r.length>0&&r[r.length-1]!==".."?r.pop():e||r.push(".."):r.push(o));const s=r.join("/");return e?"/"+s:s},c=t=>{const e=l(t),n=e.lastIndexOf(".");return n===-1||n===0?"":e.substring(n)},l=t=>{if(!t||t.match(/\/+$/))return"";const e=t.lastIndexOf("/");return e===-1?t:t.substring(e+1)},d=t=>{const e=l(t),n=c(t);return n?e.substring(0,e.length-n.length):e};exports.buildUrl=u;exports.getBaseName=d;exports.getFileExtension=c;exports.getFileName=l;exports.getQueryParams=g;exports.isValidUrl=m;exports.joinPaths=P;exports.normalizePath=y;exports.parseUrl=i;exports.removeQueryParam=f;exports.setQueryParam=h;