@pactflow/openapi-pact-comparator 1.4.0 → 1.5.0

package/README.md

@@ -28,7 +28,7 @@ references. Further, unused references are skipped to speed up schema
 compilation in AJV.
 
 **Multiple pacts can be compared in one invocation to maximise schema reuse**.
-Instead of perforing the comparison per pair of OAS + Pact, we can reuse the
+Instead of performing the comparison per pair of OAS + Pact, we can reuse the
 compiled OAS schemas across multiple Pacts.
 
 **A fast HTTP router is used to match provider routes**. Instead of iterating

package/dist/cli.cjs

@@ -11842,6 +11842,10 @@ const minimumSchema = (originalSchema, oas) => {
         if (s.$ref && !refToAdd.includes(s.$ref) && !refAdded.includes(s.$ref)) {
             refToAdd.push(s.$ref);
         }
+        // no-op from a validation perspective
+        if (s.discriminator?.mapping) {
+            delete s.discriminator.mapping;
+        }
     };
     const handleNullableSchema = (s) => {
         if (s.$ref) {
@@ -12513,7 +12517,7 @@ function requireSideChannelList () {
 	/** @type {import('./list.d.ts').listGet} */
 	var listGet = function (objects, key) {
 		if (!objects) {
-			return void 0;
+			return void undefined;
 		}
 		var node = listGetNode(objects, key);
 		return node && node.value;
@@ -12566,7 +12570,7 @@ function requireSideChannelList () {
 				var root = $o && $o.next;
 				var deletedNode = listDelete($o, key);
 				if (deletedNode && root && root === deletedNode) {
-					$o = void 0;
+					$o = void undefined;
 				}
 				return !!deletedNode;
 			},
@@ -12580,7 +12584,7 @@ function requireSideChannelList () {
 				if (!$o) {
 					// Initialize the linked list as an empty node, so that we don't have to special-case handling of the first node: we can always refer to it as (previous node).next, instead of something like (list).head
 					$o = {
-						next: void 0
+						next: void undefined
 					};
 				}
 				// eslint-disable-next-line no-extra-parens
@@ -13564,7 +13568,7 @@ function requireGetIntrinsic () {
 					if (!allowMissing) {
 						throw new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');
 					}
-					return void 0;
+					return void undefined$1;
 				}
 				if ($gOPD && (i + 1) >= parts.length) {
 					var desc = $gOPD(value, part);
@@ -13668,7 +13672,7 @@ function requireSideChannelMap () {
 				if ($m) {
 					var result = $mapDelete($m, key);
 					if ($mapSize($m) === 0) {
-						$m = void 0;
+						$m = void undefined;
 					}
 					return result;
 				}
@@ -14197,7 +14201,7 @@ function requireStringify$1 () {
 	    encodeDotInKeys: false,
 	    encoder: utils.encode,
 	    encodeValuesOnly: false,
-	    filter: void 0,
+	    filter: void undefined,
 	    format: defaultFormat,
 	    formatter: formats.formatters[defaultFormat],
 	    // deprecated
@@ -14244,7 +14248,7 @@ function requireStringify$1 () {
 	    var tmpSc = sideChannel;
 	    var step = 0;
 	    var findFlag = false;
-	    while ((tmpSc = tmpSc.get(sentinel)) !== void 0 && !findFlag) {
+	    while ((tmpSc = tmpSc.get(sentinel)) !== void undefined && !findFlag) {
 	        // Where object last appeared in the ref tree
 	        var pos = tmpSc.get(object);
 	        step += 1;
@@ -14301,7 +14305,7 @@ function requireStringify$1 () {
 	        if (encodeValuesOnly && encoder) {
 	            obj = utils.maybeMap(obj, encoder);
 	        }
-	        objKeys = [{ value: obj.length > 0 ? obj.join(',') || null : void 0 }];
+	        objKeys = [{ value: obj.length > 0 ? obj.join(',') || null : void undefined }];
 	    } else if (isArray(filter)) {
 	        objKeys = filter;
 	    } else {
@@ -32043,7 +32047,7 @@ class Comparator {
     }
 }
 
-var version = "1.4.0";
+var version = "1.5.0";
 var packageJson = {
 	version: version};