npm - agentic-flow - Versions diffs - 2.0.6 → 3.0.0-alpha.1 - Mend

agentic-flow 2.0.6 → 3.0.0-alpha.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1684) hide show

package/dist/packages/agentdb/src/controllers/LearningSystem.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"LearningSystem.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/LearningSystem.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAKH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAA+B,MAAM,0CAA0C,CAAC;AACzG,OAAO,EAAE,qBAAqB,EAA8B,MAAM,sCAAsC,CAAC;AACzG,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AA8CvD,MAAM,OAAO,cAAc;IACjB,EAAE,CAAW;IACb,QAAQ,CAAmB;IAC3B,cAAc,GAAiC,IAAI,GAAG,EAAE,CAAC;IAEjE,6CAA6C;IACrC,WAAW,GAA4B,IAAI,CAAC;IAC5C,WAAW,GAAiC,IAAI,CAAC;IACjD,UAAU,GAAsB,IAAI,CAAC;IACrC,UAAU,GAAY,KAAK,CAAC;IAC5B,WAAW,GAAY,KAAK,CAAC;IAErC,YAAY,EAAY,EAAE,QAA0B;QAClD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,IAAI,CAAC,8BAA8B,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;YAChD,OAAO,CAAC,IAAI,CAAC,qDAAqD,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;QACnF,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,8BAA8B;QAC1C,0CAA0C;QAC1C,IAAI,CAAC;YACH,MAAM,SAAS,GAAc;gBAC3B,QAAQ,EAAE,GAAG,EAAG,yBAAyB;gBACzC,SAAS,EAAE,GAAG;gBACd,KAAK,EAAE,CAAC;gBACR,OAAO,EAAE,GAAG;aACb,CAAC;YAEF,IAAI,CAAC,WAAW,GAAG,IAAI,gBAAgB,CAAC,SAAS,CAAC,CAAC;YACnD,MAAM,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC;YACpC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,kEAAkE,CAAC,CAAC;QAClF,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;YAC1E,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1B,CAAC;QAED,4CAA4C;QAC5C,IAAI,CAAC;YACH,IAAI,CAAC,WAAW,GAAG,IAAI,qBAAqB,EAAE,CAAC;YAC/C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC;YACxD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;YAE/B,IAAI,WAAW,EAAE,CAAC;gBAChB,OAAO,CAAC,GAAG,CAAC,iEAAiE,IAAI,CAAC,WAAW,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YACpH,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;YACpE,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC3B,CAAC;QAED,yDAAyD;QACzD,IAAI,CAAC;YACH,IAAI,CAAC,UAAU,GAAG,IAAI,UAAU,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9F,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC;YACnC,OAAO,CAAC,GAAG,CAAC,oDAAoD,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QACtG,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,mDAAmD,CAAC,CAAC;YAClE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO;YACL,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU;YACzF,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,aAAa,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU;YACjF,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,aAAa,EAAE,IAAI,UAAU;SAC3D,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAsDZ,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAChB,MAAc,EACd,WAA2C,EAC3C,MAAsB;QAEtB,MAAM,SAAS,GAAG,WAAW,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAErF,MAAM,OAAO,GAAoB;YAC/B,EAAE,EAAE,SAAS;YACb,MAAM;YACN,WAAW;YACX,MAAM;YACN,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,MAAM,EAAE,QAAQ;SACjB,CAAC;QAEF,4BAA4B;QAC5B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGf,CAAC,CAAC,GAAG,CACJ,OAAO,CAAC,EAAE,EACV,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,WAAW,EACnB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,EAC9B,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,MAAM,CACf,CAAC;QAEF,kBAAkB;QAClB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAE5C,OAAO,CAAC,GAAG,CAAC,+BAA+B,SAAS,KAAK,WAAW,GAAG,CAAC,CAAC;QACzE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,SAAiB;QAChC,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAEjF,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,sBAAsB,SAAS,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,8BAA8B,SAAS,EAAE,CAAC,CAAC;QAC7D,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE3B,oBAAoB;QACpB,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAEjC,wBAAwB;QACxB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAIf,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE3B,sBAAsB;QACtB,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC;QAC1B,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC;QAE7B,8BAA8B;QAC9B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAEtC,OAAO,CAAC,GAAG,CAAC,6BAA6B,SAAS,eAAe,OAAO,GAAG,OAAO,CAAC,SAAS,KAAK,CAAC,CAAC;IACrG,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,SAAiB,EAAE,KAAa;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAEjF,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,sBAAsB,SAAS,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,uBAAuB,SAAS,EAAE,CAAC,CAAC;QACtD,CAAC;QAED,gCAAgC;QAChC,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAEtE,8BAA8B;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAE/C,qCAAqC;QACrC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,qBAAqB,CACnD,OAAO,EACP,KAAK,EACL,cAAc,EACd,MAAM,CACP,CAAC;QAEF,gCAAgC;QAChC,MAAM,aAAa,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAErE,6BAA6B;QAC7B,MAAM,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC,eAAe,IAAI,GAAG,CAAC;QAC9D,IAAI,cAAc,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAEtC,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,eAAe,EAAE,CAAC;YACpC,yBAAyB;YACzB,cAAc,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;QACnF,CAAC;QAED,wCAAwC;QACxC,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACxC,MAAM,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/D,MAAM,UAAU,GAAG,QAAQ,GAAG,QAAQ,IAAI,CAAC,CAAC;QAE5C,OAAO;YACL,MAAM,EAAE,cAAc,CAAC,MAAM;YAC7B,UAAU,EAAE,CAAC,cAAc,CAAC,KAAK,GAAG,QAAQ,CAAC,GAAG,UAAU;YAC1D,MAAM,EAAE,cAAc,CAAC,KAAK;YAC5B,YAAY,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAChD,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,UAAU,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,GAAG,UAAU;gBAC7C,MAAM,EAAE,CAAC,CAAC,KAAK;aAChB,CAAC,CAAC;SACJ,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,cAAc,CAAC,QAAwB;QAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAEnG,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,sBAAsB,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9D,CAAC;QAED,+BAA+B;QAC/B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAIf,CAAC,CAAC,GAAG,CACJ,QAAQ,CAAC,SAAS,EAClB,QAAQ,CAAC,KAAK,EACd,QAAQ,CAAC,MAAM,EACf,QAAQ,CAAC,MAAM,EACf,QAAQ,CAAC,SAAS,IAAI,IAAI,EAC1B,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACxB,QAAQ,CAAC,SAAS,CACnB,CAAC;QAEF,qDAAqD;QACrD,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACzC,IAAI,CAAC;gBACH,MAAM,cAAc,GAAa;oBAC/B,KAAK,EAAE,EAAE,WAAW,EAAE,QAAQ,CAAC,KAAK,EAAE;oBACtC,MAAM,EAAE,QAAQ,CAAC,MAAM;oBACvB,MAAM,EAAE,QAAQ,CAAC,MAAM;iBACxB,CAAC;gBAEF,MAAM,IAAI,CAAC,WAAW,CAAC,gBAAgB,CACrC,OAAO,CAAC,WAAW,EACnB,CAAC,cAAc,CAAC,CACjB,CAAC;YACJ,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,IAAI,CAAC,oDAAoD,EAAE,KAAK,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,MAAM,IAAI,CAAC,uBAAuB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAEtD,OAAO,CAAC,GAAG,CAAC,gCAAgC,QAAQ,CAAC,SAAS,YAAY,QAAQ,CAAC,MAAM,YAAY,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1H,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CACT,SAAiB,EACjB,MAAc,EACd,SAAiB,EACjB,YAAoB;QAEpB,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAEjF,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,sBAAsB,SAAS,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,uCAAuC;QACvC,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAInC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAU,CAAC;QAE3B,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,2CAA2C,SAAS,EAAE,CAAC,CAAC;QAC1E,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,gBAAgB;QAChB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAC5C,sBAAsB;YACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAErD,qBAAqB;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;gBACpD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;gBAE/C,mCAAmC;gBACnC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;gBACtE,SAAS,IAAI,SAAS,CAAC;gBACvB,UAAU,EAAE,CAAC;gBAEb,qBAAqB;gBACrB,WAAW,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjE,CAAC;YAED,eAAe;YACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,WAAW,KAAK,GAAG,CAAC,IAAI,MAAM,YAAY,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC/F,CAAC;QACH,CAAC;QAED,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAC9C,MAAM,SAAS,GAAG,WAAW,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAG,SAAS,GAAG,UAAU,CAAC;QAEzC,sBAAsB;QACtB,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAEjC,6BAA6B;QAC7B,MAAM,eAAe,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,CAAC;QAEjE,OAAO,CAAC,GAAG,CAAC,yBAAyB,MAAM,YAAY,cAAc,IAAI,CAAC,CAAC;QAE3E,OAAO;YACL,eAAe,EAAE,MAAM;YACvB,SAAS;YACT,SAAS;YACT,eAAe;YACf,cAAc;SACf,CAAC;IACJ,CAAC;IAED,+EAA+E;IAC/E,yBAAyB;IACzB,+EAA+E;IAE/E;;OAEG;IACK,UAAU,CAAC,SAAiB;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAE3B,CAAC,CAAC,GAAG,CAAC,SAAS,CAAQ,CAAC;QAEzB,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,MAAM,EAAE,GAAG,CAAC,OAAO;YACnB,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;YAC9B,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,OAAO,EAAE,GAAG,CAAC,QAAQ;YACrB,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS;SAC9D,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,iBAAiB,CAAC,SAAiB,EAAE,KAAa;QAC9D,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGhC,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAQ,CAAC;QAEhC,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,IAAI,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACrD,CAAC;QAED,yBAAyB;QACzB,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEnD,kBAAkB;QAClB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGf,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAExD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,SAAiB;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;KAK9B,CAAC,CAAC,GAAG,CAAC,SAAS,CAAQ,CAAC;QAEzB,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,sBAAsB;YACtB,OAAO;gBACL,gBAAgB,EAAE,EAAE;gBACpB,OAAO,EAAE,EAAE;gBACX,WAAW,EAAE,EAAE;gBACf,UAAU,EAAE,EAAE;aACf,CAAC;QACJ,CAAC;QAED,OAAO;YACL,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,kBAAkB,CAAC;YACvD,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;YACpC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;YAC5C,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC;SAC3C,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,qBAAqB,CACjC,OAAwB,EACxB,KAAa,EACb,cAA4B,EAC5B,MAAW;QAEX,6CAA6C;QAC7C,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACxC,IAAI,CAAC;gBACH,8DAA8D;gBAC9D,MAAM,aAAa,GAAmB,EAAE,CAAC;gBACzC,MAAM,OAAO,GAAa,EAAE,CAAC;gBAE7B,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC3D,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC1B,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,6BAA6B;wBACjE,OAAO,CAAC,IAAI,CAAC,MAAgB,CAAC,CAAC;oBACjC,CAAC;oBACD,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC;wBAAE,MAAM,CAAC,2BAA2B;gBACnE,CAAC;gBAED,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC7B,mCAAmC;oBACnC,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAChD,cAAc,EACd,aAAa,EACb,OAAO,CACR,CAAC;oBAEF,wDAAwD;oBACxD,sDAAsD;oBACtD,OAAO,CAAC,GAAG,CAAC,sDAAsD,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;gBACjG,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;QAED,4CAA4C;QAC5C,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACzC,IAAI,CAAC;gBACH,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;gBAE7D,IAAI,UAAU,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;oBAChC,iDAAiD;oBACjD,OAAO,CAAC,GAAG,CAAC,2CAA2C,UAAU,CAAC,MAAM,iBAAiB,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAE9H,OAAO,CAAC;4BACN,MAAM,EAAE,UAAU,CAAC,MAAM;4BACzB,KAAK,EAAE,UAAU,CAAC,UAAU;yBAC7B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,IAAI,CAAC,uDAAuD,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;QACD,6CAA6C;QAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAG/B,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEjD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,gCAAgC;YAChC,OAAO;gBACL,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE;gBAClC,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE;gBAClC,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE;aACnC,CAAC;QACJ,CAAC;QAED,2CAA2C;QAC3C,MAAM,MAAM,GAA6C,EAAE,CAAC;QAE5D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,GAAG,CAAC,CAAC;YAEd,QAAQ,OAAO,CAAC,WAAW,EAAE,CAAC;gBAC5B,KAAK,YAAY,CAAC;gBAClB,KAAK,OAAO,CAAC;gBACb,KAAK,KAAK;oBACR,0BAA0B;oBAC1B,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACjC,MAAM;gBAER,KAAK,iBAAiB,CAAC;gBACvB,KAAK,cAAc,CAAC;gBACpB,KAAK,KAAK;oBACR,qBAAqB;oBACrB,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACpC,MAAM;gBAER,KAAK,sBAAsB;oBACzB,qCAAqC;oBACrC,KAAK,GAAG,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;oBAC9D,MAAM;gBAER,KAAK,MAAM;oBACT,mBAAmB;oBACnB,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;oBAClD,MAAM;gBAER,KAAK,aAAa;oBAChB,uBAAuB;oBACvB,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;oBACxD,MAAM;gBAER;oBACE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC1B,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,uBAAuB,CAAC,OAAwB,EAAE,QAAwB;QACtF,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QACxD,MAAM,GAAG,GAAG,GAAG,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAEnD,2BAA2B;QAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5B,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,CAAC;QAED,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC;QAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC;QAE5C,QAAQ,OAAO,CAAC,WAAW,EAAE,CAAC;YAC5B,KAAK,YAAY,CAAC,CAAC,CAAC;gBAClB,mDAAmD;gBACnD,IAAI,QAAQ,GAAG,CAAC,CAAC;gBACjB,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;oBACvB,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC;oBACpG,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrE,CAAC;gBACD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,GAAG,KAAK,GAAG,QAAQ,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9D,MAAM;YACR,CAAC;YAED,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,sDAAsD;gBACtD,8DAA8D;gBAC9D,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;gBACpE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9D,MAAM;YACR,CAAC;YAED,KAAK,iBAAiB,CAAC;YACvB,KAAK,cAAc,CAAC;YACpB,KAAK,KAAK,CAAC,CAAC,CAAC;gBACX,wBAAwB;gBACxB,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBAClC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACzE,MAAM;YACR,CAAC;YAED;gBACE,0BAA0B;gBAC1B,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBAClC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CACtB,OAAwB,EACxB,KAAY,EACZ,YAAoB;QAEpB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAEhD,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAEzC,uBAAuB;YACvB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC;YAED,sCAAsC;YACtC,IAAI,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;YAExB,IAAI,GAAG,CAAC,UAAU,IAAI,OAAO,CAAC,WAAW,KAAK,iBAAiB,EAAE,CAAC;gBAChE,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC;gBAChG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzE,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,cAAc,GAAG,QAAQ,CAAC;YACrD,CAAC;YAED,4BAA4B;YAC5B,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC;YAC9C,SAAS,IAAI,IAAI,CAAC;YAElB,iBAAiB;YACjB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,YAAY,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC;YAE5D,gBAAgB;YAChB,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/D,CAAC;QAED,OAAO,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAClC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,SAAiB;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAE/C,MAAM,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAGtC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAQ,CAAC;QAEzB,MAAM,OAAO,GAAG,CAAC,cAAc,EAAE,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAEvD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAIf,CAAC,CAAC,GAAG,CACJ,SAAS,EACT,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,gBAAgB,IAAI,EAAE,CAAC,EAC7C,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,EACpC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC,EACxC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,EACvC,OAAO,CACR,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,SAAiB;QAChD,sBAAsB;QACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;KAKhC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAU,CAAC;QAE3B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC;QAElC,4CAA4C;QAC5C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAEtD,qCAAqC;YACrC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3E,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBACjB,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChE,CAAC,CAAC,CAAC;YACH,WAAW,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAClC,CAAC;QAED,oCAAoC;QACpC,MAAM,SAAS,GAAG,WAAW,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;IACpC,CAAC;IAED,qCAAqC;IAC7B,yBAAyB,CAAC,KAAa,EAAE,MAAc,EAAE,MAAW;QAC1E,MAAM,GAAG,GAAG,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;QACjC,OAAO,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAEO,aAAa,CAAC,KAAa,EAAE,MAAc,EAAE,MAAW;QAC9D,MAAM,GAAG,GAAG,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,GAAW,EAAE,GAAQ,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACjG,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,OAAO,CAAC,GAAG,WAAW,CAAC;IACzB,CAAC;IAEO,mBAAmB,CAAC,KAAa,EAAE,MAAc,EAAE,MAAW;QACpE,MAAM,GAAG,GAAG,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;QACjC,OAAO,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAEO,YAAY,CAAI,KAAU;QAChC,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+EAA+E;IAC/E,gDAAgD;IAChD,+EAA+E;IAE/E;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,OAKhB;QACC,MAAM,EAAE,SAAS,EAAE,cAAc,GAAG,CAAC,EAAE,aAAa,GAAG,IAAI,EAAE,OAAO,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC;QAE1F,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,cAAc,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;QAE5E,qBAAqB;QACrB,IAAI,WAAW,GAAG,sBAAsB,CAAC;QACzC,MAAM,MAAM,GAAU,CAAC,eAAe,CAAC,CAAC;QAExC,IAAI,SAAS,EAAE,CAAC;YACd,WAAW,IAAI,qBAAqB,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzB,CAAC;QAED,kBAAkB;QAClB,MAAM,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;QASjC,WAAW;KACd,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAQ,CAAC;QAEzB,mBAAmB;QACnB,IAAI,cAAc,GAAU,EAAE,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;YACvB,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;UAO7B,WAAW;;;;OAId,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAU,CAAC;QAC7B,CAAC;aAAM,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACjC,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;UAO7B,WAAW;;;;OAId,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAU,CAAC;QAC7B,CAAC;QAED,iBAAiB;QACjB,IAAI,MAAM,GAAU,EAAE,CAAC;QACvB,IAAI,aAAa,EAAE,CAAC;YAClB,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;UAOrB,WAAW;;;OAGd,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAU,CAAC;QAC7B,CAAC;QAED,6BAA6B;QAC7B,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;KAQlD,CAAC,CAAC,GAAG,CAAC,SAAS,CAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QAEhC,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,IAAI,cAAc,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC3D,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAEpF,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;YACvF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;gBAC5F,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;gBAC9F,iBAAiB,GAAG,SAAS,GAAG,QAAQ,CAAC;YAC3C,CAAC;QACH,CAAC;QAED,OAAO;YACL,UAAU,EAAE;gBACV,IAAI,EAAE,cAAc;gBACpB,cAAc,EAAE,eAAe;gBAC/B,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;aACzB;YACD,OAAO,EAAE;gBACP,aAAa,EAAE,YAAY,CAAC,cAAc,IAAI,CAAC;gBAC/C,SAAS,EAAE,YAAY,CAAC,UAAU,IAAI,CAAC;gBACvC,WAAW,EAAE,YAAY,CAAC,YAAY,IAAI,CAAC;gBAC3C,SAAS,EAAE,YAAY,CAAC,UAAU,IAAI,CAAC;gBACvC,SAAS,EAAE,YAAY,CAAC,UAAU,IAAI,CAAC;gBACvC,YAAY,EAAE,YAAY,CAAC,cAAc,IAAI,CAAC;aAC/C;YACD,cAAc,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACvC,GAAG,EAAE,CAAC,CAAC,SAAS;gBAChB,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,SAAS,EAAE,CAAC,CAAC,UAAU;gBACvB,WAAW,EAAE,CAAC,CAAC,YAAY;aAC5B,CAAC,CAAC;YACH,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACvB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,SAAS,EAAE,CAAC,CAAC,UAAU;gBACvB,WAAW,EAAE,CAAC,CAAC,YAAY;aAC5B,CAAC,CAAC;YACH,iBAAiB,EAAE;gBACjB,QAAQ,EAAE,cAAc,CAAC,MAAM;gBAC/B,iBAAiB,EAAE,iBAAiB;aACrC;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CAAC,OAQtB;QACC,MAAM,EACJ,aAAa,EACb,aAAa,EACb,UAAU,EACV,UAAU,EACV,aAAa,GAAG,GAAG,EACnB,YAAY,GAAG,KAAK,EACpB,YAAY,GAAG,EAAE,GAClB,GAAG,OAAO,CAAC;QAEZ,IAAI,CAAC,aAAa,IAAI,CAAC,UAAU,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;QACrE,CAAC;QAED,IAAI,CAAC,aAAa,IAAI,CAAC,UAAU,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,WAAW,GAAQ;YACvB,QAAQ,EAAE,CAAC;YACX,MAAM,EAAE,CAAC;YACT,WAAW,EAAE,CAAC;YACd,OAAO,EAAE,EAAE;SACZ,CAAC;QAEF,oBAAoB;QACpB,IAAI,YAAY,KAAK,UAAU,IAAI,YAAY,KAAK,KAAK,EAAE,CAAC;YAC1D,MAAM,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;gBAE7B,aAAa,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,cAAc;;;OAG1D,CAAC,CAAC,GAAG,CAAC,aAAa,IAAI,IAAI,UAAU,GAAG,EAAE,YAAY,CAAU,CAAC;YAElE,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;gBACrC,iDAAiD;gBACjD,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;oBAC7B,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBAC7D,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAC1D,MAAM,UAAU,GAAG,gBAAgB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;oBAE9D,IAAI,UAAU,GAAG,aAAa,EAAE,CAAC;wBAC/B,SAAS;oBACX,CAAC;oBAED,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC;wBACvB,IAAI,EAAE,SAAS;wBACf,EAAE,EAAE,OAAO,CAAC,EAAE;wBACd,UAAU;qBACX,CAAC,CAAC;gBACL,CAAC;gBAED,6BAA6B;gBAC7B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;SAIf,CAAC,CAAC,GAAG,CACJ,aAAa,IAAI,OAAO,CAAC,UAAU,EACnC,UAAU,IAAI,OAAO,CAAC,KAAK,EAC3B,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,UAAU,EAClB,OAAO,CAAC,OAAO,EACf,IAAI,CAAC,GAAG,EAAE,EACV,IAAI,CAAC,SAAS,CAAC,EAAE,gBAAgB,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CACjD,CAAC;gBAEF,WAAW,CAAC,QAAQ,EAAE,CAAC;YACzB,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,IAAI,aAAa,IAAI,aAAa,IAAI,CAAC,YAAY,KAAK,KAAK,IAAI,YAAY,KAAK,QAAQ,CAAC,EAAE,CAAC;YAC5F,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;YACzD,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;YAEzD,8CAA8C;YAC9C,IAAI,kBAAkB,GAAG,CAAC,CAAC;YAC3B,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC;gBACjE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAEvC,oCAAoC;gBACpC,IAAI,UAAU,EAAE,CAAC;oBACf,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;oBACpD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAC1D,MAAM,UAAU,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;oBAE7D,IAAI,UAAU,IAAI,aAAa,EAAE,CAAC;wBAChC,MAAM,SAAS,GAAG,GAAG,UAAU,IAAI,MAAM,EAAE,CAAC;wBAC5C,YAAY,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,MAAgB,CAAC;wBACnD,kBAAkB,EAAE,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,kBAAkB,GAAG,CAAC,EAAE,CAAC;gBAC3B,6BAA6B;gBAC7B,MAAM,OAAO,GAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;SAEhC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAS,EAAE,WAAW,IAAI,CAAC,CAAC;gBAEhD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;SAIf,CAAC,CAAC,GAAG,CACJ,aAAa,EACb,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,gBAAgB,IAAI,EAAE,CAAC,EACnD,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,IAAI,EAAE,CAAC,EAC1C,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,WAAW,IAAI,EAAE,CAAC,EAC9C,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,UAAU,IAAI,EAAE,CAAC,EAC7C,OAAO,GAAG,CAAC,CACZ,CAAC;gBAEF,WAAW,CAAC,MAAM,GAAG,kBAAkB,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,OAAO;YACL,OAAO,EAAE,IAAI;YACb,WAAW;YACX,MAAM,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,UAAU,EAAE;YACpD,MAAM,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,UAAU,EAAE;YACpD,aAAa;YACb,YAAY;SACb,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,OAOnB;QACC,MAAM,EACJ,KAAK,EACL,CAAC,GAAG,CAAC,EACL,YAAY,GAAG,UAAU,EACzB,iBAAiB,GAAG,IAAI,EACxB,eAAe,GAAG,IAAI,EACtB,aAAa,GAAG,IAAI,GACrB,GAAG,OAAO,CAAC;QAEZ,sBAAsB;QACtB,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEpD,gCAAgC;QAChC,MAAM,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAItC,CAAC,CAAC,GAAG,EAAW,CAAC;QAElB,MAAM,iBAAiB,GAAU,EAAE,CAAC;QACpC,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YAC3E,MAAM,UAAU,GAAG,gBAAgB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAE5D,iBAAiB,CAAC,IAAI,CAAC;gBACrB,GAAG,GAAG;gBACN,UAAU;aACX,CAAC,CAAC;QACL,CAAC;QAED,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAC9D,MAAM,cAAc,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAErD,4BAA4B;QAC5B,MAAM,YAAY,GAA+F,EAAE,CAAC;QAEpH,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;YACjC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG;oBACzB,KAAK,EAAE,CAAC;oBACR,SAAS,EAAE,CAAC;oBACZ,WAAW,EAAE,CAAC;oBACd,QAAQ,EAAE,EAAE;iBACb,CAAC;YACJ,CAAC;YAED,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACvC,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,KAAK,CAAC,SAAS,IAAI,GAAG,CAAC,MAAM,CAAC;YAC9B,KAAK,CAAC,WAAW,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEzC,IAAI,eAAe,EAAE,CAAC;gBACpB,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAClB,SAAS,EAAE,GAAG,CAAC,EAAE;oBACjB,KAAK,EAAE,GAAG,CAAC,KAAK;oBAChB,MAAM,EAAE,GAAG,CAAC,MAAM;oBAClB,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,UAAU,EAAE,GAAG,CAAC,UAAU;oBAC1B,SAAS,EAAE,GAAG,CAAC,SAAS;iBACzB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,MAAM,eAAe,GAAG,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5E,MAAM;YACN,UAAU,EAAE,IAAI,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM;YAC9C,SAAS,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK;YACtC,WAAW,EAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK;YAC1C,kBAAkB,EAAE,IAAI,CAAC,KAAK;YAC9B,QAAQ,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;SAClE,CAAC,CAAC,CAAC;QAEJ,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAE5D,uCAAuC;QACvC,IAAI,YAAY,GAAU,EAAE,CAAC;QAC7B,IAAI,aAAa,EAAE,CAAC;YAClB,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;OAI9B,CAAC,CAAC,GAAG,EAAW,CAAC;QACpB,CAAC;QAED,MAAM,QAAQ,GAAQ;YACpB,KAAK;YACL,eAAe,EAAE,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YAC5C,YAAY;SACb,CAAC;QAEF,IAAI,YAAY,KAAK,UAAU,IAAI,YAAY,KAAK,MAAM,EAAE,CAAC;YAC3D,QAAQ,CAAC,SAAS,GAAG;gBACnB,uBAAuB,EAAE,cAAc,CAAC,MAAM;gBAC9C,aAAa,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM;gBAC/F,aAAa,EAAE,eAAe,CAAC,MAAM;aACtC,CAAC;QACJ,CAAC;QAED,IAAI,YAAY,KAAK,MAAM,EAAE,CAAC;YAC5B,QAAQ,CAAC,YAAY,GAAG,YAAY,CAAC;YACrC,QAAQ,CAAC,WAAW,GAAG,cAAc,CAAC;QACxC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CAAC,OAWtB;QACC,MAAM,EACJ,SAAS,EACT,QAAQ,EACR,MAAM,EACN,WAAW,EACX,UAAU,EACV,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,QAAQ,GACT,GAAG,OAAO,CAAC;QAEZ,iCAAiC;QACjC,MAAM,KAAK,GAAG,QAAQ,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEtE,+BAA+B;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAI9B,CAAC,CAAC,GAAG,CACJ,SAAS,EACT,KAAK,EACL,OAAO,EACP,MAAM,EACN,SAAS,EACT,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACf,IAAI,CAAC,GAAG,EAAE,EACV,IAAI,CAAC,SAAS,CAAC;YACb,QAAQ;YACR,MAAM;YACN,WAAW;YACX,UAAU;YACV,SAAS;YACT,GAAG,QAAQ;SACZ,CAAC,CACH,CAAC;QAEF,OAAO,CAAC,GAAG,CAAC,+BAA+B,QAAQ,YAAY,MAAM,aAAa,OAAO,EAAE,CAAC,CAAC;QAC7F,OAAO,MAAM,CAAC,eAAyB,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,OAUf;QACC,MAAM,EACJ,SAAS,EACT,OAAO,EACP,cAAc,GAAG,IAAI,EACrB,eAAe,GAAG,GAAG,EACrB,YAAY,GAAG,GAAG,EAClB,WAAW,EACX,cAAc,EACd,aAAa,GAAG,IAAI,EACpB,cAAc,GAAG,UAAU,GAC5B,GAAG,OAAO,CAAC;QAEZ,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,QAAQ,cAAc,EAAE,CAAC;YACvB,KAAK,QAAQ;gBACX,iCAAiC;gBACjC,MAAM,GAAG,OAAO,IAAI,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC/C,MAAM;YAER,KAAK,OAAO;gBACV,sCAAsC;gBACtC,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,MAAM,IAAI,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBACrC,MAAM,IAAI,YAAY,GAAG,GAAG,CAAC;gBAC7B,MAAM,IAAI,eAAe,GAAG,GAAG,CAAC;gBAChC,MAAM;YAER,KAAK,QAAQ;gBACX,8CAA8C;gBAC9C,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC9B,IAAI,cAAc;oBAAE,MAAM,IAAI,GAAG,CAAC;gBAElC,wBAAwB;gBACxB,IAAI,WAAW,IAAI,cAAc,EAAE,CAAC;oBAClC,MAAM,SAAS,GAAG,WAAW,GAAG,cAAc,CAAC;oBAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC;oBACnD,MAAM,IAAI,SAAS,CAAC;gBACtB,CAAC;gBAED,yBAAyB;gBACzB,MAAM,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;gBACrC,MAAM,IAAI,CAAC,eAAe,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;gBACxC,MAAM;YAER,KAAK,UAAU,CAAC;YAChB;gBACE,iCAAiC;gBACjC,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,MAAM,IAAI,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBACrC,MAAM,IAAI,YAAY,GAAG,GAAG,CAAC;gBAC7B,MAAM,IAAI,eAAe,GAAG,GAAG,CAAC;gBAChC,MAAM;QACV,CAAC;QAED,2BAA2B;QAC3B,IAAI,aAAa,IAAI,SAAS,EAAE,CAAC;YAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;OAInC,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAQ,CAAC;YAEpC,IAAI,WAAW,EAAE,UAAU,EAAE,CAAC;gBAC5B,MAAM,IAAI,WAAW,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,+BAA+B;YACzE,CAAC;QACH,CAAC;QAED,4BAA4B;QAC5B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IAC1C,CAAC;CAEF","sourcesContent":["/**\n * Learning System - Reinforcement Learning Session Management\n *\n * Manages RL training sessions with:\n * - Session lifecycle (start/end)\n * - Action prediction with confidence scores\n * - Feedback loop for policy learning\n * - Policy training with configurable parameters\n *\n * Supports 9 RL algorithms:\n * - Q-Learning\n * - SARSA\n * - Deep Q-Network (DQN)\n * - Policy Gradient\n * - Actor-Critic\n * - Proximal Policy Optimization (PPO)\n * - Decision Transformer\n * - Monte Carlo Tree Search (MCTS)\n * - Model-Based RL\n */\n\n// Database type from db-fallback\ntype Database = any;\nimport { EmbeddingService } from './EmbeddingService.js';\nimport { cosineSimilarity } from '../utils/vector-math.js';\nimport { RuVectorLearning, LearningConfig as GNNConfig } from '../backends/ruvector/RuVectorLearning.js';\nimport { SonaTrajectoryService, TrajectoryStep as SonaStep } from '../services/SonaTrajectoryService.js';\nimport { GNNService } from '../services/GNNService.js';\n\nexport interface LearningSession {\n id: string;\n userId: string;\n sessionType: 'q-learning' | 'sarsa' | 'dqn' | 'policy-gradient' | 'actor-critic' | 'ppo' | 'decision-transformer' | 'mcts' | 'model-based';\n config: LearningConfig;\n startTime: number;\n endTime?: number;\n status: 'active' | 'completed' | 'failed';\n metadata?: Record<string, any>;\n}\n\nexport interface LearningConfig {\n learningRate: number;\n discountFactor: number;\n explorationRate?: number;\n batchSize?: number;\n targetUpdateFrequency?: number;\n}\n\nexport interface ActionPrediction {\n action: string;\n confidence: number;\n qValue?: number;\n alternatives: Array<{ action: string; confidence: number; qValue?: number }>;\n}\n\nexport interface ActionFeedback {\n sessionId: string;\n action: string;\n state: string;\n reward: number;\n nextState?: string;\n success: boolean;\n timestamp: number;\n}\n\nexport interface TrainingResult {\n epochsCompleted: number;\n finalLoss: number;\n avgReward: number;\n convergenceRate: number;\n trainingTimeMs: number;\n}\n\nexport class LearningSystem {\n private db: Database;\n private embedder: EmbeddingService;\n private activeSessions: Map<string, LearningSession> = new Map();\n\n // Phase 2: RuVector GNN and Sona integration\n private gnnLearning: RuVectorLearning | null = null;\n private sonaService: SonaTrajectoryService | null = null;\n private gnnService: GNNService | null = null;\n private gnnEnabled: boolean = false;\n private sonaEnabled: boolean = false;\n\n constructor(db: Database, embedder: EmbeddingService) {\n this.db = db;\n this.embedder = embedder;\n this.initializeSchema();\n this.initializeRuVectorEnhancements().catch(err => {\n console.warn('[LearningSystem] RuVector enhancements unavailable:', err.message);\n });\n }\n\n /**\n * Initialize RuVector GNN and Sona enhancements\n */\n private async initializeRuVectorEnhancements(): Promise<void> {\n // Try to initialize GNN-enhanced learning\n try {\n const gnnConfig: GNNConfig = {\n inputDim: 384, // Default embedding size\n hiddenDim: 256,\n heads: 4,\n dropout: 0.1\n };\n\n this.gnnLearning = new RuVectorLearning(gnnConfig);\n await this.gnnLearning.initialize();\n this.gnnEnabled = true;\n console.log('✅ [LearningSystem] GNN-enhanced learning enabled (@ruvector/gnn)');\n } catch (error) {\n console.warn('[LearningSystem] GNN unavailable, using standard learning');\n this.gnnEnabled = false;\n }\n\n // Try to initialize Sona trajectory service\n try {\n this.sonaService = new SonaTrajectoryService();\n const initialized = await this.sonaService.initialize();\n this.sonaEnabled = initialized;\n\n if (initialized) {\n console.log(`[LearningSystem] Sona RL trajectory learning enabled (engine: ${this.sonaService.getEngineType()})`);\n } else {\n console.warn('[LearningSystem] Sona unavailable, using in-memory trajectories');\n }\n } catch (error) {\n console.warn('[LearningSystem] Sona service initialization failed');\n this.sonaEnabled = false;\n }\n\n // Try to initialize GNNService for intent classification\n try {\n this.gnnService = new GNNService({ inputDim: 384, hiddenDim: 128, outputDim: 64, layers: 3 });\n await this.gnnService.initialize();\n console.log(`[LearningSystem] GNNService initialized (engine: ${this.gnnService.getEngineType()})`);\n } catch (error) {\n console.warn('[LearningSystem] GNNService initialization failed');\n this.gnnService = null;\n }\n }\n\n /**\n * Get engine types for all RuVector integrations\n */\n getEngineTypes(): Record<string, string> {\n return {\n gnn: this.gnnEnabled ? (this.gnnLearning?.isInitialized() ? 'native' : 'js') : 'disabled',\n sona: this.sonaEnabled ? (this.sonaService?.getEngineType() || 'js') : 'disabled',\n gnnService: this.gnnService?.getEngineType() || 'disabled',\n };\n }\n\n /**\n * Initialize database schema for learning system\n */\n private initializeSchema(): void {\n this.db.exec(`\n CREATE TABLE IF NOT EXISTS learning_sessions (\n id TEXT PRIMARY KEY,\n user_id TEXT NOT NULL,\n session_type TEXT NOT NULL,\n config TEXT NOT NULL,\n start_time INTEGER NOT NULL,\n end_time INTEGER,\n status TEXT NOT NULL,\n metadata TEXT\n );\n\n CREATE INDEX IF NOT EXISTS idx_learning_sessions_user ON learning_sessions(user_id);\n CREATE INDEX IF NOT EXISTS idx_learning_sessions_status ON learning_sessions(status);\n\n CREATE TABLE IF NOT EXISTS learning_experiences (\n id INTEGER PRIMARY KEY AUTOINCREMENT,\n session_id TEXT NOT NULL,\n state TEXT NOT NULL,\n action TEXT NOT NULL,\n reward REAL NOT NULL,\n next_state TEXT,\n success INTEGER NOT NULL,\n timestamp INTEGER NOT NULL,\n metadata TEXT,\n FOREIGN KEY (session_id) REFERENCES learning_sessions(id) ON DELETE CASCADE\n );\n\n CREATE INDEX IF NOT EXISTS idx_learning_experiences_session ON learning_experiences(session_id);\n CREATE INDEX IF NOT EXISTS idx_learning_experiences_reward ON learning_experiences(reward);\n\n CREATE TABLE IF NOT EXISTS learning_policies (\n id INTEGER PRIMARY KEY AUTOINCREMENT,\n session_id TEXT NOT NULL,\n state_action_pairs TEXT NOT NULL,\n q_values TEXT NOT NULL,\n visit_counts TEXT NOT NULL,\n avg_rewards TEXT NOT NULL,\n version INTEGER NOT NULL,\n created_at INTEGER DEFAULT (strftime('%s', 'now')),\n FOREIGN KEY (session_id) REFERENCES learning_sessions(id) ON DELETE CASCADE\n );\n\n CREATE INDEX IF NOT EXISTS idx_learning_policies_session ON learning_policies(session_id);\n\n CREATE TABLE IF NOT EXISTS learning_state_embeddings (\n id INTEGER PRIMARY KEY AUTOINCREMENT,\n session_id TEXT NOT NULL,\n state TEXT NOT NULL,\n embedding BLOB NOT NULL,\n FOREIGN KEY (session_id) REFERENCES learning_sessions(id) ON DELETE CASCADE\n );\n\n CREATE INDEX IF NOT EXISTS idx_learning_state_embeddings_session ON learning_state_embeddings(session_id);\n `);\n }\n\n /**\n * Start a new learning session\n */\n async startSession(\n userId: string,\n sessionType: LearningSession['sessionType'],\n config: LearningConfig\n ): Promise<string> {\n const sessionId = `session-${Date.now()}-${Math.random().toString(36).substring(7)}`;\n\n const session: LearningSession = {\n id: sessionId,\n userId,\n sessionType,\n config,\n startTime: Date.now(),\n status: 'active',\n };\n\n // Store session in database\n this.db.prepare(`\n INSERT INTO learning_sessions (id, user_id, session_type, config, start_time, status)\n VALUES (?, ?, ?, ?, ?, ?)\n `).run(\n session.id,\n session.userId,\n session.sessionType,\n JSON.stringify(session.config),\n session.startTime,\n session.status\n );\n\n // Cache in memory\n this.activeSessions.set(sessionId, session);\n\n console.log(`✅ Learning session started: ${sessionId} (${sessionType})`);\n return sessionId;\n }\n\n /**\n * End a learning session and save final policy\n */\n async endSession(sessionId: string): Promise<void> {\n const session = this.activeSessions.get(sessionId) || this.getSession(sessionId);\n\n if (!session) {\n throw new Error(`Session not found: ${sessionId}`);\n }\n\n if (session.status === 'completed') {\n throw new Error(`Session already completed: ${sessionId}`);\n }\n\n const endTime = Date.now();\n\n // Save final policy\n await this.savePolicy(sessionId);\n\n // Update session status\n this.db.prepare(`\n UPDATE learning_sessions\n SET status = 'completed', end_time = ?\n WHERE id = ?\n `).run(endTime, sessionId);\n\n // Update memory cache\n session.endTime = endTime;\n session.status = 'completed';\n\n // Remove from active sessions\n this.activeSessions.delete(sessionId);\n\n console.log(`✅ Learning session ended: ${sessionId} (duration: ${endTime - session.startTime}ms)`);\n }\n\n /**\n * Predict next action with confidence scores\n */\n async predict(sessionId: string, state: string): Promise<ActionPrediction> {\n const session = this.activeSessions.get(sessionId) || this.getSession(sessionId);\n\n if (!session) {\n throw new Error(`Session not found: ${sessionId}`);\n }\n\n if (session.status !== 'active') {\n throw new Error(`Session not active: ${sessionId}`);\n }\n\n // Get or create state embedding\n const stateEmbedding = await this.getStateEmbedding(sessionId, state);\n\n // Get policy for this session\n const policy = this.getLatestPolicy(sessionId);\n\n // Calculate Q-values for all actions\n const actionScores = await this.calculateActionScores(\n session,\n state,\n stateEmbedding,\n policy\n );\n\n // Sort by score (highest first)\n const sortedActions = actionScores.sort((a, b) => b.score - a.score);\n\n // Epsilon-greedy exploration\n const explorationRate = session.config.explorationRate || 0.1;\n let selectedAction = sortedActions[0];\n\n if (Math.random() < explorationRate) {\n // Explore: random action\n selectedAction = sortedActions[Math.floor(Math.random() * sortedActions.length)];\n }\n\n // Normalize confidence scores to [0, 1]\n const maxScore = sortedActions[0].score;\n const minScore = sortedActions[sortedActions.length - 1].score;\n const scoreRange = maxScore - minScore || 1;\n\n return {\n action: selectedAction.action,\n confidence: (selectedAction.score - minScore) / scoreRange,\n qValue: selectedAction.score,\n alternatives: sortedActions.slice(1, 4).map(a => ({\n action: a.action,\n confidence: (a.score - minScore) / scoreRange,\n qValue: a.score,\n })),\n };\n }\n\n /**\n * Submit feedback for learning\n *\n * Phase 2 Enhancement: Records to Sona for RL trajectory learning\n */\n async submitFeedback(feedback: ActionFeedback): Promise<void> {\n const session = this.activeSessions.get(feedback.sessionId) || this.getSession(feedback.sessionId);\n\n if (!session) {\n throw new Error(`Session not found: ${feedback.sessionId}`);\n }\n\n // Store experience in database\n this.db.prepare(`\n INSERT INTO learning_experiences (\n session_id, state, action, reward, next_state, success, timestamp\n ) VALUES (?, ?, ?, ?, ?, ?, ?)\n `).run(\n feedback.sessionId,\n feedback.state,\n feedback.action,\n feedback.reward,\n feedback.nextState || null,\n feedback.success ? 1 : 0,\n feedback.timestamp\n );\n\n // Phase 2: Record to Sona for RL trajectory learning\n if (this.sonaEnabled && this.sonaService) {\n try {\n const trajectoryStep: SonaStep = {\n state: { description: feedback.state },\n action: feedback.action,\n reward: feedback.reward\n };\n\n await this.sonaService.recordTrajectory(\n session.sessionType,\n [trajectoryStep]\n );\n } catch (error) {\n console.warn('[LearningSystem] Failed to record Sona trajectory:', error);\n }\n }\n\n // Update policy incrementally based on algorithm\n await this.updatePolicyIncremental(session, feedback);\n\n console.log(`✅ Feedback recorded: session=${feedback.sessionId}, action=${feedback.action}, reward=${feedback.reward}`);\n }\n\n /**\n * Train policy with batch learning\n */\n async train(\n sessionId: string,\n epochs: number,\n batchSize: number,\n learningRate: number\n ): Promise<TrainingResult> {\n const session = this.activeSessions.get(sessionId) || this.getSession(sessionId);\n\n if (!session) {\n throw new Error(`Session not found: ${sessionId}`);\n }\n\n const startTime = Date.now();\n\n // Get all experiences for this session\n const experiences = this.db.prepare(`\n SELECT * FROM learning_experiences\n WHERE session_id = ?\n ORDER BY timestamp ASC\n `).all(sessionId) as any[];\n\n if (experiences.length === 0) {\n throw new Error(`No training data available for session: ${sessionId}`);\n }\n\n let totalLoss = 0;\n let totalReward = 0;\n let batchCount = 0;\n\n // Training loop\n for (let epoch = 0; epoch < epochs; epoch++) {\n // Shuffle experiences\n const shuffled = this.shuffleArray([...experiences]);\n\n // Process in batches\n for (let i = 0; i < shuffled.length; i += batchSize) {\n const batch = shuffled.slice(i, i + batchSize);\n\n // Calculate loss and update policy\n const batchLoss = await this.trainBatch(session, batch, learningRate);\n totalLoss += batchLoss;\n batchCount++;\n\n // Accumulate rewards\n totalReward += batch.reduce((sum, exp) => sum + exp.reward, 0);\n }\n\n // Log progress\n if ((epoch + 1) % 10 === 0) {\n console.log(` Epoch ${epoch + 1}/${epochs} - Loss: ${(totalLoss / batchCount).toFixed(4)}`);\n }\n }\n\n const trainingTimeMs = Date.now() - startTime;\n const avgReward = totalReward / (experiences.length * epochs);\n const finalLoss = totalLoss / batchCount;\n\n // Save trained policy\n await this.savePolicy(sessionId);\n\n // Calculate convergence rate\n const convergenceRate = this.calculateConvergenceRate(sessionId);\n\n console.log(`✅ Training completed: ${epochs} epochs, ${trainingTimeMs}ms`);\n\n return {\n epochsCompleted: epochs,\n finalLoss,\n avgReward,\n convergenceRate,\n trainingTimeMs,\n };\n }\n\n // ============================================================================\n // Private Helper Methods\n // ============================================================================\n\n /**\n * Get session from database\n */\n private getSession(sessionId: string): LearningSession | null {\n const row = this.db.prepare(`\n SELECT * FROM learning_sessions WHERE id = ?\n `).get(sessionId) as any;\n\n if (!row) return null;\n\n return {\n id: row.id,\n userId: row.user_id,\n sessionType: row.session_type,\n config: JSON.parse(row.config),\n startTime: row.start_time,\n endTime: row.end_time,\n status: row.status,\n metadata: row.metadata ? JSON.parse(row.metadata) : undefined,\n };\n }\n\n /**\n * Get or create state embedding\n */\n private async getStateEmbedding(sessionId: string, state: string): Promise<Float32Array> {\n // Check if embedding exists\n const existing = this.db.prepare(`\n SELECT embedding FROM learning_state_embeddings\n WHERE session_id = ? AND state = ?\n `).get(sessionId, state) as any;\n\n if (existing) {\n return new Float32Array(existing.embedding.buffer);\n }\n\n // Generate new embedding\n const embedding = await this.embedder.embed(state);\n\n // Store embedding\n this.db.prepare(`\n INSERT INTO learning_state_embeddings (session_id, state, embedding)\n VALUES (?, ?, ?)\n `).run(sessionId, state, Buffer.from(embedding.buffer));\n\n return embedding;\n }\n\n /**\n * Get latest policy for session\n */\n private getLatestPolicy(sessionId: string): any {\n const policy = this.db.prepare(`\n SELECT * FROM learning_policies\n WHERE session_id = ?\n ORDER BY version DESC\n LIMIT 1\n `).get(sessionId) as any;\n\n if (!policy) {\n // Return empty policy\n return {\n stateActionPairs: {},\n qValues: {},\n visitCounts: {},\n avgRewards: {},\n };\n }\n\n return {\n stateActionPairs: JSON.parse(policy.state_action_pairs),\n qValues: JSON.parse(policy.q_values),\n visitCounts: JSON.parse(policy.visit_counts),\n avgRewards: JSON.parse(policy.avg_rewards),\n };\n }\n\n /**\n * Calculate action scores based on algorithm\n *\n * Phase 2 Enhancement: Uses GNN for embedding refinement and Sona for predictions\n */\n private async calculateActionScores(\n session: LearningSession,\n state: string,\n stateEmbedding: Float32Array,\n policy: any\n ): Promise<Array<{ action: string; score: number }>> {\n // Phase 2: Try GNN-enhanced prediction first\n if (this.gnnEnabled && this.gnnLearning) {\n try {\n // Get similar states from policy for GNN neighbor aggregation\n const similarStates: Float32Array[] = [];\n const weights: number[] = [];\n\n for (const [key, qValue] of Object.entries(policy.qValues)) {\n if (key.startsWith(state)) {\n similarStates.push(stateEmbedding); // Use same embedding for now\n weights.push(qValue as number);\n }\n if (similarStates.length >= 5) break; // Limit to top 5 neighbors\n }\n\n if (similarStates.length > 0) {\n // Enhance state embedding with GNN\n const enhancedEmbedding = this.gnnLearning.enhance(\n stateEmbedding,\n similarStates,\n weights\n );\n\n // Use enhanced embedding for better similarity matching\n // (This would improve action selection in production)\n console.log(`[LearningSystem] GNN enhanced embedding for state: ${state.substring(0, 50)}...`);\n }\n } catch (error) {\n console.warn('[LearningSystem] GNN enhancement failed, using standard scoring');\n }\n }\n\n // Phase 2: Try Sona prediction if available\n if (this.sonaEnabled && this.sonaService) {\n try {\n const prediction = await this.sonaService.predict({ state });\n\n if (prediction.confidence > 0.7) {\n // High-confidence Sona prediction takes priority\n console.log(`[LearningSystem] Sona predicted action: ${prediction.action} (confidence: ${prediction.confidence.toFixed(2)})`);\n\n return [{\n action: prediction.action,\n score: prediction.confidence\n }];\n }\n } catch (error) {\n console.warn('[LearningSystem] Sona prediction failed, using policy');\n }\n }\n // Get possible actions from past experiences\n const actions = this.db.prepare(`\n SELECT DISTINCT action FROM learning_experiences\n WHERE session_id = ?\n `).all(session.id).map((row: any) => row.action);\n\n if (actions.length === 0) {\n // Default actions if none exist\n return [\n { action: 'action_1', score: 0.5 },\n { action: 'action_2', score: 0.4 },\n { action: 'action_3', score: 0.3 },\n ];\n }\n\n // Calculate scores based on algorithm type\n const scores: Array<{ action: string; score: number }> = [];\n\n for (const action of actions) {\n const key = `${state}|${action}`;\n let score = 0;\n\n switch (session.sessionType) {\n case 'q-learning':\n case 'sarsa':\n case 'dqn':\n // Use Q-value from policy\n score = policy.qValues[key] || 0;\n break;\n\n case 'policy-gradient':\n case 'actor-critic':\n case 'ppo':\n // Use average reward\n score = policy.avgRewards[key] || 0;\n break;\n\n case 'decision-transformer':\n // Use reward-conditioned probability\n score = this.calculateTransformerScore(state, action, policy);\n break;\n\n case 'mcts':\n // Use UCB1 formula\n score = this.calculateUCB1(state, action, policy);\n break;\n\n case 'model-based':\n // Use model prediction\n score = this.calculateModelScore(state, action, policy);\n break;\n\n default:\n score = Math.random();\n }\n\n scores.push({ action, score });\n }\n\n return scores;\n }\n\n /**\n * Update policy incrementally after feedback\n */\n private async updatePolicyIncremental(session: LearningSession, feedback: ActionFeedback): Promise<void> {\n const policy = this.getLatestPolicy(feedback.sessionId);\n const key = `${feedback.state}|${feedback.action}`;\n\n // Initialize if not exists\n if (!policy.qValues[key]) {\n policy.qValues[key] = 0;\n policy.visitCounts[key] = 0;\n policy.avgRewards[key] = 0;\n }\n\n const alpha = session.config.learningRate;\n const gamma = session.config.discountFactor;\n\n switch (session.sessionType) {\n case 'q-learning': {\n // Q(s,a) ← Q(s,a) + α[r + γ max Q(s',a') - Q(s,a)]\n let maxNextQ = 0;\n if (feedback.nextState) {\n const nextActions = Object.keys(policy.qValues).filter(k => k.startsWith(feedback.nextState + '|'));\n maxNextQ = Math.max(...nextActions.map(k => policy.qValues[k]), 0);\n }\n const target = feedback.reward + gamma * maxNextQ;\n policy.qValues[key] += alpha * (target - policy.qValues[key]);\n break;\n }\n\n case 'sarsa': {\n // SARSA: Q(s,a) ← Q(s,a) + α[r + γ Q(s',a') - Q(s,a)]\n // For incremental update, we approximate with current Q-value\n const target = feedback.reward + gamma * (policy.qValues[key] || 0);\n policy.qValues[key] += alpha * (target - policy.qValues[key]);\n break;\n }\n\n case 'policy-gradient':\n case 'actor-critic':\n case 'ppo': {\n // Update average reward\n policy.visitCounts[key]++;\n const n = policy.visitCounts[key];\n policy.avgRewards[key] += (feedback.reward - policy.avgRewards[key]) / n;\n break;\n }\n\n default:\n // Default: simple average\n policy.visitCounts[key]++;\n const n = policy.visitCounts[key];\n policy.avgRewards[key] += (feedback.reward - policy.avgRewards[key]) / n;\n }\n }\n\n /**\n * Train batch of experiences\n */\n private async trainBatch(\n session: LearningSession,\n batch: any[],\n learningRate: number\n ): Promise<number> {\n let totalLoss = 0;\n const policy = this.getLatestPolicy(session.id);\n\n for (const exp of batch) {\n const key = `${exp.state}|${exp.action}`;\n\n // Initialize if needed\n if (!policy.qValues[key]) {\n policy.qValues[key] = 0;\n }\n\n // Calculate target based on algorithm\n let target = exp.reward;\n\n if (exp.next_state && session.sessionType !== 'policy-gradient') {\n const nextActions = Object.keys(policy.qValues).filter(k => k.startsWith(exp.next_state + '|'));\n const maxNextQ = Math.max(...nextActions.map(k => policy.qValues[k]), 0);\n target += session.config.discountFactor * maxNextQ;\n }\n\n // Calculate loss (TD error)\n const prediction = policy.qValues[key];\n const loss = Math.pow(target - prediction, 2);\n totalLoss += loss;\n\n // Update Q-value\n policy.qValues[key] += learningRate * (target - prediction);\n\n // Update counts\n policy.visitCounts[key] = (policy.visitCounts[key] || 0) + 1;\n }\n\n return totalLoss / batch.length;\n }\n\n /**\n * Save policy to database\n */\n private async savePolicy(sessionId: string): Promise<void> {\n const policy = this.getLatestPolicy(sessionId);\n\n const currentVersion = this.db.prepare(`\n SELECT MAX(version) as max_version FROM learning_policies\n WHERE session_id = ?\n `).get(sessionId) as any;\n\n const version = (currentVersion?.max_version || 0) + 1;\n\n this.db.prepare(`\n INSERT INTO learning_policies (\n session_id, state_action_pairs, q_values, visit_counts, avg_rewards, version\n ) VALUES (?, ?, ?, ?, ?, ?)\n `).run(\n sessionId,\n JSON.stringify(policy.stateActionPairs || {}),\n JSON.stringify(policy.qValues || {}),\n JSON.stringify(policy.visitCounts || {}),\n JSON.stringify(policy.avgRewards || {}),\n version\n );\n }\n\n /**\n * Calculate convergence rate\n */\n private calculateConvergenceRate(sessionId: string): number {\n // Get policy versions\n const versions = this.db.prepare(`\n SELECT version, q_values FROM learning_policies\n WHERE session_id = ?\n ORDER BY version DESC\n LIMIT 10\n `).all(sessionId) as any[];\n\n if (versions.length < 2) return 0;\n\n // Calculate rate of change between versions\n let totalChange = 0;\n for (let i = 0; i < versions.length - 1; i++) {\n const qValues1 = JSON.parse(versions[i].q_values);\n const qValues2 = JSON.parse(versions[i + 1].q_values);\n\n // Calculate mean absolute difference\n const keys = new Set([...Object.keys(qValues1), ...Object.keys(qValues2)]);\n let diff = 0;\n keys.forEach(key => {\n diff += Math.abs((qValues1[key] || 0) - (qValues2[key] || 0));\n });\n totalChange += diff / keys.size;\n }\n\n // Lower change = higher convergence\n const avgChange = totalChange / (versions.length - 1);\n return Math.max(0, 1 - avgChange);\n }\n\n // Algorithm-specific scoring methods\n private calculateTransformerScore(state: string, action: string, policy: any): number {\n const key = `${state}|${action}`;\n return policy.avgRewards[key] || 0;\n }\n\n private calculateUCB1(state: string, action: string, policy: any): number {\n const key = `${state}|${action}`;\n const q = policy.avgRewards[key] || 0;\n const n = policy.visitCounts[key] || 1;\n const N = Object.values(policy.visitCounts).reduce((sum: number, val: any) => sum + val, 0) || 1;\n const exploration = Math.sqrt(2 * Math.log(N) / n);\n return q + exploration;\n }\n\n private calculateModelScore(state: string, action: string, policy: any): number {\n const key = `${state}|${action}`;\n return policy.avgRewards[key] || 0;\n }\n\n private shuffleArray<T>(array: T[]): T[] {\n const result = [...array];\n for (let i = result.length - 1; i > 0; i--) {\n const j = Math.floor(Math.random() * (i + 1));\n [result[i], result[j]] = [result[j], result[i]];\n }\n return result;\n }\n\n // ============================================================================\n // Extended Learning System Methods (Tools 6-10)\n // ============================================================================\n\n /**\n * Get learning performance metrics with time windows and trends\n */\n async getMetrics(options: {\n sessionId?: string;\n timeWindowDays?: number;\n includeTrends?: boolean;\n groupBy?: 'task' | 'session' | 'skill';\n }): Promise<any> {\n const { sessionId, timeWindowDays = 7, includeTrends = true, groupBy = 'task' } = options;\n\n const cutoffTimestamp = Date.now() - (timeWindowDays * 24 * 60 * 60 * 1000);\n\n // Base query filters\n let whereClause = 'WHERE timestamp >= ?';\n const params: any[] = [cutoffTimestamp];\n\n if (sessionId) {\n whereClause += ' AND session_id = ?';\n params.push(sessionId);\n }\n\n // Overall metrics\n const overallStats = this.db.prepare(`\n SELECT\n COUNT(*) as total_episodes,\n AVG(reward) as avg_reward,\n AVG(CASE WHEN success = 1 THEN 1.0 ELSE 0.0 END) as success_rate,\n MIN(reward) as min_reward,\n MAX(reward) as max_reward,\n AVG(CASE WHEN metadata IS NOT NULL THEN json_extract(metadata, '$.latency_ms') END) as avg_latency_ms\n FROM learning_experiences\n ${whereClause}\n `).get(...params) as any;\n\n // Group by metrics\n let groupedMetrics: any[] = [];\n if (groupBy === 'task') {\n groupedMetrics = this.db.prepare(`\n SELECT\n state as group_key,\n COUNT(*) as count,\n AVG(reward) as avg_reward,\n AVG(CASE WHEN success = 1 THEN 1.0 ELSE 0.0 END) as success_rate\n FROM learning_experiences\n ${whereClause}\n GROUP BY state\n ORDER BY count DESC\n LIMIT 20\n `).all(...params) as any[];\n } else if (groupBy === 'session') {\n groupedMetrics = this.db.prepare(`\n SELECT\n session_id as group_key,\n COUNT(*) as count,\n AVG(reward) as avg_reward,\n AVG(CASE WHEN success = 1 THEN 1.0 ELSE 0.0 END) as success_rate\n FROM learning_experiences\n ${whereClause}\n GROUP BY session_id\n ORDER BY count DESC\n LIMIT 20\n `).all(...params) as any[];\n }\n\n // Trend analysis\n let trends: any[] = [];\n if (includeTrends) {\n trends = this.db.prepare(`\n SELECT\n DATE(timestamp / 1000, 'unixepoch') as date,\n COUNT(*) as count,\n AVG(reward) as avg_reward,\n AVG(CASE WHEN success = 1 THEN 1.0 ELSE 0.0 END) as success_rate\n FROM learning_experiences\n ${whereClause}\n GROUP BY date\n ORDER BY date ASC\n `).all(...params) as any[];\n }\n\n // Policy improvement metrics\n const policyVersions = sessionId ? this.db.prepare(`\n SELECT\n version,\n created_at,\n q_values\n FROM learning_policies\n WHERE session_id = ?\n ORDER BY version ASC\n `).all(sessionId) as any[] : [];\n\n let policyImprovement = 0;\n if (policyVersions.length >= 2) {\n const firstPolicy = JSON.parse(policyVersions[0].q_values);\n const latestPolicy = JSON.parse(policyVersions[policyVersions.length - 1].q_values);\n\n const commonKeys = Object.keys(firstPolicy).filter(k => latestPolicy[k] !== undefined);\n if (commonKeys.length > 0) {\n const avgFirst = commonKeys.reduce((sum, k) => sum + firstPolicy[k], 0) / commonKeys.length;\n const avgLatest = commonKeys.reduce((sum, k) => sum + latestPolicy[k], 0) / commonKeys.length;\n policyImprovement = avgLatest - avgFirst;\n }\n }\n\n return {\n timeWindow: {\n days: timeWindowDays,\n startTimestamp: cutoffTimestamp,\n endTimestamp: Date.now(),\n },\n overall: {\n totalEpisodes: overallStats.total_episodes || 0,\n avgReward: overallStats.avg_reward || 0,\n successRate: overallStats.success_rate || 0,\n minReward: overallStats.min_reward || 0,\n maxReward: overallStats.max_reward || 0,\n avgLatencyMs: overallStats.avg_latency_ms || 0,\n },\n groupedMetrics: groupedMetrics.map(g => ({\n key: g.group_key,\n count: g.count,\n avgReward: g.avg_reward,\n successRate: g.success_rate,\n })),\n trends: trends.map(t => ({\n date: t.date,\n count: t.count,\n avgReward: t.avg_reward,\n successRate: t.success_rate,\n })),\n policyImprovement: {\n versions: policyVersions.length,\n qValueImprovement: policyImprovement,\n },\n };\n }\n\n /**\n * Transfer learning between sessions or tasks\n */\n async transferLearning(options: {\n sourceSession?: string;\n targetSession?: string;\n sourceTask?: string;\n targetTask?: string;\n minSimilarity?: number;\n transferType?: 'episodes' | 'skills' | 'causal_edges' | 'all';\n maxTransfers?: number;\n }): Promise<any> {\n const {\n sourceSession,\n targetSession,\n sourceTask,\n targetTask,\n minSimilarity = 0.7,\n transferType = 'all',\n maxTransfers = 10,\n } = options;\n\n if (!sourceSession && !sourceTask) {\n throw new Error('Must specify either sourceSession or sourceTask');\n }\n\n if (!targetSession && !targetTask) {\n throw new Error('Must specify either targetSession or targetTask');\n }\n\n const transferred: any = {\n episodes: 0,\n skills: 0,\n causalEdges: 0,\n details: [],\n };\n\n // Transfer episodes\n if (transferType === 'episodes' || transferType === 'all') {\n const sourceEpisodes = this.db.prepare(`\n SELECT * FROM learning_experiences\n WHERE ${sourceSession ? 'session_id = ?' : 'state LIKE ?'}\n ORDER BY reward DESC\n LIMIT ?\n `).all(sourceSession || `%${sourceTask}%`, maxTransfers) as any[];\n\n for (const episode of sourceEpisodes) {\n // Check similarity if transferring between tasks\n if (sourceTask && targetTask) {\n const sourceEmbed = await this.embedder.embed(episode.state);\n const targetEmbed = await this.embedder.embed(targetTask);\n const similarity = cosineSimilarity(sourceEmbed, targetEmbed);\n\n if (similarity < minSimilarity) {\n continue;\n }\n\n transferred.details.push({\n type: 'episode',\n id: episode.id,\n similarity,\n });\n }\n\n // Insert transferred episode\n this.db.prepare(`\n INSERT INTO learning_experiences (\n session_id, state, action, reward, next_state, success, timestamp, metadata\n ) VALUES (?, ?, ?, ?, ?, ?, ?, ?)\n `).run(\n targetSession || episode.session_id,\n targetTask || episode.state,\n episode.action,\n episode.reward,\n episode.next_state,\n episode.success,\n Date.now(),\n JSON.stringify({ transferred_from: episode.id })\n );\n\n transferred.episodes++;\n }\n }\n\n // Transfer policy/Q-values\n if (sourceSession && targetSession && (transferType === 'all' || transferType === 'skills')) {\n const sourcePolicy = this.getLatestPolicy(sourceSession);\n const targetPolicy = this.getLatestPolicy(targetSession);\n\n // Transfer Q-values with similarity weighting\n let transferredQValues = 0;\n for (const [key, qValue] of Object.entries(sourcePolicy.qValues)) {\n const [state, action] = key.split('|');\n\n // Check if target has similar state\n if (targetTask) {\n const stateEmbed = await this.embedder.embed(state);\n const targetEmbed = await this.embedder.embed(targetTask);\n const similarity = cosineSimilarity(stateEmbed, targetEmbed);\n\n if (similarity >= minSimilarity) {\n const targetKey = `${targetTask}|${action}`;\n targetPolicy.qValues[targetKey] = qValue as number;\n transferredQValues++;\n }\n }\n }\n\n if (transferredQValues > 0) {\n // Save updated target policy\n const version = (this.db.prepare(`\n SELECT MAX(version) as max_version FROM learning_policies WHERE session_id = ?\n `).get(targetSession) as any)?.max_version || 0;\n\n this.db.prepare(`\n INSERT INTO learning_policies (\n session_id, state_action_pairs, q_values, visit_counts, avg_rewards, version\n ) VALUES (?, ?, ?, ?, ?, ?)\n `).run(\n targetSession,\n JSON.stringify(targetPolicy.stateActionPairs || {}),\n JSON.stringify(targetPolicy.qValues || {}),\n JSON.stringify(targetPolicy.visitCounts || {}),\n JSON.stringify(targetPolicy.avgRewards || {}),\n version + 1\n );\n\n transferred.skills = transferredQValues;\n }\n }\n\n return {\n success: true,\n transferred,\n source: { session: sourceSession, task: sourceTask },\n target: { session: targetSession, task: targetTask },\n minSimilarity,\n transferType,\n };\n }\n\n /**\n * Explain action recommendations with XAI (Explainable AI)\n */\n async explainAction(options: {\n query: string;\n k?: number;\n explainDepth?: 'summary' | 'detailed' | 'full';\n includeConfidence?: boolean;\n includeEvidence?: boolean;\n includeCausal?: boolean;\n }): Promise<any> {\n const {\n query,\n k = 5,\n explainDepth = 'detailed',\n includeConfidence = true,\n includeEvidence = true,\n includeCausal = true,\n } = options;\n\n // Get query embedding\n const queryEmbed = await this.embedder.embed(query);\n\n // Find similar past experiences\n const allExperiences = this.db.prepare(`\n SELECT * FROM learning_experiences\n ORDER BY timestamp DESC\n LIMIT 100\n `).all() as any[];\n\n const rankedExperiences: any[] = [];\n for (const exp of allExperiences) {\n const stateEmbed = await this.getStateEmbedding(exp.session_id, exp.state);\n const similarity = cosineSimilarity(queryEmbed, stateEmbed);\n\n rankedExperiences.push({\n ...exp,\n similarity,\n });\n }\n\n rankedExperiences.sort((a, b) => b.similarity - a.similarity);\n const topExperiences = rankedExperiences.slice(0, k);\n\n // Aggregate recommendations\n const actionScores: Record<string, { count: number; avgReward: number; successRate: number; evidence: any[] }> = {};\n\n for (const exp of topExperiences) {\n if (!actionScores[exp.action]) {\n actionScores[exp.action] = {\n count: 0,\n avgReward: 0,\n successRate: 0,\n evidence: [],\n };\n }\n\n const score = actionScores[exp.action];\n score.count++;\n score.avgReward += exp.reward;\n score.successRate += exp.success ? 1 : 0;\n\n if (includeEvidence) {\n score.evidence.push({\n episodeId: exp.id,\n state: exp.state,\n reward: exp.reward,\n success: exp.success,\n similarity: exp.similarity,\n timestamp: exp.timestamp,\n });\n }\n }\n\n // Calculate final scores\n const recommendations = Object.entries(actionScores).map(([action, data]) => ({\n action,\n confidence: data.count / topExperiences.length,\n avgReward: data.avgReward / data.count,\n successRate: data.successRate / data.count,\n supportingExamples: data.count,\n evidence: includeEvidence ? data.evidence.slice(0, 3) : undefined,\n }));\n\n recommendations.sort((a, b) => b.confidence - a.confidence);\n\n // Causal reasoning chains (if enabled)\n let causalChains: any[] = [];\n if (includeCausal) {\n causalChains = this.db.prepare(`\n SELECT * FROM causal_edges\n ORDER BY uplift DESC\n LIMIT 5\n `).all() as any[];\n }\n\n const response: any = {\n query,\n recommendations: recommendations.slice(0, k),\n explainDepth,\n };\n\n if (explainDepth === 'detailed' || explainDepth === 'full') {\n response.reasoning = {\n similarExperiencesFound: topExperiences.length,\n avgSimilarity: topExperiences.reduce((sum, e) => sum + e.similarity, 0) / topExperiences.length,\n uniqueActions: recommendations.length,\n };\n }\n\n if (explainDepth === 'full') {\n response.causalChains = causalChains;\n response.allEvidence = topExperiences;\n }\n\n return response;\n }\n\n /**\n * Record tool execution as experience for offline learning\n */\n async recordExperience(options: {\n sessionId: string;\n toolName: string;\n action: string;\n stateBefore?: any;\n stateAfter?: any;\n outcome: string;\n reward: number;\n success: boolean;\n latencyMs?: number;\n metadata?: any;\n }): Promise<number> {\n const {\n sessionId,\n toolName,\n action,\n stateBefore,\n stateAfter,\n outcome,\n reward,\n success,\n latencyMs,\n metadata,\n } = options;\n\n // Construct state representation\n const state = `tool:${toolName}|${action}`;\n const nextState = stateAfter ? JSON.stringify(stateAfter) : undefined;\n\n // Store as learning experience\n const result = this.db.prepare(`\n INSERT INTO learning_experiences (\n session_id, state, action, reward, next_state, success, timestamp, metadata\n ) VALUES (?, ?, ?, ?, ?, ?, ?, ?)\n `).run(\n sessionId,\n state,\n outcome,\n reward,\n nextState,\n success ? 1 : 0,\n Date.now(),\n JSON.stringify({\n toolName,\n action,\n stateBefore,\n stateAfter,\n latencyMs,\n ...metadata,\n })\n );\n\n console.log(`✅ Experience recorded: tool=${toolName}, reward=${reward}, success=${success}`);\n return result.lastInsertRowid as number;\n }\n\n /**\n * Calculate reward signal with shaping based on multiple factors\n */\n calculateReward(options: {\n episodeId?: number;\n success: boolean;\n targetAchieved?: boolean;\n efficiencyScore?: number;\n qualityScore?: number;\n timeTakenMs?: number;\n expectedTimeMs?: number;\n includeCausal?: boolean;\n rewardFunction?: 'standard' | 'sparse' | 'dense' | 'shaped';\n }): number {\n const {\n episodeId,\n success,\n targetAchieved = true,\n efficiencyScore = 0.5,\n qualityScore = 0.5,\n timeTakenMs,\n expectedTimeMs,\n includeCausal = true,\n rewardFunction = 'standard',\n } = options;\n\n let reward = 0;\n\n switch (rewardFunction) {\n case 'sparse':\n // Sparse: Only reward on success\n reward = success && targetAchieved ? 1.0 : 0.0;\n break;\n\n case 'dense':\n // Dense: Partial rewards for progress\n reward = success ? 1.0 : 0.0;\n reward += targetAchieved ? 0.5 : 0.0;\n reward += qualityScore * 0.3;\n reward += efficiencyScore * 0.2;\n break;\n\n case 'shaped':\n // Shaped: Reward shaping with time efficiency\n reward = success ? 1.0 : -0.5;\n if (targetAchieved) reward += 0.3;\n\n // Time efficiency bonus\n if (timeTakenMs && expectedTimeMs) {\n const timeRatio = timeTakenMs / expectedTimeMs;\n const timeBonus = Math.max(0, 1 - timeRatio) * 0.2;\n reward += timeBonus;\n }\n\n // Quality and efficiency\n reward += (qualityScore - 0.5) * 0.3;\n reward += (efficiencyScore - 0.5) * 0.2;\n break;\n\n case 'standard':\n default:\n // Standard: Weighted combination\n reward = success ? 0.6 : 0.0;\n reward += targetAchieved ? 0.2 : 0.0;\n reward += qualityScore * 0.1;\n reward += efficiencyScore * 0.1;\n break;\n }\n\n // Causal impact adjustment\n if (includeCausal && episodeId) {\n const causalEdges = this.db.prepare(`\n SELECT AVG(uplift) as avg_uplift\n FROM causal_edges\n WHERE from_memory_id = ? OR to_memory_id = ?\n `).get(episodeId, episodeId) as any;\n\n if (causalEdges?.avg_uplift) {\n reward += causalEdges.avg_uplift * 0.1; // 10% weight for causal impact\n }\n }\n\n // Normalize to [0, 1] range\n return Math.max(0, Math.min(1, reward));\n }\n\n}\n"]}

package/dist/packages/agentdb/src/controllers/MMRDiversityRanker.d.ts ADDED Viewed

@@ -0,0 +1,50 @@
+/**
+ * MMR (Maximal Marginal Relevance) Diversity Ranking
+ *
+ * Implements MMR algorithm to select diverse results that balance
+ * relevance to query with diversity from already-selected results.
+ *
+ * Formula: MMR = argmax [λ × Sim(Di, Q) - (1-λ) × max Sim(Di, Dj)]
+ *                Di∈R\S              Dj∈S
+ *
+ * Where:
+ * - Di = candidate document
+ * - Q = query
+ * - S = already selected documents
+ * - λ = balance parameter (0 = max diversity, 1 = max relevance)
+ */
+export interface MMROptions {
+    lambda?: number;
+    k?: number;
+    metric?: 'cosine' | 'euclidean' | 'dot';
+}
+export interface MMRCandidate {
+    id: number;
+    embedding: number[];
+    similarity: number;
+    [key: string]: any;
+}
+export declare class MMRDiversityRanker {
+    /**
+     * Select diverse results using MMR algorithm
+     *
+     * @param candidates - All candidate results with embeddings
+     * @param queryEmbedding - Query vector
+     * @param options - MMR configuration
+     * @returns Diverse subset of candidates
+     */
+    static selectDiverse(candidates: MMRCandidate[], queryEmbedding: number[], options?: MMROptions): MMRCandidate[];
+    /**
+     * Calculate similarity between two vectors
+     */
+    private static calculateSimilarity;
+    /**
+     * Calculate diversity score for a set of results
+     *
+     * @param results - Results to analyze
+     * @param metric - Similarity metric
+     * @returns Average pairwise distance (higher = more diverse)
+     */
+    static calculateDiversityScore(results: MMRCandidate[], metric?: 'cosine' | 'euclidean' | 'dot'): number;
+}
+//# sourceMappingURL=MMRDiversityRanker.d.ts.map

package/dist/packages/agentdb/src/controllers/MMRDiversityRanker.d.ts.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"MMRDiversityRanker.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/MMRDiversityRanker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,MAAM,WAAW,UAAU;IACzB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,MAAM,CAAC,EAAE,QAAQ,GAAG,WAAW,GAAG,KAAK,CAAC;CACzC;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;CACpB;AAED,qBAAa,kBAAkB;IAC7B;;;;;;;OAOG;IACH,MAAM,CAAC,aAAa,CAClB,UAAU,EAAE,YAAY,EAAE,EAC1B,cAAc,EAAE,MAAM,EAAE,EACxB,OAAO,GAAE,UAAe,GACvB,YAAY,EAAE;IAiEjB;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,mBAAmB;IA0ClC;;;;;;OAMG;IACH,MAAM,CAAC,uBAAuB,CAC5B,OAAO,EAAE,YAAY,EAAE,EACvB,MAAM,GAAE,QAAQ,GAAG,WAAW,GAAG,KAAgB,GAChD,MAAM;CAwBV"}

package/dist/packages/agentdb/src/controllers/MMRDiversityRanker.js ADDED Viewed

@@ -0,0 +1,130 @@
+/**
+ * MMR (Maximal Marginal Relevance) Diversity Ranking
+ *
+ * Implements MMR algorithm to select diverse results that balance
+ * relevance to query with diversity from already-selected results.
+ *
+ * Formula: MMR = argmax [λ × Sim(Di, Q) - (1-λ) × max Sim(Di, Dj)]
+ *                Di∈R\S              Dj∈S
+ *
+ * Where:
+ * - Di = candidate document
+ * - Q = query
+ * - S = already selected documents
+ * - λ = balance parameter (0 = max diversity, 1 = max relevance)
+ */
+export class MMRDiversityRanker {
+    /**
+     * Select diverse results using MMR algorithm
+     *
+     * @param candidates - All candidate results with embeddings
+     * @param queryEmbedding - Query vector
+     * @param options - MMR configuration
+     * @returns Diverse subset of candidates
+     */
+    static selectDiverse(candidates, queryEmbedding, options = {}) {
+        const lambda = options.lambda ?? 0.5;
+        const k = options.k ?? 10;
+        const metric = options.metric ?? 'cosine';
+        if (candidates.length === 0) {
+            return [];
+        }
+        if (candidates.length <= k) {
+            return candidates;
+        }
+        // Calculate initial similarities to query
+        const candidatesWithSim = candidates.map(c => ({
+            ...c,
+            similarity: c.similarity ?? this.calculateSimilarity(queryEmbedding, c.embedding, metric),
+        }));
+        const selected = [];
+        const remaining = [...candidatesWithSim];
+        // Select first item (highest relevance)
+        remaining.sort((a, b) => b.similarity - a.similarity);
+        selected.push(remaining.shift());
+        // Iteratively select items with highest MMR score
+        while (selected.length < k && remaining.length > 0) {
+            let maxMMR = -Infinity;
+            let maxIdx = 0;
+            for (let i = 0; i < remaining.length; i++) {
+                const candidate = remaining[i];
+                // Calculate max similarity to already-selected items
+                let maxSimToSelected = -Infinity;
+                for (const selectedItem of selected) {
+                    const sim = this.calculateSimilarity(candidate.embedding, selectedItem.embedding, metric);
+                    maxSimToSelected = Math.max(maxSimToSelected, sim);
+                }
+                // Calculate MMR score
+                const mmrScore = lambda * candidate.similarity - (1 - lambda) * maxSimToSelected;
+                if (mmrScore > maxMMR) {
+                    maxMMR = mmrScore;
+                    maxIdx = i;
+                }
+            }
+            // Add item with highest MMR score
+            selected.push(remaining.splice(maxIdx, 1)[0]);
+        }
+        return selected;
+    }
+    /**
+     * Calculate similarity between two vectors
+     */
+    static calculateSimilarity(vec1, vec2, metric) {
+        if (vec1.length !== vec2.length) {
+            throw new Error(`Vector dimension mismatch: ${vec1.length} vs ${vec2.length}`);
+        }
+        switch (metric) {
+            case 'cosine': {
+                let dot = 0, mag1 = 0, mag2 = 0;
+                for (let i = 0; i < vec1.length; i++) {
+                    dot += vec1[i] * vec2[i];
+                    mag1 += vec1[i] * vec1[i];
+                    mag2 += vec2[i] * vec2[i];
+                }
+                return dot / (Math.sqrt(mag1) * Math.sqrt(mag2));
+            }
+            case 'euclidean': {
+                let sum = 0;
+                for (let i = 0; i < vec1.length; i++) {
+                    const diff = vec1[i] - vec2[i];
+                    sum += diff * diff;
+                }
+                return 1 / (1 + Math.sqrt(sum)); // Normalized to 0-1
+            }
+            case 'dot': {
+                let dot = 0;
+                for (let i = 0; i < vec1.length; i++) {
+                    dot += vec1[i] * vec2[i];
+                }
+                return dot;
+            }
+            default:
+                throw new Error(`Unknown metric: ${metric}`);
+        }
+    }
+    /**
+     * Calculate diversity score for a set of results
+     *
+     * @param results - Results to analyze
+     * @param metric - Similarity metric
+     * @returns Average pairwise distance (higher = more diverse)
+     */
+    static calculateDiversityScore(results, metric = 'cosine') {
+        if (results.length < 2) {
+            return 1.0; // Single result is maximally diverse
+        }
+        let totalDistance = 0;
+        let comparisons = 0;
+        for (let i = 0; i < results.length; i++) {
+            for (let j = i + 1; j < results.length; j++) {
+                const similarity = this.calculateSimilarity(results[i].embedding, results[j].embedding, metric);
+                // Convert similarity to distance
+                const distance = metric === 'cosine' ? 1 - similarity : similarity;
+                totalDistance += distance;
+                comparisons++;
+            }
+        }
+        return comparisons > 0 ? totalDistance / comparisons : 0;
+    }
+}
+//# sourceMappingURL=MMRDiversityRanker.js.map

package/dist/packages/agentdb/src/controllers/MMRDiversityRanker.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"MMRDiversityRanker.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/MMRDiversityRanker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAeH,MAAM,OAAO,kBAAkB;IAC7B;;;;;;;OAOG;IACH,MAAM,CAAC,aAAa,CAClB,UAA0B,EAC1B,cAAwB,EACxB,UAAsB,EAAE;QAExB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,GAAG,CAAC;QACrC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC;QAE1C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC3B,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,0CAA0C;QAC1C,MAAM,iBAAiB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7C,GAAG,CAAC;YACJ,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,mBAAmB,CAClD,cAAc,EACd,CAAC,CAAC,SAAS,EACX,MAAM,CACP;SACF,CAAC,CAAC,CAAC;QAEJ,MAAM,QAAQ,GAAmB,EAAE,CAAC;QACpC,MAAM,SAAS,GAAG,CAAC,GAAG,iBAAiB,CAAC,CAAC;QAEzC,wCAAwC;QACxC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QACtD,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAG,CAAC,CAAC;QAElC,kDAAkD;QAClD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnD,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;YACvB,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAE/B,qDAAqD;gBACrD,IAAI,gBAAgB,GAAG,CAAC,QAAQ,CAAC;gBACjC,KAAK,MAAM,YAAY,IAAI,QAAQ,EAAE,CAAC;oBACpC,MAAM,GAAG,GAAG,IAAI,CAAC,mBAAmB,CAClC,SAAS,CAAC,SAAS,EACnB,YAAY,CAAC,SAAS,EACtB,MAAM,CACP,CAAC;oBACF,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC;gBACrD,CAAC;gBAED,sBAAsB;gBACtB,MAAM,QAAQ,GAAG,MAAM,GAAG,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,gBAAgB,CAAC;gBAEjF,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;oBACtB,MAAM,GAAG,QAAQ,CAAC;oBAClB,MAAM,GAAG,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;YAED,kCAAkC;YAClC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,mBAAmB,CAChC,IAAc,EACd,IAAc,EACd,MAAsC;QAEtC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,8BAA8B,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACjF,CAAC;QAED,QAAQ,MAAM,EAAE,CAAC;YACf,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;oBACzB,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC1B,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5B,CAAC;gBACD,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACnD,CAAC;YAED,KAAK,WAAW,CAAC,CAAC,CAAC;gBACjB,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC/B,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;gBACrB,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,oBAAoB;YACxD,CAAC;YAED,KAAK,KAAK,CAAC,CAAC,CAAC;gBACX,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC;gBACD,OAAO,GAAG,CAAC;YACb,CAAC;YAED;gBACE,MAAM,IAAI,KAAK,CAAC,mBAAmB,MAAM,EAAE,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,uBAAuB,CAC5B,OAAuB,EACvB,SAAyC,QAAQ;QAEjD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,GAAG,CAAC,CAAE,qCAAqC;QACpD,CAAC;QAED,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CACzC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,EACpB,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,EACpB,MAAM,CACP,CAAC;gBACF,iCAAiC;gBACjC,MAAM,QAAQ,GAAG,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;gBACnE,aAAa,IAAI,QAAQ,CAAC;gBAC1B,WAAW,EAAE,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;CACF","sourcesContent":["/**\n * MMR (Maximal Marginal Relevance) Diversity Ranking\n *\n * Implements MMR algorithm to select diverse results that balance\n * relevance to query with diversity from already-selected results.\n *\n * Formula: MMR = argmax [λ × Sim(Di, Q) - (1-λ) × max Sim(Di, Dj)]\n * Di∈R\\S Dj∈S\n *\n * Where:\n * - Di = candidate document\n * - Q = query\n * - S = already selected documents\n * - λ = balance parameter (0 = max diversity, 1 = max relevance)\n */\n\nexport interface MMROptions {\n lambda?: number; // Balance between relevance and diversity (default: 0.5)\n k?: number; // Number of results to return (default: 10)\n metric?: 'cosine' | 'euclidean' | 'dot'; // Similarity metric\n}\n\nexport interface MMRCandidate {\n id: number;\n embedding: number[];\n similarity: number; // Similarity to query\n [key: string]: any; // Additional data\n}\n\nexport class MMRDiversityRanker {\n /**\n * Select diverse results using MMR algorithm\n *\n * @param candidates - All candidate results with embeddings\n * @param queryEmbedding - Query vector\n * @param options - MMR configuration\n * @returns Diverse subset of candidates\n */\n static selectDiverse(\n candidates: MMRCandidate[],\n queryEmbedding: number[],\n options: MMROptions = {}\n ): MMRCandidate[] {\n const lambda = options.lambda ?? 0.5;\n const k = options.k ?? 10;\n const metric = options.metric ?? 'cosine';\n\n if (candidates.length === 0) {\n return [];\n }\n\n if (candidates.length <= k) {\n return candidates;\n }\n\n // Calculate initial similarities to query\n const candidatesWithSim = candidates.map(c => ({\n ...c,\n similarity: c.similarity ?? this.calculateSimilarity(\n queryEmbedding,\n c.embedding,\n metric\n ),\n }));\n\n const selected: MMRCandidate[] = [];\n const remaining = [...candidatesWithSim];\n\n // Select first item (highest relevance)\n remaining.sort((a, b) => b.similarity - a.similarity);\n selected.push(remaining.shift()!);\n\n // Iteratively select items with highest MMR score\n while (selected.length < k && remaining.length > 0) {\n let maxMMR = -Infinity;\n let maxIdx = 0;\n\n for (let i = 0; i < remaining.length; i++) {\n const candidate = remaining[i];\n\n // Calculate max similarity to already-selected items\n let maxSimToSelected = -Infinity;\n for (const selectedItem of selected) {\n const sim = this.calculateSimilarity(\n candidate.embedding,\n selectedItem.embedding,\n metric\n );\n maxSimToSelected = Math.max(maxSimToSelected, sim);\n }\n\n // Calculate MMR score\n const mmrScore = lambda * candidate.similarity - (1 - lambda) * maxSimToSelected;\n\n if (mmrScore > maxMMR) {\n maxMMR = mmrScore;\n maxIdx = i;\n }\n }\n\n // Add item with highest MMR score\n selected.push(remaining.splice(maxIdx, 1)[0]);\n }\n\n return selected;\n }\n\n /**\n * Calculate similarity between two vectors\n */\n private static calculateSimilarity(\n vec1: number[],\n vec2: number[],\n metric: 'cosine' | 'euclidean' | 'dot'\n ): number {\n if (vec1.length !== vec2.length) {\n throw new Error(`Vector dimension mismatch: ${vec1.length} vs ${vec2.length}`);\n }\n\n switch (metric) {\n case 'cosine': {\n let dot = 0, mag1 = 0, mag2 = 0;\n for (let i = 0; i < vec1.length; i++) {\n dot += vec1[i] * vec2[i];\n mag1 += vec1[i] * vec1[i];\n mag2 += vec2[i] * vec2[i];\n }\n return dot / (Math.sqrt(mag1) * Math.sqrt(mag2));\n }\n\n case 'euclidean': {\n let sum = 0;\n for (let i = 0; i < vec1.length; i++) {\n const diff = vec1[i] - vec2[i];\n sum += diff * diff;\n }\n return 1 / (1 + Math.sqrt(sum)); // Normalized to 0-1\n }\n\n case 'dot': {\n let dot = 0;\n for (let i = 0; i < vec1.length; i++) {\n dot += vec1[i] * vec2[i];\n }\n return dot;\n }\n\n default:\n throw new Error(`Unknown metric: ${metric}`);\n }\n }\n\n /**\n * Calculate diversity score for a set of results\n *\n * @param results - Results to analyze\n * @param metric - Similarity metric\n * @returns Average pairwise distance (higher = more diverse)\n */\n static calculateDiversityScore(\n results: MMRCandidate[],\n metric: 'cosine' | 'euclidean' | 'dot' = 'cosine'\n ): number {\n if (results.length < 2) {\n return 1.0; // Single result is maximally diverse\n }\n\n let totalDistance = 0;\n let comparisons = 0;\n\n for (let i = 0; i < results.length; i++) {\n for (let j = i + 1; j < results.length; j++) {\n const similarity = this.calculateSimilarity(\n results[i].embedding,\n results[j].embedding,\n metric\n );\n // Convert similarity to distance\n const distance = metric === 'cosine' ? 1 - similarity : similarity;\n totalDistance += distance;\n comparisons++;\n }\n }\n\n return comparisons > 0 ? totalDistance / comparisons : 0;\n }\n}\n"]}

package/dist/packages/agentdb/src/controllers/MemoryConsolidation.d.ts ADDED Viewed

@@ -0,0 +1,142 @@
+/**
+ * MemoryConsolidation - Nightly Memory Processing
+ *
+ * Implements automatic memory consolidation from episodic to semantic memory
+ * using spaced repetition and importance scoring.
+ *
+ * Based on:
+ * - Complementary Learning Systems (McClelland et al., 1995)
+ * - Active Systems Consolidation (Diekelmann & Born, 2010)
+ * - Spaced Repetition (Ebbinghaus, 1885)
+ *
+ * Process:
+ * 1. Identify consolidation candidates (high importance + multiple accesses)
+ * 2. Cluster similar episodic memories
+ * 3. Extract semantic patterns (abstractions)
+ * 4. Promote to semantic memory
+ * 5. Apply forgetting to low-value episodic memories
+ * 6. Schedule spaced repetition for important memories
+ *
+ * ADR-066 Phase P2-3
+ */
+import type { VectorBackend } from '../backends/VectorBackend.js';
+import type { GraphBackend } from '../backends/GraphBackend.js';
+import { HierarchicalMemory } from './HierarchicalMemory.js';
+import { EmbeddingService } from './EmbeddingService.js';
+type Database = any;
+/** Consolidation result report */
+export interface ConsolidationReport {
+    timestamp: number;
+    executionTimeMs: number;
+    episodicProcessed: number;
+    semanticCreated: number;
+    memoriesForgotten: number;
+    clustersFormed: number;
+    avgImportance: number;
+    retentionRate: number;
+    recommendations: string[];
+}
+export interface ConsolidationConfig {
+    /** Minimum similarity for clustering (0-1) */
+    clusterThreshold: number;
+    /** Minimum cluster size for semantic extraction */
+    minClusterSize: number;
+    /** Maximum cluster size before splitting */
+    maxClusterSize: number;
+    /** Importance threshold for consolidation */
+    importanceThreshold: number;
+    /** Minimum access count for consolidation */
+    minAccessCount: number;
+    /** Enable spaced repetition */
+    enableSpacedRepetition: boolean;
+    /** Initial repetition interval (ms) */
+    initialInterval: number;
+    /** Interval multiplier for successful recall */
+    intervalMultiplier: number;
+    /** Forgetting threshold (retention below this = forget) */
+    forgettingThreshold: number;
+}
+export declare class MemoryConsolidation {
+    private db;
+    private hierarchicalMemory;
+    private embedder;
+    private vectorBackend?;
+    private graphBackend?;
+    private config;
+    private repetitionSchedules;
+    constructor(db: Database, hierarchicalMemory: HierarchicalMemory, embedder: EmbeddingService, vectorBackend?: VectorBackend, graphBackend?: GraphBackend, config?: Partial<ConsolidationConfig>);
+    /**
+     * Initialize database tables for consolidation tracking
+     */
+    private initializeDatabase;
+    /**
+     * Run nightly consolidation process
+     */
+    consolidate(): Promise<ConsolidationReport>;
+    /**
+     * Get episodic memories that are candidates for consolidation
+     */
+    private getConsolidationCandidates;
+    /**
+     * Cluster similar memories using hierarchical clustering
+     */
+    private clusterMemories;
+    /**
+     * Update cluster centroid (simple average)
+     */
+    private updateCentroid;
+    /**
+     * Create semantic memory from cluster
+     */
+    private createSemanticMemory;
+    /**
+     * Extract semantic pattern from cluster
+     */
+    private extractSemanticPattern;
+    /**
+     * Extract common tags from cluster members
+     */
+    private extractCommonTags;
+    /**
+     * Mark episodic memory as consolidated
+     */
+    private markConsolidated;
+    /**
+     * Apply forgetting curve and delete low-value memories
+     */
+    private applyForgettingCurve;
+    /**
+     * Calculate retention using Ebbinghaus forgetting curve
+     */
+    private calculateRetention;
+    /**
+     * Schedule spaced repetition for memories
+     */
+    private scheduleSpacedRepetition;
+    /**
+     * Update repetition schedule after review
+     */
+    private updateRepetitionSchedule;
+    /**
+     * Save repetition schedule to database
+     */
+    private saveRepetitionSchedule;
+    /**
+     * Load repetition schedules from database
+     */
+    private loadRepetitionSchedules;
+    /**
+     * Generate recommendations based on consolidation report
+     */
+    private generateRecommendations;
+    /**
+     * Log consolidation to database
+     */
+    private logConsolidation;
+    /**
+     * Get consolidation history
+     */
+    getConsolidationHistory(limit?: number): Promise<ConsolidationReport[]>;
+}
+export {};
+//# sourceMappingURL=MemoryConsolidation.d.ts.map

package/dist/packages/agentdb/src/controllers/MemoryConsolidation.d.ts.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"MemoryConsolidation.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/MemoryConsolidation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAClE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,EAAE,kBAAkB,EAAoC,MAAM,yBAAyB,CAAC;AAC/F,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAIzD,KAAK,QAAQ,GAAG,GAAG,CAAC;AAEpB,kCAAkC;AAClC,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B;AAoBD,MAAM,WAAW,mBAAmB;IAClC,8CAA8C;IAC9C,gBAAgB,EAAE,MAAM,CAAC;IACzB,mDAAmD;IACnD,cAAc,EAAE,MAAM,CAAC;IACvB,4CAA4C;IAC5C,cAAc,EAAE,MAAM,CAAC;IACvB,6CAA6C;IAC7C,mBAAmB,EAAE,MAAM,CAAC;IAC5B,6CAA6C;IAC7C,cAAc,EAAE,MAAM,CAAC;IACvB,+BAA+B;IAC/B,sBAAsB,EAAE,OAAO,CAAC;IAChC,uCAAuC;IACvC,eAAe,EAAE,MAAM,CAAC;IACxB,gDAAgD;IAChD,kBAAkB,EAAE,MAAM,CAAC;IAC3B,2DAA2D;IAC3D,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,EAAE,CAAW;IACrB,OAAO,CAAC,kBAAkB,CAAqB;IAC/C,OAAO,CAAC,QAAQ,CAAmB;IACnC,OAAO,CAAC,aAAa,CAAC,CAAgB;IACtC,OAAO,CAAC,YAAY,CAAC,CAAe;IACpC,OAAO,CAAC,MAAM,CAAsB;IAGpC,OAAO,CAAC,mBAAmB,CAAyC;gBAGlE,EAAE,EAAE,QAAQ,EACZ,kBAAkB,EAAE,kBAAkB,EACtC,QAAQ,EAAE,gBAAgB,EAC1B,aAAa,CAAC,EAAE,aAAa,EAC7B,YAAY,CAAC,EAAE,YAAY,EAC3B,MAAM,CAAC,EAAE,OAAO,CAAC,mBAAmB,CAAC;IAyBvC;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAyB1B;;OAEG;IACG,WAAW,IAAI,OAAO,CAAC,mBAAmB,CAAC;IAuFjD;;OAEG;YACW,0BAA0B;IAiCxC;;OAEG;YACW,eAAe;IA6C7B;;OAEG;IACH,OAAO,CAAC,cAAc;IAiBtB;;OAEG;YACW,oBAAoB;IAoClC;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAiB9B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAkBzB;;OAEG;YACW,gBAAgB;IAS9B;;OAEG;YACW,oBAAoB;IAsBlC;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAkB1B;;OAEG;YACW,wBAAwB;IA2BtC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAmBhC;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAc9B;;OAEG;IACH,OAAO,CAAC,uBAAuB;IAc/B;;OAEG;IACH,OAAO,CAAC,uBAAuB;IA0B/B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAiBxB;;OAEG;IACG,uBAAuB,CAAC,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC;CAmBlF"}