@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/lib/test/feature-libraries/chunked-forest/chunkTree.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunkTree.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/chunkTree.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAsB,QAAQ,EAAE,cAAc,EAAS,MAAM,wBAAwB,CAAC;AAC7F,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC5E,OAAO,EACN,mBAAmB,EACnB,sBAAsB,EACtB,yBAAyB,EAEzB,0BAA0B,EAC1B,0BAA0B,GAC1B,MAAM,qCAAqC,CAAC;AAC7C,sDAAsD;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,yDAAyD,CAAC;AACrF,sDAAsD;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,oDAAoD,CAAC;AACjF,OAAO,EACN,oBAAoB,EAEpB,UAAU,EACV,kBAAkB,EAClB,YAAY,EACZ,WAAW,EAEX,uBAAuB,EACvB,kBAAkB,EAClB,sBAAsB;AACtB,sDAAsD;EACtD,MAAM,wDAAwD,CAAC;AAChE,sDAAsD;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,4DAA4D,CAAC;AAC3F,sDAAsD;AACtD,OAAO,EAAE,SAAS,EAAE,MAAM,2DAA2D,CAAC;AACtF,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EACN,uBAAuB,EACvB,4BAA4B,EAC5B,mBAAmB,GACnB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAElE,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;AAC1D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AAC1C,MAAM,UAAU,GAAG,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACvD,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;AACrE,MAAM,aAAa,GAAG,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACpD,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC,gBAAgB,EAAE,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC;AAC9E,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;AACzC,MAAM,MAAM,GAAG,0BAA0B,CAAC,UAAU,CAAC,CAAC;AAEtD,SAAS,WAAW,CAAC,CAAY,EAAE,CAAY;IAC9C,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,YAAY,SAAS,EAAE;QAC3B,MAAM,CAAC,CAAC,YAAY,SAAS,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;KACpB;AACF,CAAC;AAED,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IAC1B,mDAAmD;IACnD,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC5B,EAAE,CAAC,eAAe,IAAI,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE;gBACnC,MAAM,MAAM,GAAY,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC;gBACpC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,cAAc,EAAE,KAAK,EAAE,EAAE;oBAC1D,MAAM,GAAG,GAAG,yBAAyB,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7D,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;iBACjC;gBACD,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACvC,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,cAAc,GAAG,WAAW,CAAC,WAAW,EAAE,CAAC;YACjD,MAAM,gBAAgB,GAAG,yBAAyB,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YAC1E,MAAM,CAAC,GAAG,EAAE,UAAU,EAAE,UAAU,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACpF,gBAAgB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YACjC,gBAAgB,CAAC,SAAS,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,sBAAsB,CAAC,gBAAgB,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAC7E,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,sBAAsB,CAAC,gBAAgB,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC9E,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,sBAAsB,CAAC,gBAAgB,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAC7E,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,sBAAsB,CAAC,gBAAgB,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC9E,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAE7C,qCAAqC;YACrC,MAAM,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,sBAAsB,CAAC,CAAC;YAC3E,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,UAAU,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,sBAAsB,CAAC,CAAC;YAC3E,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,UAAU,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,sBAAsB,CAAC,CAAC;YAC3E,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,UAAU,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,sBAAsB,CAAC,CAAC;YAC3E,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAChC,MAAM,MAAM,GAAG,0BAA0B,CAAC;gBACzC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACxB,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACxB,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE;aACzB,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,SAAS,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YAC3D;gBACC,MAAM,KAAK,GAAG,sBAAsB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;gBAClE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBACnC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;aACrC;YAED,+DAA+D;YAC/D;gBACC,MAAM,KAAK,GAAG,sBAAsB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;gBACjE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;aACnC;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,MAAM,GAAG,yBAAyB,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACnE,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,oBAAoB,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACjE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,UAAU,CAAC,CAAC;YACxC,MAAM,CAAC,SAAS,CAAC,4BAA4B,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;gBAClE;oBACC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI;iBACpB;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC5D,MAAM,MAAM,GAAG,0BAA0B,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACtE,MAAM,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,oBAAoB,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAClE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YAC1C,4DAA4D;YAC5D,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,oCAA4B,CAAC;QACtD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACzC,MAAM,MAAM,GAAG,0BAA0B,CAAC;gBACzC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACxB,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACxB,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;aACxB,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,oBAAoB,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAClE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,SAAS,CAAC,4BAA4B,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;gBAClF,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACxB,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;aACxB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,MAAM,GAAgB;gBAC3B,2BAA2B,EAAE,CAAC;gBAC9B,4BAA4B,EAAE,MAAM,CAAC,iBAAiB;gBACtD,qBAAqB,EAAE,CAAC;gBACxB,eAAe,EAAE,GAAG,EAAE,CAAC,WAAW;aAClC,CAAC;YAEF,MAAM,MAAM,GAAG,0BAA0B,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,aAAa,CAAC,CAAC;YAC3C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,UAAU,CAAC,CAAC;YACrD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,UAAU,CAAC,CAAC;YACrD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,aAAa,CAAC,CAAC;YAC3C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,UAAU,CAAC,CAAC;YACrD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YACnC,uBAAuB,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;YACrC,8DAA8D;YAC9D,MAAM,SAAS,GAA+B;gBAC7C,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACV,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACV,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACV,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACV,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;aACX,CAAC;YAEF,KAAK,MAAM,CAAC,SAAS,EAAE,WAAW,EAAE,aAAa,CAAC,IAAI,SAAS,EAAE;gBAChE,EAAE,CAAC,aAAa,SAAS,qBAAqB,WAAW,WAAW,aAAa,GAAG,EAAE,GAAG,EAAE;oBAC1F,MAAM,MAAM,GAAgB;wBAC3B,2BAA2B,EAAE,SAAS;wBACtC,4BAA4B,EAAE,MAAM,CAAC,iBAAiB;wBACtD,qBAAqB,EAAE,CAAC;wBACxB,eAAe,EAAE,GAAG,EAAE,CAAC,WAAW;qBAClC,CAAC;oBACF,MAAM,KAAK,GAAG,mBAAmB,CAAC,WAAW,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC,CAAC;oBACjD,MAAM,CAAC,SAAS,EAAE,CAAC;oBACnB,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;oBAC7D,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;oBAEjD,SAAS,WAAW,CACnB,WAAwB,EACxB,sBAA8B;wBAE9B,MAAM,CAAC,WAAW,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC;wBACxC,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE;4BAChC,IAAI,sBAAsB,KAAK,CAAC,EAAE;gCACjC,MAAM,CAAC,KAAK,YAAY,UAAU,CAAC,CAAC;6BACpC;iCAAM;gCACN,MAAM,CAAC,KAAK,YAAY,aAAa,CAAC,CAAC;gCACvC,WAAW,CAAC,KAAK,CAAC,SAAS,EAAE,sBAAsB,GAAG,CAAC,CAAC,CAAC;gCACzD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;6BAC5D;yBACD;oBACF,CAAC;oBAED,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;oBACnC,MAAM,CAAC,SAAS,CACf,4BAA4B,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,EAChE,KAAK,CACL,CAAC;gBACH,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACxB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAC9B,MAAM,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;YACzC,MAAM,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC1B,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,kBAAkB,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAChE,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YACzB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QACnC,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;YACf,MAAM,IAAI,GAAG,kBAAkB,CAC9B,MAAM,EACN,mBAAmB,EACnB,IAAI,CAAC,MAAM,CAAC,IAAI,EAChB,IAAI,GAAG,EAAE,CACT,CAAC;YACF,WAAW,CAAC,IAAI,EAAE,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;YAChB,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,EAAE,mBAAmB,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACpF,WAAW,CAAC,IAAI,EAAE,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;YACtB,MAAM,IAAI,GAAG,kBAAkB,CAC9B,MAAM,EACN,mBAAmB,EACnB,WAAW,CAAC,IAAI,EAChB,IAAI,GAAG,EAAE,CACT,CAAC;YACF,WAAW,CACV,IAAI,EACJ,IAAI,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE;gBACtC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;aAC1D,CAAC,CACF,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,IAAI,GAAG,kBAAkB,CAC9B,MAAM,EACN,mBAAmB,EACnB,cAAc,CAAC,IAAI,EACnB,IAAI,GAAG,EAAE,CACT,CAAC;YACF,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACxC,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,MAAM,IAAI,GAAG,uBAAuB,CACnC,MAAM,EACN,mBAAmB,EACnB,UAAU,EACV,KAAK,CAAC,KAAK,CAAC,EACZ,IAAI,GAAG,EAAE,CACT,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/E,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACxB,MAAM,IAAI,GAAG,uBAAuB,CACnC,MAAM,EACN,mBAAmB,EACnB,aAAa,EACb,KAAK,CAAC,KAAK,CAAC,EACZ,IAAI,GAAG,EAAE,CACT,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { CursorLocationType, EmptyKey, mapCursorField, Value } from \"../../../core/index.js\";\nimport { jsonObject, leaf, SchemaBuilder } from \"../../../domains/index.js\";\nimport {\n\tdefaultSchemaPolicy,\n\tjsonableTreeFromCursor,\n\tcursorForJsonableTreeNode,\n\tTreeChunk,\n\tcursorForJsonableTreeField,\n\tintoStoredSchemaCollection,\n} from \"../../../feature-libraries/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { BasicChunk } from \"../../../feature-libraries/chunked-forest/basicChunk.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { tryGetChunk } from \"../../../feature-libraries/chunked-forest/chunk.js\";\nimport {\n\tbasicOnlyChunkPolicy,\n\tChunkPolicy,\n\tchunkRange,\n\tdefaultChunkPolicy,\n\tinsertValues,\n\tpolymorphic,\n\tShapeInfo,\n\ttryShapeFromFieldSchema,\n\ttryShapeFromSchema,\n\tuniformChunkFromCursor,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/chunked-forest/chunkTree.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { SequenceChunk } from \"../../../feature-libraries/chunked-forest/sequenceChunk.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { TreeShape } from \"../../../feature-libraries/chunked-forest/uniformChunk.js\";\nimport { brand } from \"../../../util/index.js\";\nimport {\n\tassertChunkCursorEquals,\n\tjsonableTreesFromFieldCursor,\n\tnumberSequenceField,\n} from \"./fieldCursorTestUtilities.js\";\nimport { polygonTree, testData } from \"./uniformChunkTestData.js\";\n\nconst builder = new SchemaBuilder({ scope: \"chunkTree\" });\nconst empty = builder.object(\"empty\", {});\nconst valueField = SchemaBuilder.required(leaf.number);\nconst structValue = builder.object(\"structValue\", { x: valueField });\nconst optionalField = builder.optional(leaf.number);\nconst structOptional = builder.object(\"structOptional\", { x: optionalField });\nconst schemaView = builder.intoLibrary();\nconst schema = intoStoredSchemaCollection(schemaView);\n\nfunction expectEqual(a: ShapeInfo, b: ShapeInfo): void {\n\tassert.deepEqual(a, b);\n\tif (a instanceof TreeShape) {\n\t\tassert(b instanceof TreeShape);\n\t\tassert(a.equals(b));\n\t\tassert(b.equals(a));\n\t}\n}\n\ndescribe(\"chunkTree\", () => {\n\t// Ensure handling of various shapes works properly\n\tdescribe(\"insertValues\", () => {\n\t\tfor (const tree of testData) {\n\t\t\tit(`values from ${tree.name}`, () => {\n\t\t\t\tconst values: Value[] = [];\n\t\t\t\tconst chunk = tree.dataFactory();\n\t\t\t\tconst shape = chunk.shape.treeShape;\n\t\t\t\tfor (let index = 0; index < chunk.topLevelLength; index++) {\n\t\t\t\t\tconst src = cursorForJsonableTreeNode(tree.reference[index]);\n\t\t\t\t\tinsertValues(src, shape, values);\n\t\t\t\t}\n\t\t\t\tassert.deepEqual(values, chunk.values);\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"uniformChunkFromCursor\", () => {\n\t\tit(\"maxTopLevelLength and skipLastNavigation are respected\", () => {\n\t\t\tconst uniformPolygon = polygonTree.dataFactory();\n\t\t\tconst polygonReference = cursorForJsonableTreeNode(polygonTree.reference);\n\t\t\tconst [key, pointShape, pointCount] = uniformPolygon.shape.treeShape.fieldsArray[0];\n\t\t\tpolygonReference.enterField(key);\n\t\t\tpolygonReference.firstNode();\n\t\t\tconst chunk1 = uniformChunkFromCursor(polygonReference, pointShape, 1, true);\n\t\t\tassert.equal(polygonReference.fieldIndex, 0);\n\t\t\tconst chunk2 = uniformChunkFromCursor(polygonReference, pointShape, 1, false);\n\t\t\tassert.equal(polygonReference.fieldIndex, 1);\n\t\t\tconst chunk3 = uniformChunkFromCursor(polygonReference, pointShape, 2, true);\n\t\t\tassert.equal(polygonReference.fieldIndex, 2);\n\t\t\tconst chunk4 = uniformChunkFromCursor(polygonReference, pointShape, 2, false);\n\t\t\tassert.equal(polygonReference.fieldIndex, 4);\n\n\t\t\t// Check produced chunks are correct.\n\t\t\tconst pointsArray = polygonTree.reference.fields[EmptyKey];\n\t\t\tconst fromChunk1 = mapCursorField(chunk1.cursor(), jsonableTreeFromCursor);\n\t\t\tassert.deepEqual(fromChunk1, pointsArray.slice(0, 1));\n\t\t\tconst fromChunk2 = mapCursorField(chunk2.cursor(), jsonableTreeFromCursor);\n\t\t\tassert.deepEqual(fromChunk2, pointsArray.slice(0, 1));\n\t\t\tconst fromChunk3 = mapCursorField(chunk3.cursor(), jsonableTreeFromCursor);\n\t\t\tassert.deepEqual(fromChunk3, pointsArray.slice(1, 3));\n\t\t\tconst fromChunk4 = mapCursorField(chunk4.cursor(), jsonableTreeFromCursor);\n\t\t\tassert.deepEqual(fromChunk4, pointsArray.slice(2, 4));\n\t\t});\n\n\t\tit(\"stops if type changes\", () => {\n\t\t\tconst cursor = cursorForJsonableTreeField([\n\t\t\t\t{ type: leaf.null.name },\n\t\t\t\t{ type: leaf.null.name },\n\t\t\t\t{ type: jsonObject.name },\n\t\t\t]);\n\t\t\tcursor.firstNode();\n\t\t\tconst nullShape = new TreeShape(leaf.null.name, false, []);\n\t\t\t{\n\t\t\t\tconst chunk = uniformChunkFromCursor(cursor, nullShape, 3, false);\n\t\t\t\tassert.equal(chunk.topLevelLength, 2);\n\t\t\t\tassert.equal(cursor.fieldIndex, 2);\n\t\t\t\tcursor.seekNodes(-cursor.fieldIndex);\n\t\t\t}\n\n\t\t\t// Check when stopping early, skipLastNavigation does not apply\n\t\t\t{\n\t\t\t\tconst chunk = uniformChunkFromCursor(cursor, nullShape, 3, true);\n\t\t\t\tassert.equal(chunk.topLevelLength, 2);\n\t\t\t\tassert.equal(cursor.fieldIndex, 2);\n\t\t\t}\n\t\t});\n\t});\n\n\tdescribe(\"chunkRange\", () => {\n\t\tit(\"single basic chunk\", () => {\n\t\t\tconst cursor = cursorForJsonableTreeNode({ type: leaf.null.name });\n\t\t\tconst chunks = chunkRange(cursor, basicOnlyChunkPolicy, 1, true);\n\t\t\tassert.equal(chunks.length, 1);\n\t\t\tassert.equal(chunks[0].topLevelLength, 1);\n\t\t\tassert.equal(cursor.fieldIndex, 0);\n\t\t\tassert(chunks[0] instanceof BasicChunk);\n\t\t\tassert.deepEqual(jsonableTreesFromFieldCursor(chunks[0].cursor()), [\n\t\t\t\t{\n\t\t\t\t\ttype: leaf.null.name,\n\t\t\t\t},\n\t\t\t]);\n\t\t});\n\n\t\tit(\"full field basic chunk without skipLastNavigation\", () => {\n\t\t\tconst cursor = cursorForJsonableTreeField([{ type: leaf.null.name }]);\n\t\t\tcursor.firstNode();\n\t\t\tconst chunks = chunkRange(cursor, basicOnlyChunkPolicy, 1, false);\n\t\t\tassert.equal(chunks.length, 1);\n\t\t\tassert.equal(chunks[0].topLevelLength, 1);\n\t\t\t// Should have existed the nodes and now be at fields level.\n\t\t\tassert.equal(cursor.mode, CursorLocationType.Fields);\n\t\t});\n\n\t\tit(\"basic chunks for part of field\", () => {\n\t\t\tconst cursor = cursorForJsonableTreeField([\n\t\t\t\t{ type: leaf.null.name },\n\t\t\t\t{ type: leaf.null.name },\n\t\t\t\t{ type: leaf.null.name },\n\t\t\t]);\n\t\t\tcursor.firstNode();\n\t\t\tconst chunks = chunkRange(cursor, basicOnlyChunkPolicy, 2, false);\n\t\t\tassert.equal(chunks.length, 2);\n\t\t\tassert.equal(cursor.fieldIndex, 2);\n\t\t\tassert.deepEqual(jsonableTreesFromFieldCursor(new SequenceChunk(chunks).cursor()), [\n\t\t\t\t{ type: leaf.null.name },\n\t\t\t\t{ type: leaf.null.name },\n\t\t\t]);\n\t\t});\n\n\t\tit(\"creates sequence chunks\", () => {\n\t\t\tconst policy: ChunkPolicy = {\n\t\t\t\tsequenceChunkSplitThreshold: 2,\n\t\t\t\tsequenceChunkInlineThreshold: Number.POSITIVE_INFINITY,\n\t\t\t\tuniformChunkNodeCount: 0,\n\t\t\t\tshapeFromSchema: () => polymorphic,\n\t\t\t};\n\n\t\t\tconst cursor = cursorForJsonableTreeField(numberSequenceField(4));\n\t\t\tcursor.firstNode();\n\t\t\tconst chunks = chunkRange(cursor, policy, 3, false);\n\t\t\tassert.equal(chunks.length, 2);\n\t\t\tassert(chunks[0] instanceof SequenceChunk);\n\t\t\tassert.equal(chunks[0].subChunks.length, 2);\n\t\t\tassert(chunks[0].subChunks[0] instanceof BasicChunk);\n\t\t\tassert(chunks[0].subChunks[1] instanceof BasicChunk);\n\t\t\tassert(chunks[1] instanceof SequenceChunk);\n\t\t\tassert.equal(chunks[1].subChunks.length, 1);\n\t\t\tassert(chunks[1].subChunks[0] instanceof BasicChunk);\n\t\t\tassert.equal(cursor.fieldIndex, 3);\n\t\t\tassertChunkCursorEquals(new SequenceChunk(chunks), numberSequenceField(3));\n\t\t});\n\n\t\tdescribe(\"makes sequence trees\", () => {\n\t\t\t// [sequenceChunkSplitThreshold, field length, expected depth]\n\t\t\tconst testCases: [number, number, number][] = [\n\t\t\t\t[2, 1, 0],\n\t\t\t\t[2, 2, 0],\n\t\t\t\t[2, 3, 1],\n\t\t\t\t[2, 4, 1],\n\t\t\t\t[2, 5, 2],\n\t\t\t\t[2, 8, 2],\n\t\t\t\t[2, 9, 3],\n\t\t\t\t[3, 3, 0],\n\t\t\t\t[4, 4, 0],\n\t\t\t\t[4, 5, 1],\n\t\t\t\t[4, 16, 1],\n\t\t\t\t[4, 17, 2],\n\t\t\t\t[4, 64, 2],\n\t\t\t\t[4, 65, 3],\n\t\t\t\t[4, 120, 3],\n\t\t\t\t[4, 127, 3],\n\t\t\t\t[4, 150, 3],\n\t\t\t\t[4, 255, 3],\n\t\t\t\t[4, 256, 3],\n\t\t\t\t[4, 257, 4],\n\t\t\t];\n\n\t\t\tfor (const [threshold, fieldLength, expectedDepth] of testCases) {\n\t\t\t\tit(`threshold ${threshold} with fieldLength ${fieldLength} (depth ${expectedDepth})`, () => {\n\t\t\t\t\tconst policy: ChunkPolicy = {\n\t\t\t\t\t\tsequenceChunkSplitThreshold: threshold,\n\t\t\t\t\t\tsequenceChunkInlineThreshold: Number.POSITIVE_INFINITY,\n\t\t\t\t\t\tuniformChunkNodeCount: 0,\n\t\t\t\t\t\tshapeFromSchema: () => polymorphic,\n\t\t\t\t\t};\n\t\t\t\t\tconst field = numberSequenceField(fieldLength);\n\t\t\t\t\tconst cursor = cursorForJsonableTreeField(field);\n\t\t\t\t\tcursor.firstNode();\n\t\t\t\t\tconst chunks = chunkRange(cursor, policy, fieldLength, true);\n\t\t\t\t\tassert.equal(cursor.fieldIndex, fieldLength - 1);\n\n\t\t\t\t\tfunction checkChunks(\n\t\t\t\t\t\tinnerChunks: TreeChunk[],\n\t\t\t\t\t\texpectedDepthRemaining: number,\n\t\t\t\t\t): void {\n\t\t\t\t\t\tassert(innerChunks.length <= threshold);\n\t\t\t\t\t\tfor (const chunk of innerChunks) {\n\t\t\t\t\t\t\tif (expectedDepthRemaining === 0) {\n\t\t\t\t\t\t\t\tassert(chunk instanceof BasicChunk);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tassert(chunk instanceof SequenceChunk);\n\t\t\t\t\t\t\t\tcheckChunks(chunk.subChunks, expectedDepthRemaining - 1);\n\t\t\t\t\t\t\t\tassert(chunk.subChunks.length >= Math.floor(threshold / 2));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tcheckChunks(chunks, expectedDepth);\n\t\t\t\t\tassert.deepEqual(\n\t\t\t\t\t\tjsonableTreesFromFieldCursor(new SequenceChunk(chunks).cursor()),\n\t\t\t\t\t\tfield,\n\t\t\t\t\t);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tit(\"reuses chunks\", () => {\n\t\t\tconst chunk = new BasicChunk(brand(\"Foo\"), new Map());\n\t\t\tconst cursor = chunk.cursor();\n\t\t\tcursor.firstNode();\n\t\t\tassert.equal(tryGetChunk(cursor), chunk);\n\t\t\tassert(!chunk.isShared());\n\t\t\tconst chunks = chunkRange(cursor, defaultChunkPolicy, 1, false);\n\t\t\tassert(chunk.isShared());\n\t\t\tassert.equal(chunks[0], chunk);\n\t\t});\n\t});\n\n\tdescribe(\"tryShapeFromSchema\", () => {\n\t\tit(\"leaf\", () => {\n\t\t\tconst info = tryShapeFromSchema(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\tleaf.number.name,\n\t\t\t\tnew Map(),\n\t\t\t);\n\t\t\texpectEqual(info, new TreeShape(leaf.number.name, true, []));\n\t\t});\n\t\tit(\"empty\", () => {\n\t\t\tconst info = tryShapeFromSchema(schema, defaultSchemaPolicy, empty.name, new Map());\n\t\t\texpectEqual(info, new TreeShape(empty.name, false, []));\n\t\t});\n\t\tit(\"structValue\", () => {\n\t\t\tconst info = tryShapeFromSchema(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\tstructValue.name,\n\t\t\t\tnew Map(),\n\t\t\t);\n\t\t\texpectEqual(\n\t\t\t\tinfo,\n\t\t\t\tnew TreeShape(structValue.name, false, [\n\t\t\t\t\t[brand(\"x\"), new TreeShape(leaf.number.name, true, []), 1],\n\t\t\t\t]),\n\t\t\t);\n\t\t});\n\t\tit(\"structOptional\", () => {\n\t\t\tconst info = tryShapeFromSchema(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\tstructOptional.name,\n\t\t\t\tnew Map(),\n\t\t\t);\n\t\t\texpectEqual(info, polymorphic);\n\t\t});\n\t});\n\n\tdescribe(\"tryShapeFromFieldSchema\", () => {\n\t\tit(\"valueField\", () => {\n\t\t\tconst info = tryShapeFromFieldSchema(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\tvalueField,\n\t\t\t\tbrand(\"key\"),\n\t\t\t\tnew Map(),\n\t\t\t);\n\t\t\tassert.deepEqual(info, [\"key\", new TreeShape(leaf.number.name, true, []), 1]);\n\t\t});\n\t\tit(\"optionalField\", () => {\n\t\t\tconst info = tryShapeFromFieldSchema(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\toptionalField,\n\t\t\t\tbrand(\"key\"),\n\t\t\t\tnew Map(),\n\t\t\t);\n\t\t\tassert.equal(info, undefined);\n\t\t});\n\t});\n});\n"]}

package/lib/test/feature-libraries/chunked-forest/chunkedForest.spec.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=chunkedForest.spec.d.ts.map

package/lib/test/feature-libraries/chunked-forest/chunkedForest.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunkedForest.spec.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/chunkedForest.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/feature-libraries/chunked-forest/chunkedForest.spec.js

@@ -1,47 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-// Allow importing from this specific file which is being tested:
-// eslint-disable-next-line import/no-internal-modules
-import { buildChunkedForest } from "../../../feature-libraries/chunked-forest/chunkedForest.js";
-import { makeTreeChunker, Chunker, polymorphic, defaultChunkPolicy, tryShapeFromSchema,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/chunked-forest/chunkTree.js";
-import { defaultSchemaPolicy } from "../../../feature-libraries/index.js";
-import { testForest } from "../../forestTestSuite.js";
-const chunkers = [
-    [
-        "basic",
-        (schema) => new Chunker(schema, defaultSchemaPolicy, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY, 0, () => polymorphic),
-    ],
-    ["default", (schema) => makeTreeChunker(schema, defaultSchemaPolicy)],
-    [
-        "sequences",
-        (schema) => new Chunker(schema, defaultSchemaPolicy, 2, 1, 0, () => polymorphic),
-    ],
-    [
-        "minimal-uniform",
-        (schema) => new Chunker(schema, defaultSchemaPolicy, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY, 1, tryShapeFromSchema),
-    ],
-    [
-        "uniform",
-        (schema) => new Chunker(schema, defaultSchemaPolicy, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY, defaultChunkPolicy.uniformChunkNodeCount, tryShapeFromSchema),
-    ],
-    [
-        "mixed",
-        (schema) => new Chunker(schema, defaultSchemaPolicy, 2, 1, defaultChunkPolicy.uniformChunkNodeCount, tryShapeFromSchema),
-    ],
-];
-describe("ChunkedForest", () => {
-    for (const [name, chunker] of chunkers) {
-        describe(name, () => {
-            testForest({
-                suiteName: "ChunkedForest forest suite",
-                factory: (schema) => buildChunkedForest(chunker(schema)),
-                skipCursorErrorCheck: true,
-            });
-        });
-    }
-});
-//# sourceMappingURL=chunkedForest.spec.js.map

package/lib/test/feature-libraries/chunked-forest/chunkedForest.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunkedForest.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/chunked-forest/chunkedForest.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,iEAAiE;AACjE,sDAAsD;AACtD,OAAO,EAAE,kBAAkB,EAAE,MAAM,4DAA4D,CAAC;AAChG,OAAO,EAEN,eAAe,EACf,OAAO,EACP,WAAW,EAEX,kBAAkB,EAClB,kBAAkB;AAClB,sDAAsD;EACtD,MAAM,wDAAwD,CAAC;AAGhE,OAAO,EAAE,mBAAmB,EAAE,MAAM,qCAAqC,CAAC;AAC1E,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEtD,MAAM,QAAQ,GAAmE;IAChF;QACC,OAAO;QACP,CAAC,MAAM,EAAY,EAAE,CACpB,IAAI,OAAO,CACV,MAAM,EACN,mBAAmB,EACnB,MAAM,CAAC,iBAAiB,EACxB,MAAM,CAAC,iBAAiB,EACxB,CAAC,EACD,GAAG,EAAE,CAAC,WAAW,CACjB;KACF;IACD,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,eAAe,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;IACrE;QACC,WAAW;QACX,CAAC,MAAM,EAAY,EAAE,CACpB,IAAI,OAAO,CAAC,MAAM,EAAE,mBAAmB,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAc,EAAE,CAAC,WAAW,CAAC;KAChF;IACD;QACC,iBAAiB;QACjB,CAAC,MAAM,EAAY,EAAE,CACpB,IAAI,OAAO,CACV,MAAM,EACN,mBAAmB,EACnB,MAAM,CAAC,iBAAiB,EACxB,MAAM,CAAC,iBAAiB,EACxB,CAAC,EACD,kBAAkB,CAClB;KACF;IACD;QACC,SAAS;QACT,CAAC,MAAM,EAAY,EAAE,CACpB,IAAI,OAAO,CACV,MAAM,EACN,mBAAmB,EACnB,MAAM,CAAC,iBAAiB,EACxB,MAAM,CAAC,iBAAiB,EACxB,kBAAkB,CAAC,qBAAqB,EACxC,kBAAkB,CAClB;KACF;IACD;QACC,OAAO;QACP,CAAC,MAAM,EAAY,EAAE,CACpB,IAAI,OAAO,CACV,MAAM,EACN,mBAAmB,EACnB,CAAC,EACD,CAAC,EACD,kBAAkB,CAAC,qBAAqB,EACxC,kBAAkB,CAClB;KACF;CACD,CAAC;AAEF,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC9B,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE;QACvC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE;YACnB,UAAU,CAAC;gBACV,SAAS,EAAE,4BAA4B;gBACvC,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACxD,oBAAoB,EAAE,IAAI;aAC1B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;KACH;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n// Allow importing from this specific file which is being tested:\n// eslint-disable-next-line import/no-internal-modules\nimport { buildChunkedForest } from \"../../../feature-libraries/chunked-forest/chunkedForest.js\";\nimport {\n\tIChunker,\n\tmakeTreeChunker,\n\tChunker,\n\tpolymorphic,\n\tShapeInfo,\n\tdefaultChunkPolicy,\n\ttryShapeFromSchema,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/chunked-forest/chunkTree.js\";\n\nimport { TreeStoredSchemaSubscription } from \"../../../core/index.js\";\nimport { defaultSchemaPolicy } from \"../../../feature-libraries/index.js\";\nimport { testForest } from \"../../forestTestSuite.js\";\n\nconst chunkers: [string, (schema: TreeStoredSchemaSubscription) => IChunker][] = [\n\t[\n\t\t\"basic\",\n\t\t(schema): IChunker =>\n\t\t\tnew Chunker(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\t\t0,\n\t\t\t\t() => polymorphic,\n\t\t\t),\n\t],\n\t[\"default\", (schema) => makeTreeChunker(schema, defaultSchemaPolicy)],\n\t[\n\t\t\"sequences\",\n\t\t(schema): IChunker =>\n\t\t\tnew Chunker(schema, defaultSchemaPolicy, 2, 1, 0, (): ShapeInfo => polymorphic),\n\t],\n\t[\n\t\t\"minimal-uniform\",\n\t\t(schema): IChunker =>\n\t\t\tnew Chunker(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\t\t1,\n\t\t\t\ttryShapeFromSchema,\n\t\t\t),\n\t],\n\t[\n\t\t\"uniform\",\n\t\t(schema): IChunker =>\n\t\t\tnew Chunker(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\t\tdefaultChunkPolicy.uniformChunkNodeCount,\n\t\t\t\ttryShapeFromSchema,\n\t\t\t),\n\t],\n\t[\n\t\t\"mixed\",\n\t\t(schema): IChunker =>\n\t\t\tnew Chunker(\n\t\t\t\tschema,\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\t2,\n\t\t\t\t1,\n\t\t\t\tdefaultChunkPolicy.uniformChunkNodeCount,\n\t\t\t\ttryShapeFromSchema,\n\t\t\t),\n\t],\n];\n\ndescribe(\"ChunkedForest\", () => {\n\tfor (const [name, chunker] of chunkers) {\n\t\tdescribe(name, () => {\n\t\t\ttestForest({\n\t\t\t\tsuiteName: \"ChunkedForest forest suite\",\n\t\t\t\tfactory: (schema) => buildChunkedForest(chunker(schema)),\n\t\t\t\tskipCursorErrorCheck: true,\n\t\t\t});\n\t\t});\n\t}\n});\n"]}

package/lib/test/feature-libraries/chunked-forest/codec/checkEncode.d.ts

@@ -1,9 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { BufferFormat, EncoderCache, FieldEncoder, NodeEncoder } from "../../../../feature-libraries/chunked-forest/codec/compressedEncode.js";
-import { JsonableTree } from "../../../../core/index.js";
-export declare function checkNodeEncode(shape: NodeEncoder, cache: EncoderCache, tree: JsonableTree): BufferFormat;
-export declare function checkFieldEncode(shape: FieldEncoder, cache: EncoderCache, tree: JsonableTree[]): BufferFormat;
-//# sourceMappingURL=checkEncode.d.ts.map

package/lib/test/feature-libraries/chunked-forest/codec/checkEncode.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"checkEncode.d.ts","sourceRoot":"","sources":["../../../../../src/test/feature-libraries/chunked-forest/codec/checkEncode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,WAAW,EAEX,MAAM,wEAAwE,CAAC;AAUhF,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAUzD,wBAAgB,eAAe,CAC9B,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,YAAY,EACnB,IAAI,EAAE,YAAY,GAChB,YAAY,CASd;AAED,wBAAgB,gBAAgB,CAC/B,KAAK,EAAE,YAAY,EACnB,KAAK,EAAE,YAAY,EACnB,IAAI,EAAE,YAAY,EAAE,GAClB,YAAY,CASd"}

package/lib/test/feature-libraries/chunked-forest/codec/checkEncode.js

@@ -1,124 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert, fail } from "assert";
-// eslint-disable-next-line import/no-internal-modules
-import { handleShapesAndIdentifiers } from "../../../../feature-libraries/chunked-forest/codec/chunkEncodingGeneric.js";
-import { version,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../../feature-libraries/chunked-forest/codec/format.js";
-import { assertChunkCursorBatchEquals } from "../fieldCursorTestUtilities.js";
-import { cursorForJsonableTreeNode, cursorForJsonableTreeField, isFluidHandle, } from "../../../../feature-libraries/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { decode } from "../../../../feature-libraries/chunked-forest/codec/chunkDecoding.js";
-export function checkNodeEncode(shape, cache, tree) {
-    const buffer = [shape.shape];
-    const cursor = cursorForJsonableTreeNode(tree);
-    shape.encodeNode(cursor, cache, buffer);
-    // Check round-trip
-    checkDecode([buffer], [[tree]]);
-    return buffer.slice(1);
-}
-export function checkFieldEncode(shape, cache, tree) {
-    const buffer = [shape.shape];
-    const cursor = cursorForJsonableTreeField(tree);
-    shape.encodeField(cursor, cache, buffer);
-    // Check round-trip
-    checkDecode([buffer], [tree]);
-    return buffer.slice(1);
-}
-function checkDecode(buffer, tree) {
-    // Check round-trips with identifiers inline and out of line
-    testDecode(buffer, tree, () => false);
-    testDecode(buffer, tree, () => true);
-}
-/**
- * Clones anything handleShapesAndIdentifiers might modify in-place.
- */
-function cloneArrays(data) {
-    return data.map((item) => (Array.isArray(item) ? cloneArrays(item) : item));
-}
-function testDecode(buffer, expectedTree, identifierFilter) {
-    const chunk = handleShapesAndIdentifiers(version, cloneArrays(buffer), identifierFilter);
-    // TODO: check chunk matches schema
-    // Check decode
-    const result = decode(chunk);
-    assertChunkCursorBatchEquals(result, expectedTree);
-    // handles can't be roundtripped through JSON. the FluidSerializer can't be
-    // used to roundtrip handles in this case either, as doing so changes the
-    // contents of the handle compared to the original object. avoid the below
-    // roundtripping in that case.
-    function hasHandle(data) {
-        if (Array.isArray(data)) {
-            return data.some(hasHandle);
-        }
-        return isFluidHandle(data);
-    }
-    if (hasHandle(chunk.data)) {
-        return chunk;
-    }
-    // Confirm JSON compatibility
-    {
-        assertJsonish(chunk, new Set());
-        const json = JSON.stringify(chunk);
-        const parsed = JSON.parse(json);
-        // can't check this due to undefined fields
-        // assert.deepEqual(parsed, chunk);
-        // Instead check that it works properly:
-        const parsedResult = decode(parsed);
-        assert.deepEqual(parsedResult, result);
-    }
-    return chunk;
-}
-/**
- * Checks that data is json compatible.
- *
- * This assumes that `undefined` fields are allowed as JSON will omit them.
- * If tolerating undefined fields is not desired, a similar check can be done by round-tripping through json instead.
- */
-function assertJsonish(data, stack) {
-    switch (typeof data) {
-        case "number":
-            assert(Number.isFinite(data));
-            assert(!Object.is(data, -0));
-            return;
-        case "string":
-        // TODO: could test that string is valid unicode here.
-        case "boolean":
-            return;
-        case "object": {
-            if (data === null) {
-                return;
-            }
-            assert(!stack.has(data));
-            stack.add(data);
-            try {
-                if (Array.isArray(data)) {
-                    for (const item of data) {
-                        assertJsonish(item, stack);
-                    }
-                }
-                const prototype = Reflect.getPrototypeOf(data);
-                if (prototype !== Object && prototype === null) {
-                    fail();
-                }
-                for (const key of Reflect.ownKeys(data)) {
-                    assert(typeof key === "string");
-                    const value = Reflect.get(data, key);
-                    if (value !== undefined) {
-                        // TODO: could check for feature detection pattern, used for IFluidHandle
-                        assertJsonish(value, stack);
-                    }
-                }
-                return;
-            }
-            finally {
-                stack.delete(data);
-            }
-        }
-        default:
-            fail();
-    }
-}
-//# sourceMappingURL=checkEncode.js.map

package/lib/test/feature-libraries/chunked-forest/codec/checkEncode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"checkEncode.js","sourceRoot":"","sources":["../../../../../src/test/feature-libraries/chunked-forest/codec/checkEncode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAUhD,sDAAsD;AACtD,OAAO,EAAE,0BAA0B,EAAE,MAAM,4EAA4E,CAAC;AACxH,OAAO,EAEN,OAAO;AACP,sDAAsD;EACtD,MAAM,8DAA8D,CAAC;AAEtE,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EACN,yBAAyB,EACzB,0BAA0B,EAC1B,aAAa,GACb,MAAM,wCAAwC,CAAC;AAChD,sDAAsD;AACtD,OAAO,EAAE,MAAM,EAAE,MAAM,qEAAqE,CAAC;AAE7F,MAAM,UAAU,eAAe,CAC9B,KAAkB,EAClB,KAAmB,EACnB,IAAkB;IAElB,MAAM,MAAM,GAAiB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC/C,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAExC,mBAAmB;IACnB,WAAW,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEhC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC/B,KAAmB,EACnB,KAAmB,EACnB,IAAoB;IAEpB,MAAM,MAAM,GAAiB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,0BAA0B,CAAC,IAAI,CAAC,CAAC;IAChD,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAEzC,mBAAmB;IACnB,WAAW,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAE9B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,WAAW,CAAC,MAAsB,EAAE,IAAsB;IAClE,4DAA4D;IAC5D,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;IACtC,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAI,IAAkB;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAQ,CAAC;AACpF,CAAC;AAED,SAAS,UAAU,CAClB,MAAsB,EACtB,YAA8B,EAC9B,gBAAuC;IAEvC,MAAM,KAAK,GAAG,0BAA0B,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAEzF,mCAAmC;IAEnC,eAAe;IACf,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7B,4BAA4B,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IAEnD,2EAA2E;IAC3E,yEAAyE;IACzE,0EAA0E;IAC1E,8BAA8B;IAC9B,SAAS,SAAS,CAAC,IAAa;QAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;SAC5B;QACD,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;QAC1B,OAAO,KAAK,CAAC;KACb;IAED,6BAA6B;IAC7B;QACC,aAAa,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAChC,2CAA2C;QAC3C,mCAAmC;QACnC,wCAAwC;QACxC,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;KACvC;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,IAAa,EAAE,KAAmB;IACxD,QAAQ,OAAO,IAAI,EAAE;QACpB,KAAK,QAAQ;YACZ,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,OAAO;QACR,KAAK,QAAQ,CAAC;QACd,sDAAsD;QACtD,KAAK,SAAS;YACb,OAAO;QACR,KAAK,QAAQ,CAAC,CAAC;YACd,IAAI,IAAI,KAAK,IAAI,EAAE;gBAClB,OAAO;aACP;YACD,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,IAAI;gBACH,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBACxB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;wBACxB,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;qBAC3B;iBACD;gBACD,MAAM,SAAS,GAAG,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;gBAC/C,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,IAAI,EAAE;oBAC/C,IAAI,EAAE,CAAC;iBACP;gBAED,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBACxC,MAAM,CAAC,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC;oBAChC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;oBACrC,IAAI,KAAK,KAAK,SAAS,EAAE;wBACxB,yEAAyE;wBACzE,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;qBAC5B;iBACD;gBACD,OAAO;aACP;oBAAS;gBACT,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;aACnB;SACD;QACD;YACC,IAAI,EAAE,CAAC;KACR;AACF,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert, fail } from \"assert\";\nimport {\n\tBufferFormat,\n\tEncoderCache,\n\tFieldEncoder,\n\tNodeEncoder,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../../feature-libraries/chunked-forest/codec/compressedEncode.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { CounterFilter } from \"../../../../feature-libraries/chunked-forest/codec/chunkCodecUtilities.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { handleShapesAndIdentifiers } from \"../../../../feature-libraries/chunked-forest/codec/chunkEncodingGeneric.js\";\nimport {\n\tEncodedFieldBatch,\n\tversion,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../../feature-libraries/chunked-forest/codec/format.js\";\nimport { JsonableTree } from \"../../../../core/index.js\";\nimport { assertChunkCursorBatchEquals } from \"../fieldCursorTestUtilities.js\";\nimport {\n\tcursorForJsonableTreeNode,\n\tcursorForJsonableTreeField,\n\tisFluidHandle,\n} from \"../../../../feature-libraries/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { decode } from \"../../../../feature-libraries/chunked-forest/codec/chunkDecoding.js\";\n\nexport function checkNodeEncode(\n\tshape: NodeEncoder,\n\tcache: EncoderCache,\n\ttree: JsonableTree,\n): BufferFormat {\n\tconst buffer: BufferFormat = [shape.shape];\n\tconst cursor = cursorForJsonableTreeNode(tree);\n\tshape.encodeNode(cursor, cache, buffer);\n\n\t// Check round-trip\n\tcheckDecode([buffer], [[tree]]);\n\n\treturn buffer.slice(1);\n}\n\nexport function checkFieldEncode(\n\tshape: FieldEncoder,\n\tcache: EncoderCache,\n\ttree: JsonableTree[],\n): BufferFormat {\n\tconst buffer: BufferFormat = [shape.shape];\n\tconst cursor = cursorForJsonableTreeField(tree);\n\tshape.encodeField(cursor, cache, buffer);\n\n\t// Check round-trip\n\tcheckDecode([buffer], [tree]);\n\n\treturn buffer.slice(1);\n}\n\nfunction checkDecode(buffer: BufferFormat[], tree: JsonableTree[][]): void {\n\t// Check round-trips with identifiers inline and out of line\n\ttestDecode(buffer, tree, () => false);\n\ttestDecode(buffer, tree, () => true);\n}\n\n/**\n * Clones anything handleShapesAndIdentifiers might modify in-place.\n */\nfunction cloneArrays<T>(data: readonly T[]): T[] {\n\treturn data.map((item) => (Array.isArray(item) ? cloneArrays(item) : item)) as T[];\n}\n\nfunction testDecode(\n\tbuffer: BufferFormat[],\n\texpectedTree: JsonableTree[][],\n\tidentifierFilter: CounterFilter<string>,\n): EncodedFieldBatch {\n\tconst chunk = handleShapesAndIdentifiers(version, cloneArrays(buffer), identifierFilter);\n\n\t// TODO: check chunk matches schema\n\n\t// Check decode\n\tconst result = decode(chunk);\n\tassertChunkCursorBatchEquals(result, expectedTree);\n\n\t// handles can't be roundtripped through JSON. the FluidSerializer can't be\n\t// used to roundtrip handles in this case either, as doing so changes the\n\t// contents of the handle compared to the original object. avoid the below\n\t// roundtripping in that case.\n\tfunction hasHandle(data: unknown): boolean {\n\t\tif (Array.isArray(data)) {\n\t\t\treturn data.some(hasHandle);\n\t\t}\n\t\treturn isFluidHandle(data);\n\t}\n\tif (hasHandle(chunk.data)) {\n\t\treturn chunk;\n\t}\n\n\t// Confirm JSON compatibility\n\t{\n\t\tassertJsonish(chunk, new Set());\n\t\tconst json = JSON.stringify(chunk);\n\t\tconst parsed = JSON.parse(json);\n\t\t// can't check this due to undefined fields\n\t\t// assert.deepEqual(parsed, chunk);\n\t\t// Instead check that it works properly:\n\t\tconst parsedResult = decode(parsed);\n\t\tassert.deepEqual(parsedResult, result);\n\t}\n\n\treturn chunk;\n}\n\n/**\n * Checks that data is json compatible.\n *\n * This assumes that `undefined` fields are allowed as JSON will omit them.\n * If tolerating undefined fields is not desired, a similar check can be done by round-tripping through json instead.\n */\nfunction assertJsonish(data: unknown, stack: Set<unknown>): void {\n\tswitch (typeof data) {\n\t\tcase \"number\":\n\t\t\tassert(Number.isFinite(data));\n\t\t\tassert(!Object.is(data, -0));\n\t\t\treturn;\n\t\tcase \"string\":\n\t\t// TODO: could test that string is valid unicode here.\n\t\tcase \"boolean\":\n\t\t\treturn;\n\t\tcase \"object\": {\n\t\t\tif (data === null) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tassert(!stack.has(data));\n\t\t\tstack.add(data);\n\t\t\ttry {\n\t\t\t\tif (Array.isArray(data)) {\n\t\t\t\t\tfor (const item of data) {\n\t\t\t\t\t\tassertJsonish(item, stack);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tconst prototype = Reflect.getPrototypeOf(data);\n\t\t\t\tif (prototype !== Object && prototype === null) {\n\t\t\t\t\tfail();\n\t\t\t\t}\n\n\t\t\t\tfor (const key of Reflect.ownKeys(data)) {\n\t\t\t\t\tassert(typeof key === \"string\");\n\t\t\t\t\tconst value = Reflect.get(data, key);\n\t\t\t\t\tif (value !== undefined) {\n\t\t\t\t\t\t// TODO: could check for feature detection pattern, used for IFluidHandle\n\t\t\t\t\t\tassertJsonish(value, stack);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t} finally {\n\t\t\t\tstack.delete(data);\n\t\t\t}\n\t\t}\n\t\tdefault:\n\t\t\tfail();\n\t}\n}\n"]}

package/lib/test/feature-libraries/chunked-forest/codec/chunkCodecUtilities.spec.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=chunkCodecUtilities.spec.d.ts.map

package/lib/test/feature-libraries/chunked-forest/codec/chunkCodecUtilities.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunkCodecUtilities.spec.d.ts","sourceRoot":"","sources":["../../../../../src/test/feature-libraries/chunked-forest/codec/chunkCodecUtilities.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/feature-libraries/chunked-forest/codec/chunkCodecUtilities.spec.js

@@ -1,187 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { Counter, getChecked, jsonMinimizingFilter, readStream, readStreamNumber,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../../feature-libraries/chunked-forest/codec/chunkCodecUtilities.js";
-import { makeArray } from "../../../../util/index.js";
-import { DiscriminatedUnionDispatcher } from "../../../../codec/index.js";
-describe("chunkEncodingUtilities", () => {
-    describe("counter", () => {
-        it("minimal", () => {
-            const counter = new Counter();
-            const emptyTable = counter.buildTable();
-            assert.deepEqual(emptyTable, {
-                valueToIndex: new Map(),
-                indexToValue: [],
-            });
-        });
-        it("usage", () => {
-            const counter = new Counter();
-            counter.add("a", 1);
-            counter.add("b", 3);
-            counter.add("c");
-            counter.add("c");
-            const log = [];
-            const table = counter.buildTable((s, v, c) => {
-                log.push([s, v, c]);
-                return true;
-            });
-            assert.deepEqual(log, [
-                ["b", 0, 3],
-                ["c", 1, 2],
-                ["a", 2, 1],
-            ]);
-            assert.deepEqual(table, {
-                valueToIndex: new Map([
-                    ["b", 0],
-                    ["c", 1],
-                    ["a", 2],
-                ]),
-                indexToValue: ["b", "c", "a"],
-            });
-        });
-        it("filtering", () => {
-            const counter = new Counter();
-            counter.add("a", 1);
-            counter.add("b", 2);
-            counter.add("c", 3);
-            // Filter in
-            {
-                const log = [];
-                const table = counter.buildTable((s, v, c) => {
-                    log.push([s, v, c]);
-                    return true;
-                });
-                assert.deepEqual(log, [
-                    ["c", 0, 3],
-                    ["b", 1, 2],
-                    ["a", 2, 1],
-                ]);
-                assert.deepEqual(table.indexToValue, ["c", "b", "a"]);
-            }
-            // Filter out
-            {
-                const log = [];
-                const table = counter.buildTable((s, v, c) => {
-                    log.push([s, v, c]);
-                    return false;
-                });
-                assert.deepEqual(log, [
-                    ["c", 0, 3],
-                    ["b", 0, 2],
-                    ["a", 0, 1],
-                ]);
-                assert.deepEqual(table.indexToValue, []);
-            }
-            // Filter some
-            {
-                const log = [];
-                const table = counter.buildTable((s, v, c) => {
-                    log.push([s, v, c]);
-                    return s === "b";
-                });
-                assert.deepEqual(log, [
-                    ["c", 0, 3],
-                    ["b", 0, 2],
-                    ["a", 1, 1],
-                ]);
-                assert.deepEqual(table.indexToValue, ["b"]);
-            }
-        });
-    });
-    describe("jsonMinimizingFilter", () => {
-        // Produce actual JSON and confirm jsonMinimizingFilter minimizes for the provided value.
-        function check(s, value, count, require) {
-            const notReplacedObject = { table: ["default"], data: makeArray(count, () => s) };
-            const replacedObject = { table: ["default", s], data: makeArray(count, () => value) };
-            const notReplaced = JSON.stringify(notReplacedObject);
-            const replaced = JSON.stringify(replacedObject);
-            const shouldReplace = replaced.length < notReplaced.length;
-            const result = jsonMinimizingFilter(s, value, count);
-            assert.equal(result, shouldReplace);
-            if (require !== undefined) {
-                assert.equal(result, require);
-            }
-        }
-        it("1 instance is never replaced", () => {
-            check("", 0, 1, false);
-            check("xxx", 0, 1, false);
-            check("x", 10000, 1, false);
-        });
-        it("2 instances replaced iff long enough", () => {
-            // Check that small string is not replaced
-            check("", 0, 2, false);
-            // Check that long string is replaced
-            check("aaaaaaaa", 0, 2, true);
-            // Check that various lengths behave as expected
-            let s = "";
-            for (let index = 0; index < 20; index++) {
-                s = `${s}x`;
-                check(s, 0, 2);
-            }
-        });
-        it("check that escaping is accounted for", () => {
-            check("xx", 100, 5, false);
-            check('""', 100, 5, true);
-        });
-        it("check that value is used properly", () => {
-            check("xx", 1, 5, true);
-            check("xx", 100, 2, false);
-            check("xx", 100, 10, true);
-            check("xx", 1000, 5, false);
-            check("xx", 1000, 10000, false);
-            check("xxx", 1000, 10000, true);
-        });
-    });
-    it("getChecked", () => {
-        assert.throws(() => getChecked([], 0));
-        assert.equal(getChecked([1], 0), 1);
-        assert.throws(() => getChecked([1], 1));
-    });
-    it("stream", () => {
-        assert.throws(() => readStream({ data: [], offset: 0 }));
-        assert.throws(() => readStream({ data: [1], offset: 1 }));
-        assert.throws(() => readStreamNumber({ data: ["x"], offset: 0 }));
-        {
-            const stream = { data: ["x"], offset: 0 };
-            assert.equal(readStream(stream), "x");
-            assert.equal(stream.offset, 1);
-        }
-        {
-            const stream = { data: [5], offset: 0 };
-            assert.equal(readStreamNumber(stream), 5);
-            assert.equal(stream.offset, 1);
-        }
-    });
-    describe("DiscriminatedUnionDispatcher", () => {
-        it("Usage", () => {
-            const log = [];
-            const dispatcher = new DiscriminatedUnionDispatcher({
-                a(v, n) {
-                    log.push([1, v, n]);
-                    return n;
-                },
-                b(v, n) {
-                    log.push([2, v, n]);
-                    return n;
-                },
-                c(v, n) {
-                    log.push([3, v, n]);
-                    return n;
-                },
-            });
-            assert.equal(dispatcher.dispatch({ a: 1 }, 5), 5);
-            assert.equal(dispatcher.dispatch({ b: 2 }, 0), 0);
-            assert.deepEqual(log, [
-                [1, 1, 5],
-                [2, 2, 0],
-            ]);
-            // @ts-expect-error Check that invalid parameters do not compile
-            dispatcher.dispatch({ b: 1 }, 5);
-        });
-    });
-});
-//# sourceMappingURL=chunkCodecUtilities.spec.js.map

package/lib/test/feature-libraries/chunked-forest/codec/chunkCodecUtilities.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunkCodecUtilities.spec.js","sourceRoot":"","sources":["../../../../../src/test/feature-libraries/chunked-forest/codec/chunkCodecUtilities.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EACN,OAAO,EACP,UAAU,EACV,oBAAoB,EACpB,UAAU,EACV,gBAAgB;AAChB,sDAAsD;EACtD,MAAM,2EAA2E,CAAC;AACnF,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AACtD,OAAO,EAAE,4BAA4B,EAAE,MAAM,4BAA4B,CAAC;AAE1E,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACvC,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,OAAO,GAAG,IAAI,OAAO,EAAU,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE;gBAC5B,YAAY,EAAE,IAAI,GAAG,EAAE;gBACvB,YAAY,EAAE,EAAE;aAChB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;YAChB,MAAM,OAAO,GAAG,IAAI,OAAO,EAAU,CAAC;YACtC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEjB,MAAM,GAAG,GAAc,EAAE,CAAC;YAE1B,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC5C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpB,OAAO,IAAI,CAAC;YACb,CAAC,CAAC,CAAC;YAEH,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE;gBACrB,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;aACX,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE;gBACvB,YAAY,EAAE,IAAI,GAAG,CAAC;oBACrB,CAAC,GAAG,EAAE,CAAC,CAAC;oBACR,CAAC,GAAG,EAAE,CAAC,CAAC;oBACR,CAAC,GAAG,EAAE,CAAC,CAAC;iBACR,CAAC;gBACF,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;aAC7B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,WAAW,EAAE,GAAG,EAAE;YACpB,MAAM,OAAO,GAAG,IAAI,OAAO,EAAU,CAAC;YACtC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEpB,YAAY;YACZ;gBACC,MAAM,GAAG,GAAc,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC5C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpB,OAAO,IAAI,CAAC;gBACb,CAAC,CAAC,CAAC;gBAEH,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE;oBACrB,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;oBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;oBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;iBACX,CAAC,CAAC;gBACH,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;aACtD;YAED,aAAa;YACb;gBACC,MAAM,GAAG,GAAc,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC5C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpB,OAAO,KAAK,CAAC;gBACd,CAAC,CAAC,CAAC;gBAEH,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE;oBACrB,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;oBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;oBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;iBACX,CAAC,CAAC;gBACH,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;aACzC;YAED,cAAc;YACd;gBACC,MAAM,GAAG,GAAc,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC5C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpB,OAAO,CAAC,KAAK,GAAG,CAAC;gBAClB,CAAC,CAAC,CAAC;gBAEH,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE;oBACrB,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;oBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;oBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;iBACX,CAAC,CAAC;gBACH,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;aAC5C;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QACrC,yFAAyF;QACzF,SAAS,KAAK,CAAC,CAAS,EAAE,KAAa,EAAE,KAAa,EAAE,OAAiB;YACxE,MAAM,iBAAiB,GAAG,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAClF,MAAM,cAAc,GAAG,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YACtF,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;YACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;YAChD,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;YAC3D,MAAM,MAAM,GAAG,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACrD,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;YACpC,IAAI,OAAO,KAAK,SAAS,EAAE;gBAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;aAC9B;QACF,CAAC;QACD,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACvC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YACvB,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC/C,0CAA0C;YAC1C,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YACvB,qCAAqC;YACrC,KAAK,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAC9B,gDAAgD;YAChD,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE;gBACxC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC;gBACZ,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aACf;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC/C,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC5C,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACxB,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC5B,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAChC,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;QACrB,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAElE;YACC,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;SAC/B;QACD;YACC,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;SAC/B;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;QAC7C,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;YAMhB,MAAM,GAAG,GAA+B,EAAE,CAAC;YAC3C,MAAM,UAAU,GAAG,IAAI,4BAA4B,CAA8B;gBAChF,CAAC,CAAC,CAAI,EAAE,CAAS;oBAChB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpB,OAAO,CAAC,CAAC;gBACV,CAAC;gBACD,CAAC,CAAC,CAAI,EAAE,CAAS;oBAChB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpB,OAAO,CAAC,CAAC;gBACV,CAAC;gBACD,CAAC,CAAC,CAAI,EAAE,CAAS;oBAChB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpB,OAAO,CAAC,CAAC;gBACV,CAAC;aACD,CAAC,CAAC;YAEH,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElD,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE;gBACrB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACT,CAAC,CAAC;YAEH,gEAAgE;YAChE,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\n\nimport {\n\tCounter,\n\tgetChecked,\n\tjsonMinimizingFilter,\n\treadStream,\n\treadStreamNumber,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../../feature-libraries/chunked-forest/codec/chunkCodecUtilities.js\";\nimport { makeArray } from \"../../../../util/index.js\";\nimport { DiscriminatedUnionDispatcher } from \"../../../../codec/index.js\";\n\ndescribe(\"chunkEncodingUtilities\", () => {\n\tdescribe(\"counter\", () => {\n\t\tit(\"minimal\", () => {\n\t\t\tconst counter = new Counter<string>();\n\t\t\tconst emptyTable = counter.buildTable();\n\t\t\tassert.deepEqual(emptyTable, {\n\t\t\t\tvalueToIndex: new Map(),\n\t\t\t\tindexToValue: [],\n\t\t\t});\n\t\t});\n\n\t\tit(\"usage\", () => {\n\t\t\tconst counter = new Counter<string>();\n\t\t\tcounter.add(\"a\", 1);\n\t\t\tcounter.add(\"b\", 3);\n\t\t\tcounter.add(\"c\");\n\t\t\tcounter.add(\"c\");\n\n\t\t\tconst log: unknown[] = [];\n\n\t\t\tconst table = counter.buildTable((s, v, c) => {\n\t\t\t\tlog.push([s, v, c]);\n\t\t\t\treturn true;\n\t\t\t});\n\n\t\t\tassert.deepEqual(log, [\n\t\t\t\t[\"b\", 0, 3],\n\t\t\t\t[\"c\", 1, 2],\n\t\t\t\t[\"a\", 2, 1],\n\t\t\t]);\n\t\t\tassert.deepEqual(table, {\n\t\t\t\tvalueToIndex: new Map([\n\t\t\t\t\t[\"b\", 0],\n\t\t\t\t\t[\"c\", 1],\n\t\t\t\t\t[\"a\", 2],\n\t\t\t\t]),\n\t\t\t\tindexToValue: [\"b\", \"c\", \"a\"],\n\t\t\t});\n\t\t});\n\n\t\tit(\"filtering\", () => {\n\t\t\tconst counter = new Counter<string>();\n\t\t\tcounter.add(\"a\", 1);\n\t\t\tcounter.add(\"b\", 2);\n\t\t\tcounter.add(\"c\", 3);\n\n\t\t\t// Filter in\n\t\t\t{\n\t\t\t\tconst log: unknown[] = [];\n\t\t\t\tconst table = counter.buildTable((s, v, c) => {\n\t\t\t\t\tlog.push([s, v, c]);\n\t\t\t\t\treturn true;\n\t\t\t\t});\n\n\t\t\t\tassert.deepEqual(log, [\n\t\t\t\t\t[\"c\", 0, 3],\n\t\t\t\t\t[\"b\", 1, 2],\n\t\t\t\t\t[\"a\", 2, 1],\n\t\t\t\t]);\n\t\t\t\tassert.deepEqual(table.indexToValue, [\"c\", \"b\", \"a\"]);\n\t\t\t}\n\n\t\t\t// Filter out\n\t\t\t{\n\t\t\t\tconst log: unknown[] = [];\n\t\t\t\tconst table = counter.buildTable((s, v, c) => {\n\t\t\t\t\tlog.push([s, v, c]);\n\t\t\t\t\treturn false;\n\t\t\t\t});\n\n\t\t\t\tassert.deepEqual(log, [\n\t\t\t\t\t[\"c\", 0, 3],\n\t\t\t\t\t[\"b\", 0, 2],\n\t\t\t\t\t[\"a\", 0, 1],\n\t\t\t\t]);\n\t\t\t\tassert.deepEqual(table.indexToValue, []);\n\t\t\t}\n\n\t\t\t// Filter some\n\t\t\t{\n\t\t\t\tconst log: unknown[] = [];\n\t\t\t\tconst table = counter.buildTable((s, v, c) => {\n\t\t\t\t\tlog.push([s, v, c]);\n\t\t\t\t\treturn s === \"b\";\n\t\t\t\t});\n\n\t\t\t\tassert.deepEqual(log, [\n\t\t\t\t\t[\"c\", 0, 3],\n\t\t\t\t\t[\"b\", 0, 2],\n\t\t\t\t\t[\"a\", 1, 1],\n\t\t\t\t]);\n\t\t\t\tassert.deepEqual(table.indexToValue, [\"b\"]);\n\t\t\t}\n\t\t});\n\t});\n\n\tdescribe(\"jsonMinimizingFilter\", () => {\n\t\t// Produce actual JSON and confirm jsonMinimizingFilter minimizes for the provided value.\n\t\tfunction check(s: string, value: number, count: number, require?: boolean): void {\n\t\t\tconst notReplacedObject = { table: [\"default\"], data: makeArray(count, () => s) };\n\t\t\tconst replacedObject = { table: [\"default\", s], data: makeArray(count, () => value) };\n\t\t\tconst notReplaced = JSON.stringify(notReplacedObject);\n\t\t\tconst replaced = JSON.stringify(replacedObject);\n\t\t\tconst shouldReplace = replaced.length < notReplaced.length;\n\t\t\tconst result = jsonMinimizingFilter(s, value, count);\n\t\t\tassert.equal(result, shouldReplace);\n\t\t\tif (require !== undefined) {\n\t\t\t\tassert.equal(result, require);\n\t\t\t}\n\t\t}\n\t\tit(\"1 instance is never replaced\", () => {\n\t\t\tcheck(\"\", 0, 1, false);\n\t\t\tcheck(\"xxx\", 0, 1, false);\n\t\t\tcheck(\"x\", 10000, 1, false);\n\t\t});\n\t\tit(\"2 instances replaced iff long enough\", () => {\n\t\t\t// Check that small string is not replaced\n\t\t\tcheck(\"\", 0, 2, false);\n\t\t\t// Check that long string is replaced\n\t\t\tcheck(\"aaaaaaaa\", 0, 2, true);\n\t\t\t// Check that various lengths behave as expected\n\t\t\tlet s = \"\";\n\t\t\tfor (let index = 0; index < 20; index++) {\n\t\t\t\ts = `${s}x`;\n\t\t\t\tcheck(s, 0, 2);\n\t\t\t}\n\t\t});\n\n\t\tit(\"check that escaping is accounted for\", () => {\n\t\t\tcheck(\"xx\", 100, 5, false);\n\t\t\tcheck('\"\"', 100, 5, true);\n\t\t});\n\n\t\tit(\"check that value is used properly\", () => {\n\t\t\tcheck(\"xx\", 1, 5, true);\n\t\t\tcheck(\"xx\", 100, 2, false);\n\t\t\tcheck(\"xx\", 100, 10, true);\n\t\t\tcheck(\"xx\", 1000, 5, false);\n\t\t\tcheck(\"xx\", 1000, 10000, false);\n\t\t\tcheck(\"xxx\", 1000, 10000, true);\n\t\t});\n\t});\n\n\tit(\"getChecked\", () => {\n\t\tassert.throws(() => getChecked([], 0));\n\t\tassert.equal(getChecked([1], 0), 1);\n\t\tassert.throws(() => getChecked([1], 1));\n\t});\n\n\tit(\"stream\", () => {\n\t\tassert.throws(() => readStream({ data: [], offset: 0 }));\n\t\tassert.throws(() => readStream({ data: [1], offset: 1 }));\n\t\tassert.throws(() => readStreamNumber({ data: [\"x\"], offset: 0 }));\n\n\t\t{\n\t\t\tconst stream = { data: [\"x\"], offset: 0 };\n\t\t\tassert.equal(readStream(stream), \"x\");\n\t\t\tassert.equal(stream.offset, 1);\n\t\t}\n\t\t{\n\t\t\tconst stream = { data: [5], offset: 0 };\n\t\t\tassert.equal(readStreamNumber(stream), 5);\n\t\t\tassert.equal(stream.offset, 1);\n\t\t}\n\t});\n\n\tdescribe(\"DiscriminatedUnionDispatcher\", () => {\n\t\tit(\"Usage\", () => {\n\t\t\tinterface TestUnion {\n\t\t\t\ta?: 1;\n\t\t\t\tb?: 2;\n\t\t\t\tc?: 3;\n\t\t\t}\n\t\t\tconst log: [number, number, number][] = [];\n\t\t\tconst dispatcher = new DiscriminatedUnionDispatcher<TestUnion, [number], number>({\n\t\t\t\ta(v: 1, n: number): number {\n\t\t\t\t\tlog.push([1, v, n]);\n\t\t\t\t\treturn n;\n\t\t\t\t},\n\t\t\t\tb(v: 2, n: number): number {\n\t\t\t\t\tlog.push([2, v, n]);\n\t\t\t\t\treturn n;\n\t\t\t\t},\n\t\t\t\tc(v: 3, n: number): number {\n\t\t\t\t\tlog.push([3, v, n]);\n\t\t\t\t\treturn n;\n\t\t\t\t},\n\t\t\t});\n\n\t\t\tassert.equal(dispatcher.dispatch({ a: 1 }, 5), 5);\n\t\t\tassert.equal(dispatcher.dispatch({ b: 2 }, 0), 0);\n\n\t\t\tassert.deepEqual(log, [\n\t\t\t\t[1, 1, 5],\n\t\t\t\t[2, 2, 0],\n\t\t\t]);\n\n\t\t\t// @ts-expect-error Check that invalid parameters do not compile\n\t\t\tdispatcher.dispatch({ b: 1 }, 5);\n\t\t});\n\t});\n});\n"]}

package/lib/test/feature-libraries/chunked-forest/codec/chunkDecoding.spec.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=chunkDecoding.spec.d.ts.map

package/lib/test/feature-libraries/chunked-forest/codec/chunkDecoding.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunkDecoding.spec.d.ts","sourceRoot":"","sources":["../../../../../src/test/feature-libraries/chunked-forest/codec/chunkDecoding.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}