typia 13.1.1 → 13.2.0

package/lib/internal/_randomMultiple.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_randomMultiple.js","sourceRoot":"","sources":["../../src/internal/_randomMultiple.ts"],"names":[],"mappings":";;;AAAA,yCASoB;AACpB,mDAAgD;AAEzC,MAAM,eAAe,GAAG,CAAC,KAO/B,EAAU,EAAE;IACX,MAAM,IAAI,GAAqB,KAAK,CAAC,OAAO;QAC1C,CAAC,CAAC,IAAA,8BAAmB,EAAC,KAAK,CAAC,UAAU,CAAC;QACvC,CAAC,CAAC,IAAA,4BAAiB,EAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACxC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;IAE5E,MAAM,KAAK,GAA0B,IAAA,yBAAc,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACzE,MAAM,KAAK,GAA0B,IAAA,yBAAc,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACzE,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI;QAClC,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC7D,MAAM,OAAO,GAAW,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;IAClE,MAAM,OAAO,GAAW,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,OAAO;QACnB,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IAEpE,MAAM,QAAQ,GAAW,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACxD,MAAM,UAAU,GAAa,MAAM,CAAC;QAClC,QAAQ;QACR,OAAO;QACP,OAAO;QACP,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC;QAClC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC;QAClC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC;QACnC,GAAG,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC;KACtC,CAAC,CAAC;IACH,KAAK,MAAM,WAAW,IAAI,UAAU,EAAE,CAAC;QACrC,MAAM,KAAK,GAAW,IAAA,2BAAgB,EAAC;YACrC,WAAW,EAAE,IAAI,CAAC,WAAW,GAAG,WAAW;YAC3C,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CAAC;QACH,IAAI,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IAC1C,CAAC;IACD,MAAM,OAAO,GAAkB,gCAAgC,CAAC,KAAK,CAAC,CAAC;IACvE,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,OAAO,CAAC;IACrC,MAAM,cAAc,GAAkB,gCAAgC,CACpE,KAAK,EACL,IAAI,CACL,CAAC;IACF,IAAI,cAAc,KAAK,IAAI;QAAE,OAAO,cAAc,CAAC;IACnD,MAAM,IAAI,KAAK,CACb,8DAA8D,CAC/D,CAAC;AACJ,CAAC,CAAC;AAlDW,QAAA,eAAe,GAAf,eAAe,CAkD1B;AAEF,MAAM,OAAO,GAAG,CACd,KAA4C,EAC5C,KAAa,EACJ,EAAE,CACX,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;IACtB,CAAC,KAAK,CAAC,OAAO,KAAK,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC;IACzE,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC;IACzE,IAAA,6BAAa,EAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;AAEzC,MAAM,gCAAgC,GAAG,CACvC,KAA4C,EAC5C,IAAe,EACA,EAAE;IACjB,MAAM,KAAK,GAAW,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAChD,KAAK,IAAI,QAAQ,GAAG,CAAC,GAAG,EAAE,QAAQ,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC;QACtD,MAAM,IAAI,GAAc,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC;QAC7D,MAAM,KAAK,GAA0B,IAAA,yBAAc,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACzE,MAAM,KAAK,GAA0B,IAAA,yBAAc,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACzE,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAElD,MAAM,kBAAkB,GAAW,GAAG,CACpC,CAAC,KAAK,EACN,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAC1C,CAAC;QACF,MAAM,kBAAkB,GAAW,GAAG,CACpC,KAAK,EACL,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAC1C,CAAC;QACF,IAAI,kBAAkB,GAAG,kBAAkB;YAAE,SAAS;QAEtD,MAAM,eAAe,GAAW,sBAAsB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACvE,MAAM,OAAO,GAAW,UAAU,CAChC,EAAE,SAAS,EAAE,kBAAkB,EAAE,WAAW,EAAE,eAAe,EAAE,EAC/D,KAAK,CACN,CAAC;QACF,MAAM,OAAO,GAAW,UAAU,CAChC,EAAE,SAAS,EAAE,kBAAkB,EAAE,WAAW,EAAE,eAAe,EAAE,EAC/D,KAAK,CACN,CAAC;QACF,IAAI,OAAO,GAAG,OAAO;YAAE,SAAS;QAEhC,MAAM,QAAQ,GAAW,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACxD,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC;YAC5B,QAAQ;YACR,OAAO;YACP,OAAO;YACP,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC;YAClC,GAAG,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC;SACtC,CAAC,EAAE,CAAC;YACH,MAAM,KAAK,GAAW,IAAA,2BAAgB,EAAC;gBACrC,WAAW,EAAE,eAAe,GAAG,QAAQ;gBACvC,QAAQ;aACT,CAAC,CAAC;YACH,IAAI,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,MAAM,sBAAsB,GAAG,CAAC,IAAe,EAAE,QAAgB,EAAU,EAAE;IAC3E,MAAM,UAAU,GAAW,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IACpD,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACpB,MAAM,KAAK,GAAW,IAAA,wBAAa,EAAC,UAAU,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC,WAAW,GAAG,IAAA,sBAAW,EAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,IAAI,CAAC,WAAW,GAAG,IAAA,wBAAa,EAAC,CAAC,UAAU,CAAC,CAAC;AACvD,CAAC,CAAC;AAEF,MAAM,gCAAgC,GAAG,CACvC,KAA4C,EAC7B,EAAE;IACjB,MAAM,IAAI,GAAqB,IAAA,8BAAmB,EAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACrE,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/B,MAAM,IAAI,GAAc,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAChE,MAAM,KAAK,GAA0B,IAAA,yBAAc,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACzE,MAAM,KAAK,GAA0B,IAAA,yBAAc,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACzE,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAElD,MAAM,OAAO,GAAW,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;IAClE,MAAM,OAAO,GAAW,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,OAAO;QAAE,OAAO,IAAI,CAAC;IACnC,IAAI,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3D,MAAM,SAAS,GACb,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC;QACjB,CAAC,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC;QACzD,CAAC,CAAC,CAAC,GAAG,EAAE;YACJ,MAAM,SAAS,GAAkB,mBAAmB,CAClD,CAAC,OAAO,EACR,CAAC,OAAO,EACR,IAAI,CAAC,WAAW,CACjB,CAAC;YACF,OAAO,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChD,CAAC,CAAC,EAAE,CAAC;IACX,IAAI,SAAS,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,KAAK,GAAW,MAAM,CAAC,SAAS,CAAC,CAAC;IACxC,OAAO,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9C,CAAC,CAAC;AAEF,MAAM,mBAAmB,GAAG,CAC1B,OAAe,EACf,OAAe,EACf,WAAmB,EACJ,EAAE;IACjB,MAAM,KAAK,GAAW,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAW,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5C,KAAK,IAAI,QAAQ,GAAG,KAAK,EAAE,QAAQ,IAAI,IAAI,EAAE,EAAE,QAAQ,EAAE,CAAC;QACxD,MAAM,WAAW,GAAW,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxE,MAAM,WAAW,GAAW,GAAG,CAC7B,OAAO,EACP,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAChD,CAAC;QACF,MAAM,OAAO,GACX,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;QAClE,MAAM,WAAW,GACf,CAAC,WAAW,GAAG,IAAA,sBAAW,EAAC,WAAW,EAAE,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC;QAC9D,MAAM,KAAK,GAAW,UAAU,CAC9B,EAAE,SAAS,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,EACpD,KAAK,CACN,CAAC;QACF,MAAM,KAAK,GAAW,UAAU,CAC9B,EAAE,SAAS,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,EACpD,KAAK,CACN,CAAC;QACF,IAAI,KAAK,IAAI,KAAK;YAAE,OAAO,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,WAAW,CAAC;IACtE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,KAAa,EAAU,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AAEtE,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9D,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE9D,MAAM,UAAU,GAAG,CAAC,KAAqB,EAAE,SAAkB,EAAU,EAAE;IACvE,MAAM,QAAQ,GAAW,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC;IAC7D,MAAM,SAAS,GAAW,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC;IAC9D,MAAM,OAAO,GACX,QAAQ,GAAG,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,OAAO,CACL,OAAO,GAAG,CAAC,SAAS,IAAI,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACzE,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,KAAqB,EAAE,SAAkB,EAAU,EAAE;IACvE,MAAM,QAAQ,GAAW,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC;IAC7D,MAAM,SAAS,GAAW,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC;IAC9D,MAAM,KAAK,GACT,QAAQ,GAAG,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,OAAO,KAAK,GAAG,CAAC,SAAS,IAAI,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAChF,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CAAC,OAAe,EAAE,OAAe,EAAU,EAAE;IAChE,MAAM,KAAK,GAAW,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC;IAC9C,MAAM,MAAM,GAAW,MAAM,CAC3B,IAAI,CAAC,GAAG,CACN,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EACzB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CACvD,CACF,CAAC;IACF,OAAO,OAAO,GAAG,CAAC,CAAC,OAAO,GAAG,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC;AACtE,CAAC,CAAC;AAEF,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,OAAe,EAAE,OAAe,EAAU,EAAE,CACxE,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;AAEhE,MAAM,MAAM,GAAG,CACb,QAAgB,EAChB,OAAe,EACf,OAAe,EACL,EAAE;IACZ,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC;QAClE,IAAI,QAAQ,GAAG,QAAQ,IAAI,OAAO;YAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;QACrE,IAAI,QAAQ,GAAG,QAAQ,IAAI,OAAO;YAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,MAAgB,EAAY,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC"}

package/lib/internal/_randomMultiple.mjs

@@ -0,0 +1,158 @@
+import { _decimalDecompose, _decimalDivide, _decimalGcd, _decimalIntegerStep, _decimalPower, _decimalToNumber } from "./_decimal.mjs";
+import { _isMultipleOf } from "./_isMultipleOf.mjs";
+//#region src/internal/_randomMultiple.ts
+const _randomMultiple = (props) => {
+	const step = props.integer ? _decimalIntegerStep(props.multipleOf) : _decimalDecompose(props.multipleOf);
+	if (step === null || step.coefficient <= BigInt(0)) throw new Error("The multipleOf value must be a positive finite number.");
+	const lower = _decimalDivide(props.minimum, step);
+	const upper = _decimalDivide(props.maximum, step);
+	if (lower === null || upper === null) throw new Error("The random number range must be finite.");
+	const minimum = lowerBound(lower, props.exclusiveMinimum);
+	const maximum = upperBound(upper, props.exclusiveMaximum);
+	if (minimum > maximum) throw new Error("The range does not contain a multipleOf value.");
+	const selected = randomBigint(minimum, maximum);
+	const candidates = unique([
+		selected,
+		minimum,
+		maximum,
+		clamp(BigInt(0), minimum, maximum),
+		clamp(BigInt(1), minimum, maximum),
+		clamp(BigInt(-1), minimum, maximum),
+		...nearby(selected, minimum, maximum)
+	]);
+	for (const coefficient of candidates) {
+		const value = _decimalToNumber({
+			coefficient: step.coefficient * coefficient,
+			exponent: step.exponent
+		});
+		if (isValid(props, value)) return value;
+	}
+	const aligned = findRepresentableIntegerMultiple(props);
+	if (aligned !== null) return aligned;
+	const decimalAligned = findRepresentableDecimalMultiple(props, step);
+	if (decimalAligned !== null) return decimalAligned;
+	throw new Error("The range does not contain a representable multipleOf value.");
+};
+const isValid = (props, value) => Number.isFinite(value) && (props.integer === false || Number.isInteger(value)) && (props.exclusiveMinimum ? value > props.minimum : value >= props.minimum) && (props.exclusiveMaximum ? value < props.maximum : value <= props.maximum) && _isMultipleOf(value, props.multipleOf);
+const findRepresentableDecimalMultiple = (props, step) => {
+	const limit = BigInt("999999999999999");
+	for (let exponent = -324; exponent <= 308; ++exponent) {
+		const unit = {
+			coefficient: BigInt(1),
+			exponent
+		};
+		const lower = _decimalDivide(props.minimum, unit);
+		const upper = _decimalDivide(props.maximum, unit);
+		if (lower === null || upper === null) return null;
+		const coefficientMinimum = max(-limit, lowerBound(lower, props.exclusiveMinimum));
+		const coefficientMaximum = min(limit, upperBound(upper, props.exclusiveMaximum));
+		if (coefficientMinimum > coefficientMaximum) continue;
+		const coefficientStep = decimalCoefficientStep(step, exponent);
+		const minimum = lowerBound({
+			numerator: coefficientMinimum,
+			denominator: coefficientStep
+		}, false);
+		const maximum = upperBound({
+			numerator: coefficientMaximum,
+			denominator: coefficientStep
+		}, false);
+		if (minimum > maximum) continue;
+		const selected = randomBigint(minimum, maximum);
+		for (const quotient of unique([
+			selected,
+			minimum,
+			maximum,
+			clamp(BigInt(0), minimum, maximum),
+			...nearby(selected, minimum, maximum)
+		])) {
+			const value = _decimalToNumber({
+				coefficient: coefficientStep * quotient,
+				exponent
+			});
+			if (isValid(props, value)) return value;
+		}
+	}
+	return null;
+};
+const decimalCoefficientStep = (step, exponent) => {
+	const difference = exponent - step.exponent;
+	if (difference >= 0) {
+		const power = _decimalPower(difference);
+		return step.coefficient / _decimalGcd(step.coefficient, power);
+	}
+	return step.coefficient * _decimalPower(-difference);
+};
+const findRepresentableIntegerMultiple = (props) => {
+	const step = _decimalIntegerStep(props.multipleOf);
+	if (step === null) return null;
+	const unit = {
+		coefficient: BigInt(1),
+		exponent: 0
+	};
+	const lower = _decimalDivide(props.minimum, unit);
+	const upper = _decimalDivide(props.maximum, unit);
+	if (lower === null || upper === null) return null;
+	const minimum = lowerBound(lower, props.exclusiveMinimum);
+	const maximum = upperBound(upper, props.exclusiveMaximum);
+	if (minimum > maximum) return null;
+	if (minimum <= BigInt(0) && maximum >= BigInt(0)) return 0;
+	const candidate = minimum > BigInt(0) ? findPositiveAligned(minimum, maximum, step.coefficient) : (() => {
+		const magnitude = findPositiveAligned(-maximum, -minimum, step.coefficient);
+		return magnitude === null ? null : -magnitude;
+	})();
+	if (candidate === null) return null;
+	const value = Number(candidate);
+	return isValid(props, value) ? value : null;
+};
+const findPositiveAligned = (minimum, maximum, integerStep) => {
+	const first = bitLength(minimum) - 1;
+	const last = bitLength(maximum) - 1;
+	for (let exponent = first; exponent <= last; ++exponent) {
+		const bandMinimum = max(minimum, BigInt(1) << BigInt(exponent));
+		const bandMaximum = min(maximum, (BigInt(1) << BigInt(exponent + 1)) - BigInt(1));
+		const quantum = exponent <= 52 ? BigInt(1) : BigInt(1) << BigInt(exponent - 52);
+		const alignedStep = integerStep / _decimalGcd(integerStep, quantum) * quantum;
+		const lower = lowerBound({
+			numerator: bandMinimum,
+			denominator: alignedStep
+		}, false);
+		const upper = upperBound({
+			numerator: bandMaximum,
+			denominator: alignedStep
+		}, false);
+		if (lower <= upper) return randomBigint(lower, upper) * alignedStep;
+	}
+	return null;
+};
+const bitLength = (value) => value.toString(2).length;
+const min = (x, y) => x < y ? x : y;
+const max = (x, y) => x > y ? x : y;
+const lowerBound = (ratio, exclusive) => {
+	const quotient = ratio.numerator / ratio.denominator;
+	const remainder = ratio.numerator % ratio.denominator;
+	return quotient + (remainder > BigInt(0) ? BigInt(1) : BigInt(0)) + (exclusive && remainder === BigInt(0) ? BigInt(1) : BigInt(0));
+};
+const upperBound = (ratio, exclusive) => {
+	const quotient = ratio.numerator / ratio.denominator;
+	const remainder = ratio.numerator % ratio.denominator;
+	return quotient - (remainder < BigInt(0) ? BigInt(1) : BigInt(0)) - (exclusive && remainder === BigInt(0) ? BigInt(1) : BigInt(0));
+};
+const randomBigint = (minimum, maximum) => {
+	const scale = BigInt(1) << BigInt(53);
+	const sample = BigInt(Math.min(Number(scale - BigInt(1)), Math.floor(Math.max(0, Math.random()) * Number(scale))));
+	return minimum + (maximum - minimum + BigInt(1)) * sample / scale;
+};
+const clamp = (value, minimum, maximum) => value < minimum ? minimum : value > maximum ? maximum : value;
+const nearby = (selected, minimum, maximum) => {
+	const output = [];
+	for (let distance = BigInt(1); distance <= BigInt(32); ++distance) {
+		if (selected - distance >= minimum) output.push(selected - distance);
+		if (selected + distance <= maximum) output.push(selected + distance);
+	}
+	return output;
+};
+const unique = (values) => [...new Set(values)];
+//#endregion
+export { _randomMultiple };
+
+//# sourceMappingURL=_randomMultiple.mjs.map

package/lib/internal/_randomMultiple.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"_randomMultiple.mjs","names":[],"sources":["../../src/internal/_randomMultiple.ts"],"sourcesContent":["import {\n  _IDecimal,\n  _IDecimalRatio,\n  _decimalDecompose,\n  _decimalDivide,\n  _decimalGcd,\n  _decimalIntegerStep,\n  _decimalPower,\n  _decimalToNumber,\n} from \"./_decimal\";\nimport { _isMultipleOf } from \"./_isMultipleOf\";\n\nexport const _randomMultiple = (props: {\n  minimum: number;\n  maximum: number;\n  multipleOf: number;\n  exclusiveMinimum: boolean;\n  exclusiveMaximum: boolean;\n  integer: boolean;\n}): number => {\n  const step: _IDecimal | null = props.integer\n    ? _decimalIntegerStep(props.multipleOf)\n    : _decimalDecompose(props.multipleOf);\n  if (step === null || step.coefficient <= BigInt(0))\n    throw new Error(\"The multipleOf value must be a positive finite number.\");\n\n  const lower: _IDecimalRatio | null = _decimalDivide(props.minimum, step);\n  const upper: _IDecimalRatio | null = _decimalDivide(props.maximum, step);\n  if (lower === null || upper === null)\n    throw new Error(\"The random number range must be finite.\");\n  const minimum: bigint = lowerBound(lower, props.exclusiveMinimum);\n  const maximum: bigint = upperBound(upper, props.exclusiveMaximum);\n  if (minimum > maximum)\n    throw new Error(\"The range does not contain a multipleOf value.\");\n\n  const selected: bigint = randomBigint(minimum, maximum);\n  const candidates: bigint[] = unique([\n    selected,\n    minimum,\n    maximum,\n    clamp(BigInt(0), minimum, maximum),\n    clamp(BigInt(1), minimum, maximum),\n    clamp(BigInt(-1), minimum, maximum),\n    ...nearby(selected, minimum, maximum),\n  ]);\n  for (const coefficient of candidates) {\n    const value: number = _decimalToNumber({\n      coefficient: step.coefficient * coefficient,\n      exponent: step.exponent,\n    });\n    if (isValid(props, value)) return value;\n  }\n  const aligned: number | null = findRepresentableIntegerMultiple(props);\n  if (aligned !== null) return aligned;\n  const decimalAligned: number | null = findRepresentableDecimalMultiple(\n    props,\n    step,\n  );\n  if (decimalAligned !== null) return decimalAligned;\n  throw new Error(\n    \"The range does not contain a representable multipleOf value.\",\n  );\n};\n\nconst isValid = (\n  props: Parameters<typeof _randomMultiple>[0],\n  value: number,\n): boolean =>\n  Number.isFinite(value) &&\n  (props.integer === false || Number.isInteger(value)) &&\n  (props.exclusiveMinimum ? value > props.minimum : value >= props.minimum) &&\n  (props.exclusiveMaximum ? value < props.maximum : value <= props.maximum) &&\n  _isMultipleOf(value, props.multipleOf);\n\nconst findRepresentableDecimalMultiple = (\n  props: Parameters<typeof _randomMultiple>[0],\n  step: _IDecimal,\n): number | null => {\n  const limit: bigint = BigInt(\"999999999999999\");\n  for (let exponent = -324; exponent <= 308; ++exponent) {\n    const unit: _IDecimal = { coefficient: BigInt(1), exponent };\n    const lower: _IDecimalRatio | null = _decimalDivide(props.minimum, unit);\n    const upper: _IDecimalRatio | null = _decimalDivide(props.maximum, unit);\n    if (lower === null || upper === null) return null;\n\n    const coefficientMinimum: bigint = max(\n      -limit,\n      lowerBound(lower, props.exclusiveMinimum),\n    );\n    const coefficientMaximum: bigint = min(\n      limit,\n      upperBound(upper, props.exclusiveMaximum),\n    );\n    if (coefficientMinimum > coefficientMaximum) continue;\n\n    const coefficientStep: bigint = decimalCoefficientStep(step, exponent);\n    const minimum: bigint = lowerBound(\n      { numerator: coefficientMinimum, denominator: coefficientStep },\n      false,\n    );\n    const maximum: bigint = upperBound(\n      { numerator: coefficientMaximum, denominator: coefficientStep },\n      false,\n    );\n    if (minimum > maximum) continue;\n\n    const selected: bigint = randomBigint(minimum, maximum);\n    for (const quotient of unique([\n      selected,\n      minimum,\n      maximum,\n      clamp(BigInt(0), minimum, maximum),\n      ...nearby(selected, minimum, maximum),\n    ])) {\n      const value: number = _decimalToNumber({\n        coefficient: coefficientStep * quotient,\n        exponent,\n      });\n      if (isValid(props, value)) return value;\n    }\n  }\n  return null;\n};\n\nconst decimalCoefficientStep = (step: _IDecimal, exponent: number): bigint => {\n  const difference: number = exponent - step.exponent;\n  if (difference >= 0) {\n    const power: bigint = _decimalPower(difference);\n    return step.coefficient / _decimalGcd(step.coefficient, power);\n  }\n  return step.coefficient * _decimalPower(-difference);\n};\n\nconst findRepresentableIntegerMultiple = (\n  props: Parameters<typeof _randomMultiple>[0],\n): number | null => {\n  const step: _IDecimal | null = _decimalIntegerStep(props.multipleOf);\n  if (step === null) return null;\n  const unit: _IDecimal = { coefficient: BigInt(1), exponent: 0 };\n  const lower: _IDecimalRatio | null = _decimalDivide(props.minimum, unit);\n  const upper: _IDecimalRatio | null = _decimalDivide(props.maximum, unit);\n  if (lower === null || upper === null) return null;\n\n  const minimum: bigint = lowerBound(lower, props.exclusiveMinimum);\n  const maximum: bigint = upperBound(upper, props.exclusiveMaximum);\n  if (minimum > maximum) return null;\n  if (minimum <= BigInt(0) && maximum >= BigInt(0)) return 0;\n\n  const candidate: bigint | null =\n    minimum > BigInt(0)\n      ? findPositiveAligned(minimum, maximum, step.coefficient)\n      : (() => {\n          const magnitude: bigint | null = findPositiveAligned(\n            -maximum,\n            -minimum,\n            step.coefficient,\n          );\n          return magnitude === null ? null : -magnitude;\n        })();\n  if (candidate === null) return null;\n  const value: number = Number(candidate);\n  return isValid(props, value) ? value : null;\n};\n\nconst findPositiveAligned = (\n  minimum: bigint,\n  maximum: bigint,\n  integerStep: bigint,\n): bigint | null => {\n  const first: number = bitLength(minimum) - 1;\n  const last: number = bitLength(maximum) - 1;\n  for (let exponent = first; exponent <= last; ++exponent) {\n    const bandMinimum: bigint = max(minimum, BigInt(1) << BigInt(exponent));\n    const bandMaximum: bigint = min(\n      maximum,\n      (BigInt(1) << BigInt(exponent + 1)) - BigInt(1),\n    );\n    const quantum: bigint =\n      exponent <= 52 ? BigInt(1) : BigInt(1) << BigInt(exponent - 52);\n    const alignedStep: bigint =\n      (integerStep / _decimalGcd(integerStep, quantum)) * quantum;\n    const lower: bigint = lowerBound(\n      { numerator: bandMinimum, denominator: alignedStep },\n      false,\n    );\n    const upper: bigint = upperBound(\n      { numerator: bandMaximum, denominator: alignedStep },\n      false,\n    );\n    if (lower <= upper) return randomBigint(lower, upper) * alignedStep;\n  }\n  return null;\n};\n\nconst bitLength = (value: bigint): number => value.toString(2).length;\n\nconst min = (x: bigint, y: bigint): bigint => (x < y ? x : y);\nconst max = (x: bigint, y: bigint): bigint => (x > y ? x : y);\n\nconst lowerBound = (ratio: _IDecimalRatio, exclusive: boolean): bigint => {\n  const quotient: bigint = ratio.numerator / ratio.denominator;\n  const remainder: bigint = ratio.numerator % ratio.denominator;\n  const ceiling: bigint =\n    quotient + (remainder > BigInt(0) ? BigInt(1) : BigInt(0));\n  return (\n    ceiling + (exclusive && remainder === BigInt(0) ? BigInt(1) : BigInt(0))\n  );\n};\n\nconst upperBound = (ratio: _IDecimalRatio, exclusive: boolean): bigint => {\n  const quotient: bigint = ratio.numerator / ratio.denominator;\n  const remainder: bigint = ratio.numerator % ratio.denominator;\n  const floor: bigint =\n    quotient - (remainder < BigInt(0) ? BigInt(1) : BigInt(0));\n  return floor - (exclusive && remainder === BigInt(0) ? BigInt(1) : BigInt(0));\n};\n\nconst randomBigint = (minimum: bigint, maximum: bigint): bigint => {\n  const scale: bigint = BigInt(1) << BigInt(53);\n  const sample: bigint = BigInt(\n    Math.min(\n      Number(scale - BigInt(1)),\n      Math.floor(Math.max(0, Math.random()) * Number(scale)),\n    ),\n  );\n  return minimum + ((maximum - minimum + BigInt(1)) * sample) / scale;\n};\n\nconst clamp = (value: bigint, minimum: bigint, maximum: bigint): bigint =>\n  value < minimum ? minimum : value > maximum ? maximum : value;\n\nconst nearby = (\n  selected: bigint,\n  minimum: bigint,\n  maximum: bigint,\n): bigint[] => {\n  const output: bigint[] = [];\n  for (let distance = BigInt(1); distance <= BigInt(32); ++distance) {\n    if (selected - distance >= minimum) output.push(selected - distance);\n    if (selected + distance <= maximum) output.push(selected + distance);\n  }\n  return output;\n};\n\nconst unique = (values: bigint[]): bigint[] => [...new Set(values)];\n"],"mappings":";;;AAYA,MAAa,mBAAmB,UAOlB;CACZ,MAAM,OAAyB,MAAM,UACjC,oBAAoB,MAAM,UAAU,IACpC,kBAAkB,MAAM,UAAU;CACtC,IAAI,SAAS,QAAQ,KAAK,eAAe,OAAO,CAAC,GAC/C,MAAM,IAAI,MAAM,wDAAwD;CAE1E,MAAM,QAA+B,eAAe,MAAM,SAAS,IAAI;CACvE,MAAM,QAA+B,eAAe,MAAM,SAAS,IAAI;CACvE,IAAI,UAAU,QAAQ,UAAU,MAC9B,MAAM,IAAI,MAAM,yCAAyC;CAC3D,MAAM,UAAkB,WAAW,OAAO,MAAM,gBAAgB;CAChE,MAAM,UAAkB,WAAW,OAAO,MAAM,gBAAgB;CAChE,IAAI,UAAU,SACZ,MAAM,IAAI,MAAM,gDAAgD;CAElE,MAAM,WAAmB,aAAa,SAAS,OAAO;CACtD,MAAM,aAAuB,OAAO;EAClC;EACA;EACA;EACA,MAAM,OAAO,CAAC,GAAG,SAAS,OAAO;EACjC,MAAM,OAAO,CAAC,GAAG,SAAS,OAAO;EACjC,MAAM,OAAO,EAAE,GAAG,SAAS,OAAO;EAClC,GAAG,OAAO,UAAU,SAAS,OAAO;CACtC,CAAC;CACD,KAAK,MAAM,eAAe,YAAY;EACpC,MAAM,QAAgB,iBAAiB;GACrC,aAAa,KAAK,cAAc;GAChC,UAAU,KAAK;EACjB,CAAC;EACD,IAAI,QAAQ,OAAO,KAAK,GAAG,OAAO;CACpC;CACA,MAAM,UAAyB,iCAAiC,KAAK;CACrE,IAAI,YAAY,MAAM,OAAO;CAC7B,MAAM,iBAAgC,iCACpC,OACA,IACF;CACA,IAAI,mBAAmB,MAAM,OAAO;CACpC,MAAM,IAAI,MACR,8DACF;AACF;AAEA,MAAM,WACJ,OACA,UAEA,OAAO,SAAS,KAAK,MACpB,MAAM,YAAY,SAAS,OAAO,UAAU,KAAK,OACjD,MAAM,mBAAmB,QAAQ,MAAM,UAAU,SAAS,MAAM,aAChE,MAAM,mBAAmB,QAAQ,MAAM,UAAU,SAAS,MAAM,YACjE,cAAc,OAAO,MAAM,UAAU;AAEvC,MAAM,oCACJ,OACA,SACkB;CAClB,MAAM,QAAgB,OAAO,iBAAiB;CAC9C,KAAK,IAAI,WAAW,MAAM,YAAY,KAAK,EAAE,UAAU;EACrD,MAAM,OAAkB;GAAE,aAAa,OAAO,CAAC;GAAG;EAAS;EAC3D,MAAM,QAA+B,eAAe,MAAM,SAAS,IAAI;EACvE,MAAM,QAA+B,eAAe,MAAM,SAAS,IAAI;EACvE,IAAI,UAAU,QAAQ,UAAU,MAAM,OAAO;EAE7C,MAAM,qBAA6B,IACjC,CAAC,OACD,WAAW,OAAO,MAAM,gBAAgB,CAC1C;EACA,MAAM,qBAA6B,IACjC,OACA,WAAW,OAAO,MAAM,gBAAgB,CAC1C;EACA,IAAI,qBAAqB,oBAAoB;EAE7C,MAAM,kBAA0B,uBAAuB,MAAM,QAAQ;EACrE,MAAM,UAAkB,WACtB;GAAE,WAAW;GAAoB,aAAa;EAAgB,GAC9D,KACF;EACA,MAAM,UAAkB,WACtB;GAAE,WAAW;GAAoB,aAAa;EAAgB,GAC9D,KACF;EACA,IAAI,UAAU,SAAS;EAEvB,MAAM,WAAmB,aAAa,SAAS,OAAO;EACtD,KAAK,MAAM,YAAY,OAAO;GAC5B;GACA;GACA;GACA,MAAM,OAAO,CAAC,GAAG,SAAS,OAAO;GACjC,GAAG,OAAO,UAAU,SAAS,OAAO;EACtC,CAAC,GAAG;GACF,MAAM,QAAgB,iBAAiB;IACrC,aAAa,kBAAkB;IAC/B;GACF,CAAC;GACD,IAAI,QAAQ,OAAO,KAAK,GAAG,OAAO;EACpC;CACF;CACA,OAAO;AACT;AAEA,MAAM,0BAA0B,MAAiB,aAA6B;CAC5E,MAAM,aAAqB,WAAW,KAAK;CAC3C,IAAI,cAAc,GAAG;EACnB,MAAM,QAAgB,cAAc,UAAU;EAC9C,OAAO,KAAK,cAAc,YAAY,KAAK,aAAa,KAAK;CAC/D;CACA,OAAO,KAAK,cAAc,cAAc,CAAC,UAAU;AACrD;AAEA,MAAM,oCACJ,UACkB;CAClB,MAAM,OAAyB,oBAAoB,MAAM,UAAU;CACnE,IAAI,SAAS,MAAM,OAAO;CAC1B,MAAM,OAAkB;EAAE,aAAa,OAAO,CAAC;EAAG,UAAU;CAAE;CAC9D,MAAM,QAA+B,eAAe,MAAM,SAAS,IAAI;CACvE,MAAM,QAA+B,eAAe,MAAM,SAAS,IAAI;CACvE,IAAI,UAAU,QAAQ,UAAU,MAAM,OAAO;CAE7C,MAAM,UAAkB,WAAW,OAAO,MAAM,gBAAgB;CAChE,MAAM,UAAkB,WAAW,OAAO,MAAM,gBAAgB;CAChE,IAAI,UAAU,SAAS,OAAO;CAC9B,IAAI,WAAW,OAAO,CAAC,KAAK,WAAW,OAAO,CAAC,GAAG,OAAO;CAEzD,MAAM,YACJ,UAAU,OAAO,CAAC,IACd,oBAAoB,SAAS,SAAS,KAAK,WAAW,WAC/C;EACL,MAAM,YAA2B,oBAC/B,CAAC,SACD,CAAC,SACD,KAAK,WACP;EACA,OAAO,cAAc,OAAO,OAAO,CAAC;CACtC,EAAA,CAAG;CACT,IAAI,cAAc,MAAM,OAAO;CAC/B,MAAM,QAAgB,OAAO,SAAS;CACtC,OAAO,QAAQ,OAAO,KAAK,IAAI,QAAQ;AACzC;AAEA,MAAM,uBACJ,SACA,SACA,gBACkB;CAClB,MAAM,QAAgB,UAAU,OAAO,IAAI;CAC3C,MAAM,OAAe,UAAU,OAAO,IAAI;CAC1C,KAAK,IAAI,WAAW,OAAO,YAAY,MAAM,EAAE,UAAU;EACvD,MAAM,cAAsB,IAAI,SAAS,OAAO,CAAC,KAAK,OAAO,QAAQ,CAAC;EACtE,MAAM,cAAsB,IAC1B,UACC,OAAO,CAAC,KAAK,OAAO,WAAW,CAAC,KAAK,OAAO,CAAC,CAChD;EACA,MAAM,UACJ,YAAY,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC,KAAK,OAAO,WAAW,EAAE;EAChE,MAAM,cACH,cAAc,YAAY,aAAa,OAAO,IAAK;EACtD,MAAM,QAAgB,WACpB;GAAE,WAAW;GAAa,aAAa;EAAY,GACnD,KACF;EACA,MAAM,QAAgB,WACpB;GAAE,WAAW;GAAa,aAAa;EAAY,GACnD,KACF;EACA,IAAI,SAAS,OAAO,OAAO,aAAa,OAAO,KAAK,IAAI;CAC1D;CACA,OAAO;AACT;AAEA,MAAM,aAAa,UAA0B,MAAM,SAAS,CAAC,CAAC,CAAC;AAE/D,MAAM,OAAO,GAAW,MAAuB,IAAI,IAAI,IAAI;AAC3D,MAAM,OAAO,GAAW,MAAuB,IAAI,IAAI,IAAI;AAE3D,MAAM,cAAc,OAAuB,cAA+B;CACxE,MAAM,WAAmB,MAAM,YAAY,MAAM;CACjD,MAAM,YAAoB,MAAM,YAAY,MAAM;CAGlD,OADE,YAAY,YAAY,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,MAE7C,aAAa,cAAc,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC;AAE1E;AAEA,MAAM,cAAc,OAAuB,cAA+B;CACxE,MAAM,WAAmB,MAAM,YAAY,MAAM;CACjD,MAAM,YAAoB,MAAM,YAAY,MAAM;CAGlD,OADE,YAAY,YAAY,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,MAC1C,aAAa,cAAc,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC;AAC7E;AAEA,MAAM,gBAAgB,SAAiB,YAA4B;CACjE,MAAM,QAAgB,OAAO,CAAC,KAAK,OAAO,EAAE;CAC5C,MAAM,SAAiB,OACrB,KAAK,IACH,OAAO,QAAQ,OAAO,CAAC,CAAC,GACxB,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,OAAO,CAAC,IAAI,OAAO,KAAK,CAAC,CACvD,CACF;CACA,OAAO,WAAY,UAAU,UAAU,OAAO,CAAC,KAAK,SAAU;AAChE;AAEA,MAAM,SAAS,OAAe,SAAiB,YAC7C,QAAQ,UAAU,UAAU,QAAQ,UAAU,UAAU;AAE1D,MAAM,UACJ,UACA,SACA,YACa;CACb,MAAM,SAAmB,CAAC;CAC1B,KAAK,IAAI,WAAW,OAAO,CAAC,GAAG,YAAY,OAAO,EAAE,GAAG,EAAE,UAAU;EACjE,IAAI,WAAW,YAAY,SAAS,OAAO,KAAK,WAAW,QAAQ;EACnE,IAAI,WAAW,YAAY,SAAS,OAAO,KAAK,WAAW,QAAQ;CACrE;CACA,OAAO;AACT;AAEA,MAAM,UAAU,WAA+B,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC"}

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,CAC5B,KAAa,EACb,KAAqB,EACb,EAAE;IACV,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;AA9BW,QAAA,cAAc,GAAd,cAAc,CA8BzB"}

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 = (\n  regex: RegExp,\n  props?: _ILengthProps,\n): 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,kBACX,OACA,UACW;CACX,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,64 @@
+export declare const _RANDOM_LENGTH_ERROR = "unable to generate a random string satisfying both the format and the length constraints.";
+/**
+ * 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;
+/**
+ * Intersects the requested length window with the lengths a format's grammar
+ * can express, and draws one of them.
+ *
+ * `minimum` and `maximum` are the shortest and longest values the format admits
+ * — omit `maximum` when the grammar is open above — and `spread` is how far
+ * past the floor an unbounded request may reach, so an open side still varies
+ * the way `_randomString` does. The caller draws from the returned window and
+ * applies whatever step its grammar has (base64 lengths are multiples of four,
+ * a fractional second needs at least one digit).
+ *
+ * Throws only when the window and the grammar do not overlap at all. That is
+ * the distinction the retry driver below cannot make: it redraws one shape, so
+ * it gives up on every length that shape never emits even when the format
+ * itself accepts one (issue #2284).
+ */
+export declare const _randomLengthWindow: (props: _ILengthProps | undefined, format: {
+    minimum: number;
+    maximum?: number;
+    spread?: number;
+}) => {
+    low: number;
+    high: number;
+};
+/** Draws a length inside a window produced by {@link _randomLengthWindow}. */
+export declare const _randomLengthPick: (window: {
+    low: number;
+    high: number;
+}) => number;
+/**
+ * Wraps a fixed-length format generator (uuid, date) with the requested length
+ * window.
+ *
+ * Use it only where the grammar admits exactly one length, so a window that
+ * excludes it is genuinely unsatisfiable. A format that can express more than
+ * one length must build its value at a length drawn from
+ * {@link _randomLengthWindow} instead; redrawing one shape cannot reach a length
+ * that shape never emits.
+ */
+export declare const _randomFormatLength: (props: _ILengthProps | undefined, generate: () => string) => string;