@tempots/std 0.12.0 → 0.13.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/string.js CHANGED
@@ -1,4 +1,4 @@
1
- import { anyElement as l, allElements as C, generateArray as A, createFilledArray as S } from "./array.js";
1
+ import { anyElement as l, allElements as b, generateArray as A, createFilledArray as I } from "./array.js";
2
2
  import { mapRegExp as h } from "./regexp.js";
3
3
  function c(n, t, r) {
4
4
  return n.split(t).join(r);
@@ -24,65 +24,65 @@ function p(n) {
24
24
  }
25
25
  const d = (n) => n.toUpperCase();
26
26
  function v(n, t = !1) {
27
- return t ? h(p(n), H, d) : h(p(n), R, d);
27
+ return t ? h(p(n), P, d) : h(p(n), H, d);
28
28
  }
29
29
  function nn(n) {
30
30
  return n.replace(Q, `
31
31
  `);
32
32
  }
33
33
  function tn(n, t) {
34
- return n == null && t == null ? 0 : n == null ? -1 : t == null ? 1 : y(n.toLowerCase(), t.toLowerCase());
34
+ return n == null && t == null ? 0 : n == null ? -1 : t == null ? 1 : E(n.toLowerCase(), t.toLowerCase());
35
35
  }
36
- function L(n, t) {
36
+ function S(n, t) {
37
37
  return n.substring(0, n.length - t.length) === t;
38
38
  }
39
39
  function rn(n, t) {
40
40
  return n.substring(0, n.length - t.length).toLowerCase() === t.toLowerCase();
41
41
  }
42
- function W(n, t) {
42
+ function T(n, t) {
43
43
  return n.substring(0, t.length) === t;
44
44
  }
45
45
  function en(n, t) {
46
46
  return n.substring(0, t.length).toLowerCase() === t.toLowerCase();
47
47
  }
48
48
  function on(n, t) {
49
- return z(
49
+ return W(
50
50
  n.toLowerCase(),
51
51
  t.map((r) => r.toLowerCase())
52
52
  );
53
53
  }
54
- function un(n, t) {
55
- return N(
54
+ function sn(n, t) {
55
+ return _(
56
56
  n.toLowerCase(),
57
57
  t.map((r) => r.toLowerCase())
58
58
  );
59
59
  }
60
- function sn(n) {
61
- return n.trim().replace(m, " ");
60
+ function un(n) {
61
+ return n.trim().replace(w, " ");
62
62
  }
63
- function y(n, t) {
63
+ function E(n, t) {
64
64
  return n < t ? -1 : n > t ? 1 : 0;
65
65
  }
66
- function w(n, t) {
66
+ function L(n, t) {
67
67
  return n.toLowerCase().includes(t.toLowerCase());
68
68
  }
69
- function a(n, t) {
69
+ function g(n, t) {
70
70
  return n.includes(t);
71
71
  }
72
72
  function fn(n, t) {
73
73
  return n.split(t).length - 1;
74
74
  }
75
75
  function cn(n, t) {
76
- return l(t, (r) => w(n, r));
76
+ return l(t, (r) => L(n, r));
77
77
  }
78
78
  function ln(n, t) {
79
- return l(t, (r) => a(n, r));
80
- }
81
- function an(n, t) {
82
- return C(t, (r) => w(n, r));
79
+ return l(t, (r) => g(n, r));
83
80
  }
84
81
  function gn(n, t) {
85
- return C(t, (r) => a(n, r));
82
+ return b(t, (r) => L(n, r));
83
+ }
84
+ function an(n, t) {
85
+ return b(t, (r) => g(n, r));
86
86
  }
87
87
  function hn(n) {
88
88
  return n.replace("_", "-");
@@ -94,7 +94,7 @@ function pn(n, t) {
94
94
  if (n.substring(e, e + 1) !== t.substring(e, e + 1)) return e;
95
95
  return r;
96
96
  }
97
- function E(n, t = 20, r = "…") {
97
+ function O(n, t = 20, r = "…") {
98
98
  const e = n.length, i = r.length;
99
99
  return e > t ? t < i ? r.substr(i - t, t) : n.substr(0, t - i) + r : n;
100
100
  }
@@ -102,301 +102,291 @@ function dn(n, t = 20, r = "…") {
102
102
  const e = n.length, i = r.length;
103
103
  if (e > t) {
104
104
  if (t <= i)
105
- return E(n, t, r);
106
- const s = Math.ceil((t - i) / 2), f = Math.floor((t - i) / 2);
107
- return n.substr(0, s) + r + n.substr(e - f, f);
105
+ return O(n, t, r);
106
+ const u = Math.ceil((t - i) / 2), f = Math.floor((t - i) / 2);
107
+ return n.substr(0, u) + r + n.substr(e - f, f);
108
108
  } else return n;
109
109
  }
110
- function z(n, t) {
111
- return l(t, (r) => L(n, r));
112
- }
113
- function bn(n, t) {
114
- return g(n).filter(t).join("");
110
+ function W(n, t) {
111
+ return l(t, (r) => S(n, r));
115
112
  }
116
113
  function Cn(n, t) {
117
- return U(n).filter(t).map((e) => String.fromCharCode(e)).join("");
114
+ return a(n).filter(t).join("");
118
115
  }
119
- function An(n, t) {
120
- const r = n.indexOf(t);
121
- return r < 0 ? "" : n.substring(r);
116
+ function bn(n, t) {
117
+ return F(n).filter(t).map((e) => String.fromCharCode(e)).join("");
122
118
  }
123
- function Ln(n, t = 2166136261) {
119
+ function An(n, t = 2166136261) {
124
120
  let r = t;
125
121
  for (let e = 0, i = n.length; e < i; e++)
126
122
  r ^= n.charCodeAt(e), r += (r << 1) + (r << 4) + (r << 7) + (r << 8) + (r << 24);
127
123
  return r >>> 0;
128
124
  }
129
- function wn(n) {
125
+ function Sn(n) {
130
126
  return n != null && n.length > 0;
131
127
  }
132
- function In(n) {
133
- return c(k(n), "_", " ");
128
+ function Ln(n) {
129
+ return c(U(n), "_", " ");
134
130
  }
135
- function mn(n) {
131
+ function xn(n) {
136
132
  return n.length > 0 && !D.test(n);
137
133
  }
138
- function On(n) {
139
- return G.test(n);
134
+ function wn(n) {
135
+ return R.test(n);
140
136
  }
141
- function Sn(n) {
142
- return !T.test(n);
137
+ function mn(n) {
138
+ return !Z.test(n);
143
139
  }
144
- function Wn(n) {
140
+ function In(n) {
145
141
  return n.toLowerCase() === n;
146
142
  }
147
- function yn(n) {
143
+ function Tn(n) {
148
144
  return n.toUpperCase() === n;
149
145
  }
150
146
  function En(n, t) {
151
147
  return n != null && n !== "" ? n : t;
152
148
  }
153
- function zn(n) {
154
- return F.test(n);
149
+ function On(n) {
150
+ return G.test(n);
155
151
  }
156
- function Bn(n) {
152
+ function Wn(n) {
157
153
  return n == null || n === "";
158
154
  }
159
- function jn(n) {
155
+ function yn(n) {
160
156
  return n.substring(0, 1).toLowerCase() + n.substring(1);
161
157
  }
162
- function B(n, t = 1) {
158
+ function y(n, t = 1) {
163
159
  return n.substring(
164
160
  Math.floor((n.length - t + 1) * Math.random()),
165
161
  t
166
162
  );
167
163
  }
168
- function j(n, t) {
169
- return A(t, () => B(n)).join("");
164
+ function z(n, t) {
165
+ return A(t, () => y(n)).join("");
170
166
  }
171
- function _n(n) {
172
- return j(P, n);
167
+ function zn(n) {
168
+ return z(k, n);
173
169
  }
174
- function Mn(n, t) {
175
- return g(t).map(n);
170
+ function Bn(n, t) {
171
+ return a(t).map(n);
176
172
  }
177
- function Nn(n, t) {
173
+ function jn(n, t) {
178
174
  return c(n, t, "");
179
175
  }
180
- function Un(n, t) {
181
- return L(n, t) ? n.substring(0, n.length - t.length) : n;
176
+ function _n(n, t) {
177
+ return S(n, t) ? n.substring(0, n.length - t.length) : n;
182
178
  }
183
- function $n(n, t, r) {
179
+ function Fn(n, t, r) {
184
180
  return n.substring(0, t) + n.substring(t + r);
185
181
  }
186
- function xn(n, t) {
187
- return W(n, t) ? n.substring(t.length) : n;
182
+ function Mn(n, t) {
183
+ return T(n, t) ? n.substring(t.length) : n;
188
184
  }
189
- function kn(n, t) {
185
+ function Nn(n, t) {
190
186
  const r = n.indexOf(t);
191
187
  return r < 0 ? n : n.substring(0, r) + n.substring(r + t.length);
192
188
  }
193
- function I(n, t) {
194
- return S(t, n).join("");
189
+ function x(n, t) {
190
+ return I(t, n).join("");
195
191
  }
196
- function Zn(n) {
197
- const t = g(n);
192
+ function Un(n) {
193
+ const t = a(n);
198
194
  return t.reverse(), t.join("");
199
195
  }
200
- function _(n, t = "'") {
196
+ function B(n, t = "'") {
201
197
  return t === "'" ? n.includes("'") ? n.includes('"') ? "'" + c(n, "'", "\\'") + "'" : '"' + n + '"' : "'" + n + "'" : n.includes('"') ? n.includes("'") ? '"' + c(n, '"', '\\"') + '"' : "'" + n + "'" : '"' + n + '"';
202
198
  }
203
- function M(n, t = "'") {
199
+ function j(n, t = "'") {
204
200
  return t + c(n, t, "\\" + t) + t;
205
201
  }
206
- function Pn(n, t = "'") {
202
+ function $n(n, t = "'") {
207
203
  return n.indexOf(`
208
- `) >= 0 ? M(n, "`") : _(n, t);
204
+ `) >= 0 ? j(n, "`") : B(n, t);
209
205
  }
210
- function Rn(n, t) {
206
+ function kn(n, t) {
211
207
  const r = n.indexOf(t);
212
208
  return r < 0 ? [n] : [n.substring(0, r), n.substring(r + t.length)];
213
209
  }
214
- function N(n, t) {
210
+ function _(n, t) {
215
211
  return l(t, (r) => n.startsWith(r));
216
212
  }
217
- function Tn(n, t, r = t) {
213
+ function Hn(n, t, r = t) {
218
214
  return `${t}${n}${r}`;
219
215
  }
220
- function g(n) {
216
+ function a(n) {
221
217
  return n.split("");
222
218
  }
223
- function U(n) {
219
+ function F(n) {
224
220
  return A(n.length, (t) => n.charCodeAt(t));
225
221
  }
226
- function Dn(n, t) {
222
+ function Zn(n, t) {
227
223
  const r = [];
228
224
  for (; n.length > 0; )
229
225
  r.push(n.substring(0, t)), n = n.substr(t, n.length - t);
230
226
  return r;
231
227
  }
232
- function Hn(n) {
233
- return n.split(O);
228
+ function Dn(n) {
229
+ return n.split(m);
234
230
  }
235
- function Gn(n, t) {
236
- return x($(n, t), t);
231
+ function Pn(n, t) {
232
+ return N(M(n, t), t);
237
233
  }
238
- function $(n, t) {
234
+ function M(n, t) {
239
235
  let r = 0;
240
- for (let e = 0; e < n.length && a(t, n.charAt(e)); e++)
236
+ for (let e = 0; e < n.length && g(t, n.charAt(e)); e++)
241
237
  r++;
242
238
  return n.substring(r);
243
239
  }
244
- function x(n, t) {
240
+ function N(n, t) {
245
241
  const r = n.length;
246
242
  let e = r, i;
247
- for (let s = 0; s < r && (i = r - s - 1, a(t, n.charAt(i))); s++)
243
+ for (let u = 0; u < r && (i = r - u - 1, g(t, n.charAt(i))); u++)
248
244
  e = i;
249
245
  return n.substring(0, e);
250
246
  }
251
- function k(n) {
247
+ function U(n) {
252
248
  return n = n.replace(/::/g, "/"), n = n.replace(/([A-Z]+)([A-Z][a-z])/g, "$1_$2"), n = n.replace(/([a-z\d])([A-Z])/g, "$1_$2"), n = n.replace(/-/g, "_"), n.toLowerCase();
253
249
  }
254
- function Fn(n) {
250
+ function Rn(n) {
255
251
  return n.substring(0, 1).toUpperCase() + n.substring(1);
256
252
  }
257
- function Qn(n, t) {
258
- const r = n.indexOf(t);
259
- return r < 0 ? n : n.substring(0, r);
260
- }
261
- function Kn(n, t = 78, r = "", e = `
253
+ function Gn(n, t = 78, r = "", e = `
262
254
  `) {
263
- return n.split(O).map(
264
- (i) => Z(i.replace(m, " ").trim(), t, r, e)
255
+ return n.split(m).map(
256
+ (i) => $(i.replace(w, " ").trim(), t, r, e)
265
257
  ).join(e);
266
258
  }
267
- function b(n, t) {
259
+ function C(n, t) {
268
260
  if (t < 0 || t >= n.length) return !1;
269
261
  const r = n.charCodeAt(t);
270
262
  return r === 9 || r === 10 || r === 11 || r === 12 || r === 13 || r === 32;
271
263
  }
272
- function qn(n) {
264
+ function Qn(n) {
273
265
  if (typeof Buffer < "u")
274
266
  return Buffer.from(n).toString("base64");
275
267
  if (typeof btoa < "u")
276
268
  return btoa(n);
277
269
  throw new Error("no implementation found for base64 encoding");
278
270
  }
279
- function Jn(n) {
271
+ function Kn(n) {
280
272
  if (typeof Buffer < "u")
281
273
  return Buffer.from(n, "base64").toString("utf8");
282
274
  if (typeof atob < "u")
283
275
  return atob(n);
284
276
  throw new Error("no implementation found for base64 decoding");
285
277
  }
286
- function Z(n, t, r, e) {
287
- const i = [], s = n.length, f = r.length;
288
- let u = 0;
278
+ function $(n, t, r, e) {
279
+ const i = [], u = n.length, f = r.length;
280
+ let s = 0;
289
281
  for (t -= f; ; ) {
290
- if (u + t >= s - f) {
291
- i.push(n.substring(u));
282
+ if (s + t >= u - f) {
283
+ i.push(n.substring(s));
292
284
  break;
293
285
  }
294
286
  let o = 0;
295
- for (; !b(n, u + t - o) && o < t; ) o++;
287
+ for (; !C(n, s + t - o) && o < t; ) o++;
296
288
  if (o === t) {
297
- for (o = 0; !b(n, u + t + o) && u + t + o < s; ) o++;
298
- i.push(n.substring(u, u + t + o)), u += t + o + 1;
289
+ for (o = 0; !C(n, s + t + o) && s + t + o < u; ) o++;
290
+ i.push(n.substring(s, s + t + o)), s += t + o + 1;
299
291
  } else
300
- i.push(n.substring(u, u + t - o)), u += t - o + 1;
292
+ i.push(n.substring(s, s + t - o)), s += t - o + 1;
301
293
  }
302
294
  return r + i.join(e + r);
303
295
  }
304
- function Vn(n, t, r) {
296
+ function qn(n, t, r) {
305
297
  const e = r - n.length;
306
- return e > 0 ? I(t, e) + n : n;
298
+ return e > 0 ? x(t, e) + n : n;
307
299
  }
308
- function Xn(n, t, r) {
300
+ function Jn(n, t, r) {
309
301
  const e = r - n.length;
310
- return e > 0 ? n + I(t, e) : n;
302
+ return e > 0 ? n + x(t, e) : n;
311
303
  }
312
- function Yn(n, t) {
304
+ function Vn(n, t) {
313
305
  const r = n.lastIndexOf(t);
314
306
  return r >= 0 ? [n.substring(0, r), n.substring(r + t.length)] : [n];
315
307
  }
316
- function vn(n, t) {
308
+ function Xn(n, t) {
317
309
  const r = n.indexOf(t);
318
310
  return r >= 0 ? [n.substring(0, r), n.substring(r + t.length)] : [n];
319
311
  }
320
- const P = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", R = /[^a-zA-Z]([a-z])/g, T = /[^\t\n\r ]/, D = /[^a-zA-Z]/, H = /[ \t\r\n][a-z]/g, G = /^[a-z0-9]+$/i, F = /^[0-9]+$/, m = /[ \t\r\n]+/g, O = /\r\n|\n\r|\n|\r/g, Q = /\r\n|\n\r|\r/g;
312
+ const k = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", H = /[^a-zA-Z]([a-z])/g, Z = /[^\t\n\r ]/, D = /[^a-zA-Z]/, P = /[ \t\r\n][a-z]/g, R = /^[a-z0-9]+$/i, G = /^[0-9]+$/, w = /[ \t\r\n]+/g, m = /\r\n|\n\r|\n|\r/g, Q = /\r\n|\n\r|\r/g;
321
313
  export {
322
- J as after,
323
- V as afterLast,
324
- X as before,
325
- Y as beforeLast,
314
+ V as afterLastText,
315
+ J as afterText,
316
+ Y as beforeLastText,
317
+ X as beforeText,
326
318
  nn as canonicalizeNewlines,
327
319
  p as capitalize,
328
320
  v as capitalizeWords,
329
- sn as collapse,
321
+ Zn as chunkText,
330
322
  tn as compareCaseInsensitive,
331
- y as compareStrings,
332
- a as contains,
333
- gn as containsAll,
334
- an as containsAllCaseInsensitive,
335
- ln as containsAny,
336
- cn as containsAnyCaseInsensitive,
337
- w as containsCaseInsensitive,
338
- fn as count,
323
+ E as compareStrings,
324
+ an as containsAllText,
325
+ gn as containsAllTextCaseInsensitive,
326
+ ln as containsAnyText,
327
+ cn as containsAnyTextCaseInsensitive,
328
+ fn as countTextOccurrences,
339
329
  hn as dasherize,
340
- Jn as decodeBase64,
341
- pn as diffIndex,
342
- E as ellipsis,
330
+ Kn as decodeBase64,
331
+ O as ellipsis,
343
332
  dn as ellipsisMiddle,
344
- qn as encodeBase64,
345
- L as endsWith,
346
- z as endsWithAny,
347
- on as endsWithAnyCaseInsensitive,
348
- rn as endsWithCaseInsensitive,
349
- bn as filter,
350
- Cn as filterCharcode,
351
- An as from,
352
- wn as hasContent,
353
- Ln as hashCode,
354
- In as humanize,
355
- En as ifEmpty,
356
- mn as isAlpha,
357
- On as isAlphaNum,
358
- Sn as isBreakingWhitespace,
359
- zn as isDigitsOnly,
360
- Bn as isEmpty,
361
- Wn as isLowerCase,
362
- b as isSpaceAt,
363
- yn as isUpperCase,
364
- Pn as jsQuote,
365
- jn as lowerCaseFirst,
366
- Vn as lpad,
367
- Mn as map,
368
- M as quote,
369
- B as random,
370
- j as randomSequence,
371
- _n as randomSequence64,
372
- Nn as remove,
373
- Un as removeAfter,
374
- $n as removeAt,
375
- xn as removeBefore,
376
- kn as removeOne,
377
- I as repeat,
378
- c as replace,
379
- Zn as reverse,
380
- Xn as rpad,
381
- _ as smartQuote,
382
- vn as splitOnFirst,
383
- Yn as splitOnLast,
384
- Rn as splitOnce,
385
- W as startsWith,
386
- N as startsWithAny,
387
- un as startsWithAnyCaseInsensitive,
388
- en as startsWithCaseInsensitive,
389
- Tn as surround,
390
- g as toArray,
391
- U as toCharcodes,
392
- Dn as toChunks,
393
- Hn as toLines,
394
- Gn as trimChars,
395
- $ as trimCharsLeft,
396
- x as trimCharsRight,
397
- k as underscore,
398
- Qn as upTo,
399
- Fn as upperCaseFirst,
400
- Kn as wrapColumns,
401
- Z as wrapLine
333
+ Qn as encodeBase64,
334
+ W as endsWithAnyText,
335
+ bn as filterCharcode,
336
+ Cn as filterText,
337
+ Ln as humanize,
338
+ En as ifEmptyString,
339
+ xn as isAlpha,
340
+ wn as isAlphaNum,
341
+ mn as isBreakingWhitespace,
342
+ On as isDigitsOnly,
343
+ Wn as isEmptyString,
344
+ In as isLowerCase,
345
+ C as isSpaceAt,
346
+ Tn as isUpperCase,
347
+ $n as jsQuote,
348
+ yn as lowerCaseFirst,
349
+ qn as lpad,
350
+ Bn as mapChars,
351
+ j as quote,
352
+ y as randomString,
353
+ z as randomStringSequence,
354
+ zn as randomStringSequenceBase64,
355
+ Nn as removeFirstFromString,
356
+ jn as removeFromString,
357
+ _n as removeFromStringAfter,
358
+ Mn as removeFromStringBefore,
359
+ Fn as removeSliceFromString,
360
+ x as repeatString,
361
+ c as replaceAll,
362
+ Un as reverseString,
363
+ Jn as rpad,
364
+ B as smartQuote,
365
+ Xn as splitOnFirst,
366
+ Vn as splitOnLast,
367
+ kn as splitStringOnce,
368
+ Sn as stringHasContent,
369
+ An as stringHashCode,
370
+ F as stringToCharcodes,
371
+ a as stringToChars,
372
+ Dn as stringToLines,
373
+ pn as stringsDifferAtIndex,
374
+ Hn as surroundText,
375
+ un as textCollapse,
376
+ g as textContains,
377
+ L as textContainsCaseInsensitive,
378
+ S as textEndsWith,
379
+ on as textEndsWithAnyCaseInsensitive,
380
+ rn as textEndsWithCaseInsensitive,
381
+ T as textStartsWith,
382
+ _ as textStartsWithAny,
383
+ sn as textStartsWithAnyCaseInsensitive,
384
+ en as textStartsWithCaseInsensitive,
385
+ Pn as trimChars,
386
+ M as trimCharsLeft,
387
+ N as trimCharsRight,
388
+ U as underscore,
389
+ Rn as upperCaseFirst,
390
+ Gn as wrapColumns,
391
+ $ as wrapLine
402
392
  };