@warp-drive-mirror/utilities 5.9.0-beta.0 → 5.9.0-beta.1

package/cjs-dist/string.cjs

@@ -0,0 +1,448 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+//#region ../../node_modules/.pnpm/@warp-d_f6d5a2b6297864aac1090915a29560e9/node_modules/@warp-drive-mirror/core/dist/utils/string.js
+const DEFAULT_MAX_CACHE_SIZE = 1e4;
+/**
+* An LRUCache implementation with upsert semantics.
+*
+* This implementation is *not* generic, but focuses on
+* performance tuning for the string transformation cases
+* where the key maps to the value very simply.
+*
+* It takes a work function that should generate a new value
+* for a given key when called. It will be called when the key
+* is not found in the cache.
+*
+* It keeps track of the number of hits, misses, and ejections
+* in DEBUG envs, which is useful for tuning the cache size.
+*
+* This is an internal utility class for use by this module
+* and by `@warp-drive-mirror/utilities/string`. It is not intended
+* for use outside of these modules at this time.
+*
+* @private
+*/
+var LRUCache = class {
+	constructor(doWork, size) {
+		this.size = size || DEFAULT_MAX_CACHE_SIZE;
+		this.state = /* @__PURE__ */ new Map();
+		this.doWork = doWork;
+	}
+	get(key) {
+		const value = this.state.get(key);
+		if (value) {
+			this.state.delete(key);
+			this.state.set(key, value);
+			return value;
+		}
+		const newValue = this.doWork(key);
+		this.set(key, newValue);
+		return newValue;
+	}
+	set(key, value) {
+		if (this.state.size === this.size) for (const [k] of this.state) {
+			this.state.delete(k);
+			break;
+		}
+		this.state.set(key, value);
+	}
+	clear() {
+		this.state.clear();
+	}
+};
+const STRING_DASHERIZE_REGEXP = /[ _]/g;
+const STRING_DECAMELIZE_REGEXP = /([a-z\d])([A-Z])/g;
+/**
+* The {@link LRUCache} backing {@link dasherize}, keyed by the original
+* (un-dasherized) string.
+*
+* @private
+*/
+const STRING_DASHERIZE_CACHE = new LRUCache((key) => key.replace(STRING_DECAMELIZE_REGEXP, "$1_$2").toLowerCase().replace(STRING_DASHERIZE_REGEXP, "-"));
+/**
+* This is an internal utility function that converts a string
+* to a dasherized format. Library consumers should use the
+* re-exported version from `@warp-drive-mirror/utilities/string` instead.
+*
+* This version is only in this location to support a deprecated
+* behavior in the core package and will be removed in a future.
+*
+* @private
+*/
+function dasherize$1(str) {
+	return STRING_DASHERIZE_CACHE.get(str);
+}
+
+//#endregion
+//#region src/-private/string/inflections.ts
+const defaultRules = {
+	plurals: [
+		[/$/, "s"],
+		[/s$/i, "s"],
+		[/^(ax|test)is$/i, "$1es"],
+		[/(octop|vir)us$/i, "$1i"],
+		[/(octop|vir)i$/i, "$1i"],
+		[/(alias|status|bonus)$/i, "$1es"],
+		[/(tu|bu)s$/i, "$1ses"],
+		[/(buffal|tomat)o$/i, "$1oes"],
+		[/([ti])um$/i, "$1a"],
+		[/([ti])a$/i, "$1a"],
+		[/sis$/i, "ses"],
+		[/(?:([^f])fe|([lr])f)$/i, "$1$2ves"],
+		[/(hive)$/i, "$1s"],
+		[/([^aeiouy]|qu)y$/i, "$1ies"],
+		[/(x|ch|ss|sh)$/i, "$1es"],
+		[/(matr|vert|ind)(?:ix|ex)$/i, "$1ices"],
+		[/^(m|l)ouse$/i, "$1ice"],
+		[/^(m|l)ice$/i, "$1ice"],
+		[/^(ox)$/i, "$1en"],
+		[/^(oxen)$/i, "$1"],
+		[/(quiz)$/i, "$1zes"]
+	],
+	singular: [
+		[/s$/i, ""],
+		[/(ss)$/i, "$1"],
+		[/(n)ews$/i, "$1ews"],
+		[/([ti])a$/i, "$1um"],
+		[/((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)(sis|ses)$/i, "$1sis"],
+		[/(^analy)(sis|ses)$/i, "$1sis"],
+		[/([^f])ves$/i, "$1fe"],
+		[/(hive)s$/i, "$1"],
+		[/(tive)s$/i, "$1"],
+		[/([lr])ves$/i, "$1f"],
+		[/([^aeiouy]|qu)ies$/i, "$1y"],
+		[/(s)eries$/i, "$1eries"],
+		[/(m)ovies$/i, "$1ovie"],
+		[/(x|ch|ss|sh)es$/i, "$1"],
+		[/^(m|l)ice$/i, "$1ouse"],
+		[/(tus|bus)(es)?$/i, "$1"],
+		[/(o)es$/i, "$1"],
+		[/(shoe)s$/i, "$1"],
+		[/(cris|test)(is|es)$/i, "$1is"],
+		[/^(a)x[ie]s$/i, "$1xis"],
+		[/(octop|vir)(us|i)$/i, "$1us"],
+		[/(alias|status|bonus)(es)?$/i, "$1"],
+		[/^(ox)en/i, "$1"],
+		[/(vert|ind)ices$/i, "$1ex"],
+		[/(matr)ices$/i, "$1ix"],
+		[/(quiz)zes$/i, "$1"],
+		[/(database)s$/i, "$1"]
+	],
+	irregularPairs: [
+		["person", "people"],
+		["man", "men"],
+		["child", "children"],
+		["sex", "sexes"],
+		["move", "moves"],
+		["cow", "kine"],
+		["zombie", "zombies"]
+	],
+	uncountable: [
+		"equipment",
+		"information",
+		"rice",
+		"money",
+		"species",
+		"series",
+		"fish",
+		"sheep",
+		"jeans",
+		"police"
+	]
+};
+
+//#endregion
+//#region src/-private/string/transform.ts
+const STRING_CAMELIZE_REGEXP_1 = /(\-|\_|\.|\s)+(.)?/g;
+const STRING_CAMELIZE_REGEXP_2 = /(^|\/)([A-Z])/g;
+const CAMELIZE_CACHE = new LRUCache((key) => key.replace(STRING_CAMELIZE_REGEXP_1, (_match, _separator, chr) => chr ? chr.toUpperCase() : "").replace(STRING_CAMELIZE_REGEXP_2, (match) => match.toLowerCase()));
+const STRING_UNDERSCORE_REGEXP_1 = /([a-z\d])([A-Z]+)/g;
+const STRING_UNDERSCORE_REGEXP_2 = /\-|\s+/g;
+const UNDERSCORE_CACHE = new LRUCache((str) => str.replace(STRING_UNDERSCORE_REGEXP_1, "$1_$2").replace(STRING_UNDERSCORE_REGEXP_2, "_").toLowerCase());
+const STRING_CAPITALIZE_REGEXP = /(^|\/)([a-z\u00C0-\u024F])/g;
+const CAPITALIZE_CACHE = new LRUCache((str) => str.replace(STRING_CAPITALIZE_REGEXP, (match) => match.toUpperCase()));
+/**
+* Replaces underscores, spaces, or camelCase with dashes.
+*
+* ```js
+* import { dasherize } from '@warp-drive-mirror/utilities/string';
+*
+* dasherize('innerHTML');                // 'inner-html'
+* dasherize('action_name');              // 'action-name'
+* dasherize('css-class-name');           // 'css-class-name'
+* dasherize('my favorite items');        // 'my-favorite-items'
+* dasherize('privateDocs/ownerInvoice';  // 'private-docs/owner-invoice'
+* ```
+*
+* @public
+* @since 4.13.0
+*/
+const dasherize = dasherize$1;
+/**
+* Returns the lowerCamelCase form of a string.
+*
+* ```js
+* import { camelize } from '@warp-drive-mirror/utilities/string';
+*
+* camelize('innerHTML');                   // 'innerHTML'
+* camelize('action_name');                 // 'actionName'
+* camelize('css-class-name');              // 'cssClassName'
+* camelize('my favorite items');           // 'myFavoriteItems'
+* camelize('My Favorite Items');           // 'myFavoriteItems'
+* camelize('private-docs/owner-invoice');  // 'privateDocs/ownerInvoice'
+* ```
+*
+* @public
+* @since 4.13.0
+*/
+function camelize(str) {
+	return CAMELIZE_CACHE.get(str);
+}
+/**
+* Returns the lower\_case\_and\_underscored form of a string.
+*
+* ```js
+* import { underscore } from '@warp-drive-mirror/utilities/string';
+*
+* underscore('innerHTML');                 // 'inner_html'
+* underscore('action_name');               // 'action_name'
+* underscore('css-class-name');            // 'css_class_name'
+* underscore('my favorite items');         // 'my_favorite_items'
+* underscore('privateDocs/ownerInvoice');  // 'private_docs/owner_invoice'
+* ```
+*
+* @public
+* @since 4.13.0
+*/
+function underscore(str) {
+	return UNDERSCORE_CACHE.get(str);
+}
+/**
+* Returns the Capitalized form of a string
+*
+* ```js
+* import { capitalize } from '@warp-drive-mirror/utilities/string';
+*
+* capitalize('innerHTML')                 // 'InnerHTML'
+* capitalize('action_name')               // 'Action_name'
+* capitalize('css-class-name')            // 'Css-class-name'
+* capitalize('my favorite items')         // 'My favorite items'
+* capitalize('privateDocs/ownerInvoice'); // 'PrivateDocs/ownerInvoice'
+* ```
+*
+* @public
+* @since 4.13.0
+*/
+function capitalize(str) {
+	return CAPITALIZE_CACHE.get(str);
+}
+/**
+* Sets the maximum size of the LRUCache for all string transformation functions.
+* The default size is 10,000.
+*
+* @public
+* @since 4.13.0
+*/
+function setMaxLRUCacheSize(size) {
+	CAMELIZE_CACHE.size = size;
+	UNDERSCORE_CACHE.size = size;
+	CAPITALIZE_CACHE.size = size;
+	STRING_DASHERIZE_CACHE.size = size;
+}
+
+//#endregion
+//#region src/-private/string/inflect.ts
+const BLANK_REGEX = /^\s*$/;
+const LAST_WORD_DASHED_REGEX = /([\w/-]+[_/\s-])([a-z\d]+$)/;
+const LAST_WORD_CAMELIZED_REGEX = /([\w/\s-]+)([A-Z][a-z\d]*$)/;
+const CAMELIZED_REGEX = /[A-Z][a-z\d]*$/;
+const SINGULARS = new LRUCache((word) => {
+	return _singularize(word);
+});
+const PLURALS = new LRUCache((word) => {
+	return _pluralize(word);
+});
+const UNCOUNTABLE = new Set(defaultRules.uncountable);
+const IRREGULAR = /* @__PURE__ */ new Map();
+const INVERSE_IRREGULAR = /* @__PURE__ */ new Map();
+const SINGULAR_RULES = new Map(defaultRules.singular.reverse());
+const PLURAL_RULES = new Map(defaultRules.plurals.reverse());
+/**
+* Marks a word as uncountable. Uncountable words are not pluralized
+* or singularized.
+*
+* @public
+* @since 4.13.0
+*/
+function uncountable(word) {
+	UNCOUNTABLE.add(word.toLowerCase());
+}
+/**
+* Marks a list of words as uncountable. Uncountable words are not pluralized
+* or singularized.
+*
+* @public
+* @since 4.13.0
+*/
+function loadUncountable(uncountables) {
+	uncountables.forEach((word) => {
+		uncountable(word);
+	});
+}
+/**
+* Marks a word as irregular. Irregular words have unique
+* pluralization and singularization rules.
+*
+* @public
+* @since 4.13.0
+*/
+function irregular(single, plur) {
+	IRREGULAR.set(single.toLowerCase(), plur);
+	IRREGULAR.set(plur.toLowerCase(), plur);
+	INVERSE_IRREGULAR.set(plur.toLowerCase(), single);
+	INVERSE_IRREGULAR.set(single.toLowerCase(), single);
+}
+/**
+* Marks a list of word pairs as irregular. Irregular words have unique
+* pluralization and singularization rules.
+*
+* @public
+* @since 4.13.0
+*/
+function loadIrregular(irregularPairs) {
+	irregularPairs.forEach((pair) => {
+		IRREGULAR.set(pair[0].toLowerCase(), pair[1]);
+		IRREGULAR.set(pair[1].toLowerCase(), pair[1]);
+		INVERSE_IRREGULAR.set(pair[1].toLowerCase(), pair[0]);
+		INVERSE_IRREGULAR.set(pair[0].toLowerCase(), pair[0]);
+	});
+}
+loadIrregular(defaultRules.irregularPairs);
+/**
+* Clears the caches for singularize and pluralize.
+*
+* @public
+* @since 4.13.0
+*/
+function clear() {
+	SINGULARS.clear();
+	PLURALS.clear();
+}
+/**
+* Resets the inflection rules to the defaults.
+*
+* @public
+* @since 4.13.0
+*/
+function resetToDefaults() {
+	clearRules();
+	defaultRules.uncountable.forEach((v) => UNCOUNTABLE.add(v));
+	defaultRules.singular.forEach((v) => SINGULAR_RULES.set(v[0], v[1]));
+	defaultRules.plurals.forEach((v) => PLURAL_RULES.set(v[0], v[1]));
+	loadIrregular(defaultRules.irregularPairs);
+}
+/**
+* Clears all inflection rules
+* and resets the caches for singularize and pluralize.
+*
+* @public
+* @since 4.13.0
+*/
+function clearRules() {
+	SINGULARS.clear();
+	PLURALS.clear();
+	UNCOUNTABLE.clear();
+	IRREGULAR.clear();
+	INVERSE_IRREGULAR.clear();
+	SINGULAR_RULES.clear();
+	PLURAL_RULES.clear();
+}
+/**
+* Singularizes a word.
+*
+* @public
+* @since 4.13.0
+*/
+function singularize(word) {
+	if (!word) return "";
+	return SINGULARS.get(word);
+}
+/**
+* Pluralizes a word.
+*
+* @public
+* @since 4.13.0
+*/
+function pluralize(word) {
+	if (!word) return "";
+	return PLURALS.get(word);
+}
+function unshiftMap(v, map) {
+	const rules = [v, ...map.entries()];
+	map.clear();
+	rules.forEach((rule) => {
+		map.set(rule[0], rule[1]);
+	});
+}
+/**
+* Adds a pluralization rule.
+*
+* @public
+* @since 4.13.0
+*/
+function plural(regex, string) {
+	if (PLURAL_RULES.has(regex)) PLURAL_RULES.delete(regex);
+	unshiftMap([regex, string], PLURAL_RULES);
+}
+/**
+* Adds a singularization rule.
+*
+* @public
+* @since 4.13.0
+*/
+function singular(regex, string) {
+	if (SINGULAR_RULES.has(regex)) SINGULAR_RULES.delete(regex);
+	unshiftMap([regex, string], SINGULAR_RULES);
+}
+function _pluralize(word) {
+	return inflect(word, PLURAL_RULES, IRREGULAR);
+}
+function _singularize(word) {
+	return inflect(word, SINGULAR_RULES, INVERSE_IRREGULAR);
+}
+function inflect(word, typeRules, irregulars) {
+	if (!word || BLANK_REGEX.test(word)) return word;
+	const lowercase = word.toLowerCase();
+	if (UNCOUNTABLE.has(lowercase)) return word;
+	const wordSplit = LAST_WORD_DASHED_REGEX.exec(word) || LAST_WORD_CAMELIZED_REGEX.exec(word);
+	const lastWord = wordSplit ? wordSplit[2].toLowerCase() : null;
+	if (lastWord && UNCOUNTABLE.has(lastWord)) return word;
+	const isCamelized = CAMELIZED_REGEX.test(word);
+	for (let [rule, substitution] of irregulars) if (lowercase.match(rule + "$")) {
+		if (isCamelized && lastWord && irregulars.has(lastWord)) {
+			substitution = capitalize(substitution);
+			rule = capitalize(rule);
+		}
+		return word.replace(new RegExp(rule, "i"), substitution);
+	}
+	for (const [rule, substitution] of typeRules) if (rule.test(word)) return word.replace(rule, substitution);
+	return word;
+}
+
+//#endregion
+exports.camelize = camelize;
+exports.capitalize = capitalize;
+exports.clear = clear;
+exports.clearRules = clearRules;
+exports.dasherize = dasherize;
+exports.irregular = irregular;
+exports.loadIrregular = loadIrregular;
+exports.loadUncountable = loadUncountable;
+exports.plural = plural;
+exports.pluralize = pluralize;
+exports.resetToDefaults = resetToDefaults;
+exports.setMaxLRUCacheSize = setMaxLRUCacheSize;
+exports.singular = singular;
+exports.singularize = singularize;
+exports.uncountable = uncountable;
+exports.underscore = underscore;
+//# sourceMappingURL=string.cjs.map

package/cjs-dist/string.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"string.cjs","names":["DEFAULT_MAX_CACHE_SIZE","LRUCache","constructor","doWork","size","state","Map","get","key","value","delete","set","newValue","k","clear","STRING_DASHERIZE_REGEXP","STRING_DECAMELIZE_REGEXP","STRING_DASHERIZE_CACHE","replace","toLowerCase","dasherize","str","internalDasherize","LRUCache","defaultRules","capitalize","BLANK_REGEX","LAST_WORD_DASHED_REGEX","LAST_WORD_CAMELIZED_REGEX","CAMELIZED_REGEX","SINGULARS","word","_singularize","PLURALS","_pluralize","UNCOUNTABLE","Set","uncountable","IRREGULAR","Map","INVERSE_IRREGULAR","SINGULAR_RULES","singular","reverse","PLURAL_RULES","plurals","add","toLowerCase","loadUncountable","uncountables","forEach","irregular","single","plur","set","loadIrregular","irregularPairs","pair","clear","resetToDefaults","clearRules","v","singularize","get","pluralize","unshiftMap","map","rules","entries","rule","plural","regex","string","has","delete","inflect","typeRules","irregulars","isBlank","test","lowercase","wordSplit","exec","lastWord","isCamelized","substitution","match","replace","RegExp"],"sources":["../../../node_modules/.pnpm/@warp-d_f6d5a2b6297864aac1090915a29560e9/node_modules/@warp-drive-mirror/core/dist/utils/string.js","../src/-private/string/inflections.ts","../src/-private/string/transform.ts","../src/-private/string/inflect.ts"],"sourcesContent":["import { DEBUG } from '@warp-drive-mirror/core/build-config/env';\n\nconst DEFAULT_MAX_CACHE_SIZE = 10_000;\n\n/**\n * An LRUCache implementation with upsert semantics.\n *\n * This implementation is *not* generic, but focuses on\n * performance tuning for the string transformation cases\n * where the key maps to the value very simply.\n *\n * It takes a work function that should generate a new value\n * for a given key when called. It will be called when the key\n * is not found in the cache.\n *\n * It keeps track of the number of hits, misses, and ejections\n * in DEBUG envs, which is useful for tuning the cache size.\n *\n * This is an internal utility class for use by this module\n * and by `@warp-drive-mirror/utilities/string`. It is not intended\n * for use outside of these modules at this time.\n *\n * @private\n */\nexport class LRUCache<T, V> {\n  declare size: number;\n  declare state: Map<T, V>;\n  declare doWork: (k: T) => V;\n\n  // debug stats\n  declare _hits: number;\n  declare _misses: number;\n  declare _ejected: number;\n\n  constructor(doWork: (k: T) => V, size?: number) {\n    this.size = size || DEFAULT_MAX_CACHE_SIZE;\n    this.state = new Map();\n    this.doWork = doWork;\n\n    if (DEBUG) {\n      this._hits = 0;\n      this._misses = 0;\n      this._ejected = 0;\n    }\n  }\n\n  get(key: T): V {\n    const value = this.state.get(key);\n    if (value) {\n      if (DEBUG) {\n        this._hits++;\n      }\n      this.state.delete(key);\n      this.state.set(key, value);\n      return value;\n    }\n    if (DEBUG) {\n      this._misses++;\n    }\n\n    const newValue = this.doWork(key);\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  set(key: T, value: V): void {\n    if (this.state.size === this.size) {\n      for (const [k] of this.state) {\n        if (DEBUG) {\n          this._ejected++;\n        }\n        this.state.delete(k);\n        break;\n      }\n    }\n    this.state.set(key, value);\n  }\n\n  clear(): void {\n    this.state.clear();\n    if (DEBUG) {\n      this._hits = 0;\n      this._misses = 0;\n      this._ejected = 0;\n    }\n  }\n}\n\nconst STRING_DASHERIZE_REGEXP = /[ _]/g;\nconst STRING_DECAMELIZE_REGEXP = /([a-z\\d])([A-Z])/g;\n/**\n * The {@link LRUCache} backing {@link dasherize}, keyed by the original\n * (un-dasherized) string.\n *\n * @private\n */\nexport const STRING_DASHERIZE_CACHE: LRUCache<string, string> = new LRUCache<string, string>((key: string) =>\n  key.replace(STRING_DECAMELIZE_REGEXP, '$1_$2').toLowerCase().replace(STRING_DASHERIZE_REGEXP, '-')\n);\n\n/**\n * This is an internal utility function that converts a string\n * to a dasherized format. Library consumers should use the\n * re-exported version from `@warp-drive-mirror/utilities/string` instead.\n *\n * This version is only in this location to support a deprecated\n * behavior in the core package and will be removed in a future.\n *\n * @private\n */\nexport function dasherize(str: string): string {\n  return STRING_DASHERIZE_CACHE.get(str);\n}\n","export type RulesArray = Array<[RegExp, string]>;\ntype DefaultRulesType = {\n  plurals: RulesArray;\n  singular: RulesArray;\n  irregularPairs: Array<[string, string]>;\n  uncountable: string[];\n};\n\nexport const defaultRules: DefaultRulesType = {\n  plurals: [\n    [/$/, 's'],\n    [/s$/i, 's'],\n    [/^(ax|test)is$/i, '$1es'],\n    [/(octop|vir)us$/i, '$1i'],\n    [/(octop|vir)i$/i, '$1i'],\n    [/(alias|status|bonus)$/i, '$1es'],\n    [/(tu|bu)s$/i, '$1ses'],\n    [/(buffal|tomat)o$/i, '$1oes'],\n    [/([ti])um$/i, '$1a'],\n    [/([ti])a$/i, '$1a'],\n    [/sis$/i, 'ses'],\n    [/(?:([^f])fe|([lr])f)$/i, '$1$2ves'],\n    [/(hive)$/i, '$1s'],\n    [/([^aeiouy]|qu)y$/i, '$1ies'],\n    [/(x|ch|ss|sh)$/i, '$1es'],\n    [/(matr|vert|ind)(?:ix|ex)$/i, '$1ices'],\n    [/^(m|l)ouse$/i, '$1ice'],\n    [/^(m|l)ice$/i, '$1ice'],\n    [/^(ox)$/i, '$1en'],\n    [/^(oxen)$/i, '$1'],\n    [/(quiz)$/i, '$1zes'],\n  ],\n\n  singular: [\n    [/s$/i, ''],\n    [/(ss)$/i, '$1'],\n    [/(n)ews$/i, '$1ews'],\n    [/([ti])a$/i, '$1um'],\n    [/((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)(sis|ses)$/i, '$1sis'],\n    [/(^analy)(sis|ses)$/i, '$1sis'],\n    [/([^f])ves$/i, '$1fe'],\n    [/(hive)s$/i, '$1'],\n    [/(tive)s$/i, '$1'],\n    [/([lr])ves$/i, '$1f'],\n    [/([^aeiouy]|qu)ies$/i, '$1y'],\n    [/(s)eries$/i, '$1eries'],\n    [/(m)ovies$/i, '$1ovie'],\n    [/(x|ch|ss|sh)es$/i, '$1'],\n    [/^(m|l)ice$/i, '$1ouse'],\n    [/(tus|bus)(es)?$/i, '$1'],\n    [/(o)es$/i, '$1'],\n    [/(shoe)s$/i, '$1'],\n    [/(cris|test)(is|es)$/i, '$1is'],\n    [/^(a)x[ie]s$/i, '$1xis'],\n    [/(octop|vir)(us|i)$/i, '$1us'],\n    [/(alias|status|bonus)(es)?$/i, '$1'],\n    [/^(ox)en/i, '$1'],\n    [/(vert|ind)ices$/i, '$1ex'],\n    [/(matr)ices$/i, '$1ix'],\n    [/(quiz)zes$/i, '$1'],\n    [/(database)s$/i, '$1'],\n  ],\n\n  irregularPairs: [\n    ['person', 'people'],\n    ['man', 'men'],\n    ['child', 'children'],\n    ['sex', 'sexes'],\n    ['move', 'moves'],\n    ['cow', 'kine'],\n    ['zombie', 'zombies'],\n  ],\n\n  uncountable: ['equipment', 'information', 'rice', 'money', 'species', 'series', 'fish', 'sheep', 'jeans', 'police'],\n};\n","import { dasherize as internalDasherize, LRUCache, STRING_DASHERIZE_CACHE } from '@warp-drive-mirror/core/utils/string';\n\n// eslint-disable-next-line no-useless-escape\nconst STRING_CAMELIZE_REGEXP_1 = /(\\-|\\_|\\.|\\s)+(.)?/g;\nconst STRING_CAMELIZE_REGEXP_2 = /(^|\\/)([A-Z])/g;\nconst CAMELIZE_CACHE = new LRUCache<string, string>((key: string) =>\n  key\n    .replace(STRING_CAMELIZE_REGEXP_1, (_match, _separator, chr: string | null) => (chr ? chr.toUpperCase() : ''))\n    .replace(STRING_CAMELIZE_REGEXP_2, (match /*, separator, chr */) => match.toLowerCase())\n);\n\nconst STRING_UNDERSCORE_REGEXP_1 = /([a-z\\d])([A-Z]+)/g;\n// eslint-disable-next-line no-useless-escape\nconst STRING_UNDERSCORE_REGEXP_2 = /\\-|\\s+/g;\nconst UNDERSCORE_CACHE = new LRUCache<string, string>((str: string) =>\n  str.replace(STRING_UNDERSCORE_REGEXP_1, '$1_$2').replace(STRING_UNDERSCORE_REGEXP_2, '_').toLowerCase()\n);\n\nconst STRING_CAPITALIZE_REGEXP = /(^|\\/)([a-z\\u00C0-\\u024F])/g;\nconst CAPITALIZE_CACHE = new LRUCache<string, string>((str: string) =>\n  str.replace(STRING_CAPITALIZE_REGEXP, (match /*, separator, chr */) => match.toUpperCase())\n);\n\n/**\n * Replaces underscores, spaces, or camelCase with dashes.\n *\n * ```js\n * import { dasherize } from '@warp-drive-mirror/utilities/string';\n *\n * dasherize('innerHTML');                // 'inner-html'\n * dasherize('action_name');              // 'action-name'\n * dasherize('css-class-name');           // 'css-class-name'\n * dasherize('my favorite items');        // 'my-favorite-items'\n * dasherize('privateDocs/ownerInvoice';  // 'private-docs/owner-invoice'\n * ```\n *\n * @public\n * @since 4.13.0\n */\nexport const dasherize: (str: string) => string = internalDasherize;\n\n/**\n * Returns the lowerCamelCase form of a string.\n *\n * ```js\n * import { camelize } from '@warp-drive-mirror/utilities/string';\n *\n * camelize('innerHTML');                   // 'innerHTML'\n * camelize('action_name');                 // 'actionName'\n * camelize('css-class-name');              // 'cssClassName'\n * camelize('my favorite items');           // 'myFavoriteItems'\n * camelize('My Favorite Items');           // 'myFavoriteItems'\n * camelize('private-docs/owner-invoice');  // 'privateDocs/ownerInvoice'\n * ```\n *\n * @public\n * @since 4.13.0\n */\nexport function camelize(str: string): string {\n  return CAMELIZE_CACHE.get(str);\n}\n\n/**\n * Returns the lower\\_case\\_and\\_underscored form of a string.\n *\n * ```js\n * import { underscore } from '@warp-drive-mirror/utilities/string';\n *\n * underscore('innerHTML');                 // 'inner_html'\n * underscore('action_name');               // 'action_name'\n * underscore('css-class-name');            // 'css_class_name'\n * underscore('my favorite items');         // 'my_favorite_items'\n * underscore('privateDocs/ownerInvoice');  // 'private_docs/owner_invoice'\n * ```\n *\n * @public\n * @since 4.13.0\n */\nexport function underscore(str: string): string {\n  return UNDERSCORE_CACHE.get(str);\n}\n\n/**\n * Returns the Capitalized form of a string\n *\n * ```js\n * import { capitalize } from '@warp-drive-mirror/utilities/string';\n *\n * capitalize('innerHTML')                 // 'InnerHTML'\n * capitalize('action_name')               // 'Action_name'\n * capitalize('css-class-name')            // 'Css-class-name'\n * capitalize('my favorite items')         // 'My favorite items'\n * capitalize('privateDocs/ownerInvoice'); // 'PrivateDocs/ownerInvoice'\n * ```\n *\n * @public\n * @since 4.13.0\n */\nexport function capitalize(str: string): string {\n  return CAPITALIZE_CACHE.get(str);\n}\n\n/**\n * Sets the maximum size of the LRUCache for all string transformation functions.\n * The default size is 10,000.\n *\n * @public\n * @since 4.13.0\n */\nexport function setMaxLRUCacheSize(size: number): void {\n  CAMELIZE_CACHE.size = size;\n  UNDERSCORE_CACHE.size = size;\n  CAPITALIZE_CACHE.size = size;\n  STRING_DASHERIZE_CACHE.size = size;\n}\n","import { assert } from '@warp-drive-mirror/core/build-config/macros';\nimport { LRUCache } from '@warp-drive-mirror/core/utils/string';\n\nimport { defaultRules } from './inflections.ts';\nimport { capitalize } from './transform.ts';\n\nconst BLANK_REGEX = /^\\s*$/;\nconst LAST_WORD_DASHED_REGEX = /([\\w/-]+[_/\\s-])([a-z\\d]+$)/;\nconst LAST_WORD_CAMELIZED_REGEX = /([\\w/\\s-]+)([A-Z][a-z\\d]*$)/;\nconst CAMELIZED_REGEX = /[A-Z][a-z\\d]*$/;\n\nconst SINGULARS = new LRUCache<string, string>((word: string) => {\n  return _singularize(word);\n});\nconst PLURALS = new LRUCache<string, string>((word: string) => {\n  return _pluralize(word);\n});\nconst UNCOUNTABLE = new Set(defaultRules.uncountable);\nconst IRREGULAR: Map<string, string> = new Map();\nconst INVERSE_IRREGULAR: Map<string, string> = new Map();\nconst SINGULAR_RULES = new Map(defaultRules.singular.reverse());\nconst PLURAL_RULES = new Map(defaultRules.plurals.reverse());\n\n/**\n * Marks a word as uncountable. Uncountable words are not pluralized\n * or singularized.\n *\n * @public\n * @since 4.13.0\n */\nexport function uncountable(word: string): void {\n  UNCOUNTABLE.add(word.toLowerCase());\n}\n\n/**\n * Marks a list of words as uncountable. Uncountable words are not pluralized\n * or singularized.\n *\n * @public\n * @since 4.13.0\n */\nexport function loadUncountable(uncountables: string[]): void {\n  uncountables.forEach((word) => {\n    uncountable(word);\n  });\n}\n\n/**\n * Marks a word as irregular. Irregular words have unique\n * pluralization and singularization rules.\n *\n * @public\n * @since 4.13.0\n */\nexport function irregular(single: string, plur: string): void {\n  //pluralizing\n  IRREGULAR.set(single.toLowerCase(), plur);\n  IRREGULAR.set(plur.toLowerCase(), plur);\n\n  //singularizing\n  INVERSE_IRREGULAR.set(plur.toLowerCase(), single);\n  INVERSE_IRREGULAR.set(single.toLowerCase(), single);\n}\n\n/**\n * Marks a list of word pairs as irregular. Irregular words have unique\n * pluralization and singularization rules.\n *\n * @public\n * @since 4.13.0\n */\nexport function loadIrregular(irregularPairs: Array<[string, string]>): void {\n  irregularPairs.forEach((pair) => {\n    //pluralizing\n    IRREGULAR.set(pair[0].toLowerCase(), pair[1]);\n    IRREGULAR.set(pair[1].toLowerCase(), pair[1]);\n\n    //singularizing\n    INVERSE_IRREGULAR.set(pair[1].toLowerCase(), pair[0]);\n    INVERSE_IRREGULAR.set(pair[0].toLowerCase(), pair[0]);\n  });\n}\nloadIrregular(defaultRules.irregularPairs);\n\n/**\n * Clears the caches for singularize and pluralize.\n *\n * @public\n * @since 4.13.0\n */\nexport function clear(): void {\n  SINGULARS.clear();\n  PLURALS.clear();\n}\n\n/**\n * Resets the inflection rules to the defaults.\n *\n * @public\n * @since 4.13.0\n */\nexport function resetToDefaults(): void {\n  clearRules();\n  defaultRules.uncountable.forEach((v) => UNCOUNTABLE.add(v));\n  defaultRules.singular.forEach((v) => SINGULAR_RULES.set(v[0], v[1]));\n  defaultRules.plurals.forEach((v) => PLURAL_RULES.set(v[0], v[1]));\n  loadIrregular(defaultRules.irregularPairs);\n}\n\n/**\n * Clears all inflection rules\n * and resets the caches for singularize and pluralize.\n *\n * @public\n * @since 4.13.0\n */\nexport function clearRules(): void {\n  SINGULARS.clear();\n  PLURALS.clear();\n  UNCOUNTABLE.clear();\n  IRREGULAR.clear();\n  INVERSE_IRREGULAR.clear();\n  SINGULAR_RULES.clear();\n  PLURAL_RULES.clear();\n}\n\n/**\n * Singularizes a word.\n *\n * @public\n * @since 4.13.0\n */\nexport function singularize(word: string): string {\n  assert(`singularize expects to receive a non-empty string`, typeof word === 'string' && word.length > 0);\n  if (!word) return '';\n  return SINGULARS.get(word);\n}\n\n/**\n * Pluralizes a word.\n *\n * @public\n * @since 4.13.0\n */\nexport function pluralize(word: string): string {\n  assert(`pluralize expects to receive a non-empty string`, typeof word === 'string' && word.length > 0);\n  if (!word) return '';\n  return PLURALS.get(word);\n}\n\nfunction unshiftMap<K, V>(v: [K, V], map: Map<K, V>) {\n  // reorder\n  const rules = [v, ...map.entries()];\n  map.clear();\n  rules.forEach((rule) => {\n    map.set(rule[0], rule[1]);\n  });\n}\n\n/**\n * Adds a pluralization rule.\n *\n * @public\n * @since 4.13.0\n */\nexport function plural(regex: RegExp, string: string): void {\n  // rule requires reordering if exists, so remove it first\n  if (PLURAL_RULES.has(regex)) {\n    PLURAL_RULES.delete(regex);\n  }\n\n  // reorder\n  unshiftMap([regex, string], PLURAL_RULES);\n}\n\n/**\n * Adds a singularization rule.\n *\n * @public\n * @since 4.13.0\n */\nexport function singular(regex: RegExp, string: string): void {\n  // rule requires reordering if exists, so remove it first\n  if (SINGULAR_RULES.has(regex)) {\n    SINGULAR_RULES.delete(regex);\n  }\n\n  // reorder\n  unshiftMap([regex, string], SINGULAR_RULES);\n}\n\nfunction _pluralize(word: string) {\n  return inflect(word, PLURAL_RULES, IRREGULAR);\n}\n\nfunction _singularize(word: string) {\n  return inflect(word, SINGULAR_RULES, INVERSE_IRREGULAR);\n}\n\nfunction inflect(word: string, typeRules: Map<RegExp, string>, irregulars: Map<string, string>) {\n  // empty strings\n  const isBlank = !word || BLANK_REGEX.test(word);\n  if (isBlank) {\n    return word;\n  }\n\n  // basic uncountables\n  const lowercase = word.toLowerCase();\n  if (UNCOUNTABLE.has(lowercase)) {\n    return word;\n  }\n\n  // adv uncountables\n  const wordSplit = LAST_WORD_DASHED_REGEX.exec(word) || LAST_WORD_CAMELIZED_REGEX.exec(word);\n  const lastWord = wordSplit ? wordSplit[2].toLowerCase() : null;\n  if (lastWord && UNCOUNTABLE.has(lastWord)) {\n    return word;\n  }\n\n  // handle irregulars\n  const isCamelized = CAMELIZED_REGEX.test(word);\n  for (let [rule, substitution] of irregulars) {\n    if (lowercase.match(rule + '$')) {\n      if (isCamelized && lastWord && irregulars.has(lastWord)) {\n        substitution = capitalize(substitution);\n        rule = capitalize(rule);\n      }\n\n      return word.replace(new RegExp(rule, 'i'), substitution);\n    }\n  }\n\n  // do the actual inflection\n  for (const [rule, substitution] of typeRules) {\n    if (rule.test(word)) {\n      return word.replace(rule, substitution);\n    }\n  }\n\n  return word;\n}\n"],"x_google_ignoreList":[0],"mappings":";;AAEA,MAAMA,yBAAyB;;;;;;;;;;;;;;;;;;;;;AAsB/B,IAAaC,WAAb,MAA4B;CAU1BC,YAAYC,QAAqBC,MAAe;EAC9C,KAAKA,OAAOA,QAAQJ;EACpB,KAAKK,wBAAQ,IAAIC,IAAI;EACrB,KAAKH,SAASA;CAOhB;CAEAI,IAAIC,KAAW;EACb,MAAMC,QAAQ,KAAKJ,MAAME,IAAIC,GAAG;EAChC,IAAIC,OAAO;GAIT,KAAKJ,MAAMK,OAAOF,GAAG;GACrB,KAAKH,MAAMM,IAAIH,KAAKC,KAAK;GACzB,OAAOA;EACT;EAKA,MAAMG,WAAW,KAAKT,OAAOK,GAAG;EAChC,KAAKG,IAAIH,KAAKI,QAAQ;EACtB,OAAOA;CACT;CAEAD,IAAIH,KAAQC,OAAgB;EAC1B,IAAI,KAAKJ,MAAMD,SAAS,KAAKA,MAC3B,KAAK,MAAM,CAACS,MAAM,KAAKR,OAAO;GAI5B,KAAKA,MAAMK,OAAOG,CAAC;GACnB;EACF;EAEF,KAAKR,MAAMM,IAAIH,KAAKC,KAAK;CAC3B;CAEAK,QAAc;EACZ,KAAKT,MAAMS,MAAM;CAMnB;AACF;AAEA,MAAMC,0BAA0B;AAChC,MAAMC,2BAA2B;;;;;;;AAOjC,MAAaC,yBAAmD,IAAIhB,UAA0BO,QAC5FA,IAAIU,QAAQF,0BAA0B,OAAO,CAAC,CAACG,YAAY,CAAC,CAACD,QAAQH,yBAAyB,GAAG,CACnG;;;;;;;;;;;AAYA,SAAgBK,YAAUC,KAAqB;CAC7C,OAAOJ,uBAAuBV,IAAIc,GAAG;AACvC;;;;ACxGA,MAAa,eAAiC;CAC5C,SAAS;EACP,CAAC,KAAK,GAAG;EACT,CAAC,OAAO,GAAG;EACX,CAAC,kBAAkB,MAAM;EACzB,CAAC,mBAAmB,KAAK;EACzB,CAAC,kBAAkB,KAAK;EACxB,CAAC,0BAA0B,MAAM;EACjC,CAAC,cAAc,OAAO;EACtB,CAAC,qBAAqB,OAAO;EAC7B,CAAC,cAAc,KAAK;EACpB,CAAC,aAAa,KAAK;EACnB,CAAC,SAAS,KAAK;EACf,CAAC,0BAA0B,SAAS;EACpC,CAAC,YAAY,KAAK;EAClB,CAAC,qBAAqB,OAAO;EAC7B,CAAC,kBAAkB,MAAM;EACzB,CAAC,8BAA8B,QAAQ;EACvC,CAAC,gBAAgB,OAAO;EACxB,CAAC,eAAe,OAAO;EACvB,CAAC,WAAW,MAAM;EAClB,CAAC,aAAa,IAAI;EAClB,CAAC,YAAY,OAAO;CACtB;CAEA,UAAU;EACR,CAAC,OAAO,EAAE;EACV,CAAC,UAAU,IAAI;EACf,CAAC,YAAY,OAAO;EACpB,CAAC,aAAa,MAAM;EACpB,CAAC,wEAAwE,OAAO;EAChF,CAAC,uBAAuB,OAAO;EAC/B,CAAC,eAAe,MAAM;EACtB,CAAC,aAAa,IAAI;EAClB,CAAC,aAAa,IAAI;EAClB,CAAC,eAAe,KAAK;EACrB,CAAC,uBAAuB,KAAK;EAC7B,CAAC,cAAc,SAAS;EACxB,CAAC,cAAc,QAAQ;EACvB,CAAC,oBAAoB,IAAI;EACzB,CAAC,eAAe,QAAQ;EACxB,CAAC,oBAAoB,IAAI;EACzB,CAAC,WAAW,IAAI;EAChB,CAAC,aAAa,IAAI;EAClB,CAAC,wBAAwB,MAAM;EAC/B,CAAC,gBAAgB,OAAO;EACxB,CAAC,uBAAuB,MAAM;EAC9B,CAAC,+BAA+B,IAAI;EACpC,CAAC,YAAY,IAAI;EACjB,CAAC,oBAAoB,MAAM;EAC3B,CAAC,gBAAgB,MAAM;EACvB,CAAC,eAAe,IAAI;EACpB,CAAC,iBAAiB,IAAI;CACxB;CAEA,gBAAgB;EACd,CAAC,UAAU,QAAQ;EACnB,CAAC,OAAO,KAAK;EACb,CAAC,SAAS,UAAU;EACpB,CAAC,OAAO,OAAO;EACf,CAAC,QAAQ,OAAO;EAChB,CAAC,OAAO,MAAM;EACd,CAAC,UAAU,SAAS;CACtB;CAEA,aAAa;EAAC;EAAa;EAAe;EAAQ;EAAS;EAAW;EAAU;EAAQ;EAAS;EAAS;CAAQ;AACpH;;;;ACvEA,MAAM,2BAA2B;AACjC,MAAM,2BAA2B;AACjC,MAAM,iBAAiB,IAAI,UAA0B,QACnD,IACG,QAAQ,2BAA2B,QAAQ,YAAY,QAAwB,MAAM,IAAI,YAAY,IAAI,EAAG,CAAC,CAC7G,QAAQ,2BAA2B,UAAgC,MAAM,YAAY,CAAC,CAC3F;AAEA,MAAM,6BAA6B;AAEnC,MAAM,6BAA6B;AACnC,MAAM,mBAAmB,IAAI,UAA0B,QACrD,IAAI,QAAQ,4BAA4B,OAAO,CAAC,CAAC,QAAQ,4BAA4B,GAAG,CAAC,CAAC,YAAY,CACxG;AAEA,MAAM,2BAA2B;AACjC,MAAM,mBAAmB,IAAI,UAA0B,QACrD,IAAI,QAAQ,2BAA2B,UAAgC,MAAM,YAAY,CAAC,CAC5F;;;;;;;;;;;;;;;;;AAkBA,MAAa,YAAqCC;;;;;;;;;;;;;;;;;;AAmBlD,SAAgB,SAAS,KAAqB;CAC5C,OAAO,eAAe,IAAI,GAAG;AAC/B;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WAAW,KAAqB;CAC9C,OAAO,iBAAiB,IAAI,GAAG;AACjC;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WAAW,KAAqB;CAC9C,OAAO,iBAAiB,IAAI,GAAG;AACjC;;;;;;;;AASA,SAAgB,mBAAmB,MAAoB;CACrD,eAAe,OAAO;CACtB,iBAAiB,OAAO;CACxB,iBAAiB,OAAO;CACxB,uBAAuB,OAAO;AAChC;;;;AC5GA,MAAMI,cAAc;AACpB,MAAMC,yBAAyB;AAC/B,MAAMC,4BAA4B;AAClC,MAAMC,kBAAkB;AAExB,MAAMC,YAAY,IAAIP,UAA0BQ,SAAiB;CAC/D,OAAOC,aAAaD,IAAI;AAC1B,CAAC;AACD,MAAME,UAAU,IAAIV,UAA0BQ,SAAiB;CAC7D,OAAOG,WAAWH,IAAI;AACxB,CAAC;AACD,MAAMI,cAAc,IAAIC,IAAIZ,aAAaa,WAAW;AACpD,MAAMC,4BAAiC,IAAIC,IAAI;AAC/C,MAAMC,oCAAyC,IAAID,IAAI;AACvD,MAAME,iBAAiB,IAAIF,IAAIf,aAAakB,SAASC,QAAQ,CAAC;AAC9D,MAAMC,eAAe,IAAIL,IAAIf,aAAaqB,QAAQF,QAAQ,CAAC;;;;;;;;AAS3D,SAAgBN,YAAYN,MAAoB;CAC9CI,YAAYW,IAAIf,KAAKgB,YAAY,CAAC;AACpC;;;;;;;;AASA,SAAgBC,gBAAgBC,cAA8B;CAC5DA,aAAaC,SAASnB,SAAS;EAC7BM,YAAYN,IAAI;CAClB,CAAC;AACH;;;;;;;;AASA,SAAgBoB,UAAUC,QAAgBC,MAAoB;CAE5Df,UAAUgB,IAAIF,OAAOL,YAAY,GAAGM,IAAI;CACxCf,UAAUgB,IAAID,KAAKN,YAAY,GAAGM,IAAI;CAGtCb,kBAAkBc,IAAID,KAAKN,YAAY,GAAGK,MAAM;CAChDZ,kBAAkBc,IAAIF,OAAOL,YAAY,GAAGK,MAAM;AACpD;;;;;;;;AASA,SAAgBG,cAAcC,gBAA+C;CAC3EA,eAAeN,SAASO,SAAS;EAE/BnB,UAAUgB,IAAIG,KAAK,EAAE,CAACV,YAAY,GAAGU,KAAK,EAAE;EAC5CnB,UAAUgB,IAAIG,KAAK,EAAE,CAACV,YAAY,GAAGU,KAAK,EAAE;EAG5CjB,kBAAkBc,IAAIG,KAAK,EAAE,CAACV,YAAY,GAAGU,KAAK,EAAE;EACpDjB,kBAAkBc,IAAIG,KAAK,EAAE,CAACV,YAAY,GAAGU,KAAK,EAAE;CACtD,CAAC;AACH;AACAF,cAAc/B,aAAagC,cAAc;;;;;;;AAQzC,SAAgBE,QAAc;CAC5B5B,UAAU4B,MAAM;CAChBzB,QAAQyB,MAAM;AAChB;;;;;;;AAQA,SAAgBC,kBAAwB;CACtCC,WAAW;CACXpC,aAAaa,YAAYa,SAASW,MAAM1B,YAAYW,IAAIe,CAAC,CAAC;CAC1DrC,aAAakB,SAASQ,SAASW,MAAMpB,eAAea,IAAIO,EAAE,IAAIA,EAAE,EAAE,CAAC;CACnErC,aAAaqB,QAAQK,SAASW,MAAMjB,aAAaU,IAAIO,EAAE,IAAIA,EAAE,EAAE,CAAC;CAChEN,cAAc/B,aAAagC,cAAc;AAC3C;;;;;;;;AASA,SAAgBI,aAAmB;CACjC9B,UAAU4B,MAAM;CAChBzB,QAAQyB,MAAM;CACdvB,YAAYuB,MAAM;CAClBpB,UAAUoB,MAAM;CAChBlB,kBAAkBkB,MAAM;CACxBjB,eAAeiB,MAAM;CACrBd,aAAac,MAAM;AACrB;;;;;;;AAQA,SAAgBI,YAAY/B,MAAsB;CAEhD,IAAI,CAACA,MAAM,OAAO;CAClB,OAAOD,UAAUiC,IAAIhC,IAAI;AAC3B;;;;;;;AAQA,SAAgBiC,UAAUjC,MAAsB;CAE9C,IAAI,CAACA,MAAM,OAAO;CAClB,OAAOE,QAAQ8B,IAAIhC,IAAI;AACzB;AAEA,SAASkC,WAAiBJ,GAAWK,KAAgB;CAEnD,MAAMC,QAAQ,CAACN,GAAG,GAAGK,IAAIE,QAAQ,CAAC;CAClCF,IAAIR,MAAM;CACVS,MAAMjB,SAASmB,SAAS;EACtBH,IAAIZ,IAAIe,KAAK,IAAIA,KAAK,EAAE;CAC1B,CAAC;AACH;;;;;;;AAQA,SAAgBC,OAAOC,OAAeC,QAAsB;CAE1D,IAAI5B,aAAa6B,IAAIF,KAAK,GACxB3B,aAAa8B,OAAOH,KAAK;CAI3BN,WAAW,CAACM,OAAOC,MAAM,GAAG5B,YAAY;AAC1C;;;;;;;AAQA,SAAgBF,SAAS6B,OAAeC,QAAsB;CAE5D,IAAI/B,eAAegC,IAAIF,KAAK,GAC1B9B,eAAeiC,OAAOH,KAAK;CAI7BN,WAAW,CAACM,OAAOC,MAAM,GAAG/B,cAAc;AAC5C;AAEA,SAASP,WAAWH,MAAc;CAChC,OAAO4C,QAAQ5C,MAAMa,cAAcN,SAAS;AAC9C;AAEA,SAASN,aAAaD,MAAc;CAClC,OAAO4C,QAAQ5C,MAAMU,gBAAgBD,iBAAiB;AACxD;AAEA,SAASmC,QAAQ5C,MAAc6C,WAAgCC,YAAiC;CAG9F,IADgB,CAAC9C,QAAQL,YAAYqD,KAAKhD,IAAI,GAE5C,OAAOA;CAIT,MAAMiD,YAAYjD,KAAKgB,YAAY;CACnC,IAAIZ,YAAYsC,IAAIO,SAAS,GAC3B,OAAOjD;CAIT,MAAMkD,YAAYtD,uBAAuBuD,KAAKnD,IAAI,KAAKH,0BAA0BsD,KAAKnD,IAAI;CAC1F,MAAMoD,WAAWF,YAAYA,UAAU,EAAE,CAAClC,YAAY,IAAI;CAC1D,IAAIoC,YAAYhD,YAAYsC,IAAIU,QAAQ,GACtC,OAAOpD;CAIT,MAAMqD,cAAcvD,gBAAgBkD,KAAKhD,IAAI;CAC7C,KAAK,IAAI,CAACsC,MAAMgB,iBAAiBR,YAC/B,IAAIG,UAAUM,MAAMjB,OAAO,GAAG,GAAG;EAC/B,IAAIe,eAAeD,YAAYN,WAAWJ,IAAIU,QAAQ,GAAG;GACvDE,eAAe5D,WAAW4D,YAAY;GACtChB,OAAO5C,WAAW4C,IAAI;EACxB;EAEA,OAAOtC,KAAKwD,QAAQ,IAAIC,OAAOnB,MAAM,GAAG,GAAGgB,YAAY;CACzD;CAIF,KAAK,MAAM,CAAChB,MAAMgB,iBAAiBT,WACjC,IAAIP,KAAKU,KAAKhD,IAAI,GAChB,OAAOA,KAAKwD,QAAQlB,MAAMgB,YAAY;CAI1C,OAAOtD;AACT"}

package/declarations/-private.d.ts

@@ -1 +1,12 @@
-export { defaultRules as InflectionRuleDefaults } from "./-private/string/inflections.js";
+//#region src/-private/string/inflections.d.ts
+type RulesArray = Array<[RegExp, string]>;
+type DefaultRulesType = {
+  plurals: RulesArray;
+  singular: RulesArray;
+  irregularPairs: Array<[string, string]>;
+  uncountable: string[];
+};
+declare const defaultRules: DefaultRulesType;
+//#endregion
+export { defaultRules as InflectionRuleDefaults };
+//# sourceMappingURL=-private.d.ts.map

package/declarations/-private.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"-private.d.ts","names":[],"sources":["../src/-private/string/inflections.ts"],"mappings":";KAAY,aAAa,OAAO;KAC3B;EACH,SAAS;EACT,UAAU;EACV,gBAAgB;EAChB;;cAGW,cAAc"}