typebox 1.3.2 → 1.3.3

package/build/guard/guard.mjs

@@ -92,7 +92,7 @@ export function IsMultipleOf(dividend, divisor) {
     if (IsInteger(dividend) && (1 / divisor) % 1 === 0)
         return true;
     const mod = dividend % divisor;
-    return Math.min(Math.abs(mod), Math.abs(mod - divisor)) < tolerance;
+    return Math.min(Math.abs(mod), Math.abs(mod - divisor), Math.abs(mod + divisor)) < tolerance;
 }
 // ------------------------------------------------------------------
 // IsClassInstance

package/build/type/engine/priority/priority.d.mts

@@ -4,17 +4,17 @@ type TComparer<Left extends TSchema, Right extends TSchema, CompareResult extend
 type TInsert<Type extends TSchema, Types extends TSchema[], Result extends TSchema[] = []> = (Types extends [infer Left extends TSchema, ...infer Right extends TSchema[]] ? TComparer<Type, Left> extends 1 ? TInsert<Type, Right, [...Result, Left]> : [...Result, Type, ...Types] : [...Result, Type]);
 type TSort<Types extends TSchema[], Result extends TSchema[] = []> = (Types extends [infer Left extends TSchema, ...infer Right extends TSchema[]] ? TSort<Right, TInsert<Left, Result>> : Result);
 /**
- * Priority sorts types in sequence of narrowest to broadest using a Drop Sort algorithm.
- * This function is typically used to sequence types for union variant checks to ensure
- * that values are checked against the most narrow types before the broadest, which in
- * turn helps ensure order-independent checking.
+ * Priority sorts types in sequence of narrowest to broadest using an Insertion Sort
+ * algorithm. This function is typically used to sequence types for union variant
+ * checks to ensure that values are checked against the most narrow types before
+ * the broadest, which in turn helps ensure order-independent Union checking.
  */
 export type TPriority<Types extends TSchema[], Result extends TSchema[] = TSort<Types>> = Result;
 /**
- * Priority sorts types in sequence of narrowest to broadest using a Drop Sort algorithm.
- * This function is typically used to sequence types for union variant checks to ensure
- * that values are checked against the most narrow types before the broadest, which in
- * turn helps ensure order-independent checking.
+ * Priority sorts types in sequence of narrowest to broadest using an Insertion Sort
+ * algorithm. This function is typically used to sequence types for union variant
+ * checks to ensure that values are checked against the most narrow types before
+ * the broadest, which in turn helps ensure order-independent Union checking.
  */
 export declare function Priority<Types extends TSchema[]>(types: [...Types]): TPriority<Types>;
 export {};

package/build/type/engine/priority/priority.mjs

@@ -17,10 +17,10 @@ function Sort(types, result = []) {
     return Guard.ShiftLeft(types, (left, right) => Sort(right, Insert(left, result)), () => result);
 }
 /**
- * Priority sorts types in sequence of narrowest to broadest using a Drop Sort algorithm.
- * This function is typically used to sequence types for union variant checks to ensure
- * that values are checked against the most narrow types before the broadest, which in
- * turn helps ensure order-independent checking.
+ * Priority sorts types in sequence of narrowest to broadest using an Insertion Sort
+ * algorithm. This function is typically used to sequence types for union variant
+ * checks to ensure that values are checked against the most narrow types before
+ * the broadest, which in turn helps ensure order-independent Union checking.
  */
 export function Priority(types) {
     const result = Sort(types);

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "typebox",
   "description": "Json Schema Type Builder with Static Type Resolution for TypeScript",
-  "version": "1.3.2",
+  "version": "1.3.3",
   "keywords": [
     "typescript",
     "jsonschema"