@json-schema-engine/core 0.0.1

package/dist/keywords/validation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validation.js","sourceRoot":"","sources":["../../src/keywords/validation.ts"],"names":[],"mappings":"AAAA,uEAAuE;AACvE,iBAAiB;AAEjB,OAAO,EAGL,QAAQ,EACR,UAAU,EACV,SAAS,EACT,eAAe,EACf,kBAAkB,GACnB,MAAM,YAAY,CAAC;AAEpB,OAAO,EAIL,OAAO,GACR,MAAM,gBAAgB,CAAC;AAGxB,yCAAyC;AACzC,MAAM,CAAC,MAAM,gBAAgB,GAC3B,wDAAwD,CAAC;AAE3D,MAAM,EAAE,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,GAAG,gBAAgB,IAAI,IAAI,EAAE,CAAC;AAEnE,MAAM,SAAS,GAAG,CAChB,IAAY,EACZ,IAAwD,EACxD,OAAqC,EACrC,MAA0C,EACzB,EAAE,CAAC,CAAC;IACrB,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC;IACZ,QAAQ,EAAE,CAAC,KAAgB,EAAE,MAAc,EAAE,GAAmB,EAAE,EAAE;QAClE,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3C,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,OAAO,KAAK,CAAC;IACf,CAAC;CACF,CAAC,CAAC;AAEH;;;;;;;;GAQG;AACH,MAAM,cAAc,GAClB,CACE,SAAmB,EACnB,OAA6C,EAC7C,EAA2B,EAC3B,OAAqC,EACrC,EAAE,CACJ,CAAC,KAAgB,EAAE,IAAqB,EAAQ,EAAE;IAChD,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,EACxC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CACrE,EACD,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CACvE,CACF,CAAC;AACJ,CAAC,CAAC;AACJ;;;;GAIG;AACH,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAe,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAC1E,MAAM,kBAAkB,GAAG,CAAC,IAAqB,EAAa,EAAE,CAC9D,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC5C,MAAM,oBAAoB,GAAG,CAAC,IAAqB,EAAa,EAAE,CAChE,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AACtE,MAAM,aAAa,GAAG,CAAC,IAAqB,EAAa,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;AAE1E,MAAM,WAAW,GAAG,CAAC,CAAY,EAAE,CAAY,EAAW,EAAE,CAC1D,CAAC,KAAK,SAAS;IACb,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAE1B;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,OAAO,GAAoB;IACtC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC;IACjB,OAAO,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACnB,OAAO,EAAE,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;KAClD,CAAC;IACF,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE;QAC/B,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC;QAC9B,IAAI,OAAO,QAAQ,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QAC9C,IAAI,GAAG,CAAC,YAAY,CAAC,KAAe,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QAClE,GAAG,CAAC,KAAK,CAAC,iCAAiC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QACjE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;QACrB,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,EACvC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,KAAe,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAC/D,EACD;YACE,OAAO,CAAC,QAAQ,CACd,EAAE,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EACpC,iCAAiC,CAClC;SACF,CACF,CACF,CAAC;IACJ,CAAC;CACF,CAAC;AAEF,6EAA6E;AAC7E,2EAA2E;AAC3E,4EAA4E;AAC5E,0EAA0E;AAC1E,qBAAqB;AACrB,SAAS,aAAa,CAAC,CAAS;IAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACjC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,cAAc,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,GAAG,QAAQ,CAAC,CAAC;IAChD,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3B,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,OAAe;IAC5D,MAAM,KAAK,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,QAAQ,CAAC,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IAC9E,MAAM,cAAc,GAAG,QAAQ,GAAG,KAAK,CAAC;IACxC,MAAM,aAAa,GAAG,OAAO,GAAG,KAAK,CAAC;IACtC,mEAAmE;IACnE,yEAAyE;IACzE,iCAAiC;IACjC,IAAI,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QACtE,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,QAAQ,GAAG,QAAQ,GAAG,OAAO,CAAC;IACpC,OAAO,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;AACjE,CAAC;AAED,sEAAsE;AACtE,MAAM,CAAC,MAAM,oBAAoB,GAAoC;IACnE,IAAI,EAAE;QACJ,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC;QACd,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE;YAC/B,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAC7B,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBACjD,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,CAAC,EAAE;gBACL,GAAG,CAAC,KAAK,CAAC,iBAAiB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE;oBAClD,QAAQ,EAAE,KAAK;iBAChB,CAAC,CAAC;YACL,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAElD,CAAC;YACJ,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,CAAC,EAAE;gBACjE,OAAO,CAAC,QAAQ,CACd,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EACrC,iBAAiB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CACzC;aACF,CAAC,CACH,CAAC;QACJ,CAAC;KACF;IACD,IAAI,EAAE;QACJ,GAAG,SAAS,CACV,MAAM,EACN,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CACjB,KAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAC5D,GAAG,EAAE,CAAC,+BAA+B,EACrC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CACtC;QACD,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,MAAM,YAAY,GAAG,KAAoB,CAAC;YAC1C,MAAM,MAAM,GAAgB,EAAE,aAAa,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACvE,kEAAkE;YAClE,qEAAqE;YACrE,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CACP,YAAY,CAAC,MAAM,KAAK,CAAC;gBACvB,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,+BAA+B,CAAC;gBAC3D,CAAC,CAAC,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,EAAE,CACR,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACxB,OAAO,CAAC,MAAM,CACZ,WAAW,EACX,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EACnB,IAAI,CAAC,QAAQ,CACd,CACF,CACF,CACF,EACD,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,+BAA+B,CAAC,CAAC,CAC5D,CACN,CAAC;QACJ,CAAC;KACF;IACD,KAAK,EAAE;QACL,GAAG,SAAS,CACV,OAAO,EACP,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,EAC/C,GAAG,EAAE,CAAC,sCAAsC,EAC5C,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,CACrC;QACD,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CACpE,EACD;gBACE,OAAO,CAAC,QAAQ,CACd,EAAE,YAAY,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EACzC,sCAAsC,CACvC;aACF,CACF,CACF,CAAC;QACJ,CAAC;KACF;IACD,OAAO;IACP,SAAS,EAAE;QACT,GAAG,SAAS,CACV,WAAW,EACX,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,OAAO,QAAQ,KAAK,QAAQ;YAC5B,eAAe,CAAC,QAAQ,CAAC,IAAK,KAAgB,EAChD,CAAC,KAAK,EAAE,EAAE,CAAC,oBAAoB,KAAe,aAAa,EAC3D,WAAW,CACZ;QACD,oEAAoE;QACpE,yEAAyE;QACzE,mEAAmE;QACnE,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,KAAe,CAAC;YAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7D,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,EACvC,OAAO,CAAC,EAAE,CACR,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAC1C,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAC9C,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAC3C,CACF,CACF,EACD;gBACE,OAAO,CAAC,QAAQ,CACd,EAAE,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAC9B,oBAAoB,CAAC,aAAa,CACnC;aACF,CACF,CACF,CAAC;QACJ,CAAC;KACF;IACD,SAAS,EAAE;QACT,GAAG,SAAS,CACV,WAAW,EACX,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,OAAO,QAAQ,KAAK,QAAQ;YAC5B,eAAe,CAAC,QAAQ,CAAC,IAAK,KAAgB,EAChD,CAAC,KAAK,EAAE,EAAE,CAAC,mBAAmB,KAAe,aAAa,EAC1D,WAAW,CACZ;QACD,sEAAsE;QACtE,8DAA8D;QAC9D,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,MAAM,CAAC,GAAG,KAAe,CAAC;YAC1B,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,EACvC,OAAO,CAAC,GAAG,CACT,GAAG,EACH,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,EACzC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CACpB,EACD,OAAO,CAAC,GAAG,CACT,GAAG,EACH,OAAO,CAAC,MAAM,CAAC,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,EAChD,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CACpB,CACF,EACD;gBACE,OAAO,CAAC,QAAQ,CACd,EAAE,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAC9B,mBAAmB,CAAC,aAAa,CAClC;aACF,CACF,CACF,CAAC;QACJ,CAAC;KACF;IACD,OAAO,EAAE;QACP,GAAG,SAAS,CACV,SAAS,EACT,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,IAAK,KAAgB,EAC/D,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,KAAe,EAAE,EAC1C,WAAW,CACZ;QACD,KAAK,EAAE,cAAc,CACnB,QAAQ,EACR,aAAa,EACb,IAAI,EACJ,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,KAAe,EAAE,CAC3C;KACF;IACD,OAAO,EAAE;QACP,GAAG,SAAS,CACV,SAAS,EACT,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,IAAK,KAAgB,EAC/D,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,KAAe,EAAE,EAC1C,WAAW,CACZ;QACD,KAAK,EAAE,cAAc,CACnB,QAAQ,EACR,aAAa,EACb,IAAI,EACJ,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,KAAe,EAAE,CAC3C;KACF;IACD,gBAAgB,EAAE;QAChB,GAAG,SAAS,CACV,kBAAkB,EAClB,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,GAAI,KAAgB,EAC9D,CAAC,KAAK,EAAE,EAAE,CAAC,aAAa,KAAe,EAAE,EACzC,WAAW,CACZ;QACD,KAAK,EAAE,cAAc,CACnB,QAAQ,EACR,aAAa,EACb,GAAG,EACH,CAAC,KAAK,EAAE,EAAE,CAAC,aAAa,KAAe,EAAE,CAC1C;KACF;IACD,gBAAgB,EAAE;QAChB,GAAG,SAAS,CACV,kBAAkB,EAClB,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,GAAI,KAAgB,EAC9D,CAAC,KAAK,EAAE,EAAE,CAAC,aAAa,KAAe,EAAE,EACzC,WAAW,CACZ;QACD,KAAK,EAAE,cAAc,CACnB,QAAQ,EACR,aAAa,EACb,GAAG,EACH,CAAC,KAAK,EAAE,EAAE,CAAC,aAAa,KAAe,EAAE,CAC1C;KACF;IACD,QAAQ,EAAE;QACR,GAAG,SAAS,CACV,UAAU,EACV,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,IAAK,KAAgB,EAClE,CAAC,KAAK,EAAE,EAAE,CAAC,sBAAsB,KAAe,QAAQ,EACxD,WAAW,CACZ;QACD,KAAK,EAAE,cAAc,CACnB,OAAO,EACP,kBAAkB,EAClB,IAAI,EACJ,CAAC,KAAK,EAAE,EAAE,CAAC,sBAAsB,KAAe,QAAQ,CACzD;KACF;IACD,QAAQ,EAAE;QACR,GAAG,SAAS,CACV,UAAU,EACV,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,IAAK,KAAgB,EAClE,CAAC,KAAK,EAAE,EAAE,CAAC,qBAAqB,KAAe,QAAQ,EACvD,WAAW,CACZ;QACD,KAAK,EAAE,cAAc,CACnB,OAAO,EACP,kBAAkB,EAClB,IAAI,EACJ,CAAC,KAAK,EAAE,EAAE,CAAC,qBAAqB,KAAe,QAAQ,CACxD;KACF;IACD,aAAa,EAAE;QACb,GAAG,SAAS,CACV,eAAe,EACf,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,CAAC,QAAQ,CAAC,QAAQ,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,IAAK,KAAgB,EACnD,CAAC,KAAK,EAAE,EAAE,CAAC,sBAAsB,KAAe,aAAa,EAC7D,WAAW,CACZ;QACD,KAAK,EAAE,cAAc,CACnB,QAAQ,EACR,oBAAoB,EACpB,IAAI,EACJ,CAAC,KAAK,EAAE,EAAE,CAAC,sBAAsB,KAAe,aAAa,CAC9D;KACF;IACD,aAAa,EAAE;QACb,GAAG,SAAS,CACV,eAAe,EACf,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,CAAC,QAAQ,CAAC,QAAQ,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,IAAK,KAAgB,EACnD,CAAC,KAAK,EAAE,EAAE,CAAC,qBAAqB,KAAe,aAAa,EAC5D,WAAW,CACZ;QACD,KAAK,EAAE,cAAc,CACnB,QAAQ,EACR,oBAAoB,EACpB,IAAI,EACJ,CAAC,KAAK,EAAE,EAAE,CAAC,qBAAqB,KAAe,aAAa,CAC7D;KACF;IACD,QAAQ,EAAE;QACR,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC;QAClB,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE;YAC/B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACzC,IAAI,EAAE,GAAG,IAAI,CAAC;YACd,KAAK,MAAM,IAAI,IAAI,KAAiB,EAAE,CAAC;gBACrC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;oBACvC,GAAG,CAAC,KAAK,CAAC,8BAA8B,IAAI,GAAG,EAAE;wBAC/C,eAAe,EAAE,IAAI;qBACtB,CAAC,CAAC;oBACH,EAAE,GAAG,KAAK,CAAC;gBACb,CAAC;YACH,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;gBACpD,GAAI,KAAkB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAClC,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CAAC;oBACV,IAAI,EAAE,QAAQ;oBACd,MAAM,EAAE,IAAI,CAAC,QAAQ;oBACrB,GAAG,EAAE,IAAI;iBACV,CAAC,EACF;oBACE,OAAO,CAAC,QAAQ,CACd,EAAE,eAAe,EAAE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAC3C,8BAA8B,IAAI,GAAG,CACtC;iBACF,CACF,CACF;aACF,CAAC,CACH,CAAC;QACJ,CAAC;KACF;IACD,UAAU,EAAE;QACV,GAAG,SAAS,CACV,YAAY,EACZ,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAClB,OAAO,QAAQ,KAAK,QAAQ,IAAI,YAAY,CAAC,QAAQ,EAAE,KAAe,CAAC,EACzE,CAAC,KAAK,EAAE,EAAE,CAAC,yBAAyB,KAAe,EAAE,EACrD,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CACnC;QACD,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,EACvC,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,MAAM,CACZ,cAAc,EACd,IAAI,CAAC,QAAQ,EACb,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CACxB,CACF,CACF,EACD;gBACE,OAAO,CAAC,QAAQ,CACd,EAAE,UAAU,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EACvC,yBAAyB,KAAe,EAAE,CAC3C;aACF,CACF,CACF,CAAC;QACJ,CAAC;KACF;IACD,WAAW,EAAE;QACX,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC;QACrB,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE;YAC/B,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAChE,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC;YAC/B,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,iBAAiB,EAAE;gBACjD,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;aACnB,CAAC,CAAC;YACH,OAAO,KAAK,CAAC;QACf,CAAC;QACD,yEAAyE;QACzE,yEAAyE;QACzE,wEAAwE;QACxE,0EAA0E;QAC1E,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,IAAI,KAAK,KAAK,IAAI;gBAAE,OAAO;YAC3B,+DAA+D;YAC/D,qEAAqE;YACrE,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,oBAAoB,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACjE,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CACT,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,EACtC,OAAO,CAAC,MAAM,CAAC,mBAAmB,EAAE,IAAI,CAAC,QAAQ,CAAC,CACnD,EACD;gBACE,OAAO,CAAC,QAAQ,CACd,EAAE,UAAU,EAAE,IAAI,EAAE,EACpB,WAAW,EACX,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAC1D,OAAO,EACP,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAC1D,iBAAiB,CAClB;aACF,CACF,CACF,CAAC;QACJ,CAAC;KACF;IACD,iBAAiB,EAAE;QACjB,EAAE,EAAE,EAAE,CAAC,mBAAmB,CAAC;QAC3B,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE;YAC/B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACzC,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC;YAC9B,IAAI,EAAE,GAAG,IAAI,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CACvC,KAAkC,CACnC,EAAE,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC;oBAAE,SAAS;gBAC7C,KAAK,MAAM,GAAG,IAAI,IAAgB,EAAE,CAAC;oBACnC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC;wBAClC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,eAAe,GAAG,iBAAiB,EAAE;4BACrD,QAAQ,EAAE,IAAI;4BACd,eAAe,EAAE,GAAG;yBACrB,CAAC,CAAC;wBACH,EAAE,GAAG,KAAK,CAAC;oBACb,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACrB,IAAI,CAAC,IAAI,CACP,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;gBACpD,GAAG,MAAM,CAAC,OAAO,CAAC,KAAkC,CAAC,CAAC,GAAG,CACvD,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CACf,OAAO,CAAC,IAAI,CACV,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,EACnD,IAAiB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAC7B,OAAO,CAAC,IAAI,CACV,OAAO,CAAC,GAAG,CAAC;oBACV,IAAI,EAAE,QAAQ;oBACd,MAAM,EAAE,IAAI,CAAC,QAAQ;oBACrB,GAAG,EAAE,GAAG;iBACT,CAAC,EACF;oBACE,OAAO,CAAC,QAAQ,CACd;wBACE,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAChC,eAAe,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;qBACvC,EACD,IAAI,IAAI,eAAe,GAAG,iBAAiB,CAC5C;iBACF,CACF,CACF,CACF,CACJ;aACF,CAAC,CACH,CAAC;QACJ,CAAC;KACF;IACD,2EAA2E;IAC3E,2EAA2E;IAC3E,4EAA4E;IAC5E,mEAAmE;IACnE,WAAW,EAAE;QACX,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC;QACrB,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI;QACpB,KAAK,EAAE,GAAG,EAAE;YACV,oEAAoE;QACtE,CAAC;KACF;IACD,WAAW,EAAE;QACX,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC;QACrB,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI;QACpB,KAAK,EAAE,GAAG,EAAE;YACV,oEAAoE;QACtE,CAAC;KACF;CACF,CAAC"}

package/dist/keywords/vocab2019.d.ts

@@ -0,0 +1,36 @@
+import { DialectRegistry, KeywordBehavior } from "../dialect.js";
+/** 2019-09 core vocabulary URI. */
+export declare const VOCAB_CORE_2019_09 = "https://json-schema.org/draft/2019-09/vocab/core";
+/** 2019-09 applicator vocabulary URI. */
+export declare const VOCAB_APPLICATOR_2019 = "https://json-schema.org/draft/2019-09/vocab/applicator";
+/** 2019-09 validation vocabulary URI. */
+export declare const VOCAB_VALIDATION_2019 = "https://json-schema.org/draft/2019-09/vocab/validation";
+/** 2019-09 meta-data vocabulary URI. */
+export declare const VOCAB_META_DATA_2019 = "https://json-schema.org/draft/2019-09/vocab/meta-data";
+/** 2019-09 format vocabulary URI. */
+export declare const VOCAB_FORMAT_2019 = "https://json-schema.org/draft/2019-09/vocab/format";
+/** 2019-09 content vocabulary URI. */
+export declare const VOCAB_CONTENT_2019 = "https://json-schema.org/draft/2019-09/vocab/content";
+/** 2019-09 dialect URI. */
+export declare const DIALECT_2019_09 = "https://json-schema.org/draft/2019-09/schema";
+/**
+ * `items` (2019-09 form): a schema value applies to every element (produces
+ * `true`, matching 2020-12 `items`' post-`prefixItems` annotation shape); an
+ * array value (tuple) applies element-wise to the first N and produces the
+ * largest index reached, or `true` when it covers the whole array — this is
+ * the pre-2020-12 keyword that `prefixItems`/`items` later split in two, so
+ * its annotation shape mirrors 2020-12 `prefixItems`'.
+ */
+export declare const items2019: KeywordBehavior;
+/**
+ * `additionalItems`: applies only when the sibling `items` is present *and*
+ * an array (tuple form) — a schema-form `items` already covers every
+ * element, so `additionalItems` "does nothing" against it (suite: "when
+ * items is schema, additionalItems does nothing"). Sibling-read, same
+ * pattern as `if`/`then`/`else` and `contains`' `minContains`/`maxContains`
+ * siblings.
+ */
+export declare const additionalItems: KeywordBehavior;
+/** Registers the 2019-09 vocabularies and dialect. */
+export declare function registerDialect2019(registry: DialectRegistry, format?: (id: string) => KeywordBehavior): void;
+//# sourceMappingURL=vocab2019.d.ts.map

package/dist/keywords/vocab2019.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vocab2019.d.ts","sourceRoot":"","sources":["../../src/keywords/vocab2019.ts"],"names":[],"mappings":"AASA,OAAO,EACL,eAAe,EACf,eAAe,EAIhB,MAAM,eAAe,CAAC;AA2BvB,mCAAmC;AACnC,eAAO,MAAM,kBAAkB,qDAAkB,CAAC;AAClD,yCAAyC;AACzC,eAAO,MAAM,qBAAqB,2DACwB,CAAC;AAC3D,yCAAyC;AACzC,eAAO,MAAM,qBAAqB,2DACwB,CAAC;AAC3D,wCAAwC;AACxC,eAAO,MAAM,oBAAoB,0DACwB,CAAC;AAC1D,qCAAqC;AACrC,eAAO,MAAM,iBAAiB,uDACwB,CAAC;AACvD,sCAAsC;AACtC,eAAO,MAAM,kBAAkB,wDACwB,CAAC;AAExD,2BAA2B;AAC3B,eAAO,MAAM,eAAe,iDAAiD,CAAC;AAqB9E;;;;;;;GAOG;AACH,eAAO,MAAM,SAAS,EAAE,eA4HvB,CAAC;AAEF;;;;;;;GAOG;AACH,eAAO,MAAM,eAAe,EAAE,eA+E7B,CAAC;AA0VF,sDAAsD;AACtD,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,eAAe,EACzB,MAAM,GAAE,CAAC,EAAE,EAAE,MAAM,KAAK,eAAgC,GACvD,IAAI,CAsBN"}

package/dist/keywords/vocab2019.js

@@ -0,0 +1,585 @@
+// 2019-09 dialect (DESIGN.md M4-A): assembled from its own vocabulary URIs,
+// reusing 2020-12 behavior objects wherever spec semantics are identical
+// (validation is byte-for-byte the same set; most applicators too) and
+// registering new behaviors only where 2019-09 diverges — no `$dynamicRef`/
+// `$dynamicAnchor` (2019-09 has `$recursiveRef`/`$recursiveAnchor` instead),
+// tuple-form `items` folds what 2020-12 splits into `prefixItems`+`items`,
+// and `additionalItems` (retired in 2020-12) fills the gap that leaves.
+import { isObject } from "../json.js";
+import { identifiers2019, } from "../dialect.js";
+import { childCursor } from "../cursor.js";
+import { lowerIR } from "../lowering.js";
+import { coreVocabulary, VOCAB_CORE_2019, $recursiveRef, $recursiveAnchor, annotationOnly, SELF, } from "./core.js";
+import { allOf, anyOf, oneOf, not, ifKeyword, conditionalBranch, dependentSchemas, properties, patternProperties, propertyNames, additionalProperties, contains, } from "./applicator.js";
+import { validationVocabulary } from "./validation.js";
+/** 2019-09 core vocabulary URI. */
+export const VOCAB_CORE_2019_09 = VOCAB_CORE_2019;
+/** 2019-09 applicator vocabulary URI. */
+export const VOCAB_APPLICATOR_2019 = "https://json-schema.org/draft/2019-09/vocab/applicator";
+/** 2019-09 validation vocabulary URI. */
+export const VOCAB_VALIDATION_2019 = "https://json-schema.org/draft/2019-09/vocab/validation";
+/** 2019-09 meta-data vocabulary URI. */
+export const VOCAB_META_DATA_2019 = "https://json-schema.org/draft/2019-09/vocab/meta-data";
+/** 2019-09 format vocabulary URI. */
+export const VOCAB_FORMAT_2019 = "https://json-schema.org/draft/2019-09/vocab/format";
+/** 2019-09 content vocabulary URI. */
+export const VOCAB_CONTENT_2019 = "https://json-schema.org/draft/2019-09/vocab/content";
+/** 2019-09 dialect URI. */
+export const DIALECT_2019_09 = "https://json-schema.org/draft/2019-09/schema";
+const id = (name) => `${VOCAB_APPLICATOR_2019}#${name}`;
+// 2019-09 core: same keyword set as 2020-12's core minus $dynamicRef/
+// $dynamicAnchor, plus $recursiveRef/$recursiveAnchor. $id/$schema/$anchor/
+// $vocabulary/$comment/$defs behaviors are draft-agnostic (structural or
+// value-is-the-position), so they're shared as-is — the milestone contract
+// allows a shared behavior's id to stay a 2020-12 URI.
+const core2019Vocabulary = {
+    $ref: coreVocabulary.$ref,
+    $defs: coreVocabulary.$defs,
+    $id: coreVocabulary.$id,
+    $schema: coreVocabulary.$schema,
+    $anchor: coreVocabulary.$anchor,
+    $vocabulary: coreVocabulary.$vocabulary,
+    $comment: coreVocabulary.$comment,
+    $recursiveRef,
+    $recursiveAnchor,
+};
+/**
+ * `items` (2019-09 form): a schema value applies to every element (produces
+ * `true`, matching 2020-12 `items`' post-`prefixItems` annotation shape); an
+ * array value (tuple) applies element-wise to the first N and produces the
+ * largest index reached, or `true` when it covers the whole array — this is
+ * the pre-2020-12 keyword that `prefixItems`/`items` later split in two, so
+ * its annotation shape mirrors 2020-12 `prefixItems`'.
+ */
+export const items2019 = {
+    id: id("items"),
+    // evaluatesIndexes mirrors prefixItems (array form: a fixed-count prefix)
+    // and items (schema form: every index from 0 — 2019-09 folds prefixItems
+    // into this same keyword, so there's no separate sibling to start after)
+    // — the coverage facts unevaluatedItems2019 needs for static licensing.
+    analyze: (value) => Array.isArray(value)
+        ? {
+            subschemas: value.map((_, i) => [i]),
+            applications: value.map((_, i) => ({
+                path: [i],
+                mode: "childByIndex",
+                conditional: false,
+                asserts: true,
+            })),
+            produces: [id("items")],
+            evaluatesIndexes: { kind: "prefix", count: value.length },
+        }
+        : {
+            ...SELF,
+            applications: [
+                { path: [], mode: "childSweep", conditional: false, asserts: true },
+            ],
+            produces: [id("items")],
+            evaluatesIndexes: { kind: "allFrom", start: 0 },
+        },
+    // Two forms, same as evaluate(): tuple (per-index, guarded by the array's
+    // length like prefixItems' compiled form) or schema (every element from
+    // index 0, like `items`' compiled form but with no sibling prefixItems to
+    // start after — 2019-09 has no such keyword). Each form's annotation
+    // mirrors evaluate(): tuple produces the largest applied index (or true
+    // when it covered the array), schema produces true iff it applied to any
+    // element.
+    lower: (value, lctx) => {
+        if (Array.isArray(value)) {
+            value.forEach((_, i) => {
+                lctx.emit(lowerIR.when(lowerIR.and(lowerIR.typeIs(lctx.instance, "array"), lowerIR.cmp(">", lowerIR.helper("lengthOf", lctx.instance), lowerIR.constant(i))), [
+                    {
+                        kind: "apply",
+                        apply: {
+                            path: [i],
+                            cursor: {
+                                kind: "child",
+                                of: { kind: "here" },
+                                segment: i,
+                            },
+                            fold: "allMustPass",
+                        },
+                    },
+                ]));
+            });
+            lctx.emit({
+                kind: "produce",
+                value: { kind: "collectedIndexes", render: "largestOrTrue" },
+            });
+            return;
+        }
+        const b = lctx.binding();
+        lctx.emit(lowerIR.when(lowerIR.typeIs(lctx.instance, "array"), [
+            {
+                kind: "forEachIndex",
+                target: lctx.instance,
+                binding: b,
+                start: 0,
+                body: [
+                    {
+                        kind: "apply",
+                        apply: {
+                            path: [],
+                            cursor: {
+                                kind: "child",
+                                of: { kind: "here" },
+                                segment: { kind: "binding", id: b },
+                            },
+                            fold: "allMustPass",
+                        },
+                    },
+                ],
+            },
+        ]));
+        lctx.emit({
+            kind: "produce",
+            value: { kind: "collectedIndexes", render: "appliedTrue" },
+        });
+    },
+    evaluate: (value, cursor, ctx) => {
+        if (!Array.isArray(cursor.value))
+            return true;
+        if (Array.isArray(value)) {
+            const n = Math.min(value.length, cursor.value.length);
+            let ok = true;
+            for (let i = 0; i < n; i++) {
+                if (!ctx.apply(["items", i], childCursor(cursor, i, cursor.value[i])))
+                    ok = false;
+            }
+            // Dependency data only from an accepting keyword (Appendix D; see
+            // applicator.ts properties) — the same rule for every producer here.
+            if (n > 0 && ok)
+                ctx.produce(n === cursor.value.length ? true : n - 1);
+            return ok;
+        }
+        let ok = true;
+        let applied = false;
+        for (let i = 0; i < cursor.value.length; i++) {
+            applied = true;
+            if (!ctx.apply(["items"], childCursor(cursor, i, cursor.value[i])))
+                ok = false;
+        }
+        if (applied && ok)
+            ctx.produce(true);
+        return ok;
+    },
+};
+/**
+ * `additionalItems`: applies only when the sibling `items` is present *and*
+ * an array (tuple form) — a schema-form `items` already covers every
+ * element, so `additionalItems` "does nothing" against it (suite: "when
+ * items is schema, additionalItems does nothing"). Sibling-read, same
+ * pattern as `if`/`then`/`else` and `contains`' `minContains`/`maxContains`
+ * siblings.
+ */
+export const additionalItems = {
+    id: id("additionalItems"),
+    // Sibling read at plan time (AnalyzeContext.schema), same as `if`
+    // declaring applications for `then`/`else`: no edge at all when `items`
+    // isn't an array, so the planner never visits a target this keyword can
+    // never reach.
+    analyze: (_value, context) => {
+        const siblingItems = context?.schema.items;
+        if (!Array.isArray(siblingItems)) {
+            return { ...SELF, produces: [id("additionalItems")] };
+        }
+        return {
+            ...SELF,
+            applications: [
+                { path: [], mode: "childSweep", conditional: false, asserts: true },
+            ],
+            produces: [id("additionalItems")],
+            evaluatesIndexes: { kind: "allFrom", start: siblingItems.length },
+        };
+    },
+    // Sibling `items` is plan-time data (lctx.schema.items): when it isn't an
+    // array, this keyword contributes nothing at all, so the lowering emits
+    // no statements — same static-read pattern as `if`/`then`/`else`.
+    lower: (_value, lctx) => {
+        const siblingItems = lctx.schema.items;
+        if (!Array.isArray(siblingItems))
+            return;
+        const start = siblingItems.length;
+        const b = lctx.binding();
+        lctx.emit(lowerIR.when(lowerIR.typeIs(lctx.instance, "array"), [
+            {
+                kind: "forEachIndex",
+                target: lctx.instance,
+                binding: b,
+                start,
+                body: [
+                    {
+                        kind: "apply",
+                        apply: {
+                            path: [],
+                            cursor: {
+                                kind: "child",
+                                of: { kind: "here" },
+                                segment: { kind: "binding", id: b },
+                            },
+                            fold: "allMustPass",
+                        },
+                    },
+                ],
+            },
+        ]));
+        // Annotation: true iff it applied to any element past the tuple prefix.
+        lctx.emit({
+            kind: "produce",
+            value: { kind: "collectedIndexes", render: "appliedTrue" },
+        });
+    },
+    evaluate: (_value, cursor, ctx) => {
+        if (!Array.isArray(cursor.value))
+            return true;
+        const siblingItems = ctx.schema.items;
+        if (!Array.isArray(siblingItems))
+            return true;
+        let ok = true;
+        let applied = false;
+        for (let i = siblingItems.length; i < cursor.value.length; i++) {
+            applied = true;
+            if (!ctx.apply(["additionalItems"], childCursor(cursor, i, cursor.value[i])))
+                ok = false;
+        }
+        // Boolean data: additionalItems has no index-range shape of its own,
+        // only whether it applied to any element.
+        if (applied && ok)
+            ctx.produce(true);
+        return ok;
+    },
+};
+const applicator2019Vocabulary = {
+    allOf,
+    anyOf,
+    oneOf,
+    not,
+    if: ifKeyword,
+    then: conditionalBranch(id("then"), "then", true),
+    else: conditionalBranch(id("else"), "else", false),
+    dependentSchemas,
+    properties,
+    patternProperties,
+    propertyNames,
+    additionalProperties,
+    items: items2019,
+    additionalItems,
+    contains,
+};
+// unevaluatedItems/unevaluatedProperties (2019-09): same consumer pattern as
+// unevaluated.ts, wired to this dialect's producer ids — items2019 folds
+// prefixItems+items into one id, and additionalItems is a genuinely new
+// producer 2020-12 doesn't have. Spec-wise these two live in the applicator
+// vocabulary (2019-09 has no separate unevaluated vocabulary yet).
+const unevaluatedItems2019 = {
+    id: `${VOCAB_APPLICATOR_2019}#unevaluatedItems`,
+    phase: 1,
+    analyze: () => ({
+        subschemas: SELF.subschemas,
+        consumes: [
+            items2019.id,
+            additionalItems.id,
+            contains.id,
+            `${VOCAB_APPLICATOR_2019}#unevaluatedItems`,
+        ],
+        produces: [`${VOCAB_APPLICATOR_2019}#unevaluatedItems`],
+        // Self-covering (D9a): once this keyword runs, everything is evaluated —
+        // needed both for the planner's own edge (childSweep to its own
+        // position) and so an outer scope's coverage computation can fold this
+        // node's post-success contribution.
+        evaluatesIndexes: { kind: "all" },
+        applications: [
+            { path: [], mode: "childSweep", conditional: false, asserts: true },
+        ],
+    }),
+    // Static-coverage path only (D9a), same discipline as 2020-12
+    // unevaluatedItems (unevaluated.ts): a sibling `contains` always declares
+    // evaluatesIndexes: dynamic (applicator.ts), so the planner classifies
+    // this node interpreted whenever `contains` is present — lower() is never
+    // called with a null/incomplete coverage, and never needs the
+    // per-index coveredIdx set evaluate() tracks (that set is populated only
+    // from a dynamic `contains` match list, which forces interpretation).
+    lower: (_value, lctx) => {
+        // Runtime-coverage path (phase B activates it): same shape as 2020-12
+        // unevaluatedItems — fold the channel into a coveredPrefix/coveredIdx
+        // summary over this array's length and sweep the uncovered indexes.
+        if (lctx.runtimeCoverage()) {
+            const f = lctx.binding();
+            const b = lctx.binding();
+            lctx.emit(lowerIR.when(lowerIR.typeIs(lctx.instance, "array"), [
+                { kind: "coverageFold", half: "indexes", binding: f },
+                {
+                    kind: "forEachIndex",
+                    target: lctx.instance,
+                    binding: b,
+                    start: 0,
+                    body: [
+                        lowerIR.when(lowerIR.not({
+                            kind: "coverageCovers",
+                            fold: f,
+                            target: { kind: "binding", id: b },
+                        }), [
+                            {
+                                kind: "apply",
+                                apply: {
+                                    path: [],
+                                    cursor: {
+                                        kind: "child",
+                                        of: { kind: "here" },
+                                        segment: { kind: "binding", id: b },
+                                    },
+                                    fold: "allMustPass",
+                                },
+                            },
+                        ]),
+                    ],
+                },
+                {
+                    kind: "produce",
+                    value: { kind: "collectedIndexes", render: "appliedTrue" },
+                },
+            ]));
+            return;
+        }
+        const coverage = lctx.staticCoverage();
+        if (coverage === null) {
+            throw new Error("unevaluatedItems2019 lowering requires static coverage (planner bug)");
+        }
+        if (coverage.coversAllIndexes)
+            return; // statically vacuous
+        const b = lctx.binding();
+        lctx.emit(lowerIR.when(lowerIR.typeIs(lctx.instance, "array"), [
+            {
+                kind: "forEachIndex",
+                target: lctx.instance,
+                binding: b,
+                start: coverage.prefixCount,
+                body: [
+                    {
+                        kind: "apply",
+                        apply: {
+                            path: [],
+                            cursor: {
+                                kind: "child",
+                                of: { kind: "here" },
+                                segment: { kind: "binding", id: b },
+                            },
+                            fold: "allMustPass",
+                        },
+                    },
+                ],
+            },
+        ]));
+        // Annotation: true iff it applied to any unevaluated index.
+        lctx.emit({
+            kind: "produce",
+            value: { kind: "collectedIndexes", render: "appliedTrue" },
+        });
+    },
+    evaluate: (_value, cursor, ctx) => {
+        if (!Array.isArray(cursor.value))
+            return true;
+        const length = cursor.value.length;
+        let coveredPrefix = 0;
+        const coveredIdx = new Set();
+        for (const p of ctx.visible([
+            items2019.id,
+            additionalItems.id,
+            contains.id,
+            unevaluatedItems2019.id,
+        ])) {
+            if (p.behaviorId === contains.id) {
+                if (p.data === true)
+                    coveredPrefix = length;
+                else
+                    for (const i of p.data)
+                        coveredIdx.add(i);
+            }
+            else if (p.data === true) {
+                coveredPrefix = length;
+            }
+            else if (p.behaviorId === items2019.id) {
+                coveredPrefix = Math.max(coveredPrefix, p.data + 1);
+            }
+        }
+        let ok = true;
+        let applied = false;
+        for (let i = coveredPrefix; i < length; i++) {
+            if (coveredIdx.has(i))
+                continue;
+            applied = true;
+            if (!ctx.apply(["unevaluatedItems"], childCursor(cursor, i, cursor.value[i])))
+                ok = false;
+        }
+        if (applied && ok)
+            ctx.produce(true);
+        return ok;
+    },
+};
+const unevaluatedProperties2019 = {
+    id: `${VOCAB_APPLICATOR_2019}#unevaluatedProperties`,
+    phase: 1,
+    analyze: () => ({
+        subschemas: SELF.subschemas,
+        consumes: [
+            properties.id,
+            patternProperties.id,
+            additionalProperties.id,
+            `${VOCAB_APPLICATOR_2019}#unevaluatedProperties`,
+        ],
+        produces: [`${VOCAB_APPLICATOR_2019}#unevaluatedProperties`],
+        evaluatesNames: { kind: "all" },
+        applications: [
+            { path: [], mode: "childSweep", conditional: false, asserts: true },
+        ],
+    }),
+    // Static-coverage path only (D9a) — same discipline as 2020-12
+    // unevaluatedProperties (unevaluated.ts). `properties`/`patternProperties`/
+    // `additionalProperties` here are the shared 2020-12 behaviors
+    // (applicator.ts), so their evaluatesNames facts are identical.
+    lower: (_value, lctx) => {
+        // Runtime-coverage path (phase B activates it): same shape as 2020-12
+        // unevaluatedProperties — fold the channel into an evaluated-name set and
+        // sweep the names it does not cover.
+        if (lctx.runtimeCoverage()) {
+            const f = lctx.binding();
+            const b = lctx.binding();
+            lctx.emit(lowerIR.when(lowerIR.typeIs(lctx.instance, "object"), [
+                { kind: "coverageFold", half: "names", binding: f },
+                {
+                    kind: "forEachKey",
+                    target: lctx.instance,
+                    binding: b,
+                    body: [
+                        lowerIR.when(lowerIR.not({
+                            kind: "coverageCovers",
+                            fold: f,
+                            target: { kind: "binding", id: b },
+                        }), [
+                            {
+                                kind: "apply",
+                                apply: {
+                                    path: [],
+                                    cursor: {
+                                        kind: "child",
+                                        of: { kind: "here" },
+                                        segment: { kind: "binding", id: b },
+                                    },
+                                    fold: "allMustPass",
+                                },
+                            },
+                        ]),
+                    ],
+                },
+                { kind: "produce", value: { kind: "collectedNames" } },
+            ]));
+            return;
+        }
+        const coverage = lctx.staticCoverage();
+        if (coverage === null) {
+            throw new Error("unevaluatedProperties2019 lowering requires static coverage (planner bug)");
+        }
+        // The sweep is statically vacuous when sibling coverage is total, but the
+        // produce is not: evaluate() emits an (empty) names annotation for every
+        // object regardless. So the object-type guard always wraps a produce; the
+        // sweep is added only when some name can still be unevaluated.
+        const body = [];
+        if (!coverage.coversAllNames) {
+            const b = lctx.binding();
+            const covered = [
+                ...coverage.names.map((n) => lowerIR.cmp("===", { kind: "binding", id: b }, lowerIR.constant(n))),
+                ...coverage.patterns.map((p) => lowerIR.regexTest(p, { kind: "binding", id: b })),
+            ];
+            body.push({
+                kind: "forEachKey",
+                target: lctx.instance,
+                binding: b,
+                body: [
+                    lowerIR.when(covered.length === 0
+                        ? lowerIR.constant(true)
+                        : lowerIR.not(lowerIR.or(...covered)), [
+                        {
+                            kind: "apply",
+                            apply: {
+                                path: [],
+                                cursor: {
+                                    kind: "child",
+                                    of: { kind: "here" },
+                                    segment: { kind: "binding", id: b },
+                                },
+                                fold: "allMustPass",
+                            },
+                        },
+                    ]),
+                ],
+            });
+        }
+        body.push({ kind: "produce", value: { kind: "collectedNames" } });
+        // Produce iff the instance is an object (nothing otherwise), matching
+        // evaluate()'s object-type guard before ctx.produce.
+        lctx.emit(lowerIR.when(lowerIR.typeIs(lctx.instance, "object"), body));
+    },
+    evaluate: (_value, cursor, ctx) => {
+        if (!isObject(cursor.value))
+            return true;
+        const seen = new Set();
+        for (const p of ctx.visible([
+            properties.id,
+            patternProperties.id,
+            additionalProperties.id,
+            unevaluatedProperties2019.id,
+        ])) {
+            for (const name of p.data)
+                seen.add(name);
+        }
+        let ok = true;
+        const matched = [];
+        for (const name of Object.keys(cursor.value)) {
+            if (seen.has(name))
+                continue;
+            matched.push(name);
+            if (!ctx.apply(["unevaluatedProperties"], childCursor(cursor, name, cursor.value[name])))
+                ok = false;
+        }
+        if (ok)
+            ctx.produce(matched);
+        return ok;
+    },
+};
+Object.assign(applicator2019Vocabulary, {
+    unevaluatedItems: unevaluatedItems2019,
+    unevaluatedProperties: unevaluatedProperties2019,
+});
+const metaDataVocabulary2019 = Object.fromEntries([
+    "title",
+    "description",
+    "default",
+    "deprecated",
+    "readOnly",
+    "writeOnly",
+    "examples",
+].map((name) => [name, annotationOnly(`${VOCAB_META_DATA_2019}#${name}`)]));
+const contentVocabulary2019 = Object.fromEntries(["contentMediaType", "contentEncoding", "contentSchema"].map((name) => [
+    name,
+    annotationOnly(`${VOCAB_CONTENT_2019}#${name}`),
+]));
+/** Registers the 2019-09 vocabularies and dialect. */
+export function registerDialect2019(registry, format = annotationOnly) {
+    registry.registerVocabulary(VOCAB_CORE_2019_09, core2019Vocabulary);
+    registry.registerVocabulary(VOCAB_APPLICATOR_2019, applicator2019Vocabulary);
+    registry.registerVocabulary(VOCAB_VALIDATION_2019, validationVocabulary);
+    registry.registerVocabulary(VOCAB_META_DATA_2019, metaDataVocabulary2019);
+    registry.registerVocabulary(VOCAB_FORMAT_2019, {
+        format: format(`${VOCAB_FORMAT_2019}#format`),
+    });
+    registry.registerVocabulary(VOCAB_CONTENT_2019, contentVocabulary2019);
+    registry.registerDialect(DIALECT_2019_09, [
+        VOCAB_CORE_2019_09,
+        VOCAB_APPLICATOR_2019,
+        VOCAB_VALIDATION_2019,
+        VOCAB_META_DATA_2019,
+        VOCAB_FORMAT_2019,
+        VOCAB_CONTENT_2019,
+    ], { identifiers: identifiers2019 });
+}
+//# sourceMappingURL=vocab2019.js.map