string-filters 0.3.2 → 0.3.4

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.
@@ -1,58 +1,62 @@
1
- function a(n, t = !1) {
1
+ /*!
2
+ * String Filters v0.3.3
3
+ * Homepage (https://github.com/tarkhov/js-string-filters)
4
+ * Copyright 2026 Tarkhov
5
+ * License: MIT
6
+ */
7
+ function l(n, t = !1) {
2
8
  let r = n.charAt(0).toUpperCase(), e = n.slice(1);
3
9
  return t && (e = e.toLowerCase()), `${r}${e}`;
4
10
  }
5
11
  function o(n, t = { numbers: !1, lower: !1 }) {
6
- const r = t?.numbers ? /[\p{L}\p{N}]+/gu : /[\p{L}]+/gu;
12
+ const r = t?.numbers ? /[\p{L}\p{N}]+/gu : new RegExp("\\p{L}+", "gu");
7
13
  let e = n.match(r);
8
14
  if (e.length <= 1) return null;
9
- let l = e.shift();
15
+ let a = e.shift();
10
16
  const u = t?.lower;
11
- return u && (l = l.toLowerCase()), e = e.map((s) => a(s, u)), e.unshift(l), e.join("");
17
+ return u && (a = a.toLowerCase()), e = e.map((s) => l(s, u)), e.unshift(a), e.join("");
12
18
  }
13
19
  function p(n, t = !1) {
14
- let r = t ? /[\p{L}\p{N}]+/gu : /[\p{L}]+/gu, e = n.match(r);
15
- return e.length <= 1 ? null : e.map((l) => l.toLowerCase()).join("");
20
+ let r = t ? /[\p{L}\p{N}]+/gu : new RegExp("\\p{L}+", "gu"), e = n.match(r);
21
+ return e.length <= 1 ? null : e.map((a) => a.toLowerCase()).join("");
16
22
  }
17
23
  function f(n, t = !1) {
18
24
  let r = t ? /[\p{L}\p{N}-]+/gu : /[\p{L}-]+/gu, e = n.match(r);
19
- return e.length <= 1 ? null : e.map((l) => l.toLowerCase()).join("-");
25
+ return e.length <= 1 ? null : e.map((a) => a.toLowerCase()).join("-");
20
26
  }
21
27
  function i(n, t, r = " ") {
22
28
  const e = Math.floor((t - n.length) / 2) + n.length;
23
29
  return n.padStart(e, r).padEnd(t, r);
24
30
  }
25
31
  function c(n, t = { numbers: !1, lower: !1 }) {
26
- const r = t?.numbers ? /[\p{L}\p{N}]+/gu : /[\p{L}]+/gu;
32
+ const r = t?.numbers ? /[\p{L}\p{N}]+/gu : new RegExp("\\p{L}+", "gu");
27
33
  let e = n.match(r);
28
- return e.length <= 1 ? null : e.map((l) => a(l, t?.lower)).join("");
34
+ return e.length <= 1 ? null : e.map((a) => l(a, t?.lower)).join("");
29
35
  }
30
- function m(n, t = !1) {
36
+ function g(n, t = !1) {
31
37
  let r = t ? /[\p{L}\p{N}_]+/gu : /[\p{L}_]+/gu, e = n.match(r);
32
- return e.length <= 1 ? null : e.map((l) => l.toLowerCase()).join("_");
38
+ return e.length <= 1 ? null : e.map((a) => a.toLowerCase()).join("_");
33
39
  }
34
- function g(n, t = { numbers: !1, lower: !1 }) {
35
- const r = t?.numbers ? /[\p{L}\p{N}]+/gu : /[\p{L}]+/gu;
36
- let e = n.match(r);
37
- return e.length <= 1 ? null : e.map((l) => a(l, t?.lower)).join(" ");
40
+ function m(n, t = !1) {
41
+ return n.replace(new RegExp("\\p{L}+", "gu"), (r) => l(r, t));
38
42
  }
39
- function w(n, t = { numbers: !1, lower: !1 }) {
43
+ function L(n, t = { numbers: !1, lower: !1 }) {
40
44
  const r = t?.numbers ? /[\p{L}\p{N}-]+/gu : /[\p{L}-]+/gu;
41
45
  let e = n.match(r);
42
- return e.length <= 1 ? null : e.map((l) => a(l, t?.lower)).join("-");
46
+ return e.length <= 1 ? null : e.map((a) => l(a, t?.lower)).join("-");
43
47
  }
44
- function L(n, t = 32, r = "...") {
48
+ function w(n, t = 32, r = "...") {
45
49
  return n.substring(0, t) + r;
46
50
  }
47
51
  export {
48
52
  o as camelCase,
49
- a as capitalize,
53
+ l as capitalize,
50
54
  p as flatCase,
51
55
  f as kebabCase,
52
56
  i as pad,
53
57
  c as pascalCase,
54
- m as snakeCase,
55
- g as titleCase,
56
- w as trainCase,
57
- L as truncate
58
+ g as snakeCase,
59
+ m as titleCase,
60
+ L as trainCase,
61
+ w as truncate
58
62
  };
@@ -1 +1,7 @@
1
- (function(r,u){typeof exports=="object"&&typeof module<"u"?u(exports):typeof define=="function"&&define.amd?define(["exports"],u):(r=typeof globalThis<"u"?globalThis:r||self,u(r.StringFilters={}))})(this,(function(r){"use strict";function u(n,t=!1){let a=n.charAt(0).toUpperCase(),e=n.slice(1);return t&&(e=e.toLowerCase()),`${a}${e}`}function f(n,t={numbers:!1,lower:!1}){const a=t?.numbers?/[\p{L}\p{N}]+/gu:/[\p{L}]+/gu;let e=n.match(a);if(e.length<=1)return null;let l=e.shift();const s=t?.lower;return s&&(l=l.toLowerCase()),e=e.map(w=>u(w,s)),e.unshift(l),e.join("")}function i(n,t=!1){let a=t?/[\p{L}\p{N}]+/gu:/[\p{L}]+/gu,e=n.match(a);return e.length<=1?null:e.map(l=>l.toLowerCase()).join("")}function o(n,t=!1){let a=t?/[\p{L}\p{N}-]+/gu:/[\p{L}-]+/gu,e=n.match(a);return e.length<=1?null:e.map(l=>l.toLowerCase()).join("-")}function p(n,t,a=" "){const e=Math.floor((t-n.length)/2)+n.length;return n.padStart(e,a).padEnd(t,a)}function c(n,t={numbers:!1,lower:!1}){const a=t?.numbers?/[\p{L}\p{N}]+/gu:/[\p{L}]+/gu;let e=n.match(a);return e.length<=1?null:e.map(l=>u(l,t?.lower)).join("")}function m(n,t=!1){let a=t?/[\p{L}\p{N}_]+/gu:/[\p{L}_]+/gu,e=n.match(a);return e.length<=1?null:e.map(l=>l.toLowerCase()).join("_")}function g(n,t={numbers:!1,lower:!1}){const a=t?.numbers?/[\p{L}\p{N}]+/gu:/[\p{L}]+/gu;let e=n.match(a);return e.length<=1?null:e.map(l=>u(l,t?.lower)).join(" ")}function d(n,t={numbers:!1,lower:!1}){const a=t?.numbers?/[\p{L}\p{N}-]+/gu:/[\p{L}-]+/gu;let e=n.match(a);return e.length<=1?null:e.map(l=>u(l,t?.lower)).join("-")}function h(n,t=32,a="..."){return n.substring(0,t)+a}r.camelCase=f,r.capitalize=u,r.flatCase=i,r.kebabCase=o,r.pad=p,r.pascalCase=c,r.snakeCase=m,r.titleCase=g,r.trainCase=d,r.truncate=h,Object.defineProperty(r,Symbol.toStringTag,{value:"Module"})}));
1
+ /*!
2
+ * String Filters v0.3.3
3
+ * Homepage (https://github.com/tarkhov/js-string-filters)
4
+ * Copyright 2026 Tarkhov
5
+ * License: MIT
6
+ */
7
+ (function(l,u){typeof exports=="object"&&typeof module<"u"?u(exports):typeof define=="function"&&define.amd?define(["exports"],u):(l=typeof globalThis<"u"?globalThis:l||self,u(l.StringFilters={}))})(this,(function(l){"use strict";function u(n,t=!1){let a=n.charAt(0).toUpperCase(),e=n.slice(1);return t&&(e=e.toLowerCase()),`${a}${e}`}function f(n,t={numbers:!1,lower:!1}){const a=t?.numbers?/[\p{L}\p{N}]+/gu:new RegExp("\\p{L}+","gu");let e=n.match(a);if(e.length<=1)return null;let r=e.shift();const s=t?.lower;return s&&(r=r.toLowerCase()),e=e.map(C=>u(C,s)),e.unshift(r),e.join("")}function i(n,t=!1){let a=t?/[\p{L}\p{N}]+/gu:new RegExp("\\p{L}+","gu"),e=n.match(a);return e.length<=1?null:e.map(r=>r.toLowerCase()).join("")}function o(n,t=!1){let a=t?/[\p{L}\p{N}-]+/gu:/[\p{L}-]+/gu,e=n.match(a);return e.length<=1?null:e.map(r=>r.toLowerCase()).join("-")}function p(n,t,a=" "){const e=Math.floor((t-n.length)/2)+n.length;return n.padStart(e,a).padEnd(t,a)}function c(n,t={numbers:!1,lower:!1}){const a=t?.numbers?/[\p{L}\p{N}]+/gu:new RegExp("\\p{L}+","gu");let e=n.match(a);return e.length<=1?null:e.map(r=>u(r,t?.lower)).join("")}function m(n,t=!1){let a=t?/[\p{L}\p{N}_]+/gu:/[\p{L}_]+/gu,e=n.match(a);return e.length<=1?null:e.map(r=>r.toLowerCase()).join("_")}function d(n,t=!1){return n.replace(new RegExp("\\p{L}+","gu"),a=>u(a,t))}function g(n,t={numbers:!1,lower:!1}){const a=t?.numbers?/[\p{L}\p{N}-]+/gu:/[\p{L}-]+/gu;let e=n.match(a);return e.length<=1?null:e.map(r=>u(r,t?.lower)).join("-")}function h(n,t=32,a="..."){return n.substring(0,t)+a}l.camelCase=f,l.capitalize=u,l.flatCase=i,l.kebabCase=o,l.pad=p,l.pascalCase=c,l.snakeCase=m,l.titleCase=d,l.trainCase=g,l.truncate=h,Object.defineProperty(l,Symbol.toStringTag,{value:"Module"})}));
@@ -0,0 +1,4 @@
1
+ export default function _default(string: any, options?: {
2
+ numbers: boolean;
3
+ lower: boolean;
4
+ }): any;
@@ -0,0 +1 @@
1
+ export default function _default(string: any, lower?: boolean): string;
@@ -0,0 +1 @@
1
+ export default function _default(string: any, numbers?: boolean): any;
@@ -0,0 +1 @@
1
+ export default function _default(string: any, numbers?: boolean): any;
@@ -0,0 +1,11 @@
1
+ import camelCase from './camelCase';
2
+ import capitalize from './capitalize';
3
+ import flatCase from './flatCase';
4
+ import kebabCase from './kebabCase';
5
+ import pad from './pad';
6
+ import pascalCase from './pascalCase';
7
+ import snakeCase from './snakeCase';
8
+ import titleCase from './titleCase';
9
+ import trainCase from './trainCase';
10
+ import truncate from './truncate';
11
+ export { camelCase, capitalize, flatCase, kebabCase, pad, pascalCase, snakeCase, titleCase, trainCase, truncate };
@@ -0,0 +1 @@
1
+ export default function _default(string: any, length: any, chars?: string): any;
@@ -0,0 +1,4 @@
1
+ export default function _default(string: any, options?: {
2
+ numbers: boolean;
3
+ lower: boolean;
4
+ }): any;
@@ -0,0 +1 @@
1
+ export default function _default(string: any, numbers?: boolean): any;
@@ -0,0 +1 @@
1
+ export default function _default(string: any, lower?: boolean): any;
@@ -0,0 +1,4 @@
1
+ export default function _default(string: any, options?: {
2
+ numbers: boolean;
3
+ lower: boolean;
4
+ }): any;
@@ -0,0 +1 @@
1
+ export default function _default(string: any, length?: number, omission?: string): string;
package/package.json CHANGED
@@ -1,9 +1,12 @@
1
1
  {
2
2
  "name": "string-filters",
3
- "version": "0.3.2",
3
+ "version": "0.3.4",
4
4
  "description": "Fast native javascript string filters library.",
5
5
  "type": "module",
6
- "files": ["dist"],
6
+ "types": "./dist/types/main.d.ts",
7
+ "files": [
8
+ "dist"
9
+ ],
7
10
  "main": "./dist/string-filters.umd.cjs",
8
11
  "module": "./dist/string-filters.js",
9
12
  "exports": {
@@ -25,7 +28,8 @@
25
28
  "sanitize",
26
29
  "input-mask",
27
30
  "javascript",
28
- "js"
31
+ "js",
32
+ "typescript"
29
33
  ],
30
34
  "repository": {
31
35
  "type": "git",
@@ -39,10 +43,12 @@
39
43
  "homepage": "https://github.com/tarkhov/js-string-filters",
40
44
  "scripts": {
41
45
  "dev": "vite",
42
- "build": "vite build",
46
+ "build": "vite build && tsc",
43
47
  "preview": "vite preview"
44
48
  },
45
49
  "devDependencies": {
46
- "vite": "^7.3.1"
50
+ "typescript": "^5.9.3",
51
+ "vite": "^7.3.1",
52
+ "vite-plugin-banner": "^0.8.1"
47
53
  }
48
54
  }