typia 13.1.0 → 13.1.19

package/lib/internal/_randomNumber.js

@@ -1,63 +1,63 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports._randomNumber = void 0;
+const _randomMultiple_1 = require("./_randomMultiple");
 const _randomNumber = (schema) => {
-    var _a, _b, _c, _d, _e, _f, _g, _h;
-    const minimum = (_b = (_a = schema.minimum) !== null && _a !== void 0 ? _a : schema.exclusiveMinimum) !== null && _b !== void 0 ? _b : ((_c = schema.multipleOf) !== null && _c !== void 0 ? _c : 1) *
-        (schema.maximum === undefined && schema.exclusiveMaximum === undefined
-            ? 0
-            : ((_d = schema.maximum) !== null && _d !== void 0 ? _d : schema.exclusiveMaximum) - 100);
-    const maximum = (_f = (_e = schema.maximum) !== null && _e !== void 0 ? _e : schema.exclusiveMaximum) !== null && _f !== void 0 ? _f : ((_g = schema.multipleOf) !== null && _g !== void 0 ? _g : 1) *
-        (schema.minimum === undefined && schema.exclusiveMinimum === undefined
-            ? 100
-            : ((_h = schema.minimum) !== null && _h !== void 0 ? _h : schema.exclusiveMinimum) + 100);
+    var _a, _b, _c, _d, _e, _f;
+    const lower = getLowerBoundary(schema);
+    const upper = getUpperBoundary(schema);
+    const minimum = (_a = lower === null || lower === void 0 ? void 0 : lower.value) !== null && _a !== void 0 ? _a : (upper === null ? 0 : upper.value - 100);
+    const maximum = (_b = upper === null || upper === void 0 ? void 0 : upper.value) !== null && _b !== void 0 ? _b : (lower === null ? 100 : lower.value + 100);
     if (minimum > maximum)
         throw new Error("Minimum value is greater than maximum value.");
     return schema.multipleOf === undefined
         ? scalar({
             minimum,
             maximum,
-            exclusiveMinimum: schema.exclusiveMinimum !== undefined,
-            exclusiveMaximum: schema.exclusiveMaximum !== undefined,
+            exclusiveMinimum: (_c = lower === null || lower === void 0 ? void 0 : lower.exclusive) !== null && _c !== void 0 ? _c : false,
+            exclusiveMaximum: (_d = upper === null || upper === void 0 ? void 0 : upper.exclusive) !== null && _d !== void 0 ? _d : false,
         })
-        : multiple({
+        : (0, _randomMultiple_1._randomMultiple)({
             minimum,
             maximum,
             multipleOf: schema.multipleOf,
-            exclusiveMinimum: schema.exclusiveMinimum !== undefined,
-            exclusiveMaximum: schema.exclusiveMaximum !== undefined,
+            exclusiveMinimum: (_e = lower === null || lower === void 0 ? void 0 : lower.exclusive) !== null && _e !== void 0 ? _e : false,
+            exclusiveMaximum: (_f = upper === null || upper === void 0 ? void 0 : upper.exclusive) !== null && _f !== void 0 ? _f : false,
+            integer: false,
         });
 };
 exports._randomNumber = _randomNumber;
-const scalar = (p) => {
-    if (p.minimum === p.maximum && (p.exclusiveMinimum || p.exclusiveMaximum))
-        throw new Error(p.exclusiveMinimum
-            ? "Exclusive minimum value equals maximum value."
-            : "Exclusive maximum value equals minimum value.");
-    while (true) {
-        const value = Math.random() * (p.maximum - p.minimum) + p.minimum;
-        if (p.exclusiveMinimum && value === p.minimum)
-            continue;
-        else if (p.exclusiveMaximum && value === p.maximum)
-            continue;
-        return value;
+const scalar = (props) => {
+    if (props.minimum === props.maximum &&
+        (props.exclusiveMinimum || props.exclusiveMaximum))
+        throw new Error("Exclusive numeric range is empty.");
+    const value = Math.random() * (props.maximum - props.minimum) + props.minimum;
+    if ((props.exclusiveMinimum && value === props.minimum) ||
+        (props.exclusiveMaximum && value === props.maximum)) {
+        const middle = props.minimum + (props.maximum - props.minimum) / 2;
+        if (middle <= props.minimum || middle >= props.maximum)
+            throw new Error("Exclusive numeric range has no representable value.");
+        return middle;
     }
+    return value;
 };
-const multiple = (p) => {
-    let minimum = Math.ceil(p.minimum / p.multipleOf) * p.multipleOf;
-    let maximum = Math.floor(p.maximum / p.multipleOf) * p.multipleOf;
-    if (p.exclusiveMinimum === true && minimum % p.multipleOf === 0)
-        minimum += p.multipleOf;
-    if (p.exclusiveMaximum === true && maximum % p.multipleOf === 0)
-        maximum -= p.multipleOf;
-    if (minimum > maximum)
-        throw new Error("The range of the integer is smaller than the multipleOf value.");
-    const value = scalar({
-        minimum,
-        maximum,
-        exclusiveMinimum: p.exclusiveMinimum,
-        exclusiveMaximum: p.exclusiveMaximum,
-    });
-    return value - (value % p.multipleOf);
+const getLowerBoundary = (schema) => selectBoundary(schema.minimum === undefined
+    ? null
+    : { value: schema.minimum, exclusive: false }, schema.exclusiveMinimum === undefined
+    ? null
+    : { value: schema.exclusiveMinimum, exclusive: true }, Math.max);
+const getUpperBoundary = (schema) => selectBoundary(schema.maximum === undefined
+    ? null
+    : { value: schema.maximum, exclusive: false }, schema.exclusiveMaximum === undefined
+    ? null
+    : { value: schema.exclusiveMaximum, exclusive: true }, Math.min);
+const selectBoundary = (x, y, compare) => {
+    if (x === null)
+        return y;
+    if (y === null)
+        return x;
+    if (x.value === y.value)
+        return { value: x.value, exclusive: x.exclusive || y.exclusive };
+    return compare(x.value, y.value) === x.value ? x : y;
 };
 //# sourceMappingURL=_randomNumber.js.map

package/lib/internal/_randomNumber.js.map

@@ -1 +1 @@
-{"version":3,"file":"_randomNumber.js","sourceRoot":"","sources":["../../src/internal/_randomNumber.ts"],"names":[],"mappings":";;;AAEO,MAAM,aAAa,GAAG,CAAC,MAAmC,EAAU,EAAE;;IAC3E,MAAM,OAAO,eACX,MAAM,CAAC,OAAO,mCACd,MAAM,CAAC,gBAAgB,mCACvB,OAAC,MAAM,CAAC,UAAU,mCAAI,CAAC,CAAC;QACtB,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,gBAAgB,KAAK,SAAS;YACpE,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,OAAC,MAAM,CAAC,OAAO,mCAAI,MAAM,CAAC,gBAAiB,CAAC,GAAG,GAAG,CAAC,CAAC;IAC5D,MAAM,OAAO,eACX,MAAM,CAAC,OAAO,mCACd,MAAM,CAAC,gBAAgB,mCACvB,OAAC,MAAM,CAAC,UAAU,mCAAI,CAAC,CAAC;QACtB,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,gBAAgB,KAAK,SAAS;YACpE,CAAC,CAAC,GAAG;YACL,CAAC,CAAC,OAAC,MAAM,CAAC,OAAO,mCAAI,MAAM,CAAC,gBAAiB,CAAC,GAAG,GAAG,CAAC,CAAC;IAC5D,IAAI,OAAO,GAAG,OAAO;QACnB,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IAClE,OAAO,MAAM,CAAC,UAAU,KAAK,SAAS;QACpC,CAAC,CAAC,MAAM,CAAC;YACL,OAAO;YACP,OAAO;YACP,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,KAAK,SAAS;YACvD,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,KAAK,SAAS;SACxD,CAAC;QACJ,CAAC,CAAC,QAAQ,CAAC;YACP,OAAO;YACP,OAAO;YACP,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,KAAK,SAAS;YACvD,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,KAAK,SAAS;SACxD,CAAC,CAAC;AACT,CAAC,CAAC;AA/BW,QAAA,aAAa,GAAb,aAAa,CA+BxB;AAEF,MAAM,MAAM,GAAG,CAAC,CAKf,EAAU,EAAE;IACX,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,gBAAgB,CAAC;QACvE,MAAM,IAAI,KAAK,CACb,CAAC,CAAC,gBAAgB;YAChB,CAAC,CAAC,+CAA+C;YACjD,CAAC,CAAC,+CAA+C,CACpD,CAAC;IACJ,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,KAAK,GAAW,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;QAC1E,IAAI,CAAC,CAAC,gBAAgB,IAAI,KAAK,KAAK,CAAC,CAAC,OAAO;YAAE,SAAS;aACnD,IAAI,CAAC,CAAC,gBAAgB,IAAI,KAAK,KAAK,CAAC,CAAC,OAAO;YAAE,SAAS;QAC7D,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,CAAC,CAMjB,EAAU,EAAE;IACX,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;IACjE,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;IAClE,IAAI,CAAC,CAAC,gBAAgB,KAAK,IAAI,IAAI,OAAO,GAAG,CAAC,CAAC,UAAU,KAAK,CAAC;QAC7D,OAAO,IAAI,CAAC,CAAC,UAAU,CAAC;IAC1B,IAAI,CAAC,CAAC,gBAAgB,KAAK,IAAI,IAAI,OAAO,GAAG,CAAC,CAAC,UAAU,KAAK,CAAC;QAC7D,OAAO,IAAI,CAAC,CAAC,UAAU,CAAC;IAC1B,IAAI,OAAO,GAAG,OAAO;QACnB,MAAM,IAAI,KAAK,CACb,gEAAgE,CACjE,CAAC;IACJ,MAAM,KAAK,GAAW,MAAM,CAAC;QAC3B,OAAO;QACP,OAAO;QACP,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;QACpC,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;KACrC,CAAC,CAAC;IACH,OAAO,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;AACxC,CAAC,CAAC"}
+{"version":3,"file":"_randomNumber.js","sourceRoot":"","sources":["../../src/internal/_randomNumber.ts"],"names":[],"mappings":";;;AAEA,uDAAoD;AAE7C,MAAM,aAAa,GAAG,CAAC,MAAmC,EAAU,EAAE;;IAC3E,MAAM,KAAK,GAAqB,gBAAgB,CAAC,MAAM,CAAC,CAAC;IACzD,MAAM,KAAK,GAAqB,gBAAgB,CAAC,MAAM,CAAC,CAAC;IACzD,MAAM,OAAO,SACX,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,mCAAI,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC;IAC3D,MAAM,OAAO,SACX,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,mCAAI,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC;IAC7D,IAAI,OAAO,GAAG,OAAO;QACnB,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IAClE,OAAO,MAAM,CAAC,UAAU,KAAK,SAAS;QACpC,CAAC,CAAC,MAAM,CAAC;YACL,OAAO;YACP,OAAO;YACP,gBAAgB,QAAE,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,mCAAI,KAAK;YAC3C,gBAAgB,QAAE,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,mCAAI,KAAK;SAC5C,CAAC;QACJ,CAAC,CAAC,IAAA,iCAAe,EAAC;YACd,OAAO;YACP,OAAO;YACP,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,gBAAgB,QAAE,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,mCAAI,KAAK;YAC3C,gBAAgB,QAAE,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,mCAAI,KAAK;YAC3C,OAAO,EAAE,KAAK;SACf,CAAC,CAAC;AACT,CAAC,CAAC;AAxBW,QAAA,aAAa,GAAb,aAAa,CAwBxB;AAEF,MAAM,MAAM,GAAG,CAAC,KAKf,EAAU,EAAE;IACX,IACE,KAAK,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO;QAC/B,CAAC,KAAK,CAAC,gBAAgB,IAAI,KAAK,CAAC,gBAAgB,CAAC;QAElD,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,MAAM,KAAK,GACT,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAClE,IACE,CAAC,KAAK,CAAC,gBAAgB,IAAI,KAAK,KAAK,KAAK,CAAC,OAAO,CAAC;QACnD,CAAC,KAAK,CAAC,gBAAgB,IAAI,KAAK,KAAK,KAAK,CAAC,OAAO,CAAC,EACnD,CAAC;QACD,MAAM,MAAM,GAAW,KAAK,CAAC,OAAO,GAAG,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC3E,IAAI,MAAM,IAAI,KAAK,CAAC,OAAO,IAAI,MAAM,IAAI,KAAK,CAAC,OAAO;YACpD,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;QACzE,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF,MAAM,gBAAgB,GAAG,CACvB,MAAmC,EACjB,EAAE,CACpB,cAAc,CACZ,MAAM,CAAC,OAAO,KAAK,SAAS;IAC1B,CAAC,CAAC,IAAI;IACN,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,EAC/C,MAAM,CAAC,gBAAgB,KAAK,SAAS;IACnC,CAAC,CAAC,IAAI;IACN,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,EACvD,IAAI,CAAC,GAAG,CACT,CAAC;AAEJ,MAAM,gBAAgB,GAAG,CACvB,MAAmC,EACjB,EAAE,CACpB,cAAc,CACZ,MAAM,CAAC,OAAO,KAAK,SAAS;IAC1B,CAAC,CAAC,IAAI;IACN,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,EAC/C,MAAM,CAAC,gBAAgB,KAAK,SAAS;IACnC,CAAC,CAAC,IAAI;IACN,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,EACvD,IAAI,CAAC,GAAG,CACT,CAAC;AAEJ,MAAM,cAAc,GAAG,CACrB,CAAmB,EACnB,CAAmB,EACnB,OAAyC,EACvB,EAAE;IACpB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;QACrB,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;IACnE,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC,CAAC"}

package/lib/internal/_randomNumber.mjs

@@ -1,43 +1,57 @@
+import { _randomMultiple } from "./_randomMultiple.mjs";
 //#region src/internal/_randomNumber.ts
 const _randomNumber = (schema) => {
-	const minimum = schema.minimum ?? schema.exclusiveMinimum ?? (schema.multipleOf ?? 1) * (schema.maximum === void 0 && schema.exclusiveMaximum === void 0 ? 0 : (schema.maximum ?? schema.exclusiveMaximum) - 100);
-	const maximum = schema.maximum ?? schema.exclusiveMaximum ?? (schema.multipleOf ?? 1) * (schema.minimum === void 0 && schema.exclusiveMinimum === void 0 ? 100 : (schema.minimum ?? schema.exclusiveMinimum) + 100);
+	const lower = getLowerBoundary(schema);
+	const upper = getUpperBoundary(schema);
+	const minimum = lower?.value ?? (upper === null ? 0 : upper.value - 100);
+	const maximum = upper?.value ?? (lower === null ? 100 : lower.value + 100);
 	if (minimum > maximum) throw new Error("Minimum value is greater than maximum value.");
 	return schema.multipleOf === void 0 ? scalar({
 		minimum,
 		maximum,
-		exclusiveMinimum: schema.exclusiveMinimum !== void 0,
-		exclusiveMaximum: schema.exclusiveMaximum !== void 0
-	}) : multiple({
+		exclusiveMinimum: lower?.exclusive ?? false,
+		exclusiveMaximum: upper?.exclusive ?? false
+	}) : _randomMultiple({
 		minimum,
 		maximum,
 		multipleOf: schema.multipleOf,
-		exclusiveMinimum: schema.exclusiveMinimum !== void 0,
-		exclusiveMaximum: schema.exclusiveMaximum !== void 0
+		exclusiveMinimum: lower?.exclusive ?? false,
+		exclusiveMaximum: upper?.exclusive ?? false,
+		integer: false
 	});
 };
-const scalar = (p) => {
-	if (p.minimum === p.maximum && (p.exclusiveMinimum || p.exclusiveMaximum)) throw new Error(p.exclusiveMinimum ? "Exclusive minimum value equals maximum value." : "Exclusive maximum value equals minimum value.");
-	while (true) {
-		const value = Math.random() * (p.maximum - p.minimum) + p.minimum;
-		if (p.exclusiveMinimum && value === p.minimum) continue;
-		else if (p.exclusiveMaximum && value === p.maximum) continue;
-		return value;
+const scalar = (props) => {
+	if (props.minimum === props.maximum && (props.exclusiveMinimum || props.exclusiveMaximum)) throw new Error("Exclusive numeric range is empty.");
+	const value = Math.random() * (props.maximum - props.minimum) + props.minimum;
+	if (props.exclusiveMinimum && value === props.minimum || props.exclusiveMaximum && value === props.maximum) {
+		const middle = props.minimum + (props.maximum - props.minimum) / 2;
+		if (middle <= props.minimum || middle >= props.maximum) throw new Error("Exclusive numeric range has no representable value.");
+		return middle;
 	}
+	return value;
 };
-const multiple = (p) => {
-	let minimum = Math.ceil(p.minimum / p.multipleOf) * p.multipleOf;
-	let maximum = Math.floor(p.maximum / p.multipleOf) * p.multipleOf;
-	if (p.exclusiveMinimum === true && minimum % p.multipleOf === 0) minimum += p.multipleOf;
-	if (p.exclusiveMaximum === true && maximum % p.multipleOf === 0) maximum -= p.multipleOf;
-	if (minimum > maximum) throw new Error("The range of the integer is smaller than the multipleOf value.");
-	const value = scalar({
-		minimum,
-		maximum,
-		exclusiveMinimum: p.exclusiveMinimum,
-		exclusiveMaximum: p.exclusiveMaximum
-	});
-	return value - value % p.multipleOf;
+const getLowerBoundary = (schema) => selectBoundary(schema.minimum === void 0 ? null : {
+	value: schema.minimum,
+	exclusive: false
+}, schema.exclusiveMinimum === void 0 ? null : {
+	value: schema.exclusiveMinimum,
+	exclusive: true
+}, Math.max);
+const getUpperBoundary = (schema) => selectBoundary(schema.maximum === void 0 ? null : {
+	value: schema.maximum,
+	exclusive: false
+}, schema.exclusiveMaximum === void 0 ? null : {
+	value: schema.exclusiveMaximum,
+	exclusive: true
+}, Math.min);
+const selectBoundary = (x, y, compare) => {
+	if (x === null) return y;
+	if (y === null) return x;
+	if (x.value === y.value) return {
+		value: x.value,
+		exclusive: x.exclusive || y.exclusive
+	};
+	return compare(x.value, y.value) === x.value ? x : y;
 };
 //#endregion
 export { _randomNumber };

package/lib/internal/_randomNumber.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"_randomNumber.mjs","names":[],"sources":["../../src/internal/_randomNumber.ts"],"sourcesContent":["import { OpenApi } from \"@typia/interface\";\n\nexport const _randomNumber = (schema: OpenApi.IJsonSchema.INumber): number => {\n  const minimum: number =\n    schema.minimum ??\n    schema.exclusiveMinimum ??\n    (schema.multipleOf ?? 1) *\n      (schema.maximum === undefined && schema.exclusiveMaximum === undefined\n        ? 0\n        : (schema.maximum ?? schema.exclusiveMaximum!) - 100);\n  const maximum: number =\n    schema.maximum ??\n    schema.exclusiveMaximum ??\n    (schema.multipleOf ?? 1) *\n      (schema.minimum === undefined && schema.exclusiveMinimum === undefined\n        ? 100\n        : (schema.minimum ?? schema.exclusiveMinimum!) + 100);\n  if (minimum > maximum)\n    throw new Error(\"Minimum value is greater than maximum value.\");\n  return schema.multipleOf === undefined\n    ? scalar({\n        minimum,\n        maximum,\n        exclusiveMinimum: schema.exclusiveMinimum !== undefined,\n        exclusiveMaximum: schema.exclusiveMaximum !== undefined,\n      })\n    : multiple({\n        minimum,\n        maximum,\n        multipleOf: schema.multipleOf,\n        exclusiveMinimum: schema.exclusiveMinimum !== undefined,\n        exclusiveMaximum: schema.exclusiveMaximum !== undefined,\n      });\n};\n\nconst scalar = (p: {\n  minimum: number;\n  maximum: number;\n  exclusiveMinimum?: boolean;\n  exclusiveMaximum?: boolean;\n}): number => {\n  if (p.minimum === p.maximum && (p.exclusiveMinimum || p.exclusiveMaximum))\n    throw new Error(\n      p.exclusiveMinimum\n        ? \"Exclusive minimum value equals maximum value.\"\n        : \"Exclusive maximum value equals minimum value.\",\n    );\n  while (true) {\n    const value: number = Math.random() * (p.maximum - p.minimum) + p.minimum;\n    if (p.exclusiveMinimum && value === p.minimum) continue;\n    else if (p.exclusiveMaximum && value === p.maximum) continue;\n    return value;\n  }\n};\n\nconst multiple = (p: {\n  minimum: number;\n  maximum: number;\n  multipleOf: number;\n  exclusiveMinimum?: boolean;\n  exclusiveMaximum?: boolean;\n}): number => {\n  let minimum = Math.ceil(p.minimum / p.multipleOf) * p.multipleOf;\n  let maximum = Math.floor(p.maximum / p.multipleOf) * p.multipleOf;\n  if (p.exclusiveMinimum === true && minimum % p.multipleOf === 0)\n    minimum += p.multipleOf;\n  if (p.exclusiveMaximum === true && maximum % p.multipleOf === 0)\n    maximum -= p.multipleOf;\n  if (minimum > maximum)\n    throw new Error(\n      \"The range of the integer is smaller than the multipleOf value.\",\n    );\n  const value: number = scalar({\n    minimum,\n    maximum,\n    exclusiveMinimum: p.exclusiveMinimum,\n    exclusiveMaximum: p.exclusiveMaximum,\n  });\n  return value - (value % p.multipleOf);\n};\n"],"mappings":";AAEA,MAAa,iBAAiB,WAAgD;CAC5E,MAAM,UACJ,OAAO,WACP,OAAO,qBACN,OAAO,cAAc,MACnB,OAAO,YAAY,KAAA,KAAa,OAAO,qBAAqB,KAAA,IACzD,KACC,OAAO,WAAW,OAAO,oBAAqB;CACvD,MAAM,UACJ,OAAO,WACP,OAAO,qBACN,OAAO,cAAc,MACnB,OAAO,YAAY,KAAA,KAAa,OAAO,qBAAqB,KAAA,IACzD,OACC,OAAO,WAAW,OAAO,oBAAqB;CACvD,IAAI,UAAU,SACZ,MAAM,IAAI,MAAM,8CAA8C;CAChE,OAAO,OAAO,eAAe,KAAA,IACzB,OAAO;EACL;EACA;EACA,kBAAkB,OAAO,qBAAqB,KAAA;EAC9C,kBAAkB,OAAO,qBAAqB,KAAA;CAChD,CAAC,IACD,SAAS;EACP;EACA;EACA,YAAY,OAAO;EACnB,kBAAkB,OAAO,qBAAqB,KAAA;EAC9C,kBAAkB,OAAO,qBAAqB,KAAA;CAChD,CAAC;AACP;AAEA,MAAM,UAAU,MAKF;CACZ,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,oBAAoB,EAAE,mBACtD,MAAM,IAAI,MACR,EAAE,mBACE,kDACA,+CACN;CACF,OAAO,MAAM;EACX,MAAM,QAAgB,KAAK,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE;EAClE,IAAI,EAAE,oBAAoB,UAAU,EAAE,SAAS;OAC1C,IAAI,EAAE,oBAAoB,UAAU,EAAE,SAAS;EACpD,OAAO;CACT;AACF;AAEA,MAAM,YAAY,MAMJ;CACZ,IAAI,UAAU,KAAK,KAAK,EAAE,UAAU,EAAE,UAAU,IAAI,EAAE;CACtD,IAAI,UAAU,KAAK,MAAM,EAAE,UAAU,EAAE,UAAU,IAAI,EAAE;CACvD,IAAI,EAAE,qBAAqB,QAAQ,UAAU,EAAE,eAAe,GAC5D,WAAW,EAAE;CACf,IAAI,EAAE,qBAAqB,QAAQ,UAAU,EAAE,eAAe,GAC5D,WAAW,EAAE;CACf,IAAI,UAAU,SACZ,MAAM,IAAI,MACR,gEACF;CACF,MAAM,QAAgB,OAAO;EAC3B;EACA;EACA,kBAAkB,EAAE;EACpB,kBAAkB,EAAE;CACtB,CAAC;CACD,OAAO,QAAS,QAAQ,EAAE;AAC5B"}
+{"version":3,"file":"_randomNumber.mjs","names":[],"sources":["../../src/internal/_randomNumber.ts"],"sourcesContent":["import { OpenApi } from \"@typia/interface\";\n\nimport { _randomMultiple } from \"./_randomMultiple\";\n\nexport const _randomNumber = (schema: OpenApi.IJsonSchema.INumber): number => {\n  const lower: IBoundary | null = getLowerBoundary(schema);\n  const upper: IBoundary | null = getUpperBoundary(schema);\n  const minimum: number =\n    lower?.value ?? (upper === null ? 0 : upper.value - 100);\n  const maximum: number =\n    upper?.value ?? (lower === null ? 100 : lower.value + 100);\n  if (minimum > maximum)\n    throw new Error(\"Minimum value is greater than maximum value.\");\n  return schema.multipleOf === undefined\n    ? scalar({\n        minimum,\n        maximum,\n        exclusiveMinimum: lower?.exclusive ?? false,\n        exclusiveMaximum: upper?.exclusive ?? false,\n      })\n    : _randomMultiple({\n        minimum,\n        maximum,\n        multipleOf: schema.multipleOf,\n        exclusiveMinimum: lower?.exclusive ?? false,\n        exclusiveMaximum: upper?.exclusive ?? false,\n        integer: false,\n      });\n};\n\nconst scalar = (props: {\n  minimum: number;\n  maximum: number;\n  exclusiveMinimum: boolean;\n  exclusiveMaximum: boolean;\n}): number => {\n  if (\n    props.minimum === props.maximum &&\n    (props.exclusiveMinimum || props.exclusiveMaximum)\n  )\n    throw new Error(\"Exclusive numeric range is empty.\");\n  const value: number =\n    Math.random() * (props.maximum - props.minimum) + props.minimum;\n  if (\n    (props.exclusiveMinimum && value === props.minimum) ||\n    (props.exclusiveMaximum && value === props.maximum)\n  ) {\n    const middle: number = props.minimum + (props.maximum - props.minimum) / 2;\n    if (middle <= props.minimum || middle >= props.maximum)\n      throw new Error(\"Exclusive numeric range has no representable value.\");\n    return middle;\n  }\n  return value;\n};\n\nconst getLowerBoundary = (\n  schema: OpenApi.IJsonSchema.INumber,\n): IBoundary | null =>\n  selectBoundary(\n    schema.minimum === undefined\n      ? null\n      : { value: schema.minimum, exclusive: false },\n    schema.exclusiveMinimum === undefined\n      ? null\n      : { value: schema.exclusiveMinimum, exclusive: true },\n    Math.max,\n  );\n\nconst getUpperBoundary = (\n  schema: OpenApi.IJsonSchema.INumber,\n): IBoundary | null =>\n  selectBoundary(\n    schema.maximum === undefined\n      ? null\n      : { value: schema.maximum, exclusive: false },\n    schema.exclusiveMaximum === undefined\n      ? null\n      : { value: schema.exclusiveMaximum, exclusive: true },\n    Math.min,\n  );\n\nconst selectBoundary = (\n  x: IBoundary | null,\n  y: IBoundary | null,\n  compare: (x: number, y: number) => number,\n): IBoundary | null => {\n  if (x === null) return y;\n  if (y === null) return x;\n  if (x.value === y.value)\n    return { value: x.value, exclusive: x.exclusive || y.exclusive };\n  return compare(x.value, y.value) === x.value ? x : y;\n};\n\ninterface IBoundary {\n  value: number;\n  exclusive: boolean;\n}\n"],"mappings":";;AAIA,MAAa,iBAAiB,WAAgD;CAC5E,MAAM,QAA0B,iBAAiB,MAAM;CACvD,MAAM,QAA0B,iBAAiB,MAAM;CACvD,MAAM,UACJ,OAAO,UAAU,UAAU,OAAO,IAAI,MAAM,QAAQ;CACtD,MAAM,UACJ,OAAO,UAAU,UAAU,OAAO,MAAM,MAAM,QAAQ;CACxD,IAAI,UAAU,SACZ,MAAM,IAAI,MAAM,8CAA8C;CAChE,OAAO,OAAO,eAAe,KAAA,IACzB,OAAO;EACL;EACA;EACA,kBAAkB,OAAO,aAAa;EACtC,kBAAkB,OAAO,aAAa;CACxC,CAAC,IACD,gBAAgB;EACd;EACA;EACA,YAAY,OAAO;EACnB,kBAAkB,OAAO,aAAa;EACtC,kBAAkB,OAAO,aAAa;EACtC,SAAS;CACX,CAAC;AACP;AAEA,MAAM,UAAU,UAKF;CACZ,IACE,MAAM,YAAY,MAAM,YACvB,MAAM,oBAAoB,MAAM,mBAEjC,MAAM,IAAI,MAAM,mCAAmC;CACrD,MAAM,QACJ,KAAK,OAAO,KAAK,MAAM,UAAU,MAAM,WAAW,MAAM;CAC1D,IACG,MAAM,oBAAoB,UAAU,MAAM,WAC1C,MAAM,oBAAoB,UAAU,MAAM,SAC3C;EACA,MAAM,SAAiB,MAAM,WAAW,MAAM,UAAU,MAAM,WAAW;EACzE,IAAI,UAAU,MAAM,WAAW,UAAU,MAAM,SAC7C,MAAM,IAAI,MAAM,qDAAqD;EACvE,OAAO;CACT;CACA,OAAO;AACT;AAEA,MAAM,oBACJ,WAEA,eACE,OAAO,YAAY,KAAA,IACf,OACA;CAAE,OAAO,OAAO;CAAS,WAAW;AAAM,GAC9C,OAAO,qBAAqB,KAAA,IACxB,OACA;CAAE,OAAO,OAAO;CAAkB,WAAW;AAAK,GACtD,KAAK,GACP;AAEF,MAAM,oBACJ,WAEA,eACE,OAAO,YAAY,KAAA,IACf,OACA;CAAE,OAAO,OAAO;CAAS,WAAW;AAAM,GAC9C,OAAO,qBAAqB,KAAA,IACxB,OACA;CAAE,OAAO,OAAO;CAAkB,WAAW;AAAK,GACtD,KAAK,GACP;AAEF,MAAM,kBACJ,GACA,GACA,YACqB;CACrB,IAAI,MAAM,MAAM,OAAO;CACvB,IAAI,MAAM,MAAM,OAAO;CACvB,IAAI,EAAE,UAAU,EAAE,OAChB,OAAO;EAAE,OAAO,EAAE;EAAO,WAAW,EAAE,aAAa,EAAE;CAAU;CACjE,OAAO,QAAQ,EAAE,OAAO,EAAE,KAAK,MAAM,EAAE,QAAQ,IAAI;AACrD"}

package/lib/internal/_randomPattern.d.ts

@@ -1 +1,2 @@
-export declare const _randomPattern: (regex: RegExp) => string;
+import { _ILengthProps } from "./_randomStringLength";
+export declare const _randomPattern: (regex: RegExp, props?: _ILengthProps) => string;

package/lib/internal/_randomPattern.js

@@ -5,14 +5,29 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports._randomPattern = void 0;
 const randexp_1 = __importDefault(require("randexp"));
-const _randomPattern = (regex) => {
+const _randomPattern = (regex, props) => {
     const r = new randexp_1.default(regex);
-    for (let i = 0; i < 10; ++i) {
+    const min = props === null || props === void 0 ? void 0 : props.minLength;
+    const max = props === null || props === void 0 ? void 0 : props.maxLength;
+    // RandExp expands an unbounded quantifier to `randInt(token.min, token.min +
+    // r.max)`, so steering `r.max` biases the generated length toward the window.
+    // There is no matching floor control, so the length is still verified below.
+    if (max !== undefined)
+        r.max = max;
+    else if (min !== undefined && min * 2 > r.max)
+        r.max = min * 2;
+    const bounded = min !== undefined || max !== undefined;
+    const limit = bounded ? 1024 : 10;
+    for (let i = 0; i < limit; ++i) {
         const str = r.gen();
-        if (regex.test(str))
+        if (regex.test(str) &&
+            (min === undefined || str.length >= min) &&
+            (max === undefined || str.length <= max))
             return str;
     }
-    return r.gen();
+    throw new Error(bounded
+        ? "unable to generate a random string matching the pattern within the length range."
+        : "unable to generate a random string matching the pattern.");
 };
 exports._randomPattern = _randomPattern;
 //# sourceMappingURL=_randomPattern.js.map

package/lib/internal/_randomPattern.js.map

@@ -1 +1 @@
-{"version":3,"file":"_randomPattern.js","sourceRoot":"","sources":["../../src/internal/_randomPattern.ts"],"names":[],"mappings":";;;;;;AAAA,sDAA8B;AAEvB,MAAM,cAAc,GAAG,CAAC,KAAa,EAAU,EAAE;IACtD,MAAM,CAAC,GAAY,IAAI,iBAAO,CAAC,KAAK,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACpC,MAAM,GAAG,GAAW,CAAC,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;IAClC,CAAC;IACD,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;AACjB,CAAC,CAAC;AAPW,QAAA,cAAc,GAAd,cAAc,CAOzB"}
+{"version":3,"file":"_randomPattern.js","sourceRoot":"","sources":["../../src/internal/_randomPattern.ts"],"names":[],"mappings":";;;;;;AAAA,sDAA8B;AAIvB,MAAM,cAAc,GAAG,CAAC,KAAa,EAAE,KAAqB,EAAU,EAAE;IAC7E,MAAM,CAAC,GAAY,IAAI,iBAAO,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,GAAG,GAAuB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,CAAC;IACjD,MAAM,GAAG,GAAuB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,CAAC;IAEjD,6EAA6E;IAC7E,8EAA8E;IAC9E,6EAA6E;IAC7E,IAAI,GAAG,KAAK,SAAS;QAAE,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;SAC9B,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG;QAAE,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;IAE/D,MAAM,OAAO,GAAY,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,CAAC;IAChE,MAAM,KAAK,GAAW,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC;QACvC,MAAM,GAAG,GAAW,CAAC,CAAC,GAAG,EAAE,CAAC;QAC5B,IACE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;YACf,CAAC,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC;YACxC,CAAC,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC;YAExC,OAAO,GAAG,CAAC;IACf,CAAC;IACD,MAAM,IAAI,KAAK,CACb,OAAO;QACL,CAAC,CAAC,kFAAkF;QACpF,CAAC,CAAC,0DAA0D,CAC/D,CAAC;AACJ,CAAC,CAAC;AA3BW,QAAA,cAAc,GAAd,cAAc,CA2BzB"}

package/lib/internal/_randomPattern.mjs

@@ -1,12 +1,18 @@
 import RandExp from "randexp";
 //#region src/internal/_randomPattern.ts
-const _randomPattern = (regex) => {
+const _randomPattern = (regex, props) => {
 	const r = new RandExp(regex);
-	for (let i = 0; i < 10; ++i) {
+	const min = props?.minLength;
+	const max = props?.maxLength;
+	if (max !== void 0) r.max = max;
+	else if (min !== void 0 && min * 2 > r.max) r.max = min * 2;
+	const bounded = min !== void 0 || max !== void 0;
+	const limit = bounded ? 1024 : 10;
+	for (let i = 0; i < limit; ++i) {
 		const str = r.gen();
-		if (regex.test(str)) return str;
+		if (regex.test(str) && (min === void 0 || str.length >= min) && (max === void 0 || str.length <= max)) return str;
 	}
-	return r.gen();
+	throw new Error(bounded ? "unable to generate a random string matching the pattern within the length range." : "unable to generate a random string matching the pattern.");
 };
 //#endregion
 export { _randomPattern };

package/lib/internal/_randomPattern.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"_randomPattern.mjs","names":[],"sources":["../../src/internal/_randomPattern.ts"],"sourcesContent":["import RandExp from \"randexp\";\n\nexport const _randomPattern = (regex: RegExp): string => {\n  const r: RandExp = new RandExp(regex);\n  for (let i: number = 0; i < 10; ++i) {\n    const str: string = r.gen();\n    if (regex.test(str)) return str;\n  }\n  return r.gen();\n};\n"],"mappings":";;AAEA,MAAa,kBAAkB,UAA0B;CACvD,MAAM,IAAa,IAAI,QAAQ,KAAK;CACpC,KAAK,IAAI,IAAY,GAAG,IAAI,IAAI,EAAE,GAAG;EACnC,MAAM,MAAc,EAAE,IAAI;EAC1B,IAAI,MAAM,KAAK,GAAG,GAAG,OAAO;CAC9B;CACA,OAAO,EAAE,IAAI;AACf"}
+{"version":3,"file":"_randomPattern.mjs","names":[],"sources":["../../src/internal/_randomPattern.ts"],"sourcesContent":["import RandExp from \"randexp\";\n\nimport { _ILengthProps } from \"./_randomStringLength\";\n\nexport const _randomPattern = (regex: RegExp, props?: _ILengthProps): string => {\n  const r: RandExp = new RandExp(regex);\n  const min: number | undefined = props?.minLength;\n  const max: number | undefined = props?.maxLength;\n\n  // RandExp expands an unbounded quantifier to `randInt(token.min, token.min +\n  // r.max)`, so steering `r.max` biases the generated length toward the window.\n  // There is no matching floor control, so the length is still verified below.\n  if (max !== undefined) r.max = max;\n  else if (min !== undefined && min * 2 > r.max) r.max = min * 2;\n\n  const bounded: boolean = min !== undefined || max !== undefined;\n  const limit: number = bounded ? 1024 : 10;\n  for (let i: number = 0; i < limit; ++i) {\n    const str: string = r.gen();\n    if (\n      regex.test(str) &&\n      (min === undefined || str.length >= min) &&\n      (max === undefined || str.length <= max)\n    )\n      return str;\n  }\n  throw new Error(\n    bounded\n      ? \"unable to generate a random string matching the pattern within the length range.\"\n      : \"unable to generate a random string matching the pattern.\",\n  );\n};\n"],"mappings":";;AAIA,MAAa,kBAAkB,OAAe,UAAkC;CAC9E,MAAM,IAAa,IAAI,QAAQ,KAAK;CACpC,MAAM,MAA0B,OAAO;CACvC,MAAM,MAA0B,OAAO;CAKvC,IAAI,QAAQ,KAAA,GAAW,EAAE,MAAM;MAC1B,IAAI,QAAQ,KAAA,KAAa,MAAM,IAAI,EAAE,KAAK,EAAE,MAAM,MAAM;CAE7D,MAAM,UAAmB,QAAQ,KAAA,KAAa,QAAQ,KAAA;CACtD,MAAM,QAAgB,UAAU,OAAO;CACvC,KAAK,IAAI,IAAY,GAAG,IAAI,OAAO,EAAE,GAAG;EACtC,MAAM,MAAc,EAAE,IAAI;EAC1B,IACE,MAAM,KAAK,GAAG,MACb,QAAQ,KAAA,KAAa,IAAI,UAAU,SACnC,QAAQ,KAAA,KAAa,IAAI,UAAU,MAEpC,OAAO;CACX;CACA,MAAM,IAAI,MACR,UACI,qFACA,0DACN;AACF"}

package/lib/internal/_randomStringLength.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Length bounds forwarded to a string format or pattern generator.
+ *
+ * `typia.random<T>()` passes this object to the `_randomFormat*` and
+ * `_randomPattern` helpers whenever the string leaf also carries a `MinLength`
+ * or `MaxLength` tag, so a constrained format or pattern is generated at a
+ * length its own validator accepts (issue #2189).
+ */
+export interface _ILengthProps {
+    minLength?: number;
+    maxLength?: number;
+}
+/**
+ * Builds the variable segment of a fixed-shape format string so that the total
+ * length `fixed + segment.length` lands inside the requested window.
+ *
+ * `fixed` is the number of characters the format always contributes around the
+ * segment, `fallback` is the segment length used when the leaf is
+ * unconstrained on that side, and `minimum` is the smallest segment the format
+ * still validates with. Throws when the window cannot be satisfied by this
+ * format's shape (e.g. `Format<"email"> & MaxLength<3>`).
+ */
+export declare const _randomSegmentLength: (props: _ILengthProps | undefined, fixed: number, fallback: number, minimum: number) => string;
+/**
+ * Wraps a fixed- or narrow-length format generator (uuid, ipv4, date, ...) with
+ * the requested length window.
+ *
+ * These formats cannot grow an arbitrary segment, so the generator is retried a
+ * bounded number of times and the first draw inside the window is returned. A
+ * window that excludes every length the format can produce is unsatisfiable and
+ * throws instead of silently yielding an out-of-range value.
+ */
+export declare const _randomFormatLength: (props: _ILengthProps | undefined, generate: () => string) => string;

package/lib/internal/_randomStringLength.js

@@ -0,0 +1,48 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports._randomFormatLength = exports._randomSegmentLength = void 0;
+const _randomString_1 = require("./_randomString");
+/**
+ * Builds the variable segment of a fixed-shape format string so that the total
+ * length `fixed + segment.length` lands inside the requested window.
+ *
+ * `fixed` is the number of characters the format always contributes around the
+ * segment, `fallback` is the segment length used when the leaf is
+ * unconstrained on that side, and `minimum` is the smallest segment the format
+ * still validates with. Throws when the window cannot be satisfied by this
+ * format's shape (e.g. `Format<"email"> & MaxLength<3>`).
+ */
+const _randomSegmentLength = (props, fixed, fallback, minimum) => {
+    let low = (props === null || props === void 0 ? void 0 : props.minLength) === undefined ? minimum : props.minLength - fixed;
+    if (low < minimum)
+        low = minimum;
+    // With only a lower bound, spread the segment across `fallback` extra
+    // characters so the generated length varies, mirroring `_randomString`.
+    const high = (props === null || props === void 0 ? void 0 : props.maxLength) === undefined ? low + fallback : props.maxLength - fixed;
+    if (high < low || high < minimum)
+        throw new Error("unable to generate a random string satisfying both the format and the length constraints.");
+    return (0, _randomString_1._randomString)({ type: "string", minLength: low, maxLength: high });
+};
+exports._randomSegmentLength = _randomSegmentLength;
+/**
+ * Wraps a fixed- or narrow-length format generator (uuid, ipv4, date, ...) with
+ * the requested length window.
+ *
+ * These formats cannot grow an arbitrary segment, so the generator is retried a
+ * bounded number of times and the first draw inside the window is returned. A
+ * window that excludes every length the format can produce is unsatisfiable and
+ * throws instead of silently yielding an out-of-range value.
+ */
+const _randomFormatLength = (props, generate) => {
+    if ((props === null || props === void 0 ? void 0 : props.minLength) === undefined && (props === null || props === void 0 ? void 0 : props.maxLength) === undefined)
+        return generate();
+    for (let i = 0; i < 256; ++i) {
+        const value = generate();
+        if ((props.minLength === undefined || value.length >= props.minLength) &&
+            (props.maxLength === undefined || value.length <= props.maxLength))
+            return value;
+    }
+    throw new Error("unable to generate a random string satisfying both the format and the length constraints.");
+};
+exports._randomFormatLength = _randomFormatLength;
+//# sourceMappingURL=_randomStringLength.js.map

package/lib/internal/_randomStringLength.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_randomStringLength.js","sourceRoot":"","sources":["../../src/internal/_randomStringLength.ts"],"names":[],"mappings":";;;AAAA,mDAAgD;AAehD;;;;;;;;;GASG;AACI,MAAM,oBAAoB,GAAG,CAClC,KAAgC,EAChC,KAAa,EACb,QAAgB,EAChB,OAAe,EACP,EAAE;IACV,IAAI,GAAG,GACL,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,MAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC;IACrE,IAAI,GAAG,GAAG,OAAO;QAAE,GAAG,GAAG,OAAO,CAAC;IACjC,sEAAsE;IACtE,wEAAwE;IACxE,MAAM,IAAI,GACR,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,MAAK,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC;IAC5E,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,OAAO;QAC9B,MAAM,IAAI,KAAK,CACb,2FAA2F,CAC5F,CAAC;IACJ,OAAO,IAAA,6BAAa,EAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;AAC5E,CAAC,CAAC;AAlBW,QAAA,oBAAoB,GAApB,oBAAoB,CAkB/B;AAEF;;;;;;;;GAQG;AACI,MAAM,mBAAmB,GAAG,CACjC,KAAgC,EAChC,QAAsB,EACd,EAAE;IACV,IAAI,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,MAAK,SAAS,IAAI,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,MAAK,SAAS;QAClE,OAAO,QAAQ,EAAE,CAAC;IACpB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC;QACrC,MAAM,KAAK,GAAW,QAAQ,EAAE,CAAC;QACjC,IACE,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC;YAClE,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC;YAElE,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,MAAM,IAAI,KAAK,CACb,2FAA2F,CAC5F,CAAC;AACJ,CAAC,CAAC;AAjBW,QAAA,mBAAmB,GAAnB,mBAAmB,CAiB9B"}

package/lib/internal/_randomStringLength.mjs

@@ -0,0 +1,44 @@
+import { _randomString } from "./_randomString.mjs";
+//#region src/internal/_randomStringLength.ts
+/**
+* Builds the variable segment of a fixed-shape format string so that the total
+* length `fixed + segment.length` lands inside the requested window.
+*
+* `fixed` is the number of characters the format always contributes around the
+* segment, `fallback` is the segment length used when the leaf is
+* unconstrained on that side, and `minimum` is the smallest segment the format
+* still validates with. Throws when the window cannot be satisfied by this
+* format's shape (e.g. `Format<"email"> & MaxLength<3>`).
+*/
+const _randomSegmentLength = (props, fixed, fallback, minimum) => {
+	let low = props?.minLength === void 0 ? minimum : props.minLength - fixed;
+	if (low < minimum) low = minimum;
+	const high = props?.maxLength === void 0 ? low + fallback : props.maxLength - fixed;
+	if (high < low || high < minimum) throw new Error("unable to generate a random string satisfying both the format and the length constraints.");
+	return _randomString({
+		type: "string",
+		minLength: low,
+		maxLength: high
+	});
+};
+/**
+* Wraps a fixed- or narrow-length format generator (uuid, ipv4, date, ...) with
+* the requested length window.
+*
+* These formats cannot grow an arbitrary segment, so the generator is retried a
+* bounded number of times and the first draw inside the window is returned. A
+* window that excludes every length the format can produce is unsatisfiable and
+* throws instead of silently yielding an out-of-range value.
+*/
+const _randomFormatLength = (props, generate) => {
+	if (props?.minLength === void 0 && props?.maxLength === void 0) return generate();
+	for (let i = 0; i < 256; ++i) {
+		const value = generate();
+		if ((props.minLength === void 0 || value.length >= props.minLength) && (props.maxLength === void 0 || value.length <= props.maxLength)) return value;
+	}
+	throw new Error("unable to generate a random string satisfying both the format and the length constraints.");
+};
+//#endregion
+export { _randomFormatLength, _randomSegmentLength };
+
+//# sourceMappingURL=_randomStringLength.mjs.map

package/lib/internal/_randomStringLength.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"_randomStringLength.mjs","names":[],"sources":["../../src/internal/_randomStringLength.ts"],"sourcesContent":["import { _randomString } from \"./_randomString\";\n\n/**\n * Length bounds forwarded to a string format or pattern generator.\n *\n * `typia.random<T>()` passes this object to the `_randomFormat*` and\n * `_randomPattern` helpers whenever the string leaf also carries a `MinLength`\n * or `MaxLength` tag, so a constrained format or pattern is generated at a\n * length its own validator accepts (issue #2189).\n */\nexport interface _ILengthProps {\n  minLength?: number;\n  maxLength?: number;\n}\n\n/**\n * Builds the variable segment of a fixed-shape format string so that the total\n * length `fixed + segment.length` lands inside the requested window.\n *\n * `fixed` is the number of characters the format always contributes around the\n * segment, `fallback` is the segment length used when the leaf is\n * unconstrained on that side, and `minimum` is the smallest segment the format\n * still validates with. Throws when the window cannot be satisfied by this\n * format's shape (e.g. `Format<\"email\"> & MaxLength<3>`).\n */\nexport const _randomSegmentLength = (\n  props: _ILengthProps | undefined,\n  fixed: number,\n  fallback: number,\n  minimum: number,\n): string => {\n  let low: number =\n    props?.minLength === undefined ? minimum : props.minLength - fixed;\n  if (low < minimum) low = minimum;\n  // With only a lower bound, spread the segment across `fallback` extra\n  // characters so the generated length varies, mirroring `_randomString`.\n  const high: number =\n    props?.maxLength === undefined ? low + fallback : props.maxLength - fixed;\n  if (high < low || high < minimum)\n    throw new Error(\n      \"unable to generate a random string satisfying both the format and the length constraints.\",\n    );\n  return _randomString({ type: \"string\", minLength: low, maxLength: high });\n};\n\n/**\n * Wraps a fixed- or narrow-length format generator (uuid, ipv4, date, ...) with\n * the requested length window.\n *\n * These formats cannot grow an arbitrary segment, so the generator is retried a\n * bounded number of times and the first draw inside the window is returned. A\n * window that excludes every length the format can produce is unsatisfiable and\n * throws instead of silently yielding an out-of-range value.\n */\nexport const _randomFormatLength = (\n  props: _ILengthProps | undefined,\n  generate: () => string,\n): string => {\n  if (props?.minLength === undefined && props?.maxLength === undefined)\n    return generate();\n  for (let i: number = 0; i < 256; ++i) {\n    const value: string = generate();\n    if (\n      (props.minLength === undefined || value.length >= props.minLength) &&\n      (props.maxLength === undefined || value.length <= props.maxLength)\n    )\n      return value;\n  }\n  throw new Error(\n    \"unable to generate a random string satisfying both the format and the length constraints.\",\n  );\n};\n"],"mappings":";;;;;;;;;;;;AAyBA,MAAa,wBACX,OACA,OACA,UACA,YACW;CACX,IAAI,MACF,OAAO,cAAc,KAAA,IAAY,UAAU,MAAM,YAAY;CAC/D,IAAI,MAAM,SAAS,MAAM;CAGzB,MAAM,OACJ,OAAO,cAAc,KAAA,IAAY,MAAM,WAAW,MAAM,YAAY;CACtE,IAAI,OAAO,OAAO,OAAO,SACvB,MAAM,IAAI,MACR,2FACF;CACF,OAAO,cAAc;EAAE,MAAM;EAAU,WAAW;EAAK,WAAW;CAAK,CAAC;AAC1E;;;;;;;;;;AAWA,MAAa,uBACX,OACA,aACW;CACX,IAAI,OAAO,cAAc,KAAA,KAAa,OAAO,cAAc,KAAA,GACzD,OAAO,SAAS;CAClB,KAAK,IAAI,IAAY,GAAG,IAAI,KAAK,EAAE,GAAG;EACpC,MAAM,QAAgB,SAAS;EAC/B,KACG,MAAM,cAAc,KAAA,KAAa,MAAM,UAAU,MAAM,eACvD,MAAM,cAAc,KAAA,KAAa,MAAM,UAAU,MAAM,YAExD,OAAO;CACX;CACA,MAAM,IAAI,MACR,2FACF;AACF"}

package/lib/internal/_stringLength.d.ts

@@ -0,0 +1 @@
+export declare const _stringLength: (value: string) => number;

package/lib/internal/_stringLength.js

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports._stringLength = void 0;
+const _stringLength = (value) => {
+    let count = 0;
+    for (const _ch of value)
+        ++count;
+    return count;
+};
+exports._stringLength = _stringLength;
+//# sourceMappingURL=_stringLength.js.map

package/lib/internal/_stringLength.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_stringLength.js","sourceRoot":"","sources":["../../src/internal/_stringLength.ts"],"names":[],"mappings":";;;AAAO,MAAM,aAAa,GAAG,CAAC,KAAa,EAAU,EAAE;IACrD,IAAI,KAAK,GAAW,CAAC,CAAC;IACtB,KAAK,MAAM,GAAG,IAAI,KAAK;QAAE,EAAE,KAAK,CAAC;IACjC,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAJW,QAAA,aAAa,GAAb,aAAa,CAIxB"}

package/lib/internal/_stringLength.mjs

@@ -0,0 +1,10 @@
+//#region src/internal/_stringLength.ts
+const _stringLength = (value) => {
+	let count = 0;
+	for (const _ch of value) ++count;
+	return count;
+};
+//#endregion
+export { _stringLength };
+
+//# sourceMappingURL=_stringLength.mjs.map

package/lib/internal/_stringLength.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"_stringLength.mjs","names":[],"sources":["../../src/internal/_stringLength.ts"],"sourcesContent":["export const _stringLength = (value: string): number => {\n  let count: number = 0;\n  for (const _ch of value) ++count;\n  return count;\n};\n"],"mappings":";AAAA,MAAa,iBAAiB,UAA0B;CACtD,IAAI,QAAgB;CACpB,KAAK,MAAM,OAAO,OAAO,EAAE;CAC3B,OAAO;AACT"}

package/lib/internal/_validateReport.js

@@ -2,11 +2,14 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports._validateReport = void 0;
 const _validateReport = (array) => {
+    const isAncestor = (ancestor, descendant) => descendant === ancestor ||
+        descendant.startsWith(`${ancestor}.`) ||
+        descendant.startsWith(`${ancestor}[`);
     const reportable = (path) => {
         if (array.length === 0)
             return true;
         const last = array[array.length - 1].path;
-        return path.length > last.length || last.substring(0, path.length) !== path;
+        return isAncestor(path, last) === false && isAncestor(last, path) === false;
     };
     return (exceptable, error) => {
         var _a;

package/lib/internal/_validateReport.js.map

@@ -1 +1 @@
-{"version":3,"file":"_validateReport.js","sourceRoot":"","sources":["../../src/internal/_validateReport.ts"],"names":[],"mappings":";;;AAEO,MAAM,eAAe,GAAG,CAAC,KAA2B,EAAE,EAAE;IAC7D,MAAM,UAAU,GAAG,CAAC,IAAY,EAAW,EAAE;QAC3C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,MAAM,IAAI,GAAW,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,IAAI,CAAC;QACnD,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC;IAC9E,CAAC,CAAC;IACF,OAAO,CAAC,UAAmB,EAAE,KAAyB,EAAS,EAAE;;QAC/D,IAAI,UAAU,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;gBAC3B,MAAA,KAAK,CAAC,WAAW,oCAAjB,KAAK,CAAC,WAAW,GAAK;oBACpB,wCAAwC;oBACxC,EAAE;oBACF,qBAAqB,KAAK,CAAC,QAAQ,2BAA2B;iBAC/D,CAAC,IAAI,CAAC,IAAI,CAAC,EAAC;YACf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;AACJ,CAAC,CAAC;AAlBW,QAAA,eAAe,GAAf,eAAe,CAkB1B"}
+{"version":3,"file":"_validateReport.js","sourceRoot":"","sources":["../../src/internal/_validateReport.ts"],"names":[],"mappings":";;;AAEO,MAAM,eAAe,GAAG,CAAC,KAA2B,EAAE,EAAE;IAC7D,MAAM,UAAU,GAAG,CAAC,QAAgB,EAAE,UAAkB,EAAW,EAAE,CACnE,UAAU,KAAK,QAAQ;QACvB,UAAU,CAAC,UAAU,CAAC,GAAG,QAAQ,GAAG,CAAC;QACrC,UAAU,CAAC,UAAU,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC;IACxC,MAAM,UAAU,GAAG,CAAC,IAAY,EAAW,EAAE;QAC3C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,MAAM,IAAI,GAAW,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,IAAI,CAAC;QACnD,OAAO,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,KAAK,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,KAAK,CAAC;IAC9E,CAAC,CAAC;IACF,OAAO,CAAC,UAAmB,EAAE,KAAyB,EAAS,EAAE;;QAC/D,IAAI,UAAU,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;gBAC3B,MAAA,KAAK,CAAC,WAAW,oCAAjB,KAAK,CAAC,WAAW,GAAK;oBACpB,wCAAwC;oBACxC,EAAE;oBACF,qBAAqB,KAAK,CAAC,QAAQ,2BAA2B;iBAC/D,CAAC,IAAI,CAAC,IAAI,CAAC,EAAC;YACf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;AACJ,CAAC,CAAC;AAtBW,QAAA,eAAe,GAAf,eAAe,CAsB1B"}

package/lib/internal/_validateReport.mjs

@@ -1,9 +1,10 @@
 //#region src/internal/_validateReport.ts
 const _validateReport = (array) => {
+	const isAncestor = (ancestor, descendant) => descendant === ancestor || descendant.startsWith(`${ancestor}.`) || descendant.startsWith(`${ancestor}[`);
 	const reportable = (path) => {
 		if (array.length === 0) return true;
 		const last = array[array.length - 1].path;
-		return path.length > last.length || last.substring(0, path.length) !== path;
+		return isAncestor(path, last) === false && isAncestor(last, path) === false;
 	};
 	return (exceptable, error) => {
 		if (exceptable && reportable(error.path)) {

package/lib/internal/_validateReport.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"_validateReport.mjs","names":[],"sources":["../../src/internal/_validateReport.ts"],"sourcesContent":["import { IValidation } from \"@typia/interface\";\n\nexport const _validateReport = (array: IValidation.IError[]) => {\n  const reportable = (path: string): boolean => {\n    if (array.length === 0) return true;\n    const last: string = array[array.length - 1]!.path;\n    return path.length > last.length || last.substring(0, path.length) !== path;\n  };\n  return (exceptable: boolean, error: IValidation.IError): false => {\n    if (exceptable && reportable(error.path)) {\n      if (error.value === undefined)\n        error.description ??= [\n          \"The value at this path is `undefined`.\",\n          \"\",\n          `Please fill the \\`${error.expected}\\` typed value next time.`,\n        ].join(\"\\n\");\n      array.push(error);\n    }\n    return false;\n  };\n};\n"],"mappings":";AAEA,MAAa,mBAAmB,UAAgC;CAC9D,MAAM,cAAc,SAA0B;EAC5C,IAAI,MAAM,WAAW,GAAG,OAAO;EAC/B,MAAM,OAAe,MAAM,MAAM,SAAS,EAAE,CAAE;EAC9C,OAAO,KAAK,SAAS,KAAK,UAAU,KAAK,UAAU,GAAG,KAAK,MAAM,MAAM;CACzE;CACA,QAAQ,YAAqB,UAAqC;EAChE,IAAI,cAAc,WAAW,MAAM,IAAI,GAAG;GACxC,IAAI,MAAM,UAAU,KAAA,GAClB,MAAM,gBAAgB;IACpB;IACA;IACA,qBAAqB,MAAM,SAAS;GACtC,CAAC,CAAC,KAAK,IAAI;GACb,MAAM,KAAK,KAAK;EAClB;EACA,OAAO;CACT;AACF"}
+{"version":3,"file":"_validateReport.mjs","names":[],"sources":["../../src/internal/_validateReport.ts"],"sourcesContent":["import { IValidation } from \"@typia/interface\";\n\nexport const _validateReport = (array: IValidation.IError[]) => {\n  const isAncestor = (ancestor: string, descendant: string): boolean =>\n    descendant === ancestor ||\n    descendant.startsWith(`${ancestor}.`) ||\n    descendant.startsWith(`${ancestor}[`);\n  const reportable = (path: string): boolean => {\n    if (array.length === 0) return true;\n    const last: string = array[array.length - 1]!.path;\n    return isAncestor(path, last) === false && isAncestor(last, path) === false;\n  };\n  return (exceptable: boolean, error: IValidation.IError): false => {\n    if (exceptable && reportable(error.path)) {\n      if (error.value === undefined)\n        error.description ??= [\n          \"The value at this path is `undefined`.\",\n          \"\",\n          `Please fill the \\`${error.expected}\\` typed value next time.`,\n        ].join(\"\\n\");\n      array.push(error);\n    }\n    return false;\n  };\n};\n"],"mappings":";AAEA,MAAa,mBAAmB,UAAgC;CAC9D,MAAM,cAAc,UAAkB,eACpC,eAAe,YACf,WAAW,WAAW,GAAG,SAAS,EAAE,KACpC,WAAW,WAAW,GAAG,SAAS,EAAE;CACtC,MAAM,cAAc,SAA0B;EAC5C,IAAI,MAAM,WAAW,GAAG,OAAO;EAC/B,MAAM,OAAe,MAAM,MAAM,SAAS,EAAE,CAAE;EAC9C,OAAO,WAAW,MAAM,IAAI,MAAM,SAAS,WAAW,MAAM,IAAI,MAAM;CACxE;CACA,QAAQ,YAAqB,UAAqC;EAChE,IAAI,cAAc,WAAW,MAAM,IAAI,GAAG;GACxC,IAAI,MAAM,UAAU,KAAA,GAClB,MAAM,gBAAgB;IACpB;IACA;IACA,qBAAqB,MAAM,SAAS;GACtC,CAAC,CAAC,KAAK,IAAI;GACb,MAAM,KAAK,KAAK;EAClB;EACA,OAAO;CACT;AACF"}

package/lib/internal/private/__notationRename.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Shared outer walk for the `camel`/`pascal` notations.
+ *
+ * Mirrors the `CamelCase<T>` / `PascalCase<T>` typings: leading underscores are
+ * preserved verbatim, an all-underscore key stays untouched, and the presence
+ * of any remaining underscore — not the number of non-empty segments — selects
+ * the `snake` conversion. Routing on underscore presence keeps a trailing or
+ * doubled underscore (`fooBar_`) on the same path the type takes, instead of
+ * collapsing it to the underscore-free `plain` path.
+ */
+export declare const __notationRename: (props: {
+    plain: (str: string) => string;
+    snake: (str: string) => string;
+}) => (str: string) => string;

package/lib/internal/private/__notationRename.js

@@ -0,0 +1,25 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.__notationRename = void 0;
+/**
+ * Shared outer walk for the `camel`/`pascal` notations.
+ *
+ * Mirrors the `CamelCase<T>` / `PascalCase<T>` typings: leading underscores are
+ * preserved verbatim, an all-underscore key stays untouched, and the presence
+ * of any remaining underscore — not the number of non-empty segments — selects
+ * the `snake` conversion. Routing on underscore presence keeps a trailing or
+ * doubled underscore (`fooBar_`) on the same path the type takes, instead of
+ * collapsing it to the underscore-free `plain` path.
+ */
+const __notationRename = (props) => (str) => {
+    let prefix = "";
+    while (str.startsWith("_")) {
+        prefix += "_";
+        str = str.substring(1);
+    }
+    if (str.length === 0)
+        return prefix;
+    return `${prefix}${str.includes("_") ? props.snake(str) : props.plain(str)}`;
+};
+exports.__notationRename = __notationRename;
+//# sourceMappingURL=__notationRename.js.map