@fluid-experimental/tree 0.58.2002 → 0.59.1000

package/dist/TransactionInternal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TransactionInternal.js","sourceRoot":"","sources":["../src/TransactionInternal.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,qCAAuE;AACvE,+CAA6F;AAC7F,2DAA2D;AAC3D,uDAa2B;AAC3B,mDASyB;AA4IzB;;;;;;;;;;;;GAYG;AACH,MAAa,kBAAkB;IAM9B;;;OAGG;IACH,YAAmB,IAAkB,EAAE,MAAgC;QAN/D,SAAI,GAAG,IAAI,CAAC;QAOnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG;YACZ,IAAI,EAAE,IAAI,CAAC,kBAAkB,EAAE;YAC/B,MAAM,EAAE,4BAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,EAAE;YACX,KAAK,EAAE,EAAE;SACT,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAW,KAAK;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;IACzB,CAAC;IAED,oFAAoF;IAC7E,KAAK;QACX,eAAM,CAAC,IAAI,CAAC,IAAI,EAAE,qCAAqC,CAAC,CAAC;QACzD,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QAClB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,4BAAU,CAAC,OAAO,EAAE;YAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3D,IAAI,eAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;gBAC5B,IAAI,UAAU,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE;oBACpC,IAAI,CAAC,KAAK,mCAAQ,IAAI,CAAC,KAAK,KAAE,IAAI,EAAE,UAAU,CAAC,MAAM,GAAE,CAAC;iBACxD;gBACD,OAAO;oBACN,MAAM,EAAE,4BAAU,CAAC,OAAO;oBAC1B,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,OAAO,EAAE,IAAI,CAAC,OAAO;oBACrB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;iBACxB,CAAC;aACF;YACD,IAAI,CAAC,KAAK,mCAAQ,IAAI,CAAC,KAAK,GAAK,UAAU,CAAC,KAAK,CAAE,CAAC;YACpD,uCACI,UAAU,CAAC,KAAK,KACnB,KAAK,EAAE,IAAI,CAAC,KAAK,EACjB,OAAO,EAAE,IAAI,CAAC,OAAO,EACrB,MAAM,EAAE,IAAI,CAAC,MAAM,IAClB;SACF;QACD,OAAO;YACN,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;YACzB,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO;YAC3B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM;SACnB,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACI,YAAY,CAAC,OAAiC,EAAE,OAA2B,EAAE;QACnF,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxC,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;QAC7C,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,UAAU,CAAC,IAAI,KAAK,IAAI,EAAE;YAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;gBAC7B,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,4BAAU,CAAC,OAAO,EAAE;oBACjE,OAAO,IAAI,CAAC;iBACZ;aACD;YACD,OAAO,IAAI,CAAC;SACZ;QAED,IAAI,IAAI,CAAC,WAAW,CAAC,kBAAkB,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,4BAAU,CAAC,OAAO,EAAE;YAC7E,OAAO,IAAI,CAAC;SACZ;QAED,MAAM,WAAW,GAAG;YACnB,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YACpC,MAAM,EAAE,IAAI,CAAC,IAAI;YACjB,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,MAAM,EAAE,CAAC;SACT,CAAC;QAEF;;;WAGG;QACH,MAAM,mBAAmB,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE;YAC3C,GAAG,EAAE,CAAC,MAA0B,EAAE,IAAY,EAAyC,EAAE;gBACxF,IAAI,IAAI,KAAK,QAAQ,EAAE;oBACtB,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;iBACzB;gBACD,OAAO,IAAI,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACpE,CAAC;SACD,CAAC,CAAC;QAEH,OAAO,UAAU,CAAC,IAAI,KAAK,IAAI,EAAE;YAChC,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC,MAAM,KAAK,4BAAU,CAAC,OAAO,EAAE;gBAC1F,OAAO,IAAI,CAAC;aACZ;YAED,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpE,WAAW,CAAC,MAAM,IAAI,CAAC,CAAC;YACxB,WAAW,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;YAC9B,UAAU,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;SACzB;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACI,WAAW,CAAC,MAAsB,EAAE,OAA2B,EAAE;QACvE,eAAM,CAAC,IAAI,CAAC,IAAI,EAAE,uCAAuC,CAAC,CAAC;QAC3D,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,4BAAU,CAAC,OAAO,EAAE;YAC7C,aAAI,CAAC,yEAAyE,CAAC,CAAC;SAChF;QACD,MAAM,gBAAgB,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAChF,IAAI,eAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE;YACrC,IAAI,CAAC,KAAK,mCAAQ,IAAI,CAAC,KAAK,GAAK,gBAAgB,CAAC,KAAK,CAAE,CAAC;YAC1D,OAAO,IAAI,CAAC;SACZ;QACD,MAAM,cAAc,GAAG,gBAAgB,CAAC,MAAM,CAAC;QAC/C,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QAC5E,IAAI,eAAM,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE;YAC9B,IAAI,CAAC,KAAK,GAAG;gBACZ,MAAM,EAAE,4BAAU,CAAC,OAAO;gBAC1B,IAAI,EAAE,YAAY,CAAC,MAAM;gBACzB,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;gBACpC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,YAAY,CAAC,MAAM,EAAE,CAAC;aACxE,CAAC;SACF;aAAM;YACN,IAAI,CAAC,KAAK,mCACN,IAAI,CAAC,KAAK,GACV,YAAY,CAAC,KAAK,CACrB,CAAC;SACF;QACD,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AApLD,gDAoLC;AA6CD;;;;;;;;;;;;;GAaG;AACH,IAAiB,mBAAmB,CAupBnC;AAvpBD,WAAiB,mBAAmB;IACnC;;OAEG;IACH,SAAgB,OAAO,CAAC,IAAkB;QACzC,OAAO,IAAI,kBAAkB,CAAC,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC,CAAC;IACnD,CAAC;IAFe,2BAAO,UAEtB,CAAA;IAID;;OAEG;IACH,MAAa,MAAM;QAAnB;YACC;;eAEG;YACgB,aAAQ,GAA+C,IAAI,GAAG,EAAE,CAAC;QA4XrF,CAAC;QA1XA;;;;;;WAMG;QACI,gBAAgB,CAAC,KAAiB,EAAE,MAAsB;YAChE,OAAO,eAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;QAED;;;;;WAKG;QACI,eAAe,CAAC,KAAiB;YACvC,sGAAsG;YACtG,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;gBAC9B,CAAC,CAAC,eAAM,CAAC,KAAK,CAAC;oBACb,MAAM,EAAE,4BAAU,CAAC,SAAS;oBAC5B,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,sBAAsB;wBACxC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK;qBAC7C;iBACA,CAAC;gBACJ,CAAC,CAAC,eAAM,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED;;;;;;WAMG;QACI,cAAc,CAAC,KAAiB,EAAE,MAAsB;YAC9D,QAAQ,MAAM,CAAC,IAAI,EAAE;gBACpB,KAAK,oCAAkB,CAAC,KAAK;oBAC5B,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACvC,KAAK,oCAAkB,CAAC,MAAM;oBAC7B,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACxC,KAAK,oCAAkB,CAAC,MAAM;oBAC7B,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACxC,KAAK,oCAAkB,CAAC,UAAU;oBACjC,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC5C,KAAK,oCAAkB,CAAC,QAAQ;oBAC/B,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC1C;oBACC,OAAO,aAAI,CAAC,uCAAuC,CAAC,CAAC;aACtD;QACF,CAAC;QAEO,UAAU,CAAC,KAAiB,EAAE,MAAqB;YAC1D,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE;gBAC1C,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,SAAS;oBAC5B,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,8BAA8B;wBAChD,MAAM;wBACN,UAAU,EAAE,MAAM,CAAC,WAAW;qBAC9B;iBACD,CAAC,CAAC;aACH;YAED,IAAI,gBAAoC,CAAC;YACzC,IAAI,kBAAsC,CAAC;YAC3C,IAAI,SAA6B,CAAC;YAClC,IAAI,wBAAwD,CAAC;YAC7D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAwB,CAAC;YAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CACzC,MAAM,CAAC,MAAM,EACb,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE;gBAChB,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAChB,kBAAkB,GAAG,EAAE,CAAC;oBACxB,OAAO,IAAI,CAAC;iBACZ;gBACD,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE;oBAC5C,gBAAgB,GAAG,EAAE,CAAC;oBACtB,OAAO,IAAI,CAAC;iBACZ;gBACD,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBACtB,OAAO,KAAK,CAAC;YACd,CAAC,EACD,CAAC,UAAU,EAAE,EAAE;gBACd,wBAAwB,GAAG,UAAU,CAAC;YACvC,CAAC,CACD,CAAC;YAEF,IAAI,gBAAgB,KAAK,SAAS,EAAE;gBACnC,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,OAAO;oBAC1B,OAAO,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,cAAc,EAAE,MAAM,EAAE,EAAE,EAAE,gBAAgB,EAAE;iBAC3E,CAAC,CAAC;aACH;YACD,IAAI,kBAAkB,KAAK,SAAS,EAAE;gBACrC,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,SAAS;oBAC5B,OAAO,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,kBAAkB,EAAE,MAAM,EAAE,EAAE,EAAE,kBAAkB,EAAE;iBACjF,CAAC,CAAC;aACH;YACD,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC5B,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,OAAO;oBAC1B,OAAO,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE;iBAC/D,CAAC,CAAC;aACH;YACD,IAAI,wBAAwB,KAAK,SAAS,EAAE;gBAC3C,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,SAAS;oBAC5B,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,wBAAwB;wBAC1C,MAAM;wBACN,UAAU,EAAE,wBAAwB;qBACpC;iBACD,CAAC,CAAC;aACH;YAED,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAChB,MAAM,CAAC,WAAW,EAClB,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,aAAI,CAAC,8DAA8D,CAAC,CAC9E,CAAC;YACF,OAAO,eAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QAEO,WAAW,CAAC,KAAiB,EAAE,MAAsB;YAC5D,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAChD,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,SAAS;oBAC5B,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,wBAAwB;wBAC1C,MAAM;wBACN,UAAU,EAAE,MAAM,CAAC,MAAM;qBACzB;iBACD,CAAC,CAAC;aACH;YAED,MAAM,oBAAoB,GAAG,mCAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;YACjF,IAAI,oBAAoB,CAAC,MAAM,KAAK,qCAAqB,CAAC,KAAK,EAAE;gBAChE,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EACL,oBAAoB,CAAC,MAAM,KAAK,qCAAqB,CAAC,SAAS;wBAC9D,CAAC,CAAC,4BAAU,CAAC,SAAS;wBACtB,CAAC,CAAC,4BAAU,CAAC,OAAO;oBACtB,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,QAAQ;wBAC1B,MAAM;wBACN,KAAK,EAAE,MAAM,CAAC,WAAW;wBACzB,YAAY,EAAE,oBAAoB,CAAC,MAAM;qBACzC;iBACD,CAAC,CAAC;aACH;YAED,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,+BAAe,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;YACvE,OAAO,eAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QAEO,WAAW,CAAC,KAAiB,EAAE,MAAsB;YAC5D,MAAM,eAAe,GAAG,mCAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YACvE,IAAI,eAAe,CAAC,MAAM,KAAK,yCAAyB,CAAC,KAAK,EAAE;gBAC/D,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EACL,eAAe,CAAC,MAAM,KAAK,yCAAyB,CAAC,uBAAuB;wBAC5E,eAAe,CAAC,MAAM,KAAK,yCAAyB,CAAC,QAAQ;wBAC7D,eAAe,CAAC,MAAM,CAAC,YAAY,KAAK,qCAAqB,CAAC,SAAS;wBACtE,CAAC,CAAC,4BAAU,CAAC,OAAO;wBACpB,CAAC,CAAC,4BAAU,CAAC,SAAS;oBACxB,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,QAAQ;wBAC1B,MAAM;wBACN,KAAK,EAAE,MAAM,CAAC,MAAM;wBACpB,YAAY,EAAE,eAAe,CAAC,MAAM;qBACpC;iBACD,CAAC,CAAC;aACH;YAED,MAAM,MAAM,GAAG,2BAAW,CAAC,KAAK,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;YACxD,IAAI,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC;YAC/B,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;YAE5B,4BAA4B;YAC5B,IAAI,MAAM,CAAC,WAAW,KAAK,SAAS,EAAE;gBACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE;oBAC1C,OAAO,eAAM,CAAC,KAAK,CAAC;wBACnB,MAAM,EAAE,4BAAU,CAAC,SAAS;wBAC5B,OAAO,EAAE;4BACR,IAAI,EAAE,WAAW,CAAC,8BAA8B;4BAChD,MAAM;4BACN,UAAU,EAAE,MAAM,CAAC,WAAW;yBAC9B;qBACD,CAAC,CAAC;iBACH;gBACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;aAChD;iBAAM;gBACN,YAAY,GAAG,YAAY,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;aAClD;YACD,OAAO,eAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;QAChC,CAAC;QAEO,eAAe,CAAC,KAAiB,EAAE,MAA0B;YACpE,+CAA+C;YAC/C,eAAM,CAAC,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE,4CAA4C,CAAC,CAAC;YACxF,eAAM,CAAC,MAAM,CAAC,WAAW,KAAK,SAAS,EAAE,2CAA2C,CAAC,CAAC;YAEtF,MAAM,eAAe,GAAG,mCAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;YAC5E,IAAI,eAAe,CAAC,MAAM,KAAK,yCAAyB,CAAC,KAAK,EAAE;gBAC/D,OAAO,eAAe,CAAC,MAAM,KAAK,yCAAyB,CAAC,uBAAuB;oBAClF,eAAe,CAAC,MAAM,KAAK,yCAAyB,CAAC,QAAQ;oBAC7D,eAAe,CAAC,MAAM,CAAC,YAAY,KAAK,qCAAqB,CAAC,SAAS;oBACvE,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,kCAAgB,CAAC,UAAU;wBAC9C,CAAC,CAAC,eAAM,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;wBACvB,CAAC,CAAC,eAAM,CAAC,KAAK,CAAC;4BACb,MAAM,EAAE,4BAAU,CAAC,OAAO;4BAC1B,OAAO,EAAE;gCACR,IAAI,EAAE,WAAW,CAAC,mBAAmB;gCACrC,UAAU,EAAE,MAAM;gCAClB,SAAS,EAAE;oCACV,IAAI,EAAE,uBAAuB,CAAC,QAAQ;oCACtC,YAAY,EAAE,eAAe,CAAC,MAAM;iCACpC;6BACD;yBACA,CAAC;oBACL,CAAC,CAAC,eAAM,CAAC,KAAK,CAAC;wBACb,MAAM,EAAE,4BAAU,CAAC,SAAS;wBAC5B,OAAO,EAAE;4BACR,IAAI,EAAE,WAAW,CAAC,mBAAmB;4BACrC,UAAU,EAAE,MAAM;4BAClB,SAAS,EAAE;gCACV,IAAI,EAAE,uBAAuB,CAAC,QAAQ;gCACtC,YAAY,EAAE,eAAe,CAAC,MAAM;6BACpC;yBACD;qBACA,CAAC,CAAC;aACN;YAED,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,wCAAoB,CAAC,KAAK,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;YACzE,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;YAEtD,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,GAAG,UAAU,EAAE;gBAC3E,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,OAAO;oBAC1B,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,mBAAmB;wBACrC,UAAU,EAAE,MAAM;wBAClB,SAAS,EAAE;4BACV,IAAI,EAAE,uBAAuB,CAAC,SAAS;4BACvC,MAAM,EAAE,QAAQ,GAAG,UAAU;yBAC7B;qBACD;iBACD,CAAC,CAAC;aACH;YAED,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,KAAK,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE;gBAC9E,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,OAAO;oBAC1B,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,mBAAmB;wBACrC,UAAU,EAAE,MAAM;wBAClB,SAAS,EAAE;4BACV,IAAI,EAAE,uBAAuB,CAAC,SAAS;4BACvC,MAAM,EAAE,MAAM,CAAC,UAAU;yBACzB;qBACD;iBACD,CAAC,CAAC;aACH;YAED,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE;gBACnE,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,OAAO;oBAC1B,OAAO,EAAE;wBACR,IAAI,EAAE,WAAW,CAAC,mBAAmB;wBACrC,UAAU,EAAE,MAAM;wBAClB,SAAS,EAAE;4BACV,IAAI,EAAE,uBAAuB,CAAC,QAAQ;4BACtC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,KAAK;yBACvB;qBACD;iBACD,CAAC,CAAC;aACH;YAED,OAAO,eAAM,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QAEO,aAAa,CAAC,KAAiB,EAAE,MAAwB;YAChE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE;gBAC7C,OAAO,eAAM,CAAC,KAAK,CAAC;oBACnB,MAAM,EAAE,4BAAU,CAAC,OAAO;oBAC1B,OAAO,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,YAAY,EAAE;iBACzE,CAAC,CAAC;aACH;YAED,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;YAC7E,OAAO,eAAM,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;QAC3B,CAAC;QAED;;;;;WAKG;QACO,sBAAsB,CAC/B,QAAqC,EACrC,YAA+D,EAC/D,mBAA6D;YAE7D,MAAM,WAAW,GAAa,EAAE,CAAC;YACjC,MAAM,WAAW,GAAwB,EAAE,CAAC;YAC5C,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE;gBACjC,IAAI,kCAAoB,CAAC,SAAS,CAAC,EAAE;oBACpC,MAAM,WAAW,GAAG,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;oBAC5E,IAAI,WAAW,KAAK,SAAS,EAAE;wBAC9B,OAAO,SAAS,CAAC;qBACjB;oBACD,WAAW,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;iBACjC;qBAAM;oBACN,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAC5B,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;iBACvC;aACD;YACD,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC9B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;gBAC/B,eAAM,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,kCAAoB,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiC,CAAC;gBACxD,gDAAgD;gBAChD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE;oBAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;wBAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;wBAClC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;4BACxB,MAAM,QAAQ,GAAa,EAAE,CAAC;4BAC9B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;gCAC7B,IAAI,kCAAoB,CAAC,KAAK,CAAC,EAAE;oCAChC,MAAM,WAAW,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;oCACxE,IAAI,WAAW,KAAK,SAAS,EAAE;wCAC9B,OAAO,SAAS,CAAC;qCACjB;oCACD,QAAQ,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;iCAC9B;qCAAM;oCACN,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oCAChC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iCACxB;6BACD;4BACD,MAAM,CAAC,GAAG,CAAC,GAAiB,EAAE,QAAQ,CAAC,CAAC;yBACxC;qBACD;iBACD;gBACD,MAAM,OAAO,GAAiB;oBAC7B,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,MAAM;iBACN,CAAC;gBACF,8BAAqB,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;gBAChD,IAAI,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,EAAE;oBAC3C,OAAO,SAAS,CAAC;iBACjB;aACD;YACD,OAAO,WAAW,CAAC;QACpB,CAAC;QAEO,kBAAkB,CACzB,UAA8B,EAC9B,mBAA6D;YAE7D,gDAAgD;YAChD,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACtD,IAAI,eAAe,KAAK,SAAS,EAAE;gBAClC,mBAAmB,CAAC,UAAU,CAAC,CAAC;gBAChC,OAAO,SAAS,CAAC;aACjB;YACD,uHAAuH;YACvH,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YACjC,OAAO,eAAe,CAAC;QACxB,CAAC;KACD;IAhYY,0BAAM,SAgYlB,CAAA;IAED;;OAEG;IACH,IAAY,WAqCX;IArCD,WAAY,WAAW;QACtB;;WAEG;QACH,gEAAiD,CAAA;QACjD;;WAEG;QACH,gFAAiE,CAAA;QACjE;;WAEG;QACH,oEAAqD,CAAA;QACrD;;WAEG;QACH,wDAAyC,CAAA;QACzC;;WAEG;QACH,gDAAiC,CAAA;QACjC;;WAEG;QACH,sCAAuB,CAAA;QACvB;;WAEG;QACH,oCAAqB,CAAA;QACrB;;WAEG;QACH,oCAAqB,CAAA;QACrB;;WAEG;QACH,0DAA2C,CAAA;IAC5C,CAAC,EArCW,WAAW,GAAX,+BAAW,KAAX,+BAAW,QAqCtB;IA2MD;;OAEG;IACH,IAAY,uBAiBX;IAjBD,WAAY,uBAAuB;QAClC;;WAEG;QACH,gDAAqB,CAAA;QACrB;;WAEG;QACH,kDAAuB,CAAA;QACvB;;WAEG;QACH,kDAAuB,CAAA;QACvB;;WAEG;QACH,gDAAqB,CAAA;IACtB,CAAC,EAjBW,uBAAuB,GAAvB,2CAAuB,KAAvB,2CAAuB,QAiBlC;AACF,CAAC,EAvpBgB,mBAAmB,GAAnB,2BAAmB,KAAnB,2BAAmB,QAupBnC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, copyPropertyIfDefined, fail, Result } from './Common';\nimport { NodeId, DetachedSequenceId, TraitLabel, isDetachedSequenceId } from './Identifiers';\nimport { rangeFromStableRange } from './TreeViewUtilities';\nimport {\n\tBuildInternal,\n\tBuildNodeInternal,\n\tChangeInternal,\n\tChangeTypeInternal,\n\tConstraintEffect,\n\tConstraintInternal,\n\tDetachInternal,\n\tEditStatus,\n\tInsertInternal,\n\tSetValueInternal,\n\tStablePlaceInternal,\n\tStableRangeInternal,\n} from './persisted-types';\nimport {\n\tdetachRange,\n\tinsertIntoTrait,\n\tvalidateStablePlace,\n\tvalidateStableRange,\n\tBadPlaceValidationResult,\n\tBadRangeValidationResult,\n\tPlaceValidationResult,\n\tRangeValidationResultKind,\n} from './EditUtilities';\nimport { RevisionView, TransactionView } from './RevisionView';\nimport { ReconciliationChange, ReconciliationPath } from './ReconciliationPath';\nimport { TreeViewNode } from './TreeView';\n\n/**\n * Result of applying a transaction.\n * @public\n */\nexport type EditingResult = FailedEditingResult | ValidEditingResult;\n\n/**\n * Basic result of applying a transaction.\n * @public\n */\nexport interface EditingResultBase {\n\t/**\n\t * The final status of the transaction.\n\t */\n\treadonly status: EditStatus;\n\t/**\n\t * The valid changes applied as part of the transaction.\n\t */\n\treadonly changes: readonly ChangeInternal[];\n\t/**\n\t * The editing steps applied as part of the transaction.\n\t */\n\treadonly steps: readonly ReconciliationChange[];\n\t/**\n\t * The revision preceding the transaction.\n\t */\n\treadonly before: RevisionView;\n}\n\n/**\n * Result of applying an invalid or malformed transaction.\n * @public\n */\nexport interface FailedEditingResult extends EditingResultBase {\n\t/**\n\t * {@inheritDoc EditingResultBase.status}\n\t */\n\treadonly status: EditStatus.Invalid | EditStatus.Malformed;\n\t/**\n\t * Information about what caused the transaction to fail.\n\t */\n\treadonly failure: TransactionInternal.Failure;\n\t/**\n\t * The valid changes applied as part of the transaction.\n\t * Those were ultimately abandoned due to the transaction failure.\n\t */\n\treadonly changes: readonly ChangeInternal[];\n\t/**\n\t * The editing steps applied as part of the transaction.\n\t * Those were ultimately abandoned due to the transaction failure.\n\t */\n\treadonly steps: readonly ReconciliationChange[];\n}\n\n/**\n * Result of applying a valid transaction.\n * @public\n */\nexport interface ValidEditingResult extends EditingResultBase {\n\t/**\n\t * {@inheritDoc EditingResultBase.status}\n\t */\n\treadonly status: EditStatus.Applied;\n\t/**\n\t * The new revision produced by the transaction.\n\t */\n\treadonly after: RevisionView;\n}\n\n/**\n * The result of applying a change within a transaction.\n * @public\n */\nexport type ChangeResult = Result<TransactionView, TransactionFailure>;\n\n/**\n * The ongoing state of a transaction.\n * @public\n */\nexport type TransactionState = SucceedingTransactionState | FailingTransactionState;\n\n/**\n * The state of a transaction that has not encountered an error.\n */\nexport interface SucceedingTransactionState {\n\t/**\n\t * The current status of the transaction.\n\t */\n\treadonly status: EditStatus.Applied;\n\t/**\n\t * The view reflecting the latest applied change.\n\t */\n\treadonly view: TransactionView;\n\t/**\n\t * The applied changes so far.\n\t */\n\treadonly changes: readonly ChangeInternal[];\n\t/**\n\t * The editing steps applied so far.\n\t */\n\treadonly steps: readonly ReconciliationChange[];\n}\n\n/**\n * The state of a transaction that has encountered an error.\n */\nexport interface FailingTransactionState extends TransactionFailure {\n\t/**\n\t * The view reflecting the latest applied change.\n\t */\n\treadonly view: TransactionView;\n\t/**\n\t * The applied changes so far.\n\t */\n\treadonly changes: readonly ChangeInternal[];\n\t/**\n\t * The editing steps applied so far.\n\t */\n\treadonly steps: readonly ReconciliationChange[];\n}\n\n/**\n * The failure state of a transaction.\n */\nexport interface TransactionFailure {\n\t/**\n\t * The status indicating the kind of failure encountered.\n\t */\n\treadonly status: EditStatus.Invalid | EditStatus.Malformed;\n\t/**\n\t * Information about what caused the transaction to fail.\n\t */\n\treadonly failure: TransactionInternal.Failure;\n}\n\n/**\n * A mutable transaction for applying sequences of changes to a TreeView.\n * Allows viewing the intermediate states.\n *\n * Contains necessary state to apply changes within an edit to a TreeView.\n *\n * May have any number of changes applied to make up the edit.\n * Use `close` to complete the transaction, returning the array of changes and an EditingResult showing the\n * results of applying the changes as an Edit to the initial TreeView (passed to the constructor).\n *\n * No data outside the Transaction is modified by Transaction:\n * the results from `close` must be used to actually submit an `Edit`.\n */\nexport class GenericTransaction {\n\tprivate readonly policy: GenericTransactionPolicy;\n\tprotected readonly before: RevisionView;\n\tprivate state: TransactionState;\n\tprivate open = true;\n\n\t/**\n\t * Create and open an edit of the provided `TreeView`. After applying 0 or more changes, this editor should be closed via `close()`.\n\t * @param view - the `TreeView` at which this edit begins. The first change will be applied against this view.\n\t */\n\tpublic constructor(view: RevisionView, policy: GenericTransactionPolicy) {\n\t\tthis.before = view;\n\t\tthis.policy = policy;\n\t\tthis.state = {\n\t\t\tview: view.openForTransaction(),\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: [],\n\t\t\tsteps: [],\n\t\t};\n\t}\n\n\t/** Whether or not this transaction has been closed via `close()` */\n\tpublic get isOpen(): boolean {\n\t\treturn this.open;\n\t}\n\n\t/**\n\t * The most up-to-date `TreeView` for this edit. This is the state of the tree after all changes applied so far.\n\t */\n\tpublic get view(): TransactionView {\n\t\treturn this.state.view;\n\t}\n\n\t/**\n\t * The status code of the most recent attempted change.\n\t */\n\tpublic get status(): EditStatus {\n\t\treturn this.state.status;\n\t}\n\n\t/**\n\t * The status code of the most recent attempted change.\n\t */\n\tpublic get changes(): readonly ChangeInternal[] {\n\t\treturn this.state.changes;\n\t}\n\n\t/**\n\t * The status code of the most recent attempted change.\n\t */\n\tpublic get steps(): readonly ReconciliationChange[] {\n\t\treturn this.state.steps;\n\t}\n\n\t/** @returns the final `EditStatus` and `TreeView` after all changes are applied. */\n\tpublic close(): EditingResult {\n\t\tassert(this.open, 'transaction has already been closed');\n\t\tthis.open = false;\n\t\tif (this.state.status === EditStatus.Applied) {\n\t\t\tconst validation = this.policy.validateOnClose(this.state);\n\t\t\tif (Result.isOk(validation)) {\n\t\t\t\tif (validation.result !== this.view) {\n\t\t\t\t\tthis.state = { ...this.state, view: validation.result };\n\t\t\t\t}\n\t\t\t\treturn {\n\t\t\t\t\tstatus: EditStatus.Applied,\n\t\t\t\t\tsteps: this.steps,\n\t\t\t\t\tchanges: this.changes,\n\t\t\t\t\tbefore: this.before,\n\t\t\t\t\tafter: this.view.close(),\n\t\t\t\t};\n\t\t\t}\n\t\t\tthis.state = { ...this.state, ...validation.error };\n\t\t\treturn {\n\t\t\t\t...validation.error,\n\t\t\t\tsteps: this.steps,\n\t\t\t\tchanges: this.changes,\n\t\t\t\tbefore: this.before,\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\tstatus: this.state.status,\n\t\t\tfailure: this.state.failure,\n\t\t\tsteps: this.steps,\n\t\t\tchanges: this.changes,\n\t\t\tbefore: this.before,\n\t\t};\n\t}\n\n\t/**\n\t * A helper to apply a sequence of changes. Changes will be applied one after the other. If a change fails to apply,\n\t * the remaining changes in `changes` will be ignored.\n\t * @param changes - the sequence of changes to apply.\n\t * @param path - the reconciliation path for the first change.\n\t * @returns this\n\t */\n\tpublic applyChanges(changes: Iterable<ChangeInternal>, path: ReconciliationPath = []): this {\n\t\tconst iter = changes[Symbol.iterator]();\n\t\tconst firsChangeInternal = iter.next().value;\n\t\tlet iterResult = iter.next();\n\t\tif (iterResult.done === true) {\n\t\t\tfor (const change of changes) {\n\t\t\t\tif (this.applyChange(change, path).status !== EditStatus.Applied) {\n\t\t\t\t\treturn this;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\n\t\tif (this.applyChange(firsChangeInternal, path).status !== EditStatus.Applied) {\n\t\t\treturn this;\n\t\t}\n\n\t\tconst ongoingEdit = {\n\t\t\t0: this.steps[this.steps.length - 1],\n\t\t\tbefore: this.view,\n\t\t\tafter: this.view,\n\t\t\tlength: 1,\n\t\t};\n\n\t\t/**\n\t\t * We use a Proxy instead of `{ ...path, ...objectWithOngoingEdit }` to avoid eagerly demanding all parts of the path, which may\n\t\t * require extensive computation.\n\t\t */\n\t\tconst pathWithOngoingEdit = new Proxy(path, {\n\t\t\tget: (target: ReconciliationPath, prop: string): ReconciliationPath[number | 'length'] => {\n\t\t\t\tif (prop === 'length') {\n\t\t\t\t\treturn target.length + 1;\n\t\t\t\t}\n\t\t\t\treturn prop === String(target.length) ? ongoingEdit : target[prop];\n\t\t\t},\n\t\t});\n\n\t\twhile (iterResult.done !== true) {\n\t\t\tif (this.applyChange(iterResult.value, pathWithOngoingEdit).status !== EditStatus.Applied) {\n\t\t\t\treturn this;\n\t\t\t}\n\n\t\t\tongoingEdit[ongoingEdit.length] = this.steps[this.steps.length - 1];\n\t\t\tongoingEdit.length += 1;\n\t\t\tongoingEdit.after = this.view;\n\t\t\titerResult = iter.next();\n\t\t}\n\t\treturn this;\n\t}\n\n\t/**\n\t * Attempt to apply the given change as part of this edit. This method should not be called if a previous change in this edit failed to\n\t * apply.\n\t * @param change - the change to apply\n\t * @param path - the reconciliation path for the change.\n\t * @returns this\n\t */\n\tpublic applyChange(change: ChangeInternal, path: ReconciliationPath = []): this {\n\t\tassert(this.open, 'Editor must be open to apply changes.');\n\t\tif (this.state.status !== EditStatus.Applied) {\n\t\t\tfail('Cannot apply change to an edit unless all previous changes have applied');\n\t\t}\n\t\tconst resolutionResult = this.policy.tryResolveChange(this.state, change, path);\n\t\tif (Result.isError(resolutionResult)) {\n\t\t\tthis.state = { ...this.state, ...resolutionResult.error };\n\t\t\treturn this;\n\t\t}\n\t\tconst resolvedChange = resolutionResult.result;\n\t\tconst changeResult = this.policy.dispatchChange(this.state, resolvedChange);\n\t\tif (Result.isOk(changeResult)) {\n\t\t\tthis.state = {\n\t\t\t\tstatus: EditStatus.Applied,\n\t\t\t\tview: changeResult.result,\n\t\t\t\tchanges: this.changes.concat(change),\n\t\t\t\tsteps: this.steps.concat({ resolvedChange, after: changeResult.result }),\n\t\t\t};\n\t\t} else {\n\t\t\tthis.state = {\n\t\t\t\t...this.state,\n\t\t\t\t...changeResult.error,\n\t\t\t};\n\t\t}\n\t\treturn this;\n\t}\n}\n\n/**\n * An object that encapsulates the rules and state pertaining to a specific subclass of {@link GenericTransaction}.\n * The characteristics that define such a subclass (and an implementation of this interface) are:\n * - The type of change that can be applied\n * - How those changes impact the state of the tree\n * - How those changes are resolved in the face of concurrent changes\n * - What makes a transaction valid\n * - The kind of situations that might lead to a transaction failure\n *\n * Instances of this type are passed to the {@link GenericTransaction} constructor.\n */\nexport interface GenericTransactionPolicy {\n\t/**\n\t * Given a change, attempts to derive an equivalent change which can be applied to the current state even if the given change was issued\n\t * over a different state. This can be used to apply a sequence of changes that were issued concurrently, i.e., without knowledge of\n\t * each other.\n\t * @param state - The current state on which the returned change will be applied.\n\t * @param change - The original change issued.\n\t * @param path - The reconciliation path for the change.\n\t * @returns The change to be applied to the current state, or a failure if the change cannot be resolved.\n\t */\n\ttryResolveChange(\n\t\tstate: SucceedingTransactionState,\n\t\tchange: ChangeInternal,\n\t\tpath: ReconciliationPath\n\t): Result<ChangeInternal, TransactionFailure>;\n\n\t/**\n\t * Provides a new state given the current state and a change to apply.\n\t * @param state - The current state on which the change is applied.\n\t * @param change - The change to apply to the current state.\n\t * @returns The new state reflecting the applied change, or a failure.\n\t */\n\tdispatchChange(state: SucceedingTransactionState, change: ChangeInternal): ChangeResult;\n\n\t/**\n\t * Additional transaction validation when the transaction is closed.\n\t * @param state - The current state of the transaction.\n\t * @returns The new state reflecting the closed transaction, or a failure if the transaction cannot be closed.\n\t */\n\tvalidateOnClose(state: SucceedingTransactionState): ChangeResult;\n}\n\n/**\n * A mutable transaction for applying sequences of changes to a TreeView.\n * Allows viewing the intermediate states.\n *\n * Contains necessary state to apply changes within an edit to a TreeView.\n *\n * May have any number of changes applied to make up the edit.\n * Use `close` to complete the transaction, returning the array of changes and an EditingResult showing the\n * results of applying the changes as an Edit to the initial TreeView (passed to the constructor).\n *\n * No data outside the Transaction is modified by Transaction:\n * the results from `close` must be used to actually submit an `Edit`.\n * @public\n */\nexport namespace TransactionInternal {\n\t/**\n\t * Makes a new {@link GenericTransaction} that follows the {@link TransactionInternal.Policy} policy.\n\t */\n\texport function factory(view: RevisionView): GenericTransaction {\n\t\treturn new GenericTransaction(view, new Policy());\n\t}\n\n\ttype ValidState = SucceedingTransactionState;\n\n\t/**\n\t * The policy followed by a {@link TransactionInternal}.\n\t */\n\texport class Policy implements GenericTransactionPolicy {\n\t\t/**\n\t\t * Maps detached sequences of nodes to their NodeIds\n\t\t */\n\t\tprotected readonly detached: Map<DetachedSequenceId, readonly NodeId[]> = new Map();\n\n\t\t/**\n\t\t * Resolves change with Result.Ok\n\t\t *\n\t\t * @param state - Unused\n\t\t * @param change - Change to resolve\n\t\t * @returns Result.Ok which contains change\n\t\t */\n\t\tpublic tryResolveChange(state: ValidState, change: ChangeInternal): Result.Ok<ChangeInternal> {\n\t\t\treturn Result.ok(change);\n\t\t}\n\n\t\t/**\n\t\t * Validates the transaction when it is closed\n\t\t *\n\t\t * @param state - Current state\n\t\t * @returns a {@link ChangeResult} containing either the change result or a Failure\n\t\t */\n\t\tpublic validateOnClose(state: ValidState): ChangeResult {\n\t\t\t// Making the policy choice that storing a detached sequences in an edit but not using it is an error.\n\t\t\treturn this.detached.size !== 0\n\t\t\t\t? Result.error({\n\t\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\t\tfailure: {\n\t\t\t\t\t\t\tkind: FailureKind.UnusedDetachedSequence,\n\t\t\t\t\t\t\tsequenceId: this.detached.keys().next().value,\n\t\t\t\t\t\t},\n\t\t\t\t  })\n\t\t\t\t: Result.ok(state.view);\n\t\t}\n\n\t\t/**\n\t\t * Applies a given change\n\t\t *\n\t\t * @param state - Current state\n\t\t * @param change - Change to apply\n\t\t * @returns a {@link ChangeResult} containing either the change result or a Failure\n\t\t */\n\t\tpublic dispatchChange(state: ValidState, change: ChangeInternal): ChangeResult {\n\t\t\tswitch (change.type) {\n\t\t\t\tcase ChangeTypeInternal.Build:\n\t\t\t\t\treturn this.applyBuild(state, change);\n\t\t\t\tcase ChangeTypeInternal.Insert:\n\t\t\t\t\treturn this.applyInsert(state, change);\n\t\t\t\tcase ChangeTypeInternal.Detach:\n\t\t\t\t\treturn this.applyDetach(state, change);\n\t\t\t\tcase ChangeTypeInternal.Constraint:\n\t\t\t\t\treturn this.applyConstraint(state, change);\n\t\t\t\tcase ChangeTypeInternal.SetValue:\n\t\t\t\t\treturn this.applySetValue(state, change);\n\t\t\t\tdefault:\n\t\t\t\t\treturn fail('Attempted to apply unsupported change');\n\t\t\t}\n\t\t}\n\n\t\tprivate applyBuild(state: ValidState, change: BuildInternal): ChangeResult {\n\t\t\tif (this.detached.has(change.destination)) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\tfailure: {\n\t\t\t\t\t\tkind: FailureKind.DetachedSequenceIdAlreadyInUse,\n\t\t\t\t\t\tchange,\n\t\t\t\t\t\tsequenceId: change.destination,\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tlet idAlreadyPresent: NodeId | undefined;\n\t\t\tlet duplicateIdInBuild: NodeId | undefined;\n\t\t\tlet invalidId: NodeId | undefined;\n\t\t\tlet detachedSequenceNotFound: DetachedSequenceId | undefined;\n\t\t\tconst map = new Map<NodeId, TreeViewNode>();\n\t\t\tconst newIds = this.createViewNodesForTree(\n\t\t\t\tchange.source,\n\t\t\t\t(id, viewNode) => {\n\t\t\t\t\tif (map.has(id)) {\n\t\t\t\t\t\tduplicateIdInBuild = id;\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\tif (state.view.hasNode(viewNode.identifier)) {\n\t\t\t\t\t\tidAlreadyPresent = id;\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t\tmap.set(id, viewNode);\n\t\t\t\t\treturn false;\n\t\t\t\t},\n\t\t\t\t(detachedId) => {\n\t\t\t\t\tdetachedSequenceNotFound = detachedId;\n\t\t\t\t}\n\t\t\t);\n\n\t\t\tif (idAlreadyPresent !== undefined) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Invalid,\n\t\t\t\t\tfailure: { kind: FailureKind.IdAlreadyInUse, change, id: idAlreadyPresent },\n\t\t\t\t});\n\t\t\t}\n\t\t\tif (duplicateIdInBuild !== undefined) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\tfailure: { kind: FailureKind.DuplicateIdInBuild, change, id: duplicateIdInBuild },\n\t\t\t\t});\n\t\t\t}\n\t\t\tif (invalidId !== undefined) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Invalid,\n\t\t\t\t\tfailure: { kind: FailureKind.UnknownId, change, id: invalidId },\n\t\t\t\t});\n\t\t\t}\n\t\t\tif (detachedSequenceNotFound !== undefined) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\tfailure: {\n\t\t\t\t\t\tkind: FailureKind.DetachedSequenceNotFound,\n\t\t\t\t\t\tchange,\n\t\t\t\t\t\tsequenceId: detachedSequenceNotFound,\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tconst view = state.view.addNodes(map.values());\n\t\t\tthis.detached.set(\n\t\t\t\tchange.destination,\n\t\t\t\tnewIds ?? fail('Unhandled failure case in Transaction.createViewNodesForTree')\n\t\t\t);\n\t\t\treturn Result.ok(view);\n\t\t}\n\n\t\tprivate applyInsert(state: ValidState, change: InsertInternal): ChangeResult {\n\t\t\tconst source = this.detached.get(change.source);\n\t\t\tif (source === undefined) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\tfailure: {\n\t\t\t\t\t\tkind: FailureKind.DetachedSequenceNotFound,\n\t\t\t\t\t\tchange,\n\t\t\t\t\t\tsequenceId: change.source,\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tconst validatedDestination = validateStablePlace(state.view, change.destination);\n\t\t\tif (validatedDestination.result !== PlaceValidationResult.Valid) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus:\n\t\t\t\t\t\tvalidatedDestination.result === PlaceValidationResult.Malformed\n\t\t\t\t\t\t\t? EditStatus.Malformed\n\t\t\t\t\t\t\t: EditStatus.Invalid,\n\t\t\t\t\tfailure: {\n\t\t\t\t\t\tkind: FailureKind.BadPlace,\n\t\t\t\t\t\tchange,\n\t\t\t\t\t\tplace: change.destination,\n\t\t\t\t\t\tplaceFailure: validatedDestination.result,\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tthis.detached.delete(change.source);\n\t\t\tconst view = insertIntoTrait(state.view, source, validatedDestination);\n\t\t\treturn Result.ok(view);\n\t\t}\n\n\t\tprivate applyDetach(state: ValidState, change: DetachInternal): ChangeResult {\n\t\t\tconst validatedSource = validateStableRange(state.view, change.source);\n\t\t\tif (validatedSource.result !== RangeValidationResultKind.Valid) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus:\n\t\t\t\t\t\tvalidatedSource.result === RangeValidationResultKind.PlacesInDifferentTraits ||\n\t\t\t\t\t\tvalidatedSource.result === RangeValidationResultKind.Inverted ||\n\t\t\t\t\t\tvalidatedSource.result.placeFailure !== PlaceValidationResult.Malformed\n\t\t\t\t\t\t\t? EditStatus.Invalid\n\t\t\t\t\t\t\t: EditStatus.Malformed,\n\t\t\t\t\tfailure: {\n\t\t\t\t\t\tkind: FailureKind.BadRange,\n\t\t\t\t\t\tchange,\n\t\t\t\t\t\trange: change.source,\n\t\t\t\t\t\trangeFailure: validatedSource.result,\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tconst result = detachRange(state.view, validatedSource);\n\t\t\tlet modifiedView = result.view;\n\t\t\tconst { detached } = result;\n\n\t\t\t// Store or dispose detached\n\t\t\tif (change.destination !== undefined) {\n\t\t\t\tif (this.detached.has(change.destination)) {\n\t\t\t\t\treturn Result.error({\n\t\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\t\tfailure: {\n\t\t\t\t\t\t\tkind: FailureKind.DetachedSequenceIdAlreadyInUse,\n\t\t\t\t\t\t\tchange,\n\t\t\t\t\t\t\tsequenceId: change.destination,\n\t\t\t\t\t\t},\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\tthis.detached.set(change.destination, detached);\n\t\t\t} else {\n\t\t\t\tmodifiedView = modifiedView.deleteNodes(detached);\n\t\t\t}\n\t\t\treturn Result.ok(modifiedView);\n\t\t}\n\n\t\tprivate applyConstraint(state: ValidState, change: ConstraintInternal): ChangeResult {\n\t\t\t// TODO: Implement identityHash and contentHash\n\t\t\tassert(change.identityHash === undefined, 'identityHash constraint is not implemented');\n\t\t\tassert(change.contentHash === undefined, 'contentHash constraint is not implemented');\n\n\t\t\tconst validatedChange = validateStableRange(state.view, change.toConstrain);\n\t\t\tif (validatedChange.result !== RangeValidationResultKind.Valid) {\n\t\t\t\treturn validatedChange.result !== RangeValidationResultKind.PlacesInDifferentTraits &&\n\t\t\t\t\tvalidatedChange.result !== RangeValidationResultKind.Inverted &&\n\t\t\t\t\tvalidatedChange.result.placeFailure !== PlaceValidationResult.Malformed\n\t\t\t\t\t? change.effect === ConstraintEffect.ValidRetry\n\t\t\t\t\t\t? Result.ok(state.view)\n\t\t\t\t\t\t: Result.error({\n\t\t\t\t\t\t\t\tstatus: EditStatus.Invalid,\n\t\t\t\t\t\t\t\tfailure: {\n\t\t\t\t\t\t\t\t\tkind: FailureKind.ConstraintViolation,\n\t\t\t\t\t\t\t\t\tconstraint: change,\n\t\t\t\t\t\t\t\t\tviolation: {\n\t\t\t\t\t\t\t\t\t\tkind: ConstraintViolationKind.BadRange,\n\t\t\t\t\t\t\t\t\t\trangeFailure: validatedChange.result,\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t  })\n\t\t\t\t\t: Result.error({\n\t\t\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\t\t\tfailure: {\n\t\t\t\t\t\t\t\tkind: FailureKind.ConstraintViolation,\n\t\t\t\t\t\t\t\tconstraint: change,\n\t\t\t\t\t\t\t\tviolation: {\n\t\t\t\t\t\t\t\t\tkind: ConstraintViolationKind.BadRange,\n\t\t\t\t\t\t\t\t\trangeFailure: validatedChange.result,\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t},\n\t\t\t\t\t  });\n\t\t\t}\n\n\t\t\tconst { start, end } = rangeFromStableRange(state.view, validatedChange);\n\t\t\tconst startIndex = state.view.findIndexWithinTrait(start);\n\t\t\tconst endIndex = state.view.findIndexWithinTrait(end);\n\n\t\t\tif (change.length !== undefined && change.length !== endIndex - startIndex) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Invalid,\n\t\t\t\t\tfailure: {\n\t\t\t\t\t\tkind: FailureKind.ConstraintViolation,\n\t\t\t\t\t\tconstraint: change,\n\t\t\t\t\t\tviolation: {\n\t\t\t\t\t\t\tkind: ConstraintViolationKind.BadLength,\n\t\t\t\t\t\t\tactual: endIndex - startIndex,\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tif (change.parentNode !== undefined && change.parentNode !== end.trait.parent) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Invalid,\n\t\t\t\t\tfailure: {\n\t\t\t\t\t\tkind: FailureKind.ConstraintViolation,\n\t\t\t\t\t\tconstraint: change,\n\t\t\t\t\t\tviolation: {\n\t\t\t\t\t\t\tkind: ConstraintViolationKind.BadParent,\n\t\t\t\t\t\t\tactual: change.parentNode,\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tif (change.label !== undefined && change.label !== end.trait.label) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Invalid,\n\t\t\t\t\tfailure: {\n\t\t\t\t\t\tkind: FailureKind.ConstraintViolation,\n\t\t\t\t\t\tconstraint: change,\n\t\t\t\t\t\tviolation: {\n\t\t\t\t\t\t\tkind: ConstraintViolationKind.BadLabel,\n\t\t\t\t\t\t\tactual: end.trait.label,\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\n\t\t\treturn Result.ok(state.view);\n\t\t}\n\n\t\tprivate applySetValue(state: ValidState, change: SetValueInternal): ChangeResult {\n\t\t\tif (!state.view.hasNode(change.nodeToModify)) {\n\t\t\t\treturn Result.error({\n\t\t\t\t\tstatus: EditStatus.Invalid,\n\t\t\t\t\tfailure: { kind: FailureKind.UnknownId, change, id: change.nodeToModify },\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tconst newView = state.view.setNodeValue(change.nodeToModify, change.payload);\n\t\t\treturn Result.ok(newView);\n\t\t}\n\n\t\t/**\n\t\t * Generates tree view nodes from the supplied edit nodes.\n\t\t * Invokes onCreateNode for each new node, and halts creation early if it returns true.\n\t\t * Invokes onInvalidDetachedId and halts early for any invalid detached IDs referenced in the edit node sequence.\n\t\t * @returns all the top-level node IDs in `sequence` (both from nodes and from detached sequences).\n\t\t */\n\t\tprotected createViewNodesForTree(\n\t\t\tsequence: Iterable<BuildNodeInternal>,\n\t\t\tonCreateNode: (stableId: NodeId, node: TreeViewNode) => boolean,\n\t\t\tonInvalidDetachedId: (sequenceId: DetachedSequenceId) => void\n\t\t): NodeId[] | undefined {\n\t\t\tconst topLevelIds: NodeId[] = [];\n\t\t\tconst unprocessed: BuildNodeInternal[] = [];\n\t\t\tfor (const buildNode of sequence) {\n\t\t\t\tif (isDetachedSequenceId(buildNode)) {\n\t\t\t\t\tconst detachedIds = this.getDetachedNodeIds(buildNode, onInvalidDetachedId);\n\t\t\t\t\tif (detachedIds === undefined) {\n\t\t\t\t\t\treturn undefined;\n\t\t\t\t\t}\n\t\t\t\t\ttopLevelIds.push(...detachedIds);\n\t\t\t\t} else {\n\t\t\t\t\tunprocessed.push(buildNode);\n\t\t\t\t\ttopLevelIds.push(buildNode.identifier);\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile (unprocessed.length > 0) {\n\t\t\t\tconst node = unprocessed.pop();\n\t\t\t\tassert(node !== undefined && !isDetachedSequenceId(node));\n\t\t\t\tconst traits = new Map<TraitLabel, readonly NodeId[]>();\n\t\t\t\t// eslint-disable-next-line no-restricted-syntax\n\t\t\t\tfor (const key in node.traits) {\n\t\t\t\t\tif (Object.prototype.hasOwnProperty.call(node.traits, key)) {\n\t\t\t\t\t\tconst children = node.traits[key];\n\t\t\t\t\t\tif (children.length > 0) {\n\t\t\t\t\t\t\tconst childIds: NodeId[] = [];\n\t\t\t\t\t\t\tfor (const child of children) {\n\t\t\t\t\t\t\t\tif (isDetachedSequenceId(child)) {\n\t\t\t\t\t\t\t\t\tconst detachedIds = this.getDetachedNodeIds(child, onInvalidDetachedId);\n\t\t\t\t\t\t\t\t\tif (detachedIds === undefined) {\n\t\t\t\t\t\t\t\t\t\treturn undefined;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tchildIds.push(...detachedIds);\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tchildIds.push(child.identifier);\n\t\t\t\t\t\t\t\t\tunprocessed.push(child);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttraits.set(key as TraitLabel, childIds);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tconst newNode: TreeViewNode = {\n\t\t\t\t\tidentifier: node.identifier,\n\t\t\t\t\tdefinition: node.definition,\n\t\t\t\t\ttraits,\n\t\t\t\t};\n\t\t\t\tcopyPropertyIfDefined(node, newNode, 'payload');\n\t\t\t\tif (onCreateNode(node.identifier, newNode)) {\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn topLevelIds;\n\t\t}\n\n\t\tprivate getDetachedNodeIds(\n\t\t\tdetachedId: DetachedSequenceId,\n\t\t\tonInvalidDetachedId: (sequenceId: DetachedSequenceId) => void\n\t\t): readonly NodeId[] | undefined {\n\t\t\t// Retrieve the detached sequence from the void.\n\t\t\tconst detachedNodeIds = this.detached.get(detachedId);\n\t\t\tif (detachedNodeIds === undefined) {\n\t\t\t\tonInvalidDetachedId(detachedId);\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\t// Since we have retrieved the sequence, remove it from the void to prevent a second tree from multi-parenting it later\n\t\t\tthis.detached.delete(detachedId);\n\t\t\treturn detachedNodeIds;\n\t\t}\n\t}\n\n\t/**\n\t * The kinds of failures that a transaction might encounter.\n\t */\n\texport enum FailureKind {\n\t\t/**\n\t\t * Transaction has an unused DetachedSequenceId\n\t\t */\n\t\tUnusedDetachedSequence = 'UnusedDetachedSequence',\n\t\t/**\n\t\t * Transaction has a build operation using an already in use DetachedSequenceID.\n\t\t */\n\t\tDetachedSequenceIdAlreadyInUse = 'DetachedSequenceIdAlreadyInUse',\n\t\t/**\n\t\t * Transaction tries to operate on an unknown DetachedSequenceID\n\t\t */\n\t\tDetachedSequenceNotFound = 'DetachedSequenceNotFound',\n\t\t/**\n\t\t * Transaction has a build which uses a duplicated NodeId\n\t\t */\n\t\tDuplicateIdInBuild = 'DuplicateIdInBuild',\n\t\t/**\n\t\t * Transaction tries to build a node using an ID which is already used in the current state\n\t\t */\n\t\tIdAlreadyInUse = 'IdAlreadyInUse',\n\t\t/**\n\t\t * Transaction tries to set value of an unknown node\n\t\t */\n\t\tUnknownId = 'UnknownId',\n\t\t/**\n\t\t * Transaction tries to insert in an invalid Place\n\t\t */\n\t\tBadPlace = 'BadPlace',\n\t\t/**\n\t\t * Transaction tries to detach an invalid Range\n\t\t */\n\t\tBadRange = 'BadRange',\n\t\t/**\n\t\t * Transaction has an invalid constraint\n\t\t */\n\t\tConstraintViolation = 'ConstraintViolation',\n\t}\n\n\t/**\n\t * A failure encountered by a transaction.\n\t */\n\texport type Failure =\n\t\t| UnusedDetachedSequenceFailure\n\t\t| DetachedSequenceIdAlreadyInUseFailure\n\t\t| DetachedSequenceNotFoundFailure\n\t\t| DuplicateIdInBuildFailure\n\t\t| IdAlreadyInUseFailure\n\t\t| UnknownIdFailure\n\t\t| BadPlaceFailure\n\t\t| BadRangeFailure\n\t\t| ConstraintViolationFailure;\n\n\t/**\n\t * Error returned when a transaction is closed while there is an unused detached sequence.\n\t */\n\texport interface UnusedDetachedSequenceFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.UnusedDetachedSequence)\n\t\t */\n\t\treadonly kind: FailureKind.UnusedDetachedSequence;\n\t\t/**\n\t\t * The unused DetachedSequenceId\n\t\t */\n\t\treadonly sequenceId: DetachedSequenceId;\n\t}\n\n\t/**\n\t * Error thrown when a transaction encounters a build operation using an already in use DetachedSequenceID.\n\t */\n\texport interface DetachedSequenceIdAlreadyInUseFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.DetachedSequenceIdAlreadyInUse)\n\t\t */\n\t\treadonly kind: FailureKind.DetachedSequenceIdAlreadyInUse;\n\t\t/**\n\t\t * Faulting Change\n\t\t */\n\t\treadonly change: ChangeInternal;\n\t\t/**\n\t\t * The DetachedSequenceId that is already in use\n\t\t */\n\t\treadonly sequenceId: DetachedSequenceId;\n\t}\n\n\t/**\n\t * Error thrown when a transaction tries to operate on an unknown DetachedSequenceID\n\t */\n\texport interface DetachedSequenceNotFoundFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.DetachedSequenceNotFound)\n\t\t */\n\t\treadonly kind: FailureKind.DetachedSequenceNotFound;\n\t\t/**\n\t\t * Faulting Change\n\t\t */\n\t\treadonly change: ChangeInternal;\n\t\t/**\n\t\t * The DetachedSequenceId that wasn't found\n\t\t */\n\t\treadonly sequenceId: DetachedSequenceId;\n\t}\n\n\t/**\n\t * Error thrown when a build uses a duplicated NodeId\n\t */\n\texport interface DuplicateIdInBuildFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.DuplicateIdInBuild)\n\t\t */\n\t\treadonly kind: FailureKind.DuplicateIdInBuild;\n\t\t/**\n\t\t * Faulting Change\n\t\t */\n\t\treadonly change: ChangeInternal;\n\t\t/**\n\t\t * ID of duplicated node\n\t\t */\n\t\treadonly id: NodeId;\n\t}\n\n\t/**\n\t * Error thrown when a build node ID is already used in the current state\n\t */\n\texport interface IdAlreadyInUseFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.IdAlreadyInUse)\n\t\t */\n\t\treadonly kind: FailureKind.IdAlreadyInUse;\n\t\t/**\n\t\t * Faulting Change\n\t\t */\n\t\treadonly change: ChangeInternal;\n\t\t/**\n\t\t * ID of already in use node\n\t\t */\n\t\treadonly id: NodeId;\n\t}\n\n\t/**\n\t * Error thrown when a change is attempted on an unknown NodeId\n\t */\n\texport interface UnknownIdFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.UnknownId)\n\t\t */\n\t\treadonly kind: FailureKind.UnknownId;\n\t\t/**\n\t\t * Faulting Change\n\t\t */\n\t\treadonly change: ChangeInternal;\n\t\t/**\n\t\t * The unknown ID\n\t\t */\n\t\treadonly id: NodeId;\n\t}\n\n\t/**\n\t * Error thrown when an insert change uses an invalid Place\n\t */\n\texport interface BadPlaceFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.BadPlace)\n\t\t */\n\t\treadonly kind: FailureKind.BadPlace;\n\t\t/**\n\t\t * Faulting Change\n\t\t */\n\t\treadonly change: ChangeInternal;\n\t\t/**\n\t\t * The faulting place\n\t\t */\n\t\treadonly place: StablePlaceInternal;\n\t\t/**\n\t\t * The reason for the failure\n\t\t */\n\t\treadonly placeFailure: BadPlaceValidationResult;\n\t}\n\n\t/**\n\t * Error thrown when a detach operation is given an invalid or malformed Range\n\t */\n\texport interface BadRangeFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.BadRange)\n\t\t */\n\t\treadonly kind: FailureKind.BadRange;\n\t\t/**\n\t\t * Faulting Change\n\t\t */\n\t\treadonly change: ChangeInternal;\n\t\t/**\n\t\t * Faulting range\n\t\t */\n\t\treadonly range: StableRangeInternal;\n\t\t/**\n\t\t * The reason for the failure\n\t\t */\n\t\treadonly rangeFailure: BadRangeValidationResult;\n\t}\n\n\t/**\n\t * Error thrown when a constraint fails to apply\n\t */\n\texport interface ConstraintViolationFailure {\n\t\t/**\n\t\t * Failure kind (will always be FailureKind.ConstraintViolation)\n\t\t */\n\t\treadonly kind: FailureKind.ConstraintViolation;\n\t\t/**\n\t\t * Faulting Change\n\t\t */\n\t\treadonly constraint: ConstraintInternal;\n\t\t/**\n\t\t * The first violation the constraint encounters (there may be others).\n\t\t */\n\t\treadonly violation: ConstraintViolationResult;\n\t}\n\n\t/**\n\t * The details of what kind of constraint was violated and caused a ConstraintViolationFailure error to occur\n\t */\n\texport type ConstraintViolationResult =\n\t\t| {\n\t\t\t\treadonly kind: ConstraintViolationKind.BadRange;\n\t\t\t\treadonly rangeFailure: BadRangeValidationResult;\n\t\t  }\n\t\t| {\n\t\t\t\treadonly kind: ConstraintViolationKind.BadLength;\n\t\t\t\treadonly actual: number;\n\t\t  }\n\t\t| {\n\t\t\t\treadonly kind: ConstraintViolationKind.BadParent;\n\t\t\t\treadonly actual: NodeId;\n\t\t  }\n\t\t| {\n\t\t\t\treadonly kind: ConstraintViolationKind.BadLabel;\n\t\t\t\treadonly actual: TraitLabel;\n\t\t  };\n\n\t/**\n\t * Enum of possible kinds of constraint violations that can be encountered\n\t */\n\texport enum ConstraintViolationKind {\n\t\t/**\n\t\t * The constraint failed because it applies to an invalid range\n\t\t */\n\t\tBadRange = 'BadRange',\n\t\t/**\n\t\t * The constraint failed because the length prescribed by the constraint does not match the length of range being constrained\n\t\t */\n\t\tBadLength = 'BadLength',\n\t\t/**\n\t\t * The constraint failed because the parent prescribed by the constraint does not match the actual parent of the range being constrained\n\t\t */\n\t\tBadParent = 'BadParent',\n\t\t/**\n\t\t * The constraint failed because the trait label prescribed by the constraint does not match the actual trait label of the range being constrained\n\t\t */\n\t\tBadLabel = 'BadLabel',\n\t}\n}\n"]}

package/dist/TreeCompressor.d.ts

@@ -0,0 +1,36 @@
+import type { DetachedSequenceId, OpSpaceNodeId } from './Identifiers';
+import type { StringInterner } from './StringInterner';
+import type { CompressedPlaceholderTree, PlaceholderTree } from './persisted-types';
+import type { ContextualizedNodeIdNormalizer } from './NodeIdUtilities';
+/**
+ * Compresses a given {@link PlaceholderTree} into a more compact serializable format.
+ */
+export interface TreeCompressor<TPlaceholder extends DetachedSequenceId | never> {
+    /**
+     * @param node - The {@link PlaceholderTree} to compress.
+     * @param interner - The StringInterner to use to intern strings.
+     * @param idNormalizer - A normalizer to transform node IDs into op-space
+     */
+    compress<TId extends OpSpaceNodeId>(node: PlaceholderTree<TPlaceholder>, interner: StringInterner, idNormalizer: ContextualizedNodeIdNormalizer<TId>): CompressedPlaceholderTree<TId, TPlaceholder>;
+    /**
+     * @param node - The {@link PlaceholderTree} to compress.
+     * @param interner - The StringInterner to use to intern strings.
+     * @param idNormalizer - A normalizer to transform node IDs into op-space
+     */
+    decompress<TId extends OpSpaceNodeId>(node: CompressedPlaceholderTree<TId, TPlaceholder>, interner: StringInterner, idNormalizer: ContextualizedNodeIdNormalizer<TId>): PlaceholderTree<TPlaceholder>;
+}
+/**
+ * Compresses a given {@link PlaceholderTree}
+ * (Such as a {@link ChangeNode} or {@link BuildNode}) into an array,
+ * while also string interning all node {@link Definition}s and {@link TraitLabel}s.
+ * See {@link CompressedPlaceholderTree} for format.
+ */
+export declare class InterningTreeCompressor<TPlaceholder extends DetachedSequenceId | never> implements TreeCompressor<TPlaceholder> {
+    compress<TId extends OpSpaceNodeId>(node: PlaceholderTree<TPlaceholder>, interner: StringInterner, idNormalizer: ContextualizedNodeIdNormalizer<TId>): CompressedPlaceholderTree<TId, TPlaceholder>;
+    private compressI;
+    /** The ID that was compressed or decompressed most recently */
+    private previousId?;
+    decompress<TId extends OpSpaceNodeId>(node: CompressedPlaceholderTree<TId, TPlaceholder>, interner: StringInterner, idNormalizer: ContextualizedNodeIdNormalizer<TId>): PlaceholderTree<TPlaceholder>;
+    private decompressI;
+}
+//# sourceMappingURL=TreeCompressor.d.ts.map

package/dist/TreeCompressor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TreeCompressor.d.ts","sourceRoot":"","sources":["../src/TreeCompressor.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAc,kBAAkB,EAAoB,aAAa,EAAc,MAAM,eAAe,CAAC;AACjH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,KAAK,EAAoB,yBAAyB,EAAE,eAAe,EAAW,MAAM,mBAAmB,CAAC;AAC/G,OAAO,KAAK,EAAE,8BAA8B,EAAE,MAAM,mBAAmB,CAAC;AAGxE;;GAEG;AACH,MAAM,WAAW,cAAc,CAAC,YAAY,SAAS,kBAAkB,GAAG,KAAK;IAC9E;;;;OAIG;IACH,QAAQ,CAAC,GAAG,SAAS,aAAa,EACjC,IAAI,EAAE,eAAe,CAAC,YAAY,CAAC,EACnC,QAAQ,EAAE,cAAc,EACxB,YAAY,EAAE,8BAA8B,CAAC,GAAG,CAAC,GAC/C,yBAAyB,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;IAEhD;;;;OAIG;IACH,UAAU,CAAC,GAAG,SAAS,aAAa,EACnC,IAAI,EAAE,yBAAyB,CAAC,GAAG,EAAE,YAAY,CAAC,EAClD,QAAQ,EAAE,cAAc,EACxB,YAAY,EAAE,8BAA8B,CAAC,GAAG,CAAC,GAC/C,eAAe,CAAC,YAAY,CAAC,CAAC;CACjC;AAED;;;;;GAKG;AACH,qBAAa,uBAAuB,CAAC,YAAY,SAAS,kBAAkB,GAAG,KAAK,CACnF,YAAW,cAAc,CAAC,YAAY,CAAC;IAEhC,QAAQ,CAAC,GAAG,SAAS,aAAa,EACxC,IAAI,EAAE,eAAe,CAAC,YAAY,CAAC,EACnC,QAAQ,EAAE,cAAc,EACxB,YAAY,EAAE,8BAA8B,CAAC,GAAG,CAAC,GAC/C,yBAAyB,CAAC,GAAG,EAAE,YAAY,CAAC;IAK/C,OAAO,CAAC,SAAS;IAyCjB,+DAA+D;IAC/D,OAAO,CAAC,UAAU,CAAC,CAAgB;IAE5B,UAAU,CAAC,GAAG,SAAS,aAAa,EAC1C,IAAI,EAAE,yBAAyB,CAAC,GAAG,EAAE,YAAY,CAAC,EAClD,QAAQ,EAAE,cAAc,EACxB,YAAY,EAAE,8BAA8B,CAAC,GAAG,CAAC,GAC/C,eAAe,CAAC,YAAY,CAAC;IAUhC,OAAO,CAAC,WAAW;CAqFnB"}

package/dist/TreeCompressor.js

@@ -0,0 +1,137 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InterningTreeCompressor = void 0;
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+const Identifiers_1 = require("./Identifiers");
+const Common_1 = require("./Common");
+/**
+ * Compresses a given {@link PlaceholderTree}
+ * (Such as a {@link ChangeNode} or {@link BuildNode}) into an array,
+ * while also string interning all node {@link Definition}s and {@link TraitLabel}s.
+ * See {@link CompressedPlaceholderTree} for format.
+ */
+class InterningTreeCompressor {
+    compress(node, interner, idNormalizer) {
+        this.previousId = undefined;
+        return this.compressI(node, interner, idNormalizer);
+    }
+    compressI(node, interner, idNormalizer) {
+        var _a, _b;
+        if (Identifiers_1.isDetachedSequenceId(node)) {
+            return node;
+        }
+        const internedDefinition = (_a = interner.getInternedId(node.definition)) !== null && _a !== void 0 ? _a : node.definition;
+        const normalizedId = idNormalizer.normalizeToOpSpace(node.identifier);
+        const compressedId = canElideId(this.previousId, normalizedId) ? undefined : normalizedId;
+        this.previousId = normalizedId;
+        const compressedTraits = [];
+        // Omit traits if empty and payload is undefined.
+        const traits = Object.entries(node.traits).sort();
+        if (traits.length > 0 || node.payload !== undefined) {
+            for (const [label, trait] of traits) {
+                compressedTraits.push((_b = interner.getInternedId(label)) !== null && _b !== void 0 ? _b : label, trait.map((child) => this.compressI(child, interner, idNormalizer)));
+            }
+        }
+        const payloadTraits = node.payload !== undefined ? [node.payload, ...compressedTraits] : compressedTraits;
+        if (payloadTraits.length > 0) {
+            if (compressedId !== undefined) {
+                return [internedDefinition, compressedId, payloadTraits];
+            }
+            return [internedDefinition, payloadTraits];
+        }
+        if (compressedId !== undefined) {
+            return [internedDefinition, compressedId];
+        }
+        return [internedDefinition];
+    }
+    decompress(node, interner, idNormalizer) {
+        if (Identifiers_1.isDetachedSequenceId(node)) {
+            return node;
+        }
+        const rootId = node[1];
+        Common_1.assert(typeof rootId === 'number', 'Root node was compressed with no ID');
+        this.previousId = rootId;
+        return this.decompressI(node, interner, idNormalizer);
+    }
+    decompressI(node, interner, idNormalizer) {
+        var _a;
+        if (Identifiers_1.isDetachedSequenceId(node)) {
+            return node;
+        }
+        let compressedId;
+        let compressedTraits;
+        let payload;
+        const [maybeInternedDefinition, idOrPayloadTraits, payloadTraits] = node;
+        if (idOrPayloadTraits !== undefined) {
+            if (typeof idOrPayloadTraits === 'number') {
+                compressedId = idOrPayloadTraits;
+                if (payloadTraits !== undefined) {
+                    compressedTraits = payloadTraits;
+                }
+            }
+            else {
+                // TODO: This cast can be removed on typescript 4.6
+                compressedTraits = idOrPayloadTraits;
+            }
+        }
+        const definition = typeof maybeInternedDefinition === 'string'
+            ? maybeInternedDefinition
+            : // TODO: This cast can be removed on typescript 4.6
+                interner.getString(maybeInternedDefinition);
+        let identifier;
+        if (compressedId !== undefined) {
+            identifier = compressedId;
+        }
+        else {
+            const prevId = (_a = this.previousId) !== null && _a !== void 0 ? _a : Common_1.fail();
+            identifier = prevId < 0 ? (prevId - 1) : (prevId + 1);
+        }
+        this.previousId = identifier;
+        const traits = {};
+        if (compressedTraits !== undefined) {
+            let offset;
+            if (compressedTraits.length % 2 === 1) {
+                offset = 1;
+                payload = compressedTraits[0];
+            }
+            else {
+                offset = 0;
+            }
+            const traitsLength = compressedTraits.length - offset;
+            for (let i = 0; i < traitsLength; i += 2) {
+                const offsetIndex = i + offset;
+                const maybeCompressedLabel = compressedTraits[offsetIndex];
+                const compressedChildren = compressedTraits[offsetIndex + 1];
+                const decompressedTraits = compressedChildren.map((child) => this.decompressI(child, interner, idNormalizer));
+                const label = typeof maybeCompressedLabel === 'string'
+                    ? maybeCompressedLabel
+                    : interner.getString(maybeCompressedLabel);
+                traits[label] = decompressedTraits;
+            }
+        }
+        const decompressedNode = {
+            identifier: idNormalizer.normalizeToSessionSpace(identifier),
+            definition,
+            traits,
+        };
+        if (payload !== undefined) {
+            decompressedNode.payload = payload;
+        }
+        return decompressedNode;
+    }
+}
+exports.InterningTreeCompressor = InterningTreeCompressor;
+function canElideId(previousId, id) {
+    if (previousId === undefined) {
+        return false;
+    }
+    const numericId = previousId;
+    if (numericId < 0) {
+        return id === numericId - 1;
+    }
+    return id === numericId + 1;
+}
+//# sourceMappingURL=TreeCompressor.js.map

package/dist/TreeCompressor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TreeCompressor.js","sourceRoot":"","sources":["../src/TreeCompressor.ts"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH,+CAAqD;AAKrD,qCAAiD;AA6BjD;;;;;GAKG;AACH,MAAa,uBAAuB;IAG5B,QAAQ,CACd,IAAmC,EACnC,QAAwB,EACxB,YAAiD;QAEjD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IACrD,CAAC;IAEO,SAAS,CAChB,IAAmC,EACnC,QAAwB,EACxB,YAAiD;;QAEjD,IAAI,kCAAoB,CAAC,IAAI,CAAC,EAAE;YAC/B,OAAO,IAAI,CAAC;SACZ;QAED,MAAM,kBAAkB,SAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,mCAAI,IAAI,CAAC,UAAU,CAAC;QACtF,MAAM,YAAY,GAAG,YAAY,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACtE,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC;QAC1F,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC;QAC/B,MAAM,gBAAgB,GAAwC,EAAE,CAAC;QAEjE,iDAAiD;QACjD,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;QAClD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;YACpD,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE;gBACpC,gBAAgB,CAAC,IAAI,OACpB,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,mCAAK,KAAoB,EACtD,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC,CACnE,CAAC;aACF;SACD;QAED,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC;QAC1G,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE;YAC7B,IAAI,YAAY,KAAK,SAAS,EAAE;gBAC/B,OAAO,CAAC,kBAAkB,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;aACzD;YACD,OAAO,CAAC,kBAAkB,EAAE,aAAa,CAAC,CAAC;SAC3C;QAED,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,OAAO,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;SAC1C;QAED,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAC7B,CAAC;IAKM,UAAU,CAChB,IAAkD,EAClD,QAAwB,EACxB,YAAiD;QAEjD,IAAI,kCAAoB,CAAC,IAAI,CAAC,EAAE;YAC/B,OAAO,IAAI,CAAC;SACZ;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,eAAM,CAAC,OAAO,MAAM,KAAK,QAAQ,EAAE,qCAAqC,CAAC,CAAC;QAC1E,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;QACzB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IACvD,CAAC;IAEO,WAAW,CAClB,IAAkD,EAClD,QAAwB,EACxB,YAAiD;;QAEjD,IAAI,kCAAoB,CAAC,IAAI,CAAC,EAAE;YAC/B,OAAO,IAAI,CAAC;SACZ;QAED,IAAI,YAA6B,CAAC;QAClC,IAAI,gBAGQ,CAAC;QACb,IAAI,OAA4B,CAAC;QACjC,MAAM,CAAC,uBAAuB,EAAE,iBAAiB,EAAE,aAAa,CAAC,GAAG,IAAI,CAAC;QACzE,IAAI,iBAAiB,KAAK,SAAS,EAAE;YACpC,IAAI,OAAO,iBAAiB,KAAK,QAAQ,EAAE;gBAC1C,YAAY,GAAG,iBAAiB,CAAC;gBACjC,IAAI,aAAa,KAAK,SAAS,EAAE;oBAChC,gBAAgB,GAAG,aAAa,CAAC;iBACjC;aACD;iBAAM;gBACN,mDAAmD;gBACnD,gBAAgB,GAAG,iBAA4C,CAAC;aAChE;SACD;QAED,MAAM,UAAU,GACf,OAAO,uBAAuB,KAAK,QAAQ;YAC1C,CAAC,CAAC,uBAAuB;YACzB,CAAC,CAAC,mDAAmD;gBAClD,QAAQ,CAAC,SAAS,CAAC,uBAAiC,CAAgB,CAAC;QAE1E,IAAI,UAAe,CAAC;QACpB,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,UAAU,GAAG,YAAY,CAAC;SAC1B;aAAM;YACN,MAAM,MAAM,SAAG,IAAI,CAAC,UAAU,mCAAI,aAAI,EAAE,CAAC;YACzC,UAAU,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,GAAG,CAAC,CAAS,CAAC,CAAC,CAAE,CAAE,MAAiB,GAAG,CAAC,CAAS,CAAC;SACpF;QACD,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAE7B,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,gBAAgB,KAAK,SAAS,EAAE;YACnC,IAAI,MAAc,CAAC;YACnB,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE;gBACtC,MAAM,GAAG,CAAC,CAAC;gBACX,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;aAC9B;iBAAM;gBACN,MAAM,GAAG,CAAC,CAAC;aACX;YACD,MAAM,YAAY,GAAG,gBAAgB,CAAC,MAAM,GAAG,MAAM,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,IAAI,CAAC,EAAE;gBACzC,MAAM,WAAW,GAAG,CAAC,GAAG,MAAM,CAAC;gBAC/B,MAAM,oBAAoB,GAAG,gBAAgB,CAAC,WAAW,CAAqB,CAAC;gBAC/E,MAAM,kBAAkB,GAAG,gBAAgB,CAAC,WAAW,GAAG,CAAC,CAGxD,CAAC;gBAEJ,MAAM,kBAAkB,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAC3D,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,YAAY,CAAC,CAC/C,CAAC;gBAEF,MAAM,KAAK,GACV,OAAO,oBAAoB,KAAK,QAAQ;oBACvC,CAAC,CAAC,oBAAoB;oBACtB,CAAC,CAAE,QAAQ,CAAC,SAAS,CAAC,oBAAoB,CAAgB,CAAC;gBAC7D,MAAM,CAAC,KAAK,CAAC,GAAG,kBAAkB,CAAC;aACnC;SACD;QAED,MAAM,gBAAgB,GAA2C;YAChE,UAAU,EAAE,YAAY,CAAC,uBAAuB,CAAC,UAAU,CAAC;YAC5D,UAAU;YACV,MAAM;SACN,CAAC;QAEF,IAAI,OAAO,KAAK,SAAS,EAAE;YAC1B,gBAAgB,CAAC,OAAO,GAAG,OAAO,CAAC;SACnC;QAED,OAAO,gBAAgB,CAAC;IACzB,CAAC;CACD;AA3JD,0DA2JC;AAED,SAAS,UAAU,CAA4B,UAA2B,EAAE,EAAO;IAClF,IAAI,UAAU,KAAK,SAAS,EAAE;QAC7B,OAAO,KAAK,CAAC;KACb;IAED,MAAM,SAAS,GAAW,UAAU,CAAC;IACrC,IAAI,SAAS,GAAG,CAAC,EAAE;QAClB,OAAO,EAAE,KAAK,SAAS,GAAG,CAAC,CAAC;KAC5B;IAED,OAAO,EAAE,KAAK,SAAS,GAAG,CAAC,CAAC;AAC7B,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\nimport { isDetachedSequenceId } from './Identifiers';\nimport type { Definition, DetachedSequenceId, InternedStringId, OpSpaceNodeId, TraitLabel } from './Identifiers';\nimport type { StringInterner } from './StringInterner';\nimport type { CompressedTraits, CompressedPlaceholderTree, PlaceholderTree, Payload } from './persisted-types';\nimport type { ContextualizedNodeIdNormalizer } from './NodeIdUtilities';\nimport { assert, fail, Mutable } from './Common';\n\n/**\n * Compresses a given {@link PlaceholderTree} into a more compact serializable format.\n */\nexport interface TreeCompressor<TPlaceholder extends DetachedSequenceId | never> {\n\t/**\n\t * @param node - The {@link PlaceholderTree} to compress.\n\t * @param interner - The StringInterner to use to intern strings.\n\t * @param idNormalizer - A normalizer to transform node IDs into op-space\n\t */\n\tcompress<TId extends OpSpaceNodeId>(\n\t\tnode: PlaceholderTree<TPlaceholder>,\n\t\tinterner: StringInterner,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<TId>\n\t): CompressedPlaceholderTree<TId, TPlaceholder>;\n\n\t/**\n\t * @param node - The {@link PlaceholderTree} to compress.\n\t * @param interner - The StringInterner to use to intern strings.\n\t * @param idNormalizer - A normalizer to transform node IDs into op-space\n\t */\n\tdecompress<TId extends OpSpaceNodeId>(\n\t\tnode: CompressedPlaceholderTree<TId, TPlaceholder>,\n\t\tinterner: StringInterner,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<TId>\n\t): PlaceholderTree<TPlaceholder>;\n}\n\n/**\n * Compresses a given {@link PlaceholderTree}\n * (Such as a {@link ChangeNode} or {@link BuildNode}) into an array,\n * while also string interning all node {@link Definition}s and {@link TraitLabel}s.\n * See {@link CompressedPlaceholderTree} for format.\n */\nexport class InterningTreeCompressor<TPlaceholder extends DetachedSequenceId | never>\n\timplements TreeCompressor<TPlaceholder>\n{\n\tpublic compress<TId extends OpSpaceNodeId>(\n\t\tnode: PlaceholderTree<TPlaceholder>,\n\t\tinterner: StringInterner,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<TId>\n\t): CompressedPlaceholderTree<TId, TPlaceholder> {\n\t\tthis.previousId = undefined;\n\t\treturn this.compressI(node, interner, idNormalizer);\n\t}\n\n\tprivate compressI<TId extends OpSpaceNodeId>(\n\t\tnode: PlaceholderTree<TPlaceholder>,\n\t\tinterner: StringInterner,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<TId>\n\t): CompressedPlaceholderTree<TId, TPlaceholder> {\n\t\tif (isDetachedSequenceId(node)) {\n\t\t\treturn node;\n\t\t}\n\n\t\tconst internedDefinition = interner.getInternedId(node.definition) ?? node.definition;\n\t\tconst normalizedId = idNormalizer.normalizeToOpSpace(node.identifier);\n\t\tconst compressedId = canElideId(this.previousId, normalizedId) ? undefined : normalizedId;\n\t\tthis.previousId = normalizedId;\n\t\tconst compressedTraits: CompressedTraits<TId, TPlaceholder> = [];\n\n\t\t// Omit traits if empty and payload is undefined.\n\t\tconst traits = Object.entries(node.traits).sort();\n\t\tif (traits.length > 0 || node.payload !== undefined) {\n\t\t\tfor (const [label, trait] of traits) {\n\t\t\t\tcompressedTraits.push(\n\t\t\t\t\tinterner.getInternedId(label) ?? (label as TraitLabel),\n\t\t\t\t\ttrait.map((child) => this.compressI(child, interner, idNormalizer))\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\tconst payloadTraits = node.payload !== undefined ? [node.payload, ...compressedTraits] : compressedTraits;\n\t\tif (payloadTraits.length > 0) {\n\t\t\tif (compressedId !== undefined) {\n\t\t\t\treturn [internedDefinition, compressedId, payloadTraits];\n\t\t\t}\n\t\t\treturn [internedDefinition, payloadTraits];\n\t\t}\n\n\t\tif (compressedId !== undefined) {\n\t\t\treturn [internedDefinition, compressedId];\n\t\t}\n\n\t\treturn [internedDefinition];\n\t}\n\n\t/** The ID that was compressed or decompressed most recently */\n\tprivate previousId?: OpSpaceNodeId;\n\n\tpublic decompress<TId extends OpSpaceNodeId>(\n\t\tnode: CompressedPlaceholderTree<TId, TPlaceholder>,\n\t\tinterner: StringInterner,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<TId>\n\t): PlaceholderTree<TPlaceholder> {\n\t\tif (isDetachedSequenceId(node)) {\n\t\t\treturn node;\n\t\t}\n\t\tconst rootId = node[1];\n\t\tassert(typeof rootId === 'number', 'Root node was compressed with no ID');\n\t\tthis.previousId = rootId;\n\t\treturn this.decompressI(node, interner, idNormalizer);\n\t}\n\n\tprivate decompressI<TId extends OpSpaceNodeId>(\n\t\tnode: CompressedPlaceholderTree<TId, TPlaceholder>,\n\t\tinterner: StringInterner,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<TId>\n\t): PlaceholderTree<TPlaceholder> {\n\t\tif (isDetachedSequenceId(node)) {\n\t\t\treturn node;\n\t\t}\n\n\t\tlet compressedId: TId | undefined;\n\t\tlet compressedTraits:\n\t\t\t| [Payload, ...CompressedTraits<TId, TPlaceholder>]\n\t\t\t| CompressedTraits<TId, TPlaceholder>\n\t\t\t| undefined;\n\t\tlet payload: Payload | undefined;\n\t\tconst [maybeInternedDefinition, idOrPayloadTraits, payloadTraits] = node;\n\t\tif (idOrPayloadTraits !== undefined) {\n\t\t\tif (typeof idOrPayloadTraits === 'number') {\n\t\t\t\tcompressedId = idOrPayloadTraits;\n\t\t\t\tif (payloadTraits !== undefined) {\n\t\t\t\t\tcompressedTraits = payloadTraits;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// TODO: This cast can be removed on typescript 4.6\n\t\t\t\tcompressedTraits = idOrPayloadTraits as typeof compressedTraits;\n\t\t\t}\n\t\t}\n\n\t\tconst definition =\n\t\t\ttypeof maybeInternedDefinition === 'string'\n\t\t\t\t? maybeInternedDefinition\n\t\t\t\t: // TODO: This cast can be removed on typescript 4.6\n\t\t\t\t  (interner.getString(maybeInternedDefinition as number) as Definition);\n\n\t\tlet identifier: TId;\n\t\tif (compressedId !== undefined) {\n\t\t\tidentifier = compressedId;\n\t\t} else {\n\t\t\tconst prevId = this.previousId ?? fail();\n\t\t\tidentifier = prevId < 0 ? ((prevId - 1) as TId) : (((prevId as number) + 1) as TId);\n\t\t}\n\t\tthis.previousId = identifier;\n\n\t\tconst traits = {};\n\t\tif (compressedTraits !== undefined) {\n\t\t\tlet offset: number;\n\t\t\tif (compressedTraits.length % 2 === 1) {\n\t\t\t\toffset = 1;\n\t\t\t\tpayload = compressedTraits[0];\n\t\t\t} else {\n\t\t\t\toffset = 0;\n\t\t\t}\n\t\t\tconst traitsLength = compressedTraits.length - offset;\n\t\t\tfor (let i = 0; i < traitsLength; i += 2) {\n\t\t\t\tconst offsetIndex = i + offset;\n\t\t\t\tconst maybeCompressedLabel = compressedTraits[offsetIndex] as InternedStringId;\n\t\t\t\tconst compressedChildren = compressedTraits[offsetIndex + 1] as (\n\t\t\t\t\t| TPlaceholder\n\t\t\t\t\t| CompressedPlaceholderTree<TId, TPlaceholder>\n\t\t\t\t)[];\n\n\t\t\t\tconst decompressedTraits = compressedChildren.map((child) =>\n\t\t\t\t\tthis.decompressI(child, interner, idNormalizer)\n\t\t\t\t);\n\n\t\t\t\tconst label =\n\t\t\t\t\ttypeof maybeCompressedLabel === 'string'\n\t\t\t\t\t\t? maybeCompressedLabel\n\t\t\t\t\t\t: (interner.getString(maybeCompressedLabel) as TraitLabel);\n\t\t\t\ttraits[label] = decompressedTraits;\n\t\t\t}\n\t\t}\n\n\t\tconst decompressedNode: Mutable<PlaceholderTree<TPlaceholder>> = {\n\t\t\tidentifier: idNormalizer.normalizeToSessionSpace(identifier),\n\t\t\tdefinition,\n\t\t\ttraits,\n\t\t};\n\n\t\tif (payload !== undefined) {\n\t\t\tdecompressedNode.payload = payload;\n\t\t}\n\n\t\treturn decompressedNode;\n\t}\n}\n\nfunction canElideId<TId extends OpSpaceNodeId>(previousId: TId | undefined, id: TId): boolean {\n\tif (previousId === undefined) {\n\t\treturn false;\n\t}\n\n\tconst numericId: number = previousId;\n\tif (numericId < 0) {\n\t\treturn id === numericId - 1;\n\t}\n\n\treturn id === numericId + 1;\n}\n"]}

package/dist/TreeNodeHandle.d.ts

@@ -3,32 +3,26 @@
  * Licensed under the MIT License.
  */
 import { Definition, NodeId } from './Identifiers';
-import { ChangeNode, Payload, TraitMap, TreeNode } from './generic';
-import { Snapshot } from './Snapshot';
+import { Payload, TraitMap, TreeNode } from './persisted-types';
+import { TreeView, TreeViewNode } from './TreeView';
 /**
- * A handle to a `TreeNode` that exists within a specific `Snapshot`. This type provides a convenient
- * API for traversing trees of nodes in a Snapshot and is not designed to provide maximum runtime
- * performance; if performance is a concern, consider using the Snapshot and SnapshotNode APIs directly.
+ * A handle to a `TreeNode` that exists within a specific `TreeView`. This type provides a convenient
+ * API for traversing trees of nodes in a TreeView and is not designed to provide maximum runtime
+ * performance; if performance is a concern, consider using the TreeView and TreeViewNode APIs directly.
  * @public
  */
-export declare class TreeNodeHandle implements TreeNode<TreeNodeHandle> {
-    private readonly snapshot;
-    private readonly nodeId;
-    /** Construct a handle which references the node with the given id in the given `Snapshot` */
-    constructor(snapshot: Snapshot, nodeId: NodeId);
+export declare class TreeNodeHandle implements TreeNode<TreeNodeHandle, NodeId> {
+    private readonly view;
+    private readonly viewNode;
+    /** Construct a handle which references the node with the given id in the given `TreeView` */
+    constructor(view: TreeView, nodeId: NodeId);
     get payload(): Payload | undefined;
     get definition(): Definition;
     get identifier(): NodeId;
     get traits(): TraitMap<TreeNodeHandle>;
     /**
-     * Get a `ChangeNode` for the snapshot node that this handle references
+     * Get a `TreeViewNode` for the tree view node that this handle references
      */
-    get node(): ChangeNode;
-    /**
-     * Generate a new `ChangeNode` for the snapshot node that this handle references. The returned node will be fully
-     * demanded, i.e. will contain no lazy/virtualized subtrees.
-     */
-    demandTree(): ChangeNode;
-    toString(): string;
+    get node(): TreeViewNode;
 }
 //# sourceMappingURL=TreeNodeHandle.d.ts.map

package/dist/TreeNodeHandle.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNodeHandle.d.ts","sourceRoot":"","sources":["../src/TreeNodeHandle.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAItC;;;;;GAKG;AACH,qBAAa,cAAe,YAAW,QAAQ,CAAC,cAAc,CAAC;IAC9D,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAW;IACpC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAEhC,6FAA6F;gBAC1E,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM;IAKrD,IAAW,OAAO,IAAI,OAAO,GAAG,SAAS,CAExC;IAED,IAAW,UAAU,IAAI,UAAU,CAElC;IAED,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED,IAAW,MAAM,IAAI,QAAQ,CAAC,cAAc,CAAC,CAgB5C;IAED;;OAEG;IACH,IAAW,IAAI,IAAI,UAAU,CAE5B;IAED;;;OAGG;IACI,UAAU,IAAI,UAAU;IAIxB,QAAQ,IAAI,MAAM;CAGzB"}
+{"version":3,"file":"TreeNodeHandle.d.ts","sourceRoot":"","sources":["../src/TreeNodeHandle.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAEnD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAEpD;;;;;GAKG;AACH,qBAAa,cAAe,YAAW,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IACtE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAW;IAChC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAe;IAExC,6FAA6F;gBAC1E,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM;IAKjD,IAAW,OAAO,IAAI,OAAO,GAAG,SAAS,CAExC;IAED,IAAW,UAAU,IAAI,UAAU,CAElC;IAED,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED,IAAW,MAAM,IAAI,QAAQ,CAAC,cAAc,CAAC,CAgB5C;IAED;;OAEG;IACH,IAAW,IAAI,IAAI,YAAY,CAE9B;CACD"}

package/dist/TreeNodeHandle.js

@@ -6,18 +6,18 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.TreeNodeHandle = void 0;
 const Common_1 = require("./Common");
-const SnapshotUtilities_1 = require("./SnapshotUtilities");
 /**
- * A handle to a `TreeNode` that exists within a specific `Snapshot`. This type provides a convenient
- * API for traversing trees of nodes in a Snapshot and is not designed to provide maximum runtime
- * performance; if performance is a concern, consider using the Snapshot and SnapshotNode APIs directly.
+ * A handle to a `TreeNode` that exists within a specific `TreeView`. This type provides a convenient
+ * API for traversing trees of nodes in a TreeView and is not designed to provide maximum runtime
+ * performance; if performance is a concern, consider using the TreeView and TreeViewNode APIs directly.
  * @public
  */
 class TreeNodeHandle {
-    /** Construct a handle which references the node with the given id in the given `Snapshot` */
-    constructor(snapshot, nodeId) {
-        this.snapshot = snapshot;
-        this.nodeId = nodeId;
+    /** Construct a handle which references the node with the given id in the given `TreeView` */
+    constructor(view, nodeId) {
+        var _a;
+        this.view = view;
+        this.viewNode = (_a = view.tryGetViewNode(nodeId)) !== null && _a !== void 0 ? _a : Common_1.fail('Failed to create handle: node is not present in view');
     }
     get payload() {
         return this.node.payload;
@@ -31,11 +31,11 @@ class TreeNodeHandle {
     get traits() {
         // Construct a new trait map that wraps each node in each trait in a handle
         const traitMap = {};
-        const { snapshot } = this;
-        for (const [label, trait] of Object.entries(this.node.traits)) {
+        const { view } = this;
+        for (const [label, trait] of this.node.traits.entries()) {
             Object.defineProperty(traitMap, label, {
                 get() {
-                    const handleTrait = trait.map((node) => new TreeNodeHandle(snapshot, node.identifier));
+                    const handleTrait = trait.map((node) => new TreeNodeHandle(view, node));
                     return Common_1.memoizeGetter(this, label, handleTrait);
                 },
                 configurable: true,
@@ -45,20 +45,10 @@ class TreeNodeHandle {
         return Common_1.memoizeGetter(this, 'traits', traitMap);
     }
     /**
-     * Get a `ChangeNode` for the snapshot node that this handle references
+     * Get a `TreeViewNode` for the tree view node that this handle references
      */
     get node() {
-        return Common_1.memoizeGetter(this, 'node', SnapshotUtilities_1.getChangeNodeFromSnapshot(this.snapshot, this.nodeId, true));
-    }
-    /**
-     * Generate a new `ChangeNode` for the snapshot node that this handle references. The returned node will be fully
-     * demanded, i.e. will contain no lazy/virtualized subtrees.
-     */
-    demandTree() {
-        return SnapshotUtilities_1.getChangeNodeFromSnapshot(this.snapshot, this.nodeId, false);
-    }
-    toString() {
-        return JSON.stringify(this.demandTree());
+        return Common_1.memoizeGetter(this, 'node', this.viewNode);
     }
 }
 exports.TreeNodeHandle = TreeNodeHandle;

package/dist/TreeNodeHandle.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNodeHandle.js","sourceRoot":"","sources":["../src/TreeNodeHandle.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAKH,qCAAyC;AACzC,2DAAgE;AAEhE;;;;;GAKG;AACH,MAAa,cAAc;IAI1B,6FAA6F;IAC7F,YAAmB,QAAkB,EAAE,MAAc;QACpD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;IAC1B,CAAC;IAED,IAAW,UAAU;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC7B,CAAC;IAED,IAAW,UAAU;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC7B,CAAC;IAED,IAAW,MAAM;QAChB,2EAA2E;QAC3E,MAAM,QAAQ,GAA6B,EAAE,CAAC;QAC9C,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;QAC1B,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YAC9D,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE;gBACtC,GAAG;oBACF,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,cAAc,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;oBACvF,OAAO,sBAAa,CAAC,IAAgC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;gBAC5E,CAAC;gBACD,YAAY,EAAE,IAAI;gBAClB,UAAU,EAAE,IAAI;aAChB,CAAC,CAAC;SACH;QAED,OAAO,sBAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,sBAAa,CAAC,IAAI,EAAE,MAAM,EAAE,6CAAyB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;IACjG,CAAC;IAED;;;OAGG;IACI,UAAU;QAChB,OAAO,6CAAyB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACrE,CAAC;IAEM,QAAQ;QACd,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;IAC1C,CAAC;CACD;AA1DD,wCA0DC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Definition, NodeId } from './Identifiers';\nimport { ChangeNode, Payload, TraitMap, TreeNode } from './generic';\nimport { Snapshot } from './Snapshot';\nimport { memoizeGetter } from './Common';\nimport { getChangeNodeFromSnapshot } from './SnapshotUtilities';\n\n/**\n * A handle to a `TreeNode` that exists within a specific `Snapshot`. This type provides a convenient\n * API for traversing trees of nodes in a Snapshot and is not designed to provide maximum runtime\n * performance; if performance is a concern, consider using the Snapshot and SnapshotNode APIs directly.\n * @public\n */\nexport class TreeNodeHandle implements TreeNode<TreeNodeHandle> {\n\tprivate readonly snapshot: Snapshot;\n\tprivate readonly nodeId: NodeId;\n\n\t/** Construct a handle which references the node with the given id in the given `Snapshot` */\n\tpublic constructor(snapshot: Snapshot, nodeId: NodeId) {\n\t\tthis.snapshot = snapshot;\n\t\tthis.nodeId = nodeId;\n\t}\n\n\tpublic get payload(): Payload | undefined {\n\t\treturn this.node.payload;\n\t}\n\n\tpublic get definition(): Definition {\n\t\treturn this.node.definition;\n\t}\n\n\tpublic get identifier(): NodeId {\n\t\treturn this.node.identifier;\n\t}\n\n\tpublic get traits(): TraitMap<TreeNodeHandle> {\n\t\t// Construct a new trait map that wraps each node in each trait in a handle\n\t\tconst traitMap: TraitMap<TreeNodeHandle> = {};\n\t\tconst { snapshot } = this;\n\t\tfor (const [label, trait] of Object.entries(this.node.traits)) {\n\t\t\tObject.defineProperty(traitMap, label, {\n\t\t\t\tget() {\n\t\t\t\t\tconst handleTrait = trait.map((node) => new TreeNodeHandle(snapshot, node.identifier));\n\t\t\t\t\treturn memoizeGetter(this as TraitMap<TreeNodeHandle>, label, handleTrait);\n\t\t\t\t},\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t});\n\t\t}\n\n\t\treturn memoizeGetter(this, 'traits', traitMap);\n\t}\n\n\t/**\n\t * Get a `ChangeNode` for the snapshot node that this handle references\n\t */\n\tpublic get node(): ChangeNode {\n\t\treturn memoizeGetter(this, 'node', getChangeNodeFromSnapshot(this.snapshot, this.nodeId, true));\n\t}\n\n\t/**\n\t * Generate a new `ChangeNode` for the snapshot node that this handle references. The returned node will be fully\n\t * demanded, i.e. will contain no lazy/virtualized subtrees.\n\t */\n\tpublic demandTree(): ChangeNode {\n\t\treturn getChangeNodeFromSnapshot(this.snapshot, this.nodeId, false);\n\t}\n\n\tpublic toString(): string {\n\t\treturn JSON.stringify(this.demandTree());\n\t}\n}\n"]}
+{"version":3,"file":"TreeNodeHandle.js","sourceRoot":"","sources":["../src/TreeNodeHandle.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,qCAA+C;AAI/C;;;;;GAKG;AACH,MAAa,cAAc;IAI1B,6FAA6F;IAC7F,YAAmB,IAAc,EAAE,MAAc;;QAChD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,QAAQ,SAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,mCAAI,aAAI,CAAC,sDAAsD,CAAC,CAAC;IAC7G,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;IAC1B,CAAC;IAED,IAAW,UAAU;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC7B,CAAC;IAED,IAAW,UAAU;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC7B,CAAC;IAED,IAAW,MAAM;QAChB,2EAA2E;QAC3E,MAAM,QAAQ,GAA6B,EAAE,CAAC;QAC9C,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE;YACxD,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE;gBACtC,GAAG;oBACF,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;oBACxE,OAAO,sBAAa,CAAC,IAAgC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;gBAC5E,CAAC;gBACD,YAAY,EAAE,IAAI;gBAClB,UAAU,EAAE,IAAI;aAChB,CAAC,CAAC;SACH;QAED,OAAO,sBAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,sBAAa,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnD,CAAC;CACD;AA9CD,wCA8CC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Definition, NodeId } from './Identifiers';\nimport { fail, memoizeGetter } from './Common';\nimport { Payload, TraitMap, TreeNode } from './persisted-types';\nimport { TreeView, TreeViewNode } from './TreeView';\n\n/**\n * A handle to a `TreeNode` that exists within a specific `TreeView`. This type provides a convenient\n * API for traversing trees of nodes in a TreeView and is not designed to provide maximum runtime\n * performance; if performance is a concern, consider using the TreeView and TreeViewNode APIs directly.\n * @public\n */\nexport class TreeNodeHandle implements TreeNode<TreeNodeHandle, NodeId> {\n\tprivate readonly view: TreeView;\n\tprivate readonly viewNode: TreeViewNode;\n\n\t/** Construct a handle which references the node with the given id in the given `TreeView` */\n\tpublic constructor(view: TreeView, nodeId: NodeId) {\n\t\tthis.view = view;\n\t\tthis.viewNode = view.tryGetViewNode(nodeId) ?? fail('Failed to create handle: node is not present in view');\n\t}\n\n\tpublic get payload(): Payload | undefined {\n\t\treturn this.node.payload;\n\t}\n\n\tpublic get definition(): Definition {\n\t\treturn this.node.definition;\n\t}\n\n\tpublic get identifier(): NodeId {\n\t\treturn this.node.identifier;\n\t}\n\n\tpublic get traits(): TraitMap<TreeNodeHandle> {\n\t\t// Construct a new trait map that wraps each node in each trait in a handle\n\t\tconst traitMap: TraitMap<TreeNodeHandle> = {};\n\t\tconst { view } = this;\n\t\tfor (const [label, trait] of this.node.traits.entries()) {\n\t\t\tObject.defineProperty(traitMap, label, {\n\t\t\t\tget() {\n\t\t\t\t\tconst handleTrait = trait.map((node) => new TreeNodeHandle(view, node));\n\t\t\t\t\treturn memoizeGetter(this as TraitMap<TreeNodeHandle>, label, handleTrait);\n\t\t\t\t},\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t});\n\t\t}\n\n\t\treturn memoizeGetter(this, 'traits', traitMap);\n\t}\n\n\t/**\n\t * Get a `TreeViewNode` for the tree view node that this handle references\n\t */\n\tpublic get node(): TreeViewNode {\n\t\treturn memoizeGetter(this, 'node', this.viewNode);\n\t}\n}\n"]}

package/dist/TreeView.d.ts

@@ -0,0 +1,166 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { NodeId, TraitLabel } from './Identifiers';
+import { Delta, Forest } from './Forest';
+import { NodeData, Side } from './persisted-types';
+/**
+ * Specifies the location of a trait (a labeled sequence of nodes) within the tree.
+ * @public
+ */
+export interface TraitLocation {
+    readonly parent: NodeId;
+    readonly label: TraitLabel;
+}
+/**
+ * An immutable view of a distributed tree node.
+ * @public
+ */
+export interface TreeViewNode extends NodeData<NodeId> {
+    /** The IDs of the children under this node */
+    readonly traits: ReadonlyMap<TraitLabel, readonly NodeId[]>;
+    /** The parent and trait under which this node resides. Undefined iff this is the root node of the tree (i.e. {@link initialTree}). */
+    readonly parentage?: TraitLocation;
+}
+/**
+ * Index of a place within a trait.
+ * 0 = before all nodes,
+ * 1 = after first node,
+ * etc.
+ * @public
+ */
+export declare type PlaceIndex = number & {
+    readonly PlaceIndex: unique symbol;
+};
+/**
+ * Index of a node within a trait.
+ * 0 = first node,
+ * 1 = second node,
+ * etc.
+ * @public
+ */
+export declare type TraitNodeIndex = number & {
+    readonly TraitNodeIndex: unique symbol;
+};
+/**
+ * A place within a particular `TreeView` that is anchored relative to a specific node in the tree, or relative to the outside of the trait.
+ * Valid iff 'trait' is valid and, if provided, sibling is in the Location specified by 'trait'.
+ * @public
+ */
+export interface TreeViewPlace {
+    readonly sibling?: NodeId;
+    readonly side: Side;
+    readonly trait: TraitLocation;
+}
+/**
+ * Specifies the range of nodes from `start` to `end` within a trait within a particular `TreeView`.
+ * Valid iff start and end are valid and are within the same trait.
+ * @public
+ */
+export interface TreeViewRange {
+    readonly start: TreeViewPlace;
+    readonly end: TreeViewPlace;
+}
+/**
+ * Contains some redundant information. Use only in computations between edits. Do not store.
+ * @public
+ */
+export interface NodeInTrait {
+    readonly trait: TraitLocation;
+    readonly index: TraitNodeIndex;
+}
+/**
+ * A view of a distributed tree.
+ * @public
+ */
+export declare abstract class TreeView {
+    readonly root: NodeId;
+    protected readonly forest: Forest;
+    private readonly rootNode;
+    /**
+     * A cache of node's index within their parent trait.
+     * Used to avoid redundant linear scans of traits.
+     * Not shared across views; initialized to empty each time a TreeView is created.
+     */
+    private traitIndicesCache?;
+    protected constructor(root: NodeId, forest: Forest);
+    /** @returns the number of nodes in this view */
+    get size(): number;
+    /** @returns true iff a node with the given id exists in this view */
+    hasNode(id: NodeId): boolean;
+    /**
+     * @returns the index just after place (which specifies a location between items).
+     * Performance note: this is O(siblings in trait).
+     */
+    findIndexWithinTrait(place: TreeViewPlace): PlaceIndex;
+    /** @returns the node associated with the given id in this view. Fails if the node does not exist in this view. */
+    getViewNode(id: NodeId): TreeViewNode;
+    /** @returns the node associated with the given id in this view, or undefined if the node does not exist in this view */
+    tryGetViewNode(id: NodeId): TreeViewNode | undefined;
+    /**
+     * @returns the label of the trait under which a node with the given id resides. Fails if the node does not exist in this view or if
+     * it is the root node.
+     */
+    getTraitLabel(id: NodeId): TraitLabel;
+    /**
+     * @returns the label of the trait under which a node with the given id resides, or undefined if the node is not present in this
+     * view or if it is the root node
+     */
+    tryGetTraitLabel(id: NodeId): TraitLabel | undefined;
+    /**
+     * @returns the parent of the node with the given id. Fails if the node does not exist in this view or if it is the root node.
+     */
+    getParentViewNode(id: NodeId): TreeViewNode;
+    /**
+     * @returns the parent of the node with the given id. Returns undefined if the node does not exist in this view or if it is the root
+     * node.
+     */
+    tryGetParentViewNode(id: NodeId): TreeViewNode | undefined;
+    /**
+     * @returns the trait location of the node with the given id. Fails if the node does not exist in this view or of it is the root
+     * node
+     */
+    getTraitLocation(id: NodeId): TraitLocation;
+    /**
+     * @returns the trait location of the node with the given id, or undefined if the node does not exist in this view or if it is the root
+     * node
+     */
+    tryGetTraitLocation(id: NodeId): TraitLocation | undefined;
+    /**
+     * @returns the index within the trait under which the node with the given id resides. The node must exist in this view and must have a
+     * parent.
+     * Performance note: this is O(siblings in trait).
+     */
+    getIndexInTrait(id: NodeId): TraitNodeIndex;
+    /**
+     * @returns the index within the trait under which the node with the given id resides, or undefined if the node does not exist in this
+     * view or does not have a parent.
+     * Performance note: this is O(siblings in trait).
+     */
+    tryGetIndexInTrait(id: NodeId): TraitNodeIndex | undefined;
+    /**
+     * @returns the trait at the given location. If no such trait exists, returns an empty trait.
+     */
+    getTrait(traitLocation: TraitLocation): readonly NodeId[];
+    /** Asserts that the view's internal state is consistent. Useful for testing/validation. */
+    assertConsistent(): void;
+    [Symbol.iterator](): IterableIterator<TreeViewNode>;
+    /** @returns true iff the given view is equal to this view */
+    abstract equals(view: TreeView): boolean;
+    /**
+     * @returns true iff the given view's forest of nodes is equivalent to this view's forest of nodes
+     * @param strict - if true, the views' forests must be the same object, otherwise they must merely be equivalent
+     */
+    hasEqualForest(view: TreeView, strict?: boolean): boolean;
+    private iterateNodeDescendants;
+    private getIndexOfSide;
+    /**
+     * Calculate the difference between two `TreeView`s
+     * @param view - the other view to compare to this one
+     * @returns A {@link Delta} which nodes must be changed, added, and removed to get from `this` to `view`.
+     * The views must share a root.
+     */
+    delta(view: TreeView): Delta<NodeId>;
+}
+//# sourceMappingURL=TreeView.d.ts.map