@tempots/std 0.19.0 → 0.21.0

package/random.d.ts

@@ -0,0 +1,200 @@
+/**
+ * Utilities for generating random values.
+ *
+ * This module provides enhanced random number generation, choice selection,
+ * and other randomization utilities that go beyond Math.random().
+ * All functions use Math.random() as the underlying source of randomness.
+ *
+ * @public
+ */
+/**
+ * Generates a random integer between min and max (inclusive).
+ *
+ * This function provides a more convenient API than manually scaling Math.random()
+ * and handles the common case of generating integers within a specific range.
+ *
+ * @example
+ * ```typescript
+ * const dice = randomInt(1, 6) // 1, 2, 3, 4, 5, or 6
+ * const index = randomInt(0, array.length - 1) // Valid array index
+ * ```
+ *
+ * @param min - The minimum value (inclusive)
+ * @param max - The maximum value (inclusive)
+ * @returns A random integer between min and max
+ * @public
+ */
+export declare const randomInt: (min: number, max: number) => number;
+/**
+ * Generates a random floating-point number between min and max.
+ *
+ * This function provides a convenient way to generate random floats
+ * within a specific range, with optional exclusion of the maximum value.
+ *
+ * @example
+ * ```typescript
+ * const temperature = randomFloat(-10.0, 35.0) // Random temperature
+ * const percentage = randomFloat(0, 100) // Random percentage
+ * ```
+ *
+ * @param min - The minimum value (inclusive)
+ * @param max - The maximum value (exclusive by default)
+ * @param inclusive - Whether to include the maximum value (default: false)
+ * @returns A random float between min and max
+ * @public
+ */
+export declare const randomFloat: (min: number, max: number, inclusive?: boolean) => number;
+/**
+ * Selects a random element from an array.
+ *
+ * This function provides a convenient way to pick a random item
+ * from an array, handling the index calculation automatically.
+ *
+ * @example
+ * ```typescript
+ * const colors = ['red', 'green', 'blue', 'yellow']
+ * const randomColor = randomChoice(colors) // One of the colors
+ *
+ * const users = [{ name: 'Alice' }, { name: 'Bob' }]
+ * const randomUser = randomChoice(users) // One of the users
+ * ```
+ *
+ * @param array - The array to choose from
+ * @returns A random element from the array
+ * @throws Error if the array is empty
+ * @public
+ */
+export declare const randomChoice: <T>(array: readonly T[]) => T;
+/**
+ * Selects multiple random elements from an array without replacement.
+ *
+ * This function picks a specified number of unique elements from an array.
+ * The order of selected elements is randomized.
+ *
+ * @example
+ * ```typescript
+ * const numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+ * const sample = randomChoices(numbers, 3) // e.g., [7, 2, 9]
+ *
+ * const team = randomChoices(allPlayers, 5) // Pick 5 random players
+ * ```
+ *
+ * @param array - The array to choose from
+ * @param count - The number of elements to select
+ * @returns An array of randomly selected elements
+ * @throws Error if count is greater than array length or if array is empty
+ * @public
+ */
+export declare const randomChoices: <T>(array: readonly T[], count: number) => T[];
+/**
+ * Generates a random UUID v4 string.
+ *
+ * This function creates a UUID (Universally Unique Identifier) using
+ * random numbers. While not cryptographically secure, it's suitable
+ * for most application needs.
+ *
+ * @example
+ * ```typescript
+ * const id = randomUuid() // e.g., "f47ac10b-58cc-4372-a567-0e02b2c3d479"
+ * const sessionId = randomUuid()
+ * ```
+ *
+ * @returns A random UUID v4 string
+ * @public
+ */
+export declare const randomUuid: () => string;
+/**
+ * Generates a random hexadecimal string of specified length.
+ *
+ * This function creates a random string using hexadecimal characters (0-9, a-f).
+ * Useful for generating tokens, IDs, or other random identifiers.
+ *
+ * @example
+ * ```typescript
+ * const token = randomHex(16) // e.g., "a1b2c3d4e5f67890"
+ * const color = '#' + randomHex(6) // Random hex color
+ * ```
+ *
+ * @param length - The length of the hex string to generate
+ * @returns A random hexadecimal string
+ * @public
+ */
+export declare const randomHex: (length: number) => string;
+/**
+ * Generates random bytes as a Uint8Array.
+ *
+ * This function creates an array of random bytes, useful for
+ * cryptographic operations or when you need raw random data.
+ *
+ * @example
+ * ```typescript
+ * const key = randomBytes(32) // 32 random bytes
+ * const salt = randomBytes(16) // 16 random bytes for salt
+ * ```
+ *
+ * @param length - The number of bytes to generate
+ * @returns A Uint8Array containing random bytes
+ * @public
+ */
+export declare const randomBytes: (length: number) => Uint8Array;
+/**
+ * Creates a seeded random number generator.
+ *
+ * This function returns a deterministic random number generator
+ * that produces the same sequence of numbers for the same seed.
+ * Useful for testing or when reproducible randomness is needed.
+ *
+ * @example
+ * ```typescript
+ * const rng = seedRandom('my-seed')
+ * const num1 = rng() // Always the same for this seed
+ * const num2 = rng() // Next number in sequence
+ *
+ * // Create another generator with same seed
+ * const rng2 = seedRandom('my-seed')
+ * const same1 = rng2() // Same as num1
+ * ```
+ *
+ * @param seed - The seed string for the random number generator
+ * @returns A function that generates seeded random numbers between 0 and 1
+ * @public
+ */
+export declare const seedRandom: (seed: string) => (() => number);
+/**
+ * Shuffles an array in place using the Fisher-Yates algorithm.
+ *
+ * This function randomly reorders the elements of an array,
+ * modifying the original array. Each permutation is equally likely.
+ *
+ * @example
+ * ```typescript
+ * const deck = ['A', 'K', 'Q', 'J', '10', '9', '8', '7']
+ * shuffle(deck) // deck is now randomly ordered
+ *
+ * const playlist = [...songs]
+ * shuffle(playlist) // Randomize playlist order
+ * ```
+ *
+ * @param array - The array to shuffle (modified in place)
+ * @returns The same array reference (for chaining)
+ * @public
+ */
+export declare const shuffle: <T>(array: T[]) => T[];
+/**
+ * Returns a shuffled copy of an array without modifying the original.
+ *
+ * This function creates a new array with the same elements as the input
+ * but in random order, leaving the original array unchanged.
+ *
+ * @example
+ * ```typescript
+ * const original = [1, 2, 3, 4, 5]
+ * const shuffled = shuffled(original) // e.g., [3, 1, 5, 2, 4]
+ * // original is still [1, 2, 3, 4, 5]
+ * ```
+ *
+ * @param array - The array to shuffle
+ * @returns A new shuffled array
+ * @public
+ */
+export declare const shuffled: <T>(array: readonly T[]) => T[];

package/random.js

@@ -0,0 +1,72 @@
+const s = (t, r) => {
+  if (t > r)
+    throw new Error("min must be less than or equal to max");
+  return Math.floor(Math.random() * (r - t + 1)) + t;
+}, c = (t, r, n = !1) => {
+  if (t > r)
+    throw new Error("min must be less than or equal to max");
+  const e = Math.random(), o = r - t;
+  return e * o + t;
+}, h = (t) => {
+  if (t.length === 0)
+    throw new Error("Cannot choose from empty array");
+  const r = s(0, t.length - 1);
+  return t[r];
+}, l = (t, r) => {
+  if (t.length === 0)
+    throw new Error("Cannot choose from empty array");
+  if (r > t.length)
+    throw new Error("Cannot select more elements than available in array");
+  if (r <= 0)
+    return [];
+  const n = [...t];
+  for (let e = n.length - 1; e > 0; e--) {
+    const o = s(0, e);
+    [n[e], n[o]] = [n[o], n[e]];
+  }
+  return n.slice(0, r);
+}, a = () => "xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx".replace(/[xy]/g, (t) => {
+  const r = Math.random() * 16 | 0;
+  return (t === "x" ? r : r & 3 | 8).toString(16);
+}), f = (t) => {
+  if (t <= 0)
+    return "";
+  const r = "0123456789abcdef";
+  let n = "";
+  for (let e = 0; e < t; e++)
+    n += r[s(0, r.length - 1)];
+  return n;
+}, u = (t) => {
+  if (t <= 0)
+    return new Uint8Array(0);
+  const r = new Uint8Array(t);
+  for (let n = 0; n < t; n++)
+    r[n] = s(0, 255);
+  return r;
+}, i = (t) => {
+  let r = 0;
+  for (let e = 0; e < t.length; e++) {
+    const o = t.charCodeAt(e);
+    r = (r << 5) - r + o, r = r & r;
+  }
+  let n = Math.abs(r);
+  return () => (n = (n * 1664525 + 1013904223) % 4294967296, n / 4294967296);
+}, x = (t) => {
+  for (let r = t.length - 1; r > 0; r--) {
+    const n = s(0, r);
+    [t[r], t[n]] = [t[n], t[r]];
+  }
+  return t;
+}, d = (t) => x([...t]);
+export {
+  u as randomBytes,
+  h as randomChoice,
+  l as randomChoices,
+  c as randomFloat,
+  f as randomHex,
+  s as randomInt,
+  a as randomUuid,
+  i as seedRandom,
+  x as shuffle,
+  d as shuffled
+};

package/set.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=(...t)=>{const r=new Set;for(const e of t)for(const s of e)r.add(s);return r},c=(t,r)=>{const e=new Set;for(const s of t)r.has(s)&&e.add(s);return e},f=(t,r)=>{const e=new Set;for(const s of t)r.has(s)||e.add(s);return e},i=(t,r)=>{const e=new Set;for(const s of t)r.has(s)||e.add(s);for(const s of r)t.has(s)||e.add(s);return e},o=(t,r)=>{for(const e of t)if(!r.has(e))return!1;return!0},a=(t,r)=>o(r,t),u=(t,r)=>{const e=new Set;for(const s of t)r(s)&&e.add(s);return e},m=(t,r)=>{const e=new Set;for(const s of t)e.add(r(s));return e},d=t=>t.size===0,S=t=>Array.from(t),l=t=>new Set(t);exports.setDifference=f;exports.setFilter=u;exports.setFromArray=l;exports.setIntersection=c;exports.setIsEmpty=d;exports.setIsSubset=o;exports.setIsSuperset=a;exports.setMap=m;exports.setSymmetricDifference=i;exports.setToArray=S;exports.setUnion=n;

package/set.d.ts

@@ -0,0 +1,227 @@
+/**
+ * Utilities for working with Set objects.
+ *
+ * This module provides mathematical set operations and functional utilities
+ * for Set manipulation, including union, intersection, difference, and
+ * various predicates and transformations.
+ *
+ * @public
+ */
+/**
+ * Creates the union of multiple Sets.
+ *
+ * The union contains all unique elements that appear in any of the input Sets.
+ * This is equivalent to the mathematical union operation (A ∪ B ∪ C...).
+ *
+ * @example
+ * ```typescript
+ * const setA = new Set([1, 2, 3])
+ * const setB = new Set([3, 4, 5])
+ * const setC = new Set([5, 6, 7])
+ * const union = setUnion(setA, setB, setC)
+ * // Result: Set { 1, 2, 3, 4, 5, 6, 7 }
+ * ```
+ *
+ * @param sets - Sets to union
+ * @returns A new Set containing all unique elements from input Sets
+ * @public
+ */
+export declare const setUnion: <T>(...sets: Set<T>[]) => Set<T>;
+/**
+ * Creates the intersection of two Sets.
+ *
+ * The intersection contains only elements that appear in both Sets.
+ * This is equivalent to the mathematical intersection operation (A ∩ B).
+ *
+ * @example
+ * ```typescript
+ * const setA = new Set([1, 2, 3, 4])
+ * const setB = new Set([3, 4, 5, 6])
+ * const intersection = setIntersection(setA, setB)
+ * // Result: Set { 3, 4 }
+ * ```
+ *
+ * @param setA - First Set
+ * @param setB - Second Set
+ * @returns A new Set containing elements present in both input Sets
+ * @public
+ */
+export declare const setIntersection: <T>(setA: Set<T>, setB: Set<T>) => Set<T>;
+/**
+ * Creates the difference between two Sets.
+ *
+ * The difference contains elements that are in the first Set but not in the second.
+ * This is equivalent to the mathematical difference operation (A - B).
+ *
+ * @example
+ * ```typescript
+ * const setA = new Set([1, 2, 3, 4])
+ * const setB = new Set([3, 4, 5, 6])
+ * const difference = setDifference(setA, setB)
+ * // Result: Set { 1, 2 }
+ * ```
+ *
+ * @param setA - Set to subtract from
+ * @param setB - Set to subtract
+ * @returns A new Set containing elements in setA but not in setB
+ * @public
+ */
+export declare const setDifference: <T>(setA: Set<T>, setB: Set<T>) => Set<T>;
+/**
+ * Creates the symmetric difference between two Sets.
+ *
+ * The symmetric difference contains elements that are in either Set but not in both.
+ * This is equivalent to (A - B) ∪ (B - A) or (A ∪ B) - (A ∩ B).
+ *
+ * @example
+ * ```typescript
+ * const setA = new Set([1, 2, 3, 4])
+ * const setB = new Set([3, 4, 5, 6])
+ * const symDiff = setSymmetricDifference(setA, setB)
+ * // Result: Set { 1, 2, 5, 6 }
+ * ```
+ *
+ * @param setA - First Set
+ * @param setB - Second Set
+ * @returns A new Set containing elements in either Set but not both
+ * @public
+ */
+export declare const setSymmetricDifference: <T>(setA: Set<T>, setB: Set<T>) => Set<T>;
+/**
+ * Checks if one Set is a subset of another.
+ *
+ * A Set is a subset if all of its elements are contained in the other Set.
+ * An empty Set is considered a subset of any Set.
+ *
+ * @example
+ * ```typescript
+ * const subset = new Set([1, 2])
+ * const superset = new Set([1, 2, 3, 4])
+ * const notSubset = new Set([1, 5])
+ *
+ * setIsSubset(subset, superset) // true
+ * setIsSubset(notSubset, superset) // false
+ * setIsSubset(new Set(), superset) // true (empty set)
+ * ```
+ *
+ * @param subset - Set to check if it's a subset
+ * @param superset - Set to check against
+ * @returns true if subset is a subset of superset, false otherwise
+ * @public
+ */
+export declare const setIsSubset: <T>(subset: Set<T>, superset: Set<T>) => boolean;
+/**
+ * Checks if one Set is a superset of another.
+ *
+ * A Set is a superset if it contains all elements of the other Set.
+ * This is the inverse of the subset relationship.
+ *
+ * @example
+ * ```typescript
+ * const superset = new Set([1, 2, 3, 4])
+ * const subset = new Set([1, 2])
+ * const notSubset = new Set([1, 5])
+ *
+ * setIsSuperset(superset, subset) // true
+ * setIsSuperset(superset, notSubset) // false
+ * ```
+ *
+ * @param superset - Set to check if it's a superset
+ * @param subset - Set to check against
+ * @returns true if superset is a superset of subset, false otherwise
+ * @public
+ */
+export declare const setIsSuperset: <T>(superset: Set<T>, subset: Set<T>) => boolean;
+/**
+ * Creates a new Set containing only elements that satisfy the predicate.
+ *
+ * This provides a functional approach to filtering Sets, similar to
+ * Array.prototype.filter but for Set objects.
+ *
+ * @example
+ * ```typescript
+ * const numbers = new Set([1, 2, 3, 4, 5, 6])
+ * const evenNumbers = setFilter(numbers, n => n % 2 === 0)
+ * // Result: Set { 2, 4, 6 }
+ * ```
+ *
+ * @param set - The Set to filter
+ * @param predicate - Function that tests each element
+ * @returns A new Set with elements that satisfy the predicate
+ * @public
+ */
+export declare const setFilter: <T>(set: Set<T>, predicate: (value: T) => boolean) => Set<T>;
+/**
+ * Creates a new Set with elements transformed by the mapper function.
+ *
+ * This provides a functional approach to transforming Set elements,
+ * similar to Array.prototype.map but for Set objects.
+ *
+ * @example
+ * ```typescript
+ * const numbers = new Set([1, 2, 3])
+ * const doubled = setMap(numbers, n => n * 2)
+ * // Result: Set { 2, 4, 6 }
+ * ```
+ *
+ * @param set - The Set to transform
+ * @param mapper - Function that transforms each element
+ * @returns A new Set with transformed elements
+ * @public
+ */
+export declare const setMap: <T, U>(set: Set<T>, mapper: (value: T) => U) => Set<U>;
+/**
+ * Checks if a Set is empty.
+ *
+ * This provides a semantic way to check for empty Sets,
+ * making code more readable than checking size === 0.
+ *
+ * @example
+ * ```typescript
+ * const emptySet = new Set()
+ * const nonEmptySet = new Set([1, 2, 3])
+ *
+ * setIsEmpty(emptySet) // true
+ * setIsEmpty(nonEmptySet) // false
+ * ```
+ *
+ * @param set - The Set to check
+ * @returns true if the Set has no elements, false otherwise
+ * @public
+ */
+export declare const setIsEmpty: <T>(set: Set<T>) => boolean;
+/**
+ * Converts a Set to an array.
+ *
+ * This provides a convenient way to convert Sets to arrays
+ * for further processing with array methods.
+ *
+ * @example
+ * ```typescript
+ * const set = new Set([3, 1, 4, 1, 5]) // Note: duplicates are removed
+ * const array = setToArray(set)
+ * // Result: [3, 1, 4, 5]
+ * ```
+ *
+ * @param set - The Set to convert
+ * @returns An array containing all elements from the Set
+ * @public
+ */
+export declare const setToArray: <T>(set: Set<T>) => T[];
+/**
+ * Creates a Set from an array, removing duplicates.
+ *
+ * This provides a semantic way to deduplicate arrays using Sets.
+ *
+ * @example
+ * ```typescript
+ * const array = [1, 2, 2, 3, 3, 3, 4]
+ * const set = setFromArray(array)
+ * // Result: Set { 1, 2, 3, 4 }
+ * ```
+ *
+ * @param array - The array to convert
+ * @returns A new Set containing unique elements from the array
+ * @public
+ */
+export declare const setFromArray: <T>(array: readonly T[]) => Set<T>;

package/set.js

@@ -0,0 +1,52 @@
+const r = (...t) => {
+  const o = /* @__PURE__ */ new Set();
+  for (const e of t)
+    for (const s of e)
+      o.add(s);
+  return o;
+}, c = (t, o) => {
+  const e = /* @__PURE__ */ new Set();
+  for (const s of t)
+    o.has(s) && e.add(s);
+  return e;
+}, f = (t, o) => {
+  const e = /* @__PURE__ */ new Set();
+  for (const s of t)
+    o.has(s) || e.add(s);
+  return e;
+}, i = (t, o) => {
+  const e = /* @__PURE__ */ new Set();
+  for (const s of t)
+    o.has(s) || e.add(s);
+  for (const s of o)
+    t.has(s) || e.add(s);
+  return e;
+}, n = (t, o) => {
+  for (const e of t)
+    if (!o.has(e))
+      return !1;
+  return !0;
+}, a = (t, o) => n(o, t), u = (t, o) => {
+  const e = /* @__PURE__ */ new Set();
+  for (const s of t)
+    o(s) && e.add(s);
+  return e;
+}, d = (t, o) => {
+  const e = /* @__PURE__ */ new Set();
+  for (const s of t)
+    e.add(o(s));
+  return e;
+}, m = (t) => t.size === 0, S = (t) => Array.from(t), l = (t) => new Set(t);
+export {
+  f as setDifference,
+  u as setFilter,
+  l as setFromArray,
+  c as setIntersection,
+  m as setIsEmpty,
+  n as setIsSubset,
+  a as setIsSuperset,
+  d as setMap,
+  i as setSymmetricDifference,
+  S as setToArray,
+  r as setUnion
+};

package/string.cjs

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