@futdevpro/fsm-dynamo 1.20.177 → 1.20.179

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.
@@ -0,0 +1,54 @@
1
+ /**
2
+ * BFR-LOGOSZ-003 — the edit distance (Levenshtein) of two texts and a similarity score from it.
3
+ *
4
+ * @description Measured before (2026-10-24): neither `fsm-dynamo` nor `nts-dynamo` had one, and two projects kept
5
+ * their own copy (the FAM `FAM_FuzzyMatch_Util`, the Logosz `LGZ_Duplicate_Util.editDistance`). The texts are
6
+ * compared by code points (`Array.from`), so an accented letter or an emoji is one character. No normalization is
7
+ * done here (case, accents, spaces): the caller normalizes first when it needs to.
8
+ *
9
+ * @example
10
+ * ```ts
11
+ * DyFM_StringSimilarity_Util.editDistance('kutya', 'kutyak'); // 1
12
+ * DyFM_StringSimilarity_Util.boundedEditDistance({ a: 'macska', b: 'kutya', maxDistance: 1 }); // 2 (= "more than 1")
13
+ * DyFM_StringSimilarity_Util.similarity('kutya', 'kutyak'); // 0.8333…
14
+ * ```
15
+ */
16
+ export declare class DyFM_StringSimilarity_Util {
17
+ /**
18
+ * The number of single-character insertions, deletions and substitutions that turn `a` into `b`.
19
+ *
20
+ * @param a the first text
21
+ * @param b the second text
22
+ */
23
+ static editDistance(a: string, b: string): number;
24
+ /**
25
+ * The edit distance, but only up to `maxDistance`: above it the computation stops early and `maxDistance + 1` is
26
+ * returned (= "farther than allowed"). For "do these differ in at most N letters?" over many pairs.
27
+ *
28
+ * @param set.a the first text
29
+ * @param set.b the second text
30
+ * @param set.maxDistance the largest distance of interest (0 or more)
31
+ */
32
+ static boundedEditDistance(set: {
33
+ a: string;
34
+ b: string;
35
+ maxDistance: number;
36
+ }): number;
37
+ /**
38
+ * The similarity of two texts, `0..1`: `1 - editDistance / the longer length`. Two identical texts (two empty ones
39
+ * included) give `1`; an empty and a non-empty one give `0`.
40
+ *
41
+ * @param a the first text
42
+ * @param b the second text
43
+ */
44
+ static similarity(a: string, b: string): number;
45
+ /**
46
+ * The Levenshtein distance over two rows; stops when a whole row is already above `limit` (then `limit + 1`).
47
+ *
48
+ * @param a the first text's characters
49
+ * @param b the second text's characters
50
+ * @param limit the largest distance of interest (`Infinity`: no limit)
51
+ */
52
+ private static distance;
53
+ }
54
+ //# sourceMappingURL=string-similarity.util.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"string-similarity.util.d.ts","sourceRoot":"","sources":["../../../src/_collections/utils/string-similarity.util.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,qBAAa,0BAA0B;IAErC;;;;;OAKG;IACH,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAIjD;;;;;;;OAOG;IACH,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM;IAMtF;;;;;;OAMG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAY/C;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ;CA+BxB"}
@@ -0,0 +1,89 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ exports.DyFM_StringSimilarity_Util = void 0;
4
+ /**
5
+ * BFR-LOGOSZ-003 — the edit distance (Levenshtein) of two texts and a similarity score from it.
6
+ *
7
+ * @description Measured before (2026-10-24): neither `fsm-dynamo` nor `nts-dynamo` had one, and two projects kept
8
+ * their own copy (the FAM `FAM_FuzzyMatch_Util`, the Logosz `LGZ_Duplicate_Util.editDistance`). The texts are
9
+ * compared by code points (`Array.from`), so an accented letter or an emoji is one character. No normalization is
10
+ * done here (case, accents, spaces): the caller normalizes first when it needs to.
11
+ *
12
+ * @example
13
+ * ```ts
14
+ * DyFM_StringSimilarity_Util.editDistance('kutya', 'kutyak'); // 1
15
+ * DyFM_StringSimilarity_Util.boundedEditDistance({ a: 'macska', b: 'kutya', maxDistance: 1 }); // 2 (= "more than 1")
16
+ * DyFM_StringSimilarity_Util.similarity('kutya', 'kutyak'); // 0.8333…
17
+ * ```
18
+ */
19
+ class DyFM_StringSimilarity_Util {
20
+ /**
21
+ * The number of single-character insertions, deletions and substitutions that turn `a` into `b`.
22
+ *
23
+ * @param a the first text
24
+ * @param b the second text
25
+ */
26
+ static editDistance(a, b) {
27
+ return DyFM_StringSimilarity_Util.distance(Array.from(a ?? ''), Array.from(b ?? ''), Infinity);
28
+ }
29
+ /**
30
+ * The edit distance, but only up to `maxDistance`: above it the computation stops early and `maxDistance + 1` is
31
+ * returned (= "farther than allowed"). For "do these differ in at most N letters?" over many pairs.
32
+ *
33
+ * @param set.a the first text
34
+ * @param set.b the second text
35
+ * @param set.maxDistance the largest distance of interest (0 or more)
36
+ */
37
+ static boundedEditDistance(set) {
38
+ const limit = Math.max(0, Math.floor(set.maxDistance));
39
+ return DyFM_StringSimilarity_Util.distance(Array.from(set.a ?? ''), Array.from(set.b ?? ''), limit);
40
+ }
41
+ /**
42
+ * The similarity of two texts, `0..1`: `1 - editDistance / the longer length`. Two identical texts (two empty ones
43
+ * included) give `1`; an empty and a non-empty one give `0`.
44
+ *
45
+ * @param a the first text
46
+ * @param b the second text
47
+ */
48
+ static similarity(a, b) {
49
+ const charsA = Array.from(a ?? '');
50
+ const charsB = Array.from(b ?? '');
51
+ const longer = Math.max(charsA.length, charsB.length);
52
+ if (!longer) {
53
+ return 1;
54
+ }
55
+ return 1 - DyFM_StringSimilarity_Util.distance(charsA, charsB, Infinity) / longer;
56
+ }
57
+ /**
58
+ * The Levenshtein distance over two rows; stops when a whole row is already above `limit` (then `limit + 1`).
59
+ *
60
+ * @param a the first text's characters
61
+ * @param b the second text's characters
62
+ * @param limit the largest distance of interest (`Infinity`: no limit)
63
+ */
64
+ static distance(a, b, limit) {
65
+ // the length difference alone is a lower bound
66
+ if (Math.abs(a.length - b.length) > limit) {
67
+ return limit + 1;
68
+ }
69
+ let previous = Array.from({ length: b.length + 1 }, (_value, index) => index);
70
+ for (let i = 1; i <= a.length; i++) {
71
+ const current = [i];
72
+ let rowMin = i;
73
+ for (let j = 1; j <= b.length; j++) {
74
+ const cost = a[i - 1] === b[j - 1] ? 0 : 1;
75
+ current[j] = Math.min(previous[j] + 1, current[j - 1] + 1, previous[j - 1] + cost);
76
+ rowMin = Math.min(rowMin, current[j]);
77
+ }
78
+ // every path goes through this row: nothing below `rowMin` can come later
79
+ if (rowMin > limit) {
80
+ return limit + 1;
81
+ }
82
+ previous = current;
83
+ }
84
+ const result = previous[b.length];
85
+ return result > limit ? limit + 1 : result;
86
+ }
87
+ }
88
+ exports.DyFM_StringSimilarity_Util = DyFM_StringSimilarity_Util;
89
+ //# sourceMappingURL=string-similarity.util.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"string-similarity.util.js","sourceRoot":"","sources":["../../../src/_collections/utils/string-similarity.util.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;GAcG;AACH,MAAa,0BAA0B;IAErC;;;;;OAKG;IACH,MAAM,CAAC,YAAY,CAAC,CAAS,EAAE,CAAS;QACtC,OAAO,0BAA0B,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IACjG,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,mBAAmB,CAAC,GAAkD;QAC3E,MAAM,KAAK,GAAW,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;QAE/D,OAAO,0BAA0B,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACtG,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,UAAU,CAAC,CAAS,EAAE,CAAS;QACpC,MAAM,MAAM,GAAa,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAa,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAW,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAE9D,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,CAAC,CAAC;QACX,CAAC;QAED,OAAO,CAAC,GAAG,0BAA0B,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC;IACpF,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,QAAQ,CAAC,CAAW,EAAE,CAAW,EAAE,KAAa;QAC7D,+CAA+C;QAC/C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;YAC1C,OAAO,KAAK,GAAG,CAAC,CAAC;QACnB,CAAC;QAED,IAAI,QAAQ,GAAa,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,MAAe,EAAE,KAAa,EAAU,EAAE,CAAC,KAAK,CAAC,CAAC;QAEjH,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAa,CAAE,CAAC,CAAE,CAAC;YAChC,IAAI,MAAM,GAAW,CAAC,CAAC;YAEvB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,IAAI,GAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAEnD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;gBACnF,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC;YAED,0EAA0E;YAC1E,IAAI,MAAM,GAAG,KAAK,EAAE,CAAC;gBACnB,OAAO,KAAK,GAAG,CAAC,CAAC;YACnB,CAAC;YAED,QAAQ,GAAG,OAAO,CAAC;QACrB,CAAC;QAED,MAAM,MAAM,GAAW,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAE1C,OAAO,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7C,CAAC;CACF;AAnFD,gEAmFC"}
@@ -22,7 +22,7 @@ export interface DyFM_AudioMixer_Settings {
22
22
  /**
23
23
  * Szoljon-e a hang, ha a tab/ablak nem aktiv. **Default: `false`.**
24
24
  *
25
- * **OPCIONALIS** — szandekosan, hogy a mezo bevezetese ne legyen torо valtozas a round-1
25
+ * **OPCIONALIS** — szandekosan, hogy a mezo bevezetese ne legyen toro valtozas a round-1
26
26
  * alakot mar hasznalo projekteknek. A letezese viszont azt biztositja, hogy a klasszikus
27
27
  * oda-vissza konverzio (`toClassicSettings` -> `fromClassicSettings`) NE veszitse el a
28
28
  * kapcsolot.
package/build/index.d.ts CHANGED
@@ -17,6 +17,7 @@ export * from './_collections/utils/require-env.util';
17
17
  export * from './_collections/utils/stack.util';
18
18
  export * from './_collections/utils/string.util';
19
19
  export * from './_collections/utils/string-case.util';
20
+ export * from './_collections/utils/string-similarity.util';
20
21
  export * from './_collections/utils/enum.util';
21
22
  export * from './_collections/utils/time.util';
22
23
  export * from './_collections/utils/type-cloning-facility.util';
@@ -1 +1 @@
1
- {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAGA,cAAc,2CAA2C,CAAC;AAC1D,cAAc,+CAA+C,CAAC;AAC9D,cAAc,gDAAgD,CAAC;AAC/D,cAAc,wCAAwC,CAAC;AACvD,cAAc,sCAAsC,CAAC;AAGrD,cAAc,iCAAiC,CAAC;AAChD,cAAc,iCAAiC,CAAC;AAChD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,iDAAiD,CAAC;AAChE,cAAc,6CAA6C,CAAC;AAC5D,cAAc,+BAA+B,CAAC;AAC9C,cAAc,sCAAsC,CAAC;AACrD,cAAc,uCAAuC,CAAC;AACtD,cAAc,yCAAyC,CAAC;AACxD,cAAc,kCAAkC,CAAC;AACjD,cAAc,uCAAuC,CAAC;AACtD,cAAc,iCAAiC,CAAC;AAChD,cAAc,kCAAkC,CAAC;AACjD,cAAc,uCAAuC,CAAC;AACtD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,iDAAiD,CAAC;AAChE,cAAc,qCAAqC,CAAC;AACpD,cAAc,2CAA2C,CAAC;AAC1D,cAAc,gDAAgD,CAAC;AAC/D,cAAc,yCAAyC,CAAC;AACxD,cAAc,4CAA4C,CAAC;AAC3D,cAAc,gCAAgC,CAAC;AAG/C,cAAc,2CAA2C,CAAC;AAC1D,cAAc,qCAAqC,CAAC;AACpD,cAAc,uCAAuC,CAAC;AACtD,cAAc,6CAA6C,CAAC;AAC5D,cAAc,wCAAwC,CAAC;AAGvD,cAAc,gDAAgD,CAAC;AAC/D,cAAc,uCAAuC,CAAC;AACtD,cAAc,gDAAgD,CAAC;AAI/D,cAAc,mCAAmC,CAAC;AAClD,cAAc,+BAA+B,CAAC;AAC9C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,yBAAyB,CAAC;AACxC,cAAc,mCAAmC,CAAC;AAClD,cAAc,uCAAuC,CAAC;AACtD,cAAc,0CAA0C,CAAC;AACzD,cAAc,wCAAwC,CAAC;AAGvD,cAAc,mCAAmC,CAAC;AAClD,cAAc,oCAAoC,CAAC;AACnD,cAAc,uCAAuC,CAAC;AAGtD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,0BAA0B,CAAC;AACzC,cAAc,kCAAkC,CAAC;AAKjD,cAAc,0DAA0D,CAAC;AACzE,cAAc,4DAA4D,CAAC;AAC3E,cAAc,6DAA6D,CAAC;AAC5E,cAAc,+DAA+D,CAAC;AAC9E,cAAc,8CAA8C,CAAC;AAC7D,cAAc,0DAA0D,CAAC;AACzE,cAAc,2DAA2D,CAAC;AAC1E,cAAc,6CAA6C,CAAC;AAC5D,cAAc,4CAA4C,CAAC;AAC3D,cAAc,oDAAoD,CAAC;AACnE,cAAc,sDAAsD,CAAC;AACrE,cAAc,uEAAuE,CAAC;AACtF,cAAc,mEAAmE,CAAC;AAGlF,cAAc,iEAAiE,CAAC;AAChF,cAAc,0DAA0D,CAAC;AACzE,cAAc,wDAAwD,CAAC;AAGvE,cAAc,yCAAyC,CAAC;AACxD,cAAc,2CAA2C,CAAC;AAG1D,cAAc,2CAA2C,CAAC;AAC1D,cAAc,+CAA+C,CAAC;AAC9D,cAAc,kDAAkD,CAAC;AACjE,cAAc,uDAAuD,CAAC;AACtE,cAAc,gDAAgD,CAAC;AAC/D,cAAc,qDAAqD,CAAC;AACpE,cAAc,mDAAmD,CAAC;AAClE,cAAc,qDAAqD,CAAC;AACpE,cAAc,sDAAsD,CAAC;AACrE,cAAc,0DAA0D,CAAC;AACzE,cAAc,yDAAyD,CAAC;AACxE,cAAc,sDAAsD,CAAC;AACrE,cAAc,uDAAuD,CAAC;AACtE,cAAc,sCAAsC,CAAC;AACrD,cAAc,8CAA8C,CAAC;AAC7D,cAAc,+CAA+C,CAAC;AAC9D,cAAc,6CAA6C,CAAC;AAC5D,cAAc,8CAA8C,CAAC;AAC7D,cAAc,wDAAwD,CAAC;AACvE,cAAc,wCAAwC,CAAC;AAGvD,cAAc,gEAAgE,CAAC;AAC/E,cAAc,4DAA4D,CAAC;AAG3E,cAAc,gCAAgC,CAAC;AAC/C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,8BAA8B,CAAC"}
1
+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAGA,cAAc,2CAA2C,CAAC;AAC1D,cAAc,+CAA+C,CAAC;AAC9D,cAAc,gDAAgD,CAAC;AAC/D,cAAc,wCAAwC,CAAC;AACvD,cAAc,sCAAsC,CAAC;AAGrD,cAAc,iCAAiC,CAAC;AAChD,cAAc,iCAAiC,CAAC;AAChD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,iDAAiD,CAAC;AAChE,cAAc,6CAA6C,CAAC;AAC5D,cAAc,+BAA+B,CAAC;AAC9C,cAAc,sCAAsC,CAAC;AACrD,cAAc,uCAAuC,CAAC;AACtD,cAAc,yCAAyC,CAAC;AACxD,cAAc,kCAAkC,CAAC;AACjD,cAAc,uCAAuC,CAAC;AACtD,cAAc,iCAAiC,CAAC;AAChD,cAAc,kCAAkC,CAAC;AACjD,cAAc,uCAAuC,CAAC;AACtD,cAAc,6CAA6C,CAAC;AAC5D,cAAc,gCAAgC,CAAC;AAC/C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,iDAAiD,CAAC;AAChE,cAAc,qCAAqC,CAAC;AACpD,cAAc,2CAA2C,CAAC;AAC1D,cAAc,gDAAgD,CAAC;AAC/D,cAAc,yCAAyC,CAAC;AACxD,cAAc,4CAA4C,CAAC;AAC3D,cAAc,gCAAgC,CAAC;AAG/C,cAAc,2CAA2C,CAAC;AAC1D,cAAc,qCAAqC,CAAC;AACpD,cAAc,uCAAuC,CAAC;AACtD,cAAc,6CAA6C,CAAC;AAC5D,cAAc,wCAAwC,CAAC;AAGvD,cAAc,gDAAgD,CAAC;AAC/D,cAAc,uCAAuC,CAAC;AACtD,cAAc,gDAAgD,CAAC;AAI/D,cAAc,mCAAmC,CAAC;AAClD,cAAc,+BAA+B,CAAC;AAC9C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,yBAAyB,CAAC;AACxC,cAAc,mCAAmC,CAAC;AAClD,cAAc,uCAAuC,CAAC;AACtD,cAAc,0CAA0C,CAAC;AACzD,cAAc,wCAAwC,CAAC;AAGvD,cAAc,mCAAmC,CAAC;AAClD,cAAc,oCAAoC,CAAC;AACnD,cAAc,uCAAuC,CAAC;AAGtD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,0BAA0B,CAAC;AACzC,cAAc,kCAAkC,CAAC;AAKjD,cAAc,0DAA0D,CAAC;AACzE,cAAc,4DAA4D,CAAC;AAC3E,cAAc,6DAA6D,CAAC;AAC5E,cAAc,+DAA+D,CAAC;AAC9E,cAAc,8CAA8C,CAAC;AAC7D,cAAc,0DAA0D,CAAC;AACzE,cAAc,2DAA2D,CAAC;AAC1E,cAAc,6CAA6C,CAAC;AAC5D,cAAc,4CAA4C,CAAC;AAC3D,cAAc,oDAAoD,CAAC;AACnE,cAAc,sDAAsD,CAAC;AACrE,cAAc,uEAAuE,CAAC;AACtF,cAAc,mEAAmE,CAAC;AAGlF,cAAc,iEAAiE,CAAC;AAChF,cAAc,0DAA0D,CAAC;AACzE,cAAc,wDAAwD,CAAC;AAGvE,cAAc,yCAAyC,CAAC;AACxD,cAAc,2CAA2C,CAAC;AAG1D,cAAc,2CAA2C,CAAC;AAC1D,cAAc,+CAA+C,CAAC;AAC9D,cAAc,kDAAkD,CAAC;AACjE,cAAc,uDAAuD,CAAC;AACtE,cAAc,gDAAgD,CAAC;AAC/D,cAAc,qDAAqD,CAAC;AACpE,cAAc,mDAAmD,CAAC;AAClE,cAAc,qDAAqD,CAAC;AACpE,cAAc,sDAAsD,CAAC;AACrE,cAAc,0DAA0D,CAAC;AACzE,cAAc,yDAAyD,CAAC;AACxE,cAAc,sDAAsD,CAAC;AACrE,cAAc,uDAAuD,CAAC;AACtE,cAAc,sCAAsC,CAAC;AACrD,cAAc,8CAA8C,CAAC;AAC7D,cAAc,+CAA+C,CAAC;AAC9D,cAAc,6CAA6C,CAAC;AAC5D,cAAc,8CAA8C,CAAC;AAC7D,cAAc,wDAAwD,CAAC;AACvE,cAAc,wCAAwC,CAAC;AAGvD,cAAc,gEAAgE,CAAC;AAC/E,cAAc,4DAA4D,CAAC;AAG3E,cAAc,gCAAgC,CAAC;AAC/C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,8BAA8B,CAAC"}
package/build/index.js CHANGED
@@ -23,6 +23,7 @@ tslib_1.__exportStar(require("./_collections/utils/require-env.util"), exports);
23
23
  tslib_1.__exportStar(require("./_collections/utils/stack.util"), exports);
24
24
  tslib_1.__exportStar(require("./_collections/utils/string.util"), exports);
25
25
  tslib_1.__exportStar(require("./_collections/utils/string-case.util"), exports);
26
+ tslib_1.__exportStar(require("./_collections/utils/string-similarity.util"), exports);
26
27
  tslib_1.__exportStar(require("./_collections/utils/enum.util"), exports);
27
28
  tslib_1.__exportStar(require("./_collections/utils/time.util"), exports);
28
29
  tslib_1.__exportStar(require("./_collections/utils/type-cloning-facility.util"), exports);
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AACA,cAAc;AACd,wBAAwB;AACxB,oFAA0D;AAC1D,wFAA8D;AAC9D,yFAA+D;AAC/D,iFAAuD;AACvD,+EAAqD;AAErD,oBAAoB;AACpB,0EAAgD;AAChD,0EAAgD;AAChD,yEAA+C;AAC/C,0FAAgE;AAChE,sFAA4D;AAC5D,wEAA8C;AAC9C,+EAAqD;AACrD,gFAAsD;AACtD,kFAAwD;AACxD,2EAAiD;AACjD,gFAAsD;AACtD,0EAAgD;AAChD,2EAAiD;AACjD,gFAAsD;AACtD,yEAA+C;AAC/C,yEAA+C;AAC/C,0FAAgE;AAChE,8EAAoD;AACpD,oFAA0D;AAC1D,yFAA+D;AAC/D,kFAAwD;AACxD,qFAA2D;AAC3D,yEAA+C;AAE/C,yBAAyB;AACzB,oFAA0D;AAC1D,8EAAoD;AACpD,gFAAsD;AACtD,sFAA4D;AAC5D,iFAAuD;AAEvD,2BAA2B;AAC3B,yFAA+D;AAC/D,gFAAsD;AACtD,yFAA+D;AAG/D,QAAQ;AACR,4EAAkD;AAClD,wEAA8C;AAC9C,yEAA+C;AAC/C,oEAA0C;AAC1C,qEAA2C;AAC3C,kEAAwC;AACxC,4EAAkD;AAClD,gFAAsD;AACtD,mFAAyD;AACzD,iFAAuD;AAEvD,aAAa;AACb,4EAAkD;AAClD,6EAAmD;AACnD,gFAAsD;AAEtD,aAAa;AACb,yEAA+C;AAC/C,mEAAyC;AACzC,2EAAiD;AAGjD,SAAS;AACT,wBAAwB;AACxB,mGAAyE;AACzE,qGAA2E;AAC3E,sGAA4E;AAC5E,wGAA8E;AAC9E,uFAA6D;AAC7D,mGAAyE;AACzE,oGAA0E;AAC1E,sFAA4D;AAC5D,qFAA2D;AAC3D,6FAAmE;AACnE,+FAAqE;AACrE,gHAAsF;AACtF,4GAAkF;AAElF,6BAA6B;AAC7B,0GAAgF;AAChF,mGAAyE;AACzE,iGAAuE;AAEvE,qBAAqB;AACrB,kFAAwD;AACxD,oFAA0D;AAE1D,oBAAoB;AACpB,oFAA0D;AAC1D,wFAA8D;AAC9D,2FAAiE;AACjE,gGAAsE;AACtE,yFAA+D;AAC/D,8FAAoE;AACpE,4FAAkE;AAClE,8FAAoE;AACpE,+FAAqE;AACrE,mGAAyE;AACzE,kGAAwE;AACxE,+FAAqE;AACrE,gGAAsE;AACtE,+EAAqD;AACrD,uFAA6D;AAC7D,wFAA8D;AAC9D,sFAA4D;AAC5D,uFAA6D;AAC7D,iGAAuE;AACvE,iFAAuD;AAEvD,gCAAgC;AAChC,yGAA+E;AAC/E,qGAA2E;AAE3E,eAAe;AACf,yEAA+C;AAC/C,uEAA6C;AAC7C,yEAA+C;AAC/C,uEAA6C"}
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AACA,cAAc;AACd,wBAAwB;AACxB,oFAA0D;AAC1D,wFAA8D;AAC9D,yFAA+D;AAC/D,iFAAuD;AACvD,+EAAqD;AAErD,oBAAoB;AACpB,0EAAgD;AAChD,0EAAgD;AAChD,yEAA+C;AAC/C,0FAAgE;AAChE,sFAA4D;AAC5D,wEAA8C;AAC9C,+EAAqD;AACrD,gFAAsD;AACtD,kFAAwD;AACxD,2EAAiD;AACjD,gFAAsD;AACtD,0EAAgD;AAChD,2EAAiD;AACjD,gFAAsD;AACtD,sFAA4D;AAC5D,yEAA+C;AAC/C,yEAA+C;AAC/C,0FAAgE;AAChE,8EAAoD;AACpD,oFAA0D;AAC1D,yFAA+D;AAC/D,kFAAwD;AACxD,qFAA2D;AAC3D,yEAA+C;AAE/C,yBAAyB;AACzB,oFAA0D;AAC1D,8EAAoD;AACpD,gFAAsD;AACtD,sFAA4D;AAC5D,iFAAuD;AAEvD,2BAA2B;AAC3B,yFAA+D;AAC/D,gFAAsD;AACtD,yFAA+D;AAG/D,QAAQ;AACR,4EAAkD;AAClD,wEAA8C;AAC9C,yEAA+C;AAC/C,oEAA0C;AAC1C,qEAA2C;AAC3C,kEAAwC;AACxC,4EAAkD;AAClD,gFAAsD;AACtD,mFAAyD;AACzD,iFAAuD;AAEvD,aAAa;AACb,4EAAkD;AAClD,6EAAmD;AACnD,gFAAsD;AAEtD,aAAa;AACb,yEAA+C;AAC/C,mEAAyC;AACzC,2EAAiD;AAGjD,SAAS;AACT,wBAAwB;AACxB,mGAAyE;AACzE,qGAA2E;AAC3E,sGAA4E;AAC5E,wGAA8E;AAC9E,uFAA6D;AAC7D,mGAAyE;AACzE,oGAA0E;AAC1E,sFAA4D;AAC5D,qFAA2D;AAC3D,6FAAmE;AACnE,+FAAqE;AACrE,gHAAsF;AACtF,4GAAkF;AAElF,6BAA6B;AAC7B,0GAAgF;AAChF,mGAAyE;AACzE,iGAAuE;AAEvE,qBAAqB;AACrB,kFAAwD;AACxD,oFAA0D;AAE1D,oBAAoB;AACpB,oFAA0D;AAC1D,wFAA8D;AAC9D,2FAAiE;AACjE,gGAAsE;AACtE,yFAA+D;AAC/D,8FAAoE;AACpE,4FAAkE;AAClE,8FAAoE;AACpE,+FAAqE;AACrE,mGAAyE;AACzE,kGAAwE;AACxE,+FAAqE;AACrE,gGAAsE;AACtE,+EAAqD;AACrD,uFAA6D;AAC7D,wFAA8D;AAC9D,sFAA4D;AAC5D,uFAA6D;AAC7D,iGAAuE;AACvE,iFAAuD;AAEvD,gCAAgC;AAChC,yGAA+E;AAC/E,qGAA2E;AAE3E,eAAe;AACf,yEAA+C;AAC/C,uEAA6C;AAC7C,yEAA+C;AAC/C,uEAA6C"}
@@ -0,0 +1,84 @@
1
+ /**
2
+ * BFR-LOGOSZ-003 — the edit distance (Levenshtein) of two texts and a similarity score from it.
3
+ *
4
+ * @description Measured before (2026-10-24): neither `fsm-dynamo` nor `nts-dynamo` had one, and two projects kept
5
+ * their own copy (the FAM `FAM_FuzzyMatch_Util`, the Logosz `LGZ_Duplicate_Util.editDistance`). The texts are
6
+ * compared by code points (`Array.from`), so an accented letter or an emoji is one character. No normalization is
7
+ * done here (case, accents, spaces): the caller normalizes first when it needs to.
8
+ *
9
+ * @example
10
+ * ```ts
11
+ * DyFM_StringSimilarity_Util.editDistance('kutya', 'kutyak'); // 1
12
+ * DyFM_StringSimilarity_Util.boundedEditDistance({ a: 'macska', b: 'kutya', maxDistance: 1 }); // 2 (= "more than 1")
13
+ * DyFM_StringSimilarity_Util.similarity('kutya', 'kutyak'); // 0.8333…
14
+ * ```
15
+ */
16
+ export class DyFM_StringSimilarity_Util {
17
+ /**
18
+ * The number of single-character insertions, deletions and substitutions that turn `a` into `b`.
19
+ *
20
+ * @param a the first text
21
+ * @param b the second text
22
+ */
23
+ static editDistance(a, b) {
24
+ return DyFM_StringSimilarity_Util.distance(Array.from(a ?? ''), Array.from(b ?? ''), Infinity);
25
+ }
26
+ /**
27
+ * The edit distance, but only up to `maxDistance`: above it the computation stops early and `maxDistance + 1` is
28
+ * returned (= "farther than allowed"). For "do these differ in at most N letters?" over many pairs.
29
+ *
30
+ * @param set.a the first text
31
+ * @param set.b the second text
32
+ * @param set.maxDistance the largest distance of interest (0 or more)
33
+ */
34
+ static boundedEditDistance(set) {
35
+ const limit = Math.max(0, Math.floor(set.maxDistance));
36
+ return DyFM_StringSimilarity_Util.distance(Array.from(set.a ?? ''), Array.from(set.b ?? ''), limit);
37
+ }
38
+ /**
39
+ * The similarity of two texts, `0..1`: `1 - editDistance / the longer length`. Two identical texts (two empty ones
40
+ * included) give `1`; an empty and a non-empty one give `0`.
41
+ *
42
+ * @param a the first text
43
+ * @param b the second text
44
+ */
45
+ static similarity(a, b) {
46
+ const charsA = Array.from(a ?? '');
47
+ const charsB = Array.from(b ?? '');
48
+ const longer = Math.max(charsA.length, charsB.length);
49
+ if (!longer) {
50
+ return 1;
51
+ }
52
+ return 1 - DyFM_StringSimilarity_Util.distance(charsA, charsB, Infinity) / longer;
53
+ }
54
+ /**
55
+ * The Levenshtein distance over two rows; stops when a whole row is already above `limit` (then `limit + 1`).
56
+ *
57
+ * @param a the first text's characters
58
+ * @param b the second text's characters
59
+ * @param limit the largest distance of interest (`Infinity`: no limit)
60
+ */
61
+ static distance(a, b, limit) {
62
+ // the length difference alone is a lower bound
63
+ if (Math.abs(a.length - b.length) > limit) {
64
+ return limit + 1;
65
+ }
66
+ let previous = Array.from({ length: b.length + 1 }, (_value, index) => index);
67
+ for (let i = 1; i <= a.length; i++) {
68
+ const current = [i];
69
+ let rowMin = i;
70
+ for (let j = 1; j <= b.length; j++) {
71
+ const cost = a[i - 1] === b[j - 1] ? 0 : 1;
72
+ current[j] = Math.min(previous[j] + 1, current[j - 1] + 1, previous[j - 1] + cost);
73
+ rowMin = Math.min(rowMin, current[j]);
74
+ }
75
+ // every path goes through this row: nothing below `rowMin` can come later
76
+ if (rowMin > limit) {
77
+ return limit + 1;
78
+ }
79
+ previous = current;
80
+ }
81
+ const result = previous[b.length];
82
+ return result > limit ? limit + 1 : result;
83
+ }
84
+ }
@@ -20,6 +20,7 @@ export * from './_collections/utils/require-env.util';
20
20
  export * from './_collections/utils/stack.util';
21
21
  export * from './_collections/utils/string.util';
22
22
  export * from './_collections/utils/string-case.util';
23
+ export * from './_collections/utils/string-similarity.util';
23
24
  export * from './_collections/utils/enum.util';
24
25
  export * from './_collections/utils/time.util';
25
26
  export * from './_collections/utils/type-cloning-facility.util';
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@futdevpro/fsm-dynamo",
3
- "version": "1.20.177",
3
+ "version": "1.20.179",
4
4
  "description": "Full Stack Model Collection for Dynamic (NodeJS-Typescript) Framework called Dynamo, by Future Development Ltd.",
5
5
  "DyBu_settings": {
6
6
  "packageType": "full-stack-package",
@@ -372,7 +372,7 @@
372
372
  "uuid": "~11.1.1"
373
373
  },
374
374
  "devDependencies": {
375
- "@futdevpro/dynamo-eslint": "1.20.76",
375
+ "@futdevpro/dynamo-eslint": "1.20.78",
376
376
  "@types/jasmine": "~4.3.5",
377
377
  "@typescript-eslint/eslint-plugin": "^8.41.0",
378
378
  "@typescript-eslint/parser": "^8.41.0",