@tempots/beatui 0.72.0 → 0.74.0

package/dist/json-schema/index.es.js

@@ -1,5 +1,5 @@
-import { U as sn, V as ye, B as Gs, o as ze, m as br, p as Xs, C as Zs, t as xs, l as Ys, j as Qs, N as ei, k as ti, s as ri, r as ni, q as ai, R as si, S as ii, E as rs, W as oi, u as ci, X as ui } from "../widget-customization-29Hl2gKT.js";
-import { c as gf, d as vf, f as $f } from "../widget-customization-29Hl2gKT.js";
+import { U as sn, V as ye, B as Gs, o as ze, m as br, p as Xs, C as Zs, t as xs, l as Ys, j as Qs, N as ei, k as ti, s as ri, r as ni, q as ai, R as si, S as ii, E as rs, W as oi, u as ci, X as ui } from "../widget-customization-Bo4XWiwB.js";
+import { Y as gf, c as vf, d as $f, f as bf } from "../widget-customization-Bo4XWiwB.js";
 import { g as dr } from "../_commonjsHelpers-C6fGbg64.js";
 import { a as Ee, S as me, I as nt, c as te, j as _r, b as on, L as We, M as li, C as ns, g as di, A as fi, h as mi } from "../use-form-B7A865EM.js";
 import { _ as Kr, g as pi, S as hi, f as yi, N as as, l as de, W as gi, e as vi, t as Xe, T as $i, U as bi, b as Mr, c as _i, M as st, h as wi, G as Si, L as Pi, i as ji, j as Ei } from "../deep-merge-CQQCMLwG.js";
@@ -310,8 +310,8 @@ function H() {
         super(), this.varKind = $, this.name = j, this.rhs = R;
       }
       render({ es5: $, _n: j }) {
-        const R = $ ? r.varKinds.var : this.varKind, F = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
-        return `${R} ${this.name}${F};` + j;
+        const R = $ ? r.varKinds.var : this.varKind, L = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
+        return `${R} ${this.name}${L};` + j;
       }
       optimizeNames($, j) {
         if ($[this.name.str])
@@ -334,12 +334,12 @@ function H() {
       }
       get names() {
         const $ = this.lhs instanceof t.Name ? {} : { ...this.lhs.names };
-        return L($, this.rhs);
+        return F($, this.rhs);
       }
     }
     class l extends c {
-      constructor($, j, R, F) {
-        super($, R, F), this.op = j;
+      constructor($, j, R, L) {
+        super($, R, L), this.op = j;
       }
       render({ _n: $ }) {
         return `${this.lhs} ${this.op}= ${this.rhs};` + $;
@@ -407,10 +407,10 @@ function H() {
       }
       optimizeNames($, j) {
         const { nodes: R } = this;
-        let F = R.length;
-        for (; F--; ) {
-          const D = R[F];
-          D.optimizeNames($, j) || (ee($, D.names), R.splice(F, 1));
+        let L = R.length;
+        for (; L--; ) {
+          const D = R[L];
+          D.optimizeNames($, j) || (ee($, D.names), R.splice(L, 1));
         }
         return R.length > 0 ? this : void 0;
       }
@@ -458,7 +458,7 @@ function H() {
       }
       get names() {
         const $ = super.names;
-        return L($, this.condition), this.else && V($, this.else.names), $;
+        return F($, this.condition), this.else && V($, this.else.names), $;
       }
     }
     f.kind = "if";
@@ -481,21 +481,21 @@ function H() {
       }
     }
     class y extends o {
-      constructor($, j, R, F) {
-        super(), this.varKind = $, this.name = j, this.from = R, this.to = F;
+      constructor($, j, R, L) {
+        super(), this.varKind = $, this.name = j, this.from = R, this.to = L;
       }
       render($) {
-        const j = $.es5 ? r.varKinds.var : this.varKind, { name: R, from: F, to: D } = this;
-        return `for(${j} ${R}=${F}; ${R}<${D}; ${R}++)` + super.render($);
+        const j = $.es5 ? r.varKinds.var : this.varKind, { name: R, from: L, to: D } = this;
+        return `for(${j} ${R}=${L}; ${R}<${D}; ${R}++)` + super.render($);
       }
       get names() {
-        const $ = L(super.names, this.from);
-        return L($, this.to);
+        const $ = F(super.names, this.from);
+        return F($, this.to);
       }
     }
     class v extends o {
-      constructor($, j, R, F) {
-        super(), this.loop = $, this.varKind = j, this.name = R, this.iterable = F;
+      constructor($, j, R, L) {
+        super(), this.loop = $, this.varKind = j, this.name = R, this.iterable = L;
       }
       render($) {
         return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render($);
@@ -533,8 +533,8 @@ function H() {
         return super.optimizeNodes(), ($ = this.catch) === null || $ === void 0 || $.optimizeNodes(), (j = this.finally) === null || j === void 0 || j.optimizeNodes(), this;
       }
       optimizeNames($, j) {
-        var R, F;
-        return super.optimizeNames($, j), (R = this.catch) === null || R === void 0 || R.optimizeNames($, j), (F = this.finally) === null || F === void 0 || F.optimizeNames($, j), this;
+        var R, L;
+        return super.optimizeNames($, j), (R = this.catch) === null || R === void 0 || R.optimizeNames($, j), (L = this.finally) === null || L === void 0 || L.optimizeNames($, j), this;
       }
       get names() {
         const $ = super.names;
@@ -588,9 +588,9 @@ function H() {
       scopeCode() {
         return this._extScope.scopeCode(this._values);
       }
-      _def($, j, R, F) {
+      _def($, j, R, L) {
         const D = this._scope.toName(j);
-        return R !== void 0 && F && (this._constants[D.str] = R), this._leafNode(new i($, D, R)), D;
+        return R !== void 0 && L && (this._constants[D.str] = R), this._leafNode(new i($, D, R)), D;
       }
       // `const` declaration (`var` in es5 mode)
       const($, j, R) {
@@ -619,8 +619,8 @@ function H() {
       // returns code for object literal for the passed argument list of key-value pairs
       object(...$) {
         const j = ["{"];
-        for (const [R, F] of $)
-          j.length > 1 && j.push(","), j.push(R), (R !== F || this.opts.es5) && (j.push(":"), (0, t.addCodeArg)(j, F));
+        for (const [R, L] of $)
+          j.length > 1 && j.push(","), j.push(R), (R !== L || this.opts.es5) && (j.push(":"), (0, t.addCodeArg)(j, L));
         return j.push("}"), new t._Code(j);
       }
       // `if` clause (or statement if `thenBody` and, optionally, `elseBody` are passed)
@@ -653,12 +653,12 @@ function H() {
         return this._for(new d($), j);
       }
       // `for` statement for a range of values
-      forRange($, j, R, F, D = this.opts.es5 ? r.varKinds.var : r.varKinds.let) {
+      forRange($, j, R, L, D = this.opts.es5 ? r.varKinds.var : r.varKinds.let) {
         const X = this._scope.toName($);
-        return this._for(new y(D, X, j, R), () => F(X));
+        return this._for(new y(D, X, j, R), () => L(X));
       }
       // `for-of` statement (in es5 mode replace with a normal for loop)
-      forOf($, j, R, F = r.varKinds.const) {
+      forOf($, j, R, L = r.varKinds.const) {
         const D = this._scope.toName($);
         if (this.opts.es5) {
           const X = j instanceof t.Name ? j : this.var("_arr", j);
@@ -666,15 +666,15 @@ function H() {
             this.var(D, (0, t._)`${X}[${G}]`), R(D);
           });
         }
-        return this._for(new v("of", F, D, j), () => R(D));
+        return this._for(new v("of", L, D, j), () => R(D));
       }
       // `for-in` statement.
       // With option `ownProperties` replaced with a `for-of` loop for object keys
-      forIn($, j, R, F = this.opts.es5 ? r.varKinds.var : r.varKinds.const) {
+      forIn($, j, R, L = this.opts.es5 ? r.varKinds.var : r.varKinds.const) {
         if (this.opts.ownProperties)
           return this.forOf($, (0, t._)`Object.keys(${j})`, R);
         const D = this._scope.toName($);
-        return this._for(new v("in", F, D, j), () => R(D));
+        return this._for(new v("in", L, D, j), () => R(D));
       }
       // end `for` loop
       endFor() {
@@ -699,12 +699,12 @@ function H() {
       try($, j, R) {
         if (!j && !R)
           throw new Error('CodeGen: "try" without "catch" and "finally"');
-        const F = new N();
-        if (this._blockNode(F), this.code($), j) {
+        const L = new N();
+        if (this._blockNode(L), this.code($), j) {
           const D = this.name("e");
-          this._currNode = F.catch = new q(D), j(D);
+          this._currNode = L.catch = new q(D), j(D);
         }
-        return R && (this._currNode = F.finally = new U(), this.code(R)), this._endBlockNode(q, U);
+        return R && (this._currNode = L.finally = new U(), this.code(R)), this._endBlockNode(q, U);
       }
       // `throw` statement
       throw($) {
@@ -725,8 +725,8 @@ function H() {
         return this._nodes.length = j, this;
       }
       // `function` heading (or definition if funcBody is passed)
-      func($, j = t.nil, R, F) {
-        return this._blockNode(new _($, j, R)), F && this.code(F).endFunc(), this;
+      func($, j = t.nil, R, L) {
+        return this._blockNode(new _($, j, R)), L && this.code(L).endFunc(), this;
       }
       // end function definition
       endFunc() {
@@ -772,20 +772,20 @@ function H() {
         k[j] = (k[j] || 0) + ($[j] || 0);
       return k;
     }
-    function L(k, $) {
+    function F(k, $) {
       return $ instanceof t._CodeOrName ? V(k, $.names) : k;
     }
     function W(k, $, j) {
       if (k instanceof t.Name)
         return R(k);
-      if (!F(k))
+      if (!L(k))
         return k;
       return new t._Code(k._items.reduce((D, X) => (X instanceof t.Name && (X = R(X)), X instanceof t._Code ? D.push(...X._items) : D.push(X), D), []));
       function R(D) {
         const X = j[D.str];
         return X === void 0 || $[D.str] !== 1 ? D : (delete $[D.str], X);
       }
-      function F(D) {
+      function L(D) {
         return D instanceof t._Code && D._items.some((X) => X instanceof t.Name && $[X.str] === 1 && j[X.str] !== void 0);
       }
     }
@@ -894,8 +894,8 @@ function Q() {
   Z.eachItem = g;
   function w({ mergeNames: v, mergeToName: _, mergeValues: P, resultToName: N }) {
     return (q, U, I, V) => {
-      const L = I === void 0 ? U : I instanceof e.Name ? (U instanceof e.Name ? v(q, U, I) : _(q, U, I), I) : U instanceof e.Name ? (_(q, I, U), U) : P(U, I);
-      return V === e.Name && !(L instanceof e.Name) ? N(q, L) : L;
+      const F = I === void 0 ? U : I instanceof e.Name ? (U instanceof e.Name ? v(q, U, I) : _(q, U, I), I) : U instanceof e.Name ? (_(q, I, U), U) : P(U, I);
+      return V === e.Name && !(F instanceof e.Name) ? N(q, F) : F;
     };
   }
   Z.mergeEvaluated = {
@@ -1370,14 +1370,14 @@ function je() {
   }
   ne.schemaProperties = g;
   function w({ schemaCode: o, data: d, it: { gen: y, topSchemaRef: v, schemaPath: _, errorPath: P }, it: N }, q, U, I) {
-    const V = I ? (0, e._)`${o}, ${d}, ${v}${_}` : d, L = [
+    const V = I ? (0, e._)`${o}, ${d}, ${v}${_}` : d, F = [
       [r.default.instancePath, (0, e.strConcat)(r.default.instancePath, P)],
       [r.default.parentData, N.parentData],
       [r.default.parentDataProperty, N.parentDataProperty],
       [r.default.rootData, r.default.rootData]
     ];
-    N.opts.dynamicRef && L.push([r.default.dynamicAnchors, r.default.dynamicAnchors]);
-    const W = (0, e._)`${V}, ${y.object(...L)}`;
+    N.opts.dynamicRef && F.push([r.default.dynamicAnchors, r.default.dynamicAnchors]);
+    const W = (0, e._)`${V}, ${y.object(...F)}`;
     return U !== e.nil ? (0, e._)`${q}.call(${U}, ${W})` : (0, e._)`${q}(${W})`;
   }
   ne.callValidateCode = w;
@@ -1456,25 +1456,25 @@ function Di() {
       if (w.errors === !1)
         I(), w.modifying && i(g), V(() => g.error());
       else {
-        const L = w.async ? q() : U();
-        w.modifying && i(g), V(() => c(g, L));
+        const F = w.async ? q() : U();
+        w.modifying && i(g), V(() => c(g, F));
       }
     }
     function q() {
-      const L = h.let("ruleErrs", null);
-      return h.try(() => I((0, e._)`await `), (W) => h.assign(P, !1).if((0, e._)`${W} instanceof ${y.ValidationError}`, () => h.assign(L, (0, e._)`${W}.errors`), () => h.throw(W))), L;
+      const F = h.let("ruleErrs", null);
+      return h.try(() => I((0, e._)`await `), (W) => h.assign(P, !1).if((0, e._)`${W} instanceof ${y.ValidationError}`, () => h.assign(F, (0, e._)`${W}.errors`), () => h.throw(W))), F;
     }
     function U() {
-      const L = (0, e._)`${_}.errors`;
-      return h.assign(L, null), I(e.nil), L;
+      const F = (0, e._)`${_}.errors`;
+      return h.assign(F, null), I(e.nil), F;
     }
-    function I(L = w.async ? (0, e._)`await ` : e.nil) {
+    function I(F = w.async ? (0, e._)`await ` : e.nil) {
       const W = y.opts.passContext ? t.default.this : t.default.self, ee = !("compile" in w && !d || w.schema === !1);
-      h.assign(P, (0, e._)`${L}${(0, r.callValidateCode)(g, _, W, ee)}`, w.modifying);
+      h.assign(P, (0, e._)`${F}${(0, r.callValidateCode)(g, _, W, ee)}`, w.modifying);
     }
-    function V(L) {
+    function V(F) {
       var W;
-      h.if((0, e.not)((W = w.valid) !== null && W !== void 0 ? W : P), L);
+      h.if((0, e.not)((W = w.valid) !== null && W !== void 0 ? W : P), F);
     }
   }
   Se.funcKeywordCode = a;
@@ -1753,11 +1753,11 @@ function pr() {
     if (typeof h == "boolean")
       return {};
     const { schemaId: f, uriResolver: o } = this.opts, d = b(h[f] || u), y = { "": d }, v = l(o, d, !1), _ = {}, P = /* @__PURE__ */ new Set();
-    return r(h, { allKeys: !0 }, (U, I, V, L) => {
-      if (L === void 0)
+    return r(h, { allKeys: !0 }, (U, I, V, F) => {
+      if (F === void 0)
         return;
       const W = v + I;
-      let ee = y[L];
+      let ee = y[F];
       typeof U[f] == "string" && (ee = re.call(this, U[f])), ae.call(this, U.$anchor), ae.call(this, U.$dynamicAnchor), y[I] = ee;
       function re(Y) {
         const ce = this.opts.uriResolver.resolve;
@@ -1816,7 +1816,7 @@ function Je() {
   function u(E) {
     const { schema: A, opts: T, gen: z } = E;
     w(E, () => {
-      T.$comment && A.$comment && L(E), U(E), z.let(l.default.vErrors, null), z.let(l.default.errors, 0), T.unevaluated && f(E), N(E), W(E);
+      T.$comment && A.$comment && F(E), U(E), z.let(l.default.vErrors, null), z.let(l.default.errors, 0), T.unevaluated && f(E), N(E), W(E);
     });
   }
   function f(E) {
@@ -1847,7 +1847,7 @@ function Je() {
   }
   function _(E, A) {
     const { schema: T, gen: z, opts: B } = E;
-    B.$comment && T.$comment && L(E), I(E), V(E);
+    B.$comment && T.$comment && F(E), I(E), V(E);
     const x = z.const("_errs", l.default.errors);
     N(E, x), z.var(A, (0, c._)`${x} === ${l.default.errors}`);
   }
@@ -1876,7 +1876,7 @@ function Je() {
     if (E.schema.$async && !E.schemaEnv.$async)
       throw new Error("async schema in sync schema");
   }
-  function L({ gen: E, schemaEnv: A, schema: T, errSchemaPath: z, opts: B }) {
+  function F({ gen: E, schemaEnv: A, schema: T, errSchemaPath: z, opts: B }) {
     const x = T.$comment;
     if (B.$comment === !0)
       E.code((0, c._)`${l.default.self}.logger.log(${x})`);
@@ -1895,7 +1895,7 @@ function Je() {
   function re(E, A, T, z) {
     const { gen: B, schema: x, data: ue, allErrors: we, opts: ge, self: ve } = E, { RULES: le } = ve;
     if (x.$ref && (ge.ignoreKeywordsWithRef || !(0, m.schemaHasRulesButRef)(x, le))) {
-      B.block(() => F(E, "$ref", le.all.$ref.definition));
+      B.block(() => L(E, "$ref", le.all.$ref.definition));
       return;
     }
     ge.jtd || Y(E, A), B.block(() => {
@@ -1911,7 +1911,7 @@ function Je() {
     const { gen: T, schema: z, opts: { useDefaults: B } } = E;
     B && (0, s.assignDefaults)(E, A.type), T.block(() => {
       for (const x of A.rules)
-        (0, r.shouldUseRule)(z, x) && F(E, x.keyword, x.definition, A.type);
+        (0, r.shouldUseRule)(z, x) && L(E, x.keyword, x.definition, A.type);
     });
   }
   function Y(E, A) {
@@ -2059,7 +2059,7 @@ function Je() {
     }
   }
   Oe.KeywordCxt = R;
-  function F(E, A, T, z) {
+  function L(E, A, T, z) {
     const B = new R(E, T, A);
     "code" in T ? T.code(B, z) : B.$data && T.validate ? (0, a.funcKeywordCode)(B, T) : "macro" in T ? (0, a.macroKeywordCode)(B, T) : (T.compile || T.validate) && (0, a.funcKeywordCode)(B, T);
   }
@@ -2177,17 +2177,17 @@ function hr() {
       this._compilations.add(u), (0, a.validateFunctionCode)(q), _.optimize(this.opts.code.optimize);
       const I = _.toString();
       U = `${_.scopeRefs(r.default.scope)}return ${I}`, this.opts.code.process && (U = this.opts.code.process(U, u));
-      const L = new Function(`${r.default.self}`, `${r.default.scope}`, U)(this, this.scope.get());
-      if (this.scope.value(N, { ref: L }), L.errors = null, L.schema = u.schema, L.schemaEnv = u, u.$async && (L.$async = !0), this.opts.code.source === !0 && (L.source = { validateName: N, validateCode: I, scopeValues: _._values }), this.opts.unevaluated) {
+      const F = new Function(`${r.default.self}`, `${r.default.scope}`, U)(this, this.scope.get());
+      if (this.scope.value(N, { ref: F }), F.errors = null, F.schema = u.schema, F.schemaEnv = u, u.$async && (F.$async = !0), this.opts.code.source === !0 && (F.source = { validateName: N, validateCode: I, scopeValues: _._values }), this.opts.unevaluated) {
         const { props: W, items: ee } = q;
-        L.evaluated = {
+        F.evaluated = {
           props: W instanceof e.Name ? void 0 : W,
           items: ee instanceof e.Name ? void 0 : ee,
           dynamicProps: W instanceof e.Name,
           dynamicItems: ee instanceof e.Name
-        }, L.source && (L.source.evaluated = (0, e.stringify)(L.evaluated));
+        }, F.source && (F.source.evaluated = (0, e.stringify)(F.evaluated));
       }
-      return u.validate = L, u;
+      return u.validate = F, u;
     } catch (I) {
       throw delete u.validate, delete u.validateName, U && this.logger.error("Error compiling schema, function code:", U), I;
     } finally {
@@ -2279,9 +2279,9 @@ function hr() {
   }
   return $e;
 }
-const Fi = "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#", Li = "Meta-schema for $data reference (JSON AnySchema extension proposal)", Ui = "object", Ki = ["$data"], Wi = { $data: { type: "string", anyOf: [{ format: "relative-json-pointer" }, { format: "json-pointer" }] } }, Bi = !1, Ji = {
-  $id: Fi,
-  description: Li,
+const Li = "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#", Fi = "Meta-schema for $data reference (JSON AnySchema extension proposal)", Ui = "object", Ki = ["$data"], Wi = { $data: { type: "string", anyOf: [{ format: "relative-json-pointer" }, { format: "json-pointer" }] } }, Bi = !1, Ji = {
+  $id: Li,
+  description: Fi,
   type: Ui,
   required: Ki,
   properties: Wi,
@@ -2709,11 +2709,11 @@ function Jr() {
       unicode: '"minLength"/"maxLength" account for unicode characters by default.'
     }, o = 200;
     function d(M) {
-      var O, C, k, $, j, R, F, D, X, G, E, A, T, z, B, x, ue, we, ge, ve, le, Ve, _e, gr, vr;
+      var O, C, k, $, j, R, L, D, X, G, E, A, T, z, B, x, ue, we, ge, ve, le, Ve, _e, gr, vr;
       const Ge = M.strict, $r = (O = M.code) === null || O === void 0 ? void 0 : O.optimize, nn = $r === !0 || $r === void 0 ? 1 : $r || 0, an = (k = (C = M.code) === null || C === void 0 ? void 0 : C.regExp) !== null && k !== void 0 ? k : w, Hs = ($ = M.uriResolver) !== null && $ !== void 0 ? $ : g.default;
       return {
         strictSchema: (R = (j = M.strictSchema) !== null && j !== void 0 ? j : Ge) !== null && R !== void 0 ? R : !0,
-        strictNumbers: (D = (F = M.strictNumbers) !== null && F !== void 0 ? F : Ge) !== null && D !== void 0 ? D : !0,
+        strictNumbers: (D = (L = M.strictNumbers) !== null && L !== void 0 ? L : Ge) !== null && D !== void 0 ? D : !0,
         strictTypes: (G = (X = M.strictTypes) !== null && X !== void 0 ? X : Ge) !== null && G !== void 0 ? G : "log",
         strictTuples: (A = (E = M.strictTuples) !== null && E !== void 0 ? E : Ge) !== null && A !== void 0 ? A : "log",
         strictRequired: (z = (T = M.strictRequired) !== null && T !== void 0 ? T : Ge) !== null && z !== void 0 ? z : !1,
@@ -2785,10 +2785,10 @@ function Jr() {
           } catch (E) {
             if (!(E instanceof s.default))
               throw E;
-            return F.call(this, E), await D.call(this, E.missingSchema), R.call(this, G);
+            return L.call(this, E), await D.call(this, E.missingSchema), R.call(this, G);
           }
         }
-        function F({ missingSchema: G, missingRef: E }) {
+        function L({ missingSchema: G, missingRef: E }) {
           if (this.refs[G])
             throw new Error(`AnySchema ${G} is loaded but ${E} cannot be resolved`);
         }
@@ -2936,14 +2936,14 @@ function Jr() {
         for (const $ of C) {
           const j = $.split("/").slice(1);
           let R = O;
-          for (const F of j)
-            R = R[F];
-          for (const F in k) {
-            const D = k[F];
+          for (const L of j)
+            R = R[L];
+          for (const L in k) {
+            const D = k[L];
             if (typeof D != "object")
               continue;
-            const { $data: X } = D.definition, G = R[F];
-            X && G && (R[F] = ce(G));
+            const { $data: X } = D.definition, G = R[L];
+            X && G && (R[L] = ce(G));
           }
         }
         return O;
@@ -2956,9 +2956,9 @@ function Jr() {
       }
       _addSchema(O, C, k, $ = this.opts.validateSchema, j = this.opts.addUsedSchema) {
         let R;
-        const { schemaId: F } = this.opts;
+        const { schemaId: L } = this.opts;
         if (typeof O == "object")
-          R = O[F];
+          R = O[L];
         else {
           if (this.opts.jtd)
             throw new Error("schema must be object");
@@ -2970,7 +2970,7 @@ function Jr() {
           return D;
         k = (0, l.normalizeId)(R || k);
         const X = l.getSchemaRefs.call(this, O, k);
-        return D = new i.SchemaEnv({ schema: O, schemaId: F, meta: C, baseId: k, localRefs: X }), this._cache.set(D.schema, D), j && !k.startsWith("#") && (k && this._checkUnique(k), this.refs[k] = D), $ && this.validateSchema(O, !0), D;
+        return D = new i.SchemaEnv({ schema: O, schemaId: L, meta: C, baseId: k, localRefs: X }), this._cache.set(D.schema, D), j && !k.startsWith("#") && (k && this._checkUnique(k), this.refs[k] = D), $ && this.validateSchema(O, !0), D;
       }
       _checkUnique(O) {
         if (this.schemas[O] || this.refs[O])
@@ -3046,13 +3046,13 @@ function Jr() {
         return M;
       throw new Error("logger must implement log, warn and error methods");
     }
-    const L = /^[a-z_$][a-z0-9_$:-]*$/i;
+    const F = /^[a-z_$][a-z0-9_$:-]*$/i;
     function W(M, O) {
       const { RULES: C } = this;
       if ((0, m.eachItem)(M, (k) => {
         if (C.keywords[k])
           throw new Error(`Keyword ${k} is already defined`);
-        if (!L.test(k))
+        if (!F.test(k))
           throw new Error(`Keyword ${k} has invalid name`);
       }), !!O && O.$data && !("code" in O || "validate" in O))
         throw new Error('$data keyword must have "code" or "validate" function');
@@ -3066,7 +3066,7 @@ function Jr() {
       let R = $ ? j.post : j.rules.find(({ type: D }) => D === C);
       if (R || (R = { type: C, rules: [] }, j.rules.push(R)), j.keywords[M] = !0, !O)
         return;
-      const F = {
+      const L = {
         keyword: M,
         definition: {
           ...O,
@@ -3074,7 +3074,7 @@ function Jr() {
           schemaType: (0, p.getJSONTypes)(O.schemaType)
         }
       };
-      O.before ? re.call(this, R, F, O.before) : R.rules.push(F), j.all[M] = F, (k = O.implements) === null || k === void 0 || k.forEach((D) => this.addKeyword(D));
+      O.before ? re.call(this, R, L, O.before) : R.rules.push(L), j.all[M] = L, (k = O.implements) === null || k === void 0 || k.forEach((D) => this.addKeyword(D));
     }
     function re(M, O, C) {
       const k = M.rules.findIndex(($) => $.keyword === C);
@@ -3232,10 +3232,10 @@ function Qi() {
   };
   return ht.default = s, ht;
 }
-var yt = {}, Fn;
+var yt = {}, Ln;
 function eo() {
-  if (Fn) return yt;
-  Fn = 1, Object.defineProperty(yt, "__esModule", { value: !0 });
+  if (Ln) return yt;
+  Ln = 1, Object.defineProperty(yt, "__esModule", { value: !0 });
   const e = H(), r = {
     keyword: "multipleOf",
     type: "number",
@@ -3252,10 +3252,10 @@ function eo() {
   };
   return yt.default = r, yt;
 }
-var gt = {}, vt = {}, Ln;
+var gt = {}, vt = {}, Fn;
 function to() {
-  if (Ln) return vt;
-  Ln = 1, Object.defineProperty(vt, "__esModule", { value: !0 });
+  if (Fn) return vt;
+  Fn = 1, Object.defineProperty(vt, "__esModule", { value: !0 });
   function e(t) {
     const r = t.length;
     let n = 0, s = 0, a;
@@ -3545,10 +3545,10 @@ function hs() {
   ];
   return pt.default = m, pt;
 }
-var Ot = {}, Fe = {}, Yn;
+var Ot = {}, Le = {}, Yn;
 function ys() {
-  if (Yn) return Fe;
-  Yn = 1, Object.defineProperty(Fe, "__esModule", { value: !0 }), Fe.validateAdditionalItems = void 0;
+  if (Yn) return Le;
+  Yn = 1, Object.defineProperty(Le, "__esModule", { value: !0 }), Le.validateAdditionalItems = void 0;
   const e = H(), t = Q(), n = {
     keyword: "additionalItems",
     type: "array",
@@ -3583,12 +3583,12 @@ function ys() {
       });
     }
   }
-  return Fe.validateAdditionalItems = s, Fe.default = n, Fe;
+  return Le.validateAdditionalItems = s, Le.default = n, Le;
 }
-var Rt = {}, Le = {}, Qn;
+var Rt = {}, Fe = {}, Qn;
 function gs() {
-  if (Qn) return Le;
-  Qn = 1, Object.defineProperty(Le, "__esModule", { value: !0 }), Le.validateTuple = void 0;
+  if (Qn) return Fe;
+  Qn = 1, Object.defineProperty(Fe, "__esModule", { value: !0 }), Fe.validateTuple = void 0;
   const e = H(), t = Q(), r = je(), n = {
     keyword: "items",
     type: "array",
@@ -3620,7 +3620,7 @@ function gs() {
       }
     }
   }
-  return Le.validateTuple = s, Le.default = n, Le;
+  return Fe.validateTuple = s, Fe.default = n, Fe;
 }
 var ea;
 function lo() {
@@ -4108,10 +4108,10 @@ function _o() {
   }
   return zt.default = n, zt;
 }
-var Ft = {}, ma;
+var Lt = {}, ma;
 function wo() {
-  if (ma) return Ft;
-  ma = 1, Object.defineProperty(Ft, "__esModule", { value: !0 });
+  if (ma) return Lt;
+  ma = 1, Object.defineProperty(Lt, "__esModule", { value: !0 });
   const e = Q(), t = {
     keyword: ["then", "else"],
     schemaType: ["object", "boolean"],
@@ -4119,7 +4119,7 @@ function wo() {
       n.if === void 0 && (0, e.checkStrictMode)(s, `"${r}" without "if" is ignored`);
     }
   };
-  return Ft.default = t, Ft;
+  return Lt.default = t, Lt;
 }
 var pa;
 function $s() {
@@ -4146,7 +4146,7 @@ function $s() {
   }
   return Ot.default = u, Ot;
 }
-var Lt = {}, Ut = {}, ha;
+var Ft = {}, Ut = {}, ha;
 function So() {
   if (ha) return Ut;
   ha = 1, Object.defineProperty(Ut, "__esModule", { value: !0 });
@@ -4217,10 +4217,10 @@ function So() {
 }
 var ya;
 function bs() {
-  if (ya) return Lt;
-  ya = 1, Object.defineProperty(Lt, "__esModule", { value: !0 });
+  if (ya) return Ft;
+  ya = 1, Object.defineProperty(Ft, "__esModule", { value: !0 });
   const t = [So().default];
-  return Lt.default = t, Lt;
+  return Ft.default = t, Ft;
 }
 var Me = {}, ga;
 function _s() {
@@ -4308,10 +4308,10 @@ function Zr() {
             if (V = r.resolveRef.call(g.self, g.schemaEnv.root, g.baseId, W), V instanceof r.SchemaEnv && (V = V.schema), V === void 0)
               throw new n.default(g.opts.uriResolver, g.baseId, W);
           }
-          const L = (y = V?.properties) === null || y === void 0 ? void 0 : y[S];
-          if (typeof L != "object")
+          const F = (y = V?.properties) === null || y === void 0 ? void 0 : y[S];
+          if (typeof F != "object")
             throw new Error(`discriminator: oneOf subschemas (or referenced schemas) must have "properties/${S}"`);
-          P = P && (_ || N(V)), q(L, I);
+          P = P && (_ || N(V)), q(F, I);
         }
         if (!P)
           throw new Error(`discriminator: "${S}" must be required`);
@@ -4323,8 +4323,8 @@ function Zr() {
           if (I.const)
             U(I.const, V);
           else if (I.enum)
-            for (const L of I.enum)
-              U(L, V);
+            for (const F of I.enum)
+              U(F, V);
           else
             throw new Error(`discriminator: "properties/${S}" must have "const" or "enum"`);
         }
@@ -4618,9 +4618,9 @@ function As() {
   return Yt.default = r, Yt;
 }
 var tr = {};
-const Fo = "https://json-schema.org/draft/2019-09/schema", Lo = "https://json-schema.org/draft/2019-09/schema", Uo = { "https://json-schema.org/draft/2019-09/vocab/core": !0, "https://json-schema.org/draft/2019-09/vocab/applicator": !0, "https://json-schema.org/draft/2019-09/vocab/validation": !0, "https://json-schema.org/draft/2019-09/vocab/meta-data": !0, "https://json-schema.org/draft/2019-09/vocab/format": !1, "https://json-schema.org/draft/2019-09/vocab/content": !0 }, Ko = !0, Wo = "Core and Validation specifications meta-schema", Bo = [{ $ref: "meta/core" }, { $ref: "meta/applicator" }, { $ref: "meta/validation" }, { $ref: "meta/meta-data" }, { $ref: "meta/format" }, { $ref: "meta/content" }], Jo = ["object", "boolean"], Ho = { definitions: { $comment: "While no longer an official keyword as it is replaced by $defs, this keyword is retained in the meta-schema to prevent incompatible extensions as it remains in common use.", type: "object", additionalProperties: { $recursiveRef: "#" }, default: {} }, dependencies: { $comment: '"dependencies" is no longer a keyword, but schema authors should avoid redefining it to facilitate a smooth transition to "dependentSchemas" and "dependentRequired"', type: "object", additionalProperties: { anyOf: [{ $recursiveRef: "#" }, { $ref: "meta/validation#/$defs/stringArray" }] } } }, Go = {
-  $schema: Fo,
-  $id: Lo,
+const Lo = "https://json-schema.org/draft/2019-09/schema", Fo = "https://json-schema.org/draft/2019-09/schema", Uo = { "https://json-schema.org/draft/2019-09/vocab/core": !0, "https://json-schema.org/draft/2019-09/vocab/applicator": !0, "https://json-schema.org/draft/2019-09/vocab/validation": !0, "https://json-schema.org/draft/2019-09/vocab/meta-data": !0, "https://json-schema.org/draft/2019-09/vocab/format": !1, "https://json-schema.org/draft/2019-09/vocab/content": !0 }, Ko = !0, Wo = "Core and Validation specifications meta-schema", Bo = [{ $ref: "meta/core" }, { $ref: "meta/applicator" }, { $ref: "meta/validation" }, { $ref: "meta/meta-data" }, { $ref: "meta/format" }, { $ref: "meta/content" }], Jo = ["object", "boolean"], Ho = { definitions: { $comment: "While no longer an official keyword as it is replaced by $defs, this keyword is retained in the meta-schema to prevent incompatible extensions as it remains in common use.", type: "object", additionalProperties: { $recursiveRef: "#" }, default: {} }, dependencies: { $comment: '"dependencies" is no longer a keyword, but schema authors should avoid redefining it to facilitate a smooth transition to "dependentSchemas" and "dependentRequired"', type: "object", additionalProperties: { anyOf: [{ $recursiveRef: "#" }, { $ref: "meta/validation#/$defs/stringArray" }] } } }, Go = {
+  $schema: Lo,
+  $id: Fo,
   $vocabulary: Uo,
   $recursiveAnchor: Ko,
   title: Wo,
@@ -4668,13 +4668,13 @@ const Fo = "https://json-schema.org/draft/2019-09/schema", Lo = "https://json-sc
   title: Ic,
   type: Cc,
   properties: Tc
-}, Mc = "https://json-schema.org/draft/2019-09/schema", Dc = "https://json-schema.org/draft/2019-09/meta/validation", Vc = { "https://json-schema.org/draft/2019-09/vocab/validation": !0 }, zc = !0, Fc = "Validation vocabulary meta-schema", Lc = ["object", "boolean"], Uc = { multipleOf: { type: "number", exclusiveMinimum: 0 }, maximum: { type: "number" }, exclusiveMaximum: { type: "number" }, minimum: { type: "number" }, exclusiveMinimum: { type: "number" }, maxLength: { $ref: "#/$defs/nonNegativeInteger" }, minLength: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, pattern: { type: "string", format: "regex" }, maxItems: { $ref: "#/$defs/nonNegativeInteger" }, minItems: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, uniqueItems: { type: "boolean", default: !1 }, maxContains: { $ref: "#/$defs/nonNegativeInteger" }, minContains: { $ref: "#/$defs/nonNegativeInteger", default: 1 }, maxProperties: { $ref: "#/$defs/nonNegativeInteger" }, minProperties: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, required: { $ref: "#/$defs/stringArray" }, dependentRequired: { type: "object", additionalProperties: { $ref: "#/$defs/stringArray" } }, const: !0, enum: { type: "array", items: !0 }, type: { anyOf: [{ $ref: "#/$defs/simpleTypes" }, { type: "array", items: { $ref: "#/$defs/simpleTypes" }, minItems: 1, uniqueItems: !0 }] } }, Kc = { nonNegativeInteger: { type: "integer", minimum: 0 }, nonNegativeIntegerDefault0: { $ref: "#/$defs/nonNegativeInteger", default: 0 }, simpleTypes: { enum: ["array", "boolean", "integer", "null", "number", "object", "string"] }, stringArray: { type: "array", items: { type: "string" }, uniqueItems: !0, default: [] } }, Wc = {
+}, Mc = "https://json-schema.org/draft/2019-09/schema", Dc = "https://json-schema.org/draft/2019-09/meta/validation", Vc = { "https://json-schema.org/draft/2019-09/vocab/validation": !0 }, zc = !0, Lc = "Validation vocabulary meta-schema", Fc = ["object", "boolean"], Uc = { multipleOf: { type: "number", exclusiveMinimum: 0 }, maximum: { type: "number" }, exclusiveMaximum: { type: "number" }, minimum: { type: "number" }, exclusiveMinimum: { type: "number" }, maxLength: { $ref: "#/$defs/nonNegativeInteger" }, minLength: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, pattern: { type: "string", format: "regex" }, maxItems: { $ref: "#/$defs/nonNegativeInteger" }, minItems: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, uniqueItems: { type: "boolean", default: !1 }, maxContains: { $ref: "#/$defs/nonNegativeInteger" }, minContains: { $ref: "#/$defs/nonNegativeInteger", default: 1 }, maxProperties: { $ref: "#/$defs/nonNegativeInteger" }, minProperties: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, required: { $ref: "#/$defs/stringArray" }, dependentRequired: { type: "object", additionalProperties: { $ref: "#/$defs/stringArray" } }, const: !0, enum: { type: "array", items: !0 }, type: { anyOf: [{ $ref: "#/$defs/simpleTypes" }, { type: "array", items: { $ref: "#/$defs/simpleTypes" }, minItems: 1, uniqueItems: !0 }] } }, Kc = { nonNegativeInteger: { type: "integer", minimum: 0 }, nonNegativeIntegerDefault0: { $ref: "#/$defs/nonNegativeInteger", default: 0 }, simpleTypes: { enum: ["array", "boolean", "integer", "null", "number", "object", "string"] }, stringArray: { type: "array", items: { type: "string" }, uniqueItems: !0, default: [] } }, Wc = {
   $schema: Mc,
   $id: Dc,
   $vocabulary: Vc,
   $recursiveAnchor: zc,
-  title: Fc,
-  type: Lc,
+  title: Lc,
+  type: Fc,
   properties: Uc,
   $defs: Kc
 };
@@ -4818,9 +4818,9 @@ const Zc = "https://json-schema.org/draft/2020-12/schema", xc = "https://json-sc
   type: Mu,
   properties: Du,
   $defs: Vu
-}, Fu = "https://json-schema.org/draft/2020-12/schema", Lu = "https://json-schema.org/draft/2020-12/meta/format-annotation", Uu = { "https://json-schema.org/draft/2020-12/vocab/format-annotation": !0 }, Ku = "meta", Wu = "Format vocabulary meta-schema for annotation results", Bu = ["object", "boolean"], Ju = { format: { type: "string" } }, Hu = {
-  $schema: Fu,
-  $id: Lu,
+}, Lu = "https://json-schema.org/draft/2020-12/schema", Fu = "https://json-schema.org/draft/2020-12/meta/format-annotation", Uu = { "https://json-schema.org/draft/2020-12/vocab/format-annotation": !0 }, Ku = "meta", Wu = "Format vocabulary meta-schema for annotation results", Bu = ["object", "boolean"], Ju = { format: { type: "string" } }, Hu = {
+  $schema: Lu,
+  $id: Fu,
   $vocabulary: Uu,
   $dynamicAnchor: Ku,
   title: Wu,
@@ -4999,8 +4999,8 @@ function hl() {
       const V = n.exec(I);
       if (!V)
         return !1;
-      const L = +V[1], W = +V[2], ee = +V[3];
-      return W >= 1 && W <= 12 && ee >= 1 && ee <= (W === 2 && r(L) ? 29 : s[W]);
+      const F = +V[1], W = +V[2], ee = +V[3];
+      return W >= 1 && W <= 12 && ee >= 1 && ee <= (W === 2 && r(F) ? 29 : s[W]);
     }
     function i(I, V) {
       if (I && V)
@@ -5008,8 +5008,8 @@ function hl() {
     }
     const c = /^(\d\d):(\d\d):(\d\d(?:\.\d+)?)(z|([+-])(\d\d)(?::?(\d\d))?)?$/i;
     function l(I) {
-      return function(L) {
-        const W = c.exec(L);
+      return function(F) {
+        const W = c.exec(F);
         if (!W)
           return !1;
         const ee = +W[1], re = +W[2], ae = +W[3], Y = W[4], ce = W[5] === "-" ? -1 : 1, M = +(W[6] || 0), O = +(W[7] || 0);
@@ -5024,16 +5024,16 @@ function hl() {
     function p(I, V) {
       if (!(I && V))
         return;
-      const L = (/* @__PURE__ */ new Date("2020-01-01T" + I)).valueOf(), W = (/* @__PURE__ */ new Date("2020-01-01T" + V)).valueOf();
-      if (L && W)
-        return L - W;
+      const F = (/* @__PURE__ */ new Date("2020-01-01T" + I)).valueOf(), W = (/* @__PURE__ */ new Date("2020-01-01T" + V)).valueOf();
+      if (F && W)
+        return F - W;
     }
     function m(I, V) {
       if (!(I && V))
         return;
-      const L = c.exec(I), W = c.exec(V);
-      if (L && W)
-        return I = L[1] + L[2] + L[3], V = W[1] + W[2] + W[3], I > V ? 1 : I < V ? -1 : 0;
+      const F = c.exec(I), W = c.exec(V);
+      if (F && W)
+        return I = F[1] + F[2] + F[3], V = W[1] + W[2] + W[3], I > V ? 1 : I < V ? -1 : 0;
     }
     const b = /t|\s/i;
     function g(I) {
@@ -5046,14 +5046,14 @@ function hl() {
     function w(I, V) {
       if (!(I && V))
         return;
-      const L = new Date(I).valueOf(), W = new Date(V).valueOf();
-      if (L && W)
-        return L - W;
+      const F = new Date(I).valueOf(), W = new Date(V).valueOf();
+      if (F && W)
+        return F - W;
     }
     function S(I, V) {
       if (!(I && V))
         return;
-      const [L, W] = I.split(b), [ee, re] = V.split(b), ae = i(L, ee);
+      const [F, W] = I.split(b), [ee, re] = V.split(b), ae = i(F, ee);
       if (ae !== void 0)
         return ae || p(W, re);
     }
@@ -5087,9 +5087,9 @@ function hl() {
     }
   }(Cr)), Cr;
 }
-var Tr = {}, Fa;
+var Tr = {}, La;
 function yl() {
-  return Fa || (Fa = 1, function(e) {
+  return La || (La = 1, function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.formatLimitDefinition = void 0;
     const t = Ss(), r = H(), n = r.operators, s = {
       formatMaximum: { okStr: "<=", ok: n.LTE, fail: n.GT },
@@ -5142,9 +5142,9 @@ function yl() {
     e.default = i;
   }(Tr)), Tr;
 }
-var La;
+var Fa;
 function gl() {
-  return La || (La = 1, function(e, t) {
+  return Fa || (Fa = 1, function(e, t) {
     Object.defineProperty(t, "__esModule", { value: !0 });
     const r = hl(), n = yl(), s = H(), a = new s.Name("fullFormats"), i = new s.Name("fastFormats"), c = (p, m = { keywords: !0 }) => {
       if (Array.isArray(m))
@@ -5983,7 +5983,7 @@ function zl(e, t) {
     return { ok: !1 };
   }
 }
-function Fl(e) {
+function Ll(e) {
   switch (e) {
     case "null":
       return null;
@@ -5995,7 +5995,7 @@ function Fl(e) {
       return;
   }
 }
-function Ll(e) {
+function Fl(e) {
   if (typeof e == "boolean") return {};
   const t = e["x:ui"];
   if (t != null && typeof t == "object" && !Array.isArray(t)) {
@@ -6371,7 +6371,7 @@ function zr({
     controller: t
   });
 }
-function Fr({
+function Lr({
   ctx: e,
   controller: t
 }) {
@@ -6476,7 +6476,7 @@ function zs(e, t) {
   }
   return n.set(t, i), i;
 }
-function Fs(e, t, r) {
+function Ls(e, t, r) {
   let n = e;
   const s = /* @__PURE__ */ new Set(), a = (i, c) => {
     const { $ref: l, ...p } = c;
@@ -6618,7 +6618,7 @@ function ie(e, t, r) {
     i
   );
 }
-function Ls(e) {
+function Fs(e) {
   if (typeof e == "boolean") return;
   const t = e["x:ui"];
   if (!t || !t.visibleIf) return;
@@ -6681,7 +6681,7 @@ function Zl(e, t) {
   }
   return n;
 }
-function Lr(e, t) {
+function Fr(e, t) {
   const r = Zl(t, e.field);
   switch (e.operator) {
     case "equals":
@@ -6713,7 +6713,7 @@ function Lr(e, t) {
   }
 }
 function Us(e, t) {
-  const r = e.conditions.map((n) => "operator" in n && ["and", "or", "not"].includes(n.operator) ? Us(n, t) : Lr(n, t));
+  const r = e.conditions.map((n) => "operator" in n && ["and", "or", "not"].includes(n.operator) ? Us(n, t) : Fr(n, t));
   switch (e.operator) {
     case "and":
       return r.every(Boolean);
@@ -6729,9 +6729,9 @@ function xl(e, t) {
   try {
     if (typeof e == "string") {
       const r = Xl(e);
-      return Lr(r, t);
+      return Fr(r, t);
     }
-    return "operator" in e && ["and", "or", "not"].includes(e.operator) ? Us(e, t) : Lr(e, t);
+    return "operator" in e && ["and", "or", "not"].includes(e.operator) ? Us(e, t) : Fr(e, t);
   } catch (r) {
     return console.warn("Error evaluating visibility condition:", r), !0;
   }
@@ -6751,7 +6751,7 @@ function Ql({
   children: r,
   options: n = Xa
 }) {
-  const s = Ls(e.definition);
+  const s = Fs(e.definition);
   if (!s)
     return r;
   const a = { ...Xa, ...n }, i = ed(t), c = Yl(s, i);
@@ -7329,7 +7329,14 @@ function Ks({
     ), l = e.with({
       definition: i,
       schemaConflicts: [...e.schemaConflicts, ...c]
-    }), p = i.properties ?? {}, m = new Set(Object.keys(p)), b = Object.keys(s ?? {}), g = b.filter((R) => !m.has(R)), w = i.unevaluatedProperties, S = Qe(
+    }), p = i.properties ?? {};
+    console.log(
+      "[OBJECT_CONTROL_DEBUG] ctx.path:",
+      e.path,
+      "effective.properties keys:",
+      Object.keys(i.properties ?? {})
+    );
+    const m = new Set(Object.keys(p)), b = Object.keys(s ?? {}), g = b.filter((R) => !m.has(R)), w = i.unevaluatedProperties, S = Qe(
       i,
       s ?? {},
       e.ajv
@@ -7344,22 +7351,22 @@ function Ks({
       } catch {
         return null;
       }
-    }).filter((R) => R != null), V = i.propertyNames, L = (R) => {
-      const F = (R ?? "").trim();
-      if (F === "") return { ok: !1, message: "Key cannot be empty" };
+    }).filter((R) => R != null), V = i.propertyNames, F = (R) => {
+      const L = (R ?? "").trim();
+      if (L === "") return { ok: !1, message: "Key cannot be empty" };
       if (V === !1)
         return { ok: !1, message: "No property names are allowed by schema" };
       if (V && typeof V == "object" && e.ajv)
         try {
           const D = e.ajv.compile(V);
-          if (!D(F))
+          if (!D(L))
             return { ok: !1, message: D.errors?.[0]?.message ?? "Invalid property name" };
         } catch {
         }
-      if (!o && !m.has(F)) {
+      if (!o && !m.has(L)) {
         if (I.length === 0)
           return { ok: !1, message: "Only declared properties are allowed" };
-        if (!I.some((X) => X.test(F)))
+        if (!I.some((X) => X.test(L)))
           return {
             ok: !1,
             message: `Key must match one of: ${Object.keys(U).join(", ")}`
@@ -7367,19 +7374,19 @@ function Ks({
       }
       return { ok: !0 };
     }, W = i["x:ui"], ee = !!(W && typeof W == "object" && W.lockKeyAfterSet), re = (R) => {
-      const F = rt(R, (X) => X);
-      if (F !== void 0) return F;
+      const L = rt(R, (X) => X);
+      if (L !== void 0) return L;
       const D = R.type;
       if (D === "string") return "";
       if (D === "number" || D === "integer") return 0;
       if (D === "boolean") return !1;
       if (D === "array") return [];
       if (D === "object") return {};
-    }, ae = (R, F) => {
-      const D = R, X = (E) => F.has(E) ? !1 : L(E).ok;
+    }, ae = (R, L) => {
+      const D = R, X = (E) => L.has(E) ? !1 : F(E).ok;
       if (X(D)) return D;
       let G = 1;
-      for (; F.has(D + G) || !X(D + G); ) G++;
+      for (; L.has(D + G) || !X(D + G); ) G++;
       return D + G;
     }, Y = Wr(
       Br,
@@ -7389,10 +7396,10 @@ function Ks({
           disabled: !N,
           onClick: () => {
             if (!N) return;
-            const F = new Set(
+            const L = new Set(
               Object.keys(se.get(t.signal) ?? {})
-            ), D = ae("property", F);
-            if (!L(D).ok) return;
+            ), D = ae("property", L);
+            if (!F(D).ok) return;
             let G = d;
             w && typeof w == "object" && (G = w);
             const E = re(G), A = {
@@ -7407,17 +7414,24 @@ function Ks({
       )
     ), ce = sd(l), M = Ti(p).filter(
       ([, R]) => R !== !1
-    ), C = [
+    );
+    console.log(
+      "[OBJECT_CONTROL_DEBUG] knownProps keys:",
+      Object.keys(p),
+      "filtered entries:",
+      M.map(([R]) => R)
+    );
+    const C = [
       ...M.map(([R]) => R),
       ...u,
       ...h
     ], k = [
       // Known properties
-      ...M.map(([R, F]) => {
+      ...M.map(([R, L]) => {
         const D = R, X = t.field(D);
         return De({
           ctx: l.with({
-            definition: F,
+            definition: L,
             isPropertyRequired: Array.isArray(i.required) ? i.required.includes(D) : l.hasRequiredProperty(D),
             // Ensure child fields show their own labels even when this object
             // is rendered inside a union/combinator where labels are suppressed
@@ -7428,21 +7442,21 @@ function Ks({
       }),
       // Evaluated additional keys (pattern-matched and truly additional)
       ...u.map((R) => {
-        const F = I.some((D) => D.test(R));
-        return nd(R, F, {
+        const L = I.some((D) => D.test(R));
+        return nd(R, L, {
           controller: t,
           effCtx: l,
           patternProps: U,
           apSchema: d,
           canRemove: q,
           lockKeyAfterSet: ee,
-          validatePropertyName: L
+          validatePropertyName: F
         });
       }),
       // Unevaluated keys (use unevaluatedProperties schema if available)
       ...h.map((R) => {
-        const F = I.some((D) => D.test(R));
-        return ad(R, F, {
+        const L = I.some((D) => D.test(R));
+        return ad(R, L, {
           controller: t,
           effCtx: l,
           patternProps: U,
@@ -7450,7 +7464,7 @@ function Ks({
           unevaluatedProps: w,
           canRemove: q,
           lockKeyAfterSet: ee,
-          validatePropertyName: L
+          validatePropertyName: F
         });
       }),
       // Add affordance
@@ -7666,7 +7680,7 @@ function ff({
   });
   if (n)
     return n;
-  const a = e.definition.allOf.filter((p) => typeof p == "object").map((p) => Fs(p, e.schema, e.ajv)), { mergedSchema: i, conflicts: c } = Qr(a, e.path), l = e.with({
+  const a = e.definition.allOf.filter((p) => typeof p == "object").map((p) => Ls(p, e.schema, e.ajv)), { mergedSchema: i, conflicts: c } = Qr(a, e.path), l = e.with({
     definition: i,
     schemaConflicts: [...e.schemaConflicts, ...c]
   });
@@ -7742,7 +7756,7 @@ function De({
     );
     if (i.length > 0) {
       const c = i.map(
-        (g) => Fs(g, e.schema, e.ajv)
+        (g) => Ls(g, e.schema, e.ajv)
       ), { mergedSchema: l, conflicts: p } = Qr(c, e.path), { allOf: m, ...b } = n;
       n = { ...b, ...l }, s = e.with({
         definition: n,
@@ -7868,7 +7882,7 @@ function De({
         case "boolean":
           return ie(
             s,
-            Fr({
+            Lr({
               ctx: s,
               controller: t
             }),
@@ -7934,7 +7948,7 @@ function De({
         t,
         ie(
           s,
-          Fr({
+          Lr({
             ctx: s,
             controller: t
           }),
@@ -8016,7 +8030,7 @@ function wd({
   return e === !0 ? lr({ ctx: s, controller: t }) : e === !1 ? ke() : De({ ctx: s, controller: t });
 }
 function he(e, t, r) {
-  return Ls(e.definition) ? Ql({
+  return Fs(e.definition) ? Ql({
     ctx: e,
     controller: t,
     children: r,
@@ -8207,7 +8221,7 @@ function Pd(e) {
     label: Kr(t),
     detect: (r) => Vl(r, [t]) === t,
     convert: (r) => zl(r, t),
-    defaultValue: () => Fl(t)
+    defaultValue: () => Ll(t)
   }));
 }
 function Js({
@@ -8223,7 +8237,7 @@ function Js({
     return n;
   const s = e.definition;
   let a = s.type ?? [];
-  const i = Ll(s), c = a.includes("null"), l = a.filter(
+  const i = Fl(s), c = a.includes("null"), l = a.filter(
     (h) => h !== "null" && (h === "string" || h === "number" || h === "integer" || h === "boolean")
   ), p = c && l.length === a.length - 1;
   p && (a = l);
@@ -8280,7 +8294,7 @@ function Js({
           controller: f
         });
       case "boolean":
-        return Fr({
+        return Lr({
           ctx: o,
           controller: f
         });
@@ -8721,10 +8735,10 @@ function Dd(e) {
     case "array":
       return zd(e);
     case "string":
-      return Fd(e);
+      return Ld(e);
     case "number":
     case "integer":
-      return Ld(e);
+      return Fd(e);
     case "boolean":
       return !1;
     case "null":
@@ -8758,7 +8772,7 @@ function zd(e) {
   const n = Be(r);
   return Array(t).fill(n ?? null);
 }
-function Fd(e) {
+function Ld(e) {
   switch (e.format) {
     case "date":
       return Wd();
@@ -8770,7 +8784,7 @@ function Fd(e) {
       return "";
   }
 }
-function Ld(e) {
+function Fd(e) {
   const t = e.type === "integer";
   let r = e.minimum, n = e.maximum;
   if (e.exclusiveMinimum !== void 0) {
@@ -8891,10 +8905,10 @@ function mf({
           for (const ae of f)
             o.validateField(ae, re, re);
         }) : () => {
-        }, L = () => {
+        }, F = () => {
           U(), I(), V(), o?.dispose(), v.dispose();
         }, W = c ? Gd(c) : void 0, ee = ke(
-          Ai(L),
+          Ai(F),
           wd({
             schema: e,
             controller: v,
@@ -8955,7 +8969,7 @@ export {
   lr as JSONSchemaAny,
   bd as JSONSchemaAnyOf,
   Bs as JSONSchemaArray,
-  Fr as JSONSchemaBoolean,
+  Lr as JSONSchemaBoolean,
   rd as JSONSchemaConst,
   wd as JSONSchemaControl,
   td as JSONSchemaEnum,
@@ -8978,12 +8992,13 @@ export {
   Yr as compileWithCache,
   Dl as composeEffectiveObjectSchema,
   pf as createAJVStandardSchema,
+  gf as createDiagnosticWidget,
   Is as evaluateIfThenElseOverlay,
   Ml as evaluateNotViolation,
   Be as extractSchemaDefaults,
-  gf as forFormat,
-  vf as forTypeAndFormat,
-  $f as forXUI,
+  vf as forFormat,
+  $f as forTypeAndFormat,
+  bf as forXUI,
   Ol as getAjvForSchema,
   df as getCacheStats,
   Qe as getEvaluatedProperties,