@squiz/dx-json-schema-lib 1.87.0 → 1.89.0

package/lib/utils/jsonBreakDetector/checks/findConstChanges.js

@@ -0,0 +1,75 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findConstChanges = findConstChanges;
+exports.checkConstNarrowingAtNode = checkConstNarrowingAtNode;
+const types_1 = require("../types");
+/** Recursively detects added or changed `const` values at each schema level, accumulating dotted paths. */
+function findConstChanges(beforeSchema, afterSchema, path, constChanges) {
+    var _a, _b;
+    const beforeProperties = (_a = beforeSchema.properties) !== null && _a !== void 0 ? _a : {};
+    const afterProperties = (_b = afterSchema.properties) !== null && _b !== void 0 ? _b : {};
+    // Recurse into nested object properties.
+    for (const [key, afterPropertySchema] of Object.entries(afterProperties)) {
+        if (!afterPropertySchema || typeof afterPropertySchema !== 'object') {
+            continue;
+        }
+        const beforePropertySchema = beforeProperties[key];
+        const childPath = path ? `${path}.${key}` : key;
+        if (beforePropertySchema && typeof beforePropertySchema === 'object') {
+            // Only compare const on fields that existed in the before schema.
+            if (hasConstChange(beforePropertySchema, afterPropertySchema)) {
+                (0, types_1.pushBreak)(constChanges, childPath, types_1.BREAK_MESSAGES.const);
+            }
+            // Compare `const` on this property, then recurse into nested schemas for child fields.
+            findConstChanges(beforePropertySchema, afterPropertySchema, childPath, constChanges);
+        }
+        // New properties in afterSchema are skipped; adding a field is not a const change.
+    }
+    const beforeItems = beforeSchema.items;
+    const afterItems = afterSchema.items;
+    // Recurse into array item schemas (tuple items are not supported).
+    if (afterItems && typeof afterItems === 'object' && !Array.isArray(afterItems)) {
+        const itemsPath = path ? `${path}[]` : '[]';
+        const beforeItemSchema = beforeItems && typeof beforeItems === 'object' && !Array.isArray(beforeItems) ? beforeItems : undefined;
+        // Compare `items.const`, e.g. `version[]` when each item must match a new fixed value.
+        if (beforeItemSchema && hasConstChange(beforeItemSchema, afterItems)) {
+            (0, types_1.pushBreak)(constChanges, itemsPath, types_1.BREAK_MESSAGES.const);
+        }
+        if (beforeItemSchema) {
+            findConstChanges(beforeItemSchema, afterItems, itemsPath, constChanges);
+        }
+    }
+}
+/** Reports added or changed fixed values on a single schema node. */
+function checkConstNarrowingAtNode(beforeSchema, afterSchema, path, breaks) {
+    if (hasConstChange(beforeSchema, afterSchema)) {
+        (0, types_1.pushBreak)(breaks, path, types_1.BREAK_MESSAGES.const);
+    }
+}
+/** Returns true when afterSchema adds or changes an effective fixed value (`const` or single-value `enum`). */
+function hasConstChange(beforeSchema, afterSchema) {
+    const afterValue = getEffectiveConstValue(afterSchema);
+    if (afterValue === undefined) {
+        return false;
+    }
+    const beforeValue = getEffectiveConstValue(beforeSchema);
+    if (beforeValue === undefined) {
+        return true;
+    }
+    return JSON.stringify(beforeValue) !== JSON.stringify(afterValue);
+}
+/**
+ * Returns a schema's fixed value from `const`, or from `enum` when it contains exactly one value.
+ * A single-value enum and a const are equivalent ways to restrict a field to one value.
+ */
+function getEffectiveConstValue(schema) {
+    if (schema.const !== undefined) {
+        return schema.const;
+    }
+    const enumValues = schema.enum;
+    if (enumValues && enumValues.length === 1) {
+        return enumValues[0];
+    }
+    return undefined;
+}
+//# sourceMappingURL=findConstChanges.js.map

package/lib/utils/jsonBreakDetector/checks/findConstChanges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findConstChanges.js","sourceRoot":"","sources":["../../../../src/utils/jsonBreakDetector/checks/findConstChanges.ts"],"names":[],"mappings":";;AAIA,4CAgDC;AAGD,8DASC;AAhED,oCAAgE;AAGhE,2GAA2G;AAC3G,SAAgB,gBAAgB,CAC9B,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,YAAyB;;IAEzB,MAAM,gBAAgB,GAAG,MAAA,YAAY,CAAC,UAAU,mCAAI,EAAE,CAAC;IACvD,MAAM,eAAe,GAAG,MAAA,WAAW,CAAC,UAAU,mCAAI,EAAE,CAAC;IAErD,yCAAyC;IACzC,KAAK,MAAM,CAAC,GAAG,EAAE,mBAAmB,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;QACzE,IAAI,CAAC,mBAAmB,IAAI,OAAO,mBAAmB,KAAK,QAAQ,EAAE,CAAC;YACpE,SAAS;QACX,CAAC;QAED,MAAM,oBAAoB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAEhD,IAAI,oBAAoB,IAAI,OAAO,oBAAoB,KAAK,QAAQ,EAAE,CAAC;YACrE,kEAAkE;YAClE,IAAI,cAAc,CAAC,oBAAoB,EAAE,mBAAmB,CAAC,EAAE,CAAC;gBAC9D,IAAA,iBAAS,EAAC,YAAY,EAAE,SAAS,EAAE,sBAAc,CAAC,KAAK,CAAC,CAAC;YAC3D,CAAC;YAED,uFAAuF;YACvF,gBAAgB,CAAC,oBAAoB,EAAE,mBAAmB,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QACvF,CAAC;QACD,mFAAmF;IACrF,CAAC;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC;IAErC,mEAAmE;IACnE,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/E,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5C,MAAM,gBAAgB,GACpB,WAAW,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QAE1G,uFAAuF;QACvF,IAAI,gBAAgB,IAAI,cAAc,CAAC,gBAAgB,EAAE,UAAU,CAAC,EAAE,CAAC;YACrE,IAAA,iBAAS,EAAC,YAAY,EAAE,SAAS,EAAE,sBAAc,CAAC,KAAK,CAAC,CAAC;QAC3D,CAAC;QAED,IAAI,gBAAgB,EAAE,CAAC;YACrB,gBAAgB,CAAC,gBAAgB,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;AACH,CAAC;AAED,qEAAqE;AACrE,SAAgB,yBAAyB,CACvC,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,MAAmB;IAEnB,IAAI,cAAc,CAAC,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC;QAC9C,IAAA,iBAAS,EAAC,MAAM,EAAE,IAAI,EAAE,sBAAc,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;AACH,CAAC;AAED,+GAA+G;AAC/G,SAAS,cAAc,CAAC,YAAwB,EAAE,WAAuB;IACvE,MAAM,UAAU,GAAG,sBAAsB,CAAC,WAAW,CAAC,CAAC;IACvD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,WAAW,GAAG,sBAAsB,CAAC,YAAY,CAAC,CAAC;IACzD,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;AACpE,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,MAAkB;IAChD,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC,KAAK,CAAC;IACtB,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC;IAC/B,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1C,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/lib/utils/jsonBreakDetector/checks/findEnumNarrowing.d.ts

@@ -0,0 +1,6 @@
+import { JsonBreak } from '../types';
+import { JSONSchema } from '@squiz/json-schema-library';
+/** Recursively detects enum narrowing at each schema level, accumulating dotted paths. */
+export declare function findEnumNarrowing(beforeSchema: JSONSchema, afterSchema: JSONSchema, path: string, breaks: JsonBreak[]): void;
+/** Reports enum narrowing on a single schema node. */
+export declare function checkEnumNarrowingAtNode(beforeSchema: JSONSchema, afterSchema: JSONSchema, path: string, breaks: JsonBreak[]): void;

package/lib/utils/jsonBreakDetector/checks/findEnumNarrowing.js

@@ -0,0 +1,90 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findEnumNarrowing = findEnumNarrowing;
+exports.checkEnumNarrowingAtNode = checkEnumNarrowingAtNode;
+const types_1 = require("../types");
+/** Recursively detects enum narrowing at each schema level, accumulating dotted paths. */
+function findEnumNarrowing(beforeSchema, afterSchema, path, breaks) {
+    var _a, _b;
+    const beforeProperties = (_a = beforeSchema.properties) !== null && _a !== void 0 ? _a : {};
+    const afterProperties = (_b = afterSchema.properties) !== null && _b !== void 0 ? _b : {};
+    // Recurse into nested object properties.
+    for (const [key, afterPropertySchema] of Object.entries(afterProperties)) {
+        if (!afterPropertySchema || typeof afterPropertySchema !== 'object') {
+            continue;
+        }
+        const beforePropertySchema = beforeProperties[key];
+        const childPath = path ? `${path}.${key}` : key;
+        if (beforePropertySchema && typeof beforePropertySchema === 'object') {
+            // Only compare enum on fields that existed in the before schema.
+            reportEnumNarrowingAtNode(beforePropertySchema, afterPropertySchema, childPath, breaks);
+            // Compare `enum` on this property, then recurse into nested schemas for child fields.
+            findEnumNarrowing(beforePropertySchema, afterPropertySchema, childPath, breaks);
+        }
+        // New properties in afterSchema are skipped; adding a field is not an enum change.
+    }
+    const beforeItems = beforeSchema.items;
+    const afterItems = afterSchema.items;
+    // Recurse into array item schemas.
+    if (afterItems && typeof afterItems === 'object' && !Array.isArray(afterItems)) {
+        const itemsPath = path ? `${path}[]` : '[]';
+        const beforeItemSchema = beforeItems && typeof beforeItems === 'object' && !Array.isArray(beforeItems) ? beforeItems : undefined;
+        // Only compare enum on items that existed in the before schema. New items are skipped.
+        if (beforeItemSchema) {
+            reportEnumNarrowingAtNode(beforeItemSchema, afterItems, itemsPath, breaks);
+            findEnumNarrowing(beforeItemSchema, afterItems, itemsPath, breaks);
+        }
+    }
+}
+/** Reports enum narrowing on a single schema node. */
+function reportEnumNarrowingAtNode(beforeSchema, afterSchema, path, breaks) {
+    // Removing an options could leave old default value that matched that invalid, so report as breaking.
+    if (hasRemovedEnumOptions(beforeSchema, afterSchema)) {
+        (0, types_1.pushBreak)(breaks, path, types_1.BREAK_MESSAGES.enum);
+    }
+    // Adding an enum constraint could leave old values that dont match invalid, so report as breaking.
+    if (hasAddedEnum(beforeSchema, afterSchema)) {
+        (0, types_1.pushBreak)(breaks, path, types_1.BREAK_MESSAGES.enumAdded);
+    }
+}
+/** Reports enum narrowing on a single schema node. */
+function checkEnumNarrowingAtNode(beforeSchema, afterSchema, path, breaks) {
+    reportEnumNarrowingAtNode(beforeSchema, afterSchema, path, breaks);
+}
+/** Returns true when afterSchema adds an enum where the before schema had none. */
+function hasAddedEnum(beforeSchema, afterSchema) {
+    const afterEnum = afterSchema.enum;
+    // No enum constraint is not breaking.
+    if (!afterEnum || afterEnum.length === 0) {
+        return false;
+    }
+    const beforeEnum = beforeSchema.enum;
+    if (beforeEnum && beforeEnum.length > 0) {
+        return false;
+    }
+    // Check if a before const has been converted to an enum. e.g. const: 'published' -> enum: ['draft', 'published'].
+    if (beforeSchema.const !== undefined) {
+        return !afterEnum.some((value) => JSON.stringify(value) === JSON.stringify(beforeSchema.const));
+    }
+    return true;
+}
+/** Returns true when afterSchema.enum no longer allows every value from beforeSchema.enum. */
+function hasRemovedEnumOptions(beforeSchema, afterSchema) {
+    const beforeEnum = beforeSchema.enum;
+    if (!beforeEnum || beforeEnum.length === 0) {
+        return false;
+    }
+    const afterEnum = afterSchema.enum;
+    const afterConst = afterSchema.const;
+    // Enum removed entirely is a relaxation, not a breaking change.
+    if (!afterEnum) {
+        if (afterConst === undefined) {
+            return false;
+        }
+        // True when any former enum value is not matched by the new `const`.
+        return beforeEnum.some((beforeValue) => JSON.stringify(beforeValue) !== JSON.stringify(afterConst));
+    }
+    // True when any former enum value is missing from the after `enum` list.
+    return beforeEnum.some((beforeValue) => !afterEnum.some((afterValue) => JSON.stringify(beforeValue) === JSON.stringify(afterValue)));
+}
+//# sourceMappingURL=findEnumNarrowing.js.map

package/lib/utils/jsonBreakDetector/checks/findEnumNarrowing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findEnumNarrowing.js","sourceRoot":"","sources":["../../../../src/utils/jsonBreakDetector/checks/findEnumNarrowing.ts"],"names":[],"mappings":";;AAIA,8CA2CC;AAqBD,4DAOC;AA3ED,oCAAgE;AAGhE,0FAA0F;AAC1F,SAAgB,iBAAiB,CAC/B,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,MAAmB;;IAEnB,MAAM,gBAAgB,GAAG,MAAA,YAAY,CAAC,UAAU,mCAAI,EAAE,CAAC;IACvD,MAAM,eAAe,GAAG,MAAA,WAAW,CAAC,UAAU,mCAAI,EAAE,CAAC;IAErD,yCAAyC;IACzC,KAAK,MAAM,CAAC,GAAG,EAAE,mBAAmB,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;QACzE,IAAI,CAAC,mBAAmB,IAAI,OAAO,mBAAmB,KAAK,QAAQ,EAAE,CAAC;YACpE,SAAS;QACX,CAAC;QAED,MAAM,oBAAoB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAEhD,IAAI,oBAAoB,IAAI,OAAO,oBAAoB,KAAK,QAAQ,EAAE,CAAC;YACrE,iEAAiE;YACjE,yBAAyB,CAAC,oBAAoB,EAAE,mBAAmB,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;YAExF,sFAAsF;YACtF,iBAAiB,CAAC,oBAAoB,EAAE,mBAAmB,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QAClF,CAAC;QACD,mFAAmF;IACrF,CAAC;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC;IAErC,mCAAmC;IACnC,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/E,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5C,MAAM,gBAAgB,GACpB,WAAW,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QAE1G,uFAAuF;QACvF,IAAI,gBAAgB,EAAE,CAAC;YACrB,yBAAyB,CAAC,gBAAgB,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;YAC3E,iBAAiB,CAAC,gBAAgB,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;AACH,CAAC;AAED,sDAAsD;AACtD,SAAS,yBAAyB,CAChC,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,MAAmB;IAEnB,sGAAsG;IACtG,IAAI,qBAAqB,CAAC,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC;QACrD,IAAA,iBAAS,EAAC,MAAM,EAAE,IAAI,EAAE,sBAAc,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED,mGAAmG;IACnG,IAAI,YAAY,CAAC,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC;QAC5C,IAAA,iBAAS,EAAC,MAAM,EAAE,IAAI,EAAE,sBAAc,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;AACH,CAAC;AAED,sDAAsD;AACtD,SAAgB,wBAAwB,CACtC,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,MAAmB;IAEnB,yBAAyB,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;AACrE,CAAC;AAED,mFAAmF;AACnF,SAAS,YAAY,CAAC,YAAwB,EAAE,WAAuB;IACrE,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC;IACnC,sCAAsC;IACtC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC;IACrC,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kHAAkH;IAClH,IAAI,YAAY,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QACrC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,KAAc,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3G,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8FAA8F;AAC9F,SAAS,qBAAqB,CAAC,YAAwB,EAAE,WAAuB;IAC9E,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC;IACrC,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC;IACnC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC;IAErC,gEAAgE;IAChE,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,qEAAqE;QACrE,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,WAAoB,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;IAC/G,CAAC;IAED,yEAAyE;IACzE,OAAO,UAAU,CAAC,IAAI,CACpB,CAAC,WAAoB,EAAE,EAAE,CACvB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,UAAmB,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CACvG,CAAC;AACJ,CAAC"}

package/lib/utils/jsonBreakDetector/checks/findFieldTypeChanges.d.ts

@@ -0,0 +1,8 @@
+import { JsonBreak } from '../types';
+import { JSONSchema } from '@squiz/json-schema-library';
+/**
+ * Recursively function to compare field type values at each schema level, accumulating dotted paths.
+ * */
+export declare function findFieldTypeChanges(beforeSchema: JSONSchema, afterSchema: JSONSchema, path: string, typeChanges: JsonBreak[]): void;
+/** Returns true when the JSON Schema `type` keyword narrows between two schemas. */
+export declare function hasTypeChange(beforeSchema: JSONSchema, afterSchema: JSONSchema): boolean;

package/lib/utils/jsonBreakDetector/checks/findFieldTypeChanges.js

@@ -0,0 +1,86 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findFieldTypeChanges = findFieldTypeChanges;
+exports.hasTypeChange = hasTypeChange;
+const types_1 = require("../types");
+/**
+ * Recursively function to compare field type values at each schema level, accumulating dotted paths.
+ * */
+function findFieldTypeChanges(beforeSchema, afterSchema, path, typeChanges) {
+    var _a, _b;
+    // Get the current schema level child properties
+    const beforeProperties = (_a = beforeSchema.properties) !== null && _a !== void 0 ? _a : {};
+    const afterProperties = (_b = afterSchema.properties) !== null && _b !== void 0 ? _b : {};
+    // Recurse into latest nested object properties.
+    for (const [key, afterPropertySchema] of Object.entries(afterProperties)) {
+        // Only objects have types
+        if (!afterPropertySchema || typeof afterPropertySchema !== 'object') {
+            continue;
+        }
+        const beforePropertySchema = beforeProperties[key];
+        const childPath = path ? `${path}.${key}` : key;
+        // Only compare type on fields that existed in the before schema. New fields are skipped.
+        if (beforePropertySchema && typeof beforePropertySchema === 'object') {
+            // Only compare type on fields that existed in the before schema.
+            if (hasTypeChange(beforePropertySchema, afterPropertySchema)) {
+                (0, types_1.pushBreak)(typeChanges, childPath, types_1.BREAK_MESSAGES.type);
+            }
+            // Compare `type` on this property, then recurse into its nested schema so child fields are checked too.
+            findFieldTypeChanges(beforePropertySchema, afterPropertySchema, childPath, typeChanges);
+        }
+    }
+    // If instead the current schema level is an array, get the items schema
+    const beforeItems = beforeSchema.items;
+    const afterItems = afterSchema.items;
+    // Recurse into latest array item schemas.
+    if (afterItems && typeof afterItems === 'object' && !Array.isArray(afterItems)) {
+        const itemsPath = path ? `${path}[]` : '[]';
+        const beforeItemSchema = beforeItems && typeof beforeItems === 'object' && !Array.isArray(beforeItems) ? beforeItems : undefined;
+        // Compare the `items` schema `type` for array fields, e.g. `tags[]` when
+        // `items: { type: 'string' }` becomes `items: { type: 'number' }`.
+        if (beforeItemSchema) {
+            if (hasTypeChange(beforeItemSchema, afterItems)) {
+                (0, types_1.pushBreak)(typeChanges, itemsPath, types_1.BREAK_MESSAGES.type);
+            }
+            findFieldTypeChanges(beforeItemSchema, afterItems, itemsPath, typeChanges);
+        }
+    }
+}
+function toTypeArray(type) {
+    return Array.isArray(type) ? type : [type];
+}
+/**
+ * Returns true when every type allowed by `beforeType` is still allowed by `afterType`.
+ * In JSON Schema, integer is a subset of number, so relaxing integer to number is not breaking.
+ */
+function isBeforeTypeCoveredByAfterType(beforeType, afterType) {
+    const afterTypes = new Set(toTypeArray(afterType));
+    for (const type of toTypeArray(beforeType)) {
+        // Integer is a subset of number, so relaxing integer to number is not breaking.
+        if (type === 'integer') {
+            if (afterTypes.has('integer') || afterTypes.has('number')) {
+                continue;
+            }
+            return false;
+        }
+        if (!afterTypes.has(type)) {
+            return false;
+        }
+    }
+    return true;
+}
+/** Returns true when the JSON Schema `type` keyword narrows between two schemas. */
+function hasTypeChange(beforeSchema, afterSchema) {
+    const beforeType = beforeSchema.type;
+    const afterType = afterSchema.type;
+    // If both types are undefined, there is no change.
+    if (beforeType === undefined && afterType === undefined) {
+        return false;
+    }
+    // If one type is undefined, there is a change.
+    if (beforeType === undefined || afterType === undefined) {
+        return true;
+    }
+    return !isBeforeTypeCoveredByAfterType(beforeType, afterType);
+}
+//# sourceMappingURL=findFieldTypeChanges.js.map

package/lib/utils/jsonBreakDetector/checks/findFieldTypeChanges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findFieldTypeChanges.js","sourceRoot":"","sources":["../../../../src/utils/jsonBreakDetector/checks/findFieldTypeChanges.ts"],"names":[],"mappings":";;AAMA,oDAmDC;AAgCD,sCAeC;AAxGD,oCAAgE;AAGhE;;KAEK;AACL,SAAgB,oBAAoB,CAClC,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,WAAwB;;IAExB,gDAAgD;IAChD,MAAM,gBAAgB,GAAG,MAAA,YAAY,CAAC,UAAU,mCAAI,EAAE,CAAC;IACvD,MAAM,eAAe,GAAG,MAAA,WAAW,CAAC,UAAU,mCAAI,EAAE,CAAC;IAErD,gDAAgD;IAChD,KAAK,MAAM,CAAC,GAAG,EAAE,mBAAmB,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;QACzE,0BAA0B;QAC1B,IAAI,CAAC,mBAAmB,IAAI,OAAO,mBAAmB,KAAK,QAAQ,EAAE,CAAC;YACpE,SAAS;QACX,CAAC;QAED,MAAM,oBAAoB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAEhD,yFAAyF;QACzF,IAAI,oBAAoB,IAAI,OAAO,oBAAoB,KAAK,QAAQ,EAAE,CAAC;YACrE,iEAAiE;YACjE,IAAI,aAAa,CAAC,oBAAoB,EAAE,mBAAmB,CAAC,EAAE,CAAC;gBAC7D,IAAA,iBAAS,EAAC,WAAW,EAAE,SAAS,EAAE,sBAAc,CAAC,IAAI,CAAC,CAAC;YACzD,CAAC;YAED,wGAAwG;YACxG,oBAAoB,CAAC,oBAAoB,EAAE,mBAAmB,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1F,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC;IAErC,0CAA0C;IAC1C,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/E,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5C,MAAM,gBAAgB,GACpB,WAAW,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QAE1G,yEAAyE;QACzE,mEAAmE;QACnE,IAAI,gBAAgB,EAAE,CAAC;YACrB,IAAI,aAAa,CAAC,gBAAgB,EAAE,UAAU,CAAC,EAAE,CAAC;gBAChD,IAAA,iBAAS,EAAC,WAAW,EAAE,SAAS,EAAE,sBAAc,CAAC,IAAI,CAAC,CAAC;YACzD,CAAC;YACD,oBAAoB,CAAC,gBAAgB,EAAE,UAAU,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,IAAuB;IAC1C,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,SAAS,8BAA8B,CAAC,UAA6B,EAAE,SAA4B;IACjG,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC;IAEnD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC;QAC3C,gFAAgF;QAChF,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1D,SAAS;YACX,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oFAAoF;AACpF,SAAgB,aAAa,CAAC,YAAwB,EAAE,WAAuB;IAC7E,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC;IACrC,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC;IAEnC,mDAAmD;IACnD,IAAI,UAAU,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QACxD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,+CAA+C;IAC/C,IAAI,UAAU,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QACxD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,8BAA8B,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;AAChE,CAAC"}

package/lib/utils/jsonBreakDetector/checks/findNewRequiredFields.d.ts

@@ -0,0 +1,6 @@
+import { JSONSchema } from '@squiz/json-schema-library';
+import { JsonBreak } from '../types';
+/**
+ * Recursively compares required and dependentRequired fields at each schema level, accumulating dotted paths.
+ */
+export declare function findNewRequiredFields(beforeSchema: JSONSchema, afterSchema: JSONSchema, path: string, newRequiredFields: JsonBreak[]): void;

package/lib/utils/jsonBreakDetector/checks/findNewRequiredFields.js

@@ -0,0 +1,68 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findNewRequiredFields = findNewRequiredFields;
+const types_1 = require("../types");
+function getDependentRequired(schema) {
+    const dependentRequired = schema.dependentRequired;
+    return dependentRequired !== null && dependentRequired !== void 0 ? dependentRequired : {};
+}
+function findNewDependentRequiredFields(beforeSchema, afterSchema, path, newRequiredFields) {
+    var _a, _b;
+    const beforeDependentRequired = getDependentRequired(beforeSchema);
+    const afterDependentRequired = getDependentRequired(afterSchema);
+    const beforeProperties = (_a = beforeSchema.properties) !== null && _a !== void 0 ? _a : {};
+    for (const [triggerField, afterDependentFields] of Object.entries(afterDependentRequired)) {
+        if (!Array.isArray(afterDependentFields)) {
+            continue;
+        }
+        // Adding dependentRequired for a newly added trigger field is not a breaking change.
+        if (!(triggerField in beforeProperties)) {
+            continue;
+        }
+        const beforeDependentFields = (_b = beforeDependentRequired[triggerField]) !== null && _b !== void 0 ? _b : [];
+        for (const field of afterDependentFields) {
+            if (!beforeDependentFields.includes(field)) {
+                (0, types_1.pushBreak)(newRequiredFields, path ? `${path}.${field}` : field, types_1.BREAK_MESSAGES.dependentRequired);
+            }
+        }
+    }
+}
+/**
+ * Recursively compares required and dependentRequired fields at each schema level, accumulating dotted paths.
+ */
+function findNewRequiredFields(beforeSchema, afterSchema, path, newRequiredFields) {
+    var _a, _b, _c, _d;
+    // Get whats required at the current schema level
+    const beforeRequired = (_a = beforeSchema.required) !== null && _a !== void 0 ? _a : [];
+    const afterRequired = (_b = afterSchema.required) !== null && _b !== void 0 ? _b : [];
+    // Collect fields present in afterSchema.required but not in beforeSchema.required.
+    for (const field of afterRequired) {
+        if (!beforeRequired.includes(field)) {
+            (0, types_1.pushBreak)(newRequiredFields, path ? `${path}.${field}` : field, types_1.BREAK_MESSAGES.required);
+        }
+    }
+    findNewDependentRequiredFields(beforeSchema, afterSchema, path, newRequiredFields);
+    // Get the current schema level child properties
+    const beforeProperties = (_c = beforeSchema.properties) !== null && _c !== void 0 ? _c : {};
+    const afterProperties = (_d = afterSchema.properties) !== null && _d !== void 0 ? _d : {};
+    // Recurse into latest nested object properties.
+    for (const [key, afterPropertySchema] of Object.entries(afterProperties)) {
+        // Skip if the property is not an object.
+        if (!afterPropertySchema || typeof afterPropertySchema !== 'object') {
+            continue;
+        }
+        const beforePropertySchema = beforeProperties[key];
+        const childPath = path ? `${path}.${key}` : key;
+        // Missing before property is treated as an empty schema with no required fields.
+        findNewRequiredFields(beforePropertySchema && typeof beforePropertySchema === 'object' ? beforePropertySchema : {}, afterPropertySchema, childPath, newRequiredFields);
+    }
+    // If instead the current schema level is an array, get the items schema
+    const beforeItems = beforeSchema.items;
+    const afterItems = afterSchema.items;
+    // Recurse into array item schemas (tuple items are not supported).
+    if (afterItems && typeof afterItems === 'object' && !Array.isArray(afterItems)) {
+        const itemsPath = path ? `${path}[]` : '[]';
+        findNewRequiredFields(beforeItems && typeof beforeItems === 'object' && !Array.isArray(beforeItems) ? beforeItems : {}, afterItems, itemsPath, newRequiredFields);
+    }
+}
+//# sourceMappingURL=findNewRequiredFields.js.map

package/lib/utils/jsonBreakDetector/checks/findNewRequiredFields.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findNewRequiredFields.js","sourceRoot":"","sources":["../../../../src/utils/jsonBreakDetector/checks/findNewRequiredFields.ts"],"names":[],"mappings":";;AA2CA,sDAqDC;AA/FD,oCAAgE;AAIhE,SAAS,oBAAoB,CAAC,MAAkB;IAC9C,MAAM,iBAAiB,GAAI,MAAoE,CAAC,iBAAiB,CAAC;IAClH,OAAO,iBAAiB,aAAjB,iBAAiB,cAAjB,iBAAiB,GAAI,EAAE,CAAC;AACjC,CAAC;AAED,SAAS,8BAA8B,CACrC,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,iBAA8B;;IAE9B,MAAM,uBAAuB,GAAG,oBAAoB,CAAC,YAAY,CAAC,CAAC;IACnE,MAAM,sBAAsB,GAAG,oBAAoB,CAAC,WAAW,CAAC,CAAC;IACjE,MAAM,gBAAgB,GAAG,MAAA,YAAY,CAAC,UAAU,mCAAI,EAAE,CAAC;IAEvD,KAAK,MAAM,CAAC,YAAY,EAAE,oBAAoB,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,sBAAsB,CAAC,EAAE,CAAC;QAC1F,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,oBAAoB,CAAC,EAAE,CAAC;YACzC,SAAS;QACX,CAAC;QAED,qFAAqF;QACrF,IAAI,CAAC,CAAC,YAAY,IAAI,gBAAgB,CAAC,EAAE,CAAC;YACxC,SAAS;QACX,CAAC;QAED,MAAM,qBAAqB,GAAG,MAAA,uBAAuB,CAAC,YAAY,CAAC,mCAAI,EAAE,CAAC;QAE1E,KAAK,MAAM,KAAK,IAAI,oBAAoB,EAAE,CAAC;YACzC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,IAAA,iBAAS,EAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,sBAAc,CAAC,iBAAiB,CAAC,CAAC;YACpG,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAgB,qBAAqB,CACnC,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,iBAA8B;;IAE9B,iDAAiD;IACjD,MAAM,cAAc,GAAG,MAAA,YAAY,CAAC,QAAQ,mCAAI,EAAE,CAAC;IACnD,MAAM,aAAa,GAAG,MAAA,WAAW,CAAC,QAAQ,mCAAI,EAAE,CAAC;IAEjD,mFAAmF;IACnF,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;QAClC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACpC,IAAA,iBAAS,EAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,sBAAc,CAAC,QAAQ,CAAC,CAAC;QAC3F,CAAC;IACH,CAAC;IAED,8BAA8B,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,EAAE,iBAAiB,CAAC,CAAC;IAEnF,gDAAgD;IAChD,MAAM,gBAAgB,GAAG,MAAA,YAAY,CAAC,UAAU,mCAAI,EAAE,CAAC;IACvD,MAAM,eAAe,GAAG,MAAA,WAAW,CAAC,UAAU,mCAAI,EAAE,CAAC;IACrD,gDAAgD;IAChD,KAAK,MAAM,CAAC,GAAG,EAAE,mBAAmB,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;QACzE,yCAAyC;QACzC,IAAI,CAAC,mBAAmB,IAAI,OAAO,mBAAmB,KAAK,QAAQ,EAAE,CAAC;YACpE,SAAS;QACX,CAAC;QAED,MAAM,oBAAoB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAChD,iFAAiF;QACjF,qBAAqB,CACnB,oBAAoB,IAAI,OAAO,oBAAoB,KAAK,QAAQ,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,EAC5F,mBAAmB,EACnB,SAAS,EACT,iBAAiB,CAClB,CAAC;IACJ,CAAC;IAED,wEAAwE;IACxE,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC;IACrC,mEAAmE;IACnE,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/E,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5C,qBAAqB,CACnB,WAAW,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAChG,UAAU,EACV,SAAS,EACT,iBAAiB,CAClB,CAAC;IACJ,CAAC;AACH,CAAC"}

package/lib/utils/jsonBreakDetector/checks/findNumericConstraintNarrowing.d.ts

@@ -0,0 +1,6 @@
+import { JsonBreak } from '../types';
+import { JSONSchema } from '@squiz/json-schema-library';
+/** Recursively detects narrowed numeric constraints at each schema level, accumulating dotted paths. */
+export declare function findNumericConstraintNarrowing(beforeSchema: JSONSchema, afterSchema: JSONSchema, path: string, breaks: JsonBreak[]): void;
+/** Checks numeric constraint keywords on a single schema for narrowing changes. */
+export declare function checkNumericConstraintNarrowing(beforeSchema: JSONSchema, afterSchema: JSONSchema, path: string, breaks: JsonBreak[]): void;

package/lib/utils/jsonBreakDetector/checks/findNumericConstraintNarrowing.js

@@ -0,0 +1,179 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findNumericConstraintNarrowing = findNumericConstraintNarrowing;
+exports.checkNumericConstraintNarrowing = checkNumericConstraintNarrowing;
+const types_1 = require("../types");
+/** Recursively detects narrowed numeric constraints at each schema level, accumulating dotted paths. */
+function findNumericConstraintNarrowing(beforeSchema, afterSchema, path, breaks) {
+    var _a, _b;
+    const beforeProperties = (_a = beforeSchema.properties) !== null && _a !== void 0 ? _a : {};
+    const afterProperties = (_b = afterSchema.properties) !== null && _b !== void 0 ? _b : {};
+    // Recurse into latest nested object properties.
+    for (const [key, afterPropertySchema] of Object.entries(afterProperties)) {
+        if (!afterPropertySchema || typeof afterPropertySchema !== 'object') {
+            continue;
+        }
+        const beforePropertySchema = beforeProperties[key];
+        const childPath = path ? `${path}.${key}` : key;
+        // Only compare numeric constraints on fields that existed in the before schema. New fields are skipped.
+        if (beforePropertySchema && typeof beforePropertySchema === 'object') {
+            checkNumericConstraintNarrowing(beforePropertySchema, afterPropertySchema, childPath, breaks);
+            findNumericConstraintNarrowing(beforePropertySchema, afterPropertySchema, childPath, breaks);
+        }
+    }
+    const beforeItems = beforeSchema.items;
+    const afterItems = afterSchema.items;
+    // Recurse into latest nested array items.
+    if (afterItems && typeof afterItems === 'object' && !Array.isArray(afterItems)) {
+        const itemsPath = path ? `${path}[]` : '[]';
+        const beforeItemSchema = beforeItems && typeof beforeItems === 'object' && !Array.isArray(beforeItems) ? beforeItems : undefined;
+        // Only compare numeric constraints on items that existed in the before schema. New items are skipped.
+        if (beforeItemSchema) {
+            checkNumericConstraintNarrowing(beforeItemSchema, afterItems, itemsPath, breaks);
+            findNumericConstraintNarrowing(beforeItemSchema, afterItems, itemsPath, breaks);
+        }
+    }
+}
+/** Returns true when a schema represents a numeric field. */
+function isNumericFieldSchema(schema) {
+    const type = schema.type;
+    if (type === 'number' || type === 'integer') {
+        return true;
+    }
+    // Type can be defined as a union of strings e.g. ['number', 'integer'], so check if 'number' or 'integer' is included.
+    if (Array.isArray(type) && (type.includes('number') || type.includes('integer'))) {
+        return true;
+    }
+    return (schema.minimum !== undefined ||
+        schema.exclusiveMinimum !== undefined ||
+        schema.maximum !== undefined ||
+        schema.exclusiveMaximum !== undefined ||
+        schema.multipleOf !== undefined);
+}
+/** Returns the strictest lower bound from `minimum` and `exclusiveMinimum`, which may both be set. */
+function getEffectiveLowerBound(schema) {
+    const minimum = schema.minimum;
+    const exclusiveMinimum = schema.exclusiveMinimum;
+    // Both are defined, need to figure out which is lower
+    if (minimum !== undefined && exclusiveMinimum !== undefined) {
+        // min 5 is same as exclusiveMinimum 6 (x >= minimum and x > exclusiveMinimum)
+        // so if they are the same exclusiveMinimum is the effective lower bound
+        if (minimum > exclusiveMinimum) {
+            return { value: minimum, keyword: 'minimum' };
+        }
+        return { value: exclusiveMinimum, keyword: 'exclusiveMinimum' };
+    }
+    if (minimum !== undefined) {
+        return { value: minimum, keyword: 'minimum' };
+    }
+    if (exclusiveMinimum !== undefined) {
+        return { value: exclusiveMinimum, keyword: 'exclusiveMinimum' };
+    }
+    return undefined;
+}
+/** Returns the strictest upper bound from `maximum` and `exclusiveMaximum`, which may both be set. */
+function getEffectiveUpperBound(schema) {
+    const maximum = schema.maximum;
+    const exclusiveMaximum = schema.exclusiveMaximum;
+    if (maximum !== undefined && exclusiveMaximum !== undefined) {
+        // max 4 is same as exclusiveMaximum 5 (x <= maximum and x < exclusiveMaximum)
+        // so if they are the same exclusiveMaximum is the effective upper bound
+        if (maximum < exclusiveMaximum) {
+            return { value: maximum, keyword: 'maximum' };
+        }
+        return { value: exclusiveMaximum, keyword: 'exclusiveMaximum' };
+    }
+    if (maximum !== undefined) {
+        return { value: maximum, keyword: 'maximum' };
+    }
+    if (exclusiveMaximum !== undefined) {
+        return { value: exclusiveMaximum, keyword: 'exclusiveMaximum' };
+    }
+    return undefined;
+}
+/** Returns true when afterSchema requires a stricter lower bound than beforeSchema. */
+function hasLowerBoundIncreased(beforeSchema, afterSchema) {
+    const beforeBound = getEffectiveLowerBound(beforeSchema);
+    const afterBound = getEffectiveLowerBound(afterSchema);
+    if (afterBound === undefined) {
+        return false;
+    }
+    if (beforeBound === undefined) {
+        return true;
+    }
+    if (afterBound.value > beforeBound.value) {
+        return true;
+    }
+    if (afterBound.value < beforeBound.value) {
+        return false;
+    }
+    // Same effective value, but inclusive vs exclusive still differs (e.g. minimum: 5 allows 5, exclusiveMinimum: 5 does not).
+    return afterBound.keyword === 'exclusiveMinimum' && beforeBound.keyword === 'minimum';
+}
+/** Returns true when afterSchema allows a stricter upper bound than beforeSchema. */
+function hasUpperBoundLowered(beforeSchema, afterSchema) {
+    const beforeBound = getEffectiveUpperBound(beforeSchema);
+    const afterBound = getEffectiveUpperBound(afterSchema);
+    if (afterBound === undefined) {
+        return false;
+    }
+    if (beforeBound === undefined) {
+        return true;
+    }
+    if (afterBound.value < beforeBound.value) {
+        return true;
+    }
+    if (afterBound.value > beforeBound.value) {
+        return false;
+    }
+    // Same effective value, but inclusive vs exclusive still differs (e.g. maximum: 10 allows 10, exclusiveMaximum: 10 does not).
+    return afterBound.keyword === 'exclusiveMaximum' && beforeBound.keyword === 'maximum';
+}
+/** Picks the break message for the keyword that supplies the effective lower bound in the after schema. */
+function getLowerBoundBreakMessage(_beforeSchema, afterSchema) {
+    const afterBound = getEffectiveLowerBound(afterSchema);
+    return (afterBound === null || afterBound === void 0 ? void 0 : afterBound.keyword) === 'exclusiveMinimum' ? types_1.BREAK_MESSAGES.exclusiveMinimum : types_1.BREAK_MESSAGES.minimum;
+}
+/** Picks the break message for the keyword that supplies the effective upper bound in the after schema. */
+function getUpperBoundBreakMessage(_beforeSchema, afterSchema) {
+    const afterBound = getEffectiveUpperBound(afterSchema);
+    return (afterBound === null || afterBound === void 0 ? void 0 : afterBound.keyword) === 'exclusiveMaximum' ? types_1.BREAK_MESSAGES.exclusiveMaximum : types_1.BREAK_MESSAGES.maximum;
+}
+/**
+ * Returns true when afterSchema narrows the set of allowed multiples.
+ * A value valid under the before `multipleOf` may be invalid under the after `multipleOf`
+ * unless the before factor is itself a multiple of the after factor.
+ */
+function hasMultipleOfNarrowed(beforeSchema, afterSchema) {
+    const afterMultipleOf = afterSchema.multipleOf;
+    const beforeMultipleOf = beforeSchema.multipleOf;
+    if (afterMultipleOf === undefined) {
+        return false;
+    }
+    if (beforeMultipleOf === undefined) {
+        return true;
+    }
+    if (beforeMultipleOf === afterMultipleOf) {
+        return false;
+    }
+    // Check if the constraint is strictly narrowed
+    // e.g. from 4 to 2 is ok as previous valid entries will still be valid
+    // but from 4 to 3 is not
+    return beforeMultipleOf % afterMultipleOf !== 0;
+}
+/** Checks numeric constraint keywords on a single schema for narrowing changes. */
+function checkNumericConstraintNarrowing(beforeSchema, afterSchema, path, breaks) {
+    if (!isNumericFieldSchema(beforeSchema) && !isNumericFieldSchema(afterSchema)) {
+        return;
+    }
+    if (hasLowerBoundIncreased(beforeSchema, afterSchema)) {
+        (0, types_1.pushBreak)(breaks, path, getLowerBoundBreakMessage(beforeSchema, afterSchema));
+    }
+    if (hasUpperBoundLowered(beforeSchema, afterSchema)) {
+        (0, types_1.pushBreak)(breaks, path, getUpperBoundBreakMessage(beforeSchema, afterSchema));
+    }
+    if (hasMultipleOfNarrowed(beforeSchema, afterSchema)) {
+        (0, types_1.pushBreak)(breaks, path, types_1.BREAK_MESSAGES.multipleOf);
+    }
+}
+//# sourceMappingURL=findNumericConstraintNarrowing.js.map

package/lib/utils/jsonBreakDetector/checks/findNumericConstraintNarrowing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findNumericConstraintNarrowing.js","sourceRoot":"","sources":["../../../../src/utils/jsonBreakDetector/checks/findNumericConstraintNarrowing.ts"],"names":[],"mappings":";;AAIA,wEAwCC;AAiLD,0EAqBC;AAlPD,oCAAgE;AAGhE,wGAAwG;AACxG,SAAgB,8BAA8B,CAC5C,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,MAAmB;;IAEnB,MAAM,gBAAgB,GAAG,MAAA,YAAY,CAAC,UAAU,mCAAI,EAAE,CAAC;IACvD,MAAM,eAAe,GAAG,MAAA,WAAW,CAAC,UAAU,mCAAI,EAAE,CAAC;IAErD,gDAAgD;IAChD,KAAK,MAAM,CAAC,GAAG,EAAE,mBAAmB,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;QACzE,IAAI,CAAC,mBAAmB,IAAI,OAAO,mBAAmB,KAAK,QAAQ,EAAE,CAAC;YACpE,SAAS;QACX,CAAC;QAED,MAAM,oBAAoB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAEhD,wGAAwG;QACxG,IAAI,oBAAoB,IAAI,OAAO,oBAAoB,KAAK,QAAQ,EAAE,CAAC;YACrE,+BAA+B,CAAC,oBAAoB,EAAE,mBAAmB,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;YAC9F,8BAA8B,CAAC,oBAAoB,EAAE,mBAAmB,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QAC/F,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC;IAErC,0CAA0C;IAC1C,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/E,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5C,MAAM,gBAAgB,GACpB,WAAW,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QAE1G,sGAAsG;QACtG,IAAI,gBAAgB,EAAE,CAAC;YACrB,+BAA+B,CAAC,gBAAgB,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;YACjF,8BAA8B,CAAC,gBAAgB,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QAClF,CAAC;IACH,CAAC;AACH,CAAC;AAED,6DAA6D;AAC7D,SAAS,oBAAoB,CAAC,MAAkB;IAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uHAAuH;IACvH,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;QACjF,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CACL,MAAM,CAAC,OAAO,KAAK,SAAS;QAC5B,MAAM,CAAC,gBAAgB,KAAK,SAAS;QACrC,MAAM,CAAC,OAAO,KAAK,SAAS;QAC5B,MAAM,CAAC,gBAAgB,KAAK,SAAS;QACrC,MAAM,CAAC,UAAU,KAAK,SAAS,CAChC,CAAC;AACJ,CAAC;AAWD,sGAAsG;AACtG,SAAS,sBAAsB,CAAC,MAAkB;IAChD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC/B,MAAM,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC;IAEjD,sDAAsD;IACtD,IAAI,OAAO,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QAC5D,8EAA8E;QAC9E,wEAAwE;QACxE,IAAI,OAAO,GAAG,gBAAgB,EAAE,CAAC;YAC/B,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAChD,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAClE,CAAC;IAED,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IAChD,CAAC;IAED,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAClE,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,sGAAsG;AACtG,SAAS,sBAAsB,CAAC,MAAkB;IAChD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC/B,MAAM,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC;IAEjD,IAAI,OAAO,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QAC5D,8EAA8E;QAC9E,wEAAwE;QACxE,IAAI,OAAO,GAAG,gBAAgB,EAAE,CAAC;YAC/B,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAChD,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAClE,CAAC;IAED,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IAChD,CAAC;IAED,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAClE,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,uFAAuF;AACvF,SAAS,sBAAsB,CAAC,YAAwB,EAAE,WAAuB;IAC/E,MAAM,WAAW,GAAG,sBAAsB,CAAC,YAAY,CAAC,CAAC;IACzD,MAAM,UAAU,GAAG,sBAAsB,CAAC,WAAW,CAAC,CAAC;IAEvD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2HAA2H;IAC3H,OAAO,UAAU,CAAC,OAAO,KAAK,kBAAkB,IAAI,WAAW,CAAC,OAAO,KAAK,SAAS,CAAC;AACxF,CAAC;AAED,qFAAqF;AACrF,SAAS,oBAAoB,CAAC,YAAwB,EAAE,WAAuB;IAC7E,MAAM,WAAW,GAAG,sBAAsB,CAAC,YAAY,CAAC,CAAC;IACzD,MAAM,UAAU,GAAG,sBAAsB,CAAC,WAAW,CAAC,CAAC;IAEvD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8HAA8H;IAC9H,OAAO,UAAU,CAAC,OAAO,KAAK,kBAAkB,IAAI,WAAW,CAAC,OAAO,KAAK,SAAS,CAAC;AACxF,CAAC;AAED,2GAA2G;AAC3G,SAAS,yBAAyB,CAAC,aAAyB,EAAE,WAAuB;IACnF,MAAM,UAAU,GAAG,sBAAsB,CAAC,WAAW,CAAC,CAAC;IAEvD,OAAO,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,OAAO,MAAK,kBAAkB,CAAC,CAAC,CAAC,sBAAc,CAAC,gBAAgB,CAAC,CAAC,CAAC,sBAAc,CAAC,OAAO,CAAC;AAC/G,CAAC;AAED,2GAA2G;AAC3G,SAAS,yBAAyB,CAAC,aAAyB,EAAE,WAAuB;IACnF,MAAM,UAAU,GAAG,sBAAsB,CAAC,WAAW,CAAC,CAAC;IAEvD,OAAO,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,OAAO,MAAK,kBAAkB,CAAC,CAAC,CAAC,sBAAc,CAAC,gBAAgB,CAAC,CAAC,CAAC,sBAAc,CAAC,OAAO,CAAC;AAC/G,CAAC;AAED;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,YAAwB,EAAE,WAAuB;IAC9E,MAAM,eAAe,GAAG,WAAW,CAAC,UAAU,CAAC;IAC/C,MAAM,gBAAgB,GAAG,YAAY,CAAC,UAAU,CAAC;IAEjD,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;QAClC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,gBAAgB,KAAK,eAAe,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,+CAA+C;IAC/C,uEAAuE;IACvE,yBAAyB;IACzB,OAAO,gBAAgB,GAAG,eAAe,KAAK,CAAC,CAAC;AAClD,CAAC;AAED,mFAAmF;AACnF,SAAgB,+BAA+B,CAC7C,YAAwB,EACxB,WAAuB,EACvB,IAAY,EACZ,MAAmB;IAEnB,IAAI,CAAC,oBAAoB,CAAC,YAAY,CAAC,IAAI,CAAC,oBAAoB,CAAC,WAAW,CAAC,EAAE,CAAC;QAC9E,OAAO;IACT,CAAC;IAED,IAAI,sBAAsB,CAAC,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC;QACtD,IAAA,iBAAS,EAAC,MAAM,EAAE,IAAI,EAAE,yBAAyB,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC;IAChF,CAAC;IAED,IAAI,oBAAoB,CAAC,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC;QACpD,IAAA,iBAAS,EAAC,MAAM,EAAE,IAAI,EAAE,yBAAyB,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC;IAChF,CAAC;IAED,IAAI,qBAAqB,CAAC,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC;QACrD,IAAA,iBAAS,EAAC,MAAM,EAAE,IAAI,EAAE,sBAAc,CAAC,UAAU,CAAC,CAAC;IACrD,CAAC;AACH,CAAC"}

package/lib/utils/jsonBreakDetector/checks/findStringConstraintNarrowing.d.ts

@@ -0,0 +1,6 @@
+import { JsonBreak } from '../types';
+import { JSONSchema } from '@squiz/json-schema-library';
+/** Recursively detects narrowed string constraints at each schema level, accumulating dotted paths. */
+export declare function findStringConstraintNarrowing(beforeSchema: JSONSchema, afterSchema: JSONSchema, path: string, breaks: JsonBreak[]): void;
+/** Checks string constraint keywords on a single schema for narrowing changes. */
+export declare function checkStringConstraintNarrowing(beforeSchema: JSONSchema, afterSchema: JSONSchema, path: string, breaks: JsonBreak[]): void;