@fluidframework/container-runtime 1.4.0-115997 → 2.0.0-dev-rc.1.0.0.224419

package/lib/garbageCollection.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"garbageCollection.js","sourceRoot":"","sources":["../src/garbageCollection.ts"],"names":[],"mappings":"AAAA;;;GAGG;;;;;;;;;;;;AAGH,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AAE1E,OAAO,EAAE,yBAAyB,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAE7G,OAAO,EACH,WAAW,EACX,6BAA6B,EAC7B,2BAA2B,EAE3B,oBAAoB,EACpB,yBAAyB,GAC5B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAiB,WAAW,EAAE,MAAM,sCAAsC,CAAC;AAClF,OAAO,EACH,SAAS,GAOZ,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EACH,UAAU,EAGV,kBAAkB,GACrB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACH,WAAW,EACX,yBAAyB,EAEzB,gBAAgB,EAChB,gBAAgB,GACnB,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAqB,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACvE,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AACvD,OAAO,EACH,YAAY,EAGZ,gBAAgB,EAEhB,2BAA2B,GAE9B,MAAM,iBAAiB,CAAC;AAEzB,yDAAyD;AACzD,MAAM,SAAS,GAAG,CAAC,CAAC;AAEpB,sCAAsC;AACtC,MAAM,CAAC,MAAM,SAAS,GAAG,IAAI,CAAC;AAC9B,sDAAsD;AACtD,MAAM,CAAC,MAAM,YAAY,GAAG,MAAM,CAAC;AAEnC,wCAAwC;AACxC,MAAM,QAAQ,GAAG,+BAA+B,CAAC;AACjD,8CAA8C;AAC9C,MAAM,WAAW,GAAG,kCAAkC,CAAC;AACvD,kDAAkD;AAClD,MAAM,aAAa,GAAG,oCAAoC,CAAC;AAC3D,qEAAqE;AACrE,MAAM,cAAc,GAAG,yCAAyC,CAAC;AACjE,mEAAmE;AACnE,MAAM,CAAC,MAAM,mBAAmB,GAAG,0CAA0C,CAAC;AAC9E,2GAA2G;AAC3G,MAAM,CAAC,MAAM,uBAAuB,GAAG,8CAA8C,CAAC;AACtF,6EAA6E;AAC7E,MAAM,CAAC,MAAM,eAAe,GAAG,sCAAsC,CAAC;AACtE,6CAA6C;AAC7C,MAAM,kBAAkB,GAAG,yCAAyC,CAAC;AAErE,2BAA2B;AAC3B,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAEhD,MAAM,wBAAwB,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,SAAS;AACxD,MAAM,CAAC,MAAM,8BAA8B,GAAG,EAAE,GAAG,QAAQ,CAAC,CAAC,UAAU;AAwBvE,uDAAuD;AACvD,MAAM,CAAC,MAAM,UAAU,GAAG;IACtB,kCAAkC;IAClC,SAAS,EAAE,WAAW;IACtB,8DAA8D;IAC9D,YAAY,EAAE,cAAc;IAC5B,6EAA6E;IAC7E,IAAI,EAAE,MAAM;IACZ,+DAA+D;IAC/D,KAAK,EAAE,OAAO;CACjB,CAAC;AA0EF,8CAA8C;AAC9C,MAAM,iBAAiB,GAAG;IACtB,gEAAgE;IAChE,MAAM,EAAE,QAAQ;IAChB,mEAAmE;IACnE,QAAQ,EAAE,UAAU;IACpB,0DAA0D;IAC1D,UAAU,EAAE,YAAY;CAC3B,CAAC;AAmBF;;;GAGG;AACH,MAAM,wBAAwB;IAS1B,YACoB,uBAA+B;IAC/C,+DAA+D;IAC9C,iBAAyB;IAC1C,0GAA0G;IACzF,cAAuB;IACxC,+GAA+G;IAC/G,2BAAoC;QANpB,4BAAuB,GAAvB,uBAAuB,CAAQ;QAE9B,sBAAiB,GAAjB,iBAAiB,CAAQ;QAEzB,mBAAc,GAAd,cAAc,CAAS;QAbpC,WAAM,GAAsB,iBAAiB,CAAC,MAAM,CAAC;QAiBzD,0GAA0G;QAC1G,kEAAkE;QAClE,IAAI,2BAA2B,KAAK,SAAS,EAAE;YAC3C,IAAI,CAAC,cAAc,CAAC,2BAA2B,CAAC,CAAC;SACpD;IACL,CAAC;IArBD,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IAqBD,qEAAqE;IAC9D,cAAc,CAAC,2BAAmC;QACrD,MAAM,sBAAsB,GAAG,2BAA2B,GAAG,IAAI,CAAC,uBAAuB,CAAC;QAE1F,sGAAsG;QACtG,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,sBAAsB,IAAI,IAAI,CAAC,cAAc,EAAE;YACpF,IAAI,CAAC,MAAM,GAAG,iBAAiB,CAAC,UAAU,CAAC;YAC3C,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,OAAO;SACV;QAED,yGAAyG;QACzG,6CAA6C;QAC7C,IAAI,sBAAsB,IAAI,IAAI,CAAC,iBAAiB,EAAE;YAClD,IAAI,CAAC,MAAM,GAAG,iBAAiB,CAAC,QAAQ,CAAC;YACzC,IAAI,CAAC,WAAW,EAAE,CAAC;YAEnB,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,EAAE;gBACnC,cAAc,CACV,IAAI,CAAC,cAAc,GAAG,sBAAsB,EAC5C,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,EACrD,CAAC,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAC1C,CAAC;aACL;YACD,OAAO;SACV;QAED,iFAAiF;QACjF,MAAM,mBAAmB,GAAG,IAAI,CAAC,iBAAiB,GAAG,sBAAsB,CAAC;QAC5E,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE;YAClC,MAAM,sBAAsB,GAAG,GAAG,EAAE;gBAChC,IAAI,CAAC,MAAM,GAAG,iBAAiB,CAAC,QAAQ,CAAC;gBACzC,uGAAuG;gBACvG,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,EAAE;oBACnC,cAAc,CACV,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,iBAAiB,EAC5C,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,EACrD,CAAC,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAC1C,CAAC;iBACL;YACL,CAAC,CAAC;YACF,IAAI,CAAC,aAAa,GAAG,IAAI,KAAK,CAAC,mBAAmB,EAAE,GAAG,EAAE,CAAC,sBAAsB,EAAE,CAAC,CAAC;SACvF;QACD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;IACpD,CAAC;IAEO,WAAW;;QACf,MAAA,IAAI,CAAC,aAAa,0CAAE,KAAK,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,EAAE;YAC/B,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SACjC;IACL,CAAC;IAED,gFAAgF;IACzE,YAAY;QACf,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC;IAC3C,CAAC;CACJ;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,gBAAgB;IAsHzB,YAAsB,YAA2C;;QAzEjE;;WAEG;QACK,qBAAgB,GAAY,IAAI,CAAC;QAKzC;;;;;;;;;UASE;QACM,2BAAsB,GAAY,KAAK,CAAC;QAEhD,yDAAyD;QACxC,qBAAgB,GAAG,SAAS,CAAC;QAc9C,6GAA6G;QAC7G,kCAAkC;QACjB,8BAAyB,GAA0B,IAAI,GAAG,EAAE,CAAC;QAM9E,uDAAuD;QACtC,2BAAsB,GAA0C,IAAI,GAAG,EAAE,CAAC;QAI3F,iHAAiH;QACjH,sBAAsB;QACL,6BAAwB,GAAgB,IAAI,GAAG,EAAE,CAAC;QACnE,6EAA6E;QACrE,uBAAkB,GAA8B,EAAE,CAAC;QAE3D,0FAA0F;QAClF,kBAAa,GAAG,CAAC,CAAC;QAmBtB,IAAI,CAAC,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC;QACpC,IAAI,CAAC,kBAAkB,GAAG,YAAY,CAAC,kBAAkB,CAAC;QAC1D,IAAI,CAAC,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC;QACxC,IAAI,CAAC,kBAAkB,GAAG,YAAY,CAAC,kBAAkB,CAAC;QAC1D,IAAI,CAAC,yBAAyB,GAAG,YAAY,CAAC,yBAAyB,CAAC;QAExE,MAAM,YAAY,GAAG,YAAY,CAAC,YAAY,CAAC;QAC/C,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC;QACvC,MAAM,gBAAgB,GAAG,YAAY,CAAC,gBAAgB,CAAC;QAEvD,IAAI,CAAC,EAAE,GAAG,yBAAyB,CAAC,WAAW,CAAC,MAAM,CAClD,YAAY,CAAC,UAAU,EAAE,kBAAkB,EAAE,EAAE,GAAG,EAAE,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,CACtG,CAAC,CAAC;QAEH,IAAI,oBAAwC,CAAC;QAE7C;;;;;;WAMG;QACH,IAAI,YAAY,CAAC,QAAQ,EAAE;YACvB,oBAAoB,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC9C,oGAAoG;YACpG,2CAA2C;YAC3C,IAAI,CAAC,SAAS,GAAG,oBAAoB,GAAG,CAAC,CAAC;YAC1C,IAAI,CAAC,YAAY,GAAG,MAAA,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,YAAY,mCAAI,KAAK,CAAC;YACpD,IAAI,CAAC,sBAAsB,GAAG,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,sBAAsB,CAAC;SAClE;aAAM;YACH,sGAAsG;YACtG,+EAA+E;YAC/E,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,IAAI,IAAI,CAAC,SAAS,CAAC,SAAS,KAAK,KAAK,EAAE;gBACnE,MAAM,IAAI,UAAU,CAAC,iEAAiE,CAAC,CAAC;aAC3F;YAED,sGAAsG;YACtG,+BAA+B;YAC/B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,KAAK,KAAK,CAAC;YACpD,uGAAuG;YACvG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,KAAK,IAAI,CAAC;YAEzD,gFAAgF;YAChF,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,mBAAmB,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE;gBAClE,IAAI,CAAC,sBAAsB,GAAG,8BAA8B,CAAC;aAChE;SACJ;QAED,wGAAwG;QACxG,IAAI,IAAI,CAAC,sBAAsB,KAAK,SAAS,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,uBAAuB,CAAC,KAAK,IAAI,EAAE;YAC1G,mEAAmE;YACnE,MAAM,8BAA8B,GAChC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,sDAAsD,CAAC,CAAC;YACrF,MAAM,SAAS,GAAG,8BAA8B,aAA9B,8BAA8B,cAA9B,8BAA8B,GAAI,IAAI,CAAC,sBAAsB,CAAC;YAEhF,cAAc,CACV,SAAS,EACT,GAAG,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,yBAAyB,CAAC,yBAAyB,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EACpG,CAAC,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,kBAAkB,GAAG,KAAK,CAAC,CAAC,CAAC,CAClD,CAAC;YAEF;;;;;eAKG;YACH,IAAI,YAAY,CAAC,qBAAqB,KAAK,SAAS,EAAE;gBAClD,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,sBAAsB,GAAG,YAAY,CAAC,qBAAqB,GAAG,QAAQ,CAAC;aACrG;SACJ;QAED,0GAA0G;QAC1G,+GAA+G;QAC/G,IAAI,CAAC,sBAAsB,GAAG,oBAAoB,aAApB,oBAAoB,cAApB,oBAAoB,GAAI,IAAI,CAAC,gBAAgB,CAAC;QAE5E;;;;;WAKG;QACH,IAAI,CAAC,WAAW,GAAG,MAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,mCAAI;QACtD,uCAAuC;QACvC,IAAI,CAAC,SAAS;YACd,0CAA0C;eACvC,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAC/B,CAAC;QAEF;;;;;;WAMG;QACH,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,WAAW;eAC/B,IAAI,CAAC,cAAc,KAAK,SAAS;eACjC,CAAC,MAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,mCAAI,IAAI,CAAC,YAAY,CAAC,CAAC;QAErE,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,eAAe,CAAC,KAAK,IAAI,CAAC;QAExE,gFAAgF;QAChF,IAAI,CAAC,iBAAiB,GAAG,MAAA,MAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,wDAAwD,CAAC,mCACvG,IAAI,CAAC,SAAS,CAAC,iBAAiB,mCAChC,wBAAwB,CAAC;QAE7B,gHAAgH;QAChH,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,cAAc,EAAE;YACnF,MAAM,IAAI,UAAU,CAAC,+DAA+D,CAAC,CAAC;SACzF;QAED,iGAAiG;QACjG,IAAI,CAAC,QAAQ,GAAG,MAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,aAAa,CAAC,mCAAI,IAAI,CAAC,SAAS,CAAC,eAAe,KAAK,IAAI,CAAC;QAEpG,4GAA4G;QAC5G,IAAI,CAAC,gBAAgB,GAAG,MAAA,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,cAAc,CAAC,mCAAI,IAAI,CAAC;QAE1E,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACvB,wGAAwG;YACxG,qCAAqC;YACrC,MAAM,aAAa,GAAG,CAAA,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,KAAK,CAAC,SAAS,CAAC,MAAK,SAAS,CAAC;YACnE,IAAI,CAAC,sBAAsB,GAAG,aAAa,KAAK,IAAI,CAAC,WAAW,CAAC;SACpE;QAED,qGAAqG;QACrG,8EAA8E;QAC9E,MAAM,iBAAiB,GAAG,IAAI,WAAW,CAAsC,KAAK,IAAI,EAAE;;YACtF,IAAI,YAAY,KAAK,SAAS,EAAE;gBAC5B,OAAO,SAAS,CAAC;aACpB;YAED,6FAA6F;YAC7F,MAAM,cAAc,GAAG,YAAY,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACrD,IAAI,cAAc,KAAK,SAAS,EAAE;gBAC9B,iEAAiE;gBACjE,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;gBAC7B,MAAM,WAAW,GAAG,MAAM,sBAAsB,CAC5C,cAAc,EACd,gBAAgB,CACnB,CAAC;gBACF,IAAI,IAAI,CAAC,YAAY,EAAE;oBACnB,IAAI,CAAC,4BAA4B,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAC,CAAC;iBAC1F;gBACD,OAAO,WAAW,CAAC;aACtB;YAED,uGAAuG;YACvG,mDAAmD;YACnD,6EAA6E;YAC7E,MAAM,OAAO,GAA4B,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YACtF,MAAM,qBAAqB,GAAG,uBAAuB,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YAC9E,MAAM,CAAC,qBAAqB,KAAK,SAAS,EACtC,KAAK,CAAC,0DAA0D,CAAC,CAAC;YACtE,KAAK,MAAM,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE;gBAC9E,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gBAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;oBACtB,SAAS;iBACZ;gBAED,MAAM,gBAAgB,GAAG,MAAM,gBAAgB,CAAgC,MAAM,CAAC,CAAC;gBACvF,sDAAsD;gBACtD,IAAI,CAAA,MAAA,gBAAgB,CAAC,MAAM,0CAAE,OAAO,MAAK,SAAS,EAAE;oBAChD,SAAS;iBACZ;gBAED,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;gBAC5B,iGAAiG;gBACjG,6EAA6E;gBAC7E,MAAM,sBAAsB,GAAG,MAAM,gBAAgB,CACjD,cAAc,CAAC,KAAK,CAAC,2BAA2B,CAAC,CACpD,CAAC;gBACF,IAAI,sBAAsB,CAAC,eAAe,EAAE;oBACxC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACtD;gBAED,KAAK,MAAM,CAAC,EAAE,EAAE,cAAc,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;oBAChF,2FAA2F;oBAC3F,+EAA+E;oBAC/E,MAAM,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,EAAE,EAAE,CAAC;oBAC1D,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;iBAC5E;gBACD,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,SAAS,EAC1C,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBACxD,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,uBAAuB,GAAG,gBAAgB,CAAC,cAAc,CAAC;aACvF;YAED,2GAA2G;YAC3G,wGAAwG;YACxG,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC;QAC3E,CAAC,CAAC,CAAC;QAEH;;;;WAIG;QACH,IAAI,CAAC,oBAAoB,GAAG,IAAI,WAAW,CAAO,KAAK,IAAI,EAAE;YACzD,MAAM,2BAA2B,GAAG,IAAI,CAAC,OAAO,CAAC,8BAA8B,EAAE,CAAC;YAClF,MAAM,SAAS,GAAG,MAAM,iBAAiB,CAAC;YAC1C,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,OAAO;aACV;YAED,MAAM,OAAO,GAAgC,EAAE,CAAC;YAChD,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE;gBAChE,IAAI,QAAQ,CAAC,uBAAuB,KAAK,SAAS,EAAE;oBAChD,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAC3B,MAAM,EACN,IAAI,wBAAwB,CACxB,QAAQ,CAAC,uBAAuB,EAChC,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,cAAc,EACnB,2BAA2B,CAC9B,CACJ,CAAC;iBACL;gBACD,OAAO,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;aACzD;YACD,IAAI,CAAC,yBAAyB,GAAG,EAAE,OAAO,EAAE,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,+GAA+G;QAC/G,4DAA4D;QAC5D,IAAI,CAAC,cAAc,GAAG,IAAI,WAAW,CAA6C,KAAK,IAAI,EAAE;YACzF,MAAM,SAAS,GAAG,MAAM,iBAAiB,CAAC;YAC1C,IAAI,SAAS,KAAK,SAAS,EAAE;gBACzB,OAAO,IAAI,GAAG,EAAE,CAAC;aACpB;YAED,MAAM,OAAO,GAAgC,EAAE,CAAC;YAChD,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE;gBAChE,OAAO,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;aACzD;YACD,gGAAgG;YAChG,uGAAuG;YACvG,4BAA4B;YAC5B,MAAM,UAAU,GAAG,oBAAoB,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC;YAE1E,MAAM,gBAAgB,GAAG,yBAAyB,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;YACxF,kGAAkG;YAClG,oGAAoG;YACpG,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE;gBAChE,IAAI,QAAQ,CAAC,uBAAuB,KAAK,SAAS,EAAE;oBAChD,MAAM,kBAAkB,GAAG,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjE,IAAI,kBAAkB,KAAK,SAAS,EAAE;wBAClC,kBAAkB,CAAC,cAAc,GAAG,QAAQ,CAAC,uBAAuB,CAAC;qBACxE;iBACJ;aACJ;YACD,OAAO,gBAAgB,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,6GAA6G;QAC7G,wGAAwG;QACxG,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,iBAChC,SAAS,EAAE,IAAI,CAAC,SAAS,EACzB,YAAY,EAAE,IAAI,CAAC,YAAY,EAC/B,KAAK,EAAE,IAAI,CAAC,WAAW,EACvB,QAAQ,EAAE,IAAI,CAAC,cAAc,EAC7B,WAAW,EAAE,IAAI,CAAC,gBAAgB,EAClC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EACvB,aAAa,EAAE,IAAI,CAAC,sBAAsB,EAC1C,eAAe,EAAE,IAAI,CAAC,iBAAiB,EACvC,QAAQ,EAAE,YAAY,CAAC,QAAQ,EAC/B,YAAY,EAAE,IAAI,CAAC,YAAY,IAC5B,IAAI,CAAC,SAAS,EACnB,CAAC;QACH,IAAI,IAAI,CAAC,kBAAkB,EAAE;YACzB,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,kBAAkB,CAAC;gBAC9B,SAAS,EAAE,wBAAwB;gBACnC,SAAS,EAAE,aAAa;aAC3B,CAAC,CAAC;SACN;QAED,mFAAmF;QACnF,IAAI,IAAI,CAAC,WAAW,EAAE;YAClB,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;gBACtC,MAAM,GAAG,GAAG,mBAAmB,CAAC,kBAAkB,CAC9C,KAAK,EACL,sBAAsB,CACzB,CAAC;gBACF,GAAG,CAAC,sBAAsB,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC;gBACzD,MAAM,GAAG,CAAC;YACd,CAAC,CAAC,CAAC;SACN;IACL,CAAC;IArZM,MAAM,CAAC,MAAM,CAAC,YAA2C;QAC5D,OAAO,IAAI,gBAAgB,CAAC,YAAY,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;;;OAOG;IACH,IAAW,sBAAsB;QAC7B,OAAO,IAAI,CAAC,sBAAsB;YAC9B,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,sBAAsB,KAAK,IAAI,CAAC,gBAAgB,CAAC,CAAC;IACpF,CAAC;IAiCD,IAAW,eAAe;QACtB,OAAO,IAAI,CAAC,gBAAgB,CAAC;IACjC,CAAC;IAqWD;;;OAGG;IACI,KAAK,CAAC,cAAc,CACvB,OAOC;QAED,MAAM,EACF,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,sBAAsB,GAC5E,GAAG,OAAO,CAAC;QAEZ,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM;YACzB,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;YACvG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC;QAErB,OAAO,gBAAgB,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,mBAAmB,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;YAC/F,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;YAE3B,qEAAqE;YACrE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACpD,MAAM,QAAQ,GAAG,oBAAoB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAE7D,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACpE,KAAK,CAAC,GAAG,mBAAM,OAAO,EAAG,CAAC;YAC1B,IAAI,CAAC,aAAa,EAAE,CAAC;YACrB,OAAO,OAAO,CAAC;QACnB,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACvC,CAAC;IAEO,KAAK,CAAC,aAAa;QACvB,+CAA+C;QAC/C,MAAM,IAAI,CAAC,oBAAoB,CAAC;QAChC,2DAA2D;QAC3D,MAAM,IAAI,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC;IAC7C,CAAC;IAEO,KAAK,CAAC,cAAc,CAAC,MAA8B,EAAE,QAAmB,EAAE,MAAwB;QACtG,sGAAsG;QACtG,oEAAoE;QACpE,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAE7C,uGAAuG;QACvG,2FAA2F;QAC3F,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAE7C,oGAAoG;QACpG,MAAM,2BAA2B,GAAG,IAAI,CAAC,OAAO,CAAC,8BAA8B,EAAE,CAAC;QAClF,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,QAAQ,EAAE,2BAA2B,CAAC,CAAC;QACvE,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,2BAA2B,CAAC,CAAC;QAEvF,oGAAoG;QACpG,qCAAqC;QACrC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,2BAA2B,CAAC,CAAC;QAEzD,sGAAsG;QACtG,oCAAoC;QACpC,IAAI,IAAI,CAAC,QAAQ,EAAE;YACf,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;SAC5D;QAED,2GAA2G;QAC3G,+GAA+G;QAC/G,wGAAwG;QACxG,MAAM,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;QAEzC,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACI,SAAS,CACZ,QAAiB,EACjB,UAAmB,EACnB,gBAAoC;;QAEpC,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,yBAAyB,KAAK,SAAS,EAAE;YACnE,OAAO;SACV;QAED,MAAM,OAAO,GAA4B,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACzD,KAAK,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,EAAE;YAC3F,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG;gBACtB,cAAc;gBACd,uBAAuB,EAAE,MAAA,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,CAAC,0CAAE,uBAAuB;aAC5F,CAAC;SACL;QAED,MAAM,yBAAyB,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC,CAAC;QAEjF;;;WAGG;QACH,IAAI,IAAI,CAAC,YAAY,EAAE;YACnB,IAAI,CAAC,6BAA6B,GAAG,yBAAyB,CAAC;YAC/D,IACI,IAAI,CAAC,4BAA4B,KAAK,SAAS;gBAC/C,IAAI,CAAC,4BAA4B,KAAK,yBAAyB;gBAC/D,CAAC,QAAQ;gBACT,UAAU,EACZ;gBACE,MAAM,KAAK,GAAG,UAAU,EAAE,CAAC;gBAC3B,KAAK,CAAC,eAAe,EAAE,CAAC;gBACxB,OAAO;oBACH,OAAO,EAAE;wBACL,IAAI,EAAE,WAAW,CAAC,MAAM;wBACxB,MAAM,EAAE,IAAI,SAAS,EAAE;wBACvB,UAAU,EAAE,WAAW,CAAC,IAAI;qBAC/B;oBACD,KAAK;iBACR,CAAC;aACL;SACJ;QAED,MAAM,OAAO,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACzC,OAAO,CAAC,OAAO,CAAC,GAAG,YAAY,OAAO,EAAE,yBAAyB,CAAC,CAAC;QACnE,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IACpC,CAAC;IAEM,WAAW;QACd,OAAO;YACH;;;eAGG;YACH,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YACrD,sBAAsB,EAAE,IAAI,CAAC,sBAAsB;YACnD,YAAY,EAAE,IAAI,CAAC,YAAY;SAClC,CAAC;IACN,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,gBAAgB;QACzB,OAAO,IAAI,CAAC,cAAc,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,2BAA2B,CACpC,MAA4B,EAC5B,gBAAkC;QAElC,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE;YACnD,OAAO;SACV;QAED,2GAA2G;QAC3G,uDAAuD;QACvD,IAAI,MAAM,CAAC,iBAAiB,EAAE;YAC1B,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,gBAAgB,CAAC;YACpD,IAAI,CAAC,sBAAsB,GAAG,KAAK,CAAC;YACpC,IAAI,IAAI,CAAC,YAAY,EAAE;gBACnB,IAAI,CAAC,4BAA4B,GAAG,IAAI,CAAC,6BAA6B,CAAC;gBACvE,IAAI,CAAC,6BAA6B,GAAG,SAAS,CAAC;aAClD;YACD,OAAO;SACV;QACD,4GAA4G;QAC5G,4CAA4C;QAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;QACjC,MAAM,cAAc,GAAG,QAAQ,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACxD,IAAI,cAAc,EAAE;YAChB,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAA4B,cAAc,CAAC,CAAC;YACnF,IAAI,CAAC,sBAAsB,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;SACxD;QAED,MAAM,cAAc,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACjD,IAAI,cAAc,KAAK,SAAS,IAAI,IAAI,CAAC,YAAY,EAAE;YACnD,MAAM,aAAa,GAAG,MAAM,sBAAsB,CAC9C,cAAc,EACd,gBAAgB,CACnB,CAAC;YACF,IAAI,CAAC,4BAA4B,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC,CAAC;SAC5F;aAAM;YACH,IAAI,CAAC,4BAA4B,GAAG,SAAS,CAAC;SACjD;QACD,IAAI,CAAC,6BAA6B,GAAG,SAAS,CAAC;IACnD,CAAC;IAED;;;;;;;OAOG;IACI,WAAW,CACd,QAAgB,EAChB,MAA4B,EAC5B,WAAoB,EACpB,WAA+B,EAC/B,cAA+B;QAE/B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;YACnB,OAAO;SACV;QAED,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnE,IAAI,gBAAgB,IAAI,gBAAgB,CAAC,KAAK,KAAK,iBAAiB,CAAC,MAAM,EAAE;YACzE,IAAI,CAAC,gBAAgB,CACjB,MAAM,EACN,QAAQ,EACR,gBAAgB,EAChB,SAAS,CAAC,gBAAgB,EAC1B,WAAW,EACX,WAAW,EACX,cAAc,CACjB,CAAC;SACL;IACL,CAAC;IAED;;;;;;OAMG;IACI,sBAAsB,CAAC,YAAoB,EAAE,UAAkB;;QAClE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;YACnB,OAAO;SACV;QAED,MAAM,cAAc,GAAG,MAAA,IAAI,CAAC,yBAAyB,CAAC,GAAG,CAAC,YAAY,CAAC,mCAAI,EAAE,CAAC;QAC9E,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChC,IAAI,CAAC,yBAAyB,CAAC,GAAG,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;QAEjE,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACrE,IAAI,gBAAgB,IAAI,gBAAgB,CAAC,KAAK,KAAK,iBAAiB,CAAC,MAAM,EAAE;YACzE,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,UAAU,EAAE,gBAAgB,EAAE,YAAY,CAAC,CAAC;SAChF;IACL,CAAC;IAEM,OAAO;QACV,IAAI,IAAI,CAAC,kBAAkB,KAAK,SAAS,EAAE;YACvC,YAAY,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;YACtC,IAAI,CAAC,kBAAkB,GAAG,SAAS,CAAC;SACvC;IACL,CAAC;IAED;;;;;;;;OAQG;IACK,kBAAkB,CACtB,MAA8B,EAC9B,QAAmB,EACnB,2BAAoC;QAEpC,IAAI,CAAC,yBAAyB,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,CAAC;QAEvC,2FAA2F;QAC3F,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,iBAAiB,EAAE;YAC7C,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjE,IAAI,gBAAgB,KAAK,SAAS,EAAE;gBAChC,uDAAuD;gBACvD,gBAAgB,CAAC,YAAY,EAAE,CAAC;gBAChC,yDAAyD;gBACzD,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;aAC9C;SACJ;QAED;;;;WAIG;QACH,IAAI,2BAA2B,KAAK,SAAS,EAAE;YAC3C,OAAO;SACV;QAED;;;;WAIG;QACH,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,cAAc,EAAE;YAC1C,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjE,IAAI,gBAAgB,KAAK,SAAS,EAAE;gBAChC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAC3B,MAAM,EACN,IAAI,wBAAwB,CACxB,2BAA2B,EAC3B,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,cAAc,EACnB,2BAA2B,CAC9B,CACJ,CAAC;aACL;iBAAM;gBACH,gBAAgB,CAAC,cAAc,CAAC,2BAA2B,CAAC,CAAC;aAChE;SACJ;IACL,CAAC;IAED;;;;;;;OAOG;IACK,uBAAuB,CAAC,aAAqC,EAAE,MAAwB;QAC3F,sDAAsD;QACtD,IAAI,IAAI,CAAC,yBAAyB,KAAK,SAAS,EAAE;YAC9C,OAAO;SACV;QAED,8DAA8D;QAC9D,MAAM,yBAAyB,GAAG,IAAI,CAAC,6BAA6B,CAChE,aAAa,EACb,IAAI,CAAC,yBAAyB,EAC9B,IAAI,CAAC,yBAAyB,CACjC,CAAC;QAEF,IAAI,IAAI,CAAC,eAAe,IAAI,yBAAyB,CAAC,MAAM,GAAG,CAAC,EAAE;YAC9D,yBAAyB,CAAC,OAAO,CAAC,CAAC,wBAAwB,EAAE,EAAE;gBAC3D,MAAM,KAAK,GAA+B;oBACtC,SAAS,EAAE,6BAA6B;oBACxC,QAAQ,EAAE,wBAAwB,CAAC,CAAC,CAAC;oBACrC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC;iBACxD,CAAC;gBACF,MAAM,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;YACvC,CAAC,CAAC,CAAC;SACN;QAED,8GAA8G;QAC9G,QAAQ;QACR,IAAI,IAAI,CAAC,yBAAyB,CAAC,IAAI,KAAK,CAAC,EAAE;YAC3C,OAAO;SACV;QAED;;;;;;;;;;;;;;WAcG;QACH,MAAM,cAAc,GAAG,2BAA2B,CAAC,IAAI,CAAC,yBAAyB,EAAE,aAAa,CAAC,CAAC;QAClG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC,cAAwB,EAAE,YAAoB,EAAE,EAAE;YACtF,IAAI,cAAc,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,SAAS,EAAE;gBACpD,cAAc,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,cAAc,CAAC;aACzD;iBAAM;gBACH,cAAc,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;aAChE;QACL,CAAC,CAAC,CAAC;QAEH;;;;WAIG;QACH,MAAM,QAAQ,GAAG,oBAAoB,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrE,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,iBAAiB,EAAE;YAC7C,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjE,IAAI,gBAAgB,KAAK,SAAS,EAAE;gBAChC,uDAAuD;gBACvD,gBAAgB,CAAC,YAAY,EAAE,CAAC;gBAChC,yDAAyD;gBACzD,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;aAC9C;SACJ;IACL,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,6BAA6B,CACjC,aAAqC,EACrC,cAAsC,EACtC,kBAAyC;QAEzC,MAAM,CACF,cAAc,KAAK,SAAS,EAC5B,KAAK,CACR,CAAC;QAEF,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC3D,MAAM,yBAAyB,GAAyB,EAAE,CAAC;QAC3D,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,qBAAqB,CAAC,EAAE,EAAE;;YACrD,MAAM,cAAc,GAAG,MAAA,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,mCAAI,EAAE,CAAC;YAC5D,MAAM,cAAc,GAAG,MAAA,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,mCAAI,EAAE,CAAC;YAC5D,MAAM,qBAAqB,GAAa,EAAE,CAAC;YAC3C,qBAAqB,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;gBACpC,MAAM,sBAAsB,GACxB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,UAAU,CAAC,IAAI;oBACnD,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,UAAU,CAAC,SAAS,CAAC;gBAC7D,gEAAgE;gBAChE,MAAM,gCAAgC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;gBACnE,IACI,sBAAsB;oBACtB,gCAAgC;oBAChC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EACtE;oBACE,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACrC;YACL,CAAC,CAAC,CAAC;YACH,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE;gBAClC,yBAAyB,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC,CAAC;aACnE;QACL,CAAC,CAAC,CAAC;QAEH,gEAAgE;QAChE,OAAO,yBAAyB,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACK,aAAa,CAAC,QAAmB;QACrC,MAAM,OAAO,GAAa;YACtB,SAAS,EAAE,CAAC;YACZ,cAAc,EAAE,CAAC;YACjB,mBAAmB,EAAE,CAAC;YACtB,cAAc,EAAE,CAAC;YACjB,mBAAmB,EAAE,CAAC;YACtB,wBAAwB,EAAE,CAAC;YAC3B,gBAAgB,EAAE,CAAC;YACnB,qBAAqB,EAAE,CAAC;YACxB,0BAA0B,EAAE,CAAC;SAChC,CAAC;QAEF,MAAM,eAAe,GAAG,CAAC,MAAc,EAAE,UAAmB,EAAE,EAAE;YAC5D,OAAO,CAAC,SAAS,EAAE,CAAC;YACpB,iGAAiG;YACjG,sFAAsF;YACtF,MAAM,YAAY,GAAG,IAAI,CAAC,yBAAyB,KAAK,SAAS;gBAC7D,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,UAAU,CAAC;YAC3D,IAAI,YAAY,EAAE;gBACd,OAAO,CAAC,gBAAgB,EAAE,CAAC;aAC9B;YACD,IAAI,CAAC,UAAU,EAAE;gBACb,OAAO,CAAC,cAAc,EAAE,CAAC;aAC5B;YAED,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,UAAU,CAAC,SAAS,EAAE;gBAC3D,OAAO,CAAC,cAAc,EAAE,CAAC;gBACzB,IAAI,YAAY,EAAE;oBACd,OAAO,CAAC,qBAAqB,EAAE,CAAC;iBACnC;gBACD,IAAI,CAAC,UAAU,EAAE;oBACb,OAAO,CAAC,mBAAmB,EAAE,CAAC;iBACjC;aACJ;YACD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,UAAU,CAAC,IAAI,EAAE;gBACtD,OAAO,CAAC,mBAAmB,EAAE,CAAC;gBAC9B,IAAI,YAAY,EAAE;oBACd,OAAO,CAAC,0BAA0B,EAAE,CAAC;iBACxC;gBACD,IAAI,CAAC,UAAU,EAAE;oBACb,OAAO,CAAC,wBAAwB,EAAE,CAAC;iBACtC;aACJ;QACL,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,iBAAiB,EAAE;YAC7C,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;SAClD;QAED,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,cAAc,EAAE;YAC1C,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;SACnD;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;OAGG;IACK,cAAc,CAAC,MAAwB,EAAE,2BAAoC;QACjF,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,kBAAkB,CAAC,KAAK,IAAI;eACnD,2BAA2B,KAAK,SAAS;eACzC,IAAI,CAAC,cAAc,KAAK,SAAS,EAAE;YACtC,OAAO;SACV;QAED,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC,gBAAgB,EAAE,MAAM,EAAE,EAAE;YAC7D,IAAI,gBAAgB,CAAC,KAAK,KAAK,iBAAiB,CAAC,UAAU,EAAE;gBACzD,OAAO;aACV;YAED,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,QAAQ,KAAK,UAAU,CAAC,SAAS,IAAI,QAAQ,KAAK,UAAU,CAAC,IAAI,EAAE;gBACnE,OAAO;aACV;YAED,0EAA0E;YAC1E,MAAM,aAAa,GAAG,WAAW,MAAM,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE;gBAClD,OAAO;aACV;YACD,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YACjD,MAAM,CAAC,kBAAkB,CAAC;gBACtB,SAAS,EAAE,iBAAiB;gBAC5B,EAAE,EAAE,MAAM;gBACV,IAAI,EAAE,QAAQ;gBACd,GAAG,EAAE,2BAA2B,GAAG,gBAAgB,CAAC,uBAAuB;gBAC3E,OAAO,EAAE,IAAI,CAAC,cAAc;gBAC5B,eAAe,EAAE,IAAI,CAAC,aAAa;gBACnC,eAAe,EAAE,IAAI,CAAC,yBAAyB,EAAE;aACpD,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;OAEG;IACK,gBAAgB,CACpB,SAA2C,EAC3C,MAAc,EACd,gBAA0C,EAC1C,UAAmB,EACnB,WAA+B,EAC/B,2BAA2B,GAAG,IAAI,CAAC,OAAO,CAAC,8BAA8B,EAAE,EAC3E,cAA+B;QAE/B,0GAA0G;QAC1G,oEAAoE;QACpE,uCAAuC;QACvC,IAAI,2BAA2B,KAAK,SAAS,IAAI,gBAAgB,CAAC,KAAK,KAAK,iBAAiB,CAAC,MAAM,EAAE;YAClG,OAAO;SACV;QAED,yGAAyG;QACzG,6GAA6G;QAC7G,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,SAAS,KAAK,QAAQ,EAAE;YACpD,OAAO;SACV;QAED,2GAA2G;QAC3G,2GAA2G;QAC3G,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAClD,IAAI,QAAQ,KAAK,UAAU,CAAC,SAAS,IAAI,QAAQ,KAAK,UAAU,CAAC,IAAI,EAAE;YACnE,OAAO;SACV;QAED,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC;QACrC,MAAM,aAAa,GAAG,GAAG,KAAK,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC;QACxD,IAAI,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE;YAClD,OAAO;SACV;QACD,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAEjD,MAAM,UAAU,GAAG;YACf,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,QAAQ;YACd,SAAS,EAAE,gBAAgB,CAAC,uBAAuB;YACnD,GAAG,EAAE,2BAA2B,GAAG,gBAAgB,CAAC,uBAAuB;YAC3E,OAAO,EAAE,gBAAgB,CAAC,KAAK,KAAK,iBAAiB,CAAC,QAAQ;gBAC1D,CAAC,CAAC,IAAI,CAAC,iBAAiB;gBACxB,CAAC,CAAC,IAAI,CAAC,cAAc;YACzB,eAAe,EAAE,IAAI,CAAC,aAAa;YACnC,eAAe,EAAE,IAAI,CAAC,yBAAyB,EAAE;YACjD,eAAe,EAAE,cAAc,aAAd,cAAc,uBAAd,cAAc,CAAG,cAAc,CAAC,eAAe,CAAC;YACjE,SAAS,EAAE,cAAc,aAAd,cAAc,uBAAd,cAAc,CAAG,cAAc,CAAC,SAAS,CAAC;YACrD,MAAM,EAAE,UAAU;SACrB,CAAC;QAEF,4GAA4G;QAC5G,4GAA4G;QAC5G,iFAAiF;QACjF,IAAI,IAAI,CAAC,kBAAkB,EAAE;YACzB,IAAI,CAAC,kBAAkB,CAAC,IAAI,iCAAM,UAAU,KAAE,SAAS,EAAE,KAAK,IAAG,CAAC;SACrE;aAAM;YACH,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,cAAc,iCACtB,UAAU,KACb,SAAS,EAAE,GAAG,KAAK,UAAU,SAAS,EAAE,EACxC,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,gBAAgB,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,SAAS,IACrG,CAAC;SACN;IACL,CAAC;IAEO,KAAK,CAAC,qBAAqB,CAAC,MAAwB;QACxD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,kBAAkB,EAAE;YAC9C,MAAM,EAAE,SAAS,EAAE,KAAK,KAAoB,UAAU,EAAzB,UAAU,UAAK,UAAU,EAAhD,sBAAmC,CAAa,CAAC;YACvD;;;;;eAKG;YACH,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACxE,MAAM,MAAM,GAAG,gBAAgB,KAAK,SAAS,IAAI,gBAAgB,CAAC,KAAK,KAAK,iBAAiB,CAAC,MAAM,CAAC;YACrG,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,KAAK,MAAM,EAAE;gBACtC,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBACzD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBACjG,MAAM,CAAC,cAAc,iCACd,UAAU,KACb,SAAS,EAAE,GAAG,KAAK,UAAU,SAAS,EAAE,EACxC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,gBAAgB,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,SAAS,EACnF,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,gBAAgB,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,SAAS,IACjG,CAAC;aACN;SACJ;QACD,IAAI,CAAC,kBAAkB,GAAG,EAAE,CAAC;IACjC,CAAC;CACJ;AAED;;;GAGG;AACH,KAAK,UAAU,sBAAsB,CACjC,cAA6B,EAC7B,gBAAkC;IAElC,IAAI,WAAW,GAA4B,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC3D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;QACjD,mDAAmD;QACnD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE;YAC/B,SAAS;SACZ;QAED,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,MAAM,KAAK,SAAS,EAAE;YACtB,SAAS;SACZ;QACD,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAA0B,MAAM,CAAC,CAAC;QACxE,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAC3E,0DAA0D;QAC1D,WAAW,GAAG,6BAA6B,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;KACrE;IACD,OAAO,WAAW,CAAC;AACvB,CAAC;AAED,SAAS,qBAAqB,CAAC,OAAgC;IAC3D,MAAM,aAAa,GAA2C,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9F,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,aAAa,GAA4B,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC/D,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE;QAC5C,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;QAC/B,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;KAC5C;IACD,OAAO,aAAa,CAAC;AACzB,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CACnB,SAAiB,EACjB,SAAqB,EACrB,UAA0D;IAE1D,yDAAyD;IACzD,MAAM,UAAU,GAAG,UAAU,CAAC;IAC9B,IAAI,KAAoC,CAAC;IACzC,IAAI,SAAS,GAAG,UAAU,EAAE;QACxB,MAAM,YAAY,GAAG,SAAS,GAAG,UAAU,CAAC;QAC5C,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,YAAY,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC;KAC7F;SAAM;QACH,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;KACpD;IACD,UAAU,CAAC,KAAK,CAAC,CAAC;AACtB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ITelemetryLogger, ITelemetryPerformanceEvent } from \"@fluidframework/common-definitions\";\nimport { assert, LazyPromise, Timer } from \"@fluidframework/common-utils\";\nimport { ICriticalContainerError } from \"@fluidframework/container-definitions\";\nimport { ClientSessionExpiredError, DataProcessingError, UsageError } from \"@fluidframework/container-utils\";\nimport { IRequestHeader } from \"@fluidframework/core-interfaces\";\nimport {\n    cloneGCData,\n    concatGarbageCollectionStates,\n    concatGarbageCollectionData,\n    IGCResult,\n    runGarbageCollection,\n    unpackChildNodesGCDetails,\n} from \"@fluidframework/garbage-collector\";\nimport { ISnapshotTree, SummaryType } from \"@fluidframework/protocol-definitions\";\nimport {\n    gcBlobKey,\n    IGarbageCollectionData,\n    IGarbageCollectionState,\n    IGarbageCollectionDetailsBase,\n    ISummarizeResult,\n    ITelemetryContext,\n    IGarbageCollectionNodeData,\n} from \"@fluidframework/runtime-definitions\";\nimport {\n    mergeStats,\n    ReadAndParseBlob,\n    RefreshSummaryResult,\n    SummaryTreeBuilder,\n} from \"@fluidframework/runtime-utils\";\nimport {\n    ChildLogger,\n    loggerToMonitoringContext,\n    MonitoringContext,\n    PerformanceEvent,\n    TelemetryDataTag,\n} from \"@fluidframework/telemetry-utils\";\n\nimport { IGCRuntimeOptions, RuntimeHeaders } from \"./containerRuntime\";\nimport { getSummaryForDatastores } from \"./dataStores\";\nimport {\n    getGCVersion,\n    GCVersion,\n    IContainerRuntimeMetadata,\n    metadataBlobName,\n    ReadFluidDataStoreAttributes,\n    dataStoreAttributesBlobName,\n    IGCMetadata,\n} from \"./summaryFormat\";\n\n/** This is the current version of garbage collection. */\nconst GCVersion = 1;\n\n// The key for the GC tree in summary.\nexport const gcTreeKey = \"gc\";\n// They prefix for GC blobs in the GC tree in summary.\nexport const gcBlobPrefix = \"__gc\";\n\n// Feature gate key to turn GC on / off.\nconst runGCKey = \"Fluid.GarbageCollection.RunGC\";\n// Feature gate key to turn GC sweep on / off.\nconst runSweepKey = \"Fluid.GarbageCollection.RunSweep\";\n// Feature gate key to turn GC test mode on / off.\nconst gcTestModeKey = \"Fluid.GarbageCollection.GCTestMode\";\n// Feature gate key to write GC data at the root of the summary tree.\nconst writeAtRootKey = \"Fluid.GarbageCollection.WriteDataAtRoot\";\n// Feature gate key to expire a session after a set period of time.\nexport const runSessionExpiryKey = \"Fluid.GarbageCollection.RunSessionExpiry\";\n// Feature gate key to disable expiring session after a set period of time, even if expiry value is present\nexport const disableSessionExpiryKey = \"Fluid.GarbageCollection.DisableSessionExpiry\";\n// Feature gate key to write the gc blob as a handle if the data is the same.\nexport const trackGCStateKey = \"Fluid.GarbageCollection.TrackGCState\";\n// Feature gate key to turn GC sweep log off.\nconst disableSweepLogKey = \"Fluid.GarbageCollection.DisableSweepLog\";\n\n// One day in milliseconds.\nexport const oneDayMs = 1 * 24 * 60 * 60 * 1000;\n\nconst defaultInactiveTimeoutMs = 7 * oneDayMs; // 7 days\nexport const defaultSessionExpiryDurationMs = 30 * oneDayMs; // 30 days\n\n/** The statistics of the system state after a garbage collection run. */\nexport interface IGCStats {\n    /** The number of nodes in the container. */\n    nodeCount: number;\n    /** The number of data stores in the container. */\n    dataStoreCount: number;\n    /** The number of attachment blobs in the container. */\n    attachmentBlobCount: number;\n    /** The number of unreferenced nodes in the container. */\n    unrefNodeCount: number;\n    /** The number of unreferenced data stores in the container. */\n    unrefDataStoreCount: number;\n    /** The number of unreferenced attachment blobs in the container. */\n    unrefAttachmentBlobCount: number;\n    /** The number of nodes whose reference state updated since last GC run. */\n    updatedNodeCount: number;\n    /** The number of data stores whose reference state updated since last GC run. */\n    updatedDataStoreCount: number;\n    /** The number of attachment blobs whose reference state updated since last GC run. */\n    updatedAttachmentBlobCount: number;\n}\n\n/** The types of GC nodes in the GC reference graph. */\nexport const GCNodeType = {\n    // Nodes that are for data stores.\n    DataStore: \"DataStore\",\n    // Nodes that are within a data store. For example, DDS nodes.\n    SubDataStore: \"SubDataStore\",\n    // Nodes that are for attachment blobs, i.e., blobs uploaded via BlobManager.\n    Blob: \"Blob\",\n    // Nodes that are neither of the above. For example, root node.\n    Other: \"Other\",\n};\nexport type GCNodeType = typeof GCNodeType[keyof typeof GCNodeType];\n\n/** Defines the APIs for the runtime object to be passed to the garbage collector. */\nexport interface IGarbageCollectionRuntime {\n    /** Before GC runs, called to notify the runtime to update any pending GC state. */\n    updateStateBeforeGC(): Promise<void>;\n    /** Returns the garbage collection data of the runtime. */\n    getGCData(fullGC?: boolean): Promise<IGarbageCollectionData>;\n    /** After GC has run, called to notify the runtime of routes that are used in it. */\n    updateUsedRoutes(usedRoutes: string[], gcTimestamp?: number): void;\n    /** After GC has run, called to delete objects in the runtime whose routes are unused. */\n    deleteUnusedRoutes(unusedRoutes: string[]): void;\n    /** Returns a referenced timestamp to be used to track unreferenced nodes. */\n    getCurrentReferenceTimestampMs(): number | undefined;\n    /** Returns the type of the GC node. */\n    getNodeType(nodePath: string): GCNodeType;\n    /** Called when the runtime should close because of an error. */\n    closeFn(error?: ICriticalContainerError): void;\n}\n\n/** Defines the contract for the garbage collector. */\nexport interface IGarbageCollector {\n    /** Tells whether GC should run or not. */\n    readonly shouldRunGC: boolean;\n    /** Tells whether the GC state in summary needs to be reset in the next summary. */\n    readonly summaryStateNeedsReset: boolean;\n    /** Tells whether GC data should be written to the root of the summary tree. */\n    readonly writeDataAtRoot: boolean;\n    readonly trackGCState: boolean;\n    /** Run garbage collection and update the reference / used state of the system. */\n    collectGarbage(\n        options: { logger?: ITelemetryLogger; runSweep?: boolean; fullGC?: boolean; },\n    ): Promise<IGCStats>;\n    /** Summarizes the GC data and returns it as a summary tree. */\n    summarize(\n        fullTree: boolean,\n        trackState: boolean,\n        telemetryContext?: ITelemetryContext,\n    ): ISummarizeResult | undefined;\n    /** Returns the garbage collector specific metadata to be written into the summary. */\n    getMetadata(): IGCMetadata;\n    /** Returns a map of each node id to its base GC details in the base summary. */\n    getBaseGCDetails(): Promise<Map<string, IGarbageCollectionDetailsBase>>;\n    /** Called when the latest summary of the system has been refreshed. */\n    latestSummaryStateRefreshed(result: RefreshSummaryResult, readAndParseBlob: ReadAndParseBlob): Promise<void>;\n    /** Called when a node is updated. Used to detect and log when an inactive node is changed or loaded. */\n    nodeUpdated(\n        nodePath: string,\n        reason: \"Loaded\" | \"Changed\",\n        timestampMs?: number,\n        packagePath?: readonly string[],\n        requestHeaders?: IRequestHeader,\n    ): void;\n    /** Called when a reference is added to a node. Used to identify nodes that were referenced between summaries. */\n    addedOutboundReference(fromNodePath: string, toNodePath: string): void;\n    dispose(): void;\n}\n\n/** Parameters necessary for creating a GarbageCollector. */\nexport interface IGarbageCollectorCreateParams {\n    readonly runtime: IGarbageCollectionRuntime;\n    readonly gcOptions: IGCRuntimeOptions;\n    readonly baseLogger: ITelemetryLogger;\n    readonly existing: boolean;\n    readonly metadata: IContainerRuntimeMetadata | undefined;\n    readonly baseSnapshot: ISnapshotTree | undefined;\n    readonly isSummarizerClient: boolean;\n    readonly getNodePackagePath: (nodePath: string) => Promise<readonly string[] | undefined>;\n    readonly getLastSummaryTimestampMs: () => number | undefined;\n    readonly readAndParseBlob: ReadAndParseBlob;\n    readonly snapshotCacheExpiryMs?: number;\n}\n\n/** The state of node that is unreferenced. */\nconst UnreferencedState = {\n    /** The node is active, i.e., it can become referenced again. */\n    Active: \"Active\",\n    /** The node is inactive, i.e., it should not become referenced. */\n    Inactive: \"Inactive\",\n    /** The node is ready to be deleted by the sweep phase. */\n    SweepReady: \"SweepReady\",\n};\nexport type UnreferencedState = typeof UnreferencedState[keyof typeof UnreferencedState];\n\n/** The event that is logged when unreferenced node is used after a certain time. */\ninterface IUnreferencedEventProps {\n    usageType: \"Changed\" | \"Loaded\" | \"Revived\";\n    state: UnreferencedState;\n    id: string;\n    type: GCNodeType;\n    unrefTime: number;\n    age: number;\n    completedGCRuns: number;\n    fromId?: string;\n    timeout?: number;\n    lastSummaryTime?: number;\n    externalRequest?: boolean;\n    viaHandle?: boolean;\n}\n\n/**\n * Helper class that tracks the state of an unreferenced node such as the time it was unreferenced and if it can\n * be deleted by the sweep phase.\n */\nclass UnreferencedStateTracker {\n    private _state: UnreferencedState = UnreferencedState.Active;\n    public get state(): UnreferencedState {\n        return this._state;\n    }\n\n    private inactiveTimer: Timer | undefined;\n    private sweepTimer: ReturnType<typeof setTimeout> | undefined;\n\n    constructor(\n        public readonly unreferencedTimestampMs: number,\n        /** The time after which node transitions to Inactive state. */\n        private readonly inactiveTimeoutMs: number,\n        /** The time after which node transitions to SweepReady state; undefined if session expiry is disabled. */\n        private readonly sweepTimeoutMs?: number,\n        /** The current reference timestamp; undefined if no ops have ever been processed which can happen in tests. */\n        currentReferenceTimestampMs?: number,\n    ) {\n        // If there is no current reference timestamp, don't track the node's unreferenced state. This will happen\n        // later when updateTracking is called with a reference timestamp.\n        if (currentReferenceTimestampMs !== undefined) {\n            this.updateTracking(currentReferenceTimestampMs);\n        }\n    }\n\n    /* Updates the unreferenced state based on the provided timestamp. */\n    public updateTracking(currentReferenceTimestampMs: number) {\n        const unreferencedDurationMs = currentReferenceTimestampMs - this.unreferencedTimestampMs;\n\n        // If the node has been unreferenced for sweep timeout amount of time, update the state to SweepReady.\n        if (this.sweepTimeoutMs !== undefined && unreferencedDurationMs >= this.sweepTimeoutMs) {\n            this._state = UnreferencedState.SweepReady;\n            this.clearTimers();\n            return;\n        }\n\n        // If the node has been unreferenced for inactive timeoutMs amount of time, update the state to inactive.\n        // Also, start a timer for the sweep timeout.\n        if (unreferencedDurationMs >= this.inactiveTimeoutMs) {\n            this._state = UnreferencedState.Inactive;\n            this.clearTimers();\n\n            if (this.sweepTimeoutMs !== undefined) {\n                setLongTimeout(\n                    this.sweepTimeoutMs - unreferencedDurationMs,\n                    () => { this._state = UnreferencedState.SweepReady; },\n                    (timer) => { this.sweepTimer = timer; },\n                );\n            }\n            return;\n        }\n\n        // The node is still active. Start the inactive timer for the remaining duration.\n        const remainingDurationMs = this.inactiveTimeoutMs - unreferencedDurationMs;\n        if (this.inactiveTimer === undefined) {\n            const inactiveTimeoutHandler = () => {\n                this._state = UnreferencedState.Inactive;\n                // After the node becomes inactive, start the sweep timer after which the node will be ready for sweep.\n                if (this.sweepTimeoutMs !== undefined) {\n                    setLongTimeout(\n                        this.sweepTimeoutMs - this.inactiveTimeoutMs,\n                        () => { this._state = UnreferencedState.SweepReady; },\n                        (timer) => { this.sweepTimer = timer; },\n                    );\n                }\n            };\n            this.inactiveTimer = new Timer(remainingDurationMs, () => inactiveTimeoutHandler());\n        }\n        this.inactiveTimer.restart(remainingDurationMs);\n    }\n\n    private clearTimers() {\n        this.inactiveTimer?.clear();\n        if (this.sweepTimer !== undefined) {\n            clearTimeout(this.sweepTimer);\n        }\n    }\n\n    /** Stop tracking this node. Reset the unreferenced timers and state, if any. */\n    public stopTracking() {\n        this.clearTimers();\n        this._state = UnreferencedState.Active;\n    }\n}\n\n/**\n * The garbage collector for the container runtime. It consolidates the garbage collection functionality and maintains\n * its state across summaries.\n *\n * Node - represented as nodeId, it's a node on the GC graph\n * Outbound Route - a path from one node to another node, think `nodeA` -\\> `nodeB`\n * Graph - all nodes with their respective routes\n *             GC Graph\n *\n *               Node\n *        NodeId = \"datastore1\"\n *           /             \\\\\n *    OutboundRoute   OutboundRoute\n *         /                 \\\\\n *       Node               Node\n *  NodeId = \"dds1\"     NodeId = \"dds2\"\n */\nexport class GarbageCollector implements IGarbageCollector {\n    public static create(createParams: IGarbageCollectorCreateParams): IGarbageCollector {\n        return new GarbageCollector(createParams);\n    }\n\n    /**\n     * Tells whether the GC state needs to be reset in the next summary. We need to do this if:\n     * 1. GC was enabled and is now disabled. The GC state needs to be removed and everything becomes referenced.\n     * 2. GC was disabled and is now enabled. The GC state needs to be regenerated and added to summary.\n     * 3. The GC version in the latest summary is different from the current GC version. This can happen if:\n     *    3.1. The summary this client loaded with has data from a different GC version.\n     *    3.2. This client's latest summary was updated from a snapshot that has a different GC version.\n     */\n    public get summaryStateNeedsReset(): boolean {\n        return this.initialStateNeedsReset ||\n            (this.shouldRunGC && this.latestSummaryGCVersion !== this.currentGCVersion);\n    }\n\n    /**\n     * Tracks if GC is enabled for this document. This is specified during document creation and doesn't change\n     * throughout its lifetime.\n     */\n    private readonly gcEnabled: boolean;\n    /**\n     * Tracks if sweep phase is enabled for this document. This is specified during document creation and doesn't change\n     * throughout its lifetime.\n     */\n    private readonly sweepEnabled: boolean;\n\n    /**\n     * Tracks if GC should run or not. Even if GC is enabled for a document (see gcEnabled), it can be explicitly\n     * disabled via runtime options or feature flags.\n     */\n    public readonly shouldRunGC: boolean;\n    /**\n     * Tracks if sweep phase should run or not. Even if the sweep phase is enabled for a document (see sweepEnabled), it\n     * can be explicitly disabled via feature flags. It also won't run if session expiry is not enabled.\n     */\n    private readonly shouldRunSweep: boolean;\n\n    public readonly trackGCState: boolean;\n\n    private readonly testMode: boolean;\n    private readonly mc: MonitoringContext;\n\n    /**\n     * Tells whether the GC data should be written to the root of the summary tree.\n     */\n    private _writeDataAtRoot: boolean = true;\n    public get writeDataAtRoot(): boolean {\n        return this._writeDataAtRoot;\n    }\n\n    /**\n     * Tells whether the initial GC state needs to be reset. This can happen under 2 conditions:\n     * 1. The base snapshot contains GC state but GC is disabled. This will happen the first time GC is disabled after\n     *    it was enabled before. GC state needs to be removed from summary and all nodes should be marked referenced.\n     * 2. The base snapshot does not have GC state but GC is enabled. This will happen the very first time GC runs on\n     *    a document and the first time GC is enabled after is was disabled before.\n     *\n     * Note that the state needs reset only for the very first time summary is generated by this client. After that, the\n     * state will be up-to-date and this flag will be reset.\n    */\n    private initialStateNeedsReset: boolean = false;\n\n    // The current GC version that this container is running.\n    private readonly currentGCVersion = GCVersion;\n    // This is the version of GC data in the latest summary being tracked.\n    private latestSummaryGCVersion: GCVersion;\n\n    // Keeps track of the GC state from the last run.\n    private previousGCDataFromLastRun: IGarbageCollectionData | undefined;\n    /**\n     * Keeps track of the serialized GC blob from the latest summary successfully submitted to the server.\n     */\n    private latestSerializedSummaryState: string | undefined;\n    /**\n     * Keeps track of the serialized GC blob from the last GC run of the client.\n     */\n    private pendingSerializedSummaryState: string | undefined;\n    // Keeps a list of references (edges in the GC graph) between GC runs. Each entry has a node id and a list of\n    // outbound routes from that node.\n    private readonly newReferencesSinceLastRun: Map<string, string[]> = new Map();\n\n    // Promise when resolved initializes the base state of the nodes from the base summary state.\n    private readonly initializeBaseStateP: Promise<void>;\n    // The map of data store ids to their GC details in the base summary returned in getDataStoreGCDetails().\n    private readonly baseGCDetailsP: Promise<Map<string, IGarbageCollectionDetailsBase>>;\n    // Map of node ids to their unreferenced state tracker.\n    private readonly unreferencedNodesState: Map<string, UnreferencedStateTracker> = new Map();\n    // The timeout responsible for closing the container when the session has expired\n    private sessionExpiryTimer?: ReturnType<typeof setTimeout>;\n\n    // Keeps track of unreferenced events that are logged for a node. This is used to limit the log generation to one\n    // per event per node.\n    private readonly loggedUnreferencedEvents: Set<string> = new Set();\n    // Queue for unreferenced events that should be logged the next time GC runs.\n    private pendingEventsQueue: IUnreferencedEventProps[] = [];\n\n    // The number of times GC has successfully completed on this instance of GarbageCollector.\n    private completedRuns = 0;\n\n    private readonly runtime: IGarbageCollectionRuntime;\n    private readonly gcOptions: IGCRuntimeOptions;\n    private readonly isSummarizerClient: boolean;\n\n    /** The time in ms to expire a session for a client for gc. */\n    private readonly sessionExpiryTimeoutMs: number | undefined;\n    /** The time after which an unreferenced node is inactive. */\n    private readonly inactiveTimeoutMs: number;\n    /** The time after which an unreferenced node is ready to be swept. */\n    private readonly sweepTimeoutMs: number | undefined;\n\n    /** For a given node path, returns the node's package path. */\n    private readonly getNodePackagePath: (nodePath: string) => Promise<readonly string[] | undefined>;\n    /** Returns the timestamp of the last summary generated for this container. */\n    private readonly getLastSummaryTimestampMs: () => number | undefined;\n\n    protected constructor(createParams: IGarbageCollectorCreateParams) {\n        this.runtime = createParams.runtime;\n        this.isSummarizerClient = createParams.isSummarizerClient;\n        this.gcOptions = createParams.gcOptions;\n        this.getNodePackagePath = createParams.getNodePackagePath;\n        this.getLastSummaryTimestampMs = createParams.getLastSummaryTimestampMs;\n\n        const baseSnapshot = createParams.baseSnapshot;\n        const metadata = createParams.metadata;\n        const readAndParseBlob = createParams.readAndParseBlob;\n\n        this.mc = loggerToMonitoringContext(ChildLogger.create(\n            createParams.baseLogger, \"GarbageCollector\", { all: { completedGCRuns: () => this.completedRuns } },\n        ));\n\n        let prevSummaryGCVersion: number | undefined;\n\n        /**\n         * The following GC state is enabled during container creation and cannot be changed throughout its lifetime:\n         * 1. Whether running GC mark phase is allowed or not.\n         * 2. Whether running GC sweep phase is allowed or not.\n         * 3. Whether GC session expiry is enabled or not.\n         * For existing containers, we get this information from the metadata blob of its summary.\n         */\n        if (createParams.existing) {\n            prevSummaryGCVersion = getGCVersion(metadata);\n            // Existing documents which did not have metadata blob or had GC disabled have version as 0. For all\n            // other existing documents, GC is enabled.\n            this.gcEnabled = prevSummaryGCVersion > 0;\n            this.sweepEnabled = metadata?.sweepEnabled ?? false;\n            this.sessionExpiryTimeoutMs = metadata?.sessionExpiryTimeoutMs;\n        } else {\n            // Sweep should not be enabled without enabling GC mark phase. We could silently disable sweep in this\n            // scenario but explicitly failing makes it clearer and promotes correct usage.\n            if (this.gcOptions.sweepAllowed && this.gcOptions.gcAllowed === false) {\n                throw new UsageError(\"GC sweep phase cannot be enabled without enabling GC mark phase\");\n            }\n\n            // For new documents, GC is enabled by default. It can be explicitly disabled by setting the gcAllowed\n            // flag in GC options to false.\n            this.gcEnabled = this.gcOptions.gcAllowed !== false;\n            // The sweep phase has to be explicitly enabled by setting the sweepAllowed flag in GC options to true.\n            this.sweepEnabled = this.gcOptions.sweepAllowed === true;\n\n            // Set the Session Expiry only if the flag is enabled or the test option is set.\n            if (this.mc.config.getBoolean(runSessionExpiryKey) && this.gcEnabled) {\n                this.sessionExpiryTimeoutMs = defaultSessionExpiryDurationMs;\n            }\n        }\n\n        // If session expiry is enabled, we need to close the container when the session expiry timeout expires.\n        if (this.sessionExpiryTimeoutMs !== undefined && this.mc.config.getBoolean(disableSessionExpiryKey) !== true) {\n            // If Test Override config is set, override Session Expiry timeout.\n            const overrideSessionExpiryTimeoutMs =\n                this.mc.config.getNumber(\"Fluid.GarbageCollection.TestOverride.SessionExpiryMs\");\n            const timeoutMs = overrideSessionExpiryTimeoutMs ?? this.sessionExpiryTimeoutMs;\n\n            setLongTimeout(\n                timeoutMs,\n                () => { this.runtime.closeFn(new ClientSessionExpiredError(`Client session expired.`, timeoutMs)); },\n                (timer) => { this.sessionExpiryTimer = timer; },\n            );\n\n            /**\n             * Sweep timeout is the time after which unreferenced content can be swept.\n             * Sweep timeout = session expiry timeout + snapshot cache expiry timeout + one day buffer. The buffer is\n             * added to account for any clock skew. We use server timestamps throughout so the skew should be minimal\n             * but make it one day to be safe.\n             */\n            if (createParams.snapshotCacheExpiryMs !== undefined) {\n                this.sweepTimeoutMs = this.sessionExpiryTimeoutMs + createParams.snapshotCacheExpiryMs + oneDayMs;\n            }\n        }\n\n        // For existing document, the latest summary is the one that we loaded from. So, use its GC version as the\n        // latest tracked GC version. For new documents, we will be writing the first summary with the current version.\n        this.latestSummaryGCVersion = prevSummaryGCVersion ?? this.currentGCVersion;\n\n        /**\n         * Whether GC should run or not. The following conditions have to be met to run sweep:\n         * 1. GC should be enabled for this container.\n         * 2. GC should not be disabled via disableGC GC option.\n         * These conditions can be overridden via runGCKey feature flag.\n         */\n        this.shouldRunGC = this.mc.config.getBoolean(runGCKey) ?? (\n            // GC must be enabled for the document.\n            this.gcEnabled\n            // GC must not be disabled via GC options.\n            && !this.gcOptions.disableGC\n        );\n\n        /**\n         * Whether sweep should run or not. The following conditions have to be met to run sweep:\n         * 1. Overall GC or mark phase must be enabled (this.shouldRunGC).\n         * 2. Sweep timeout should be available. Without this, we wouldn't know when an object should be deleted.\n         * 3. Sweep should be enabled for this container (this.sweepEnabled). This can be overridden via runSweep\n         *    feature flag.\n         */\n        this.shouldRunSweep = this.shouldRunGC\n            && this.sweepTimeoutMs !== undefined\n            && (this.mc.config.getBoolean(runSweepKey) ?? this.sweepEnabled);\n\n        this.trackGCState = this.mc.config.getBoolean(trackGCStateKey) === true;\n\n        // Override inactive timeout if test config or gc options to override it is set.\n        this.inactiveTimeoutMs = this.mc.config.getNumber(\"Fluid.GarbageCollection.TestOverride.InactiveTimeoutMs\") ??\n            this.gcOptions.inactiveTimeoutMs ??\n            defaultInactiveTimeoutMs;\n\n        // Inactive timeout must be greater than sweep timeout since a node goes from active -> inactive -> sweep ready.\n        if (this.sweepTimeoutMs !== undefined && this.inactiveTimeoutMs > this.sweepTimeoutMs) {\n            throw new UsageError(\"inactive timeout should not be greated than the sweep timeout\");\n        }\n\n        // Whether we are running in test mode. In this mode, unreferenced nodes are immediately deleted.\n        this.testMode = this.mc.config.getBoolean(gcTestModeKey) ?? this.gcOptions.runGCInTestMode === true;\n\n        // GC state is written into root of the summary tree by default. Can be overridden via feature flag for now.\n        this._writeDataAtRoot = this.mc.config.getBoolean(writeAtRootKey) ?? true;\n\n        if (this._writeDataAtRoot) {\n            // The GC state needs to be reset if the base snapshot contains GC tree and GC is disabled or it doesn't\n            // contain GC tree and GC is enabled.\n            const gcTreePresent = baseSnapshot?.trees[gcTreeKey] !== undefined;\n            this.initialStateNeedsReset = gcTreePresent !== this.shouldRunGC;\n        }\n\n        // Get the GC state from the GC blob in the base snapshot. Use LazyPromise because we only want to do\n        // this once since it involves fetching blobs from storage which is expensive.\n        const baseSummaryStateP = new LazyPromise<IGarbageCollectionState | undefined>(async () => {\n            if (baseSnapshot === undefined) {\n                return undefined;\n            }\n\n            // For newer documents, GC data should be present in the GC tree in the root of the snapshot.\n            const gcSnapshotTree = baseSnapshot.trees[gcTreeKey];\n            if (gcSnapshotTree !== undefined) {\n                // If the GC tree is written at root, we should also do the same.\n                this._writeDataAtRoot = true;\n                const baseGCState = await getGCStateFromSnapshot(\n                    gcSnapshotTree,\n                    readAndParseBlob,\n                );\n                if (this.trackGCState) {\n                    this.latestSerializedSummaryState = JSON.stringify(generateSortedGCState(baseGCState));\n                }\n                return baseGCState;\n            }\n\n            // back-compat - Older documents will have the GC blobs in each data store's summary tree. Get them and\n            // consolidate into IGarbageCollectionState format.\n            // Add a node for the root node that is not present in older snapshot format.\n            const gcState: IGarbageCollectionState = { gcNodes: { \"/\": { outboundRoutes: [] } } };\n            const dataStoreSnapshotTree = getSummaryForDatastores(baseSnapshot, metadata);\n            assert(dataStoreSnapshotTree !== undefined,\n                0x2a8 /* \"Expected data store snapshot tree in base snapshot\" */);\n            for (const [dsId, dsSnapshotTree] of Object.entries(dataStoreSnapshotTree.trees)) {\n                const blobId = dsSnapshotTree.blobs[gcBlobKey];\n                if (blobId === undefined) {\n                    continue;\n                }\n\n                const gcSummaryDetails = await readAndParseBlob<IGarbageCollectionDetailsBase>(blobId);\n                // If there are no nodes for this data store, skip it.\n                if (gcSummaryDetails.gcData?.gcNodes === undefined) {\n                    continue;\n                }\n\n                const dsRootId = `/${dsId}`;\n                // Since we used to write GC data at data store level, we won't have an entry for the root (\"/\").\n                // Construct that entry by adding root data store ids to its outbound routes.\n                const initialSnapshotDetails = await readAndParseBlob<ReadFluidDataStoreAttributes>(\n                    dsSnapshotTree.blobs[dataStoreAttributesBlobName],\n                );\n                if (initialSnapshotDetails.isRootDataStore) {\n                    gcState.gcNodes[\"/\"].outboundRoutes.push(dsRootId);\n                }\n\n                for (const [id, outboundRoutes] of Object.entries(gcSummaryDetails.gcData.gcNodes)) {\n                    // Prefix the data store id to the GC node ids to make them relative to the root from being\n                    // relative to the data store. Similar to how its done in DataStore::getGCData.\n                    const rootId = id === \"/\" ? dsRootId : `${dsRootId}${id}`;\n                    gcState.gcNodes[rootId] = { outboundRoutes: Array.from(outboundRoutes) };\n                }\n                assert(gcState.gcNodes[dsRootId] !== undefined,\n                    0x2a9 /* GC nodes for data store not in GC blob */);\n                gcState.gcNodes[dsRootId].unreferencedTimestampMs = gcSummaryDetails.unrefTimestamp;\n            }\n\n            // If there is only one node (root node just added above), either GC is disabled or we are loading from the\n            // very first summary generated by detached container. In both cases, GC was not run - return undefined.\n            return Object.keys(gcState.gcNodes).length === 1 ? undefined : gcState;\n        });\n\n        /**\n         * Set up the initializer which initializes the base GC state from the base snapshot. Note that the reference\n         * timestamp maybe from old ops which were not summarized and stored in the file. So, the unreferenced state\n         * may be out of date. This is fine because the state is updated every time GC runs based on the time then.\n         */\n        this.initializeBaseStateP = new LazyPromise<void>(async () => {\n            const currentReferenceTimestampMs = this.runtime.getCurrentReferenceTimestampMs();\n            const baseState = await baseSummaryStateP;\n            if (baseState === undefined) {\n                return;\n            }\n\n            const gcNodes: { [id: string]: string[]; } = {};\n            for (const [nodeId, nodeData] of Object.entries(baseState.gcNodes)) {\n                if (nodeData.unreferencedTimestampMs !== undefined) {\n                    this.unreferencedNodesState.set(\n                        nodeId,\n                        new UnreferencedStateTracker(\n                            nodeData.unreferencedTimestampMs,\n                            this.inactiveTimeoutMs,\n                            this.sweepTimeoutMs,\n                            currentReferenceTimestampMs,\n                        ),\n                    );\n                }\n                gcNodes[nodeId] = Array.from(nodeData.outboundRoutes);\n            }\n            this.previousGCDataFromLastRun = { gcNodes };\n        });\n\n        // Get the GC details for each node from the GC state in the base summary. This is returned in getBaseGCDetails\n        // which the caller uses to initialize each node's GC state.\n        this.baseGCDetailsP = new LazyPromise<Map<string, IGarbageCollectionDetailsBase>>(async () => {\n            const baseState = await baseSummaryStateP;\n            if (baseState === undefined) {\n                return new Map();\n            }\n\n            const gcNodes: { [id: string]: string[]; } = {};\n            for (const [nodeId, nodeData] of Object.entries(baseState.gcNodes)) {\n                gcNodes[nodeId] = Array.from(nodeData.outboundRoutes);\n            }\n            // Run GC on the nodes in the base summary to get the routes used in each node in the container.\n            // This is an optimization for space (vs performance) wherein we don't need to store the used routes of\n            // each node in the summary.\n            const usedRoutes = runGarbageCollection(gcNodes, [\"/\"]).referencedNodeIds;\n\n            const baseGCDetailsMap = unpackChildNodesGCDetails({ gcData: { gcNodes }, usedRoutes });\n            // Currently, the nodes may write the GC data. So, we need to update it's base GC details with the\n            // unreferenced timestamp. Once we start writing the GC data here, we won't need to do this anymore.\n            for (const [nodeId, nodeData] of Object.entries(baseState.gcNodes)) {\n                if (nodeData.unreferencedTimestampMs !== undefined) {\n                    const dataStoreGCDetails = baseGCDetailsMap.get(nodeId.slice(1));\n                    if (dataStoreGCDetails !== undefined) {\n                        dataStoreGCDetails.unrefTimestamp = nodeData.unreferencedTimestampMs;\n                    }\n                }\n            }\n            return baseGCDetailsMap;\n        });\n\n        // Log all the GC options and the state determined by the garbage collector. This is interesting only for the\n        // summarizer client since it is the only one that runs GC. It also helps keep the telemetry less noisy.\n        const gcConfigProps = JSON.stringify({\n            gcEnabled: this.gcEnabled,\n            sweepEnabled: this.sweepEnabled,\n            runGC: this.shouldRunGC,\n            runSweep: this.shouldRunSweep,\n            writeAtRoot: this._writeDataAtRoot,\n            testMode: this.testMode,\n            sessionExpiry: this.sessionExpiryTimeoutMs,\n            inactiveTimeout: this.inactiveTimeoutMs,\n            existing: createParams.existing,\n            trackGCState: this.trackGCState,\n            ...this.gcOptions,\n        });\n        if (this.isSummarizerClient) {\n            this.mc.logger.sendTelemetryEvent({\n                eventName: \"GarbageCollectorLoaded\",\n                gcConfigs: gcConfigProps,\n            });\n        }\n\n        // Initialize the base state that is used to detect when inactive objects are used.\n        if (this.shouldRunGC) {\n            this.initializeBaseStateP.catch((error) => {\n                const dpe = DataProcessingError.wrapIfUnrecognized(\n                    error,\n                    \"FailedToInitializeGC\",\n                );\n                dpe.addTelemetryProperties({ gcConfigs: gcConfigProps });\n                throw dpe;\n            });\n        }\n    }\n\n    /**\n     * Runs garbage collection and updates the reference / used state of the nodes in the container.\n     * @returns the number of data stores that have been marked as unreferenced.\n     */\n    public async collectGarbage(\n        options: {\n            /** Logger to use for logging GC events */\n            logger?: ITelemetryLogger;\n            /** True to run GC sweep phase after the mark phase */\n            runSweep?: boolean;\n            /** True to generate full GC data */\n            fullGC?: boolean;\n        },\n    ): Promise<IGCStats> {\n        const {\n            fullGC = this.gcOptions.runFullGC === true || this.summaryStateNeedsReset,\n        } = options;\n\n        const logger = options.logger\n            ? ChildLogger.create(options.logger, undefined, { all: { completedGCRuns: () => this.completedRuns } })\n            : this.mc.logger;\n\n        return PerformanceEvent.timedExecAsync(logger, { eventName: \"GarbageCollection\" }, async (event) => {\n            await this.runPreGCSteps();\n\n            // Get the runtime's GC data and run GC on the reference graph in it.\n            const gcData = await this.runtime.getGCData(fullGC);\n            const gcResult = runGarbageCollection(gcData.gcNodes, [\"/\"]);\n\n            const gcStats = await this.runPostGCSteps(gcData, gcResult, logger);\n            event.end({ ...gcStats });\n            this.completedRuns++;\n            return gcStats;\n        }, { end: true, cancel: \"error\" });\n    }\n\n    private async runPreGCSteps() {\n        // Ensure that base state has been initialized.\n        await this.initializeBaseStateP;\n        // Let the runtime update its pending state before GC runs.\n        await this.runtime.updateStateBeforeGC();\n    }\n\n    private async runPostGCSteps(gcData: IGarbageCollectionData, gcResult: IGCResult, logger: ITelemetryLogger) {\n        // Generate statistics from the current run. This is done before updating the current state because it\n        // generates some of its data based on previous state of the system.\n        const gcStats = this.generateStats(gcResult);\n\n        // Update the state since the last GC run. There can be nodes that were referenced between the last and\n        // the current run. We need to identify than and update their unreferenced state if needed.\n        this.updateStateSinceLastRun(gcData, logger);\n\n        // Update the current state and update the runtime of all routes or ids that used as per the GC run.\n        const currentReferenceTimestampMs = this.runtime.getCurrentReferenceTimestampMs();\n        this.updateCurrentState(gcData, gcResult, currentReferenceTimestampMs);\n        this.runtime.updateUsedRoutes(gcResult.referencedNodeIds, currentReferenceTimestampMs);\n\n        // Log events for objects that are ready to be deleted by sweep. When we have sweep enabled, we will\n        // delete these objects here instead.\n        this.logSweepEvents(logger, currentReferenceTimestampMs);\n\n        // If we are running in GC test mode, delete objects for unused routes. This enables testing scenarios\n        // involving access to deleted data.\n        if (this.testMode) {\n            this.runtime.deleteUnusedRoutes(gcResult.deletedNodeIds);\n        }\n\n        // Log pending unreferenced events such as a node being used after inactive. This is done after GC runs and\n        // updates its state so that we don't send false positives based on intermediate state. For example, we may get\n        // reference to an unreferenced node from another unreferenced node which means the node wasn't revived.\n        await this.logUnreferencedEvents(logger);\n\n        return gcStats;\n    }\n\n    /**\n     * Summarizes the GC data and returns it as a summary tree.\n     * We current write the entire GC state in a single blob. This can be modified later to write multiple\n     * blobs. All the blob keys should start with `gcBlobPrefix`.\n     */\n    public summarize(\n        fullTree: boolean,\n        trackState: boolean,\n        telemetryContext?: ITelemetryContext,\n    ): ISummarizeResult | undefined {\n        if (!this.shouldRunGC || this.previousGCDataFromLastRun === undefined) {\n            return;\n        }\n\n        const gcState: IGarbageCollectionState = { gcNodes: {} };\n        for (const [nodeId, outboundRoutes] of Object.entries(this.previousGCDataFromLastRun.gcNodes)) {\n            gcState.gcNodes[nodeId] = {\n                outboundRoutes,\n                unreferencedTimestampMs: this.unreferencedNodesState.get(nodeId)?.unreferencedTimestampMs,\n            };\n        }\n\n        const newSerializedSummaryState = JSON.stringify(generateSortedGCState(gcState));\n\n        /**\n         * As an optimization if the GC tree hasn't changed and we're tracking the gc state, return a tree handle\n         * instead of returning the whole GC tree. If there are changes, then we want to return the whole tree.\n         */\n        if (this.trackGCState) {\n            this.pendingSerializedSummaryState = newSerializedSummaryState;\n            if (\n                this.latestSerializedSummaryState !== undefined &&\n                this.latestSerializedSummaryState === newSerializedSummaryState &&\n                !fullTree &&\n                trackState\n            ) {\n                const stats = mergeStats();\n                stats.handleNodeCount++;\n                return {\n                    summary: {\n                        type: SummaryType.Handle,\n                        handle: `/${gcTreeKey}`,\n                        handleType: SummaryType.Tree,\n                    },\n                    stats,\n                };\n            }\n        }\n\n        const builder = new SummaryTreeBuilder();\n        builder.addBlob(`${gcBlobPrefix}_root`, newSerializedSummaryState);\n        return builder.getSummaryTree();\n    }\n\n    public getMetadata(): IGCMetadata {\n        return {\n            /**\n             * If GC is enabled, the GC data is written using the current GC version and that is the gcFeature that goes\n             * into the metadata blob. If GC is disabled, the gcFeature is 0.\n             */\n            gcFeature: this.gcEnabled ? this.currentGCVersion : 0,\n            sessionExpiryTimeoutMs: this.sessionExpiryTimeoutMs,\n            sweepEnabled: this.sweepEnabled,\n        };\n    }\n\n    /**\n     * Returns a map of node ids to their base GC details generated from the base summary. This is used by the caller\n     * to initialize the GC state of the nodes.\n     */\n    public async getBaseGCDetails(): Promise<Map<string, IGarbageCollectionDetailsBase>> {\n        return this.baseGCDetailsP;\n    }\n\n    /**\n     * Called when the latest summary of the system has been refreshed. This will be used to update the state of the\n     * latest summary tracked.\n     */\n    public async latestSummaryStateRefreshed(\n        result: RefreshSummaryResult,\n        readAndParseBlob: ReadAndParseBlob,\n    ): Promise<void> {\n        if (!this.shouldRunGC || !result.latestSummaryUpdated) {\n            return;\n        }\n\n        // If the summary was tracked by this client, it was the one that generated the summary in the first place.\n        // Basically, it was written in the current GC version.\n        if (result.wasSummaryTracked) {\n            this.latestSummaryGCVersion = this.currentGCVersion;\n            this.initialStateNeedsReset = false;\n            if (this.trackGCState) {\n                this.latestSerializedSummaryState = this.pendingSerializedSummaryState;\n                this.pendingSerializedSummaryState = undefined;\n            }\n            return;\n        }\n        // If the summary was not tracked by this client, update latest GC version and blob from the snapshot in the\n        // result as that is now the latest summary.\n        const snapshot = result.snapshot;\n        const metadataBlobId = snapshot.blobs[metadataBlobName];\n        if (metadataBlobId) {\n            const metadata = await readAndParseBlob<IContainerRuntimeMetadata>(metadataBlobId);\n            this.latestSummaryGCVersion = getGCVersion(metadata);\n        }\n\n        const gcSnapshotTree = snapshot.trees[gcTreeKey];\n        if (gcSnapshotTree !== undefined && this.trackGCState) {\n            const latestGCState = await getGCStateFromSnapshot(\n                gcSnapshotTree,\n                readAndParseBlob,\n            );\n            this.latestSerializedSummaryState = JSON.stringify(generateSortedGCState(latestGCState));\n        } else {\n            this.latestSerializedSummaryState = undefined;\n        }\n        this.pendingSerializedSummaryState = undefined;\n    }\n\n    /**\n     * Called when a node with the given id is updated. If the node is inactive, log an error.\n     * @param nodePath - The id of the node that changed.\n     * @param reason - Whether the node was loaded or changed.\n     * @param timestampMs - The timestamp when the node changed.\n     * @param packagePath - The package path of the node. This may not be available if the node hasn't been loaded yet.\n     * @param requestHeaders - If the node was loaded via request path, the headers in the request.\n     */\n    public nodeUpdated(\n        nodePath: string,\n        reason: \"Loaded\" | \"Changed\",\n        timestampMs?: number,\n        packagePath?: readonly string[],\n        requestHeaders?: IRequestHeader,\n    ) {\n        if (!this.shouldRunGC) {\n            return;\n        }\n\n        const nodeStateTracker = this.unreferencedNodesState.get(nodePath);\n        if (nodeStateTracker && nodeStateTracker.state !== UnreferencedState.Active) {\n            this.inactiveNodeUsed(\n                reason,\n                nodePath,\n                nodeStateTracker,\n                undefined /* fromNodeId */,\n                packagePath,\n                timestampMs,\n                requestHeaders,\n            );\n        }\n    }\n\n    /**\n     * Called when an outbound reference is added to a node. This is used to identify all nodes that have been\n     * referenced between summaries so that their unreferenced timestamp can be reset.\n     *\n     * @param fromNodePath - The node from which the reference is added.\n     * @param toNodePath - The node to which the reference is added.\n     */\n    public addedOutboundReference(fromNodePath: string, toNodePath: string) {\n        if (!this.shouldRunGC) {\n            return;\n        }\n\n        const outboundRoutes = this.newReferencesSinceLastRun.get(fromNodePath) ?? [];\n        outboundRoutes.push(toNodePath);\n        this.newReferencesSinceLastRun.set(fromNodePath, outboundRoutes);\n\n        const nodeStateTracker = this.unreferencedNodesState.get(toNodePath);\n        if (nodeStateTracker && nodeStateTracker.state !== UnreferencedState.Active) {\n            this.inactiveNodeUsed(\"Revived\", toNodePath, nodeStateTracker, fromNodePath);\n        }\n    }\n\n    public dispose(): void {\n        if (this.sessionExpiryTimer !== undefined) {\n            clearTimeout(this.sessionExpiryTimer);\n            this.sessionExpiryTimer = undefined;\n        }\n    }\n\n    /**\n     * Updates the state of the system as per the current GC run. It does the following:\n     * 1. Sets up the current GC state as per the gcData.\n     * 2. Starts tracking for nodes that have become unreferenced in this run.\n     * 3. Clears tracking for nodes that were unreferenced but became referenced in this run.\n     * @param gcData - The data representing the reference graph on which GC is run.\n     * @param gcResult - The result of the GC run on the gcData.\n     * @param currentReferenceTimestampMs - The timestamp to be used for unreferenced nodes' timestamp.\n     */\n    private updateCurrentState(\n        gcData: IGarbageCollectionData,\n        gcResult: IGCResult,\n        currentReferenceTimestampMs?: number,\n    ) {\n        this.previousGCDataFromLastRun = cloneGCData(gcData);\n        this.newReferencesSinceLastRun.clear();\n\n        // Iterate through the referenced nodes and stop tracking if they were unreferenced before.\n        for (const nodeId of gcResult.referencedNodeIds) {\n            const nodeStateTracker = this.unreferencedNodesState.get(nodeId);\n            if (nodeStateTracker !== undefined) {\n                // Stop tracking so as to clear out any running timers.\n                nodeStateTracker.stopTracking();\n                // Delete the node as we don't need to track it any more.\n                this.unreferencedNodesState.delete(nodeId);\n            }\n        }\n\n        /**\n         * If there is no current reference time, skip tracking when a node becomes unreferenced. This would happen\n         * if no ops have been processed ever and we still try to run GC. If so, there is nothing interesting to track\n         * anyway.\n         */\n        if (currentReferenceTimestampMs === undefined) {\n            return;\n        }\n\n        /**\n         * If a node became unreferenced in this run, start tracking it.\n         * If a node was already unreferenced, update its tracking information. Since the current reference time is\n         * from the ops seen, this will ensure that we keep updating the unreferenced state as time moves forward.\n         */\n        for (const nodeId of gcResult.deletedNodeIds) {\n            const nodeStateTracker = this.unreferencedNodesState.get(nodeId);\n            if (nodeStateTracker === undefined) {\n                this.unreferencedNodesState.set(\n                    nodeId,\n                    new UnreferencedStateTracker(\n                        currentReferenceTimestampMs,\n                        this.inactiveTimeoutMs,\n                        this.sweepTimeoutMs,\n                        currentReferenceTimestampMs,\n                    ),\n                );\n            } else {\n                nodeStateTracker.updateTracking(currentReferenceTimestampMs);\n            }\n        }\n    }\n\n    /**\n     * Since GC runs periodically, the GC data that is generated only tells us the state of the world at that point in\n     * time. It's possible that nodes transition from `unreferenced -> referenced -> unreferenced` between two runs. The\n     * unreferenced timestamp of such nodes needs to be reset as they may have been accessed when they were referenced.\n     *\n     * This function identifies nodes that were referenced since last run and removes their unreferenced state, if any.\n     * If these nodes are currently unreferenced, they will be assigned new unreferenced state by the current run.\n     */\n    private updateStateSinceLastRun(currentGCData: IGarbageCollectionData, logger: ITelemetryLogger) {\n        // If we haven't run GC before there is nothing to do.\n        if (this.previousGCDataFromLastRun === undefined) {\n            return;\n        }\n\n        // Find any references that haven't been identified correctly.\n        const missingExplicitReferences = this.findMissingExplicitReferences(\n            currentGCData,\n            this.previousGCDataFromLastRun,\n            this.newReferencesSinceLastRun,\n        );\n\n        if (this.writeDataAtRoot && missingExplicitReferences.length > 0) {\n            missingExplicitReferences.forEach((missingExplicitReference) => {\n                const event: ITelemetryPerformanceEvent = {\n                    eventName: \"gcUnknownOutboundReferences\",\n                    gcNodeId: missingExplicitReference[0],\n                    gcRoutes: JSON.stringify(missingExplicitReference[1]),\n                };\n                logger.sendPerformanceEvent(event);\n            });\n        }\n\n        // No references were added since the last run so we don't have to update reference states of any unreferenced\n        // nodes\n        if (this.newReferencesSinceLastRun.size === 0) {\n            return;\n        }\n\n        /**\n         * Generate a super set of the GC data that contains the nodes and edges from last run, plus any new node and\n         * edges that have been added since then. To do this, combine the GC data from the last run and the current\n         * run, and then add the references since last run.\n         *\n         * Note on why we need to combine the data from previous run, current run and all references in between -\n         * 1. We need data from last run because some of its references may have been deleted since then. If those\n         *    references added new outbound references before getting deleted, we need to detect them.\n         * 2. We need new outbound references since last run because some of them may have been deleted later. If those\n         *    references added new outbound references before getting deleted, we need to detect them.\n         * 3. We need data from the current run because currently we may not detect when DDSes are referenced:\n         *    - We don't require DDSes handles to be stored in a referenced DDS. For this, we need GC at DDS level\n         *      which is tracked by https://github.com/microsoft/FluidFramework/issues/8470.\n         *    - A new data store may have \"root\" DDSes already created and we don't detect them today.\n         */\n        const gcDataSuperSet = concatGarbageCollectionData(this.previousGCDataFromLastRun, currentGCData);\n        this.newReferencesSinceLastRun.forEach((outboundRoutes: string[], sourceNodeId: string) => {\n            if (gcDataSuperSet.gcNodes[sourceNodeId] === undefined) {\n                gcDataSuperSet.gcNodes[sourceNodeId] = outboundRoutes;\n            } else {\n                gcDataSuperSet.gcNodes[sourceNodeId].push(...outboundRoutes);\n            }\n        });\n\n        /**\n         * Run GC on the above reference graph to find all nodes that are referenced. For each one, if they are\n         * unreferenced, stop tracking them and remove from unreferenced list.\n         * Some of these nodes may be unreferenced now and if so, the current run will add unreferenced state for them.\n         */\n        const gcResult = runGarbageCollection(gcDataSuperSet.gcNodes, [\"/\"]);\n        for (const nodeId of gcResult.referencedNodeIds) {\n            const nodeStateTracker = this.unreferencedNodesState.get(nodeId);\n            if (nodeStateTracker !== undefined) {\n                // Stop tracking so as to clear out any running timers.\n                nodeStateTracker.stopTracking();\n                // Delete the node as we don't need to track it any more.\n                this.unreferencedNodesState.delete(nodeId);\n            }\n        }\n    }\n\n    /**\n     * Finds all new references or outbound routes in the current graph that haven't been explicitly notified to GC.\n     * The principle is that every new reference or outbound route must be notified to GC via the\n     * addedOutboundReference method. It it hasn't, its a bug and we want to identify these scenarios.\n     *\n     * In more simple terms:\n     * Missing Explicit References = Current References - Previous References - Explicitly Added References;\n     *\n     * @param currentGCData - The GC data (reference graph) from the current GC run.\n     * @param previousGCData - The GC data (reference graph) from the previous GC run.\n     * @param explicitReferences - New references added explicity between the previous and the current run.\n     * @returns - a list of missing explicit references\n     */\n    private findMissingExplicitReferences(\n        currentGCData: IGarbageCollectionData,\n        previousGCData: IGarbageCollectionData,\n        explicitReferences: Map<string, string[]>,\n    ): [string, string[]][] {\n        assert(\n            previousGCData !== undefined,\n            0x2b7, /* \"Can't validate correctness without GC data from last run\" */\n        );\n\n        const currentGraph = Object.entries(currentGCData.gcNodes);\n        const missingExplicitReferences: [string, string[]][] = [];\n        currentGraph.forEach(([nodeId, currentOutboundRoutes]) => {\n            const previousRoutes = previousGCData.gcNodes[nodeId] ?? [];\n            const explicitRoutes = explicitReferences.get(nodeId) ?? [];\n            const missingExplicitRoutes: string[] = [];\n            currentOutboundRoutes.forEach((route) => {\n                const isBlobOrDataStoreRoute =\n                    this.runtime.getNodeType(route) === GCNodeType.Blob ||\n                    this.runtime.getNodeType(route) === GCNodeType.DataStore;\n                // Ignore implicitly added DDS routes to their parent datastores\n                const notRouteFromDDSToParentDataStore = !nodeId.startsWith(route);\n                if (\n                    isBlobOrDataStoreRoute &&\n                    notRouteFromDDSToParentDataStore &&\n                    (!previousRoutes.includes(route) && !explicitRoutes.includes(route))\n                ) {\n                    missingExplicitRoutes.push(route);\n                }\n            });\n            if (missingExplicitRoutes.length > 0) {\n                missingExplicitReferences.push([nodeId, missingExplicitRoutes]);\n            }\n        });\n\n        // Ideally missingExplicitReferences should always have a size 0\n        return missingExplicitReferences;\n    }\n\n    /**\n     * Generates the stats of a garbage collection run from the given results of the run.\n     * @param gcResult - The result of a GC run.\n     * @returns the GC stats of the GC run.\n     */\n    private generateStats(gcResult: IGCResult): IGCStats {\n        const gcStats: IGCStats = {\n            nodeCount: 0,\n            dataStoreCount: 0,\n            attachmentBlobCount: 0,\n            unrefNodeCount: 0,\n            unrefDataStoreCount: 0,\n            unrefAttachmentBlobCount: 0,\n            updatedNodeCount: 0,\n            updatedDataStoreCount: 0,\n            updatedAttachmentBlobCount: 0,\n        };\n\n        const updateNodeStats = (nodeId: string, referenced: boolean) => {\n            gcStats.nodeCount++;\n            // If there is no previous GC data, every node's state is generated and is considered as updated.\n            // Otherwise, find out if any node went from referenced to unreferenced or vice-versa.\n            const stateUpdated = this.previousGCDataFromLastRun === undefined ||\n                this.unreferencedNodesState.has(nodeId) === referenced;\n            if (stateUpdated) {\n                gcStats.updatedNodeCount++;\n            }\n            if (!referenced) {\n                gcStats.unrefNodeCount++;\n            }\n\n            if (this.runtime.getNodeType(nodeId) === GCNodeType.DataStore) {\n                gcStats.dataStoreCount++;\n                if (stateUpdated) {\n                    gcStats.updatedDataStoreCount++;\n                }\n                if (!referenced) {\n                    gcStats.unrefDataStoreCount++;\n                }\n            }\n            if (this.runtime.getNodeType(nodeId) === GCNodeType.Blob) {\n                gcStats.attachmentBlobCount++;\n                if (stateUpdated) {\n                    gcStats.updatedAttachmentBlobCount++;\n                }\n                if (!referenced) {\n                    gcStats.unrefAttachmentBlobCount++;\n                }\n            }\n        };\n\n        for (const nodeId of gcResult.referencedNodeIds) {\n            updateNodeStats(nodeId, true /* referenced */);\n        }\n\n        for (const nodeId of gcResult.deletedNodeIds) {\n            updateNodeStats(nodeId, false /* referenced */);\n        }\n\n        return gcStats;\n    }\n\n    /**\n     * For nodes that are ready to sweep, log an event for now. Until we start running sweep which deletes objects,\n     * this will give us a view into how much deleted content a container has.\n     */\n    private logSweepEvents(logger: ITelemetryLogger, currentReferenceTimestampMs?: number) {\n        if (this.mc.config.getBoolean(disableSweepLogKey) === true\n            || currentReferenceTimestampMs === undefined\n            || this.sweepTimeoutMs === undefined) {\n            return;\n        }\n\n        this.unreferencedNodesState.forEach((nodeStateTracker, nodeId) => {\n            if (nodeStateTracker.state !== UnreferencedState.SweepReady) {\n                return;\n            }\n\n            const nodeType = this.runtime.getNodeType(nodeId);\n            if (nodeType !== GCNodeType.DataStore && nodeType !== GCNodeType.Blob) {\n                return;\n            }\n\n            // Log deleted event for each node only once to reduce noise in telemetry.\n            const uniqueEventId = `Deleted-${nodeId}`;\n            if (this.loggedUnreferencedEvents.has(uniqueEventId)) {\n                return;\n            }\n            this.loggedUnreferencedEvents.add(uniqueEventId);\n            logger.sendTelemetryEvent({\n                eventName: \"GCObjectDeleted\",\n                id: nodeId,\n                type: nodeType,\n                age: currentReferenceTimestampMs - nodeStateTracker.unreferencedTimestampMs,\n                timeout: this.sweepTimeoutMs,\n                completedGCRuns: this.completedRuns,\n                lastSummaryTime: this.getLastSummaryTimestampMs(),\n            });\n        });\n    }\n\n    /**\n     * Called when an inactive node is used after. Queue up an event that will be logged next time GC runs.\n     */\n    private inactiveNodeUsed(\n        usageType: \"Changed\" | \"Loaded\" | \"Revived\",\n        nodeId: string,\n        nodeStateTracker: UnreferencedStateTracker,\n        fromNodeId?: string,\n        packagePath?: readonly string[],\n        currentReferenceTimestampMs = this.runtime.getCurrentReferenceTimestampMs(),\n        requestHeaders?: IRequestHeader,\n    ) {\n        // If there is no reference timestamp to work with, no ops have been processed after creation. If so, skip\n        // logging as nothing interesting would have happened worth logging.\n        // If the node is active, skip logging.\n        if (currentReferenceTimestampMs === undefined || nodeStateTracker.state === UnreferencedState.Active) {\n            return;\n        }\n\n        // For non-summarizer clients, only log \"Loaded\" type events since these objects may not be loaded in the\n        // summarizer clients if they are based off of user actions (such as scrolling to content for these objects).\n        if (!this.isSummarizerClient && usageType !== \"Loaded\") {\n            return;\n        }\n\n        // We only care about data stores and attachment blobs for this telemetry since GC only marks these objects\n        // as unreferenced. Also, if an inactive DDS is used, the corresponding data store store will also be used.\n        const nodeType = this.runtime.getNodeType(nodeId);\n        if (nodeType !== GCNodeType.DataStore && nodeType !== GCNodeType.Blob) {\n            return;\n        }\n\n        const state = nodeStateTracker.state;\n        const uniqueEventId = `${state}-${nodeId}-${usageType}`;\n        if (this.loggedUnreferencedEvents.has(uniqueEventId)) {\n            return;\n        }\n        this.loggedUnreferencedEvents.add(uniqueEventId);\n\n        const propsToLog = {\n            id: nodeId,\n            type: nodeType,\n            unrefTime: nodeStateTracker.unreferencedTimestampMs,\n            age: currentReferenceTimestampMs - nodeStateTracker.unreferencedTimestampMs,\n            timeout: nodeStateTracker.state === UnreferencedState.Inactive\n                ? this.inactiveTimeoutMs\n                : this.sweepTimeoutMs,\n            completedGCRuns: this.completedRuns,\n            lastSummaryTime: this.getLastSummaryTimestampMs(),\n            externalRequest: requestHeaders?.[RuntimeHeaders.externalRequest],\n            viaHandle: requestHeaders?.[RuntimeHeaders.viaHandle],\n            fromId: fromNodeId,\n        };\n\n        // For summarizer client, queue the event so it is logged the next time GC runs if the event is still valid.\n        // For non-summarizer client, log the event now since GC won't run on it. This may result in false positives\n        // but it's a good signal nonetheless and we can consume it with a grain of salt.\n        if (this.isSummarizerClient) {\n            this.pendingEventsQueue.push({ ...propsToLog, usageType, state });\n        } else {\n            this.mc.logger.sendErrorEvent({\n                ...propsToLog,\n                eventName: `${state}Object_${usageType}`,\n                pkg: packagePath ? { value: packagePath.join(\"/\"), tag: TelemetryDataTag.CodeArtifact } : undefined,\n            });\n        }\n    }\n\n    private async logUnreferencedEvents(logger: ITelemetryLogger) {\n        for (const eventProps of this.pendingEventsQueue) {\n            const { usageType, state, ...propsToLog } = eventProps;\n            /**\n             * Revived event is logged only if the node is active. If the node is not active, the reference to it was\n             * from another unreferenced node and this scenario is not interesting to log.\n             * Loaded and Changed events are logged only if the node is not active. If the node is active, it was\n             * revived and a Revived event will be logged for it.\n             */\n            const nodeStateTracker = this.unreferencedNodesState.get(eventProps.id);\n            const active = nodeStateTracker === undefined || nodeStateTracker.state === UnreferencedState.Active;\n            if ((usageType === \"Revived\") === active) {\n                const pkg = await this.getNodePackagePath(eventProps.id);\n                const fromPkg = eventProps.fromId ? await this.getNodePackagePath(eventProps.fromId) : undefined;\n                logger.sendErrorEvent({\n                    ...propsToLog,\n                    eventName: `${state}Object_${usageType}`,\n                    pkg: pkg ? { value: pkg.join(\"/\"), tag: TelemetryDataTag.CodeArtifact } : undefined,\n                    fromPkg: fromPkg ? { value: fromPkg.join(\"/\"), tag: TelemetryDataTag.CodeArtifact } : undefined,\n                });\n            }\n        }\n        this.pendingEventsQueue = [];\n    }\n}\n\n/**\n * Gets the garbage collection state from the given snapshot tree. The GC state may be written into multiple blobs.\n * Merge the GC state from all such blobs and return the merged GC state.\n */\nasync function getGCStateFromSnapshot(\n    gcSnapshotTree: ISnapshotTree,\n    readAndParseBlob: ReadAndParseBlob,\n): Promise<IGarbageCollectionState> {\n    let rootGCState: IGarbageCollectionState = { gcNodes: {} };\n    for (const key of Object.keys(gcSnapshotTree.blobs)) {\n        // Skip blobs that do not start with the GC prefix.\n        if (!key.startsWith(gcBlobPrefix)) {\n            continue;\n        }\n\n        const blobId = gcSnapshotTree.blobs[key];\n        if (blobId === undefined) {\n            continue;\n        }\n        const gcState = await readAndParseBlob<IGarbageCollectionState>(blobId);\n        assert(gcState !== undefined, 0x2ad /* \"GC blob missing from snapshot\" */);\n        // Merge the GC state of this blob into the root GC state.\n        rootGCState = concatGarbageCollectionStates(rootGCState, gcState);\n    }\n    return rootGCState;\n}\n\nfunction generateSortedGCState(gcState: IGarbageCollectionState): IGarbageCollectionState {\n    const sortableArray: [string, IGarbageCollectionNodeData][] = Object.entries(gcState.gcNodes);\n    sortableArray.sort(([a], [b]) => a.localeCompare(b));\n    const sortedGCState: IGarbageCollectionState = { gcNodes: {} };\n    for (const [nodeId, nodeData] of sortableArray) {\n        nodeData.outboundRoutes.sort();\n        sortedGCState.gcNodes[nodeId] = nodeData;\n    }\n    return sortedGCState;\n}\n\n/**\n * setLongTimeout is used for timeouts longer than setTimeout's ~24.8 day max\n * @param timeoutMs - the total time the timeout needs to last in ms\n * @param timeoutFn - the function to execute when the timer ends\n * @param setTimerFn - the function used to update your timer variable\n */\nfunction setLongTimeout(\n    timeoutMs: number,\n    timeoutFn: () => void,\n    setTimerFn: (timer: ReturnType<typeof setTimeout>) => void,\n) {\n    // The setTimeout max is 24.8 days before looping occurs.\n    const maxTimeout = 2147483647;\n    let timer: ReturnType<typeof setTimeout>;\n    if (timeoutMs > maxTimeout) {\n        const newTimeoutMs = timeoutMs - maxTimeout;\n        timer = setTimeout(() => setLongTimeout(newTimeoutMs, timeoutFn, setTimerFn), maxTimeout);\n    } else {\n        timer = setTimeout(() => timeoutFn(), timeoutMs);\n    }\n    setTimerFn(timer);\n}\n"]}

package/lib/index.d.ts

@@ -1,14 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export { ContainerMessageType, IChunkedOp, ContainerRuntimeMessage, IGCRuntimeOptions, ISummaryRuntimeOptions, ISummaryBaseConfiguration, ISummaryConfigurationHeuristics, ISummaryConfigurationDisableSummarizer, ISummaryConfigurationDisableHeuristics, IContainerRuntimeOptions, IPendingRuntimeState, IRootSummaryTreeWithStats, isRuntimeMessage, RuntimeMessage, unpackRuntimeMessage, ScheduleManager, agentSchedulerId, ContainerRuntime, RuntimeHeaders, ISummaryConfiguration, DefaultSummaryConfiguration, } from "./containerRuntime";
-export { DeltaScheduler } from "./deltaScheduler";
-export { FluidDataStoreRegistry } from "./dataStoreRegistry";
-export { gcBlobPrefix, gcTreeKey, IGarbageCollectionRuntime, IGCStats, } from "./garbageCollection";
-export { IPendingFlush, IPendingFlushMode, IPendingLocalState, IPendingMessage, IPendingState, } from "./pendingStateManager";
-export { Summarizer } from "./summarizer";
-export { EnqueueSummarizeResult, IAckSummaryResult, IBaseSummarizeResult, IBroadcastSummaryResult, ICancellationToken, IConnectableRuntime, IEnqueueSummarizeOptions, IGenerateSummaryTreeResult, IGeneratedSummaryStats, INackSummaryResult, IOnDemandSummarizeOptions, IProvideSummarizer, ISubmitSummaryOpResult, ISubmitSummaryOptions, ISummarizeOptions, ISummarizeResults, ISummarizer, ISummarizerEvents, ISummarizerInternalsProvider, ISummarizerRuntime, ISummarizingWarning, ISummaryCancellationToken, IUploadSummaryResult, SubmitSummaryResult, SummarizeResultPart, SummarizerStopReason, } from "./summarizerTypes";
-export { IAckedSummary, IClientSummaryWatcher, ISummary, ISummaryCollectionOpEvents, ISummaryAckMessage, ISummaryNackMessage, ISummaryOpMessage, OpActionEventListener, OpActionEventName, SummaryCollection, } from "./summaryCollection";
-export { ICancellableSummarizerController, neverCancelledSummaryToken } from "./runWhileConnectedCoordinator";
-//# sourceMappingURL=index.d.ts.map

package/lib/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACH,oBAAoB,EACpB,UAAU,EACV,uBAAuB,EACvB,iBAAiB,EACjB,sBAAsB,EACtB,yBAAyB,EACzB,+BAA+B,EAC/B,sCAAsC,EACtC,sCAAsC,EACtC,wBAAwB,EACxB,oBAAoB,EACpB,yBAAyB,EACzB,gBAAgB,EAChB,cAAc,EACd,oBAAoB,EACpB,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,EACd,qBAAqB,EACrB,2BAA2B,GAC9B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAC7D,OAAO,EACH,YAAY,EACZ,SAAS,EACT,yBAAyB,EACzB,QAAQ,GACX,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACH,aAAa,EACb,iBAAiB,EACjB,kBAAkB,EAClB,eAAe,EACf,aAAa,GAChB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EACH,sBAAsB,EACtB,iBAAiB,EACjB,oBAAoB,EACpB,uBAAuB,EACvB,kBAAkB,EAClB,mBAAmB,EACnB,wBAAwB,EACxB,0BAA0B,EAC1B,sBAAsB,EACtB,kBAAkB,EAClB,yBAAyB,EACzB,kBAAkB,EAClB,sBAAsB,EACtB,qBAAqB,EACrB,iBAAiB,EACjB,iBAAiB,EACjB,WAAW,EACX,iBAAiB,EACjB,4BAA4B,EAC5B,kBAAkB,EAClB,mBAAmB,EACnB,yBAAyB,EACzB,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,GACvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACH,aAAa,EACb,qBAAqB,EACrB,QAAQ,EACR,0BAA0B,EAC1B,kBAAkB,EAClB,mBAAmB,EACnB,iBAAiB,EACjB,qBAAqB,EACrB,iBAAiB,EACjB,iBAAiB,GACpB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,gCAAgC,EAAE,0BAA0B,EAAE,MAAM,gCAAgC,CAAC"}

package/lib/index.js

@@ -1,13 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export { ContainerMessageType, isRuntimeMessage, RuntimeMessage, unpackRuntimeMessage, ScheduleManager, agentSchedulerId, ContainerRuntime, RuntimeHeaders, DefaultSummaryConfiguration, } from "./containerRuntime";
-export { DeltaScheduler } from "./deltaScheduler";
-export { FluidDataStoreRegistry } from "./dataStoreRegistry";
-export { gcBlobPrefix, gcTreeKey, } from "./garbageCollection";
-export { Summarizer } from "./summarizer";
-export { ISummarizer, } from "./summarizerTypes";
-export { SummaryCollection, } from "./summaryCollection";
-export { neverCancelledSummaryToken } from "./runWhileConnectedCoordinator";
-//# sourceMappingURL=index.js.map

package/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACH,oBAAoB,EAYpB,gBAAgB,EAChB,cAAc,EACd,oBAAoB,EACpB,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,EAEd,2BAA2B,GAC9B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAC7D,OAAO,EACH,YAAY,EACZ,SAAS,GAGZ,MAAM,qBAAqB,CAAC;AAQ7B,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAiBH,WAAW,GAUd,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAUH,iBAAiB,GACpB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAoC,0BAA0B,EAAE,MAAM,gCAAgC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n    ContainerMessageType,\n    IChunkedOp,\n    ContainerRuntimeMessage,\n    IGCRuntimeOptions,\n    ISummaryRuntimeOptions,\n    ISummaryBaseConfiguration,\n    ISummaryConfigurationHeuristics,\n    ISummaryConfigurationDisableSummarizer,\n    ISummaryConfigurationDisableHeuristics,\n    IContainerRuntimeOptions,\n    IPendingRuntimeState,\n    IRootSummaryTreeWithStats,\n    isRuntimeMessage,\n    RuntimeMessage,\n    unpackRuntimeMessage,\n    ScheduleManager,\n    agentSchedulerId,\n    ContainerRuntime,\n    RuntimeHeaders,\n    ISummaryConfiguration,\n    DefaultSummaryConfiguration,\n} from \"./containerRuntime\";\nexport { DeltaScheduler } from \"./deltaScheduler\";\nexport { FluidDataStoreRegistry } from \"./dataStoreRegistry\";\nexport {\n    gcBlobPrefix,\n    gcTreeKey,\n    IGarbageCollectionRuntime,\n    IGCStats,\n} from \"./garbageCollection\";\nexport {\n    IPendingFlush,\n    IPendingFlushMode,\n    IPendingLocalState,\n    IPendingMessage,\n    IPendingState,\n} from \"./pendingStateManager\";\nexport { Summarizer } from \"./summarizer\";\nexport {\n    EnqueueSummarizeResult,\n    IAckSummaryResult,\n    IBaseSummarizeResult,\n    IBroadcastSummaryResult,\n    ICancellationToken,\n    IConnectableRuntime,\n    IEnqueueSummarizeOptions,\n    IGenerateSummaryTreeResult,\n    IGeneratedSummaryStats,\n    INackSummaryResult,\n    IOnDemandSummarizeOptions,\n    IProvideSummarizer,\n    ISubmitSummaryOpResult,\n    ISubmitSummaryOptions,\n    ISummarizeOptions,\n    ISummarizeResults,\n    ISummarizer,\n    ISummarizerEvents,\n    ISummarizerInternalsProvider,\n    ISummarizerRuntime,\n    ISummarizingWarning,\n    ISummaryCancellationToken,\n    IUploadSummaryResult,\n    SubmitSummaryResult,\n    SummarizeResultPart,\n    SummarizerStopReason,\n} from \"./summarizerTypes\";\nexport {\n    IAckedSummary,\n    IClientSummaryWatcher,\n    ISummary,\n    ISummaryCollectionOpEvents,\n    ISummaryAckMessage,\n    ISummaryNackMessage,\n    ISummaryOpMessage,\n    OpActionEventListener,\n    OpActionEventName,\n    SummaryCollection,\n} from \"./summaryCollection\";\nexport { ICancellableSummarizerController, neverCancelledSummaryToken } from \"./runWhileConnectedCoordinator\";\n"]}

package/lib/opTelemetry.d.ts

@@ -1,22 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IDeltaManager } from "@fluidframework/container-definitions";
-import { IDocumentMessage, ISequencedDocumentMessage } from "@fluidframework/protocol-definitions";
-export declare class OpTracker {
-    /**
-     * Used for storing the message content size when
-     * the message is pushed onto the inbound queue.
-     */
-    private readonly messageSize;
-    private _nonSystemOpCount;
-    get nonSystemOpCount(): number;
-    private _opsSizeAccumulator;
-    get opsSizeAccumulator(): number;
-    constructor(deltaManager: IDeltaManager<ISequencedDocumentMessage, IDocumentMessage>, disabled: boolean);
-    private static messageId;
-    private static messageHasData;
-    reset(): void;
-}
-//# sourceMappingURL=opTelemetry.d.ts.map

package/lib/opTelemetry.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"opTelemetry.d.ts","sourceRoot":"","sources":["../src/opTelemetry.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,uCAAuC,CAAC;AACtE,OAAO,EACH,gBAAgB,EAChB,yBAAyB,EAE5B,MAAM,sCAAsC,CAAC;AAG9C,qBAAa,SAAS;IAClB;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAA6B;IACzD,OAAO,CAAC,iBAAiB,CAAa;IACtC,IAAW,gBAAgB,IAAI,MAAM,CAEpC;IAED,OAAO,CAAC,mBAAmB,CAAa;IACxC,IAAW,kBAAkB,IAAI,MAAM,CAEtC;gBAGG,YAAY,EAAE,aAAa,CAAC,yBAAyB,EAAE,gBAAgB,CAAC,EACxE,QAAQ,EAAE,OAAO;IA2BrB,OAAO,CAAC,MAAM,CAAC,SAAS;IAIxB,OAAO,CAAC,MAAM,CAAC,cAAc;IAItB,KAAK;CAIf"}

package/lib/opTelemetry.js

@@ -1,56 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { isRuntimeMessage } from "@fluidframework/driver-utils";
-export class OpTracker {
-    constructor(deltaManager, disabled) {
-        /**
-         * Used for storing the message content size when
-         * the message is pushed onto the inbound queue.
-         */
-        this.messageSize = new Map();
-        this._nonSystemOpCount = 0;
-        this._opsSizeAccumulator = 0;
-        if (disabled) {
-            return;
-        }
-        // Record the message content size when we receive it.
-        // We should not log this value, as summarization can happen between the time the message
-        // is received and until it is processed (the 'op' event).
-        deltaManager.inbound.on("push", (message) => {
-            var _a;
-            // Some messages my already have string contents at this point,
-            // so stringifying them again will add inaccurate overhead.
-            const messageContent = typeof message.contents === "string" ?
-                message.contents :
-                (_a = JSON.stringify(message.contents)) !== null && _a !== void 0 ? _a : "";
-            const messageData = OpTracker.messageHasData(message) ? message.data : "";
-            this.messageSize[OpTracker.messageId(message)] = messageContent.length + messageData.length;
-        });
-        deltaManager.on("op", (message) => {
-            var _a;
-            this._nonSystemOpCount += !isRuntimeMessage(message) ? 0 : 1;
-            const id = OpTracker.messageId(message);
-            this._opsSizeAccumulator += (_a = this.messageSize[id]) !== null && _a !== void 0 ? _a : 0;
-            this.messageSize.delete(id);
-        });
-    }
-    get nonSystemOpCount() {
-        return this._nonSystemOpCount;
-    }
-    get opsSizeAccumulator() {
-        return this._opsSizeAccumulator;
-    }
-    static messageId(message) {
-        return message.sequenceNumber;
-    }
-    static messageHasData(message) {
-        return message.data !== undefined;
-    }
-    reset() {
-        this._nonSystemOpCount = 0;
-        this._opsSizeAccumulator = 0;
-    }
-}
-//# sourceMappingURL=opTelemetry.js.map

package/lib/opTelemetry.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"opTelemetry.js","sourceRoot":"","sources":["../src/opTelemetry.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAEhE,MAAM,OAAO,SAAS;IAgBlB,YACI,YAAwE,EACxE,QAAiB;QAjBrB;;;WAGG;QACc,gBAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QACjD,sBAAiB,GAAW,CAAC,CAAC;QAK9B,wBAAmB,GAAW,CAAC,CAAC;QASpC,IAAI,QAAQ,EAAE;YACV,OAAO;SACV;QAED,sDAAsD;QACtD,yFAAyF;QACzF,0DAA0D;QAC1D,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,OAAkC,EAAE,EAAE;;YACnE,+DAA+D;YAC/D,2DAA2D;YAC3D,MAAM,cAAc,GAAG,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;gBACzD,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAClB,MAAA,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,mCAAI,EAAE,CAAC;YAC3C,MAAM,WAAW,GAAG,SAAS,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1E,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;QAChG,CAAC,CAAC,CAAC;QAEH,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,OAAkC,EAAE,EAAE;;YACzD,IAAI,CAAC,iBAAiB,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,MAAM,EAAE,GAAG,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,CAAC,mBAAmB,IAAI,MAAA,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,mCAAI,CAAC,CAAC;YACtD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;IACP,CAAC;IApCD,IAAW,gBAAgB;QACvB,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAClC,CAAC;IAGD,IAAW,kBAAkB;QACzB,OAAO,IAAI,CAAC,mBAAmB,CAAC;IACpC,CAAC;IA+BO,MAAM,CAAC,SAAS,CAAC,OAAkC;QACvD,OAAO,OAAO,CAAC,cAAc,CAAC;IAClC,CAAC;IAEO,MAAM,CAAC,cAAc,CAAC,OAAkC;QAC5D,OAAQ,OAA2C,CAAC,IAAI,KAAK,SAAS,CAAC;IAC3E,CAAC;IAEM,KAAK;QACR,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC;IACjC,CAAC;CACJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { IDeltaManager } from \"@fluidframework/container-definitions\";\nimport {\n    IDocumentMessage,\n    ISequencedDocumentMessage,\n    ISequencedDocumentSystemMessage,\n} from \"@fluidframework/protocol-definitions\";\nimport { isRuntimeMessage } from \"@fluidframework/driver-utils\";\n\nexport class OpTracker {\n    /**\n     * Used for storing the message content size when\n     * the message is pushed onto the inbound queue.\n     */\n    private readonly messageSize = new Map<number, number>();\n    private _nonSystemOpCount: number = 0;\n    public get nonSystemOpCount(): number {\n        return this._nonSystemOpCount;\n    }\n\n    private _opsSizeAccumulator: number = 0;\n    public get opsSizeAccumulator(): number {\n        return this._opsSizeAccumulator;\n    }\n\n    public constructor(\n        deltaManager: IDeltaManager<ISequencedDocumentMessage, IDocumentMessage>,\n        disabled: boolean,\n    ) {\n        if (disabled) {\n            return;\n        }\n\n        // Record the message content size when we receive it.\n        // We should not log this value, as summarization can happen between the time the message\n        // is received and until it is processed (the 'op' event).\n        deltaManager.inbound.on(\"push\", (message: ISequencedDocumentMessage) => {\n            // Some messages my already have string contents at this point,\n            // so stringifying them again will add inaccurate overhead.\n            const messageContent = typeof message.contents === \"string\" ?\n                message.contents :\n                JSON.stringify(message.contents) ?? \"\";\n            const messageData = OpTracker.messageHasData(message) ? message.data : \"\";\n            this.messageSize[OpTracker.messageId(message)] = messageContent.length + messageData.length;\n        });\n\n        deltaManager.on(\"op\", (message: ISequencedDocumentMessage) => {\n            this._nonSystemOpCount += !isRuntimeMessage(message) ? 0 : 1;\n            const id = OpTracker.messageId(message);\n            this._opsSizeAccumulator += this.messageSize[id] ?? 0;\n            this.messageSize.delete(id);\n        });\n    }\n\n    private static messageId(message: ISequencedDocumentMessage): number {\n        return message.sequenceNumber;\n    }\n\n    private static messageHasData(message: ISequencedDocumentMessage): message is ISequencedDocumentSystemMessage {\n        return (message as ISequencedDocumentSystemMessage).data !== undefined;\n    }\n\n    public reset() {\n        this._nonSystemOpCount = 0;\n        this._opsSizeAccumulator = 0;\n    }\n}\n"]}

package/lib/orderedClientElection.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"orderedClientElection.d.ts","sourceRoot":"","sources":["../src/orderedClientElection.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AAC9F,OAAO,EAAU,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AACzE,OAAO,EAAE,aAAa,EAAE,MAAM,uCAAuC,CAAC;AAEtE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAoB,MAAM,sCAAsC,CAAC;AAMjG,oBAAY,mBAAmB,GAAG,SAAS,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;AAC1F,oBAAY,SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,mBAAmB,GAClD,CAAC,GACD,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,GACrB,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,GACvB,CAAC,SAAS,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,GAC/B,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,GACvC,CAAC,SAAS,GAAG,CAAC,MAAM,CAAC,CAAC,GACtB,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GACzB;IAAE,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAAE,CAAC;AAEnD,2EAA2E;AAC3E,MAAM,WAAW,cAAc;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;CACvC;AAED,wEAAwE;AACxE,MAAM,WAAW,SAAS;IACtB,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,aAAa,EAAE,aAAa,GAAG,SAAS,CAAC;CAC5C;AAED,4FAA4F;AAC5F,MAAM,WAAW,aAAc,SAAQ,SAAS;IAC5C,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC;CACnC;AAED,iGAAiG;AACjG,MAAM,WAAW,aAAc,SAAQ,SAAS,EAAE,cAAc;IAC5D,WAAW,EAAE,QAAQ,CAAC;CACzB;AAED,wFAAwF;AACxF,oBAAY,QAAQ,GAAG,aAAa,GAAG,aAAa,CAAC;AAErD,mDAAmD;AACnD,MAAM,WAAW,8BAA+B,SAAQ,MAAM;IAC1D,8CAA8C;IAC9C,CAAC,KAAK,EAAE,WAAW,GAAG,cAAc,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,KAAK,IAAI,OAAE;CAC5G;AAED,qEAAqE;AACrE,MAAM,WAAW,wBAAyB,SAAQ,cAAc,CAAC,8BAA8B,CAAC;IAC5F,0CAA0C;IAC1C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,sDAAsD;IACtD,QAAQ,CAAC,YAAY,EAAE,aAAa,GAAG,SAAS,CAAC;IACjD,mEAAmE;IACnE,aAAa,IAAI,aAAa,EAAE,CAAC;CACpC;AAED;;;;;;GAMG;AACH,qBAAa,uBACT,SAAQ,iBAAiB,CAAC,8BAA8B,CACxD,YAAW,wBAAwB;IACnC,kFAAkF;IAClF,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAoC;IAC9D,0EAA0E;IAC1E,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAIvB;IACF,gEAAgE;IAChE,OAAO,CAAC,eAAe,CAA2B;IAClD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAmB;IAE1C,IAAW,KAAK,WAEf;IACD,IAAW,YAAY,8BAEtB;gBAGG,MAAM,EAAE,gBAAgB,EACxB,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,oBAAoB,CAAC,EACzE,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,GAAG,IAAI,CAAC;IAwBrD,OAAO,CAAC,SAAS;IAmCjB,OAAO,CAAC,YAAY;IAqBpB,oFAAoF;IAC7E,aAAa,IAAI,aAAa,EAAE;CAS1C;AAED,iDAAiD;AACjD,MAAM,WAAW,4BAA6B,SAAQ,MAAM;IACxD,6DAA6D;IAC7D,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE;IAC1B,4BAA4B;IAC5B,MAAM,EAAE,cAAc,GAAG,SAAS;IAClC,iDAAiD;IACjD,cAAc,EAAE,MAAM;IACtB,iCAAiC;IACjC,UAAU,EAAE,cAAc,GAAG,SAAS,KACrC,IAAI,OAAE;CACd;AAED,kDAAkD;AAClD,MAAM,WAAW,mBAAmB;IAChC,0DAA0D;IAC1D,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;IACxC;;;0DAGsD;IACtD,QAAQ,CAAC,eAAe,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7C,oFAAoF;IACpF,QAAQ,CAAC,eAAe,EAAE,MAAM,GAAG,SAAS,CAAC;CAChD;AAED,qFAAqF;AACrF,MAAM,WAAW,sBAAuB,SAAQ,cAAc,CAAC,4BAA4B,CAAC;IACxF,mDAAmD;IACnD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B;;;0DAGsD;IACtD,QAAQ,CAAC,aAAa,EAAE,cAAc,GAAG,SAAS,CAAC;IACnD,6EAA6E;IAC7E,QAAQ,CAAC,aAAa,EAAE,cAAc,GAAG,SAAS,CAAC;IACnD,+CAA+C;IAC/C,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;IACxC,0FAA0F;IAC1F,sBAAsB,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IACrD,8EAA8E;IAC9E,kBAAkB,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IACjD,4FAA4F;IAC5F,qBAAqB,IAAI,cAAc,GAAG,SAAS,CAAC;IACpD,4EAA4E;IAC5E,qBAAqB,IAAI,cAAc,EAAE,CAAC;IAC1C,8BAA8B;IAC9B,SAAS,IAAI,mBAAmB,CAAC;CACpC;AAED;;;;;GAKG;AACH,qBAAa,qBACT,SAAQ,iBAAiB,CAAC,4BAA4B,CACtD,YAAW,sBAAsB;IAmD7B,OAAO,CAAC,QAAQ,CAAC,uBAAuB;IAGxC,OAAO,CAAC,QAAQ,CAAC,YAAY;IArDjC,OAAO,CAAC,cAAc,CAAa;IACnC,OAAO,CAAC,cAAc,CAA4B;IAClD,OAAO,CAAC,cAAc,CAA4B;IAClD,OAAO,CAAC,uBAAuB,CAAS;IAExC,IAAW,aAAa,WAEvB;IACD,IAAW,sBAAsB,WAEhC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,IAAW,aAAa,8BAEvB;IACD,IAAW,aAAa,8BAEvB;gBAGG,MAAM,EAAE,gBAAgB,EACP,uBAAuB,EAAE,wBAAwB;IAClE,uFAAuF;IACvF,YAAY,EAAE,mBAAmB,GAAG,MAAM,EACzB,YAAY,EAAE,CAAC,CAAC,EAAE,cAAc,KAAK,OAAO;IAqDjE;;;OAGG;IACH,OAAO,CAAC,iBAAiB;IAoBzB,OAAO,CAAC,iBAAiB;IAOzB;;;;;OAKG;IACH,OAAO,CAAC,uBAAuB;IAS/B;;;;;OAKG;IACH,OAAO,CAAC,SAAS;IAejB;;;;;OAKG;IACH,OAAO,CAAC,YAAY;IAiCb,qBAAqB,IAAI,cAAc,EAAE;IAIhD;;OAEG;IACI,sBAAsB,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;IAY3D;;OAEG;IACI,kBAAkB,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;IAWhD,qBAAqB,IAAI,cAAc,GAAG,SAAS;IAKnD,SAAS,IAAI,mBAAmB;CAO1C"}

package/lib/orderedClientElection.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"orderedClientElection.js","sourceRoot":"","sources":["../src/orderedClientElection.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAEzE,OAAO,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAE7D,OAAO,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAC9D,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AA0DlE;;;;;;GAMG;AACH,MAAM,OAAO,uBACT,SAAQ,iBAAiD;IAqBzD,YACI,MAAwB,EACxB,YAAyE,EACzE,MAAiD;QAEjD,KAAK,EAAE,CAAC;QAxBZ,kFAAkF;QACjE,cAAS,GAAG,IAAI,GAAG,EAAyB,CAAC;QAC9D,0EAA0E;QACzD,aAAQ,GAAkB;YACvC,cAAc,EAAE,CAAC,CAAC;YAClB,WAAW,EAAE,SAAS;YACtB,aAAa,EAAE,SAAS;SAC3B,CAAC;QACF,gEAAgE;QACxD,oBAAe,GAAa,IAAI,CAAC,QAAQ,CAAC;QAgB9C,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,yBAAyB,CAAC,CAAC;QACpE,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE;YACtC,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;SACpC;QAED,MAAM,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE;YACxC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YACnD,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC,kBAAkB,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,QAAQ,EAAE,EAAE;YACnC,MAAM,cAAc,GAAG,YAAY,CAAC,kBAAkB,CAAC;YACvD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACjD,IAAI,YAAY,KAAK,SAAS,EAAE;gBAC5B,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,gBAAgB,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC;aACzF;iBAAM;gBACH,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;aAC3D;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAhCD,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC/B,CAAC;IACD,IAAW,YAAY;QACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;IACvC,CAAC;IA6BO,SAAS,CAAC,QAAgB,EAAE,MAAwB;QACxD,mEAAmE;QACnE,yEAAyE;QACzE,MAAM,CAAC,MAAM,CAAC,cAAc,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAC9F,IAAI,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC;QACtC,OAAO,UAAU,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,EAAE;YACtD,MAAM,CAAC,UAAU,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,gDAAgD,CAAC,CAAC;YACrG,gGAAgG;YAChG,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;SACvC;QAED,+EAA+E;QAC/E,MAAM,SAAS,GAAkB;YAC7B,QAAQ;YACR,cAAc,EAAE,MAAM,CAAC,cAAc;YACrC,MAAM,oBAAO,MAAM,CAAC,MAAM,CAAE;YAC5B,WAAW,EAAE,UAAU;YACvB,aAAa,EAAE,UAAU,CAAC,aAAa;SAC1C,CAAC;QAEF,8CAA8C;QAC9C,SAAS,CAAC,WAAW,CAAC,aAAa,GAAG,SAAS,CAAC;QAEhD,IAAI,SAAS,CAAC,aAAa,KAAK,SAAS,EAAE;YACvC,qDAAqD;YACrD,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;SACpC;aAAM;YACH,mDAAmD;YACnD,SAAS,CAAC,aAAa,CAAC,WAAW,GAAG,SAAS,CAAC;SACnD;QAED,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QACxC,OAAO,SAAS,CAAC;IACrB,CAAC;IAEO,YAAY,CAAC,QAAgB;QACjC,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClD,IAAI,YAAY,KAAK,SAAS,EAAE;YAC5B,OAAO;SACV;QAED,0CAA0C;QAC1C,YAAY,CAAC,WAAW,CAAC,aAAa,GAAG,YAAY,CAAC,aAAa,CAAC;QAEpE,IAAI,YAAY,CAAC,aAAa,KAAK,SAAS,EAAE;YAC1C,qDAAqD;YACrD,IAAI,CAAC,eAAe,GAAG,YAAY,CAAC,WAAW,CAAC;SACnD;aAAM;YACH,mDAAmD;YACnD,YAAY,CAAC,aAAa,CAAC,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC;SACrE;QAED,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAChC,OAAO,YAAY,CAAC;IACxB,CAAC;IAED,oFAAoF;IAC7E,aAAa;QAChB,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,UAAU,GAAa,IAAI,CAAC,QAAQ,CAAC;QACzC,OAAO,UAAU,CAAC,aAAa,KAAK,SAAS,EAAE;YAC3C,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;YACtC,UAAU,GAAG,UAAU,CAAC,aAAa,CAAC;SACzC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAqDD;;;;;GAKG;AACH,MAAM,OAAO,qBACT,SAAQ,iBAA+C;IAkDvD,YACI,MAAwB,EACP,uBAAiD;IAClE,uFAAuF;IACvF,YAA0C,EACzB,YAA4C;QAE7D,KAAK,EAAE,CAAC;QALS,4BAAuB,GAAvB,uBAAuB,CAA0B;QAGjD,iBAAY,GAAZ,YAAY,CAAgC;QArDzD,mBAAc,GAAW,CAAC,CAAC;QAwD/B,IAAI,aAAwC,CAAC;QAC7C,IAAI,aAAwC,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,uBAAuB,CAAC,aAAa,EAAE,EAAE;YAC1D,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC1B,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE;gBAClC,IAAI,MAAM,CAAC,QAAQ,KAAK,YAAY,CAAC,eAAe,EAAE;oBAClD,aAAa,GAAG,MAAM,CAAC;oBACvB,IAAI,YAAY,CAAC,eAAe,KAAK,SAAS;wBAC1C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,oBAAoB,EAAE;wBACrD,uEAAuE;wBACvE,aAAa,GAAG,MAAM,CAAC;qBAC1B;iBACJ;gBACD,IAAI,MAAM,CAAC,QAAQ,KAAK,YAAY,CAAC,eAAe,EAAE;oBAClD,aAAa,GAAG,MAAM,CAAC;iBAC1B;aACJ;SACJ;QACD,uBAAuB,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QACtF,uBAAuB,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QAE5F,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE;YAClC,IAAI,CAAC,uBAAuB,GAAG,YAAY,CAAC;SAC/C;aAAM;YACH,gEAAgE;YAChE,IAAI,CAAA,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,QAAQ,MAAK,YAAY,CAAC,eAAe,EAAE;gBAC1D,4DAA4D;gBAC5D,MAAM,CAAC,cAAc,CAAC;oBAClB,SAAS,EAAE,8BAA8B;oBACzC,sBAAsB,EAAE,YAAY,CAAC,sBAAsB;oBAC3D,gBAAgB,EAAE,YAAY,CAAC,eAAe;oBAC9C,eAAe,EAAE,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,QAAQ;oBACxC,WAAW,EAAE,uBAAuB,CAAC,KAAK;iBAC7C,CAAC,CAAC;aACN;iBAAM,IAAI,aAAa,KAAK,SAAS,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE;gBACpE,yEAAyE;gBACzE,aAAa,GAAG,aAAa,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,CAAC,CAAC;gBAC5E,MAAM,CAAC,cAAc,CAAC;oBAClB,SAAS,EAAE,gCAAgC;oBAC3C,sBAAsB,EAAE,YAAY,CAAC,sBAAsB;oBAC3D,gBAAgB,EAAE,YAAY,CAAC,eAAe;oBAC9C,eAAe,EAAE,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,QAAQ;iBAC3C,CAAC,CAAC;aACN;YACD,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;YACpC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;YACpC,IAAI,CAAC,uBAAuB,GAAG,YAAY,CAAC,sBAAsB,CAAC;SACtE;IACL,CAAC;IAnGD,IAAW,aAAa;QACpB,OAAO,IAAI,CAAC,cAAc,CAAC;IAC/B,CAAC;IACD,IAAW,sBAAsB;QAC7B,OAAO,IAAI,CAAC,uBAAuB,CAAC;IACxC,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,IAAW,aAAa;QACpB,OAAO,IAAI,CAAC,cAAc,CAAC;IAC/B,CAAC;IACD,IAAW,aAAa;QACpB,OAAO,IAAI,CAAC,cAAc,CAAC;IAC/B,CAAC;IA4DD;;;OAGG;IACK,iBAAiB,CAAC,MAAiC,EAAE,cAAsB;QAC/E,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,MAAM,kBAAkB,GAAG,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,MAAM,CAAC,OAAO,CAAC,IAAI,MAAK,oBAAoB,CAAC;QAChF,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC;QACvC,IAAI,IAAI,CAAC,cAAc,KAAK,MAAM,EAAE;YAChC,kGAAkG;YAClG,IAAI,CAAC,uBAAuB,GAAG,cAAc,CAAC;YAC9C,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC;YAC7B,MAAM,GAAG,IAAI,CAAC;SACjB;QACD,IAAI,IAAI,CAAC,cAAc,KAAK,MAAM,IAAI,CAAC,kBAAkB,EAAE;YACvD,uCAAuC;YACvC,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC;YAC7B,MAAM,GAAG,IAAI,CAAC;SACjB;QACD,IAAI,MAAM,EAAE;YACR,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;SAC7D;IACL,CAAC;IAEO,iBAAiB,CAAC,MAAiC,EAAE,cAAsB;QAC/E,IAAI,IAAI,CAAC,cAAc,KAAK,MAAM,EAAE;YAChC,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,cAAc,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;SACnF;IACL,CAAC;IAED;;;;;OAKG;IACK,uBAAuB,CAAC,MAAiC;QAC7D,IAAI,eAAe,GAAG,MAAM,CAAC;QAC7B,OAAO,eAAe,KAAK,SAAS;YAChC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,IAAI,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,oBAAoB,CAAC,EAAE;YACvG,eAAe,GAAG,eAAe,CAAC,aAAa,CAAC;SACnD;QACD,OAAO,eAAe,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACK,SAAS,CAAC,MAAqB,EAAE,cAAsB;;QAC3D,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE;YAC3B,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,MAAM,qBAAqB,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,oBAAoB,CAAC;YAClF,MAAM,yBAAyB,GAAG,CAAA,MAAA,IAAI,CAAC,cAAc,0CAAE,MAAM,CAAC,OAAO,CAAC,IAAI,MAAK,oBAAoB,CAAC;YACpG,+FAA+F;YAC/F,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC,yBAAyB,IAAI,qBAAqB,CAAC,EAAE;gBAC5F,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;aAClD;iBAAM,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,CAAC,qBAAqB,EAAE;gBACpE,2FAA2F;gBAC3F,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;aAClD;SACJ;IACL,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAAC,MAAqB,EAAE,cAAsB;;QAC9D,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE;YAC3B,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,cAAc,KAAK,MAAM,EAAE;gBAChC,2DAA2D;gBAC3D,IAAI,IAAI,CAAC,cAAc,KAAK,MAAM,EAAE;oBAChC,qFAAqF;oBACrF,4FAA4F;oBAC5F,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,oBAAoB,EAAE;wBAClE,MAAM,IAAI,UAAU,CAAC,gDAAgD,CAAC,CAAC;qBAC1E;oBACD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;iBAC/D;qBAAM;oBACH,2EAA2E;oBAC3E,6CAA6C;oBAC7C,MAAM,UAAU,GAAG,MAAA,IAAI,CAAC,uBAAuB,CAAC,MAAA,IAAI,CAAC,cAAc,0CAAE,aAAa,CAAC,mCAC/E,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,uBAAuB,CAAC,YAAY,CAAC,CAAC;oBAC5E,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;iBACtD;aACJ;iBAAM,IAAI,IAAI,CAAC,cAAc,KAAK,MAAM,EAAE;gBACvC,wDAAwD;gBACxD,0EAA0E;gBAC1E,kDAAkD;gBAClD,IAAI,CAAA,MAAA,IAAI,CAAC,cAAc,0CAAE,MAAM,CAAC,OAAO,CAAC,IAAI,MAAK,oBAAoB,EAAE;oBACnE,MAAM,IAAI,UAAU,CAAC,gDAAgD,CAAC,CAAC;iBAC1E;gBACD,MAAM,UAAU,GAAG,MAAA,IAAI,CAAC,uBAAuB,CAAC,MAAA,IAAI,CAAC,cAAc,0CAAE,aAAa,CAAC,mCAC/E,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,uBAAuB,CAAC,YAAY,CAAC,CAAC;gBAC5E,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;aACtD;SACJ;IACL,CAAC;IAEM,qBAAqB;QACxB,OAAO,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAClF,CAAC;IAED;;OAEG;IACI,sBAAsB,CAAC,cAAsB;;QAChD,MAAM,UAAU,GAAG,MAAA,IAAI,CAAC,uBAAuB,CAAC,MAAA,IAAI,CAAC,cAAc,0CAAE,aAAa,CAAC,mCAC/E,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,uBAAuB,CAAC,YAAY,CAAC,CAAC;QAC5E,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,IAAI,CAAC,cAAc,KAAK,IAAI,CAAC,cAAc,EAAE;YAClF,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;SACtD;aAAM;YACH,4FAA4F;YAC5F,wDAAwD;YACxD,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;SACtD;IACL,CAAC;IAED;;OAEG;IACI,kBAAkB,CAAC,cAAsB;QAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,uBAAuB,CAAC,YAAY,CAAC,CAAC;QAC5F,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,IAAI,CAAC,cAAc,KAAK,IAAI,CAAC,cAAc,EAAE;YAClF,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;SACvD;aAAM;YACH,4FAA4F;YAC5F,wDAAwD;YACxD,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;SACvD;IACL,CAAC;IAEM,qBAAqB;;QACxB,OAAO,MAAA,IAAI,CAAC,uBAAuB,CAAC,MAAA,IAAI,CAAC,cAAc,0CAAE,aAAa,CAAC,mCACnE,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,uBAAuB,CAAC,YAAY,CAAC,CAAC;IAChF,CAAC;IAEM,SAAS;;QACZ,OAAO;YACH,sBAAsB,EAAE,IAAI,CAAC,sBAAsB;YACnD,eAAe,EAAE,MAAA,IAAI,CAAC,aAAa,0CAAE,QAAQ;YAC7C,eAAe,EAAE,MAAA,IAAI,CAAC,aAAa,0CAAE,QAAQ;SAChD,CAAC;IACN,CAAC;CACJ","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n/* eslint-disable @rushstack/no-new-null */\nimport { IEvent, IEventProvider, ITelemetryLogger } from \"@fluidframework/common-definitions\";\nimport { assert, TypedEventEmitter } from \"@fluidframework/common-utils\";\nimport { IDeltaManager } from \"@fluidframework/container-definitions\";\nimport { UsageError } from \"@fluidframework/container-utils\";\nimport { IClient, IQuorumClients, ISequencedClient } from \"@fluidframework/protocol-definitions\";\nimport { ChildLogger } from \"@fluidframework/telemetry-utils\";\nimport { summarizerClientType } from \"./summarizerClientElection\";\n\n// helper types for recursive readonly.\n// eslint-disable-next-line @typescript-eslint/ban-types\nexport type ImmutablePrimitives = undefined | null | boolean | string | number | Function;\nexport type Immutable<T> = T extends ImmutablePrimitives\n    ? T\n    : T extends (infer A)[]\n    ? readonly Immutable<A>[]\n    : T extends Map<infer K, infer V>\n    ? ReadonlyMap<Immutable<K>, Immutable<V>>\n    : T extends Set<infer V>\n    ? ReadonlySet<Immutable<V>>\n    : { readonly [K in keyof T]: Immutable<T[K]> };\n\n/** Minimum information for a client tracked for election consideration. */\nexport interface ITrackedClient {\n    readonly clientId: string;\n    readonly sequenceNumber: number;\n    readonly client: Immutable<IClient>;\n}\n\n/** Common contract for link nodes within an OrderedClientCollection. */\nexport interface ILinkNode {\n    readonly sequenceNumber: number;\n    youngerClient: ILinkedClient | undefined;\n}\n\n/** Placeholder root node within an OrderedClientCollection; does not represent a client. */\nexport interface IRootLinkNode extends ILinkNode {\n    readonly sequenceNumber: -1;\n    readonly olderClient: undefined;\n}\n\n/** Additional information required to keep track of the client within the doubly-linked list. */\nexport interface ILinkedClient extends ILinkNode, ITrackedClient {\n    olderClient: LinkNode;\n}\n\n/** Any link node within OrderedClientCollection including the placeholder root node. */\nexport type LinkNode = IRootLinkNode | ILinkedClient;\n\n/** Events raised by an OrderedClientCollection. */\nexport interface IOrderedClientCollectionEvents extends IEvent {\n    /** Event fires when client is being added. */\n    (event: \"addClient\" | \"removeClient\", listener: (client: ILinkedClient, sequenceNumber: number) => void);\n}\n\n/** Contract for a sorted collection of all clients in the quorum. */\nexport interface IOrderedClientCollection extends IEventProvider<IOrderedClientCollectionEvents> {\n    /** Count of clients in the collection. */\n    readonly count: number;\n    /** Pointer to the oldest client in the collection. */\n    readonly oldestClient: ILinkedClient | undefined;\n    /** Returns a sorted array of all the clients in the collection. */\n    getAllClients(): ILinkedClient[];\n}\n\n/**\n * Tracks clients in the Quorum. It maintains their order using their join op\n * sequence numbers.\n * Internally, the collection of clients is maintained in a doubly-linked list,\n * with pointers to both the first and last nodes.\n * The first (root) node is a placeholder to simplify logic and reduce null checking.\n */\nexport class OrderedClientCollection\n    extends TypedEventEmitter<IOrderedClientCollectionEvents>\n    implements IOrderedClientCollection {\n    /** Collection of ALL clients currently in the quorum, with client ids as keys. */\n    private readonly clientMap = new Map<string, ILinkedClient>();\n    /** Placeholder head node of linked list, for simplified null checking. */\n    private readonly rootNode: IRootLinkNode = {\n        sequenceNumber: -1,\n        olderClient: undefined,\n        youngerClient: undefined,\n    };\n    /** Pointer to end of linked list, for optimized client adds. */\n    private _youngestClient: LinkNode = this.rootNode;\n    private readonly logger: ITelemetryLogger;\n\n    public get count() {\n        return this.clientMap.size;\n    }\n    public get oldestClient() {\n        return this.rootNode.youngerClient;\n    }\n\n    constructor(\n        logger: ITelemetryLogger,\n        deltaManager: Pick<IDeltaManager<unknown, unknown>, \"lastSequenceNumber\">,\n        quorum: Pick<IQuorumClients, \"getMembers\" | \"on\">,\n    ) {\n        super();\n        this.logger = ChildLogger.create(logger, \"OrderedClientCollection\");\n        const members = quorum.getMembers();\n        for (const [clientId, client] of members) {\n            this.addClient(clientId, client);\n        }\n\n        quorum.on(\"addMember\", (clientId, client) => {\n            const newClient = this.addClient(clientId, client);\n            this.emit(\"addClient\", newClient, deltaManager.lastSequenceNumber);\n        });\n        quorum.on(\"removeMember\", (clientId) => {\n            const sequenceNumber = deltaManager.lastSequenceNumber;\n            const removeClient = this.removeClient(clientId);\n            if (removeClient === undefined) {\n                this.logger.sendErrorEvent({ eventName: \"ClientNotFound\", clientId, sequenceNumber });\n            } else {\n                this.emit(\"removeClient\", removeClient, sequenceNumber);\n            }\n        });\n    }\n\n    private addClient(clientId: string, client: ISequencedClient): ITrackedClient {\n        // Normal case is adding the latest client, which will bypass loop.\n        // Find where it belongs otherwise (maybe possible during initial load?).\n        assert(client.sequenceNumber > -1, 0x1f6 /* \"Negative client sequence number not allowed\" */);\n        let currClient = this._youngestClient;\n        while (currClient.sequenceNumber > client.sequenceNumber) {\n            assert(currClient.olderClient !== undefined, 0x1f7 /* \"Previous client should always be defined\" */);\n            // Note: If adding a client older than the elected client, it will not be automatically elected.\n            currClient = currClient.olderClient;\n        }\n\n        // Now currClient is the node right before where the new client node should be.\n        const newClient: ILinkedClient = {\n            clientId,\n            sequenceNumber: client.sequenceNumber,\n            client: { ...client.client }, // shallow clone\n            olderClient: currClient,\n            youngerClient: currClient.youngerClient,\n        };\n\n        // Update prev node to point to this new node.\n        newClient.olderClient.youngerClient = newClient;\n\n        if (newClient.youngerClient === undefined) {\n            // Update linked list end pointer to youngest client.\n            this._youngestClient = newClient;\n        } else {\n            // Update next node to point back to this new node.\n            newClient.youngerClient.olderClient = newClient;\n        }\n\n        this.clientMap.set(clientId, newClient);\n        return newClient;\n    }\n\n    private removeClient(clientId: string): ITrackedClient | undefined {\n        const removeClient = this.clientMap.get(clientId);\n        if (removeClient === undefined) {\n            return;\n        }\n\n        // Update prev node to point to next node.\n        removeClient.olderClient.youngerClient = removeClient.youngerClient;\n\n        if (removeClient.youngerClient === undefined) {\n            // Update linked list end pointer to youngest client.\n            this._youngestClient = removeClient.olderClient;\n        } else {\n            // Update next node to point back to previous node.\n            removeClient.youngerClient.olderClient = removeClient.olderClient;\n        }\n\n        this.clientMap.delete(clientId);\n        return removeClient;\n    }\n\n    /** Returns an array of all clients being tracked in order from oldest to newest. */\n    public getAllClients(): ILinkedClient[] {\n        const result: ILinkedClient[] = [];\n        let currClient: LinkNode = this.rootNode;\n        while (currClient.youngerClient !== undefined) {\n            result.push(currClient.youngerClient);\n            currClient = currClient.youngerClient;\n        }\n        return result;\n    }\n}\n\n/** Events raised by an OrderedClientElection. */\nexport interface IOrderedClientElectionEvents extends IEvent {\n    /** Event fires when the currently elected client changes. */\n    (event: \"election\", listener: (\n        /** Newly elected client. */\n        client: ITrackedClient | undefined,\n        /** Sequence number where election took place. */\n        sequenceNumber: number,\n        /** Previously elected client. */\n        prevClient: ITrackedClient | undefined,\n    ) => void);\n}\n\n/** Serialized state of IOrderedClientElection. */\nexport interface ISerializedElection {\n    /** Sequence number at the time of the latest election. */\n    readonly electionSequenceNumber: number;\n    /** Most recently elected client id. This is either:\n     * 1. the interactive elected parent client, in which case electedClientId === electedParentId,\n     *  and the SummaryManager on the elected client will spawn a summarizer client, or\n     * 2. the non-interactive summarizer client itself. */\n    readonly electedClientId: string | undefined;\n    /** Most recently elected parent client id. This is always an interactive client. */\n    readonly electedParentId: string | undefined;\n}\n\n/** Contract for maintaining a deterministic client election based on eligibility. */\nexport interface IOrderedClientElection extends IEventProvider<IOrderedClientElectionEvents> {\n    /** Count of eligible clients in the collection. */\n    readonly eligibleCount: number;\n    /** Currently elected client. This is either:\n     * 1. the interactive elected parent client, in which case electedClientId === electedParentId,\n     *  and the SummaryManager on the elected client will spawn a summarizer client, or\n     * 2. the non-interactive summarizer client itself. */\n    readonly electedClient: ITrackedClient | undefined;\n    /** Currently elected parent client. This is always an interactive client. */\n    readonly electedParent: ITrackedClient | undefined;\n    /** Sequence number of most recent election. */\n    readonly electionSequenceNumber: number;\n    /** Marks the currently elected client as invalid, and elects the next eligible client. */\n    incrementElectedClient(sequenceNumber: number): void;\n    /** Resets the currently elected client back to the oldest eligible client. */\n    resetElectedClient(sequenceNumber: number): void;\n    /** Peeks at what the next elected client would be if incrementElectedClient were called. */\n    peekNextElectedClient(): ITrackedClient | undefined;\n    /** Returns a sorted array of all the eligible clients in the collection. */\n    getAllEligibleClients(): ITrackedClient[];\n    /** Serialize election data */\n    serialize(): ISerializedElection;\n}\n\n/**\n * Adapter for OrderedClientCollection, with the purpose of deterministically maintaining\n * a currently elected client, excluding ineligible clients, in a distributed fashion.\n * This can be true as long as incrementElectedClient and resetElectedClient calls\n * are called under the same conditions for all clients.\n */\nexport class OrderedClientElection\n    extends TypedEventEmitter<IOrderedClientElectionEvents>\n    implements IOrderedClientElection {\n    private _eligibleCount: number = 0;\n    private _electedClient: ILinkedClient | undefined;\n    private _electedParent: ILinkedClient | undefined;\n    private _electionSequenceNumber: number;\n\n    public get eligibleCount() {\n        return this._eligibleCount;\n    }\n    public get electionSequenceNumber() {\n        return this._electionSequenceNumber;\n    }\n\n    /**\n     * OrderedClientCollection tracks electedClient and electedParent separately. This allows us to handle the case\n     * where a new interactive parent client has been elected, but the summarizer is still doing work, so\n     * a new summarizer should not yet be spawned. In this case, changing electedParent will cause SummaryManager\n     * to stop the current summarizer, but a new summarizer will not be spawned until the old summarizer client has\n     * left the quorum.\n     *\n     * Details:\n     *\n     * electedParent is the interactive client that has been elected to spawn a summarizer. It is typically the oldest\n     * eligible interactive client in the quorum. Only the electedParent is permitted to spawn a summarizer.\n     * Once elected, this client will remain the electedParent until it leaves the quorum or the summarizer that\n     * it spawned stops producing summaries, at which point a new electedParent will be chosen.\n     *\n     * electedClient is the non-interactive summarizer client if one exists. If not, then electedClient is equal to\n     * electedParent. If electedParent === electedClient, this is the signal for electedParent to spawn a new\n     * electedClient. Once a summarizer client becomes electedClient, a new summarizer will not be spawned until\n     * electedClient leaves the quorum.\n     *\n     * A typical sequence looks like this:\n     * i. Begin by electing A. electedParent === A, electedClient === A.\n     * ii. SummaryManager running on A spawns a summarizer client, A'. electedParent === A, electedClient === A'\n     * iii. A' stops producing summaries. A new parent client, B, is elected. electedParent === B, electedClient === A'\n     * iv. SummaryManager running on A detects the change to electedParent and tells the summarizer to stop, but A'\n     *      is in mid-summarization. No new summarizer is spawned, as electedParent !== electedClient.\n     * v. A' completes its summary, and the summarizer and backing client are torn down.\n     * vi. A' leaves the quorum, and B takes its place as electedClient. electedParent === B, electedClient === B\n     * vii. SummaryManager running on B spawns a summarizer client, B'. electedParent === B, electedClient === B'\n     */\n    public get electedClient() {\n        return this._electedClient;\n    }\n    public get electedParent() {\n        return this._electedParent;\n    }\n\n    constructor(\n        logger: ITelemetryLogger,\n        private readonly orderedClientCollection: IOrderedClientCollection,\n        /** Serialized state from summary or current sequence number at time of load if new. */\n        initialState: ISerializedElection | number,\n        private readonly isEligibleFn: (c: ITrackedClient) => boolean,\n    ) {\n        super();\n        let initialClient: ILinkedClient | undefined;\n        let initialParent: ILinkedClient | undefined;\n        for (const client of orderedClientCollection.getAllClients()) {\n            this.addClient(client, 0);\n            if (typeof initialState !== \"number\") {\n                if (client.clientId === initialState.electedClientId) {\n                    initialClient = client;\n                    if (initialState.electedParentId === undefined &&\n                        client.client.details.type !== summarizerClientType) {\n                        // If there was no elected parent in the serialized data, use this one.\n                        initialParent = client;\n                    }\n                }\n                if (client.clientId === initialState.electedParentId) {\n                    initialParent = client;\n                }\n            }\n        }\n        orderedClientCollection.on(\"addClient\", (client, seq) => this.addClient(client, seq));\n        orderedClientCollection.on(\"removeClient\", (client, seq) => this.removeClient(client, seq));\n\n        if (typeof initialState === \"number\") {\n            this._electionSequenceNumber = initialState;\n        } else {\n            // Override the initially elected client with the initial state.\n            if (initialClient?.clientId !== initialState.electedClientId) {\n                // Cannot find initially elected client, so elect undefined.\n                logger.sendErrorEvent({\n                    eventName: \"InitialElectedClientNotFound\",\n                    electionSequenceNumber: initialState.electionSequenceNumber,\n                    expectedClientId: initialState.electedClientId,\n                    electedClientId: initialClient?.clientId,\n                    clientCount: orderedClientCollection.count,\n                });\n            } else if (initialClient !== undefined && !isEligibleFn(initialClient)) {\n                // Initially elected client is ineligible, so elect next eligible client.\n                initialClient = initialParent = this.findFirstEligibleParent(initialParent);\n                logger.sendErrorEvent({\n                    eventName: \"InitialElectedClientIneligible\",\n                    electionSequenceNumber: initialState.electionSequenceNumber,\n                    expectedClientId: initialState.electedClientId,\n                    electedClientId: initialClient?.clientId,\n                });\n            }\n            this._electedParent = initialParent;\n            this._electedClient = initialClient;\n            this._electionSequenceNumber = initialState.electionSequenceNumber;\n        }\n    }\n\n    /** Tries changing the elected client, raising an event if it is different.\n     * Note that this function does no eligibility or suitability checks. If we get here, then\n     * we will set _electedClient, and we will set _electedParent if this is an interactive client.\n     */\n    private tryElectingClient(client: ILinkedClient | undefined, sequenceNumber: number): void {\n        let change = false;\n        const isSummarizerClient = client?.client.details.type === summarizerClientType;\n        const prevClient = this._electedClient;\n        if (this._electedClient !== client) {\n            // Changing the elected client. Record the sequence number and note that we have to fire an event.\n            this._electionSequenceNumber = sequenceNumber;\n            this._electedClient = client;\n            change = true;\n        }\n        if (this._electedParent !== client && !isSummarizerClient) {\n            // Changing the elected parent as well.\n            this._electedParent = client;\n            change = true;\n        }\n        if (change) {\n            this.emit(\"election\", client, sequenceNumber, prevClient);\n        }\n    }\n\n    private tryElectingParent(client: ILinkedClient | undefined, sequenceNumber: number): void {\n        if (this._electedParent !== client) {\n            this._electedParent = client;\n            this.emit(\"election\", this._electedClient, sequenceNumber, this._electedClient);\n        }\n    }\n\n    /**\n     * Helper function to find the first eligible parent client starting with the passed in client,\n     * or undefined if none are eligible.\n     * @param client - client to start checking\n     * @returns oldest eligible client starting with passed in client or undefined if none.\n     */\n    private findFirstEligibleParent(client: ILinkedClient | undefined): ILinkedClient | undefined {\n        let candidateClient = client;\n        while (candidateClient !== undefined &&\n            (!this.isEligibleFn(candidateClient) || candidateClient.client.details.type === summarizerClientType)) {\n            candidateClient = candidateClient.youngerClient;\n        }\n        return candidateClient;\n    }\n\n    /**\n     * Updates tracking for when a new client is added to the collection.\n     * Will automatically elect that new client if none is elected currently.\n     * @param client - client added to the collection\n     * @param sequenceNumber - sequence number when client was added\n     */\n    private addClient(client: ILinkedClient, sequenceNumber: number): void {\n        if (this.isEligibleFn(client)) {\n            this._eligibleCount++;\n            const newClientIsSummarizer = client.client.details.type === summarizerClientType;\n            const electedClientIsSummarizer = this._electedClient?.client.details.type === summarizerClientType;\n            // Note that we allow a summarizer client to supercede an interactive client as elected client.\n            if (this._electedClient === undefined || (!electedClientIsSummarizer && newClientIsSummarizer)) {\n                this.tryElectingClient(client, sequenceNumber);\n            } else if (this._electedParent === undefined && !newClientIsSummarizer) {\n                // This is an odd case. If the _electedClient is set, the _electedParent should be as well.\n                this.tryElectingParent(client, sequenceNumber);\n            }\n        }\n    }\n\n    /**\n     * Updates tracking for when an existing client is removed from the collection.\n     * Will automatically elect next oldest client if currently elected is removed.\n     * @param client - client removed from the collection\n     * @param sequenceNumber - sequence number when client was removed\n     */\n    private removeClient(client: ILinkedClient, sequenceNumber: number): void {\n        if (this.isEligibleFn(client)) {\n            this._eligibleCount--;\n            if (this._electedClient === client) {\n                // Removing the _electedClient. There are 2 possible cases:\n                if (this._electedParent !== client) {\n                    // 1. The _electedClient is a summarizer that we've been allowing to finish its work.\n                    // Let the _electedParent become the _electedClient so that it can start its own summarizer.\n                    if (this._electedClient.client.details.type !== summarizerClientType) {\n                        throw new UsageError(\"Elected client should be a summarizer client 1\");\n                    }\n                    this.tryElectingClient(this._electedParent, sequenceNumber);\n                } else {\n                    // 2. The _electedClient is an interactive client that has left the quorum.\n                    // Automatically shift to next oldest client.\n                    const nextClient = this.findFirstEligibleParent(this._electedParent?.youngerClient) ??\n                        this.findFirstEligibleParent(this.orderedClientCollection.oldestClient);\n                    this.tryElectingClient(nextClient, sequenceNumber);\n                }\n            } else if (this._electedParent === client) {\n                // Removing the _electedParent (but not _electedClient).\n                // Shift to the next oldest parent, but do not replace the _electedClient,\n                // which is a summarizer that is still doing work.\n                if (this._electedClient?.client.details.type !== summarizerClientType) {\n                    throw new UsageError(\"Elected client should be a summarizer client 2\");\n                }\n                const nextParent = this.findFirstEligibleParent(this._electedParent?.youngerClient) ??\n                    this.findFirstEligibleParent(this.orderedClientCollection.oldestClient);\n                this.tryElectingParent(nextParent, sequenceNumber);\n            }\n        }\n    }\n\n    public getAllEligibleClients(): ITrackedClient[] {\n        return this.orderedClientCollection.getAllClients().filter(this.isEligibleFn);\n    }\n\n    /** Advance election to the next-oldest client. This is called if the current parent is leaving the quorum,\n     * or if the current summarizer is not responsive and we want to stop it and spawn a new one.\n     */\n    public incrementElectedClient(sequenceNumber: number): void {\n        const nextClient = this.findFirstEligibleParent(this._electedParent?.youngerClient) ??\n            this.findFirstEligibleParent(this.orderedClientCollection.oldestClient);\n        if (this._electedClient === undefined || this._electedClient === this._electedParent) {\n            this.tryElectingClient(nextClient, sequenceNumber);\n        } else {\n            // The _electedClient is a summarizer and should not be replaced until it leaves the quorum.\n            // Changing the _electedParent will stop the summarizer.\n            this.tryElectingParent(nextClient, sequenceNumber);\n        }\n    }\n\n    /** (Re-)start election with the oldest client in the quorum. This is called if we need to summarize\n     * and no client has been elected.\n     */\n    public resetElectedClient(sequenceNumber: number): void {\n        const firstClient = this.findFirstEligibleParent(this.orderedClientCollection.oldestClient);\n        if (this._electedClient === undefined || this._electedClient === this._electedParent) {\n            this.tryElectingClient(firstClient, sequenceNumber);\n        } else {\n            // The _electedClient is a summarizer and should not be replaced until it leaves the quorum.\n            // Changing the _electedParent will stop the summarizer.\n            this.tryElectingParent(firstClient, sequenceNumber);\n        }\n    }\n\n    public peekNextElectedClient(): ITrackedClient | undefined {\n        return this.findFirstEligibleParent(this._electedParent?.youngerClient) ??\n            this.findFirstEligibleParent(this.orderedClientCollection.oldestClient);\n    }\n\n    public serialize(): ISerializedElection {\n        return {\n            electionSequenceNumber: this.electionSequenceNumber,\n            electedClientId: this.electedClient?.clientId,\n            electedParentId: this.electedParent?.clientId,\n        };\n    }\n}\n"]}

package/lib/packageVersion.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,mCAAmC,CAAC;AAC3D,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/container-runtime\";\nexport const pkgVersion = \"1.4.0-115997\";\n"]}

package/lib/pendingStateManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pendingStateManager.d.ts","sourceRoot":"","sources":["../src/pendingStateManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AAEjE,OAAO,EAAE,uBAAuB,EAAE,MAAM,uCAAuC,CAAC;AAEhF,OAAO,EACH,yBAAyB,EAC5B,MAAM,sCAAsC,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,qCAAqC,CAAC;AAGhE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAE1D;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC5B,IAAI,EAAE,SAAS,CAAC;IAChB,WAAW,EAAE,oBAAoB,CAAC;IAClC,oBAAoB,EAAE,MAAM,CAAC;IAC7B,uBAAuB,EAAE,MAAM,CAAC;IAChC,OAAO,EAAE,GAAG,CAAC;IACb,eAAe,EAAE,OAAO,CAAC;IACzB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CACnD;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAC9B,IAAI,EAAE,WAAW,CAAC;IAClB,SAAS,EAAE,SAAS,CAAC;CACxB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC1B,IAAI,EAAE,OAAO,CAAC;CACjB;AAED,oBAAY,aAAa,GAAG,eAAe,GAAG,iBAAiB,GAAG,aAAa,CAAC;AAEhF,MAAM,WAAW,kBAAkB;IAC/B;;OAEG;IACH,aAAa,EAAE,aAAa,EAAE,CAAC;CAClC;AAED,MAAM,WAAW,oBAAoB;IACjC,SAAS,IAAI,OAAO,CAAC;IACrB,QAAQ,IAAI,MAAM,GAAG,SAAS,CAAC;IAC/B,SAAS,IAAI,SAAS,CAAC;IACvB,YAAY,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI,CAAC;IACpC,KAAK,CAAC,KAAK,CAAC,EAAE,uBAAuB,GAAG,IAAI,CAAC;IAC7C,cAAc,EAAE,CAAC,IAAI,EAAE,oBAAoB,EAAE,OAAO,EAAE,yBAAyB,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;IACrG,KAAK,IAAI,IAAI,CAAC;IACd,QAAQ,CACJ,IAAI,EAAE,oBAAoB,EAC1B,OAAO,EAAE,GAAG,EACZ,eAAe,EAAE,OAAO,EACxB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC;IAC3D,QAAQ,CACJ,IAAI,EAAE,oBAAoB,EAC1B,OAAO,EAAE,GAAG,EACZ,eAAe,EAAE,OAAO,GAAG,IAAI,CAAC;CACvC;AAED;;;;;;;;GAQG;AACH,qBAAa,mBAAoB,YAAW,WAAW;IAmD/C,OAAO,CAAC,QAAQ,CAAC,YAAY;IAlDjC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA8B;IAC5D,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAuB;IACrD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAGzB;IAGH,OAAO,CAAC,qBAAqB,CAAa;IAC1C,IAAW,oBAAoB,IAAI,MAAM,CAExC;IAGD,OAAO,CAAC,iBAAiB,CAAkB;IAI3C,OAAO,CAAC,wBAAwB,CAAwC;IAExE;;;;OAIG;IACH,OAAO,CAAC,uBAAuB,CAAY;IAE3C,OAAO,CAAC,QAAQ,CAAqB;IAErC;;;OAGG;IACI,kBAAkB,IAAI,OAAO;IAI7B,aAAa,IAAI,kBAAkB,GAAG,SAAS;gBAajC,YAAY,EAAE,oBAAoB,EACnD,gBAAgB,EAAE,SAAS,EAC3B,iBAAiB,EAAE,kBAAkB,GAAG,SAAS;IAQrD,IAAW,QAAQ,YAAyC;IAC5D,SAAgB,OAAO,aAAgC;IAEvD;;;;;;;OAOG;IACI,eAAe,CAClB,IAAI,EAAE,oBAAoB,EAC1B,oBAAoB,EAAE,MAAM,EAC5B,uBAAuB,EAAE,MAAM,EAC/B,OAAO,EAAE,GAAG,EACZ,eAAe,EAAE,OAAO,EACxB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS;IAiBnD;;;OAGG;IACI,kBAAkB,CAAC,SAAS,EAAE,SAAS;IAI9C;;OAEG;IACI,OAAO;IAiBd;;;OAGG;IACU,iBAAiB,CAAC,MAAM,CAAC,EAAE,MAAM;IA0B9C;;;;OAIG;IACI,0BAA0B,CAAC,OAAO,EAAE,yBAAyB,GAAG,OAAO;IAgC9E;;;OAGG;IACH,OAAO,CAAC,sBAAsB;IAqD9B;;;OAGG;IACH,OAAO,CAAC,oBAAoB;IA2C5B;;OAEG;IACI,UAAU;;;IAsBjB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAM5B;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAsBhC;;;OAGG;IACI,mBAAmB;CAsD7B"}