@inf-monkeys-tech/monkeys 1.1.28 → 1.1.31

package/lib/esm/{chunk-Z77X7JMT.mjs → chunk-N3RVZAFT.mjs}

@@ -1441,6 +1441,9 @@ var buildChangeImpactGraph = (previousInput, nextInput, generatedAt = (/* @__PUR
   });
 };
 
+// src/runtime/declarative-control-compiler.ts
+import { sha256Hex } from "#canonical-sha256";
+
 // src/runtime/render-tree-compiler.ts
 var compileRenderTree = (input) => {
   const tree = RenderTreeSchema.parse(input);
@@ -1551,136 +1554,6 @@ var stableSerialize = (value) => {
   const record2 = value;
   return `{${Object.keys(record2).filter((key) => record2[key] !== void 0).sort().map((key) => `${JSON.stringify(key)}:${stableSerialize(record2[key])}`).join(",")}}`;
 };
-var SHA256_INITIAL = [
-  1779033703,
-  3144134277,
-  1013904242,
-  2773480762,
-  1359893119,
-  2600822924,
-  528734635,
-  1541459225
-];
-var SHA256_ROUND = [
-  1116352408,
-  1899447441,
-  3049323471,
-  3921009573,
-  961987163,
-  1508970993,
-  2453635748,
-  2870763221,
-  3624381080,
-  310598401,
-  607225278,
-  1426881987,
-  1925078388,
-  2162078206,
-  2614888103,
-  3248222580,
-  3835390401,
-  4022224774,
-  264347078,
-  604807628,
-  770255983,
-  1249150122,
-  1555081692,
-  1996064986,
-  2554220882,
-  2821834349,
-  2952996808,
-  3210313671,
-  3336571891,
-  3584528711,
-  113926993,
-  338241895,
-  666307205,
-  773529912,
-  1294757372,
-  1396182291,
-  1695183700,
-  1986661051,
-  2177026350,
-  2456956037,
-  2730485921,
-  2820302411,
-  3259730800,
-  3345764771,
-  3516065817,
-  3600352804,
-  4094571909,
-  275423344,
-  430227734,
-  506948616,
-  659060556,
-  883997877,
-  958139571,
-  1322822218,
-  1537002063,
-  1747873779,
-  1955562222,
-  2024104815,
-  2227730452,
-  2361852424,
-  2428436474,
-  2756734187,
-  3204031479,
-  3329325298
-];
-var rotateRight = (value, amount) => value >>> amount | value << 32 - amount;
-var sha256Hex = (value) => {
-  const source = [...new TextEncoder().encode(value)];
-  const bitLength = source.length * 8;
-  source.push(128);
-  while (source.length % 64 !== 56) source.push(0);
-  const high = Math.floor(bitLength / 4294967296);
-  const low = bitLength >>> 0;
-  for (let shift = 24; shift >= 0; shift -= 8)
-    source.push(high >>> shift & 255);
-  for (let shift = 24; shift >= 0; shift -= 8)
-    source.push(low >>> shift & 255);
-  const hash = [...SHA256_INITIAL];
-  const words = new Array(64).fill(0);
-  for (let offset = 0; offset < source.length; offset += 64) {
-    for (let index = 0; index < 16; index += 1) {
-      const start = offset + index * 4;
-      words[index] = (source[start] << 24 | source[start + 1] << 16 | source[start + 2] << 8 | source[start + 3]) >>> 0;
-    }
-    for (let index = 16; index < 64; index += 1) {
-      const previous = words[index - 15];
-      const recent = words[index - 2];
-      const small0 = rotateRight(previous, 7) ^ rotateRight(previous, 18) ^ previous >>> 3;
-      const small1 = rotateRight(recent, 17) ^ rotateRight(recent, 19) ^ recent >>> 10;
-      words[index] = words[index - 16] + small0 + words[index - 7] + small1 >>> 0;
-    }
-    let [a, b, c, d, e, f, g, h] = hash;
-    for (let index = 0; index < 64; index += 1) {
-      const big1 = rotateRight(e, 6) ^ rotateRight(e, 11) ^ rotateRight(e, 25);
-      const choice = e & f ^ ~e & g;
-      const temp1 = h + big1 + choice + SHA256_ROUND[index] + words[index] >>> 0;
-      const big0 = rotateRight(a, 2) ^ rotateRight(a, 13) ^ rotateRight(a, 22);
-      const majority = a & b ^ a & c ^ b & c;
-      const temp2 = big0 + majority >>> 0;
-      h = g;
-      g = f;
-      f = e;
-      e = d + temp1 >>> 0;
-      d = c;
-      c = b;
-      b = a;
-      a = temp1 + temp2 >>> 0;
-    }
-    hash[0] = hash[0] + a >>> 0;
-    hash[1] = hash[1] + b >>> 0;
-    hash[2] = hash[2] + c >>> 0;
-    hash[3] = hash[3] + d >>> 0;
-    hash[4] = hash[4] + e >>> 0;
-    hash[5] = hash[5] + f >>> 0;
-    hash[6] = hash[6] + g >>> 0;
-    hash[7] = hash[7] + h >>> 0;
-  }
-  return hash.map((part) => part.toString(16).padStart(8, "0")).join("");
-};
 var canonicalContentHash = (value) => sha256Hex(stableSerialize(value));
 var declarativeRuntimeProjectionId = (resourceKind, releaseSlotId, releaseRevisionRef) => `drb:${canonicalContentHash({ resourceKind, releaseSlotId, releaseRevisionRef })}`;
 var declarativeRouteOwnerIndexProjectionId = (tenantScope, environmentRef, surface) => `dri:${canonicalContentHash({
@@ -4726,7 +4599,7 @@ var deepFreeze2 = (value) => {
   Object.values(value).forEach((child) => deepFreeze2(child));
   return Object.freeze(value);
 };
-var SHA256_INITIAL2 = [
+var SHA256_INITIAL = [
   1779033703,
   3144134277,
   1013904242,
@@ -4736,7 +4609,7 @@ var SHA256_INITIAL2 = [
   528734635,
   1541459225
 ];
-var SHA256_ROUND2 = [
+var SHA256_ROUND = [
   1116352408,
   1899447441,
   3049323471,
@@ -4802,7 +4675,7 @@ var SHA256_ROUND2 = [
   3204031479,
   3329325298
 ];
-var rotateRight2 = (value, amount) => value >>> amount | value << 32 - amount;
+var rotateRight = (value, amount) => value >>> amount | value << 32 - amount;
 var sha256Hex2 = (value) => {
   const source = [...new TextEncoder().encode(value)];
   const bitLength = source.length * 8;
@@ -4812,7 +4685,7 @@ var sha256Hex2 = (value) => {
   const low = bitLength >>> 0;
   for (let shift = 24; shift >= 0; shift -= 8) source.push(high >>> shift & 255);
   for (let shift = 24; shift >= 0; shift -= 8) source.push(low >>> shift & 255);
-  const hash = [...SHA256_INITIAL2];
+  const hash = [...SHA256_INITIAL];
   const words = new Array(64).fill(0);
   for (let offset = 0; offset < source.length; offset += 64) {
     for (let index = 0; index < 16; index += 1) {
@@ -4822,16 +4695,16 @@ var sha256Hex2 = (value) => {
     for (let index = 16; index < 64; index += 1) {
       const previous = words[index - 15];
       const recent = words[index - 2];
-      const small0 = rotateRight2(previous, 7) ^ rotateRight2(previous, 18) ^ previous >>> 3;
-      const small1 = rotateRight2(recent, 17) ^ rotateRight2(recent, 19) ^ recent >>> 10;
+      const small0 = rotateRight(previous, 7) ^ rotateRight(previous, 18) ^ previous >>> 3;
+      const small1 = rotateRight(recent, 17) ^ rotateRight(recent, 19) ^ recent >>> 10;
       words[index] = words[index - 16] + small0 + words[index - 7] + small1 >>> 0;
     }
     let [a, b, c, d, e, f, g, h] = hash;
     for (let index = 0; index < 64; index += 1) {
-      const big1 = rotateRight2(e, 6) ^ rotateRight2(e, 11) ^ rotateRight2(e, 25);
+      const big1 = rotateRight(e, 6) ^ rotateRight(e, 11) ^ rotateRight(e, 25);
       const choice = e & f ^ ~e & g;
-      const temp1 = h + big1 + choice + SHA256_ROUND2[index] + words[index] >>> 0;
-      const big0 = rotateRight2(a, 2) ^ rotateRight2(a, 13) ^ rotateRight2(a, 22);
+      const temp1 = h + big1 + choice + SHA256_ROUND[index] + words[index] >>> 0;
+      const big0 = rotateRight(a, 2) ^ rotateRight(a, 13) ^ rotateRight(a, 22);
       const majority = a & b ^ a & c ^ b & c;
       const temp2 = big0 + majority >>> 0;
       h = g;
@@ -5778,6 +5651,15 @@ var schemasCannotOverlap = (left, right) => {
   const values = (schema) => Object.prototype.hasOwnProperty.call(schema, "const") ? [schema.const] : Array.isArray(schema.enum) ? schema.enum : void 0;
   const av = values(a), bv = values(b);
   if (av && bv && av.every((value) => !bv.some((other) => canonicalContentHash(value) === canonicalContentHash(other)))) return true;
+  const declaredTypes = (schema) => {
+    const types = typeof schema.type === "string" ? [schema.type] : schema.type;
+    if (!Array.isArray(types) || !types.length || types.some((type) => !["null", "boolean", "object", "array", "number", "integer", "string"].includes(type))) return void 0;
+    return types.map((type) => type === "integer" ? "number" : type);
+  };
+  const valueTypes = (entries) => entries?.map((value) => value === null ? "null" : Array.isArray(value) ? "array" : typeof value);
+  const disjoint = (leftTypes, rightTypes) => !!leftTypes && !!rightTypes && leftTypes.every((type) => !rightTypes.includes(type));
+  const at = declaredTypes(a), bt = declaredTypes(b);
+  if (disjoint(at, bt) || disjoint(valueTypes(av), bt) || disjoint(at, valueTypes(bv))) return true;
   if (a.type !== "object" || b.type !== "object") return false;
   const property = (schema, key) => schema.properties?.[key] ?? (schema.patternProperties ? true : schema.additionalProperties ?? true);
   return [...a.required ?? [], ...b.required ?? []].some((key) => schemasCannotOverlap(property(a, key), property(b, key)));
@@ -5815,6 +5697,31 @@ var boundAcceptsPrevious = (previous, next, direction) => {
   return previous.value !== next.value || !previous.inclusive || next.inclusive;
 };
 var numericRangesAcceptPrevious = (previous, next) => boundAcceptsPrevious(numericBound(previous, "lower"), numericBound(next, "lower"), "lower") && boundAcceptsPrevious(numericBound(previous, "upper"), numericBound(next, "upper"), "upper");
+var containsSchemaReference = (value) => !!value && typeof value === "object" && Object.entries(value).some(([key, child]) => ["$ref", "$dynamicRef", "$recursiveRef"].includes(key) || containsSchemaReference(child));
+var hasPositiveLocalReferences = (schema, names, root = true) => {
+  if (typeof schema === "boolean") return true;
+  if (!schema || typeof schema !== "object" || Array.isArray(schema)) return false;
+  return Object.entries(schema).every(([key, value]) => {
+    if (key === "$ref") return typeof value === "string" && [...names].some((name) => value === `#/$defs/${name.replace(/~/g, "~0").replace(/\//g, "~1")}`);
+    if (["$dynamicRef", "$recursiveRef", "$dynamicAnchor", "$recursiveAnchor", "$anchor"].includes(key)) return false;
+    if (key === "$id") return root;
+    if (key === "$defs" || key === "properties") {
+      if (key === "$defs" && !root) return false;
+      return !!value && typeof value === "object" && !Array.isArray(value) && Object.values(value).every((child) => hasPositiveLocalReferences(child, names, false));
+    }
+    if (["items", "additionalProperties"].includes(key)) return hasPositiveLocalReferences(value, names, false);
+    if (["anyOf", "allOf"].includes(key)) return Array.isArray(value) && value.every((child) => hasPositiveLocalReferences(child, names, false));
+    return !containsSchemaReference(value);
+  });
+};
+var isUnreachableConditional = (previous, branch) => {
+  if (previous.type !== "object" || !branch || typeof branch !== "object" || Array.isArray(branch)) return false;
+  const rule = branch;
+  if (!rule.if || Object.keys(rule).some((key) => !["if", "then"].includes(key))) return false;
+  const condition = rule.if;
+  if (typeof condition !== "object" || Array.isArray(condition) || Object.keys(condition).some((key) => !["type", "properties", "required"].includes(key)) || condition.type !== void 0 && condition.type !== "object" || !Array.isArray(condition.required)) return false;
+  return condition.required.some((key) => typeof key === "string" && schemasCannotOverlap(previous.properties?.[key] ?? (previous.patternProperties ? true : previous.additionalProperties ?? true), condition.properties?.[key] ?? true));
+};
 var acceptsPreviousSchema = (previous, next) => {
   if (canonicalContentHash(previous) === canonicalContentHash(next) || next === true) return true;
   if (previous === false) return true;
@@ -5827,6 +5734,21 @@ var acceptsPreviousSchema = (previous, next) => {
   if (oldBranches) return oldBranches.every((branch) => acceptsPreviousSchema(branch, next));
   const newBranches = branches(after);
   if (newBranches) return newBranches.some((branch, index) => acceptsPreviousSchema(previous, branch) && (!after.oneOf || newBranches.every((other, otherIndex) => index === otherIndex || schemasCannotOverlap(previous, other))));
+  if (canonicalContentHash(before.$defs ?? null) !== canonicalContentHash(after.$defs ?? null)) {
+    const oldDefinitions = before.$defs, newDefinitions = after.$defs;
+    if (!oldDefinitions || !newDefinitions || typeof oldDefinitions !== "object" || typeof newDefinitions !== "object" || Array.isArray(oldDefinitions) || Array.isArray(newDefinitions)) return false;
+    const names = new Set(Object.keys(oldDefinitions));
+    if (names.size !== Object.keys(newDefinitions).length || [...names].some((name) => !Object.prototype.hasOwnProperty.call(newDefinitions, name)) || !hasPositiveLocalReferences(before, names) || !hasPositiveLocalReferences(after, names) || [...names].some((name) => !acceptsPreviousSchema(oldDefinitions[name], newDefinitions[name]))) return false;
+    delete before.$defs;
+    delete after.$defs;
+  }
+  if (canonicalContentHash(before.allOf ?? null) !== canonicalContentHash(after.allOf ?? null)) {
+    if (before.allOf !== void 0 && !Array.isArray(before.allOf) || !Array.isArray(after.allOf)) return false;
+    const previousBranches = before.allOf ?? [];
+    if (previousBranches.some((branch) => !after.allOf.some((candidate) => canonicalContentHash(branch) === canonicalContentHash(candidate))) || after.allOf.some((branch) => !previousBranches.some((candidate) => canonicalContentHash(branch) === canonicalContentHash(candidate)) && !isUnreachableConditional(before, branch))) return false;
+    if (before.allOf === void 0) delete after.allOf;
+    else after.allOf = before.allOf;
+  }
   const {
     properties: oldProperties,
     required: oldRequired,
@@ -7313,4 +7235,4 @@ export {
   PageCompositionSchema,
   compilePageComposition
 };
-//# sourceMappingURL=chunk-Z77X7JMT.mjs.map
+//# sourceMappingURL=chunk-N3RVZAFT.mjs.map