cmpstr 3.2.2 → 3.3.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.
Files changed (86) hide show
  1. package/dist/CmpStr.esm.js +2149 -1721
  2. package/dist/CmpStr.esm.min.js +2 -2
  3. package/dist/CmpStr.umd.js +2028 -1604
  4. package/dist/CmpStr.umd.min.js +2 -2
  5. package/dist/cjs/CmpStr.cjs +100 -51
  6. package/dist/cjs/CmpStrAsync.cjs +35 -18
  7. package/dist/cjs/index.cjs +1 -1
  8. package/dist/cjs/metric/Cosine.cjs +1 -1
  9. package/dist/cjs/metric/DamerauLevenshtein.cjs +1 -1
  10. package/dist/cjs/metric/DiceSorensen.cjs +1 -1
  11. package/dist/cjs/metric/Hamming.cjs +1 -1
  12. package/dist/cjs/metric/Jaccard.cjs +1 -1
  13. package/dist/cjs/metric/JaroWinkler.cjs +1 -1
  14. package/dist/cjs/metric/LCS.cjs +1 -1
  15. package/dist/cjs/metric/Levenshtein.cjs +1 -1
  16. package/dist/cjs/metric/Metric.cjs +40 -22
  17. package/dist/cjs/metric/NeedlemanWunsch.cjs +1 -1
  18. package/dist/cjs/metric/QGram.cjs +1 -1
  19. package/dist/cjs/metric/SmithWaterman.cjs +1 -1
  20. package/dist/cjs/phonetic/Caverphone.cjs +1 -1
  21. package/dist/cjs/phonetic/Cologne.cjs +1 -1
  22. package/dist/cjs/phonetic/Metaphone.cjs +1 -1
  23. package/dist/cjs/phonetic/Phonetic.cjs +27 -15
  24. package/dist/cjs/phonetic/Soundex.cjs +1 -1
  25. package/dist/cjs/root.cjs +4 -2
  26. package/dist/cjs/utils/DeepMerge.cjs +102 -97
  27. package/dist/cjs/utils/DiffChecker.cjs +1 -1
  28. package/dist/cjs/utils/Errors.cjs +22 -19
  29. package/dist/cjs/utils/Filter.cjs +59 -24
  30. package/dist/cjs/utils/HashTable.cjs +44 -29
  31. package/dist/cjs/utils/Normalizer.cjs +57 -28
  32. package/dist/cjs/utils/OptionsValidator.cjs +211 -0
  33. package/dist/cjs/utils/Pool.cjs +27 -13
  34. package/dist/cjs/utils/Profiler.cjs +41 -27
  35. package/dist/cjs/utils/Registry.cjs +5 -5
  36. package/dist/cjs/utils/StructuredData.cjs +83 -53
  37. package/dist/cjs/utils/TextAnalyzer.cjs +1 -1
  38. package/dist/esm/CmpStr.mjs +101 -52
  39. package/dist/esm/CmpStrAsync.mjs +35 -18
  40. package/dist/esm/index.mjs +1 -1
  41. package/dist/esm/metric/Cosine.mjs +1 -1
  42. package/dist/esm/metric/DamerauLevenshtein.mjs +1 -1
  43. package/dist/esm/metric/DiceSorensen.mjs +1 -1
  44. package/dist/esm/metric/Hamming.mjs +1 -1
  45. package/dist/esm/metric/Jaccard.mjs +1 -1
  46. package/dist/esm/metric/JaroWinkler.mjs +1 -1
  47. package/dist/esm/metric/LCS.mjs +1 -1
  48. package/dist/esm/metric/Levenshtein.mjs +1 -1
  49. package/dist/esm/metric/Metric.mjs +40 -22
  50. package/dist/esm/metric/NeedlemanWunsch.mjs +1 -1
  51. package/dist/esm/metric/QGram.mjs +1 -1
  52. package/dist/esm/metric/SmithWaterman.mjs +1 -1
  53. package/dist/esm/phonetic/Caverphone.mjs +1 -1
  54. package/dist/esm/phonetic/Cologne.mjs +1 -1
  55. package/dist/esm/phonetic/Metaphone.mjs +1 -1
  56. package/dist/esm/phonetic/Phonetic.mjs +30 -15
  57. package/dist/esm/phonetic/Soundex.mjs +1 -1
  58. package/dist/esm/root.mjs +3 -3
  59. package/dist/esm/utils/DeepMerge.mjs +103 -94
  60. package/dist/esm/utils/DiffChecker.mjs +1 -1
  61. package/dist/esm/utils/Errors.mjs +22 -19
  62. package/dist/esm/utils/Filter.mjs +59 -24
  63. package/dist/esm/utils/HashTable.mjs +44 -29
  64. package/dist/esm/utils/Normalizer.mjs +57 -28
  65. package/dist/esm/utils/OptionsValidator.mjs +210 -0
  66. package/dist/esm/utils/Pool.mjs +27 -13
  67. package/dist/esm/utils/Profiler.mjs +41 -27
  68. package/dist/esm/utils/Registry.mjs +5 -5
  69. package/dist/esm/utils/StructuredData.mjs +83 -53
  70. package/dist/esm/utils/TextAnalyzer.mjs +1 -1
  71. package/dist/types/CmpStr.d.ts +22 -15
  72. package/dist/types/CmpStrAsync.d.ts +3 -0
  73. package/dist/types/index.d.ts +3 -3
  74. package/dist/types/metric/Metric.d.ts +9 -9
  75. package/dist/types/phonetic/Phonetic.d.ts +4 -3
  76. package/dist/types/root.d.ts +3 -2
  77. package/dist/types/utils/DeepMerge.d.ts +80 -58
  78. package/dist/types/utils/Errors.d.ts +25 -8
  79. package/dist/types/utils/Filter.d.ts +4 -1
  80. package/dist/types/utils/HashTable.d.ts +12 -11
  81. package/dist/types/utils/Normalizer.d.ts +2 -1
  82. package/dist/types/utils/OptionsValidator.d.ts +193 -0
  83. package/dist/types/utils/Profiler.d.ts +9 -28
  84. package/dist/types/utils/StructuredData.d.ts +3 -0
  85. package/dist/types/utils/Types.d.ts +13 -1
  86. package/package.json +14 -5
@@ -1,22 +1,35 @@
1
- // CmpStr v3.2.2 build-bb61120-260311 by Paul Köhler @komed3 / MIT License
1
+ // CmpStr v3.3.0 build-3699f85-260318 by Paul Köhler @komed3 / MIT License
2
2
  'use strict';
3
3
 
4
4
  class CmpStrError extends Error {
5
5
  code;
6
6
  meta;
7
- cause;
8
7
  when = new Date().toISOString();
9
8
  constructor(code, message, meta, cause) {
10
- super(message);
9
+ super(message, cause !== undefined ? { cause } : undefined);
11
10
  this.name = this.constructor.name;
12
11
  this.code = code;
13
12
  this.meta = meta;
14
- this.cause = cause;
15
13
  if (typeof Error.captureStackTrace === 'function') {
16
14
  Error.captureStackTrace(this, this.constructor);
17
15
  }
18
16
  }
19
- toJSON() {
17
+ format(stack = false) {
18
+ const parts = [`${this.name} [${this.code}]`, this.message];
19
+ if (this.meta)
20
+ for (const _ in this.meta) {
21
+ parts.push(JSON.stringify(this.meta));
22
+ break;
23
+ }
24
+ return (
25
+ parts.join(' - ') +
26
+ (stack && this.stack ? `\nStack Trace:\n${this.stack}` : '')
27
+ );
28
+ }
29
+ toString() {
30
+ return this.format(false);
31
+ }
32
+ toJSON(stack = false) {
20
33
  return {
21
34
  name: this.name,
22
35
  code: this.code,
@@ -28,23 +41,11 @@ class CmpStrError extends Error {
28
41
  ? {
29
42
  name: this.cause.name,
30
43
  message: this.cause.message,
31
- stack: this.cause.stack
44
+ stack: stack && this.cause.stack
32
45
  }
33
46
  : this.cause
34
47
  };
35
48
  }
36
- toString(stack = false) {
37
- const parts = [`${this.name} [${this.code}]`, this.message];
38
- if (this.meta && Object.keys(this.meta).length) {
39
- try {
40
- parts.push(JSON.stringify(this.meta));
41
- } catch {}
42
- }
43
- return (
44
- parts.join(' - ') +
45
- (stack && this.stack ? `\nStack Trace:\n${this.stack}` : '')
46
- );
47
- }
48
49
  }
49
50
  class CmpStrValidationError extends CmpStrError {
50
51
  constructor(message, meta, cause) {
@@ -70,7 +71,7 @@ class ErrorUtil {
70
71
  static assert(condition, message, meta) {
71
72
  if (!condition) throw new CmpStrUsageError(message, meta);
72
73
  }
73
- static create(err, message, meta) {
74
+ static rethrow(err, message, meta) {
74
75
  if (err instanceof CmpStrError) throw err;
75
76
  throw new CmpStrInternalError(message, meta, err);
76
77
  }
@@ -83,6 +84,7 @@ class ErrorUtil {
83
84
  try {
84
85
  return fn();
85
86
  } catch (err) {
87
+ if (err instanceof CmpStrError) throw err;
86
88
  throw new CmpStrInternalError(message, meta, err);
87
89
  }
88
90
  }
@@ -90,6 +92,7 @@ class ErrorUtil {
90
92
  try {
91
93
  return await fn();
92
94
  } catch (err) {
95
+ if (err instanceof CmpStrError) throw err;
93
96
  throw new CmpStrInternalError(message, meta, err);
94
97
  }
95
98
  }
@@ -1,23 +1,35 @@
1
- // CmpStr v3.2.2 build-bb61120-260311 by Paul Köhler @komed3 / MIT License
1
+ // CmpStr v3.3.0 build-3699f85-260318 by Paul Köhler @komed3 / MIT License
2
2
  'use strict';
3
3
 
4
4
  var Errors = require('./Errors.cjs');
5
5
 
6
6
  class Filter {
7
+ static IDENTITY = (s) => s;
7
8
  static filters = new Map();
8
9
  static pipeline = new Map();
9
- static getPipeline(hook) {
10
+ static getPipeline(hook, force = false) {
10
11
  return Errors.ErrorUtil.wrap(
11
12
  () => {
12
- const cached = Filter.pipeline.get(hook);
13
- if (cached) return cached;
13
+ if (!force) {
14
+ const cached = Filter.pipeline.get(hook);
15
+ if (cached) return cached;
16
+ }
14
17
  const filter = Filter.filters.get(hook);
15
- if (!filter) return (s) => s;
16
- const pipeline = Array.from(filter.values())
17
- .filter((f) => f.active)
18
- .sort((a, b) => a.priority - b.priority)
19
- .map((f) => f.fn);
20
- const fn = (input) => pipeline.reduce((v, f) => f(v), input);
18
+ if (!filter) {
19
+ Filter.pipeline.set(hook, Filter.IDENTITY);
20
+ return Filter.IDENTITY;
21
+ }
22
+ const pipeline = [];
23
+ for (const f of filter.values()) if (f.active) pipeline.push(f);
24
+ pipeline.sort((a, b) => a.priority - b.priority);
25
+ const fn =
26
+ pipeline.length === 0
27
+ ? Filter.IDENTITY
28
+ : (input) => {
29
+ let v = input;
30
+ for (let i = 0; i < pipeline.length; i++) v = pipeline[i].fn(v);
31
+ return v;
32
+ };
21
33
  Filter.pipeline.set(hook, fn);
22
34
  return fn;
23
35
  },
@@ -35,9 +47,16 @@ class Filter {
35
47
  const filter = Filter.filters.get(hook) ?? new Map();
36
48
  const index = filter.get(id);
37
49
  if (index && !index.overrideable) return false;
50
+ if (
51
+ index &&
52
+ index.fn === fn &&
53
+ index.priority === priority &&
54
+ index.active === active
55
+ )
56
+ return true;
38
57
  filter.set(id, { id, fn, priority, active, overrideable });
39
58
  Filter.filters.set(hook, filter);
40
- Filter.pipeline.delete(hook);
59
+ Filter.getPipeline(hook, true);
41
60
  return true;
42
61
  },
43
62
  `Error adding filter <${id}> to hook <${hook}>`,
@@ -45,19 +64,28 @@ class Filter {
45
64
  );
46
65
  }
47
66
  static remove(hook, id) {
48
- Filter.pipeline.delete(hook);
49
67
  const filter = Filter.filters.get(hook);
50
- return filter ? filter.delete(id) : false;
68
+ if (!filter || !filter.delete(id)) return false;
69
+ Filter.getPipeline(hook, true);
70
+ return true;
51
71
  }
52
72
  static pause(hook, id) {
53
- Filter.pipeline.delete(hook);
54
- const f = Filter.filters.get(hook)?.get(id);
55
- return !!(f && ((f.active = false), true));
73
+ const filter = Filter.filters.get(hook);
74
+ if (!filter) return false;
75
+ const f = filter.get(id);
76
+ if (!f || !f.active) return false;
77
+ f.active = false;
78
+ Filter.getPipeline(hook, true);
79
+ return true;
56
80
  }
57
81
  static resume(hook, id) {
58
- Filter.pipeline.delete(hook);
59
- const f = Filter.filters.get(hook)?.get(id);
60
- return !!(f && ((f.active = true), true));
82
+ const filter = Filter.filters.get(hook);
83
+ if (!filter) return false;
84
+ const f = filter.get(id);
85
+ if (!f || f.active) return false;
86
+ f.active = true;
87
+ Filter.getPipeline(hook, true);
88
+ return true;
61
89
  }
62
90
  static list(hook, active = false) {
63
91
  const filter = Filter.filters.get(hook);
@@ -70,7 +98,11 @@ class Filter {
70
98
  return Errors.ErrorUtil.wrap(
71
99
  () => {
72
100
  const fn = Filter.getPipeline(hook);
73
- return Array.isArray(input) ? input.map(fn) : fn(input);
101
+ if (typeof input === 'string') return fn(input);
102
+ const arr = input;
103
+ const out = new Array(arr.length);
104
+ for (let i = 0; i < arr.length; i++) out[i] = fn(arr[i]);
105
+ return out;
74
106
  },
75
107
  `Error applying filters for hook <${hook}>`,
76
108
  { hook, input }
@@ -80,16 +112,19 @@ class Filter {
80
112
  return Errors.ErrorUtil.wrapAsync(
81
113
  async () => {
82
114
  const fn = Filter.getPipeline(hook);
83
- return Array.isArray(input)
84
- ? Promise.all(input.map(fn))
85
- : Promise.resolve(fn(input));
115
+ if (typeof input === 'string') return Promise.resolve(fn(input));
116
+ const arr = input;
117
+ const out = new Array(arr.length);
118
+ for (let i = 0; i < arr.length; i++)
119
+ out[i] = Promise.resolve(fn(arr[i]));
120
+ return Promise.all(out);
86
121
  },
87
122
  `Error applying filters for hook <${hook}>`,
88
123
  { hook, input }
89
124
  );
90
125
  }
91
126
  static clear(hook) {
92
- Filter.pipeline.clear();
127
+ Filter.clearPipeline();
93
128
  if (hook) Filter.filters.delete(hook);
94
129
  else Filter.filters.clear();
95
130
  }
@@ -1,4 +1,4 @@
1
- // CmpStr v3.2.2 build-bb61120-260311 by Paul Köhler @komed3 / MIT License
1
+ // CmpStr v3.3.0 build-3699f85-260318 by Paul Köhler @komed3 / MIT License
2
2
  'use strict';
3
3
 
4
4
  class Hasher {
@@ -6,25 +6,21 @@ class Hasher {
6
6
  static HASH_OFFSET = 0x811c9dc5;
7
7
  static fastFNV1a(str) {
8
8
  const len = str.length;
9
+ const limit = len & -4;
9
10
  let hash = this.HASH_OFFSET;
10
- const chunks = Math.floor(len / 4);
11
- for (let i = 0; i < chunks; i++) {
12
- const pos = i * 4;
11
+ let i = 0;
12
+ for (; i < limit; i += 4) {
13
13
  const chunk =
14
- str.charCodeAt(pos) |
15
- (str.charCodeAt(pos + 1) << 8) |
16
- (str.charCodeAt(pos + 2) << 16) |
17
- (str.charCodeAt(pos + 3) << 24);
14
+ str.charCodeAt(i) |
15
+ (str.charCodeAt(i + 1) << 8) |
16
+ (str.charCodeAt(i + 2) << 16) |
17
+ (str.charCodeAt(i + 3) << 24);
18
18
  hash ^= chunk;
19
19
  hash = Math.imul(hash, this.FNV_PRIME);
20
20
  }
21
- const remaining = len % 4;
22
- if (remaining > 0) {
23
- const pos = chunks * 4;
24
- for (let i = 0; i < remaining; i++) {
25
- hash ^= str.charCodeAt(pos + i);
26
- hash = Math.imul(hash, this.FNV_PRIME);
27
- }
21
+ for (; i < len; i++) {
22
+ hash ^= str.charCodeAt(i);
23
+ hash = Math.imul(hash, this.FNV_PRIME);
28
24
  }
29
25
  hash ^= hash >>> 16;
30
26
  hash *= 0x85ebca6b;
@@ -35,32 +31,51 @@ class Hasher {
35
31
  }
36
32
  }
37
33
  class HashTable {
38
- LRU;
34
+ FIFO;
35
+ maxSize;
39
36
  static MAX_LEN = 2048;
40
- static TABLE_SIZE = 10_000;
41
37
  table = new Map();
42
- constructor(LRU = true) {
43
- this.LRU = LRU;
38
+ constructor(FIFO = true, maxSize = 10000) {
39
+ this.FIFO = FIFO;
40
+ this.maxSize = maxSize;
44
41
  }
45
42
  key(label, strs, sorted = false) {
46
- for (const str of strs) if (str.length > HashTable.MAX_LEN) return false;
47
- const hashes = strs.map((s) => Hasher.fastFNV1a(s));
48
- return [label, ...(sorted ? hashes.sort() : hashes)].join('-');
43
+ const n = strs.length;
44
+ const hashes = new Array(n);
45
+ for (let i = 0; i < n; i++) {
46
+ const s = strs[i];
47
+ if (s.length > HashTable.MAX_LEN) return false;
48
+ hashes[i] = Hasher.fastFNV1a(s);
49
+ }
50
+ if (sorted) hashes.sort((a, b) => a - b);
51
+ let key = label;
52
+ for (let i = 0; i < hashes.length; i++) key += '-' + hashes[i];
53
+ return key;
54
+ }
55
+ has(key) {
56
+ return this.table.has(key);
57
+ }
58
+ get(key) {
59
+ return this.table.get(key);
49
60
  }
50
- has = (key) => this.table.has(key);
51
- get = (key) => this.table.get(key);
52
61
  set(key, entry, update = true) {
53
62
  if (!update && this.table.has(key)) return false;
54
- while (!this.table.has(key) && this.table.size >= HashTable.TABLE_SIZE) {
55
- if (!this.LRU) return false;
63
+ if (!this.table.has(key) && this.table.size >= this.maxSize) {
64
+ if (!this.FIFO) return false;
56
65
  this.table.delete(this.table.keys().next().value);
57
66
  }
58
67
  this.table.set(key, entry);
59
68
  return true;
60
69
  }
61
- delete = (key) => this.table.delete(key);
62
- clear = () => this.table.clear();
63
- size = () => this.table.size;
70
+ delete(key) {
71
+ return this.table.delete(key);
72
+ }
73
+ clear() {
74
+ this.table.clear();
75
+ }
76
+ size() {
77
+ return this.table.size;
78
+ }
64
79
  }
65
80
 
66
81
  exports.HashTable = HashTable;
@@ -1,4 +1,4 @@
1
- // CmpStr v3.2.2 build-bb61120-260311 by Paul Köhler @komed3 / MIT License
1
+ // CmpStr v3.3.0 build-3699f85-260318 by Paul Köhler @komed3 / MIT License
2
2
  'use strict';
3
3
 
4
4
  var Errors = require('./Errors.cjs');
@@ -20,25 +20,49 @@ class Normalizer {
20
20
  static getPipeline(flags) {
21
21
  return Errors.ErrorUtil.wrap(
22
22
  () => {
23
- if (Normalizer.pipeline.has(flags))
24
- return Normalizer.pipeline.get(flags);
23
+ const cached = Normalizer.pipeline.get(flags);
24
+ if (cached) return cached;
25
25
  const { REGEX } = Normalizer;
26
- const steps = [
27
- ['d', (s) => s.normalize('NFD')],
28
- ['i', (s) => s.toLowerCase()],
29
- ['k', (s) => s.replace(REGEX.nonLetters, '')],
30
- ['n', (s) => s.replace(REGEX.nonNumbers, '')],
31
- ['r', (s) => s.replace(REGEX.doubleChars, '$1')],
32
- ['s', (s) => s.replace(REGEX.specialChars, '')],
33
- ['t', (s) => s.trim()],
34
- ['u', (s) => s.normalize('NFC')],
35
- ['w', (s) => s.replace(REGEX.whitespace, ' ')],
36
- ['x', (s) => s.normalize('NFKC')]
37
- ];
38
- const pipeline = steps
39
- .filter(([f]) => flags.includes(f))
40
- .map(([, fn]) => fn);
41
- const fn = (s) => pipeline.reduce((v, f) => f(v), s);
26
+ const steps = [];
27
+ for (let i = 0; i < flags.length; i++) {
28
+ switch (flags[i]) {
29
+ case 'd':
30
+ steps.push((s) => s.normalize('NFD'));
31
+ break;
32
+ case 'i':
33
+ steps.push((s) => s.toLowerCase());
34
+ break;
35
+ case 'k':
36
+ steps.push((s) => s.replace(REGEX.nonLetters, ''));
37
+ break;
38
+ case 'n':
39
+ steps.push((s) => s.replace(REGEX.nonNumbers, ''));
40
+ break;
41
+ case 'r':
42
+ steps.push((s) => s.replace(REGEX.doubleChars, '$1'));
43
+ break;
44
+ case 's':
45
+ steps.push((s) => s.replace(REGEX.specialChars, ''));
46
+ break;
47
+ case 't':
48
+ steps.push((s) => s.trim());
49
+ break;
50
+ case 'u':
51
+ steps.push((s) => s.normalize('NFC'));
52
+ break;
53
+ case 'w':
54
+ steps.push((s) => s.replace(REGEX.whitespace, ' '));
55
+ break;
56
+ case 'x':
57
+ steps.push((s) => s.normalize('NFKC'));
58
+ break;
59
+ }
60
+ }
61
+ const fn = (input) => {
62
+ let v = input;
63
+ for (let i = 0; i < steps.length; i++) v = steps[i](v);
64
+ return v;
65
+ };
42
66
  Normalizer.pipeline.set(flags, fn);
43
67
  return fn;
44
68
  },
@@ -46,18 +70,23 @@ class Normalizer {
46
70
  { flags }
47
71
  );
48
72
  }
49
- static normalize(input, flags) {
73
+ static normalize(input, flags, normalizedFlags) {
50
74
  return Errors.ErrorUtil.wrap(
51
75
  () => {
52
76
  if (!flags || typeof flags !== 'string' || !input) return input;
53
- flags = this.canonicalFlags(flags);
54
- if (Array.isArray(input))
55
- return input.map((s) => Normalizer.normalize(s, flags));
56
- const key = Normalizer.cache.key(flags, [input]);
57
- if (key && Normalizer.cache.has(key)) return Normalizer.cache.get(key);
58
- const res = Normalizer.getPipeline(flags)(input);
59
- if (key) Normalizer.cache.set(key, res);
60
- return res;
77
+ flags = normalizedFlags ?? this.canonicalFlags(flags);
78
+ const pipeline = Normalizer.getPipeline(flags);
79
+ const normalizeOne = (s) => {
80
+ const key = Normalizer.cache.key(flags, [s]);
81
+ if (key && Normalizer.cache.has(key))
82
+ return Normalizer.cache.get(key);
83
+ const res = pipeline(s);
84
+ if (key) Normalizer.cache.set(key, res);
85
+ return res;
86
+ };
87
+ return Array.isArray(input)
88
+ ? input.map(normalizeOne)
89
+ : normalizeOne(input);
61
90
  },
62
91
  `Failed to normalize input with flags: ${flags}`,
63
92
  { input, flags }
@@ -0,0 +1,211 @@
1
+ // CmpStr v3.3.0 build-3699f85-260318 by Paul Köhler @komed3 / MIT License
2
+ 'use strict';
3
+
4
+ var Errors = require('./Errors.cjs');
5
+ require('../metric/Cosine.cjs');
6
+ require('../metric/DamerauLevenshtein.cjs');
7
+ require('../metric/DiceSorensen.cjs');
8
+ require('../metric/Hamming.cjs');
9
+ require('../metric/Jaccard.cjs');
10
+ require('../metric/JaroWinkler.cjs');
11
+ require('../metric/LCS.cjs');
12
+ require('../metric/Levenshtein.cjs');
13
+ require('../metric/NeedlemanWunsch.cjs');
14
+ require('../metric/QGram.cjs');
15
+ require('../metric/SmithWaterman.cjs');
16
+ var Metric = require('../metric/Metric.cjs');
17
+ require('../phonetic/Caverphone.cjs');
18
+ require('../phonetic/Cologne.cjs');
19
+ require('../phonetic/Metaphone.cjs');
20
+ require('../phonetic/Soundex.cjs');
21
+ var Phonetic = require('../phonetic/Phonetic.cjs');
22
+
23
+ class OptionsValidator {
24
+ static ALLOWED_FLAGS = new Set([
25
+ 'd',
26
+ 'u',
27
+ 'x',
28
+ 'w',
29
+ 't',
30
+ 'r',
31
+ 's',
32
+ 'k',
33
+ 'n',
34
+ 'i'
35
+ ]);
36
+ static ALLOWED_OUTPUT = new Set(['orig', 'prep']);
37
+ static ALLOWED_MODES = new Set(['default', 'batch', 'single', 'pairwise']);
38
+ static ALLOWED_SORT = new Set(['asc', 'desc']);
39
+ static PROCESSORS = {
40
+ phonetic: (opt) => {
41
+ if (!opt) return;
42
+ OptionsValidator.validatePhoneticName(opt.algo);
43
+ OptionsValidator.validatePhoneticOptions(opt.opt);
44
+ }
45
+ };
46
+ static METRIC_OPT_MAP = {
47
+ mode: (v) => OptionsValidator.validateMode(v),
48
+ delimiter: (v) => OptionsValidator.validateString(v, 'opt.delimiter'),
49
+ pad: (v) => OptionsValidator.validateString(v, 'opt.pad'),
50
+ q: (v) => OptionsValidator.validateNumber(v, 'opt.q'),
51
+ match: (v) => OptionsValidator.validateNumber(v, 'opt.match'),
52
+ mismatch: (v) => OptionsValidator.validateNumber(v, 'opt.mismatch'),
53
+ gap: (v) => OptionsValidator.validateNumber(v, 'opt.gap')
54
+ };
55
+ static PHONETIC_OPT_MAP = {
56
+ map: (v) =>
57
+ OptionsValidator.validateString(v, 'processors.phonetic.opt.map'),
58
+ delimiter: (v) =>
59
+ OptionsValidator.validateString(v, 'processors.phonetic.opt.delimiter'),
60
+ length: (v) =>
61
+ OptionsValidator.validateNumber(v, 'processors.phonetic.opt.length'),
62
+ pad: (v) =>
63
+ OptionsValidator.validateString(v, 'processors.phonetic.opt.pad'),
64
+ dedupe: (v) =>
65
+ OptionsValidator.validateBoolean(v, 'processors.phonetic.opt.dedupe'),
66
+ fallback: (v) =>
67
+ OptionsValidator.validateString(v, 'processors.phonetic.opt.fallback')
68
+ };
69
+ static CMPSTR_OPT_MAP = {
70
+ raw: (v) => OptionsValidator.validateBoolean(v, 'raw'),
71
+ removeZero: (v) => OptionsValidator.validateBoolean(v, 'removeZero'),
72
+ safeEmpty: (v) => OptionsValidator.validateBoolean(v, 'safeEmpty'),
73
+ flags: (v) => OptionsValidator.validateFlags(v),
74
+ metric: (v) => OptionsValidator.validateMetricName(v),
75
+ output: (v) => OptionsValidator.validateOutput(v),
76
+ opt: (v) => OptionsValidator.validateMetricOptions(v),
77
+ processors: (v) => OptionsValidator.validateProcessors(v),
78
+ sort: (v) => OptionsValidator.validateSort(v, 'sort'),
79
+ objectsOnly: (v) => OptionsValidator.validateBoolean(v, 'objectsOnly')
80
+ };
81
+ static set2string(set) {
82
+ return Array.from(set).join(' | ');
83
+ }
84
+ static validateType(value, name, type) {
85
+ if (value === undefined) return;
86
+ if (typeof value !== type || (type === 'number' && Number.isNaN(value))) {
87
+ throw new Errors.CmpStrValidationError(
88
+ `Invalid option <${name}>: expected ${type}`,
89
+ { name, value }
90
+ );
91
+ }
92
+ }
93
+ static validateEnum(value, name, set) {
94
+ if (value === undefined) return;
95
+ if (typeof value !== 'string' || !set.has(value)) {
96
+ throw new Errors.CmpStrValidationError(
97
+ `Invalid option <${name}>: expected ${OptionsValidator.set2string(set)}`,
98
+ { name, value }
99
+ );
100
+ }
101
+ }
102
+ static validateMap(opt, map) {
103
+ if (!opt) return;
104
+ for (const k in opt) {
105
+ const fn = map[k];
106
+ if (!fn)
107
+ throw new Errors.CmpStrValidationError(`Invalid option <${k}>`, {
108
+ option: k,
109
+ value: map[k]
110
+ });
111
+ fn(opt[k]);
112
+ }
113
+ }
114
+ static validateRegistryName(value, name, label, has, list) {
115
+ if (value === undefined) return;
116
+ if (typeof value !== 'string' || value.length === 0)
117
+ throw new Errors.CmpStrValidationError(
118
+ `Invalid option <${name}>: expected non-empty string`,
119
+ { name, value }
120
+ );
121
+ if (!has(value))
122
+ throw new Errors.CmpStrValidationError(
123
+ `${label} <${value}> is not registered`,
124
+ { name, value, available: list() }
125
+ );
126
+ }
127
+ static validateBoolean(value, name) {
128
+ OptionsValidator.validateType(value, name, 'boolean');
129
+ }
130
+ static validateNumber(value, name) {
131
+ OptionsValidator.validateType(value, name, 'number');
132
+ }
133
+ static validateString(value, name) {
134
+ OptionsValidator.validateType(value, name, 'string');
135
+ }
136
+ static validateFlags(value) {
137
+ if (value === undefined) return;
138
+ if (typeof value !== 'string')
139
+ throw new Errors.CmpStrValidationError(
140
+ `Invalid option <flags>: expected string`,
141
+ { flags: value }
142
+ );
143
+ for (let i = 0; i < value.length; i++) {
144
+ const ch = value[i];
145
+ if (!OptionsValidator.ALLOWED_FLAGS.has(ch))
146
+ throw new Errors.CmpStrValidationError(
147
+ `Invalid normalization flag <${ch}> in <flags>: expected ${OptionsValidator.set2string(OptionsValidator.ALLOWED_FLAGS)}`,
148
+ { flags: value, invalid: ch }
149
+ );
150
+ }
151
+ }
152
+ static validateOutput(value) {
153
+ OptionsValidator.validateEnum(
154
+ value,
155
+ 'output',
156
+ OptionsValidator.ALLOWED_OUTPUT
157
+ );
158
+ }
159
+ static validateMode(value) {
160
+ OptionsValidator.validateEnum(
161
+ value,
162
+ 'mode',
163
+ OptionsValidator.ALLOWED_MODES
164
+ );
165
+ }
166
+ static validateSort(value, name) {
167
+ if (value === undefined || typeof value === 'boolean') return;
168
+ OptionsValidator.validateEnum(value, name, OptionsValidator.ALLOWED_SORT);
169
+ }
170
+ static validateMetricName(value) {
171
+ OptionsValidator.validateRegistryName(
172
+ value,
173
+ 'metric',
174
+ 'Comparison metric',
175
+ Metric.MetricRegistry.has,
176
+ Metric.MetricRegistry.list
177
+ );
178
+ }
179
+ static validatePhoneticName(value) {
180
+ OptionsValidator.validateRegistryName(
181
+ value,
182
+ 'phonetic',
183
+ 'Phonetic algorithm',
184
+ Phonetic.PhoneticRegistry.has,
185
+ Phonetic.PhoneticRegistry.list
186
+ );
187
+ }
188
+ static validateMetricOptions(opt) {
189
+ OptionsValidator.validateMap(opt, OptionsValidator.METRIC_OPT_MAP);
190
+ }
191
+ static validatePhoneticOptions(opt) {
192
+ OptionsValidator.validateMap(opt, OptionsValidator.PHONETIC_OPT_MAP);
193
+ }
194
+ static validateProcessors(opt) {
195
+ if (!opt) return;
196
+ for (const key in opt) {
197
+ const fn = OptionsValidator.PROCESSORS[key];
198
+ if (!fn)
199
+ throw new Errors.CmpStrValidationError(
200
+ `Invalid processor type <${key}> in <processors>: expected ${Object.keys(OptionsValidator.PROCESSORS).join(' | ')}`,
201
+ { processors: opt, invalid: key }
202
+ );
203
+ fn(opt[key]);
204
+ }
205
+ }
206
+ static validateOptions(opt) {
207
+ OptionsValidator.validateMap(opt, OptionsValidator.CMPSTR_OPT_MAP);
208
+ }
209
+ }
210
+
211
+ exports.OptionsValidator = OptionsValidator;