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

package/lib/test/cursorTestSuite.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cursorTestSuite.js","sourceRoot":"","sources":["../../src/test/cursorTestSuite.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EACN,sBAAsB,EACtB,yBAAyB,EACzB,UAAU,EACV,eAAe,EACf,GAAG,EACH,UAAU,EACV,iBAAiB,EACjB,eAAe,GACf,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAEN,QAAQ,EAIR,YAAY,EACZ,mBAAmB,EAEnB,mBAAmB,GAGnB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAErE,MAAM,aAAa,GAAG,IAAI,iBAAiB,CAAC,UAAU,CAAC,QAAQ,EAAE;IAChE,KAAK,EAAE,mBAAmB;IAC1B,SAAS,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;CACzB,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;AACpE,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;AAChE,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;AAChE,MAAM,CAAC,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CACzC,KAAK,EACL,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAClD,CAAC;AACF,0BAA0B;AAC1B,MAAM,CAAC,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE;IAC1D,KAAK,EAAE,IAAI,CAAC,MAAM;CAClB,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,cAAc,GAAG,aAAa,CAAC,UAAU,CACrD,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAClD,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAiD;IACtE,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC;IACvC,CAAC,cAAc,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAC1D,CAAC,eAAe,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC5D,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,gBAAgB,GAAG,CAAC,EAAE,CAAC;IAC3E,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IACrD,CAAC,gCAAgC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC;IACtF,CAAC,sBAAsB,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACjE;QACC,OAAO;QACP;YACC,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE;SACjF;KACD;IACD;QACC,iBAAiB;QACjB;YACC,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE;gBACP,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC;gBAC/B,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC;aAChC;SACD;KACD;IACD;QACC,eAAe;QACf;YACC,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE;gBACP,CAAC,EAAE;oBACF;wBACC,IAAI,EAAE,SAAS,CAAC,IAAI;wBACpB,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE;qBAC3C;iBACD;aACD;SACD;KACD;IACD;QACC,SAAS;QACT;YACC,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE;gBACP,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC;gBAC7B,CAAC,EAAE;oBACF;wBACC,IAAI,EAAE,SAAS,CAAC,IAAI;wBACpB,MAAM,EAAE;4BACP,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;yBACzC;qBACD;iBACD;aACD;SACD;KACD;IACD;QACC,yBAAyB;QACzB;YACC,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE;gBACP,CAAC,EAAE;oBACF;wBACC,IAAI,EAAE,SAAS,CAAC,IAAI;wBACpB,iDAAiD;wBACjD,oDAAoD;wBACpD,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE;qBAC5C;oBACD,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;iBAC3B;aACD;SACD;KACD;IACD;QACC,oBAAoB;QACpB;YACC,IAAI,EAAE,YAAY,CAAC,IAAI;YACvB,MAAM,EAAE;gBACP,KAAK,EAAE;oBACN;wBACC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;wBACtB,KAAK,EAAE,CAAC;qBACR;iBACD;aACD;SACD;KACD;IACD;QACC,eAAe;QACf;YACC,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE;gBACP,CAAC,EAAE;oBACF,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;oBAC3B;wBACC,IAAI,EAAE,YAAY,CAAC,IAAI;wBACvB,MAAM,EAAE;4BACP,KAAK,EAAE;gCACN;oCACC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;oCACtB,KAAK,EAAE,CAAC;iCACR;6BACD;yBACD;qBACD;oBACD,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;iBAC3B;aACD;SACD;KACD;IACD;QACC,iBAAiB;QACjB;YACC,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE;gBACP,CAAC,EAAE;oBACF,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;oBAC3B,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;oBAC3B,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;oBAC3B,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;oBAC3B,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;oBAC3B,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;oBAC3B,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE;oBACpC,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE;iBAC3B;aACD;SACD;KACD;CACD,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,4BAA4B,CAC3C,UAAkB,EAClB,aAAuC,EACvC,cAA8C,EAC9C,SAAgB;IAEhB,SAAS,oBAAoB,CAAC,IAAkB;QAC/C,wCAAwC;QACxC,OAAO,cAAc,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,cAAc,CAAiB;QAC9B,UAAU;QACV,aAAa;QACb,QAAQ,EAAE,oBAAoB;QAC9B,cAAc;QACd,QAAQ,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1C,IAAI;YACJ,WAAW,EAAE,GAAG,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;YAC7C,QAAQ,EAAE,IAAI;SACd,CAAC,CAAC;QACH,SAAS;KACT,CAAC,CAAC;AACJ,CAAC;AA2BD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,qBAAqB,CAAqC,MAMzE;IACA,OAAO,cAAc,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,0BAA0B,CAAqC,MAM9E;IACA,mGAAmG;IACnG,MAAM,QAAQ,GAAgC,MAAM,CAAC,QAAQ,CAAC,OAAO,CACpE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE;QAC1C,MAAM,GAAG,GAAgC,EAAE,CAAC;QAC5C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACtD,GAAG,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI;gBAC/D,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC;gBACzC,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC;gBAC3B,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,EAAE;aAC1E,CAAC,CAAC;SACH;QACD,OAAO,GAAG,CAAC;IACZ,CAAC,CACD,CAAC;IAEF,OAAO,QAAQ,CAAC,GAAG,MAAM,CAAC,UAAU,mCAAmC,EAAE,GAAG,EAAE;QAC7E,mDAAmD;QACnD,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAChC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACnC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE;oBAClB,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;oBACxD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,oCAA4B,CAAC;oBACrD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;oBAC7D,mBAAmB,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxC,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,6DAA6D;QAC7D,cAAc,CAA2B;YACxC,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,QAAQ,EAAE;gBACT,QAAQ,EACP,MAAM,CAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS;oBACrC,CAAC,CAAC,gFAAgF;wBAChF,oEAAoE;wBACpE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAS,CAAC,IAAI,CAAC,CAAC;oBAChD,CAAC,CAAC,SAAS;aACb;YACD,aAAa,EAAE,CAAC,IAAqB,EAAW,EAAE;gBACjD,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,OAAO,MAAM,CAAC;YACf,CAAC;YACD,QAAQ;YACR,SAAS,EAAE,IAAI;SACf,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,SAAS,GAAa,KAAK,CAAC,WAAW,CAAC,CAAC;AAC/C,MAAM,QAAQ,GAAwB;IACrC,4DAA4D;IAC5D,KAAK,CAAC,WAAW,CAAC;IAClB,KAAK,CAAC,UAAU,CAAC;IACjB,KAAK,CAAC,SAAS,CAAC;IAChB,KAAK,CAAC,gBAAgB,CAAC;IACvB,iGAAiG;IACjG,KAAK,CAAC,GAAG,CAAC;IACV,KAAK,CAAC,IAAI,CAAC;IACX,KAAK,CAAC,KAAK,CAAC;IACZ,iBAAiB;IACjB,QAAQ;IACR,YAAY;IACZ,SAAS;CACT,CAAC;AAEF;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,cAAc,CAAqC,MAO3D;IACA,MAAM,EACL,UAAU,EACV,aAAa,EACb,cAAc,EACd,QAAQ,EACR,SAAS,EACT,QAAQ,EAAE,OAAO,GACjB,GAAG,MAAM,CAAC;IAEX,MAAM,oBAAoB,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC;IAC/E,MAAM,QAAQ,GACb,OAAO,OAAO,KAAK,QAAQ;QAC1B,CAAC,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS;YAC/B,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QAC1C,CAAC,CAAC,CAAC,IAAgB,EAAE,EAAE;YACrB,MAAM,IAAI,GAAiB;gBAC1B,IAAI,EAAE,SAAS,CAAC,IAAI;aACpB,CAAC;YACF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;gBACvB,MAAM,KAAK,GAAiB;oBAC3B,IAAI,EAAE,WAAW,CAAC,IAAI;iBACtB,CAAC;gBACF,mBAAmB,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;aACxC;YACD,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC,CAAC;IAEN,MAAM,MAAM,GAAG,CAAC,SAAS;QACxB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC;YACA,MAAM,EAAE,SAAS;YACjB,WAAW,EAAE,YAAY;YACzB,WAAW,EAAE,CAAC;SACb,CAAC;IAEL,OAAO,QAAQ,CAAC,GAAG,UAAU,wBAAwB,EAAE,GAAG,EAAE;QAC3D,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;YAC3B,KAAK,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,QAAQ,EAAE;gBAC9D,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE;oBACnB,IAAI,IAAW,CAAC;oBAChB,MAAM,CAAC,GAAG,EAAE;wBACX,IAAI,GAAG,WAAW,EAAE,CAAC;oBACtB,CAAC,CAAC,CAAC;oBACH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;wBACjC,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;wBACnC,MAAM,aAAa,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC;wBACrD,sDAAsD;wBACtD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;wBAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;wBAChC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;oBACzC,CAAC,CAAC,CAAC;oBAEH,EAAE,CAAC,WAAW,EAAE,GAAG,EAAE;wBACpB,cAAc,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,MAAM,CAAC,CAAC;oBACrD,CAAC,CAAC,CAAC;oBAEH,IAAI,SAAS,KAAK,SAAS,EAAE;wBAC5B,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;4BAC3B,IAAI,oBAAoB,KAAK,SAAS,EAAE;gCACvC,MAAM,SAAS,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;gCAClD,6CAA6C;gCAC7C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;6BAClC;4BAED,MAAM,KAAK,GAAG,sBAAsB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;4BAC1D,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;wBACpC,CAAC,CAAC,CAAC;qBACH;oBAED,IAAI,cAAc,KAAK,SAAS,EAAE;wBACjC,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;4BACxC,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;4BACnC,MAAM,gBAAgB,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;4BAChD,yCAAyC;4BACzC,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;wBAC1C,CAAC,CAAC,CAAC;qBACH;oBAED,IAAI,oBAAoB,KAAK,SAAS,EAAE;wBACvC,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;4BAC9C,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;4BACnC,MAAM,aAAa,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC;4BACrD,MAAM,SAAS,GAAG,oBAAoB,CAAC,aAAa,CAAC,CAAC;4BACtD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;wBACnC,CAAC,CAAC,CAAC;qBACH;gBACF,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,uFAAuF;QACvF,IAAI,oBAAoB,KAAK,SAAS,EAAE;YACvC,MAAM,OAAO,GAAG,CAAC,IAAkB,EAAe,EAAE;gBACnD,OAAO,aAAa,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC;YAClD,CAAC,CAAC;YAEF,oHAAoH;YACpH,IAAI,CAAC,SAAS,EAAE;gBACf,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;oBACvB,MAAM,MAAM,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;oBACnD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE;wBAClB,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACnB,CAAC,CAAC,CAAC;gBACJ,CAAC,CAAC,CAAC;aACH;YACD,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;gBAC7C,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;oBAClB,MAAM,MAAM,GAAG,OAAO,CAAC;wBACtB,IAAI,EAAE,WAAW,CAAC,IAAI;qBACtB,CAAC,CAAC;oBACH,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;gBAC5C,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;oBACrC,MAAM,MAAM,GAAG,OAAO,CAAC;wBACtB,IAAI,EAAE,WAAW,CAAC,IAAI;qBACtB,CAAC,CAAC;oBACH,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;oBAChC,qBAAqB,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE;wBAC5C,MAAM;wBACN,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;qBACnB,CAAC,CAAC;gBACJ,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;oBACrC,MAAM,MAAM,GAAG,OAAO,CAAC;wBACtB,IAAI,EAAE,SAAS,CAAC,IAAI;wBACpB,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE;qBACvD,CAAC,CAAC;oBACH,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;oBAChC,MAAM,CAAC,SAAS,EAAE,CAAC;oBACnB,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE;wBAClC,MAAM;wBACN,WAAW,EAAE,KAAK,CAAW,KAAK,CAAC;wBACnC,WAAW,EAAE,CAAC;qBACd,CAAC,CAAC;gBACJ,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;oBAC/B,MAAM,MAAM,GAAG,OAAO,CAAC;wBACtB,IAAI,EAAE,SAAS,CAAC,IAAI;wBACpB,MAAM,EAAE;4BACP,GAAG,EAAE;gCACJ,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE;gCACpC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE;6BACpC;yBACD;qBACD,CAAC,CAAC;oBACH,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;oBAChC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACpB,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE;wBAClC,MAAM;wBACN,WAAW,EAAE,KAAK,CAAW,KAAK,CAAC;wBACnC,WAAW,EAAE,CAAC;qBACd,CAAC,CAAC;gBACJ,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;oBAC5B,MAAM,MAAM,GAAG,OAAO,CAAC;wBACtB,IAAI,EAAE,SAAS,CAAC,IAAI;wBACpB,MAAM,EAAE;4BACP,CAAC,EAAE;gCACF;oCACC,IAAI,EAAE,SAAS,CAAC,IAAI;oCACpB,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE;iCACpD;gCACD;oCACC,IAAI,EAAE,SAAS,CAAC,IAAI;oCACpB,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE;iCACpD;6BACD;yBACD;qBACD,CAAC,CAAC;oBACH,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC9B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACpB,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;oBAC5B,MAAM,WAAW,GAAW;wBAC3B,MAAM;wBACN,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;wBACvB,WAAW,EAAE,CAAC;qBACd,CAAC;oBACF,qBAAqB,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE;wBAC5C,MAAM,EAAE,WAAW;wBACnB,KAAK,EAAE,QAAQ;qBACf,CAAC,CAAC;oBACH,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACpB,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE;wBAClC,MAAM,EAAE,WAAW;wBACnB,WAAW,EAAE,QAAQ;wBACrB,WAAW,EAAE,CAAC;qBACd,CAAC,CAAC;gBACJ,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;SACH;QACD,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC3B,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;gBAC1B,MAAM,YAAY,GAAa,KAAK,CAAC,WAAW,CAAC,CAAC;gBAClD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;oBAC3B,EAAE,CAAC,8BAA8B,GAAG,CAAC,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE;wBACvD,oDAAoD;wBACpD,MAAM,KAAK,GAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;wBAChE,8DAA8D;wBAC9D,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;wBAErC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;4BACzB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;4BACnC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;4BACvB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;yBACzC;oBACF,CAAC,CAAC,CAAC;oBAEH,MAAM,WAAW,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAE1C,IAAI,WAAW,KAAK,SAAS,EAAE;wBAC9B,EAAE,CAAC,2BAA2B,GAAG,CAAC,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE;4BACpD,MAAM,WAAW,GAAG,WAAW,EAAE,CAAC;4BAClC,MAAM,MAAM,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;4BAC1C,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;4BACvB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;4BACzC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBACrB,CAAC,CAAC,CAAC;wBAEH,EAAE,CAAC,uBAAuB,GAAG,CAAC,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE;4BAChD,MAAM,WAAW,GAAG,WAAW,EAAE,CAAC;4BAClC,MAAM,MAAM,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;4BAC1C,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;wBAChC,CAAC,CAAC,CAAC;qBACH;iBACD;YACF,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;gBAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAC1B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;gBACnC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;gBACpC,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;oBAClB,MAAM,IAAI,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC1B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;oBACnC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;oBAE3C,MAAM,YAAY,GAAW;wBAC5B,MAAM,EAAE,SAAS;wBACjB,WAAW,EAAE,KAAK,CAAC,mBAAmB,CAAC;wBACvC,WAAW,EAAE,CAAC;qBACd,CAAC;oBAEF,MAAM,QAAQ,GAAmC;wBAChD,SAAS;wBACT,EAAE;wBACF,EAAE,WAAW,EAAE,EAAE,EAAE,iBAAiB,EAAE,QAAQ,EAAE;wBAChD,EAAE,MAAM,EAAE,YAAY,EAAE;qBACxB,CAAC;oBAEF,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;wBAC9B,uEAAuE;wBACvE,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;qBACrE;oBAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;oBACtC,MAAM,CACL,mBAAmB,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE;wBAC1C,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC;wBACzB,MAAM;qBACN,CAAC,CACF,CAAC;oBAEF,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;wBAC9B,MAAM,CACL,mBAAmB,CAClB,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,EAC3B,eAAe,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC,CAC9D,CACD,CAAC;qBACF;gBACF,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,MAAmB,EAAE,YAAgC;IAC5E,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,mCAA2B,CAAC;IACpD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACpC,kEAAkE;IAClE,MAAM,iBAAiB,GAAG,MAAM,CAAC,KAAK,CAAC;IACvC,MAAM,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC;IAErC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;IAC9B,gBAAgB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAErC,MAAM,YAAY,GAA0B,IAAI,GAAG,EAAE,CAAC;IAEtD,KAAK,IAAI,OAAO,GAAY,MAAM,CAAC,UAAU,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE;QACvF,MAAM,mBAAmB,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;QACpD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QACjC,MAAM,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,mBAAmB,CAAC,CAAC;QACpD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,mBAAmB,CAAC,CAAC;QAC5D,MAAM,CAAC,mBAAmB,GAAG,CAAC,EAAE,yDAAyD,CAAC,CAAC;QAC3F,mBAAmB,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;KAC1D;IAED,kDAAkD;IAClD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;QAC3B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YAC3B,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;SACzB;KACD;IAED,4BAA4B;IAC5B,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,YAAY,EAAE;QACzC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,mCAA2B,CAAC;QACpD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,oCAA4B,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,GAAG,CAAC,CAAC;QACxC,MAAM,CAAC,SAAS,EAAE,CAAC;QAEnB,6FAA6F;QAC7F,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE;YACvB,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACpC,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,CAAC;YACvB,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,SAAS,EAAE,CAAC;SACnB;KACD;IAED,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,mCAA2B,CAAC;IACpD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC;IAC9C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAmB,EAAE,YAAyB;IACjF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,oCAA4B,CAAC;IACrD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACpC,MAAM,mBAAmB,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;IACpD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACjC,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,YAAY,CAAC,CAAC,CAAC;IAEjE,8DAA8D;IAC9D,IAAI,yBAAyB,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE;QACzE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,yBAAyB,CAAC,CAAC;QAC3D,MAAM,CAAC,MAAM,CAAC,UAAU,IAAI,yBAAyB,CAAC,CAAC;QACvD,MAAM,CAAC,MAAM,CAAC,WAAW,GAAG,yBAAyB,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QAC3E,MAAM,CAAC,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,UAAU,IAAI,mBAAmB,CAAC,CAAC;QAEtE,8DAA8D;QAC9D,yFAAyF;QACzF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,yBAAyB,CAAC,CAAC;QAC3D,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC5B,MAAM,CAAC,SAAS,EAAE,CAAC;QACnB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,yBAAyB,CAAC,CAAC;QAC3D,IAAI,MAAM,CAAC,UAAU,EAAE,EAAE;YACxB,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,CAAC,SAAS,EAAE,CAAC;SACnB;QACD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,yBAAyB,CAAC,CAAC;QAC3D,yBAAyB,EAAE,CAAC;KAC5B;IAED,MAAM,CAAC,KAAK,CACX,yBAAyB,EACzB,mBAAmB,EACnB,8CAA8C,CAC9C,CAAC;IAEF,6BAA6B;IAC7B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,mBAAmB,EAAE,KAAK,EAAE,EAAE;QACzD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,oCAA4B,CAAC;QACrD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,mCAA2B,CAAC;QACpD,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,oCAA4B,CAAC;QAErD,4BAA4B;QAC5B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACvC,qCAAqC;QACrC,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC3C,gCAAgC;YAChC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;SACvC;QACD,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,oCAA4B,CAAC;QAErD,4BAA4B;QAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,mBAAmB,GAAG,KAAK,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAEpD,oCAAoC;QACpC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC;KACpD;IAED,4DAA4D;IAC5D,MAAM,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,CAAC;IACnC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,GAAG,CAAC,CAAC;IAExC,wBAAwB;IACxB,yBAAyB,GAAG,CAAC,CAAC;IAC9B,KAAK,IAAI,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE;QACzE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,yBAAyB,CAAC,CAAC;QAC3D,cAAc,CAAC,MAAM,EAAE;YACtB,MAAM,EAAE,YAAY,CAAC,MAAM;YAC3B,WAAW,EAAE,YAAY,CAAC,KAAK;YAC/B,WAAW,EAAE,yBAAyB;SACtC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,yBAAyB,CAAC,CAAC;QAC3D,yBAAyB,EAAE,CAAC;KAC5B;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 } from \"assert\";\nimport {\n\tjsonableTreeFromCursor,\n\tcursorForJsonableTreeNode,\n\tprefixPath,\n\tprefixFieldPath,\n\tAny,\n\tFieldKinds,\n\tSchemaBuilderBase,\n\tFlexFieldSchema,\n} from \"../feature-libraries/index.js\";\nimport {\n\tFieldKey,\n\tEmptyKey,\n\tJsonableTree,\n\tITreeCursor,\n\tCursorLocationType,\n\trootFieldKey,\n\tsetGenericTreeField,\n\tUpPath,\n\tcompareFieldUpPaths,\n\tFieldUpPath,\n\tPathRootPrefix,\n} from \"../core/index.js\";\nimport { brand } from \"../util/index.js\";\nimport { leaf } from \"../domains/index.js\";\nimport { expectEqualFieldPaths, expectEqualPaths } from \"./utils.js\";\n\nconst schemaBuilder = new SchemaBuilderBase(FieldKinds.required, {\n\tscope: \"Cursor Test Suite\",\n\tlibraries: [leaf.library],\n});\n\nexport const emptySchema = schemaBuilder.object(\"Empty object\", {});\nconst emptySchema2 = schemaBuilder.object(\"Empty object 2\", {});\nconst emptySchema3 = schemaBuilder.object(\"Empty object 3\", {});\nexport const mapSchema = schemaBuilder.map(\n\t\"Map\",\n\tFlexFieldSchema.create(FieldKinds.sequence, [Any]),\n);\n// object with fixed shape\nexport const objectSchema = schemaBuilder.object(\"object\", {\n\tchild: leaf.number,\n});\n\nexport const testTreeSchema = schemaBuilder.intoSchema(\n\tFlexFieldSchema.create(FieldKinds.sequence, [Any]),\n);\n\nexport const testTrees: readonly (readonly [string, JsonableTree])[] = [\n\t[\"minimal\", { type: emptySchema.name }],\n\t[\"true boolean\", { type: leaf.boolean.name, value: true }],\n\t[\"false boolean\", { type: leaf.boolean.name, value: false }],\n\t[\"integer\", { type: leaf.number.name, value: Number.MIN_SAFE_INTEGER - 1 }],\n\t[\"string\", { type: leaf.string.name, value: \"test\" }],\n\t[\"string with escaped characters\", { type: leaf.string.name, value: '\\\\\"\\b\\f\\n\\r\\t' }],\n\t[\"string with emoticon\", { type: leaf.string.name, value: \"😀\" }],\n\t[\n\t\t\"field\",\n\t\t{\n\t\t\ttype: mapSchema.name,\n\t\t\tfields: { x: [{ type: emptySchema.name }, { type: leaf.number.name, value: 6 }] },\n\t\t},\n\t],\n\t[\n\t\t\"multiple fields\",\n\t\t{\n\t\t\ttype: mapSchema.name,\n\t\t\tfields: {\n\t\t\t\ta: [{ type: emptySchema.name }],\n\t\t\t\tb: [{ type: emptySchema2.name }],\n\t\t\t},\n\t\t},\n\t],\n\t[\n\t\t\"double nested\",\n\t\t{\n\t\t\ttype: mapSchema.name,\n\t\t\tfields: {\n\t\t\t\ta: [\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t\tfields: { b: [{ type: emptySchema.name }] },\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t},\n\t],\n\t[\n\t\t\"complex\",\n\t\t{\n\t\t\ttype: mapSchema.name,\n\t\t\tfields: {\n\t\t\t\ta: [{ type: mapSchema.name }],\n\t\t\t\tb: [\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t\tfields: {\n\t\t\t\t\t\t\tc: [{ type: leaf.number.name, value: 6 }],\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t},\n\t],\n\t[\n\t\t\"siblings restored on up\",\n\t\t{\n\t\t\ttype: mapSchema.name,\n\t\t\tfields: {\n\t\t\t\tX: [\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t\t// Inner node so that when navigating up from it,\n\t\t\t\t\t\t// The cursor's siblings value needs to be restored.\n\t\t\t\t\t\tfields: { q: [{ type: emptySchema2.name }] },\n\t\t\t\t\t},\n\t\t\t\t\t{ type: emptySchema3.name },\n\t\t\t\t],\n\t\t\t},\n\t\t},\n\t],\n\t[\n\t\t\"fixed shape object\",\n\t\t{\n\t\t\ttype: objectSchema.name,\n\t\t\tfields: {\n\t\t\t\tchild: [\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: leaf.number.name,\n\t\t\t\t\t\tvalue: 1,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t},\n\t],\n\t[\n\t\t\"nested object\",\n\t\t{\n\t\t\ttype: mapSchema.name,\n\t\t\tfields: {\n\t\t\t\tX: [\n\t\t\t\t\t{ type: emptySchema2.name },\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: objectSchema.name,\n\t\t\t\t\t\tfields: {\n\t\t\t\t\t\t\tchild: [\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\ttype: leaf.number.name,\n\t\t\t\t\t\t\t\t\tvalue: 1,\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t\t{ type: emptySchema3.name },\n\t\t\t\t],\n\t\t\t},\n\t\t},\n\t],\n\t[\n\t\t\"longer sequence\",\n\t\t{\n\t\t\ttype: mapSchema.name,\n\t\t\tfields: {\n\t\t\t\tX: [\n\t\t\t\t\t{ type: emptySchema3.name },\n\t\t\t\t\t{ type: emptySchema3.name },\n\t\t\t\t\t{ type: emptySchema2.name },\n\t\t\t\t\t{ type: emptySchema3.name },\n\t\t\t\t\t{ type: emptySchema3.name },\n\t\t\t\t\t{ type: emptySchema3.name },\n\t\t\t\t\t{ type: leaf.number.name, value: 1 },\n\t\t\t\t\t{ type: emptySchema3.name },\n\t\t\t\t],\n\t\t\t},\n\t\t},\n\t],\n];\n\n/**\n * Tests a cursor implementation.\n * This test suite has a built in set of test cases (based on `testTrees`), so the provided cursor implementation must support all tree contents\n * (not just some specific domain).\n * More specialized cursor implementations should use `testTreeCursor` instead.\n *\n * @param cursorName - The name of the cursor used as part of the test suite name.\n * @param cursorFactory - Creates the cursor to be tested from the provided `TData`.\n * @param dataFromCursor - Constructs a `TData` from the provided cursor (which might not be a `TCursor`).\n * @param extraRoot - setting this to `true` makes the tests expect that `cursorFactory` includes a dummy node above the root,\n * with the data under {@link rootFieldKey}.\n *\n * @typeParam TData - Format which the cursor reads. Must be JSON compatible.\n * @typeParam TCursor - Type of the cursor being tested.\n */\nexport function testGeneralPurposeTreeCursor<TData, TCursor extends ITreeCursor>(\n\tcursorName: string,\n\tcursorFactory: (data: TData) => TCursor,\n\tdataFromCursor: (cursor: ITreeCursor) => TData,\n\textraRoot?: true,\n): void {\n\tfunction dataFromJsonableTree(data: JsonableTree): TData {\n\t\t// Use text cursor to provide input data\n\t\treturn dataFromCursor(cursorForJsonableTreeNode(data));\n\t}\n\n\ttestTreeCursor<TData, TCursor>({\n\t\tcursorName,\n\t\tcursorFactory,\n\t\tbuilders: dataFromJsonableTree,\n\t\tdataFromCursor,\n\t\ttestData: testTrees.map(([name, data]) => ({\n\t\t\tname,\n\t\t\tdataFactory: () => dataFromJsonableTree(data),\n\t\t\texpected: data,\n\t\t})),\n\t\textraRoot,\n\t});\n}\n\n/**\n * Collection of builders for special cases.\n */\nexport interface SpecialCaseBuilder<TData> {\n\t/**\n\t * Build data for a tree which has the provided keys on its root node.\n\t * The content of the tree under these keys is arbitrary and up to the implementation.\n\t */\n\twithKeys?(keys: FieldKey[]): TData;\n}\n\nexport interface TestTree<TData> {\n\treadonly name: string;\n\treadonly dataFactory: () => TData;\n\treadonly reference?: JsonableTree;\n\treadonly path?: UpPath;\n}\n\nexport interface TestField<TData> {\n\treadonly name: string;\n\treadonly dataFactory: () => TData;\n\treadonly reference: JsonableTree[];\n\treadonly path: FieldUpPath;\n}\n\n/**\n * Tests a cursor implementation that is rooted at a node.\n * Prefer using `testGeneralPurposeTreeCursor` when possible:\n * `testTreeCursor` should only be used when testing a cursor that is not truly general purpose (can not be build from any arbitrary tree).\n *\n * @param cursorName - The name of the cursor used as part of the test suite name.\n * @param builders - a collection of optional `TData` builders. The more of these are provided, the larger the test suite will be.\n * If provided with a JsonableTree, it will either be from testData or comply with testTreeSchema.\n * @param cursorFactory - Creates the cursor to be tested from the provided `TData`.\n * @param dataFromCursor - Constructs a `TData` from the provided cursor (which might not be a `TCursor`).\n * @param testData - A collection of test cases to evaluate the cursor with. Actual content of the tree is only validated if a `reference` is provided:\n * otherwise only basic traversal and API consistency will be checked.\n *\n * @typeParam TData - Format which the cursor reads. Must be JSON compatible.\n * @typeParam TCursor - Type of the cursor being tested.\n */\nexport function testSpecializedCursor<TData, TCursor extends ITreeCursor>(config: {\n\tcursorName: string;\n\tbuilders: SpecialCaseBuilder<TData>;\n\tcursorFactory: (data: TData) => TCursor;\n\tdataFromCursor?: (cursor: ITreeCursor) => TData;\n\ttestData: readonly TestTree<TData>[];\n}): Mocha.Suite {\n\treturn testTreeCursor(config);\n}\n\n/**\n * Tests a cursor implementation that is rooted at a field.\n * Prefer using `testGeneralPurposeTreeCursor` when possible:\n * `testTreeCursor` should only be used when testing a cursor that is not truly general purpose (cannot be built from any arbitrary tree).\n *\n * @param cursorName - The name of the cursor used as part of the test suite name.\n * @param builders - a collection of optional `TData` builders. The more of these are provided, the larger the test suite will be.\n * If provided with a JsonableTree, it will either be from testData or comply with testTreeSchema.\n * @param cursorFactory - Creates the cursor to be tested from the provided `TData`.\n * @param dataFromCursor - Constructs a `TData` from the provided cursor (which might not be a `TCursor`).\n * @param testData - A collection of test cases to evaluate the cursor with. Actual content of the tree is only validated if a `reference` is provided:\n * otherwise only basic traversal and API consistency will be checked.\n *\n * @typeParam TData - Format which the cursor reads. Must be JSON compatible.\n * @typeParam TCursor - Type of the cursor being tested.\n */\nexport function testSpecializedFieldCursor<TData, TCursor extends ITreeCursor>(config: {\n\tcursorName: string;\n\tbuilders: SpecialCaseBuilder<TData>;\n\tcursorFactory: (data: TData) => TCursor;\n\tdataFromCursor?: (cursor: ITreeCursor) => TData;\n\ttestData: readonly TestField<TData>[];\n}): Mocha.Suite {\n\t// testing is per node, and our data can have multiple nodes at the root, so split tests as needed:\n\tconst testData: TestTree<[number, TData]>[] = config.testData.flatMap(\n\t\t({ name, dataFactory, reference, path }) => {\n\t\t\tconst out: TestTree<[number, TData]>[] = [];\n\t\t\tfor (let index = 0; index < reference.length; index++) {\n\t\t\t\tout.push({\n\t\t\t\t\tname: reference.length > 1 ? `${name} part ${index + 1}` : name,\n\t\t\t\t\tdataFactory: () => [index, dataFactory()],\n\t\t\t\t\treference: reference[index],\n\t\t\t\t\tpath: { parent: path.parent, parentIndex: index, parentField: path.field },\n\t\t\t\t});\n\t\t\t}\n\t\t\treturn out;\n\t\t},\n\t);\n\n\treturn describe(`${config.cursorName} testSpecializedFieldCursor suite`, () => {\n\t\t// Add tests which validate top level field itself.\n\t\tdescribe(\"with root field\", () => {\n\t\t\tfor (const data of config.testData) {\n\t\t\t\tit(data.name, () => {\n\t\t\t\t\tconst cursor = config.cursorFactory(data.dataFactory());\n\t\t\t\t\tassert.equal(cursor.mode, CursorLocationType.Fields);\n\t\t\t\t\tassert.equal(cursor.getFieldLength(), data.reference.length);\n\t\t\t\t\tcheckFieldTraversal(cursor, data.path);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\t// Run test suite on each top level node from each test data.\n\t\ttestTreeCursor<[number, TData], TCursor>({\n\t\t\tcursorName: config.cursorName,\n\t\t\tbuilders: {\n\t\t\t\twithKeys:\n\t\t\t\t\tconfig.builders.withKeys !== undefined\n\t\t\t\t\t\t? // This is known to be non-null from check above, but typescript can't infer it.\n\t\t\t\t\t\t  // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\t\t\t  (keys) => [0, config.builders.withKeys!(keys)]\n\t\t\t\t\t\t: undefined,\n\t\t\t},\n\t\t\tcursorFactory: (data: [number, TData]): TCursor => {\n\t\t\t\tconst cursor = config.cursorFactory(data[1]);\n\t\t\t\tcursor.enterNode(data[0]);\n\t\t\t\treturn cursor;\n\t\t\t},\n\t\t\ttestData,\n\t\t\textraRoot: true,\n\t\t});\n\t});\n}\n\nconst unusedKey: FieldKey = brand(\"unusedKey\");\nconst testKeys: readonly FieldKey[] = [\n\t// keys likely to cause issues due to JS object non-own keys\n\tbrand(\"__proto__\"),\n\tbrand(\"toString\"),\n\tbrand(\"toFixed\"),\n\tbrand(\"hasOwnProperty\"),\n\t// numeric keys, which can be problematic for array like node and/or due to implicit conversions.\n\tbrand(\"0\"),\n\tbrand(\"-1\"),\n\tbrand(\"0.0\"),\n\t// Misc test keys\n\tEmptyKey,\n\trootFieldKey,\n\tunusedKey,\n];\n\n/**\n * Tests a cursor implementation.\n * Prefer using `testGeneralPurposeTreeCursor` when possible:\n * `testTreeCursor` should only be used when testing a cursor that is not truly general purpose (can not be build from any arbitrary tree).\n *\n * If neither `dataFromCursor` nor  `(data: JsonableTree) => TData` builders, no round trip testing will be performed.\n *\n * @param cursorName - The name of the cursor used as part of the test suite name.\n * @param builders - `TData` builders. `(data: JsonableTree) => TData` is ideal and supports all tests.\n * If provided with a JsonableTree, it will either be from testData or comply with testTreeSchema.\n * @param cursorFactory - Creates the cursor to be tested from the provided `TData`.\n * @param dataFromCursor - Constructs a `TData` from the provided cursor `TCursor`. This is tested by round tripping data.\n * @param testData - A collection of test cases to evaluate the cursor with. Actual content of the tree is only validated if a `reference` is provided:\n * otherwise only basic traversal and API consistency will be checked.\n * @param extraRoot - setting this to `true` makes the tests expect that `cursorFactory` includes a dummy node above the root,\n * with the data under {@link rootFieldKey}.\n *\n * @typeParam TData - Format which the cursor reads. Must be JSON compatible.\n * @typeParam TCursor - Type of the cursor being tested.\n */\nfunction testTreeCursor<TData, TCursor extends ITreeCursor>(config: {\n\tcursorName: string;\n\tbuilders: SpecialCaseBuilder<TData> | ((data: JsonableTree) => TData);\n\tcursorFactory: (data: TData) => TCursor;\n\tdataFromCursor?: (cursor: TCursor) => TData;\n\ttestData: readonly TestTree<TData>[];\n\textraRoot?: true;\n}): Mocha.Suite {\n\tconst {\n\t\tcursorName,\n\t\tcursorFactory,\n\t\tdataFromCursor,\n\t\ttestData,\n\t\textraRoot,\n\t\tbuilders: builder,\n\t} = config;\n\n\tconst dataFromJsonableTree = typeof builder === \"object\" ? undefined : builder;\n\tconst withKeys: undefined | ((keys: FieldKey[]) => TData) =\n\t\ttypeof builder === \"object\"\n\t\t\t? builder.withKeys === undefined\n\t\t\t\t? undefined\n\t\t\t\t: builder.withKeys.bind(builder.withKeys)\n\t\t\t: (keys: FieldKey[]) => {\n\t\t\t\t\tconst root: JsonableTree = {\n\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t};\n\t\t\t\t\tfor (const key of keys) {\n\t\t\t\t\t\tconst child: JsonableTree = {\n\t\t\t\t\t\t\ttype: emptySchema.name,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tsetGenericTreeField(root, key, [child]);\n\t\t\t\t\t}\n\t\t\t\t\treturn builder(root);\n\t\t\t  };\n\n\tconst parent = !extraRoot\n\t\t? undefined\n\t\t: {\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: rootFieldKey,\n\t\t\t\tparentIndex: 0,\n\t\t  };\n\n\treturn describe(`${cursorName} cursor implementation`, () => {\n\t\tdescribe(\"test trees\", () => {\n\t\t\tfor (const { name, dataFactory, reference, path } of testData) {\n\t\t\t\tdescribe(name, () => {\n\t\t\t\t\tlet data: TData;\n\t\t\t\t\tbefore(() => {\n\t\t\t\t\t\tdata = dataFactory();\n\t\t\t\t\t});\n\t\t\t\t\tit(\"jsonableTreeFromCursor\", () => {\n\t\t\t\t\t\tconst cursor = cursorFactory(data);\n\t\t\t\t\t\tconst jsonableClone = jsonableTreeFromCursor(cursor);\n\t\t\t\t\t\t// Check jsonable objects are actually json compatible\n\t\t\t\t\t\tconst text = JSON.stringify(jsonableClone);\n\t\t\t\t\t\tconst parsed = JSON.parse(text);\n\t\t\t\t\t\tassert.deepEqual(parsed, jsonableClone);\n\t\t\t\t\t});\n\n\t\t\t\t\tit(\"traversal\", () => {\n\t\t\t\t\t\tcheckTraversal(cursorFactory(data), path ?? parent);\n\t\t\t\t\t});\n\n\t\t\t\t\tif (reference !== undefined) {\n\t\t\t\t\t\tit(\"equals reference\", () => {\n\t\t\t\t\t\t\tif (dataFromJsonableTree !== undefined) {\n\t\t\t\t\t\t\t\tconst dataClone = dataFromJsonableTree(reference);\n\t\t\t\t\t\t\t\t// This assumes `TData` works with deepEqual.\n\t\t\t\t\t\t\t\tassert.deepEqual(data, dataClone);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tconst clone = jsonableTreeFromCursor(cursorFactory(data));\n\t\t\t\t\t\t\tassert.deepEqual(clone, reference);\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\n\t\t\t\t\tif (dataFromCursor !== undefined) {\n\t\t\t\t\t\tit(\"roundtrip with dataFromCursor\", () => {\n\t\t\t\t\t\t\tconst cursor = cursorFactory(data);\n\t\t\t\t\t\t\tconst cursorClonedData = dataFromCursor(cursor);\n\t\t\t\t\t\t\t// This assumes `T` works with deepEqual.\n\t\t\t\t\t\t\tassert.deepEqual(cursorClonedData, data);\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\n\t\t\t\t\tif (dataFromJsonableTree !== undefined) {\n\t\t\t\t\t\tit(\"roundtrip with dataFromJsonableTree\", () => {\n\t\t\t\t\t\t\tconst cursor = cursorFactory(data);\n\t\t\t\t\t\t\tconst jsonableClone = jsonableTreeFromCursor(cursor);\n\t\t\t\t\t\t\tconst dataClone = dataFromJsonableTree(jsonableClone);\n\t\t\t\t\t\t\tassert.deepEqual(data, dataClone);\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\t// TODO: replace some of these tests with ones that do not require dataFromJsonableTree\n\t\tif (dataFromJsonableTree !== undefined) {\n\t\t\tconst factory = (data: JsonableTree): ITreeCursor => {\n\t\t\t\treturn cursorFactory(dataFromJsonableTree(data));\n\t\t\t};\n\n\t\t\t// TODO: revisit spec for forest cursors and root and clarify what should be tested for them regarding Up from root.\n\t\t\tif (!extraRoot) {\n\t\t\t\tit(\"up from root\", () => {\n\t\t\t\t\tconst cursor = factory({ type: emptySchema.name });\n\t\t\t\t\tassert.throws(() => {\n\t\t\t\t\t\tcursor.exitNode();\n\t\t\t\t\t});\n\t\t\t\t});\n\t\t\t}\n\t\t\tdescribe(\"getPath() and getFieldPath()\", () => {\n\t\t\t\tit(\"at root\", () => {\n\t\t\t\t\tconst cursor = factory({\n\t\t\t\t\t\ttype: emptySchema.name,\n\t\t\t\t\t});\n\t\t\t\t\texpectEqualPaths(cursor.getPath(), parent);\n\t\t\t\t});\n\n\t\t\t\tit(\"getFieldPath in root field\", () => {\n\t\t\t\t\tconst cursor = factory({\n\t\t\t\t\t\ttype: emptySchema.name,\n\t\t\t\t\t});\n\t\t\t\t\tcursor.enterField(brand(\"key\"));\n\t\t\t\t\texpectEqualFieldPaths(cursor.getFieldPath(), {\n\t\t\t\t\t\tparent,\n\t\t\t\t\t\tfield: brand(\"key\"),\n\t\t\t\t\t});\n\t\t\t\t});\n\n\t\t\t\tit(\"first node in a root field\", () => {\n\t\t\t\t\tconst cursor = factory({\n\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t\tfields: { key: [{ type: leaf.number.name, value: 0 }] },\n\t\t\t\t\t});\n\t\t\t\t\tcursor.enterField(brand(\"key\"));\n\t\t\t\t\tcursor.firstNode();\n\t\t\t\t\texpectEqualPaths(cursor.getPath(), {\n\t\t\t\t\t\tparent,\n\t\t\t\t\t\tparentField: brand<FieldKey>(\"key\"),\n\t\t\t\t\t\tparentIndex: 0,\n\t\t\t\t\t});\n\t\t\t\t});\n\n\t\t\t\tit(\"node in a root field\", () => {\n\t\t\t\t\tconst cursor = factory({\n\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t\tfields: {\n\t\t\t\t\t\t\tkey: [\n\t\t\t\t\t\t\t\t{ type: leaf.number.name, value: 0 },\n\t\t\t\t\t\t\t\t{ type: leaf.number.name, value: 1 },\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t},\n\t\t\t\t\t});\n\t\t\t\t\tcursor.enterField(brand(\"key\"));\n\t\t\t\t\tcursor.enterNode(1);\n\t\t\t\t\texpectEqualPaths(cursor.getPath(), {\n\t\t\t\t\t\tparent,\n\t\t\t\t\t\tparentField: brand<FieldKey>(\"key\"),\n\t\t\t\t\t\tparentIndex: 1,\n\t\t\t\t\t});\n\t\t\t\t});\n\n\t\t\t\tit(\"in a nested field\", () => {\n\t\t\t\t\tconst cursor = factory({\n\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t\tfields: {\n\t\t\t\t\t\t\ta: [\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t\t\t\t\tfields: { [EmptyKey]: [{ type: emptySchema.name }] },\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\ttype: mapSchema.name,\n\t\t\t\t\t\t\t\t\tfields: { [EmptyKey]: [{ type: emptySchema.name }] },\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t},\n\t\t\t\t\t});\n\t\t\t\t\tcursor.enterField(brand(\"a\"));\n\t\t\t\t\tcursor.enterNode(1);\n\t\t\t\t\tcursor.enterField(EmptyKey);\n\t\t\t\t\tconst initialPath: UpPath = {\n\t\t\t\t\t\tparent,\n\t\t\t\t\t\tparentField: brand(\"a\"),\n\t\t\t\t\t\tparentIndex: 1,\n\t\t\t\t\t};\n\t\t\t\t\texpectEqualFieldPaths(cursor.getFieldPath(), {\n\t\t\t\t\t\tparent: initialPath,\n\t\t\t\t\t\tfield: EmptyKey,\n\t\t\t\t\t});\n\t\t\t\t\tcursor.enterNode(0);\n\t\t\t\t\texpectEqualPaths(cursor.getPath(), {\n\t\t\t\t\t\tparent: initialPath,\n\t\t\t\t\t\tparentField: EmptyKey,\n\t\t\t\t\t\tparentIndex: 0,\n\t\t\t\t\t});\n\t\t\t\t});\n\t\t\t});\n\t\t}\n\t\tif (withKeys !== undefined) {\n\t\t\tdescribe(\"key tests\", () => {\n\t\t\t\tconst unrelatedKey: FieldKey = brand(\"unrelated\");\n\t\t\t\tfor (const key of testKeys) {\n\t\t\t\t\tit(`returns no values for key: ${key.toString()}`, () => {\n\t\t\t\t\t\t// Test an empty tree, and one with unrelated fields\n\t\t\t\t\t\tconst trees: TData[] = [withKeys([]), withKeys([unrelatedKey])];\n\t\t\t\t\t\t// We have a builder: use it to make a tree with unrelatedKey.\n\t\t\t\t\t\ttrees.push(withKeys([unrelatedKey]));\n\n\t\t\t\t\t\tfor (const data of trees) {\n\t\t\t\t\t\t\tconst cursor = cursorFactory(data);\n\t\t\t\t\t\t\tcursor.enterField(key);\n\t\t\t\t\t\t\tassert.equal(cursor.getFieldLength(), 0);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\n\t\t\t\t\tconst dataFactory = () => withKeys([key]);\n\n\t\t\t\t\tif (dataFactory !== undefined) {\n\t\t\t\t\t\tit(`handles values for key: ${key.toString()}`, () => {\n\t\t\t\t\t\t\tconst dataWithKey = dataFactory();\n\t\t\t\t\t\t\tconst cursor = cursorFactory(dataWithKey);\n\t\t\t\t\t\t\tcursor.enterField(key);\n\t\t\t\t\t\t\tassert.equal(cursor.getFieldLength(), 1);\n\t\t\t\t\t\t\tcursor.enterNode(0);\n\t\t\t\t\t\t});\n\n\t\t\t\t\t\tit(`traversal with key: ${key.toString()}`, () => {\n\t\t\t\t\t\t\tconst dataWithKey = dataFactory();\n\t\t\t\t\t\t\tconst cursor = cursorFactory(dataWithKey);\n\t\t\t\t\t\t\tcheckTraversal(cursor, parent);\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\tit(\"traverse with no keys\", () => {\n\t\t\t\tconst data = withKeys([]);\n\t\t\t\tconst cursor = cursorFactory(data);\n\t\t\t\tcheckTraversal(cursor, parent);\n\t\t\t});\n\n\t\t\tdescribe(\"cursor prefix tests\", () => {\n\t\t\t\tit(\"at root\", () => {\n\t\t\t\t\tconst data = withKeys([]);\n\t\t\t\t\tconst cursor = cursorFactory(data);\n\t\t\t\t\texpectEqualPaths(cursor.getPath(), parent);\n\n\t\t\t\t\tconst prefixParent: UpPath = {\n\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\tparentField: brand(\"prefixParentField\"),\n\t\t\t\t\t\tparentIndex: 5,\n\t\t\t\t\t};\n\n\t\t\t\t\tconst prefixes: (PathRootPrefix | undefined)[] = [\n\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t{},\n\t\t\t\t\t\t{ indexOffset: 10, rootFieldOverride: EmptyKey },\n\t\t\t\t\t\t{ parent: prefixParent },\n\t\t\t\t\t];\n\n\t\t\t\t\tfor (const prefix of prefixes) {\n\t\t\t\t\t\t// prefixPath has its own tests, so we can use it to test cursors here:\n\t\t\t\t\t\texpectEqualPaths(cursor.getPath(prefix), prefixPath(prefix, parent));\n\t\t\t\t\t}\n\n\t\t\t\t\tcursor.enterField(brand(\"testField\"));\n\t\t\t\t\tassert(\n\t\t\t\t\t\tcompareFieldUpPaths(cursor.getFieldPath(), {\n\t\t\t\t\t\t\tfield: brand(\"testField\"),\n\t\t\t\t\t\t\tparent,\n\t\t\t\t\t\t}),\n\t\t\t\t\t);\n\n\t\t\t\t\tfor (const prefix of prefixes) {\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\tcompareFieldUpPaths(\n\t\t\t\t\t\t\t\tcursor.getFieldPath(prefix),\n\t\t\t\t\t\t\t\tprefixFieldPath(prefix, { field: brand(\"testField\"), parent }),\n\t\t\t\t\t\t\t),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t});\n\t\t}\n\t});\n}\n\n/**\n * Test that cursor works as a cursor.\n * This does NOT test that the data the cursor exposes is correct,\n * it simply checks that the traversal APIs function, and that a few aspects of them conform with the spec.\n */\nfunction checkTraversal(cursor: ITreeCursor, expectedPath: UpPath | undefined) {\n\tassert.equal(cursor.mode, CursorLocationType.Nodes);\n\tassert.equal(cursor.pending, false);\n\t// Keep track of current node properties to check it during ascent\n\tconst originalNodeValue = cursor.value;\n\tconst originalNodeType = cursor.type;\n\n\tconst path = cursor.getPath();\n\texpectEqualPaths(path, expectedPath);\n\n\tconst fieldLengths: Map<FieldKey, number> = new Map();\n\n\tfor (let inField: boolean = cursor.firstField(); inField; inField = cursor.nextField()) {\n\t\tconst expectedFieldLength = cursor.getFieldLength();\n\t\tconst key = cursor.getFieldKey();\n\t\tassert(!fieldLengths.has(key), \"no duplicate keys\");\n\t\tfieldLengths.set(cursor.getFieldKey(), expectedFieldLength);\n\t\tassert(expectedFieldLength > 0, \"only non empty fields should show up in field iteration\");\n\t\tcheckFieldTraversal(cursor, { parent: path, field: key });\n\t}\n\n\t// Add some fields which should be empty to check:\n\tfor (const key of testKeys) {\n\t\tif (!fieldLengths.has(key)) {\n\t\t\tfieldLengths.set(key, 0);\n\t\t}\n\t}\n\n\t// Cheek field access by key\n\tfor (const [key, length] of fieldLengths) {\n\t\tassert.equal(cursor.mode, CursorLocationType.Nodes);\n\t\tcursor.enterField(key);\n\t\tassert.equal(cursor.mode, CursorLocationType.Fields);\n\t\tassert.equal(cursor.getFieldLength(), length);\n\t\tassert.equal(cursor.getFieldKey(), key);\n\t\tcursor.exitField();\n\n\t\t// nextField should work after enterField (though might just exit since order is not stable):\n\t\tcursor.enterField(key);\n\t\tif (cursor.nextField()) {\n\t\t\tconst newKey = cursor.getFieldKey();\n\t\t\tassert(newKey !== key);\n\t\t\tassert(fieldLengths.get(newKey) ?? 0 > 0);\n\t\t\tcursor.exitField();\n\t\t}\n\t}\n\n\tassert.equal(cursor.mode, CursorLocationType.Nodes);\n\tassert.equal(cursor.value, originalNodeValue);\n\tassert.equal(cursor.type, originalNodeType);\n}\n\n/**\n * Test that cursor works as a cursor, starting in `Fields` mode.\n *\n * This does NOT test that the data the cursor exposes is correct,\n * it simply checks that the traversal APIs function, and that a few aspects of them conform with the spec.\n */\nexport function checkFieldTraversal(cursor: ITreeCursor, expectedPath: FieldUpPath): void {\n\tassert.equal(cursor.mode, CursorLocationType.Fields);\n\tassert.equal(cursor.pending, false);\n\tconst expectedFieldLength = cursor.getFieldLength();\n\tconst key = cursor.getFieldKey();\n\tassert(compareFieldUpPaths(cursor.getFieldPath(), expectedPath));\n\n\t// Check that iterating nodes of this field works as expected.\n\tlet actualChildNodesTraversed = 0;\n\tfor (let inNode = cursor.firstNode(); inNode; inNode = cursor.nextNode()) {\n\t\tassert.equal(cursor.fieldIndex, actualChildNodesTraversed);\n\t\tassert(cursor.chunkStart <= actualChildNodesTraversed);\n\t\tassert(cursor.chunkLength > actualChildNodesTraversed - cursor.chunkStart);\n\t\tassert(cursor.chunkLength + cursor.chunkStart <= expectedFieldLength);\n\n\t\t// Make sure down+up navigation gets back to where it started.\n\t\t// Testing this explicitly here before recursing makes debugging issues with this easier.\n\t\tassert.equal(cursor.fieldIndex, actualChildNodesTraversed);\n\t\tcursor.enterField(EmptyKey);\n\t\tcursor.exitField();\n\t\tassert.equal(cursor.fieldIndex, actualChildNodesTraversed);\n\t\tif (cursor.firstField()) {\n\t\t\tcursor.enterNode(0);\n\t\t\tcursor.exitNode();\n\t\t\tcursor.exitField();\n\t\t}\n\t\tassert.equal(cursor.fieldIndex, actualChildNodesTraversed);\n\t\tactualChildNodesTraversed++;\n\t}\n\n\tassert.equal(\n\t\tactualChildNodesTraversed,\n\t\texpectedFieldLength,\n\t\t\"Did not traverse expected number of children\",\n\t);\n\n\t// Check node access by index\n\tfor (let index = 0; index < expectedFieldLength; index++) {\n\t\tassert.equal(cursor.mode, CursorLocationType.Fields);\n\t\tcursor.enterNode(index);\n\t\tassert.equal(cursor.mode, CursorLocationType.Nodes);\n\t\tassert(cursor.seekNodes(0));\n\t\tassert.equal(cursor.fieldIndex, index);\n\t\tcursor.exitNode();\n\t\tassert.equal(cursor.mode, CursorLocationType.Fields);\n\n\t\t// Seek to node should work:\n\t\tcursor.enterNode(0);\n\t\tcursor.seekNodes(index);\n\t\tassert.equal(cursor.fieldIndex, index);\n\t\t// Seek backwards should be supported\n\t\tif (index > 0) {\n\t\t\tassert(cursor.seekNodes(-1));\n\t\t\tassert.equal(cursor.fieldIndex, index - 1);\n\t\t\t// Seek should mix with nextNode\n\t\t\tassert(cursor.nextNode());\n\t\t\tassert.equal(cursor.fieldIndex, index);\n\t\t}\n\t\tcursor.exitNode();\n\t\tassert.equal(cursor.mode, CursorLocationType.Fields);\n\n\t\t// Seek past end should exit\n\t\tcursor.enterNode(index);\n\t\tassert(!cursor.seekNodes(expectedFieldLength - index));\n\t\tcursor.enterNode(index);\n\t\tassert(!cursor.seekNodes(Number.POSITIVE_INFINITY));\n\n\t\t// Seek before beginning should exit\n\t\tcursor.enterNode(index);\n\t\tassert(!cursor.seekNodes(-(index + 1)));\n\t\tcursor.enterNode(index);\n\t\tassert(!cursor.seekNodes(Number.NEGATIVE_INFINITY));\n\t}\n\n\t// skipPendingFields should have no effect since not pending\n\tassert(cursor.skipPendingFields());\n\tassert.equal(cursor.getFieldKey(), key);\n\n\t// Recursively validate.\n\tactualChildNodesTraversed = 0;\n\tfor (let inNode = cursor.firstNode(); inNode; inNode = cursor.nextNode()) {\n\t\tassert.equal(cursor.fieldIndex, actualChildNodesTraversed);\n\t\tcheckTraversal(cursor, {\n\t\t\tparent: expectedPath.parent,\n\t\t\tparentField: expectedPath.field,\n\t\t\tparentIndex: actualChildNodesTraversed,\n\t\t});\n\t\tassert.equal(cursor.fieldIndex, actualChildNodesTraversed);\n\t\tactualChildNodesTraversed++;\n\t}\n}\n"]}

package/lib/test/domains/json/benchmarks.d.ts

@@ -1,17 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { ITreeCursor } from "../../../core/index.js";
-export declare function sum(cursor: ITreeCursor): number;
-export declare function sumMap(cursor: ITreeCursor): number;
-export declare function sumDirect(jsonObj: any): number;
-/**
- * Benchmarking "consumer" that calculates two averages of two values, it takes a callback which enables this benchmark
- * to be used with any shape of tree since the callback defines the tree navigation.
- * @param cursor - a Shared Tree cursor
- * @param dataConsumer - Function that should use the given cursor to retrieve data and call calculate().
- * @returns a set of two average values.
- */
-export declare function averageTwoValues(cursor: ITreeCursor, dataConsumer: (cursor: ITreeCursor, calculate: (x: number, y: number) => void) => number): [number, number];
-//# sourceMappingURL=benchmarks.d.ts.map

package/lib/test/domains/json/benchmarks.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"benchmarks.d.ts","sourceRoot":"","sources":["../../../../src/test/domains/json/benchmarks.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAA6B,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAEhF,wBAAgB,GAAG,CAAC,MAAM,EAAE,WAAW,GAAG,MAAM,CAc/C;AAED,wBAAgB,MAAM,CAAC,MAAM,EAAE,WAAW,GAAG,MAAM,CAclD;AAED,wBAAgB,SAAS,CAAC,OAAO,EAAE,GAAG,GAAG,MAAM,CAU9C;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC/B,MAAM,EAAE,WAAW,EACnB,YAAY,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,IAAI,KAAK,MAAM,GACtF,CAAC,MAAM,EAAE,MAAM,CAAC,CAclB"}

package/lib/test/domains/json/benchmarks.js

@@ -1,61 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { forEachNode, forEachField } from "../../../core/index.js";
-export function sum(cursor) {
-    let total = 0;
-    const value = cursor.value;
-    if (typeof value === "number") {
-        total += value;
-    }
-    for (let inField = cursor.firstField(); inField; inField = cursor.nextField()) {
-        for (let inNode = cursor.firstNode(); inNode; inNode = cursor.nextNode()) {
-            total += sum(cursor);
-        }
-    }
-    return total;
-}
-export function sumMap(cursor) {
-    let total = 0;
-    const value = cursor.value;
-    if (typeof value === "number") {
-        total += value;
-    }
-    forEachField(cursor, () => forEachNode(cursor, (c) => {
-        total += sumMap(c);
-    }));
-    return total;
-}
-export function sumDirect(jsonObj) {
-    let total = 0;
-    for (const value of Object.values(jsonObj)) {
-        if (typeof value === "object" && value !== null) {
-            total += sumDirect(value);
-        }
-        else if (typeof value === "number") {
-            total += value;
-        }
-    }
-    return total;
-}
-/**
- * Benchmarking "consumer" that calculates two averages of two values, it takes a callback which enables this benchmark
- * to be used with any shape of tree since the callback defines the tree navigation.
- * @param cursor - a Shared Tree cursor
- * @param dataConsumer - Function that should use the given cursor to retrieve data and call calculate().
- * @returns a set of two average values.
- */
-export function averageTwoValues(cursor, dataConsumer) {
-    let count = 0;
-    let xTotal = 0;
-    let yTotal = 0;
-    const calculate = (x, y) => {
-        count += 1;
-        xTotal += x;
-        yTotal += y;
-    };
-    dataConsumer(cursor, calculate);
-    return [xTotal / count, yTotal / count];
-}
-//# sourceMappingURL=benchmarks.js.map

package/lib/test/domains/json/benchmarks.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"benchmarks.js","sourceRoot":"","sources":["../../../../src/test/domains/json/benchmarks.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAe,MAAM,wBAAwB,CAAC;AAEhF,MAAM,UAAU,GAAG,CAAC,MAAmB;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAC9B,KAAK,IAAI,KAAK,CAAC;KACf;IAED,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,UAAU,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE;QAC9E,KAAK,IAAI,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE;YACzE,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;SACrB;KACD;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,MAAmB;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAC9B,KAAK,IAAI,KAAK,CAAC;KACf;IAED,YAAY,CAAC,MAAM,EAAE,GAAG,EAAE,CACzB,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;QACzB,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CACF,CAAC;IAEF,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,OAAY;IACrC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;QAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE;YAChD,KAAK,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC;SAC1B;aAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;YACrC,KAAK,IAAI,KAAK,CAAC;SACf;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC/B,MAAmB,EACnB,YAAwF;IAExF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QAC1C,KAAK,IAAI,CAAC,CAAC;QACX,MAAM,IAAI,CAAC,CAAC;QACZ,MAAM,IAAI,CAAC,CAAC;IACb,CAAC,CAAC;IAEF,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAEhC,OAAO,CAAC,MAAM,GAAG,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC;AACzC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { forEachNode, forEachField, ITreeCursor } from \"../../../core/index.js\";\n\nexport function sum(cursor: ITreeCursor): number {\n\tlet total = 0;\n\tconst value = cursor.value;\n\tif (typeof value === \"number\") {\n\t\ttotal += value;\n\t}\n\n\tfor (let inField = cursor.firstField(); inField; inField = cursor.nextField()) {\n\t\tfor (let inNode = cursor.firstNode(); inNode; inNode = cursor.nextNode()) {\n\t\t\ttotal += sum(cursor);\n\t\t}\n\t}\n\n\treturn total;\n}\n\nexport function sumMap(cursor: ITreeCursor): number {\n\tlet total = 0;\n\tconst value = cursor.value;\n\tif (typeof value === \"number\") {\n\t\ttotal += value;\n\t}\n\n\tforEachField(cursor, () =>\n\t\tforEachNode(cursor, (c) => {\n\t\t\ttotal += sumMap(c);\n\t\t}),\n\t);\n\n\treturn total;\n}\n\nexport function sumDirect(jsonObj: any): number {\n\tlet total = 0;\n\tfor (const value of Object.values(jsonObj)) {\n\t\tif (typeof value === \"object\" && value !== null) {\n\t\t\ttotal += sumDirect(value);\n\t\t} else if (typeof value === \"number\") {\n\t\t\ttotal += value;\n\t\t}\n\t}\n\treturn total;\n}\n\n/**\n * Benchmarking \"consumer\" that calculates two averages of two values, it takes a callback which enables this benchmark\n * to be used with any shape of tree since the callback defines the tree navigation.\n * @param cursor - a Shared Tree cursor\n * @param dataConsumer - Function that should use the given cursor to retrieve data and call calculate().\n * @returns a set of two average values.\n */\nexport function averageTwoValues(\n\tcursor: ITreeCursor,\n\tdataConsumer: (cursor: ITreeCursor, calculate: (x: number, y: number) => void) => number,\n): [number, number] {\n\tlet count = 0;\n\tlet xTotal = 0;\n\tlet yTotal = 0;\n\n\tconst calculate = (x: number, y: number) => {\n\t\tcount += 1;\n\t\txTotal += x;\n\t\tyTotal += y;\n\t};\n\n\tdataConsumer(cursor, calculate);\n\n\treturn [xTotal / count, yTotal / count];\n}\n"]}

package/lib/test/domains/json/canada.d.ts

@@ -1,33 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { FieldKey } from "../../../core/index.js";
-export interface Canada {
-    type: "FeatureCollection";
-    features: [
-        {
-            type: "Feature";
-            properties: {
-                name: "Canada";
-            };
-            geometry: {
-                type: "Polygon";
-                coordinates: [number, number][][];
-            };
-        }
-    ];
-}
-export declare const Canada: {
-    SharedTreeFieldKey: {
-        features: FieldKey;
-        geometry: FieldKey;
-        coordinates: FieldKey;
-    };
-};
-/**
- * Generates a Jsonable tree with statistical similarities to 'canada.json':
- * https://raw.githubusercontent.com/serde-rs/json-benchmark/master/data/canada.json
- */
-export declare function generateCanada(segmentLengths?: number[], seed?: number): Canada;
-//# sourceMappingURL=canada.d.ts.map

package/lib/test/domains/json/canada.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"canada.d.ts","sourceRoot":"","sources":["../../../../src/test/domains/json/canada.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAGlD,MAAM,WAAW,MAAM;IACtB,IAAI,EAAE,mBAAmB,CAAC;IAC1B,QAAQ,EAAE;QACT;YACC,IAAI,EAAE,SAAS,CAAC;YAChB,UAAU,EAAE;gBAAE,IAAI,EAAE,QAAQ,CAAA;aAAE,CAAC;YAC/B,QAAQ,EAAE;gBACT,IAAI,EAAE,SAAS,CAAC;gBAChB,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;aAClC,CAAC;SACF;KACD,CAAC;CACF;AAED,eAAO,MAAM,MAAM;;;;;;CAOlB,CAAC;AA2BF;;;GAGG;AACH,wBAAgB,cAAc,CAAC,cAAc,WAAyB,EAAE,IAAI,SAAI,GAAG,MAAM,CA+CxF"}

package/lib/test/domains/json/canada.js

@@ -1,81 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { makeRandom } from "@fluid-private/stochastic-test-utils";
-import { brand } from "../../../util/index.js";
-export const Canada = {
-    // Shared tree keys that map to the type used by the Canada dataset
-    SharedTreeFieldKey: {
-        features: brand("features"),
-        geometry: brand("geometry"),
-        coordinates: brand("coordinates"),
-    },
-};
-// The geometry of 'canada.json' is encoded as 480 segments of varying length.
-const originalSegmentLengths = [
-    14, 33, 18, 23, 10, 28, 9, 28, 279, 221, 11, 86, 28, 19, 26, 23, 24, 38, 24, 9, 30, 20, 27, 21,
-    19, 25, 24, 20, 19, 18, 34, 19, 28, 12, 38, 30, 91, 17, 23, 28, 22, 24, 19, 44, 21, 19, 21, 24,
-    21, 24, 15, 20, 28, 18, 474, 17, 19, 12, 12, 1436, 31, 27, 26, 40, 21, 20, 27, 21, 19, 18, 24,
-    20, 65, 27, 36, 21, 27, 28, 24, 17, 20, 17, 12, 21, 24, 24, 31, 71, 224, 9, 147, 30, 20, 18, 22,
-    37, 13, 18, 43, 35, 20, 14, 71, 12, 26, 87, 23, 240, 29, 11, 22, 19, 18, 19, 22, 26, 11, 20, 23,
-    46, 28, 23, 29, 12, 21, 19, 24, 25, 23, 25, 30, 19, 46, 40, 172, 21, 18, 18, 28, 28, 67, 14, 27,
-    18, 23, 29, 21, 25, 28, 19, 22, 20, 29, 14, 24, 26, 21, 38, 47, 19, 20, 21, 60, 21, 26, 31, 19,
-    15, 82, 19, 32, 22, 19, 22, 12, 15, 37, 46, 14, 169, 18, 24, 20, 44, 17, 17, 19, 24, 18, 18, 22,
-    16, 33, 16, 47, 19, 22, 22, 19, 24, 16, 42, 30, 15, 25, 15, 15, 18, 21, 15, 29, 18, 22, 21, 18,
-    21, 17, 26, 38, 21, 16, 22, 14, 16, 26, 16, 19, 35, 33, 18, 606, 16, 17, 15, 47, 17, 13, 16,
-    103, 13, 19, 17, 37, 35, 19, 17, 13, 26, 24, 37, 27, 20, 17, 23, 17, 21, 20, 16, 34, 24, 22, 18,
-    19, 26, 18, 15, 20, 14, 17, 15, 28, 18, 23, 13, 16, 16, 13, 21, 18, 22, 21, 74, 24, 18, 18, 13,
-    15, 13, 20, 13, 22, 17, 17, 17, 63, 32, 109, 26, 20, 17, 15, 10, 27, 12, 21, 17, 38, 26, 20, 13,
-    66, 24, 17, 43, 13, 33, 38, 11, 22, 18, 20, 15, 15, 44, 11, 18, 24, 13, 24, 24, 77, 26, 56, 21,
-    19, 32, 55, 46, 16, 16, 18, 54, 29, 22, 17, 257, 23, 70, 22, 90, 30, 21, 16, 19, 396, 40, 18,
-    115, 19, 16, 20, 17, 15, 16, 17, 19, 19, 21, 20, 28, 14, 21, 61, 18, 15, 64, 34, 34, 23, 22,
-    14310, 70, 57, 19, 19, 28, 23, 18, 15, 12, 14, 11, 14, 19, 25, 15, 39, 44, 21, 2121, 10, 32, 23,
-    19, 116, 188, 8221, 17, 733, 23, 54, 399, 22, 534, 31, 37, 18, 38, 46, 205, 70, 18, 18, 20, 18,
-    37, 20, 40, 49, 13, 102, 93, 72, 25, 16, 64, 17, 14, 87, 837, 39, 23, 40, 57, 1162, 16, 39, 16,
-    17, 1584, 15, 26, 27, 26, 34, 601, 35, 58, 87, 115, 24, 51, 51, 178, 23, 38, 24, 26, 131, 25,
-    251, 43, 475, 67, 24, 32, 1447, 21, 19, 5276,
-];
-/**
- * Generates a Jsonable tree with statistical similarities to 'canada.json':
- * https://raw.githubusercontent.com/serde-rs/json-benchmark/master/data/canada.json
- */
-export function generateCanada(segmentLengths = originalSegmentLengths, seed = 1) {
-    const random = makeRandom(seed);
-    // Distribution parameters were calculated from 'canada.json', rounded for brevity,
-    // and then the gzipped size compared with the original tree to verify that the
-    // these choices generate a tree with similar entropy.
-    const vxDist = () => random.normal(/* mean: */ 0, /* stdDev: */ 75);
-    const vyDist = () => random.normal(/* mean: */ 0, /* stdDev: */ 20);
-    const noiseDist = () => random.real(/* min: */ -18e-14, /* max: */ 18e-14);
-    let last_x = -65;
-    let last_y = 43;
-    // To generate geometry similar to 'canada.json', we map the array of segment lengths to
-    // an array of segments, where the coordinates of each segment is randomly generated using
-    // Brownian motion.
-    const segments = segmentLengths.map((len) => {
-        const clamp = (min, value, max) => Math.max(Math.min(value, max), min);
-        // An interesting detail of 'canada.json' is that coordinates typically have ~6 digits of
-        // precision, followed by ~8 consecutive zeros or nines, and then a couple additional digits.
-        // We generate similar coordinates by truncating values to 6 digits of precision and then
-        // adding a very small amount of noise.
-        const noise = (x) => Math.trunc(x * 1000000) / 1000000 + noiseDist();
-        return new Array(len)
-            .fill(0)
-            .map(() => [
-            (last_x = noise(clamp(-141, last_x + vxDist(), -52))),
-            (last_y = noise(clamp(41, last_y + vyDist(), 83))),
-        ]);
-    });
-    return {
-        type: "FeatureCollection",
-        features: [
-            {
-                type: "Feature",
-                properties: { name: "Canada" },
-                geometry: { type: "Polygon", coordinates: segments },
-            },
-        ],
-    };
-}
-//# sourceMappingURL=canada.js.map

package/lib/test/domains/json/canada.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"canada.js","sourceRoot":"","sources":["../../../../src/test/domains/json/canada.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAgB/C,MAAM,CAAC,MAAM,MAAM,GAAG;IACrB,mEAAmE;IACnE,kBAAkB,EAAE;QACnB,QAAQ,EAAE,KAAK,CAAW,UAAU,CAAC;QACrC,QAAQ,EAAE,KAAK,CAAW,UAAU,CAAC;QACrC,WAAW,EAAE,KAAK,CAAW,aAAa,CAAC;KAC3C;CACD,CAAC;AAEF,8EAA8E;AAC9E,MAAM,sBAAsB,GAAG;IAC9B,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC7F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC/F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC/F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC/F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC/F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC3F,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC/F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC/F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE;IAC5F,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC3F,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC/F,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9F,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;IAC9F,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;IAC5F,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI;CAC5C,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,cAAc,GAAG,sBAAsB,EAAE,IAAI,GAAG,CAAC;IAC/E,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAEhC,mFAAmF;IACnF,+EAA+E;IAC/E,sDAAsD;IACtD,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC;IACpE,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IAE3E,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;IACjB,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,wFAAwF;IACxF,0FAA0F;IAC1F,mBAAmB;IACnB,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,GAAW,EAAE,EAAE;QACnD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,KAAa,EAAE,GAAW,EAAE,EAAE,CACzD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QAErC,yFAAyF;QACzF,6FAA6F;QAC7F,yFAAyF;QACzF,uCAAuC;QACvC,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,GAAG,SAAS,EAAE,CAAC;QAE7E,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC;aACnB,IAAI,CAAC,CAAC,CAAC;aACP,GAAG,CACH,GAAG,EAAE,CACJ;YACC,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrD,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SAC9B,CACtB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACN,IAAI,EAAE,mBAAmB;QACzB,QAAQ,EAAE;YACT;gBACC,IAAI,EAAE,SAAS;gBACf,UAAU,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBAC9B,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ,EAAE;aACpD;SACD;KACD,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { makeRandom } from \"@fluid-private/stochastic-test-utils\";\nimport { FieldKey } from \"../../../core/index.js\";\nimport { brand } from \"../../../util/index.js\";\n\nexport interface Canada {\n\ttype: \"FeatureCollection\";\n\tfeatures: [\n\t\t{\n\t\t\ttype: \"Feature\";\n\t\t\tproperties: { name: \"Canada\" };\n\t\t\tgeometry: {\n\t\t\t\ttype: \"Polygon\";\n\t\t\t\tcoordinates: [number, number][][];\n\t\t\t};\n\t\t},\n\t];\n}\n\nexport const Canada = {\n\t// Shared tree keys that map to the type used by the Canada dataset\n\tSharedTreeFieldKey: {\n\t\tfeatures: brand<FieldKey>(\"features\"),\n\t\tgeometry: brand<FieldKey>(\"geometry\"),\n\t\tcoordinates: brand<FieldKey>(\"coordinates\"),\n\t},\n};\n\n// The geometry of 'canada.json' is encoded as 480 segments of varying length.\nconst originalSegmentLengths = [\n\t14, 33, 18, 23, 10, 28, 9, 28, 279, 221, 11, 86, 28, 19, 26, 23, 24, 38, 24, 9, 30, 20, 27, 21,\n\t19, 25, 24, 20, 19, 18, 34, 19, 28, 12, 38, 30, 91, 17, 23, 28, 22, 24, 19, 44, 21, 19, 21, 24,\n\t21, 24, 15, 20, 28, 18, 474, 17, 19, 12, 12, 1436, 31, 27, 26, 40, 21, 20, 27, 21, 19, 18, 24,\n\t20, 65, 27, 36, 21, 27, 28, 24, 17, 20, 17, 12, 21, 24, 24, 31, 71, 224, 9, 147, 30, 20, 18, 22,\n\t37, 13, 18, 43, 35, 20, 14, 71, 12, 26, 87, 23, 240, 29, 11, 22, 19, 18, 19, 22, 26, 11, 20, 23,\n\t46, 28, 23, 29, 12, 21, 19, 24, 25, 23, 25, 30, 19, 46, 40, 172, 21, 18, 18, 28, 28, 67, 14, 27,\n\t18, 23, 29, 21, 25, 28, 19, 22, 20, 29, 14, 24, 26, 21, 38, 47, 19, 20, 21, 60, 21, 26, 31, 19,\n\t15, 82, 19, 32, 22, 19, 22, 12, 15, 37, 46, 14, 169, 18, 24, 20, 44, 17, 17, 19, 24, 18, 18, 22,\n\t16, 33, 16, 47, 19, 22, 22, 19, 24, 16, 42, 30, 15, 25, 15, 15, 18, 21, 15, 29, 18, 22, 21, 18,\n\t21, 17, 26, 38, 21, 16, 22, 14, 16, 26, 16, 19, 35, 33, 18, 606, 16, 17, 15, 47, 17, 13, 16,\n\t103, 13, 19, 17, 37, 35, 19, 17, 13, 26, 24, 37, 27, 20, 17, 23, 17, 21, 20, 16, 34, 24, 22, 18,\n\t19, 26, 18, 15, 20, 14, 17, 15, 28, 18, 23, 13, 16, 16, 13, 21, 18, 22, 21, 74, 24, 18, 18, 13,\n\t15, 13, 20, 13, 22, 17, 17, 17, 63, 32, 109, 26, 20, 17, 15, 10, 27, 12, 21, 17, 38, 26, 20, 13,\n\t66, 24, 17, 43, 13, 33, 38, 11, 22, 18, 20, 15, 15, 44, 11, 18, 24, 13, 24, 24, 77, 26, 56, 21,\n\t19, 32, 55, 46, 16, 16, 18, 54, 29, 22, 17, 257, 23, 70, 22, 90, 30, 21, 16, 19, 396, 40, 18,\n\t115, 19, 16, 20, 17, 15, 16, 17, 19, 19, 21, 20, 28, 14, 21, 61, 18, 15, 64, 34, 34, 23, 22,\n\t14310, 70, 57, 19, 19, 28, 23, 18, 15, 12, 14, 11, 14, 19, 25, 15, 39, 44, 21, 2121, 10, 32, 23,\n\t19, 116, 188, 8221, 17, 733, 23, 54, 399, 22, 534, 31, 37, 18, 38, 46, 205, 70, 18, 18, 20, 18,\n\t37, 20, 40, 49, 13, 102, 93, 72, 25, 16, 64, 17, 14, 87, 837, 39, 23, 40, 57, 1162, 16, 39, 16,\n\t17, 1584, 15, 26, 27, 26, 34, 601, 35, 58, 87, 115, 24, 51, 51, 178, 23, 38, 24, 26, 131, 25,\n\t251, 43, 475, 67, 24, 32, 1447, 21, 19, 5276,\n];\n\n/**\n * Generates a Jsonable tree with statistical similarities to 'canada.json':\n * https://raw.githubusercontent.com/serde-rs/json-benchmark/master/data/canada.json\n */\nexport function generateCanada(segmentLengths = originalSegmentLengths, seed = 1): Canada {\n\tconst random = makeRandom(seed);\n\n\t// Distribution parameters were calculated from 'canada.json', rounded for brevity,\n\t// and then the gzipped size compared with the original tree to verify that the\n\t// these choices generate a tree with similar entropy.\n\tconst vxDist = () => random.normal(/* mean: */ 0, /* stdDev: */ 75);\n\tconst vyDist = () => random.normal(/* mean: */ 0, /* stdDev: */ 20);\n\tconst noiseDist = () => random.real(/* min: */ -18e-14, /* max: */ 18e-14);\n\n\tlet last_x = -65;\n\tlet last_y = 43;\n\n\t// To generate geometry similar to 'canada.json', we map the array of segment lengths to\n\t// an array of segments, where the coordinates of each segment is randomly generated using\n\t// Brownian motion.\n\tconst segments = segmentLengths.map((len: number) => {\n\t\tconst clamp = (min: number, value: number, max: number) =>\n\t\t\tMath.max(Math.min(value, max), min);\n\n\t\t// An interesting detail of 'canada.json' is that coordinates typically have ~6 digits of\n\t\t// precision, followed by ~8 consecutive zeros or nines, and then a couple additional digits.\n\t\t// We generate similar coordinates by truncating values to 6 digits of precision and then\n\t\t// adding a very small amount of noise.\n\t\tconst noise = (x: number) => Math.trunc(x * 1000000) / 1000000 + noiseDist();\n\n\t\treturn new Array(len)\n\t\t\t.fill(0)\n\t\t\t.map(\n\t\t\t\t() =>\n\t\t\t\t\t[\n\t\t\t\t\t\t(last_x = noise(clamp(-141, last_x + vxDist(), -52))),\n\t\t\t\t\t\t(last_y = noise(clamp(41, last_y + vyDist(), 83))),\n\t\t\t\t\t] as [number, number],\n\t\t\t);\n\t});\n\n\treturn {\n\t\ttype: \"FeatureCollection\",\n\t\tfeatures: [\n\t\t\t{\n\t\t\t\ttype: \"Feature\",\n\t\t\t\tproperties: { name: \"Canada\" },\n\t\t\t\tgeometry: { type: \"Polygon\", coordinates: segments },\n\t\t\t},\n\t\t],\n\t};\n}\n"]}

package/lib/test/domains/json/citm.d.ts

@@ -1,81 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { FieldKey } from "../../../core/index.js";
-/**
- * This file contains logic to generate a JSON file that is statistically similar to the well-known
- * json benchmarks citm_catalog.json - https://github.com/serde-rs/json-benchmark/blob/master/data/citm_catalog.json
- */
-export interface CitmCatalog {
-    areaNames: Record<string, string>;
-    audienceSubCategoryNames: Record<string, string>;
-    blockNames: Record<string, never>;
-    events: Record<string, Event>;
-    performances: Performance[];
-    seatCategoryNames: Record<string, string>;
-    subTopicNames: Record<string, string>;
-    subjectNames: Record<string, never>;
-    topicNames: Record<string, string>;
-    topicSubTopics: Record<string, number[]>;
-    venueNames: {
-        PLEYEL_PLEYEL: "Salle Pleyel";
-    };
-}
-export declare const CitmCatalog: {
-    SharedTreeFieldKey: {
-        performances: FieldKey;
-        seatCategories: FieldKey;
-        start: FieldKey;
-    };
-};
-interface Performance {
-    eventId: number;
-    id: number;
-    logo: string | null;
-    name: null;
-    prices: {
-        amount: number;
-        audienceSubCategoryId: number;
-        seatCategoryId: number;
-    }[];
-    seatCategories: {
-        areas: {
-            areaId: number;
-            blockIds: never[];
-        }[];
-        seatCategoryId: number;
-    }[];
-    seatMapImage: null;
-    start: number;
-    venueCode: "PLEYEL_PLEYEL";
-}
-interface Event {
-    description: null;
-    id: number;
-    logo: string | null;
-    name: string;
-    subTopicIds: number[];
-    subjectCode: null;
-    subtitle: null;
-    topicIds: number[];
-}
-export declare function generateCitmJson(keyspaceMultiplier: number | undefined, maxSizeInBytes: number, seed?: number): {
-    areaNames: Record<string, string>;
-    audienceSubCategoryNames: {
-        [x: string]: string;
-    };
-    blockNames: Record<string, never>;
-    events: Record<string, Event>;
-    performances: Performance[];
-    seatCategoryNames: Record<string, string>;
-    subTopicNames: Record<string, string>;
-    subjectNames: Record<string, never>;
-    topicNames: Record<string, string>;
-    topicSubTopics: Record<string, number[]>;
-    venueNames: {
-        PLEYEL_PLEYEL: string;
-    };
-};
-export {};
-//# sourceMappingURL=citm.d.ts.map

package/lib/test/domains/json/citm.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"citm.d.ts","sourceRoot":"","sources":["../../../../src/test/domains/json/citm.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAIlD;;;GAGG;AAEH,MAAM,WAAW,WAAW;IAG3B,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAIlC,wBAAwB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjD,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAClC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC9B,YAAY,EAAE,WAAW,EAAE,CAAC;IAG5B,iBAAiB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAG1C,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACpC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACzC,UAAU,EAAE;QACX,aAAa,EAAE,cAAc,CAAC;KAC9B,CAAC;CACF;AAED,eAAO,MAAM,WAAW;;;;;;CAOvB,CAAC;AAEF,UAAU,WAAW;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,IAAI,EAAE,IAAI,CAAC;IACX,MAAM,EAAE;QACP,MAAM,EAAE,MAAM,CAAC;QACf,qBAAqB,EAAE,MAAM,CAAC;QAC9B,cAAc,EAAE,MAAM,CAAC;KACvB,EAAE,CAAC;IACJ,cAAc,EAAE;QACf,KAAK,EAAE;YACN,MAAM,EAAE,MAAM,CAAC;YACf,QAAQ,EAAE,KAAK,EAAE,CAAC;SAClB,EAAE,CAAC;QACJ,cAAc,EAAE,MAAM,CAAC;KACvB,EAAE,CAAC;IACJ,YAAY,EAAE,IAAI,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,eAAe,CAAC;CAC3B;AAED,UAAU,KAAK;IACd,WAAW,EAAE,IAAI,CAAC;IAClB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,WAAW,EAAE,IAAI,CAAC;IAClB,QAAQ,EAAE,IAAI,CAAC;IACf,QAAQ,EAAE,MAAM,EAAE,CAAC;CACnB;AA+BD,wBAAgB,gBAAgB,CAAC,kBAAkB,oBAAY,EAAE,cAAc,EAAE,MAAM,EAAE,IAAI,SAAI;;;;;;;;;;;;;;;;EAmMhG"}