ts-data-forge 14.6.0 → 14.6.2

package/dist/number/branded-types/positive-uint16.mjs

@@ -1,126 +1,138 @@
-import { TsDataForgeInternals } from '../refined-number-utils.mjs';
 
-const typeNameInMessage = "a positive integer in [1, 2^16)";
-const {
-  MAX_VALUE,
-  MIN_VALUE,
-  add,
-  castType,
-  div,
-  fromNumber,
-  is,
-  max: max_,
-  min: min_,
-  mul,
-  pow,
-  random,
-  sub
-} = TsDataForgeInternals.RefinedNumberUtils.operatorsForInteger({
-  integerOrSafeInteger: "SafeInteger",
-  MIN_VALUE: 1,
-  MAX_VALUE: 2 ** 16 - 1,
-  typeNameInMessage
+import { TsDataForgeInternals } from '../refined-number-utils.mjs';
+const typeNameInMessage = 'a positive integer in [1, 2^16)';
+const { MAX_VALUE, MIN_VALUE, add, castType, div, fromNumber, is, max: max_, min: min_, mul, pow, random, sub, } = TsDataForgeInternals.RefinedNumberUtils.operatorsForInteger({
+    integerOrSafeInteger: 'SafeInteger',
+    MIN_VALUE: 1,
+    MAX_VALUE: 2 ** 16 - 1,
+    typeNameInMessage,
 });
-const isPositiveUint16 = is;
-const asPositiveUint16 = castType;
-const PositiveUint16 = {
-  /**
-   * Type guard that checks if a value is a positive integer in [1, 2^16).
-   *
-   * @param value - The value to check
-   * @returns `true` if the value is a positive integer in [1, 2^16), `false` otherwise
-   * @see {@link isPositiveUint16} for usage examples
-   */
-  is,
-  /**
-   * The smallest value representable as `PositiveUint16` (the lower saturation
-   * target of `fromNumber`).
-   */
-  MIN_VALUE,
-  /**
-   * The largest value representable as `PositiveUint16` (the upper saturation
-   * target of `fromNumber`).
-   */
-  MAX_VALUE,
-  /**
-   * Returns the smallest of the given positive integers.
-   *
-   * @param values - The positive integers to compare (at least one required)
-   * @returns The smallest value as a `PositiveUint16`
-   */
-  min: min_,
-  /**
-   * Returns the largest of the given positive integers.
-   *
-   * @param values - The positive integers to compare (at least one required)
-   * @returns The largest value as a `PositiveUint16`
-   */
-  max: max_,
-  /**
-   * Converts an arbitrary `number` into a `PositiveUint16`, rounding to the
-   * nearest integer and saturating the result into the range `[MIN_VALUE,
-   * MAX_VALUE]`.
-   *
-   * Unlike `asPositiveUint16`, this is total: out-of-range inputs are clamped
-   * to the nearest representable `PositiveUint16` instead of throwing.
-   *
-   * @param value - The value to convert
-   * @returns The value as a `PositiveUint16`
-   */
-  fromNumber,
-  /**
-   * Generates a random `PositiveUint16` within the given range.
-   *
-   * The range is inclusive on both ends.
-   *
-   * @param min - The minimum value (inclusive)
-   * @param max - The maximum value (inclusive)
-   * @returns A random `PositiveUint16` in `[min, max]`
-   */
-  random,
-  /**
-   * Raises `a` to the power `b`, returning `a ** b` as a `PositiveUint16`
-   * (floored to an integer).
-   *
-   * @param a - The base positive integer
-   * @param b - The exponent positive integer
-   * @returns `a ** b` as a `PositiveUint16`
-   */
-  pow,
-  /**
-   * Adds two positive integers, returning `a + b` as a `PositiveUint16`.
-   *
-   * @param a - The first positive integer
-   * @param b - The second positive integer
-   * @returns The sum of `a` and `b` as a `PositiveUint16`
-   */
-  add,
-  /**
-   * Subtracts two positive integers, returning `a - b` as a `PositiveUint16`.
-   *
-   * @param a - The first positive integer
-   * @param b - The second positive integer
-   * @returns The difference of `a` and `b` as a `PositiveUint16`
-   */
-  sub,
-  /**
-   * Multiplies two positive integers, returning `a * b` as a `PositiveUint16`.
-   *
-   * @param a - The first positive integer
-   * @param b - The second positive integer
-   * @returns The product of `a` and `b` as a `PositiveUint16`
-   */
-  mul,
-  /**
-   * Divides two positive integers using floor division (`⌊a / b⌋`): the result
-   * is `a / b` rounded toward negative infinity, as a `PositiveUint16`.
-   *
-   * @param a - The dividend
-   * @param b - The divisor (must be non-zero)
-   * @returns The floored quotient as a `PositiveUint16`
-   */
-  div
+/**
+ * Type guard that checks if a value is a positive integer in [1, 2^16).
+ *
+ * Returns `true` for a positive integer in [1, 2^16) — a value with no
+ * fractional component.
+ *
+ * @param value - The value to check
+ * @returns `true` if the value is a positive integer in [1, 2^16), `false` otherwise
+ */
+export const isPositiveUint16 = is;
+/**
+ * Casts a `number` to the `PositiveUint16` branded type.
+ *
+ * Validates that the value is a positive integer in [1, 2^16) and returns it
+ * with the `PositiveUint16` brand. Throws a `TypeError` otherwise.
+ *
+ * @param value - The value to cast
+ * @returns The value as a `PositiveUint16`
+ * @throws {TypeError} If the value is not a positive integer in [1, 2^16)
+ */
+export const asPositiveUint16 = castType;
+/**
+ * Namespace providing type-safe operations for the `PositiveUint16` branded
+ * type.
+ *
+ * The `PositiveUint16` type represents a positive integer in [1, 2^16).
+ * Division (`div`) uses floor division.
+ */
+export const PositiveUint16 = {
+    /**
+     * Type guard that checks if a value is a positive integer in [1, 2^16).
+     *
+     * @param value - The value to check
+     * @returns `true` if the value is a positive integer in [1, 2^16), `false` otherwise
+     * @see {@link isPositiveUint16} for usage examples
+     */
+    is,
+    /**
+     * The smallest value representable as `PositiveUint16` (the lower saturation
+     * target of `fromNumber`).
+     */
+    MIN_VALUE,
+    /**
+     * The largest value representable as `PositiveUint16` (the upper saturation
+     * target of `fromNumber`).
+     */
+    MAX_VALUE,
+    /**
+     * Returns the smallest of the given positive integers.
+     *
+     * @param values - The positive integers to compare (at least one required)
+     * @returns The smallest value as a `PositiveUint16`
+     */
+    min: min_,
+    /**
+     * Returns the largest of the given positive integers.
+     *
+     * @param values - The positive integers to compare (at least one required)
+     * @returns The largest value as a `PositiveUint16`
+     */
+    max: max_,
+    /**
+     * Converts an arbitrary `number` into a `PositiveUint16`, rounding to the
+     * nearest integer and saturating the result into the range `[MIN_VALUE,
+     * MAX_VALUE]`.
+     *
+     * Unlike `asPositiveUint16`, this is total: out-of-range inputs are clamped
+     * to the nearest representable `PositiveUint16` instead of throwing.
+     *
+     * @param value - The value to convert
+     * @returns The value as a `PositiveUint16`
+     */
+    fromNumber,
+    /**
+     * Generates a random `PositiveUint16` within the given range.
+     *
+     * The range is inclusive on both ends.
+     *
+     * @param min - The minimum value (inclusive)
+     * @param max - The maximum value (inclusive)
+     * @returns A random `PositiveUint16` in `[min, max]`
+     */
+    random,
+    /**
+     * Raises `a` to the power `b`, returning `a ** b` as a `PositiveUint16`
+     * (floored to an integer).
+     *
+     * @param a - The base positive integer
+     * @param b - The exponent positive integer
+     * @returns `a ** b` as a `PositiveUint16`
+     */
+    pow,
+    /**
+     * Adds two positive integers, returning `a + b` as a `PositiveUint16`.
+     *
+     * @param a - The first positive integer
+     * @param b - The second positive integer
+     * @returns The sum of `a` and `b` as a `PositiveUint16`
+     */
+    add,
+    /**
+     * Subtracts two positive integers, returning `a - b` as a `PositiveUint16`.
+     *
+     * @param a - The first positive integer
+     * @param b - The second positive integer
+     * @returns The difference of `a` and `b` as a `PositiveUint16`
+     */
+    sub,
+    /**
+     * Multiplies two positive integers, returning `a * b` as a `PositiveUint16`.
+     *
+     * @param a - The first positive integer
+     * @param b - The second positive integer
+     * @returns The product of `a` and `b` as a `PositiveUint16`
+     */
+    mul,
+    /**
+     * Divides two positive integers using floor division (`⌊a / b⌋`): the result
+     * is `a / b` rounded toward negative infinity, as a `PositiveUint16`.
+     *
+     * @param a - The dividend
+     * @param b - The divisor (must be non-zero)
+     * @returns The floored quotient as a `PositiveUint16`
+     */
+    div,
 };
 
-export { PositiveUint16, asPositiveUint16, isPositiveUint16 };
-//# sourceMappingURL=positive-uint16.mjs.map
+
+//# sourceMappingURL=positive-uint16.mjs.map

package/dist/number/branded-types/positive-uint16.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"positive-uint16.mjs","sources":["../../../src/number/branded-types/positive-uint16.mts"],"sourcesContent":["import { type PositiveUint16 as TtfImported_PositiveUint16 } from 'ts-type-forge';\nimport { expectType } from '../../expect-type.mjs';\nimport { TsDataForgeInternals } from '../refined-number-utils.mjs';\n\nexport type PositiveUint16 = TtfImported_PositiveUint16;\n\ntype ElementType = PositiveUint16;\n\nconst typeNameInMessage = 'a positive integer in [1, 2^16)';\n\nconst {\n  MAX_VALUE,\n  MIN_VALUE,\n  add,\n  castType,\n  div,\n  fromNumber,\n  is,\n  max: max_,\n  min: min_,\n  mul,\n  pow,\n  random,\n  sub,\n} = TsDataForgeInternals.RefinedNumberUtils.operatorsForInteger<\n  ElementType,\n  1,\n  number\n>({\n  integerOrSafeInteger: 'SafeInteger',\n  MIN_VALUE: 1,\n  MAX_VALUE: 2 ** 16 - 1,\n  typeNameInMessage,\n} as const);\n\n/**\n * Type guard that checks if a value is a positive integer in [1, 2^16).\n *\n * Returns `true` for a positive integer in [1, 2^16) — a value with no\n * fractional component.\n *\n * @param value - The value to check\n * @returns `true` if the value is a positive integer in [1, 2^16), `false` otherwise\n */\nexport const isPositiveUint16 = is;\n\n/**\n * Casts a `number` to the `PositiveUint16` branded type.\n *\n * Validates that the value is a positive integer in [1, 2^16) and returns it\n * with the `PositiveUint16` brand. Throws a `TypeError` otherwise.\n *\n * @param value - The value to cast\n * @returns The value as a `PositiveUint16`\n * @throws {TypeError} If the value is not a positive integer in [1, 2^16)\n */\nexport const asPositiveUint16 = castType;\n\n/**\n * Namespace providing type-safe operations for the `PositiveUint16` branded\n * type.\n *\n * The `PositiveUint16` type represents a positive integer in [1, 2^16).\n * Division (`div`) uses floor division.\n */\nexport const PositiveUint16 = {\n  /**\n   * Type guard that checks if a value is a positive integer in [1, 2^16).\n   *\n   * @param value - The value to check\n   * @returns `true` if the value is a positive integer in [1, 2^16), `false` otherwise\n   * @see {@link isPositiveUint16} for usage examples\n   */\n  is,\n\n  /**\n   * The smallest value representable as `PositiveUint16` (the lower saturation\n   * target of `fromNumber`).\n   */\n  MIN_VALUE,\n\n  /**\n   * The largest value representable as `PositiveUint16` (the upper saturation\n   * target of `fromNumber`).\n   */\n  MAX_VALUE,\n\n  /**\n   * Returns the smallest of the given positive integers.\n   *\n   * @param values - The positive integers to compare (at least one required)\n   * @returns The smallest value as a `PositiveUint16`\n   */\n  min: min_,\n\n  /**\n   * Returns the largest of the given positive integers.\n   *\n   * @param values - The positive integers to compare (at least one required)\n   * @returns The largest value as a `PositiveUint16`\n   */\n  max: max_,\n\n  /**\n   * Converts an arbitrary `number` into a `PositiveUint16`, rounding to the\n   * nearest integer and saturating the result into the range `[MIN_VALUE,\n   * MAX_VALUE]`.\n   *\n   * Unlike `asPositiveUint16`, this is total: out-of-range inputs are clamped\n   * to the nearest representable `PositiveUint16` instead of throwing.\n   *\n   * @param value - The value to convert\n   * @returns The value as a `PositiveUint16`\n   */\n  fromNumber,\n\n  /**\n   * Generates a random `PositiveUint16` within the given range.\n   *\n   * The range is inclusive on both ends.\n   *\n   * @param min - The minimum value (inclusive)\n   * @param max - The maximum value (inclusive)\n   * @returns A random `PositiveUint16` in `[min, max]`\n   */\n  random,\n\n  /**\n   * Raises `a` to the power `b`, returning `a ** b` as a `PositiveUint16`\n   * (floored to an integer).\n   *\n   * @param a - The base positive integer\n   * @param b - The exponent positive integer\n   * @returns `a ** b` as a `PositiveUint16`\n   */\n  pow,\n\n  /**\n   * Adds two positive integers, returning `a + b` as a `PositiveUint16`.\n   *\n   * @param a - The first positive integer\n   * @param b - The second positive integer\n   * @returns The sum of `a` and `b` as a `PositiveUint16`\n   */\n  add,\n\n  /**\n   * Subtracts two positive integers, returning `a - b` as a `PositiveUint16`.\n   *\n   * @param a - The first positive integer\n   * @param b - The second positive integer\n   * @returns The difference of `a` and `b` as a `PositiveUint16`\n   */\n  sub,\n\n  /**\n   * Multiplies two positive integers, returning `a * b` as a `PositiveUint16`.\n   *\n   * @param a - The first positive integer\n   * @param b - The second positive integer\n   * @returns The product of `a` and `b` as a `PositiveUint16`\n   */\n  mul,\n\n  /**\n   * Divides two positive integers using floor division (`⌊a / b⌋`): the result\n   * is `a / b` rounded toward negative infinity, as a `PositiveUint16`.\n   *\n   * @param a - The dividend\n   * @param b - The divisor (must be non-zero)\n   * @returns The floored quotient as a `PositiveUint16`\n   */\n  div,\n} as const;\n\nexpectType<\n  keyof typeof PositiveUint16,\n  keyof TsDataForgeInternals.RefinedNumberUtils.NumberClass<\n    ElementType,\n    'int' | 'positive' | 'range'\n  >\n>('=');\n\nexpectType<\n  typeof PositiveUint16,\n  TsDataForgeInternals.RefinedNumberUtils.NumberClass<\n    ElementType,\n    'int' | 'positive' | 'range'\n  >\n>('<=');\n"],"names":[],"mappings":";;AAQA,MAAM,iBAAA,GAAoB,iCAAA;AAE1B,MAAM;AAAA,EACJ,SAAA;AAAA,EACA,SAAA;AAAA,EACA,GAAA;AAAA,EACA,QAAA;AAAA,EACA,GAAA;AAAA,EACA,UAAA;AAAA,EACA,EAAA;AAAA,EACA,GAAA,EAAK,IAAA;AAAA,EACL,GAAA,EAAK,IAAA;AAAA,EACL,GAAA;AAAA,EACA,GAAA;AAAA,EACA,MAAA;AAAA,EACA;AACF,CAAA,GAAI,oBAAA,CAAqB,mBAAmB,mBAAA,CAI1C;AAAA,EACA,oBAAA,EAAsB,aAAA;AAAA,EACtB,SAAA,EAAW,CAAA;AAAA,EACX,SAAA,EAAW,KAAK,EAAA,GAAK,CAAA;AAAA,EACrB;AACF,CAAU,CAAA;AAWH,MAAM,gBAAA,GAAmB;AAYzB,MAAM,gBAAA,GAAmB;AASzB,MAAM,cAAA,GAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ5B,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,GAAA,EAAK,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQL,GAAA,EAAK,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaL,UAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA;AACF;;;;"}
+{"version":3,"file":"positive-uint16.mjs","sourceRoot":"","sources":["../../../src/number/branded-types/positive-uint16.mts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AAMnE,MAAM,iBAAiB,GAAG,iCAAiC,CAAC;AAE5D,MAAM,EACJ,SAAS,EACT,SAAS,EACT,GAAG,EACH,QAAQ,EACR,GAAG,EACH,UAAU,EACV,EAAE,EACF,GAAG,EAAE,IAAI,EACT,GAAG,EAAE,IAAI,EACT,GAAG,EACH,GAAG,EACH,MAAM,EACN,GAAG,GACJ,GAAG,oBAAoB,CAAC,kBAAkB,CAAC,mBAAmB,CAI7D;IACA,oBAAoB,EAAE,aAAa;IACnC,SAAS,EAAE,CAAC;IACZ,SAAS,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC;IACtB,iBAAiB;CACT,CAAC,CAAC;AAEZ;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAEnC;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,QAAQ,CAAC;AAEzC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B;;;;;;OAMG;IACH,EAAE;IAEF;;;OAGG;IACH,SAAS;IAET;;;OAGG;IACH,SAAS;IAET;;;;;OAKG;IACH,GAAG,EAAE,IAAI;IAET;;;;;OAKG;IACH,GAAG,EAAE,IAAI;IAET;;;;;;;;;;OAUG;IACH,UAAU;IAEV;;;;;;;;OAQG;IACH,MAAM;IAEN;;;;;;;OAOG;IACH,GAAG;IAEH;;;;;;OAMG;IACH,GAAG;IAEH;;;;;;OAMG;IACH,GAAG;IAEH;;;;;;OAMG;IACH,GAAG;IAEH;;;;;;;OAOG;IACH,GAAG;CACK,CAAC;AAEX,UAAU,CAMR,GAAG,CAAC,CAAC;AAEP,UAAU,CAMR,IAAI,CAAC,CAAC"}

package/dist/number/branded-types/positive-uint32.mjs

@@ -1,126 +1,138 @@
-import { TsDataForgeInternals } from '../refined-number-utils.mjs';
 
-const typeNameInMessage = "a positive integer in [1, 2^32)";
-const {
-  MAX_VALUE,
-  MIN_VALUE,
-  add,
-  castType,
-  div,
-  fromNumber,
-  is,
-  max: max_,
-  min: min_,
-  mul,
-  pow,
-  random,
-  sub
-} = TsDataForgeInternals.RefinedNumberUtils.operatorsForInteger({
-  integerOrSafeInteger: "SafeInteger",
-  MIN_VALUE: 1,
-  MAX_VALUE: 2 ** 32 - 1,
-  typeNameInMessage
+import { TsDataForgeInternals } from '../refined-number-utils.mjs';
+const typeNameInMessage = 'a positive integer in [1, 2^32)';
+const { MAX_VALUE, MIN_VALUE, add, castType, div, fromNumber, is, max: max_, min: min_, mul, pow, random, sub, } = TsDataForgeInternals.RefinedNumberUtils.operatorsForInteger({
+    integerOrSafeInteger: 'SafeInteger',
+    MIN_VALUE: 1,
+    MAX_VALUE: 2 ** 32 - 1,
+    typeNameInMessage,
 });
-const isPositiveUint32 = is;
-const asPositiveUint32 = castType;
-const PositiveUint32 = {
-  /**
-   * Type guard that checks if a value is a positive integer in [1, 2^32).
-   *
-   * @param value - The value to check
-   * @returns `true` if the value is a positive integer in [1, 2^32), `false` otherwise
-   * @see {@link isPositiveUint32} for usage examples
-   */
-  is,
-  /**
-   * The smallest value representable as `PositiveUint32` (the lower saturation
-   * target of `fromNumber`).
-   */
-  MIN_VALUE,
-  /**
-   * The largest value representable as `PositiveUint32` (the upper saturation
-   * target of `fromNumber`).
-   */
-  MAX_VALUE,
-  /**
-   * Returns the smallest of the given positive integers.
-   *
-   * @param values - The positive integers to compare (at least one required)
-   * @returns The smallest value as a `PositiveUint32`
-   */
-  min: min_,
-  /**
-   * Returns the largest of the given positive integers.
-   *
-   * @param values - The positive integers to compare (at least one required)
-   * @returns The largest value as a `PositiveUint32`
-   */
-  max: max_,
-  /**
-   * Converts an arbitrary `number` into a `PositiveUint32`, rounding to the
-   * nearest integer and saturating the result into the range `[MIN_VALUE,
-   * MAX_VALUE]`.
-   *
-   * Unlike `asPositiveUint32`, this is total: out-of-range inputs are clamped
-   * to the nearest representable `PositiveUint32` instead of throwing.
-   *
-   * @param value - The value to convert
-   * @returns The value as a `PositiveUint32`
-   */
-  fromNumber,
-  /**
-   * Generates a random `PositiveUint32` within the given range.
-   *
-   * The range is inclusive on both ends.
-   *
-   * @param min - The minimum value (inclusive)
-   * @param max - The maximum value (inclusive)
-   * @returns A random `PositiveUint32` in `[min, max]`
-   */
-  random,
-  /**
-   * Raises `a` to the power `b`, returning `a ** b` as a `PositiveUint32`
-   * (floored to an integer).
-   *
-   * @param a - The base positive integer
-   * @param b - The exponent positive integer
-   * @returns `a ** b` as a `PositiveUint32`
-   */
-  pow,
-  /**
-   * Adds two positive integers, returning `a + b` as a `PositiveUint32`.
-   *
-   * @param a - The first positive integer
-   * @param b - The second positive integer
-   * @returns The sum of `a` and `b` as a `PositiveUint32`
-   */
-  add,
-  /**
-   * Subtracts two positive integers, returning `a - b` as a `PositiveUint32`.
-   *
-   * @param a - The first positive integer
-   * @param b - The second positive integer
-   * @returns The difference of `a` and `b` as a `PositiveUint32`
-   */
-  sub,
-  /**
-   * Multiplies two positive integers, returning `a * b` as a `PositiveUint32`.
-   *
-   * @param a - The first positive integer
-   * @param b - The second positive integer
-   * @returns The product of `a` and `b` as a `PositiveUint32`
-   */
-  mul,
-  /**
-   * Divides two positive integers using floor division (`⌊a / b⌋`): the result
-   * is `a / b` rounded toward negative infinity, as a `PositiveUint32`.
-   *
-   * @param a - The dividend
-   * @param b - The divisor (must be non-zero)
-   * @returns The floored quotient as a `PositiveUint32`
-   */
-  div
+/**
+ * Type guard that checks if a value is a positive integer in [1, 2^32).
+ *
+ * Returns `true` for a positive integer in [1, 2^32) — a value with no
+ * fractional component.
+ *
+ * @param value - The value to check
+ * @returns `true` if the value is a positive integer in [1, 2^32), `false` otherwise
+ */
+export const isPositiveUint32 = is;
+/**
+ * Casts a `number` to the `PositiveUint32` branded type.
+ *
+ * Validates that the value is a positive integer in [1, 2^32) and returns it
+ * with the `PositiveUint32` brand. Throws a `TypeError` otherwise.
+ *
+ * @param value - The value to cast
+ * @returns The value as a `PositiveUint32`
+ * @throws {TypeError} If the value is not a positive integer in [1, 2^32)
+ */
+export const asPositiveUint32 = castType;
+/**
+ * Namespace providing type-safe operations for the `PositiveUint32` branded
+ * type.
+ *
+ * The `PositiveUint32` type represents a positive integer in [1, 2^32).
+ * Division (`div`) uses floor division.
+ */
+export const PositiveUint32 = {
+    /**
+     * Type guard that checks if a value is a positive integer in [1, 2^32).
+     *
+     * @param value - The value to check
+     * @returns `true` if the value is a positive integer in [1, 2^32), `false` otherwise
+     * @see {@link isPositiveUint32} for usage examples
+     */
+    is,
+    /**
+     * The smallest value representable as `PositiveUint32` (the lower saturation
+     * target of `fromNumber`).
+     */
+    MIN_VALUE,
+    /**
+     * The largest value representable as `PositiveUint32` (the upper saturation
+     * target of `fromNumber`).
+     */
+    MAX_VALUE,
+    /**
+     * Returns the smallest of the given positive integers.
+     *
+     * @param values - The positive integers to compare (at least one required)
+     * @returns The smallest value as a `PositiveUint32`
+     */
+    min: min_,
+    /**
+     * Returns the largest of the given positive integers.
+     *
+     * @param values - The positive integers to compare (at least one required)
+     * @returns The largest value as a `PositiveUint32`
+     */
+    max: max_,
+    /**
+     * Converts an arbitrary `number` into a `PositiveUint32`, rounding to the
+     * nearest integer and saturating the result into the range `[MIN_VALUE,
+     * MAX_VALUE]`.
+     *
+     * Unlike `asPositiveUint32`, this is total: out-of-range inputs are clamped
+     * to the nearest representable `PositiveUint32` instead of throwing.
+     *
+     * @param value - The value to convert
+     * @returns The value as a `PositiveUint32`
+     */
+    fromNumber,
+    /**
+     * Generates a random `PositiveUint32` within the given range.
+     *
+     * The range is inclusive on both ends.
+     *
+     * @param min - The minimum value (inclusive)
+     * @param max - The maximum value (inclusive)
+     * @returns A random `PositiveUint32` in `[min, max]`
+     */
+    random,
+    /**
+     * Raises `a` to the power `b`, returning `a ** b` as a `PositiveUint32`
+     * (floored to an integer).
+     *
+     * @param a - The base positive integer
+     * @param b - The exponent positive integer
+     * @returns `a ** b` as a `PositiveUint32`
+     */
+    pow,
+    /**
+     * Adds two positive integers, returning `a + b` as a `PositiveUint32`.
+     *
+     * @param a - The first positive integer
+     * @param b - The second positive integer
+     * @returns The sum of `a` and `b` as a `PositiveUint32`
+     */
+    add,
+    /**
+     * Subtracts two positive integers, returning `a - b` as a `PositiveUint32`.
+     *
+     * @param a - The first positive integer
+     * @param b - The second positive integer
+     * @returns The difference of `a` and `b` as a `PositiveUint32`
+     */
+    sub,
+    /**
+     * Multiplies two positive integers, returning `a * b` as a `PositiveUint32`.
+     *
+     * @param a - The first positive integer
+     * @param b - The second positive integer
+     * @returns The product of `a` and `b` as a `PositiveUint32`
+     */
+    mul,
+    /**
+     * Divides two positive integers using floor division (`⌊a / b⌋`): the result
+     * is `a / b` rounded toward negative infinity, as a `PositiveUint32`.
+     *
+     * @param a - The dividend
+     * @param b - The divisor (must be non-zero)
+     * @returns The floored quotient as a `PositiveUint32`
+     */
+    div,
 };
 
-export { PositiveUint32, asPositiveUint32, isPositiveUint32 };
-//# sourceMappingURL=positive-uint32.mjs.map
+
+//# sourceMappingURL=positive-uint32.mjs.map

package/dist/number/branded-types/positive-uint32.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"positive-uint32.mjs","sources":["../../../src/number/branded-types/positive-uint32.mts"],"sourcesContent":["import { type PositiveUint32 as TtfImported_PositiveUint32 } from 'ts-type-forge';\nimport { expectType } from '../../expect-type.mjs';\nimport { TsDataForgeInternals } from '../refined-number-utils.mjs';\n\nexport type PositiveUint32 = TtfImported_PositiveUint32;\n\ntype ElementType = PositiveUint32;\n\nconst typeNameInMessage = 'a positive integer in [1, 2^32)';\n\nconst {\n  MAX_VALUE,\n  MIN_VALUE,\n  add,\n  castType,\n  div,\n  fromNumber,\n  is,\n  max: max_,\n  min: min_,\n  mul,\n  pow,\n  random,\n  sub,\n} = TsDataForgeInternals.RefinedNumberUtils.operatorsForInteger<\n  ElementType,\n  1,\n  number\n>({\n  integerOrSafeInteger: 'SafeInteger',\n  MIN_VALUE: 1,\n  MAX_VALUE: 2 ** 32 - 1,\n  typeNameInMessage,\n} as const);\n\n/**\n * Type guard that checks if a value is a positive integer in [1, 2^32).\n *\n * Returns `true` for a positive integer in [1, 2^32) — a value with no\n * fractional component.\n *\n * @param value - The value to check\n * @returns `true` if the value is a positive integer in [1, 2^32), `false` otherwise\n */\nexport const isPositiveUint32 = is;\n\n/**\n * Casts a `number` to the `PositiveUint32` branded type.\n *\n * Validates that the value is a positive integer in [1, 2^32) and returns it\n * with the `PositiveUint32` brand. Throws a `TypeError` otherwise.\n *\n * @param value - The value to cast\n * @returns The value as a `PositiveUint32`\n * @throws {TypeError} If the value is not a positive integer in [1, 2^32)\n */\nexport const asPositiveUint32 = castType;\n\n/**\n * Namespace providing type-safe operations for the `PositiveUint32` branded\n * type.\n *\n * The `PositiveUint32` type represents a positive integer in [1, 2^32).\n * Division (`div`) uses floor division.\n */\nexport const PositiveUint32 = {\n  /**\n   * Type guard that checks if a value is a positive integer in [1, 2^32).\n   *\n   * @param value - The value to check\n   * @returns `true` if the value is a positive integer in [1, 2^32), `false` otherwise\n   * @see {@link isPositiveUint32} for usage examples\n   */\n  is,\n\n  /**\n   * The smallest value representable as `PositiveUint32` (the lower saturation\n   * target of `fromNumber`).\n   */\n  MIN_VALUE,\n\n  /**\n   * The largest value representable as `PositiveUint32` (the upper saturation\n   * target of `fromNumber`).\n   */\n  MAX_VALUE,\n\n  /**\n   * Returns the smallest of the given positive integers.\n   *\n   * @param values - The positive integers to compare (at least one required)\n   * @returns The smallest value as a `PositiveUint32`\n   */\n  min: min_,\n\n  /**\n   * Returns the largest of the given positive integers.\n   *\n   * @param values - The positive integers to compare (at least one required)\n   * @returns The largest value as a `PositiveUint32`\n   */\n  max: max_,\n\n  /**\n   * Converts an arbitrary `number` into a `PositiveUint32`, rounding to the\n   * nearest integer and saturating the result into the range `[MIN_VALUE,\n   * MAX_VALUE]`.\n   *\n   * Unlike `asPositiveUint32`, this is total: out-of-range inputs are clamped\n   * to the nearest representable `PositiveUint32` instead of throwing.\n   *\n   * @param value - The value to convert\n   * @returns The value as a `PositiveUint32`\n   */\n  fromNumber,\n\n  /**\n   * Generates a random `PositiveUint32` within the given range.\n   *\n   * The range is inclusive on both ends.\n   *\n   * @param min - The minimum value (inclusive)\n   * @param max - The maximum value (inclusive)\n   * @returns A random `PositiveUint32` in `[min, max]`\n   */\n  random,\n\n  /**\n   * Raises `a` to the power `b`, returning `a ** b` as a `PositiveUint32`\n   * (floored to an integer).\n   *\n   * @param a - The base positive integer\n   * @param b - The exponent positive integer\n   * @returns `a ** b` as a `PositiveUint32`\n   */\n  pow,\n\n  /**\n   * Adds two positive integers, returning `a + b` as a `PositiveUint32`.\n   *\n   * @param a - The first positive integer\n   * @param b - The second positive integer\n   * @returns The sum of `a` and `b` as a `PositiveUint32`\n   */\n  add,\n\n  /**\n   * Subtracts two positive integers, returning `a - b` as a `PositiveUint32`.\n   *\n   * @param a - The first positive integer\n   * @param b - The second positive integer\n   * @returns The difference of `a` and `b` as a `PositiveUint32`\n   */\n  sub,\n\n  /**\n   * Multiplies two positive integers, returning `a * b` as a `PositiveUint32`.\n   *\n   * @param a - The first positive integer\n   * @param b - The second positive integer\n   * @returns The product of `a` and `b` as a `PositiveUint32`\n   */\n  mul,\n\n  /**\n   * Divides two positive integers using floor division (`⌊a / b⌋`): the result\n   * is `a / b` rounded toward negative infinity, as a `PositiveUint32`.\n   *\n   * @param a - The dividend\n   * @param b - The divisor (must be non-zero)\n   * @returns The floored quotient as a `PositiveUint32`\n   */\n  div,\n} as const;\n\nexpectType<\n  keyof typeof PositiveUint32,\n  keyof TsDataForgeInternals.RefinedNumberUtils.NumberClass<\n    ElementType,\n    'int' | 'positive' | 'range'\n  >\n>('=');\n\nexpectType<\n  typeof PositiveUint32,\n  TsDataForgeInternals.RefinedNumberUtils.NumberClass<\n    ElementType,\n    'int' | 'positive' | 'range'\n  >\n>('<=');\n"],"names":[],"mappings":";;AAQA,MAAM,iBAAA,GAAoB,iCAAA;AAE1B,MAAM;AAAA,EACJ,SAAA;AAAA,EACA,SAAA;AAAA,EACA,GAAA;AAAA,EACA,QAAA;AAAA,EACA,GAAA;AAAA,EACA,UAAA;AAAA,EACA,EAAA;AAAA,EACA,GAAA,EAAK,IAAA;AAAA,EACL,GAAA,EAAK,IAAA;AAAA,EACL,GAAA;AAAA,EACA,GAAA;AAAA,EACA,MAAA;AAAA,EACA;AACF,CAAA,GAAI,oBAAA,CAAqB,mBAAmB,mBAAA,CAI1C;AAAA,EACA,oBAAA,EAAsB,aAAA;AAAA,EACtB,SAAA,EAAW,CAAA;AAAA,EACX,SAAA,EAAW,KAAK,EAAA,GAAK,CAAA;AAAA,EACrB;AACF,CAAU,CAAA;AAWH,MAAM,gBAAA,GAAmB;AAYzB,MAAM,gBAAA,GAAmB;AASzB,MAAM,cAAA,GAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ5B,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,GAAA,EAAK,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQL,GAAA,EAAK,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaL,UAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA;AACF;;;;"}
+{"version":3,"file":"positive-uint32.mjs","sourceRoot":"","sources":["../../../src/number/branded-types/positive-uint32.mts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AAMnE,MAAM,iBAAiB,GAAG,iCAAiC,CAAC;AAE5D,MAAM,EACJ,SAAS,EACT,SAAS,EACT,GAAG,EACH,QAAQ,EACR,GAAG,EACH,UAAU,EACV,EAAE,EACF,GAAG,EAAE,IAAI,EACT,GAAG,EAAE,IAAI,EACT,GAAG,EACH,GAAG,EACH,MAAM,EACN,GAAG,GACJ,GAAG,oBAAoB,CAAC,kBAAkB,CAAC,mBAAmB,CAI7D;IACA,oBAAoB,EAAE,aAAa;IACnC,SAAS,EAAE,CAAC;IACZ,SAAS,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC;IACtB,iBAAiB;CACT,CAAC,CAAC;AAEZ;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAEnC;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,QAAQ,CAAC;AAEzC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B;;;;;;OAMG;IACH,EAAE;IAEF;;;OAGG;IACH,SAAS;IAET;;;OAGG;IACH,SAAS;IAET;;;;;OAKG;IACH,GAAG,EAAE,IAAI;IAET;;;;;OAKG;IACH,GAAG,EAAE,IAAI;IAET;;;;;;;;;;OAUG;IACH,UAAU;IAEV;;;;;;;;OAQG;IACH,MAAM;IAEN;;;;;;;OAOG;IACH,GAAG;IAEH;;;;;;OAMG;IACH,GAAG;IAEH;;;;;;OAMG;IACH,GAAG;IAEH;;;;;;OAMG;IACH,GAAG;IAEH;;;;;;;OAOG;IACH,GAAG;CACK,CAAC;AAEX,UAAU,CAMR,GAAG,CAAC,CAAC;AAEP,UAAU,CAMR,IAAI,CAAC,CAAC"}