@lakutata/orm 3.0.0 → 3.1.0

package/dist/vendor/typeorm/driver/mongo-embedded/EmbeddedBTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EmbeddedBTree.js","sourceRoot":"","sources":["../../../../../vendor/typeorm/driver/mongo-embedded/EmbeddedBTree.ts"],"names":[],"mappings":";;;AAAA,2DAAuD;AAEvD;;GAEG;AACH,MAAM,IAAI,GAAG,IAAI,CAAA;AAEjB;;GAEG;AACH,MAAM,eAAe,GAAG,GAAG,CAAA,CAAC,4CAA4C;AAExE;;;GAGG;AACH,MAAM,MAAM,GAAG,EAAE,CAAA;AAEjB;;GAEG;AACH,MAAM,IAAI,GAAG,UAAU,CAAA;AAEvB,MAAM,IAAI,GAAG,CAAC,CAAA;AAEd,MAAM,QAAQ,GAAG,CAAC,CAAA;AAElB;;GAEG;AACH,MAAM,QAAQ,GAAG,IAAI,GAAG,MAAM,CAAA;AAE9B;;;;GAIG;AACH,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;AAElD;;;GAGG;AACH,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;AAmB3C;;;;;;GAMG;AACH,MAAa,aAAa;IAWtB;QAVU,WAAM,GAAa,EAAE,CAAA;QAErB,UAAK,GAAG,CAAC,CAAA;QAET,SAAI,GAAa,EAAE,CAAA;QAInB,UAAK,GAAG,CAAC,CAAA;QAGf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IACnC,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,KAAK,CAAA;IACrB,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,IAAI,CAAC,GAAe,EAAE,EAAc;QACvC,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,IAAI,EAAE,CAAC,MAAM,IAAI,GAAG,CAAA;IAC9E,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,GAAe,EAAE,EAAc;QAClC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,2BAAY,CAClB,uDAAuD,GAAG,CAAC,MAAM,QAAQ,CAC5E,CAAA;QACL,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACf,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;QACvC,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;QAC/C,IACI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;YAC7B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC;YAE7C,OAAO,KAAK,CAAA;QAChB,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE;YACtC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;YACrB,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;SACtB,CAAC,CAAA;QACF,OAAO,KAAK,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;YACzB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;gBACpC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;gBAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;gBAChB,MAAK;YACT,CAAC;YACD,KAAK,GAAG,IAAI,CAAC,QAAQ,CACjB,MAAM,EACN,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC,EAC5C,KAAK,CACR,CAAA;QACL,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAA;QACZ,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,GAAe,EAAE,EAAc;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;QAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;QAC/C,IACI,QAAQ,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC;YAE7C,OAAO,KAAK,CAAA;QAChB,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;QAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAA;QAChE,MAAM,CAAC,UAAU,CACb,IAAI,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,EAC5B,IAAI,GAAG,MAAM,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,EAClC,IAAI,GAAG,MAAM,GAAG,KAAK,GAAG,CAAC,CAC5B,CAAA;QACD,MAAM,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;QACzC,MAAM,CAAC,aAAa,CAChB,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,GAAG,MAAM,EAAE,KAAK,CAAC,EACzE,IAAI,GAAG,CAAC,CACX,CAAA;QACD,IAAI,CAAC,KAAK,EAAE,CAAA;QACZ,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,GAAe,EAAE,EAAc;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;QAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;QAC/C,OAAO,CACH,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;YAC7B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,CAChD,CAAA;IACL,CAAC;IAED;;;;;;OAMG;IACH,CAAC,KAAK,CACF,KAAqB,EACrB,KAAqB,EACrB,OAAO,GAAG,KAAK;QAEf,IAAI,CAAC,OAAO,EAAE,CAAC;YACX,IAAI,IAAI,GAAG,KAAK;gBACZ,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;gBAC1E,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAA;YACtB,IAAI,QAAQ,GAAG,KAAK;gBAChB,CAAC,CAAC,IAAI,CAAC,UAAU,CACX,IAAI,EACJ,KAAK,CAAC,GAAG,EACT,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAClD;gBACH,CAAC,CAAC,CAAC,CAAA;YACP,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;gBACnB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;gBAChC,OAAO,QAAQ,GAAG,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC;oBAClC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;oBAC1C,IAAI,KAAK,EAAE,CAAC;wBACR,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;wBAClD,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;4BAAE,OAAM;oBAC9D,CAAC;oBACD,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC,CAAA;gBAC/B,CAAC;gBACD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACxB,QAAQ,GAAG,CAAC,CAAA;YAChB,CAAC;YACD,OAAM;QACV,CAAC;QACD,IAAI,IAAI,GAAG,KAAK;YACZ,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1E,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAA;QACrB,IAAI,QAAQ,GACR,CAAC,KAAK;YACF,CAAC,CAAC,IAAI,CAAC,UAAU,CACX,IAAI,EACJ,KAAK,CAAC,GAAG,EACT,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAClD;YACH,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QACjC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACnB,OAAO,QAAQ,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;gBAC1C,IAAI,KAAK,EAAE,CAAC;oBACR,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;oBAClD,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;wBAAE,OAAM;gBAC9D,CAAC;gBACD,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC,CAAA;YAC/B,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;YAC5B,IAAI,IAAI,KAAK,IAAI;gBAAE,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACxD,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,CAAC,QAAQ,CAAC,MAAkB;QACxB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;YAC/D,IACI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;gBAC/B,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;gBAElE,OAAM;YACV,MAAM,KAAK,CAAA;QACf,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,MAAM;QACF,qCAAqC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,eAAe,CAAA;QACpE,OAAO;YACH,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC9D,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CACtC,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;gBAC5B,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC;gBAChC,CAAC,CAAC,KAAK,CACd;SACJ,CAAA;IACL,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,MAAM,CAAC,KAAe,EAAE,OAAqB;QAChD,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,KAAK,CAAA;QAC1C,MAAM,IAAI,GAAG,IAAI,aAAa,EAAE,CAAA;QAChC,IAAI,CAAC,MAAM,GAAG,OAAO;aAChB,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC;aAChB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACX,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAChE,CAAA;QACL,+CAA+C;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;QACnC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,GAAG,eAAe,EAAE,CAAC;YACjE,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,eAAe,CAAC,CAAA;YACxD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAA;QAC7B,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAA;QACd,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,MAAM,GAAG,EAAE,CAAA;QAChB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,EAAE,CAAA;QACd,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IACnC,CAAC;IAED;;;;;;OAMG;IACO,QAAQ,CACd,IAAY,EACZ,QAAgB,EAChB,KAAY;QAEZ,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAA;QAC/C,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACxE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACtC,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,CAAA;QACjE,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACtE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CACvC;YAAA,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACvC,CAAC;QACD,IACI,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;YACpD,IAAI,GAAG,CAAC,EACV,CAAC;YACC,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;YACnD,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,GAAG,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;YACvD,MAAM,CAAC,UAAU,CACb,IAAI,GAAG,MAAM,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,EAClC,IAAI,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,EAC5B,IAAI,GAAG,MAAM,GAAG,KAAK,GAAG,CAAC,CAC5B,CAAA;YACD,MAAM,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAA;YAC1D,MAAM,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;YACzC,MAAM,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;YACtC,OAAO,SAAS,CAAA;QACpB,CAAC;QACD,4GAA4G;QAC5G,0GAA0G;QAC1G,0GAA0G;QAC1G,4CAA4C;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;QACpC,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACzD,IAAI,QAAQ,EAAE,CAAC;YACX,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;YAC1B,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAA;YAC5C,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,KAAM,CAAC,CAAA;YACjC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;YAChD,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;QACrD,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAA;QAC5C,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAA;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAClC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAA;QACnD,IAAI,IAAI,KAAK,IAAI;YAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAA;QAClE,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;IAC/E,CAAC;IAED;;;;;;;;OAQG;IACO,QAAQ,CAAC,OAAgB,EAAE,QAAiB;QAClD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CACrB,CAAC,KAAK,EAAE,EAAE,CACN,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACtE,CAAA;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC,CAAC,CAAA;QACxD,IAAI,MAAM,GAAG,CAAC,CAAC,CAAA;QACf,IAAI,UAAU,GAAG,QAAQ,CAAA;QACzB,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,0EAA0E;QAC1E,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/C,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;YAC7B,MAAM,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC/D,IAAI,MAAM,GAAG,QAAQ,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAQ;YACnD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,UAAU,EAAE,CAAC;gBACxC,MAAM,GAAG,QAAQ,CAAA;gBACjB,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAA;YACzC,CAAC;QACL,CAAC;QACD,IAAI,MAAM,GAAG,CAAC;YACV,MAAM,IAAI,2BAAY,CAClB,+EAA+E,CAClF,CAAA;QACL,OAAO,MAAM,CAAA;IACjB,CAAC;IAED;;;;;;OAMG;IACO,OAAO,CAAC,IAAY,EAAE,OAAgB;QAC5C,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAA;QAC1C,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,KAAK,MAAM,KAAK,IAAI,OAAO;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5E,IAAI,KAAK,GAAG,QAAQ;YAChB,MAAM,IAAI,2BAAY,CAClB,6EAA6E,CAChF,CAAA;QACL,IAAI,GAAG,GAAG,IAAI,CAAA;QACd,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAC7B,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAClE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,GAAG,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;YACpD,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,IAAI,GAAG,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,CAAA;QACxD,CAAC,CAAC,CAAA;QACF,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;QAC9C,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;QACnC,MAAM,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;IACrC,CAAC;IAES,UAAU,CAChB,MAAc,EACd,EAAU,EACV,KAAY,EACZ,QAAiB;QAEjB,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;QAC1C,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,MAAM,CAAA;QAChC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,CAAA;QAC7B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC/C,IAAI,QAAQ;YACR,MAAM,CAAC,aAAa,CAChB,KAAK,CAAC,KAAM,EACZ,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,MAAM,CAC9C,CAAA;IACT,CAAC;IAES,SAAS,CAAC,IAAY;QAC5B,MAAM,OAAO,GAAY,EAAE,CAAA;QAC3B,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE;YAC5D,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAA;QAC9C,OAAO,OAAO,CAAA;IAClB,CAAC;IAED;;;;;OAKG;IACO,OAAO,CAAC,IAAY,EAAE,QAAgB;QAC5C,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,EAAE,GAAG,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAA;QACnE,MAAM,SAAS,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAA;QACzC,MAAM,QAAQ,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAA;QACpE,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAClB,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS,EAAE,EAAE,GAAG,CAAC,GAAG,SAAS,GAAG,QAAQ,CAAC,CACrE,CAAA;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ;YAC5B,CAAC,CAAC;gBACI,GAAG,EAAE,GAAG;gBACR,EAAE,EAAE,EAAE;gBACN,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS,GAAG,QAAQ,CAAC;aAC5D;YACH,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAA;IAC9B,CAAC;IAES,MAAM,CAAC,MAAc,EAAE,EAAU,EAAE,QAAiB;QAC1D,OAAO,CACH,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACpE,CAAA;IACL,CAAC;IAED;;;;;;;OAOG;IACO,SAAS,CACf,IAAY,EACZ,QAAgB,EAChB,GAAe,EACf,EAAc;QAEd,kFAAkF;QAClF,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAA;QACtC,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,CAAA;QAChC,MAAM,IAAI,GAAG,IAAI,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAA;QACzC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1D,MAAM,SAAS,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QACpD,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,CAAA;QACvB,MAAM,OAAO,GAAG,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAA;QAC/D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;YAC3C,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAA;YACxD,IAAI,UAAU,KAAK,CAAC;gBAAE,OAAO,UAAU,CAAA;QAC3C,CAAC;QACD,IAAI,SAAS,KAAK,GAAG,CAAC,MAAM;YAAE,OAAO,SAAS,GAAG,GAAG,CAAC,MAAM,CAAA;QAC3D,MAAM,OAAO,GAAG,QAAQ,GAAG,SAAS,CAAA;QACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QAC/B,MAAM,SAAS,GAAG,QAAQ,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAA;QAC7D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;YAC7C,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAA;YACtD,IAAI,UAAU,KAAK,CAAC;gBAAE,OAAO,UAAU,CAAA;QAC3C,CAAC;QACD,OAAO,QAAQ,GAAG,EAAE,CAAC,MAAM,CAAA;IAC/B,CAAC;IAED;;OAEG;IACO,UAAU,CAAC,IAAY,EAAE,GAAe,EAAE,EAAc;QAC9D,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QAC7B,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;YAChC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC;gBAAE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAA;;gBAC1D,IAAI,GAAG,MAAM,CAAA;QACtB,CAAC;QACD,OAAO,GAAG,CAAA;IACd,CAAC;IAED;;OAEG;IACO,UAAU,CAAC,IAAY,EAAE,GAAe,EAAE,EAAc;QAC9D,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QAC7B,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;YAChC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC;gBAAE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAA;;gBAC3D,IAAI,GAAG,MAAM,CAAA;QACtB,CAAC;QACD,OAAO,GAAG,CAAA;IACd,CAAC;IAED;;OAEG;IACO,QAAQ,CAAC,IAAY,EAAE,GAAe,EAAE,EAAc;QAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;QAC/C,OAAO,QAAQ,KAAK,CAAC;YACjB,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;YACpB,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAA;IAC7C,CAAC;IAES,OAAO,CAAC,GAAe,EAAE,EAAc;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ;YAAE,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;QAC1E,OAAO,IAAI,CAAA;IACf,CAAC;IAES,SAAS;QACf,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ;YAAE,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QAChE,OAAO,IAAI,CAAA;IACf,CAAC;IAES,QAAQ;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,QAAQ;YACjC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;QACxD,OAAO,IAAI,CAAA;IACf,CAAC;IAES,UAAU,CAAC,IAAY,EAAE,QAAgB;QAC/C,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,EAAE,GAAG,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAA;QACnE,OAAO,MAAM,CAAC,YAAY,CACtB,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CACpD,CAAA;IACL,CAAC;IAES,QAAQ,CAAC,IAAY;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAA;QAC5C,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,eAAe,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YACxD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,eAAe,CAAC,CAAC,CAAA;QAChE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;QACnB,MAAM,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;QACjC,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;QACjC,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;QACrC,OAAO,IAAI,CAAA;IACf,CAAC;IAES,MAAM,CAAC,IAAY;QACzB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAA;IACzD,CAAC;IAES,MAAM,CAAC,IAAY;QACzB,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAA;IACvD,CAAC;IAES,OAAO,CAAC,IAAY;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAA;QACtC,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,CAAA;QAChC,OAAO,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IACrD,CAAC;IAES,MAAM,CAAC,IAAY;QACzB,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;IACxC,CAAC;IAES,UAAU,CAAC,IAAY;QAC7B,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,GAAG,EAAE,CAAC,CAAA;IACzC,CAAC;IAES,OAAO,CAAC,IAAY;QAC1B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;IAChC,CAAC;IAES,QAAQ,CAAC,IAAY,EAAE,KAAa;QAC1C,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;IAC1C,CAAC;IAES,QAAQ,CAAC,IAAY,EAAE,IAAY,EAAE,QAAgB;QAC3D,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,aAAa,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;IAC7C,CAAC;CACJ;AAjlBD,sCAilBC","sourcesContent":["import { TypeORMError } from \"../../error/TypeORMError\"\n\n/**\n * lakutata: the size of a page.\n */\nconst PAGE = 4096\n\n/**\n * lakutata: the pages of a chunk of the memory of a tree (2 MiB).\n */\nconst PAGES_PER_CHUNK = 512 // the pages are located by shifts of 9 bits\n\n/**\n * lakutata: the size of the header of a page: its type (1 byte, then 1 unused), its number of entries (2), the start\n * of its entries (2), the bytes of its entries removed (2), its next leaf (4), its previous leaf or its first child (4).\n */\nconst HEADER = 16\n\n/**\n * lakutata: no page.\n */\nconst NONE = 0xffffffff\n\nconst LEAF = 1\n\nconst INTERNAL = 2\n\n/**\n * lakutata: the bytes of a page for its entries and their directory.\n */\nconst CAPACITY = PAGE - HEADER\n\n/**\n * lakutata: the largest entry (in an internal page): with its offset in the directory, a quarter of a page at most. A\n * page split by the bytes of its entries (middleOf) then leaves two halves each fitting a page, whatever the sizes of\n * its entries.\n */\nconst MAXIMUM_ENTRY = Math.floor(CAPACITY / 4) - 2\n\n/**\n * lakutata: an id greater than any (the ids have up to 255 bytes). With the empty id, it turns a bound of keys into a\n * bound of entries (a key, then an id): before or after all the entries of its key.\n */\nconst GREATEST_ID = Buffer.alloc(256, 0xff)\n\n/**\n * lakutata: a bound of a range of keys.\n */\nexport interface EmbeddedBound {\n    key: Uint8Array\n    inclusive: boolean\n}\n\n/**\n * lakutata: an entry read from a page.\n */\ninterface Entry {\n    key: Buffer\n    id: Buffer\n    child?: number\n}\n\n/**\n * lakutata: an ordered index of entries (a key, then the id of a document), in a B+tree whose pages are slices of\n * buffers outside the heap of V8. A page holds a directory of the offsets of its entries (in their order) after its\n * header, and its entries from its end: their key length (2 bytes), id length (1 byte), key, id, and in an internal\n * page the child (4 bytes) holding the entries from it. The leaves are linked both ways. A removal leaves its page as\n * it is (its pages are not merged).\n */\nexport class EmbeddedBTree {\n    protected chunks: Buffer[] = []\n\n    protected pages = 0\n\n    protected free: number[] = []\n\n    protected root: number\n\n    protected count = 0\n\n    constructor() {\n        this.root = this.allocate(LEAF)\n    }\n\n    /**\n     * The number of entries.\n     */\n    get size(): number {\n        return this.count\n    }\n\n    /**\n     * Whether an entry fits a tree: its key and id of MAXIMUM_ENTRY bytes at most, with their sizes and a child (in an\n     * internal page, where a split of its leaf may copy it).\n     *\n     * @param key\n     * @param id\n     */\n    static fits(key: Uint8Array, id: Uint8Array): boolean {\n        return 3 + key.length + id.length + 4 <= MAXIMUM_ENTRY && id.length <= 255\n    }\n\n    /**\n     * Adds an entry; false when it exists. An entry not fitting the tree (fits) throws, the tree unchanged.\n     *\n     * @param key\n     * @param id\n     */\n    insert(key: Uint8Array, id: Uint8Array): boolean {\n        if (!EmbeddedBTree.fits(key, id))\n            throw new TypeORMError(\n                `The key of an index of mongo-embedded is too large: ${key.length} bytes`,\n            )\n        const path: number[] = []\n        let page = this.root\n        while (this.typeOf(page) === INTERNAL) {\n            path.push(page)\n            page = this.childFor(page, key, id)\n        }\n        const position = this.lowerBound(page, key, id)\n        if (\n            position < this.countOf(page) &&\n            this.compareAt(page, position, key, id) === 0\n        )\n            return false\n        let split = this.insertAt(page, position, {\n            key: Buffer.from(key),\n            id: Buffer.from(id),\n        })\n        while (split) {\n            const parent = path.pop()\n            if (parent === undefined) {\n                const root = this.allocate(INTERNAL)\n                this.setFirst(root, this.root)\n                this.insertAt(root, 0, split)\n                this.root = root\n                break\n            }\n            split = this.insertAt(\n                parent,\n                this.upperBound(parent, split.key, split.id),\n                split,\n            )\n        }\n        this.count++\n        return true\n    }\n\n    /**\n     * Removes an entry; whether it existed.\n     *\n     * @param key\n     * @param id\n     */\n    delete(key: Uint8Array, id: Uint8Array): boolean {\n        const page = this.leafFor(key, id)\n        const position = this.lowerBound(page, key, id)\n        if (\n            position >= this.countOf(page) ||\n            this.compareAt(page, position, key, id) !== 0\n        )\n            return false\n        const [buffer, base] = this.locate(page)\n        const count = buffer.readUInt16LE(base + 2)\n        const offset = buffer.readUInt16LE(base + HEADER + position * 2)\n        buffer.copyWithin(\n            base + HEADER + position * 2,\n            base + HEADER + (position + 1) * 2,\n            base + HEADER + count * 2,\n        )\n        buffer.writeUInt16LE(count - 1, base + 2)\n        buffer.writeUInt16LE(\n            buffer.readUInt16LE(base + 6) + this.sizeAt(buffer, base + offset, false),\n            base + 6,\n        )\n        this.count--\n        return true\n    }\n\n    /**\n     * Whether an entry exists.\n     *\n     * @param key\n     * @param id\n     */\n    has(key: Uint8Array, id: Uint8Array): boolean {\n        const page = this.leafFor(key, id)\n        const position = this.lowerBound(page, key, id)\n        return (\n            position < this.countOf(page) &&\n            this.compareAt(page, position, key, id) === 0\n        )\n    }\n\n    /**\n     * The entries of a range of keys, in their order or reversed.\n     *\n     * @param lower\n     * @param upper\n     * @param reverse\n     */\n    *range(\n        lower?: EmbeddedBound,\n        upper?: EmbeddedBound,\n        reverse = false,\n    ): Generator<[Buffer, Buffer]> {\n        if (!reverse) {\n            let page = lower\n                ? this.leafFor(lower.key, lower.inclusive ? Buffer.alloc(0) : GREATEST_ID)\n                : this.firstLeaf()\n            let position = lower\n                ? this.lowerBound(\n                      page,\n                      lower.key,\n                      lower.inclusive ? Buffer.alloc(0) : GREATEST_ID,\n                  )\n                : 0\n            while (page !== NONE) {\n                const count = this.countOf(page)\n                for (; position < count; position++) {\n                    const entry = this.entryAt(page, position)\n                    if (upper) {\n                        const order = Buffer.compare(entry.key, upper.key)\n                        if (order > 0 || (order === 0 && !upper.inclusive)) return\n                    }\n                    yield [entry.key, entry.id]\n                }\n                page = this.nextOf(page)\n                position = 0\n            }\n            return\n        }\n        let page = upper\n            ? this.leafFor(upper.key, upper.inclusive ? GREATEST_ID : Buffer.alloc(0))\n            : this.lastLeaf()\n        let position =\n            (upper\n                ? this.lowerBound(\n                      page,\n                      upper.key,\n                      upper.inclusive ? GREATEST_ID : Buffer.alloc(0),\n                  )\n                : this.countOf(page)) - 1\n        while (page !== NONE) {\n            for (; position >= 0; position--) {\n                const entry = this.entryAt(page, position)\n                if (lower) {\n                    const order = Buffer.compare(entry.key, lower.key)\n                    if (order < 0 || (order === 0 && !lower.inclusive)) return\n                }\n                yield [entry.key, entry.id]\n            }\n            page = this.previousOf(page)\n            if (page !== NONE) position = this.countOf(page) - 1\n        }\n    }\n\n    /**\n     * The entries whose key starts with a prefix, in their order.\n     *\n     * @param prefix\n     */\n    *prefixed(prefix: Uint8Array): Generator<[Buffer, Buffer]> {\n        for (const entry of this.range({ key: prefix, inclusive: true })) {\n            if (\n                entry[0].length < prefix.length ||\n                entry[0].compare(prefix, 0, prefix.length, 0, prefix.length) !== 0\n            )\n                return\n            yield entry\n        }\n    }\n\n    /**\n     * The state of the tree as buffers (the chunks of its pages, shared, not copied), and the numbers telling them\n     * apart.\n     */\n    export(): { state: number[]; buffers: Uint8Array[] } {\n        // The last chunk up to its last page\n        const used = this.pages - (this.chunks.length - 1) * PAGES_PER_CHUNK\n        return {\n            state: [this.root, this.pages, this.count, this.chunks.length],\n            buffers: this.chunks.map((chunk, index) =>\n                index === this.chunks.length - 1\n                    ? chunk.subarray(0, used * PAGE)\n                    : chunk,\n            ),\n        }\n    }\n\n    /**\n     * A tree from its state exported (its buffers used as they are).\n     *\n     * @param state\n     * @param buffers\n     */\n    static import(state: number[], buffers: Uint8Array[]): EmbeddedBTree {\n        const [root, pages, count, chunks] = state\n        const tree = new EmbeddedBTree()\n        tree.chunks = buffers\n            .slice(0, chunks)\n            .map((bytes) =>\n                Buffer.from(bytes.buffer, bytes.byteOffset, bytes.byteLength),\n            )\n        // The last chunk whole again, to be written on\n        const last = tree.chunks.length - 1\n        if (last >= 0 && tree.chunks[last].length < PAGE * PAGES_PER_CHUNK) {\n            const chunk = Buffer.allocUnsafe(PAGE * PAGES_PER_CHUNK)\n            tree.chunks[last].copy(chunk)\n            tree.chunks[last] = chunk\n        }\n        tree.root = root\n        tree.pages = pages\n        tree.count = count\n        tree.free = []\n        return tree\n    }\n\n    /**\n     * Removes all the entries.\n     */\n    clear(): void {\n        this.chunks = []\n        this.pages = 0\n        this.free = []\n        this.count = 0\n        this.root = this.allocate(LEAF)\n    }\n\n    /**\n     * Inserts an entry at a position of a page; the entry and page to insert in its parent when the page is split.\n     *\n     * @param page\n     * @param position\n     * @param entry\n     */\n    protected insertAt(\n        page: number,\n        position: number,\n        entry: Entry,\n    ): Entry | undefined {\n        const internal = this.typeOf(page) === INTERNAL\n        const size = 3 + entry.key.length + entry.id.length + (internal ? 4 : 0)\n        let [buffer, base] = this.locate(page)\n        const count = buffer.readUInt16LE(base + 2)\n        const free = buffer.readUInt16LE(base + 4) - (HEADER + count * 2)\n        if (free < size + 2 && free + buffer.readUInt16LE(base + 6) >= size + 2) {\n            this.rewrite(page, this.entriesOf(page))\n            ;[buffer, base] = this.locate(page)\n        }\n        if (\n            buffer.readUInt16LE(base + 4) - (HEADER + count * 2) >=\n            size + 2\n        ) {\n            const offset = buffer.readUInt16LE(base + 4) - size\n            this.writeEntry(buffer, base + offset, entry, internal)\n            buffer.copyWithin(\n                base + HEADER + (position + 1) * 2,\n                base + HEADER + position * 2,\n                base + HEADER + count * 2,\n            )\n            buffer.writeUInt16LE(offset, base + HEADER + position * 2)\n            buffer.writeUInt16LE(count + 1, base + 2)\n            buffer.writeUInt16LE(offset, base + 4)\n            return undefined\n        }\n        // The page split in two: its entries and the new one shared by their bytes. A leaf keeps the entries before\n        // the middle, its new sibling the others, the first of which is copied up to the parent; an internal page\n        // moves its middle entry up, its child becoming the first child of the sibling. The parent leads the keys\n        // equal to an entry to its child (childFor)\n        const entries = this.entriesOf(page)\n        entries.splice(position, 0, entry)\n        const middle = this.middleOf(entries, internal)\n        const sibling = this.allocate(internal ? INTERNAL : LEAF)\n        if (internal) {\n            const up = entries[middle]\n            this.rewrite(page, entries.slice(0, middle))\n            this.setFirst(sibling, up.child!)\n            this.rewrite(sibling, entries.slice(middle + 1))\n            return { key: up.key, id: up.id, child: sibling }\n        }\n        this.rewrite(page, entries.slice(0, middle))\n        this.rewrite(sibling, entries.slice(middle))\n        const next = this.nextOf(page)\n        this.setLinks(sibling, next, page)\n        this.setLinks(page, sibling, this.previousOf(page))\n        if (next !== NONE) this.setLinks(next, this.nextOf(next), sibling)\n        return { key: entries[middle].key, id: entries[middle].id, child: sibling }\n    }\n\n    /**\n     * Where the entries of a page split in two are divided (the entry at the position starting the second half of a\n     * leaf, or moved up from an internal page): the halves as near in bytes as possible, each fitting a page, each with\n     * an entry at least. As an entry takes a quarter of a page at most and the entries split overflow a page, the\n     * position exists.\n     *\n     * @param entries\n     * @param internal\n     */\n    protected middleOf(entries: Entry[], internal: boolean): number {\n        const sizes = entries.map(\n            (entry) =>\n                2 + 3 + entry.key.length + entry.id.length + (internal ? 4 : 0),\n        )\n        const total = sizes.reduce((sum, size) => sum + size, 0)\n        let middle = -1\n        let difference = Infinity\n        let before = 0\n        // An internal page moves its middle entry up: its last entry cannot be it\n        const end = entries.length - (internal ? 1 : 0)\n        for (let position = 1; position < end; position++) {\n            before += sizes[position - 1]\n            const after = total - before - (internal ? sizes[position] : 0)\n            if (before > CAPACITY || after > CAPACITY) continue\n            if (Math.abs(before - after) < difference) {\n                middle = position\n                difference = Math.abs(before - after)\n            }\n        }\n        if (middle < 0)\n            throw new TypeORMError(\n                \"lakutata: the entries of a page of an index of mongo-embedded cannot be split\",\n            )\n        return middle\n    }\n\n    /**\n     * Writes the entries of a page again, packed. Entries not fitting it throw before any of them is written (the\n     * page is left as it was).\n     *\n     * @param page\n     * @param entries\n     */\n    protected rewrite(page: number, entries: Entry[]): void {\n        const [buffer, base] = this.locate(page)\n        const internal = buffer[base] === INTERNAL\n        let bytes = 0\n        for (const entry of entries)\n            bytes += 2 + 3 + entry.key.length + entry.id.length + (internal ? 4 : 0)\n        if (bytes > CAPACITY)\n            throw new TypeORMError(\n                \"lakutata: the entries of a page of an index of mongo-embedded do not fit it\",\n            )\n        let end = PAGE\n        entries.forEach((entry, index) => {\n            end -= 3 + entry.key.length + entry.id.length + (internal ? 4 : 0)\n            this.writeEntry(buffer, base + end, entry, internal)\n            buffer.writeUInt16LE(end, base + HEADER + index * 2)\n        })\n        buffer.writeUInt16LE(entries.length, base + 2)\n        buffer.writeUInt16LE(end, base + 4)\n        buffer.writeUInt16LE(0, base + 6)\n    }\n\n    protected writeEntry(\n        buffer: Buffer,\n        at: number,\n        entry: Entry,\n        internal: boolean,\n    ): void {\n        buffer.writeUInt16LE(entry.key.length, at)\n        buffer[at + 2] = entry.id.length\n        buffer.set(entry.key, at + 3)\n        buffer.set(entry.id, at + 3 + entry.key.length)\n        if (internal)\n            buffer.writeUInt32LE(\n                entry.child!,\n                at + 3 + entry.key.length + entry.id.length,\n            )\n    }\n\n    protected entriesOf(page: number): Entry[] {\n        const entries: Entry[] = []\n        for (let position = 0; position < this.countOf(page); position++)\n            entries.push(this.entryAt(page, position))\n        return entries\n    }\n\n    /**\n     * The entry at a position of a page: its key and id copied.\n     *\n     * @param page\n     * @param position\n     */\n    protected entryAt(page: number, position: number): Entry {\n        const [buffer, base] = this.locate(page)\n        const at = base + buffer.readUInt16LE(base + HEADER + position * 2)\n        const keyLength = buffer.readUInt16LE(at)\n        const idLength = buffer[at + 2]\n        const key = Buffer.from(buffer.subarray(at + 3, at + 3 + keyLength))\n        const id = Buffer.from(\n            buffer.subarray(at + 3 + keyLength, at + 3 + keyLength + idLength),\n        )\n        return buffer[base] === INTERNAL\n            ? {\n                  key: key,\n                  id: id,\n                  child: buffer.readUInt32LE(at + 3 + keyLength + idLength),\n              }\n            : { key: key, id: id }\n    }\n\n    protected sizeAt(buffer: Buffer, at: number, internal: boolean): number {\n        return (\n            3 + buffer.readUInt16LE(at) + buffer[at + 2] + (internal ? 4 : 0)\n        )\n    }\n\n    /**\n     * Compares the entry at a position of a page with a key and an id.\n     *\n     * @param page\n     * @param position\n     * @param key\n     * @param id\n     */\n    protected compareAt(\n        page: number,\n        position: number,\n        key: Uint8Array,\n        id: Uint8Array,\n    ): number {\n        // Compared byte by byte (the keys are short: a call of Buffer.compare costs more)\n        const buffer = this.chunks[page >>> 9]\n        const base = (page & 511) * PAGE\n        const slot = base + HEADER + position * 2\n        const at = base + (buffer[slot] | (buffer[slot + 1] << 8))\n        const keyLength = buffer[at] | (buffer[at + 1] << 8)\n        const keyStart = at + 3\n        const shorter = keyLength < key.length ? keyLength : key.length\n        for (let index = 0; index < shorter; index++) {\n            const difference = buffer[keyStart + index] - key[index]\n            if (difference !== 0) return difference\n        }\n        if (keyLength !== key.length) return keyLength - key.length\n        const idStart = keyStart + keyLength\n        const idLength = buffer[at + 2]\n        const shorterId = idLength < id.length ? idLength : id.length\n        for (let index = 0; index < shorterId; index++) {\n            const difference = buffer[idStart + index] - id[index]\n            if (difference !== 0) return difference\n        }\n        return idLength - id.length\n    }\n\n    /**\n     * The first position of a page whose entry is not before a key and an id.\n     */\n    protected lowerBound(page: number, key: Uint8Array, id: Uint8Array): number {\n        let low = 0\n        let high = this.countOf(page)\n        while (low < high) {\n            const middle = (low + high) >> 1\n            if (this.compareAt(page, middle, key, id) < 0) low = middle + 1\n            else high = middle\n        }\n        return low\n    }\n\n    /**\n     * The first position of a page whose entry is after a key and an id.\n     */\n    protected upperBound(page: number, key: Uint8Array, id: Uint8Array): number {\n        let low = 0\n        let high = this.countOf(page)\n        while (low < high) {\n            const middle = (low + high) >> 1\n            if (this.compareAt(page, middle, key, id) <= 0) low = middle + 1\n            else high = middle\n        }\n        return low\n    }\n\n    /**\n     * The child of an internal page holding a key and an id.\n     */\n    protected childFor(page: number, key: Uint8Array, id: Uint8Array): number {\n        const position = this.upperBound(page, key, id)\n        return position === 0\n            ? this.firstOf(page)\n            : this.entryChild(page, position - 1)\n    }\n\n    protected leafFor(key: Uint8Array, id: Uint8Array): number {\n        let page = this.root\n        while (this.typeOf(page) === INTERNAL) page = this.childFor(page, key, id)\n        return page\n    }\n\n    protected firstLeaf(): number {\n        let page = this.root\n        while (this.typeOf(page) === INTERNAL) page = this.firstOf(page)\n        return page\n    }\n\n    protected lastLeaf(): number {\n        let page = this.root\n        while (this.typeOf(page) === INTERNAL)\n            page = this.entryChild(page, this.countOf(page) - 1)\n        return page\n    }\n\n    protected entryChild(page: number, position: number): number {\n        const [buffer, base] = this.locate(page)\n        const at = base + buffer.readUInt16LE(base + HEADER + position * 2)\n        return buffer.readUInt32LE(\n            at + 3 + buffer.readUInt16LE(at) + buffer[at + 2],\n        )\n    }\n\n    protected allocate(type: number): number {\n        const page = this.free.pop() ?? this.pages++\n        if (Math.floor(page / PAGES_PER_CHUNK) >= this.chunks.length)\n            this.chunks.push(Buffer.allocUnsafe(PAGE * PAGES_PER_CHUNK))\n        const [buffer, base] = this.locate(page)\n        buffer[base] = type\n        buffer.writeUInt16LE(0, base + 2)\n        buffer.writeUInt16LE(PAGE, base + 4)\n        buffer.writeUInt16LE(0, base + 6)\n        buffer.writeUInt32LE(NONE, base + 8)\n        buffer.writeUInt32LE(NONE, base + 12)\n        return page\n    }\n\n    protected locate(page: number): [Buffer, number] {\n        return [this.chunks[page >>> 9], (page & 511) * PAGE]\n    }\n\n    protected typeOf(page: number): number {\n        return this.chunks[page >>> 9][(page & 511) * PAGE]\n    }\n\n    protected countOf(page: number): number {\n        const buffer = this.chunks[page >>> 9]\n        const base = (page & 511) * PAGE\n        return buffer[base + 2] | (buffer[base + 3] << 8)\n    }\n\n    protected nextOf(page: number): number {\n        const [buffer, base] = this.locate(page)\n        return buffer.readUInt32LE(base + 8)\n    }\n\n    protected previousOf(page: number): number {\n        const [buffer, base] = this.locate(page)\n        return buffer.readUInt32LE(base + 12)\n    }\n\n    protected firstOf(page: number): number {\n        return this.previousOf(page)\n    }\n\n    protected setFirst(page: number, child: number): void {\n        const [buffer, base] = this.locate(page)\n        buffer.writeUInt32LE(child, base + 12)\n    }\n\n    protected setLinks(page: number, next: number, previous: number): void {\n        const [buffer, base] = this.locate(page)\n        buffer.writeUInt32LE(next, base + 8)\n        buffer.writeUInt32LE(previous, base + 12)\n    }\n}\n"]}

package/dist/vendor/typeorm/driver/mongo-embedded/EmbeddedCache.d.ts

@@ -0,0 +1,96 @@
+import type { EmbeddedDocument } from "./EmbeddedValues";
+/**
+ * lakutata: the memory of a document in the heap of V8, estimated from the size of its record (about 3.7 times its
+ * BSON).
+ *
+ * @param recordLength
+ */
+export declare function cachedSizeOf(recordLength: number): number;
+/**
+ * lakutata: a document cached: read by the store and its callers (it is never changed), its size, whether it was read
+ * since the eviction last passed it, whether it is still cached (the queue of the eviction keeps the ones removed).
+ */
+interface CacheEntry {
+    key: string;
+    document: EmbeddedDocument;
+    size: number;
+    hit: boolean;
+    live: boolean;
+}
+/**
+ * lakutata: the memory the document caches of a database share: when they hold more, the cache adding a document evicts
+ * its own first, then the largest one.
+ */
+export declare class EmbeddedCacheBudget {
+    readonly capacity: number;
+    used: number;
+    readonly caches: Set<EmbeddedCollectionCache>;
+    /**
+     * @param capacity the memory of the cached documents, in bytes (estimated)
+     */
+    constructor(capacity: number);
+    /**
+     * Evicts documents until the caches hold their capacity.
+     *
+     * @param adding the cache adding a document
+     */
+    trim(adding: EmbeddedCollectionCache): void;
+}
+/**
+ * lakutata: the documents of a collection cached, by the keys of their _id: their oldest evicted first, unless they
+ * were read since (their second chance). The order of the eviction is a queue of its own (the iteration of a map from
+ * its start passes the entries it deleted, until it is rehashed).
+ */
+export declare class EmbeddedCollectionCache {
+    protected readonly budget: EmbeddedCacheBudget;
+    protected readonly entries: Map<string, CacheEntry>;
+    protected queue: CacheEntry[];
+    protected head: number;
+    constructor(budget: EmbeddedCacheBudget);
+    /**
+     * The number of the documents cached.
+     */
+    get size(): number;
+    /**
+     * A document cached, if any.
+     *
+     * @param key the key of its _id, as a latin1 string
+     */
+    get(key: string): EmbeddedDocument | undefined;
+    /**
+     * Caches a document (it is not changed any more), unless it is larger than the capacity.
+     *
+     * @param key
+     * @param document
+     * @param size
+     */
+    set(key: string, document: EmbeddedDocument, size: number): void;
+    /**
+     * Caches a document when the budget has room for it, evicting none: the scans of a collection larger than the
+     * cache do not replace it with its documents read once.
+     *
+     * @param key
+     * @param document
+     * @param size
+     */
+    offer(key: string, document: EmbeddedDocument, size: number): void;
+    delete(key: string): void;
+    /**
+     * The documents cached, at once (the writes made while they are read change the cache).
+     */
+    documents(): EmbeddedDocument[];
+    /**
+     * Evicts a document: the oldest not read since the eviction last passed it; whether one was evicted.
+     */
+    evictOne(): boolean;
+    /**
+     * Removes all the documents, and the cache from its budget.
+     */
+    close(): void;
+    protected add(key: string, document: EmbeddedDocument, size: number): void;
+    /**
+     * Drops the start of the queue once it is passed, and the entries removed when they are most of it.
+     */
+    protected compactQueue(): void;
+}
+export {};

package/dist/vendor/typeorm/driver/mongo-embedded/EmbeddedCache.js

@@ -0,0 +1,185 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EmbeddedCollectionCache = exports.EmbeddedCacheBudget = void 0;
+exports.cachedSizeOf = cachedSizeOf;
+/**
+ * lakutata: the memory of a document in the heap of V8, estimated from the size of its record (about 3.7 times its
+ * BSON).
+ *
+ * @param recordLength
+ */
+function cachedSizeOf(recordLength) {
+    return recordLength * 4;
+}
+/**
+ * lakutata: the memory the document caches of a database share: when they hold more, the cache adding a document evicts
+ * its own first, then the largest one.
+ */
+class EmbeddedCacheBudget {
+    /**
+     * @param capacity the memory of the cached documents, in bytes (estimated)
+     */
+    constructor(capacity) {
+        this.capacity = capacity;
+        this.used = 0;
+        this.caches = new Set();
+    }
+    /**
+     * Evicts documents until the caches hold their capacity.
+     *
+     * @param adding the cache adding a document
+     */
+    trim(adding) {
+        while (this.used > this.capacity && adding.evictOne()) { }
+        while (this.used > this.capacity) {
+            let largest;
+            for (const cache of this.caches)
+                if (!largest || cache.size > largest.size)
+                    largest = cache;
+            if (!largest || !largest.evictOne())
+                return;
+        }
+    }
+}
+exports.EmbeddedCacheBudget = EmbeddedCacheBudget;
+/**
+ * lakutata: the documents of a collection cached, by the keys of their _id: their oldest evicted first, unless they
+ * were read since (their second chance). The order of the eviction is a queue of its own (the iteration of a map from
+ * its start passes the entries it deleted, until it is rehashed).
+ */
+class EmbeddedCollectionCache {
+    constructor(budget) {
+        this.budget = budget;
+        this.entries = new Map();
+        this.queue = [];
+        this.head = 0;
+        budget.caches.add(this);
+    }
+    /**
+     * The number of the documents cached.
+     */
+    get size() {
+        return this.entries.size;
+    }
+    /**
+     * A document cached, if any.
+     *
+     * @param key the key of its _id, as a latin1 string
+     */
+    get(key) {
+        const entry = this.entries.get(key);
+        if (!entry)
+            return undefined;
+        entry.hit = true;
+        return entry.document;
+    }
+    /**
+     * Caches a document (it is not changed any more), unless it is larger than the capacity.
+     *
+     * @param key
+     * @param document
+     * @param size
+     */
+    set(key, document, size) {
+        this.delete(key);
+        if (size > this.budget.capacity)
+            return;
+        this.add(key, document, size);
+        if (this.budget.used > this.budget.capacity)
+            this.budget.trim(this);
+    }
+    /**
+     * Caches a document when the budget has room for it, evicting none: the scans of a collection larger than the
+     * cache do not replace it with its documents read once.
+     *
+     * @param key
+     * @param document
+     * @param size
+     */
+    offer(key, document, size) {
+        if (this.budget.used + size > this.budget.capacity)
+            return;
+        this.add(key, document, size);
+    }
+    delete(key) {
+        const entry = this.entries.get(key);
+        if (!entry)
+            return;
+        entry.live = false;
+        this.entries.delete(key);
+        this.budget.used -= entry.size;
+    }
+    /**
+     * The documents cached, at once (the writes made while they are read change the cache).
+     */
+    documents() {
+        const documents = [];
+        for (const entry of this.entries.values()) {
+            entry.hit = true;
+            documents.push(entry.document);
+        }
+        return documents;
+    }
+    /**
+     * Evicts a document: the oldest not read since the eviction last passed it; whether one was evicted.
+     */
+    evictOne() {
+        let passes = this.entries.size;
+        while (this.head < this.queue.length) {
+            const entry = this.queue[this.head++];
+            if (!entry.live)
+                continue;
+            if (entry.hit && passes-- > 0) {
+                // Its second chance: to the end of the queue
+                entry.hit = false;
+                this.queue.push(entry);
+                continue;
+            }
+            entry.live = false;
+            this.entries.delete(entry.key);
+            this.budget.used -= entry.size;
+            this.compactQueue();
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Removes all the documents, and the cache from its budget.
+     */
+    close() {
+        for (const entry of this.entries.values())
+            this.budget.used -= entry.size;
+        this.entries.clear();
+        this.queue = [];
+        this.head = 0;
+        this.budget.caches.delete(this);
+    }
+    add(key, document, size) {
+        const entry = {
+            key: key,
+            document: document,
+            size: size,
+            hit: false,
+            live: true,
+        };
+        this.entries.set(key, entry);
+        this.queue.push(entry);
+        this.budget.used += size;
+        this.compactQueue();
+    }
+    /**
+     * Drops the start of the queue once it is passed, and the entries removed when they are most of it.
+     */
+    compactQueue() {
+        if (this.head > 1024 && this.head * 2 > this.queue.length) {
+            this.queue = this.queue.slice(this.head);
+            this.head = 0;
+        }
+        if (this.queue.length > 1024 && this.queue.length > this.entries.size * 4) {
+            this.queue = this.queue.slice(this.head).filter((entry) => entry.live);
+            this.head = 0;
+        }
+    }
+}
+exports.EmbeddedCollectionCache = EmbeddedCollectionCache;
+//# sourceMappingURL=EmbeddedCache.js.map

package/dist/vendor/typeorm/driver/mongo-embedded/EmbeddedCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EmbeddedCache.js","sourceRoot":"","sources":["../../../../../vendor/typeorm/driver/mongo-embedded/EmbeddedCache.ts"],"names":[],"mappings":";;;AAQA,oCAEC;AARD;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,YAAoB;IAC7C,OAAO,YAAY,GAAG,CAAC,CAAA;AAC3B,CAAC;AAcD;;;GAGG;AACH,MAAa,mBAAmB;IAK5B;;OAEG;IACH,YAAqB,QAAgB;QAAhB,aAAQ,GAAR,QAAQ,CAAQ;QAPrC,SAAI,GAAG,CAAC,CAAA;QAEC,WAAM,GAAG,IAAI,GAAG,EAA2B,CAAA;IAKZ,CAAC;IAEzC;;;;OAIG;IACH,IAAI,CAAC,MAA+B;QAChC,OAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAA,CAAC;QACzD,OAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/B,IAAI,OAA4C,CAAA;YAChD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;gBAC3B,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI;oBAAE,OAAO,GAAG,KAAK,CAAA;YAC9D,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;gBAAE,OAAM;QAC/C,CAAC;IACL,CAAC;CACJ;AAxBD,kDAwBC;AAED;;;;GAIG;AACH,MAAa,uBAAuB;IAOhC,YAA+B,MAA2B;QAA3B,WAAM,GAAN,MAAM,CAAqB;QANvC,YAAO,GAAG,IAAI,GAAG,EAAsB,CAAA;QAEhD,UAAK,GAAiB,EAAE,CAAA;QAExB,SAAI,GAAG,CAAC,CAAA;QAGd,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACJ,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAA;IAC5B,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,GAAW;QACX,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAA;QAC5B,KAAK,CAAC,GAAG,GAAG,IAAI,CAAA;QAChB,OAAO,KAAK,CAAC,QAAQ,CAAA;IACzB,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,GAAW,EAAE,QAA0B,EAAE,IAAY;QACrD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ;YAAE,OAAM;QACvC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;QAC7B,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ;YAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACvE,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,GAAW,EAAE,QAA0B,EAAE,IAAY;QACvD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ;YAAE,OAAM;QAC1D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;IACjC,CAAC;IAED,MAAM,CAAC,GAAW;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnC,IAAI,CAAC,KAAK;YAAE,OAAM;QAClB,KAAK,CAAC,IAAI,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAA;IAClC,CAAC;IAED;;OAEG;IACH,SAAS;QACL,MAAM,SAAS,GAAuB,EAAE,CAAA;QACxC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAA;YAChB,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;QAClC,CAAC;QACD,OAAO,SAAS,CAAA;IACpB,CAAC;IAED;;OAEG;IACH,QAAQ;QACJ,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAA;QAC9B,OAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;YACrC,IAAI,CAAC,KAAK,CAAC,IAAI;gBAAE,SAAQ;YACzB,IAAI,KAAK,CAAC,GAAG,IAAI,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC5B,6CAA6C;gBAC7C,KAAK,CAAC,GAAG,GAAG,KAAK,CAAA;gBACjB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACtB,SAAQ;YACZ,CAAC;YACD,KAAK,CAAC,IAAI,GAAG,KAAK,CAAA;YAClB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAA;YAC9B,IAAI,CAAC,YAAY,EAAE,CAAA;YACnB,OAAO,IAAI,CAAA;QACf,CAAC;QACD,OAAO,KAAK,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,KAAK;QACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAA;QACzE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;QACpB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAA;QACf,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACb,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACnC,CAAC;IAES,GAAG,CAAC,GAAW,EAAE,QAA0B,EAAE,IAAY;QAC/D,MAAM,KAAK,GAAe;YACtB,GAAG,EAAE,GAAG;YACR,QAAQ,EAAE,QAAQ;YAClB,IAAI,EAAE,IAAI;YACV,GAAG,EAAE,KAAK;YACV,IAAI,EAAE,IAAI;SACb,CAAA;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC5B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACtB,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAA;QACxB,IAAI,CAAC,YAAY,EAAE,CAAA;IACvB,CAAC;IAED;;OAEG;IACO,YAAY;QAClB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACxD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACxC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACjB,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACxE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YACtE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACjB,CAAC;IACL,CAAC;CACJ;AA1ID,0DA0IC","sourcesContent":["import type { EmbeddedDocument } from \"./EmbeddedValues\"\n\n/**\n * lakutata: the memory of a document in the heap of V8, estimated from the size of its record (about 3.7 times its\n * BSON).\n *\n * @param recordLength\n */\nexport function cachedSizeOf(recordLength: number): number {\n    return recordLength * 4\n}\n\n/**\n * lakutata: a document cached: read by the store and its callers (it is never changed), its size, whether it was read\n * since the eviction last passed it, whether it is still cached (the queue of the eviction keeps the ones removed).\n */\ninterface CacheEntry {\n    key: string\n    document: EmbeddedDocument\n    size: number\n    hit: boolean\n    live: boolean\n}\n\n/**\n * lakutata: the memory the document caches of a database share: when they hold more, the cache adding a document evicts\n * its own first, then the largest one.\n */\nexport class EmbeddedCacheBudget {\n    used = 0\n\n    readonly caches = new Set<EmbeddedCollectionCache>()\n\n    /**\n     * @param capacity the memory of the cached documents, in bytes (estimated)\n     */\n    constructor(readonly capacity: number) {}\n\n    /**\n     * Evicts documents until the caches hold their capacity.\n     *\n     * @param adding the cache adding a document\n     */\n    trim(adding: EmbeddedCollectionCache): void {\n        while (this.used > this.capacity && adding.evictOne()) {}\n        while (this.used > this.capacity) {\n            let largest: EmbeddedCollectionCache | undefined\n            for (const cache of this.caches)\n                if (!largest || cache.size > largest.size) largest = cache\n            if (!largest || !largest.evictOne()) return\n        }\n    }\n}\n\n/**\n * lakutata: the documents of a collection cached, by the keys of their _id: their oldest evicted first, unless they\n * were read since (their second chance). The order of the eviction is a queue of its own (the iteration of a map from\n * its start passes the entries it deleted, until it is rehashed).\n */\nexport class EmbeddedCollectionCache {\n    protected readonly entries = new Map<string, CacheEntry>()\n\n    protected queue: CacheEntry[] = []\n\n    protected head = 0\n\n    constructor(protected readonly budget: EmbeddedCacheBudget) {\n        budget.caches.add(this)\n    }\n\n    /**\n     * The number of the documents cached.\n     */\n    get size(): number {\n        return this.entries.size\n    }\n\n    /**\n     * A document cached, if any.\n     *\n     * @param key the key of its _id, as a latin1 string\n     */\n    get(key: string): EmbeddedDocument | undefined {\n        const entry = this.entries.get(key)\n        if (!entry) return undefined\n        entry.hit = true\n        return entry.document\n    }\n\n    /**\n     * Caches a document (it is not changed any more), unless it is larger than the capacity.\n     *\n     * @param key\n     * @param document\n     * @param size\n     */\n    set(key: string, document: EmbeddedDocument, size: number): void {\n        this.delete(key)\n        if (size > this.budget.capacity) return\n        this.add(key, document, size)\n        if (this.budget.used > this.budget.capacity) this.budget.trim(this)\n    }\n\n    /**\n     * Caches a document when the budget has room for it, evicting none: the scans of a collection larger than the\n     * cache do not replace it with its documents read once.\n     *\n     * @param key\n     * @param document\n     * @param size\n     */\n    offer(key: string, document: EmbeddedDocument, size: number): void {\n        if (this.budget.used + size > this.budget.capacity) return\n        this.add(key, document, size)\n    }\n\n    delete(key: string): void {\n        const entry = this.entries.get(key)\n        if (!entry) return\n        entry.live = false\n        this.entries.delete(key)\n        this.budget.used -= entry.size\n    }\n\n    /**\n     * The documents cached, at once (the writes made while they are read change the cache).\n     */\n    documents(): EmbeddedDocument[] {\n        const documents: EmbeddedDocument[] = []\n        for (const entry of this.entries.values()) {\n            entry.hit = true\n            documents.push(entry.document)\n        }\n        return documents\n    }\n\n    /**\n     * Evicts a document: the oldest not read since the eviction last passed it; whether one was evicted.\n     */\n    evictOne(): boolean {\n        let passes = this.entries.size\n        while (this.head < this.queue.length) {\n            const entry = this.queue[this.head++]\n            if (!entry.live) continue\n            if (entry.hit && passes-- > 0) {\n                // Its second chance: to the end of the queue\n                entry.hit = false\n                this.queue.push(entry)\n                continue\n            }\n            entry.live = false\n            this.entries.delete(entry.key)\n            this.budget.used -= entry.size\n            this.compactQueue()\n            return true\n        }\n        return false\n    }\n\n    /**\n     * Removes all the documents, and the cache from its budget.\n     */\n    close(): void {\n        for (const entry of this.entries.values()) this.budget.used -= entry.size\n        this.entries.clear()\n        this.queue = []\n        this.head = 0\n        this.budget.caches.delete(this)\n    }\n\n    protected add(key: string, document: EmbeddedDocument, size: number): void {\n        const entry: CacheEntry = {\n            key: key,\n            document: document,\n            size: size,\n            hit: false,\n            live: true,\n        }\n        this.entries.set(key, entry)\n        this.queue.push(entry)\n        this.budget.used += size\n        this.compactQueue()\n    }\n\n    /**\n     * Drops the start of the queue once it is passed, and the entries removed when they are most of it.\n     */\n    protected compactQueue(): void {\n        if (this.head > 1024 && this.head * 2 > this.queue.length) {\n            this.queue = this.queue.slice(this.head)\n            this.head = 0\n        }\n        if (this.queue.length > 1024 && this.queue.length > this.entries.size * 4) {\n            this.queue = this.queue.slice(this.head).filter((entry) => entry.live)\n            this.head = 0\n        }\n    }\n}\n"]}