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

package/lib/test/feature-libraries/modular-schema/genericFieldKind.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"genericFieldKind.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/modular-schema/genericFieldKind.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAGN,gBAAgB,EAEhB,wBAAwB,GACxB,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EACN,cAAc,GAKd,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACN,eAAe,EACf,KAAK,EAEL,oBAAoB,GACpB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAEN,kCAAkC,EAClC,qBAAqB,EACrB,oBAAoB,GACpB,MAAM,gBAAgB,CAAC;AAIxB,OAAO,EAAkB,UAAU,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAC9E,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAEhE,MAAM,aAAa,GAAa,KAAK,CAAC,OAAO,CAAC,CAAC;AAE/C,MAAM,MAAM,GAAa,KAAK,CAAC,GAAG,CAAC,CAAC;AAEpC,MAAM,eAAe,GAAmB,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAC3D,MAAM,eAAe,GAAmB,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAC3D,MAAM,eAAe,GAAmB,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAC3D,MAAM,eAAe,GAAmB,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAC3D,MAAM,eAAe,GAAmB,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAE3D,SAAS,yBAAyB,CAAC,WAA2B;IAC7D,OAAO;QACN,YAAY,EAAE,IAAI,GAAG,CAAC;YACrB;gBACC,MAAM;gBACN;oBACC,SAAS,EAAE,UAAU,CAAC,UAAU;oBAChC,MAAM,EAAE,KAAK,CAAC,WAAW,CAAC;iBAC1B;aACD;SACD,CAAC;KACF,CAAC;AACH,CAAC;AAED,SAAS,yBAAyB,CAAC,UAAyB;IAC3D,oEAAoE;IACpE,OAAO,UAAU,CAAC,YAAa,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,MAAmC,CAAC;AAClF,CAAC;AAED,MAAM,cAAc,GAAkB,yBAAyB,CAAC,eAAe,CAAC,CAAC;AACjF,MAAM,cAAc,GAAkB,yBAAyB,CAAC,eAAe,CAAC,CAAC;AACjF,MAAM,cAAc,GAAkB,yBAAyB,CAAC,eAAe,CAAC,CAAC;AACjF,MAAM,cAAc,GAAkB,yBAAyB,CAAC,eAAe,CAAC,CAAC;AACjF,MAAM,cAAc,GAAkB,yBAAyB,CAAC,eAAe,CAAC,CAAC;AAEjF,MAAM,kBAAkB,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;AAEhE,MAAM,gBAAgB,GAA2B;IAChD,gBAAgB,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,gCAAgC,CAAC;IACrE,QAAQ,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,iCAAiC,CAAC;IAC9D,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,gCAAgC,CAAC;IAC/D,WAAW,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,gCAAgC,CAAC;CAChE,CAAC;AAEF,MAAM,aAAa,GAAG,CACrB,WAAsC,EACtC,WAAsC,EACtB,EAAE;IAClB,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,MAAM,CAAC,WAAW,KAAK,SAAS,EAAE,6CAA6C,CAAC,CAAC;QACjF,OAAO,WAAW,CAAC;KACnB;SAAM,IAAI,WAAW,KAAK,SAAS,EAAE;QACrC,OAAO,WAAW,CAAC;KACnB;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,OAAO,CAAC,OAAO,CAC/C,cAAc,CAAC,yBAAyB,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,EAC5D,cAAc,CAAC,yBAAyB,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,EAC5D,kBAAkB,EAClB,eAAe,EACf,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;IACF,OAAO,yBAAyB,CAAC,WAAW,CAAC,CAAC;AAC/C,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CACpB,WAAsC,EACtC,WAAsC,EACV,EAAE;IAC9B,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,OAAO,SAAS,CAAC;KACjB;IAED,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,OAAO,WAAW,CAAC;KACnB;IAED,MAAM,YAAY,GAAG,yBAAyB,CAAC,WAAW,CAAC,CAAC;IAC5D,MAAM,YAAY,GAAG,yBAAyB,CAAC,WAAW,CAAC,CAAC;IAC5D,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,MAAM,CAC1C,YAAY,EACZ,cAAc,CAAC,YAAY,CAAC,EAC5B,kBAAkB,EAClB,eAAe,EACf,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;IACF,OAAO,yBAAyB,CAAC,OAAO,CAAC,CAAC;AAC3C,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CAAC,UAAyB,EAAiB,EAAE;IACjE,MAAM,WAAW,GAAG,yBAAyB,CAAC,UAAU,CAAC,CAAC;IAC1D,MAAM,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC;IACxC,OAAO,mBAAmB,CAAC,WAAW,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF,SAAS,mBAAmB,CAAC,WAA2B;IACvD,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,YAAY,CAAC,SAAS,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxF,CAAC;AAED,MAAM,iBAAiB,GAAsB;IAC5C,GAAG,EAAE,kBAAkB;IACvB,GAAG,EAAE,kBAAkB;CACvB,CAAC;AAEF,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,aAAa,EAAE,CAAC;IAEhB,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC1C,MAAM,OAAO,GAAqB;gBACjC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,OAAO,GAAqB;gBACjC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,QAAQ,GAAqB;gBAClC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAC5D,cAAc,CAAC,OAAO,CAAC,EACvB,cAAc,CAAC,OAAO,CAAC,EACvB,aAAa,EACb,eAAe,EACf,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACxC,MAAM,OAAO,GAAqB;gBACjC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,OAAO,GAAqB;gBACjC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,QAAQ,GAAqB;gBAClC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAC5D,cAAc,CAAC,OAAO,CAAC,EACvB,cAAc,CAAC,OAAO,CAAC,EACvB,aAAa,EACb,eAAe,EACf,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC1C,MAAM,OAAO,GAAqB;gBACjC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,OAAO,GAAqB;gBACjC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,QAAQ,GAAqB;gBAClC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAC3D,OAAO,EACP,cAAc,CAAC,OAAO,CAAC,EACvB,YAAY,EACZ,eAAe,EACf,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACxC,MAAM,OAAO,GAAqB;gBACjC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,OAAO,GAAqB;gBACjC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,QAAQ,GAAqB;gBAClC;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;gBACD;oBACC,KAAK,EAAE,CAAC;oBACR,UAAU,EAAE,cAAc;iBAC1B;aACD,CAAC;YACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAC3D,OAAO,EACP,cAAc,CAAC,OAAO,CAAC,EACvB,YAAY,EACZ,eAAe,EACf,iBAAiB,EACjB,gBAAgB,CAChB,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,MAAM,OAAO,GAAqB;YACjC;gBACC,KAAK,EAAE,CAAC;gBACR,UAAU,EAAE,cAAc;aAC1B;YACD;gBACC,KAAK,EAAE,CAAC;gBACR,UAAU,EAAE,cAAc;aAC1B;SACD,CAAC;QACF,MAAM,QAAQ,GAAqB;YAClC;gBACC,KAAK,EAAE,CAAC;gBACR,UAAU,EAAE,cAAc;aAC1B;YACD;gBACC,KAAK,EAAE,CAAC;gBACR,UAAU,EAAE,cAAc;aAC1B;SACD,CAAC;QACF,MAAM,YAAY,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAC3D,YAAY,EACZ,CAAC,UAAyB,EAAiB,EAAE;YAC5C,IAAI,UAAU,KAAK,cAAc,EAAE;gBAClC,OAAO,cAAc,CAAC;aACtB;YACD,IAAI,UAAU,KAAK,cAAc,EAAE;gBAClC,OAAO,cAAc,CAAC;aACtB;YACD,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;QACxC,CAAC,EACD,IAAI,EACJ,oBAAoB,EAAE,EACtB,iBAAiB,EACjB,kCAAkC,CAAC,CAAC,YAAY,CAAC,CAAC,CAClD,CAAC;QACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,WAAW,EAAE,GAAG,EAAE;QACpB,MAAM,KAAK,GAAqB;YAC/B;gBACC,KAAK,EAAE,CAAC;gBACR,UAAU,EAAE,cAAc;aAC1B;YACD;gBACC,KAAK,EAAE,CAAC;gBACR,UAAU,EAAE,cAAc;aAC1B;SACD,CAAC;QAEF,MAAM,QAAQ,GAAsB;YACnC,KAAK,EAAE;gBACN,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,mBAAmB,CAAC,eAAe,CAAC,EAAE;gBAC1D,EAAE,KAAK,EAAE,CAAC,EAAE;gBACZ,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,mBAAmB,CAAC,eAAe,CAAC,EAAE;aAC1D;SACD,CAAC;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,SAAS,CACtD,cAAc,CAAC,KAAK,CAAC,EACrB,YAAY,EACZ,wBAAwB,CAAC,UAAU,EAAE,CACrC,CAAC;QACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,MAAM,gBAAgB,GACrB;YACC,SAAS,EAAE;gBACV;oBACC,MAAM;oBACN;wBACC;4BACC,KAAK,EAAE,CAAC;4BACR,UAAU,EAAE,cAAc;yBAC1B;wBACD;4BACC,KAAK,EAAE,CAAC;4BACR,UAAU,EAAE,cAAc;yBAC1B;qBACD;oBACD,EAAE,YAAY,EAAE,UAAuB,EAAE;iBACzC;aACD;SACD,CAAC;QAEH,MAAM,SAAS,GAAG,YAAY,CAAC,aAAa,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/D,MAAM,UAAU,GAKZ;YACH,MAAM,EAAE,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE;gBAC/B,MAAM,WAAW,GAAG,yBAAyB,CAAC,UAAU,CAAC,CAAC;gBAC1D,OAAO,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAC/C,CAAC;YACD,MAAM,EAAE,CAAC,UAAU,EAAE,YAAY,EAAE,EAAE;gBACpC,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;gBAC/D,OAAO,yBAAyB,CAAC,WAAW,CAAC,CAAC;YAC/C,CAAC;SACD,CAAC;QAEF,qBAAqB,CACpB,gBAAgB,CAAC,aAAa,CAAC,aAAa,CAAC,UAAU,EAAE,oBAAoB,CAAC,EAC9E,gBAAgB,CAChB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC7B,MAAM,OAAO,GAAG,gBAAgB,CAAC,aAAa,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QAC1F,MAAM,OAAO,GAAG,gBAAgB,CAAC,aAAa,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QAC1F,MAAM,OAAO,GAAG,gBAAgB,CAAC,aAAa,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QAC1F,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC;QACtE,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC;QACtE,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,oBAAoB,CACjE,cAAc,CAAC;YACd;gBACC,KAAK,EAAE,CAAC;gBACR,UAAU,EAAE,cAAc;aAC1B;YACD;gBACC,KAAK,EAAE,CAAC;gBACR,UAAU,EAAE,cAAc;aAC1B;SACD,CAAC,EACF,CAAC,KAAK,EAAE,EAAE,CACT,KAAK,KAAK,cAAc;YACvB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACjB,CAAC,CAAC,KAAK,KAAK,cAAc;gBAC1B,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;gBACjB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,CACnC,CAAC;QACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACtE,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 { SessionId } from \"@fluidframework/id-compressor\";\nimport {\n\tNodeChangeset,\n\tGenericChangeset,\n\tgenericFieldKind,\n\tCrossFieldManager,\n\tMemoizedIdRangeAllocator,\n} from \"../../../feature-libraries/index.js\";\nimport {\n\tmakeAnonChange,\n\tFieldKey,\n\tDeltaFieldMap,\n\tDeltaFieldChanges,\n\tChangeEncodingContext,\n} from \"../../../core/index.js\";\nimport {\n\tfakeIdAllocator,\n\tbrand,\n\tJsonCompatibleReadOnly,\n\tidAllocatorFromMaxId,\n} from \"../../../util/index.js\";\nimport {\n\tEncodingTestData,\n\tdefaultRevisionMetadataFromChanges,\n\tmakeEncodingTestSuite,\n\ttestRevisionTagCodec,\n} from \"../../utils.js\";\nimport { IJsonCodec } from \"../../../codec/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { RebaseRevisionMetadata } from \"../../../feature-libraries/modular-schema/index.js\";\nimport { ValueChangeset, valueField, valueHandler } from \"./basicRebasers.js\";\nimport { testSnapshots } from \"./genericFieldSnapshots.test.js\";\n\nconst valueFieldKey: FieldKey = brand(\"Value\");\n\nconst fieldA: FieldKey = brand(\"a\");\n\nconst valueChange0To1: ValueChangeset = { old: 0, new: 1 };\nconst valueChange1To0: ValueChangeset = { old: 1, new: 0 };\nconst valueChange1To2: ValueChangeset = { old: 1, new: 2 };\nconst valueChange2To1: ValueChangeset = { old: 2, new: 1 };\nconst valueChange0To2: ValueChangeset = { old: 0, new: 2 };\n\nfunction nodeChangeFromValueChange(valueChange: ValueChangeset): NodeChangeset {\n\treturn {\n\t\tfieldChanges: new Map([\n\t\t\t[\n\t\t\t\tfieldA,\n\t\t\t\t{\n\t\t\t\t\tfieldKind: valueField.identifier,\n\t\t\t\t\tchange: brand(valueChange),\n\t\t\t\t},\n\t\t\t],\n\t\t]),\n\t};\n}\n\nfunction valueChangeFromNodeChange(nodeChange: NodeChangeset): ValueChangeset {\n\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\treturn nodeChange.fieldChanges!.get(fieldA)!.change as unknown as ValueChangeset;\n}\n\nconst nodeChange0To1: NodeChangeset = nodeChangeFromValueChange(valueChange0To1);\nconst nodeChange1To0: NodeChangeset = nodeChangeFromValueChange(valueChange1To0);\nconst nodeChange1To2: NodeChangeset = nodeChangeFromValueChange(valueChange1To2);\nconst nodeChange2To1: NodeChangeset = nodeChangeFromValueChange(valueChange2To1);\nconst nodeChange0To2: NodeChangeset = nodeChangeFromValueChange(valueChange0To2);\n\nconst unexpectedDelegate = () => assert.fail(\"Unexpected call\");\n\nconst revisionMetadata: RebaseRevisionMetadata = {\n\tgetBaseRevisions: () => assert.fail(\"Unexpected revision info query\"),\n\tgetIndex: () => assert.fail(\"Unexpected revision index query\"),\n\ttryGetInfo: () => assert.fail(\"Unexpected revision info query\"),\n\thasRollback: () => assert.fail(\"Unexpected revision info query\"),\n};\n\nconst childComposer = (\n\tnodeChange1: NodeChangeset | undefined,\n\tnodeChange2: NodeChangeset | undefined,\n): NodeChangeset => {\n\tif (nodeChange1 === undefined) {\n\t\tassert(nodeChange2 !== undefined, \"Should not compose two undefined changesets\");\n\t\treturn nodeChange2;\n\t} else if (nodeChange2 === undefined) {\n\t\treturn nodeChange1;\n\t}\n\n\tconst valueChange = valueHandler.rebaser.compose(\n\t\tmakeAnonChange(valueChangeFromNodeChange(nodeChange1 ?? {})),\n\t\tmakeAnonChange(valueChangeFromNodeChange(nodeChange2 ?? {})),\n\t\tunexpectedDelegate,\n\t\tfakeIdAllocator,\n\t\tcrossFieldManager,\n\t\trevisionMetadata,\n\t);\n\treturn nodeChangeFromValueChange(valueChange);\n};\n\nconst childRebaser = (\n\tnodeChangeA: NodeChangeset | undefined,\n\tnodeChangeB: NodeChangeset | undefined,\n): NodeChangeset | undefined => {\n\tif (nodeChangeA === undefined) {\n\t\treturn undefined;\n\t}\n\n\tif (nodeChangeB === undefined) {\n\t\treturn nodeChangeA;\n\t}\n\n\tconst valueChangeA = valueChangeFromNodeChange(nodeChangeA);\n\tconst valueChangeB = valueChangeFromNodeChange(nodeChangeB);\n\tconst rebased = valueHandler.rebaser.rebase(\n\t\tvalueChangeA,\n\t\tmakeAnonChange(valueChangeB),\n\t\tunexpectedDelegate,\n\t\tfakeIdAllocator,\n\t\tcrossFieldManager,\n\t\trevisionMetadata,\n\t);\n\treturn nodeChangeFromValueChange(rebased);\n};\n\nconst childToDelta = (nodeChange: NodeChangeset): DeltaFieldMap => {\n\tconst valueChange = valueChangeFromNodeChange(nodeChange);\n\tassert(typeof valueChange !== \"number\");\n\treturn deltaForValueChange(valueChange);\n};\n\nfunction deltaForValueChange(valueChange: ValueChangeset): DeltaFieldMap {\n\treturn new Map([[valueFieldKey, valueHandler.intoDelta(makeAnonChange(valueChange))]]);\n}\n\nconst crossFieldManager: CrossFieldManager = {\n\tget: unexpectedDelegate,\n\tset: unexpectedDelegate,\n};\n\ndescribe(\"GenericField\", () => {\n\ttestSnapshots();\n\n\tdescribe(\"compose\", () => {\n\t\tit(\"Highest index on earlier change\", () => {\n\t\t\tconst changeA: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 2,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst changeB: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 1,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst expected: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 1,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 2,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst actual = genericFieldKind.changeHandler.rebaser.compose(\n\t\t\t\tmakeAnonChange(changeA),\n\t\t\t\tmakeAnonChange(changeB),\n\t\t\t\tchildComposer,\n\t\t\t\tfakeIdAllocator,\n\t\t\t\tcrossFieldManager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t\tassert.deepEqual(actual, expected);\n\t\t});\n\n\t\tit(\"Highest index on later change\", () => {\n\t\t\tconst changeA: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 1,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst changeB: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 2,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst expected: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 1,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 2,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst actual = genericFieldKind.changeHandler.rebaser.compose(\n\t\t\t\tmakeAnonChange(changeA),\n\t\t\t\tmakeAnonChange(changeB),\n\t\t\t\tchildComposer,\n\t\t\t\tfakeIdAllocator,\n\t\t\t\tcrossFieldManager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t\tassert.deepEqual(actual, expected);\n\t\t});\n\t});\n\n\tdescribe(\"rebase\", () => {\n\t\tit(\"Highest index on earlier change\", () => {\n\t\t\tconst changeA: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 2,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst changeB: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 1,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst expected: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 2,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst actual = genericFieldKind.changeHandler.rebaser.rebase(\n\t\t\t\tchangeA,\n\t\t\t\tmakeAnonChange(changeB),\n\t\t\t\tchildRebaser,\n\t\t\t\tfakeIdAllocator,\n\t\t\t\tcrossFieldManager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t\tassert.deepEqual(actual, expected);\n\t\t});\n\n\t\tit(\"Highest index on later change\", () => {\n\t\t\tconst changeA: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 1,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst changeB: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 2,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst expected: GenericChangeset = [\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 1,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t];\n\t\t\tconst actual = genericFieldKind.changeHandler.rebaser.rebase(\n\t\t\t\tchangeA,\n\t\t\t\tmakeAnonChange(changeB),\n\t\t\t\tchildRebaser,\n\t\t\t\tfakeIdAllocator,\n\t\t\t\tcrossFieldManager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t\tassert.deepEqual(actual, expected);\n\t\t});\n\t});\n\n\tit(\"invert\", () => {\n\t\tconst forward: GenericChangeset = [\n\t\t\t{\n\t\t\t\tindex: 0,\n\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t},\n\t\t\t{\n\t\t\t\tindex: 1,\n\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t},\n\t\t];\n\t\tconst expected: GenericChangeset = [\n\t\t\t{\n\t\t\t\tindex: 0,\n\t\t\t\tnodeChange: nodeChange1To0,\n\t\t\t},\n\t\t\t{\n\t\t\t\tindex: 1,\n\t\t\t\tnodeChange: nodeChange2To1,\n\t\t\t},\n\t\t];\n\t\tconst taggedChange = makeAnonChange(forward);\n\t\tconst actual = genericFieldKind.changeHandler.rebaser.invert(\n\t\t\ttaggedChange,\n\t\t\t(nodeChange: NodeChangeset): NodeChangeset => {\n\t\t\t\tif (nodeChange === nodeChange0To1) {\n\t\t\t\t\treturn nodeChange1To0;\n\t\t\t\t}\n\t\t\t\tif (nodeChange === nodeChange1To2) {\n\t\t\t\t\treturn nodeChange2To1;\n\t\t\t\t}\n\t\t\t\tassert.fail(\"Unexpected child change\");\n\t\t\t},\n\t\t\ttrue,\n\t\t\tidAllocatorFromMaxId(),\n\t\t\tcrossFieldManager,\n\t\t\tdefaultRevisionMetadataFromChanges([taggedChange]),\n\t\t);\n\t\tassert.deepEqual(actual, expected);\n\t});\n\n\tit(\"intoDelta\", () => {\n\t\tconst input: GenericChangeset = [\n\t\t\t{\n\t\t\t\tindex: 0,\n\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t},\n\t\t\t{\n\t\t\t\tindex: 2,\n\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t},\n\t\t];\n\n\t\tconst expected: DeltaFieldChanges = {\n\t\t\tlocal: [\n\t\t\t\t{ count: 1, fields: deltaForValueChange(valueChange0To1) },\n\t\t\t\t{ count: 1 },\n\t\t\t\t{ count: 1, fields: deltaForValueChange(valueChange1To2) },\n\t\t\t],\n\t\t};\n\n\t\tconst actual = genericFieldKind.changeHandler.intoDelta(\n\t\t\tmakeAnonChange(input),\n\t\t\tchildToDelta,\n\t\t\tMemoizedIdRangeAllocator.fromNextId(),\n\t\t);\n\t\tassert.deepEqual(actual, expected);\n\t});\n\n\tdescribe(\"Encoding\", () => {\n\t\tconst encodingTestData: EncodingTestData<GenericChangeset, unknown, ChangeEncodingContext> =\n\t\t\t{\n\t\t\t\tsuccesses: [\n\t\t\t\t\t[\n\t\t\t\t\t\t\"Misc\",\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tindex: 0,\n\t\t\t\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tindex: 2,\n\t\t\t\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t\t{ originatorId: \"session1\" as SessionId },\n\t\t\t\t\t],\n\t\t\t\t],\n\t\t\t};\n\n\t\tconst leafCodec = valueHandler.codecsFactory().resolve(0).json;\n\t\tconst childCodec: IJsonCodec<\n\t\t\tNodeChangeset,\n\t\t\tJsonCompatibleReadOnly,\n\t\t\tJsonCompatibleReadOnly,\n\t\t\tChangeEncodingContext\n\t\t> = {\n\t\t\tencode: (nodeChange, context) => {\n\t\t\t\tconst valueChange = valueChangeFromNodeChange(nodeChange);\n\t\t\t\treturn leafCodec.encode(valueChange, context);\n\t\t\t},\n\t\t\tdecode: (nodeChange, originatorId) => {\n\t\t\t\tconst valueChange = leafCodec.decode(nodeChange, originatorId);\n\t\t\t\treturn nodeChangeFromValueChange(valueChange);\n\t\t\t},\n\t\t};\n\n\t\tmakeEncodingTestSuite(\n\t\t\tgenericFieldKind.changeHandler.codecsFactory(childCodec, testRevisionTagCodec),\n\t\t\tencodingTestData,\n\t\t);\n\t});\n\n\tit(\"build child change\", () => {\n\t\tconst change0 = genericFieldKind.changeHandler.editor.buildChildChange(0, nodeChange0To1);\n\t\tconst change1 = genericFieldKind.changeHandler.editor.buildChildChange(1, nodeChange0To1);\n\t\tconst change2 = genericFieldKind.changeHandler.editor.buildChildChange(2, nodeChange0To1);\n\t\tassert.deepEqual(change0, [{ index: 0, nodeChange: nodeChange0To1 }]);\n\t\tassert.deepEqual(change1, [{ index: 1, nodeChange: nodeChange0To1 }]);\n\t\tassert.deepEqual(change2, [{ index: 2, nodeChange: nodeChange0To1 }]);\n\t});\n\n\tit(\"relevantRemovedRoots\", () => {\n\t\tconst actual = genericFieldKind.changeHandler.relevantRemovedRoots(\n\t\t\tmakeAnonChange([\n\t\t\t\t{\n\t\t\t\t\tindex: 0,\n\t\t\t\t\tnodeChange: nodeChange0To1,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tindex: 2,\n\t\t\t\t\tnodeChange: nodeChange1To2,\n\t\t\t\t},\n\t\t\t]),\n\t\t\t(child) =>\n\t\t\t\tchild === nodeChange0To1\n\t\t\t\t\t? [{ minor: 42 }]\n\t\t\t\t\t: child === nodeChange1To2\n\t\t\t\t\t? [{ minor: 43 }]\n\t\t\t\t\t: assert.fail(\"Unexpected child\"),\n\t\t);\n\t\tassert.deepEqual(Array.from(actual), [{ minor: 42 }, { minor: 43 }]);\n\t});\n});\n"]}

package/lib/test/feature-libraries/modular-schema/genericFieldSnapshots.test.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export declare function testSnapshots(): void;
-//# sourceMappingURL=genericFieldSnapshots.test.d.ts.map

package/lib/test/feature-libraries/modular-schema/genericFieldSnapshots.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"genericFieldSnapshots.test.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/modular-schema/genericFieldSnapshots.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AA8BH,wBAAgB,aAAa,SAkB5B"}

package/lib/test/feature-libraries/modular-schema/genericFieldSnapshots.test.js

@@ -1,49 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-// eslint-disable-next-line import/no-internal-modules
-import { makeGenericChangeCodec } from "../../../feature-libraries/modular-schema/genericFieldKindCodecs.js";
-import { TestChange } from "../../testChange.js";
-import { takeJsonSnapshot, useSnapshotDirectory } from "../../snapshots/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { snapshotSessionId } from "../../snapshots/testTrees.js";
-const nodeChange = TestChange.mint([], 1);
-const testChangesets = [
-    {
-        name: "empty",
-        change: [],
-    },
-    {
-        name: "one change",
-        change: [{ index: 42, nodeChange }],
-    },
-    {
-        name: "several changes",
-        change: [
-            { index: 0, nodeChange },
-            { index: 1, nodeChange },
-            { index: 42, nodeChange },
-        ],
-    },
-];
-export function testSnapshots() {
-    describe("Snapshots", () => {
-        useSnapshotDirectory("generic-field");
-        const family = makeGenericChangeCodec(TestChange.codec);
-        for (const version of family.getSupportedFormats()) {
-            describe(`version ${version}`, () => {
-                const codec = family.resolve(version);
-                for (const { name, change } of testChangesets) {
-                    it(name, () => {
-                        const encoded = codec.json.encode(change, {
-                            originatorId: snapshotSessionId,
-                        });
-                        takeJsonSnapshot(encoded);
-                    });
-                }
-            });
-        }
-    });
-}
-//# sourceMappingURL=genericFieldSnapshots.test.js.map

package/lib/test/feature-libraries/modular-schema/genericFieldSnapshots.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"genericFieldSnapshots.test.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/modular-schema/genericFieldSnapshots.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,sDAAsD;AACtD,OAAO,EAAE,sBAAsB,EAAE,MAAM,qEAAqE,CAAC;AAC7G,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AAClF,sDAAsD;AACtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAEjE,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AAC1C,MAAM,cAAc,GAA6D;IAChF;QACC,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,EAAE;KACV;IACD;QACC,IAAI,EAAE,YAAY;QAClB,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;KACnC;IACD;QACC,IAAI,EAAE,iBAAiB;QACvB,MAAM,EAAE;YACP,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE;YACxB,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE;YACxB,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE;SACzB;KACD;CACD,CAAC;AAEF,MAAM,UAAU,aAAa;IAC5B,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QAC1B,oBAAoB,CAAC,eAAe,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,sBAAsB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACxD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,mBAAmB,EAAE,EAAE;YACnD,QAAQ,CAAC,WAAW,OAAO,EAAE,EAAE,GAAG,EAAE;gBACnC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBACtC,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,cAAc,EAAE;oBAC9C,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;wBACb,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;4BACzC,YAAY,EAAE,iBAAiB;yBAC/B,CAAC,CAAC;wBACH,gBAAgB,CAAC,OAAO,CAAC,CAAC;oBAC3B,CAAC,CAAC,CAAC;iBACH;YACF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { GenericChangeset } from \"../../../feature-libraries/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { makeGenericChangeCodec } from \"../../../feature-libraries/modular-schema/genericFieldKindCodecs.js\";\nimport { TestChange } from \"../../testChange.js\";\nimport { takeJsonSnapshot, useSnapshotDirectory } from \"../../snapshots/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { snapshotSessionId } from \"../../snapshots/testTrees.js\";\n\nconst nodeChange = TestChange.mint([], 1);\nconst testChangesets: { name: string; change: GenericChangeset<TestChange> }[] = [\n\t{\n\t\tname: \"empty\",\n\t\tchange: [],\n\t},\n\t{\n\t\tname: \"one change\",\n\t\tchange: [{ index: 42, nodeChange }],\n\t},\n\t{\n\t\tname: \"several changes\",\n\t\tchange: [\n\t\t\t{ index: 0, nodeChange },\n\t\t\t{ index: 1, nodeChange },\n\t\t\t{ index: 42, nodeChange },\n\t\t],\n\t},\n];\n\nexport function testSnapshots() {\n\tdescribe(\"Snapshots\", () => {\n\t\tuseSnapshotDirectory(\"generic-field\");\n\t\tconst family = makeGenericChangeCodec(TestChange.codec);\n\t\tfor (const version of family.getSupportedFormats()) {\n\t\t\tdescribe(`version ${version}`, () => {\n\t\t\t\tconst codec = family.resolve(version);\n\t\t\t\tfor (const { name, change } of testChangesets) {\n\t\t\t\t\tit(name, () => {\n\t\t\t\t\t\tconst encoded = codec.json.encode(change, {\n\t\t\t\t\t\t\toriginatorId: snapshotSessionId,\n\t\t\t\t\t\t});\n\t\t\t\t\t\ttakeJsonSnapshot(encoded);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n}\n"]}

package/lib/test/feature-libraries/modular-schema/isNeverTree.spec.d.ts

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

package/lib/test/feature-libraries/modular-schema/isNeverTree.spec.d.ts.map

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

package/lib/test/feature-libraries/modular-schema/isNeverTree.spec.js

@@ -1,126 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { isNeverField, isNeverTree,
-// Allow importing from this specific file which is being tested:
-/* eslint-disable-next-line import/no-internal-modules */
- } from "../../../feature-libraries/modular-schema/isNeverTree.js";
-import { storedEmptyFieldSchema, MapNodeStoredSchema, ObjectNodeStoredSchema, TreeStoredSchemaRepository, } from "../../../core/index.js";
-import { brand } from "../../../util/index.js";
-import { defaultSchemaPolicy, FieldKinds } from "../../../feature-libraries/index.js";
-/* eslint-disable-next-line import/no-internal-modules */
-import { allowsTreeSuperset } from "../../../feature-libraries/modular-schema/index.js";
-/**
- * Empty readonly map.
- */
-const emptyMap = new Map();
-/**
- * Helper for building {@link TreeFieldStoredSchema}.
- * @internal
- */
-function fieldSchema(kind, types) {
-    return {
-        kind,
-        types: types === undefined ? undefined : new Set(types),
-    };
-}
-describe("Schema Comparison", () => {
-    /**
-     * TreeFieldStoredSchema permits anything.
-     * Note that children inside the field still have to be in schema.
-     */
-    const anyField = fieldSchema(FieldKinds.sequence);
-    /**
-     * TreeNodeStoredSchema that permits anything without a value.
-     * Note that children under the fields still have to be in schema.
-     */
-    const anyTreeWithoutValue = new MapNodeStoredSchema(anyField);
-    /**
-     * TreeFieldStoredSchema which is impossible for any data to be in schema with.
-     */
-    const neverField = fieldSchema(FieldKinds.required, []);
-    /**
-     * TreeNodeStoredSchema which is impossible for any data to be in schema with.
-     */
-    const neverTree = new MapNodeStoredSchema(neverField);
-    const neverTree2 = new ObjectNodeStoredSchema(new Map([[brand("x"), neverField]]));
-    const emptyTree = {
-        name: brand("empty"),
-        schema: new ObjectNodeStoredSchema(new Map()),
-    };
-    const emptyLocalFieldTree = {
-        name: brand("emptyLocalFieldTree"),
-        schema: new ObjectNodeStoredSchema(new Map([[brand("x"), storedEmptyFieldSchema]])),
-    };
-    const optionalLocalFieldTree = {
-        name: brand("optionalLocalFieldTree"),
-        schema: new ObjectNodeStoredSchema(new Map([[brand("x"), fieldSchema(FieldKinds.optional, [emptyTree.name])]])),
-    };
-    const valueLocalFieldTree = {
-        name: brand("valueLocalFieldTree"),
-        schema: new ObjectNodeStoredSchema(new Map([[brand("x"), fieldSchema(FieldKinds.required, [emptyTree.name])]])),
-    };
-    const valueAnyField = fieldSchema(FieldKinds.required);
-    const valueEmptyTreeField = fieldSchema(FieldKinds.required, [emptyTree.name]);
-    const optionalAnyField = fieldSchema(FieldKinds.optional);
-    const optionalEmptyTreeField = fieldSchema(FieldKinds.optional, [emptyTree.name]);
-    function updateTreeSchema(repo, identifier, schema) {
-        repo.apply({
-            rootFieldSchema: repo.rootFieldSchema,
-            nodeSchema: new Map([...repo.nodeSchema, [identifier, schema]]),
-        });
-    }
-    it("isNeverField", () => {
-        const repo = new TreeStoredSchemaRepository();
-        assert(isNeverField(defaultSchemaPolicy, repo, neverField));
-        updateTreeSchema(repo, brand("never"), neverTree);
-        const neverField2 = fieldSchema(FieldKinds.required, [
-            brand("never"),
-        ]);
-        assert(isNeverField(defaultSchemaPolicy, repo, neverField2));
-        assert.equal(isNeverField(defaultSchemaPolicy, repo, storedEmptyFieldSchema), false);
-        assert.equal(isNeverField(defaultSchemaPolicy, repo, anyField), false);
-        assert.equal(isNeverField(defaultSchemaPolicy, repo, valueEmptyTreeField), true);
-        updateTreeSchema(repo, brand("empty"), emptyTree.schema);
-        assert.equal(isNeverField(defaultSchemaPolicy, repo, fieldSchema(FieldKinds.required, [brand("empty")])), false);
-        assert.equal(isNeverField(defaultSchemaPolicy, repo, valueAnyField), false);
-        assert.equal(isNeverField(defaultSchemaPolicy, repo, valueEmptyTreeField), false);
-        assert.equal(isNeverField(defaultSchemaPolicy, repo, optionalAnyField), false);
-        assert.equal(isNeverField(defaultSchemaPolicy, repo, optionalEmptyTreeField), false);
-    });
-    it("isNeverTree", () => {
-        const repo = new TreeStoredSchemaRepository();
-        assert(isNeverTree(defaultSchemaPolicy, repo, neverTree));
-        assert(isNeverTree(defaultSchemaPolicy, repo, new MapNodeStoredSchema(neverField)));
-        assert(isNeverTree(defaultSchemaPolicy, repo, neverTree2));
-        assert(isNeverTree(defaultSchemaPolicy, repo, undefined));
-        assert.equal(isNeverTree(defaultSchemaPolicy, repo, new ObjectNodeStoredSchema(emptyMap)), false);
-        assert.equal(isNeverTree(defaultSchemaPolicy, repo, anyTreeWithoutValue), false);
-        assert(allowsTreeSuperset(defaultSchemaPolicy, repo, repo.nodeSchema.get(emptyTree.name), emptyTree.schema));
-        updateTreeSchema(repo, emptyTree.name, emptyTree.schema);
-        assert.equal(isNeverTree(defaultSchemaPolicy, repo, emptyLocalFieldTree.schema), false);
-        assert.equal(isNeverTree(defaultSchemaPolicy, repo, valueLocalFieldTree.schema), false);
-        assert.equal(isNeverTree(defaultSchemaPolicy, repo, optionalLocalFieldTree.schema), false);
-    });
-    it("isNeverTreeRecursive", () => {
-        const repo = new TreeStoredSchemaRepository();
-        const recursiveField = fieldSchema(FieldKinds.required, [brand("recursive")]);
-        const recursiveType = new MapNodeStoredSchema(recursiveField);
-        updateTreeSchema(repo, brand("recursive"), recursiveType);
-        assert(isNeverTree(defaultSchemaPolicy, repo, recursiveType));
-    });
-    it("isNeverTreeRecursive non-never", () => {
-        const repo = new TreeStoredSchemaRepository();
-        const recursiveField = fieldSchema(FieldKinds.required, [
-            brand("recursive"),
-            emptyTree.name,
-        ]);
-        const recursiveType = new MapNodeStoredSchema(recursiveField);
-        updateTreeSchema(repo, emptyTree.name, emptyTree.schema);
-        updateTreeSchema(repo, brand("recursive"), recursiveType);
-        assert(isNeverTree(defaultSchemaPolicy, repo, recursiveType));
-    });
-});
-//# sourceMappingURL=isNeverTree.spec.js.map

package/lib/test/feature-libraries/modular-schema/isNeverTree.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"isNeverTree.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/modular-schema/isNeverTree.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EACN,YAAY,EACZ,WAAW;AACX,iEAAiE;AACjE,yDAAyD;EACzD,MAAM,0DAA0D,CAAC;AAClE,OAAO,EAIN,sBAAsB,EAEtB,mBAAmB,EACnB,sBAAsB,EAEtB,0BAA0B,GAC1B,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACtF,yDAAyD;AACzD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oDAAoD,CAAC;AAExF;;GAEG;AACH,MAAM,QAAQ,GAA8B,IAAI,GAAG,EAAgB,CAAC;AAEpE;;;GAGG;AACH,SAAS,WAAW,CACnB,IAAyC,EACzC,KAA0C;IAE1C,OAAO;QACN,IAAI;QACJ,KAAK,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC;KACvD,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IAClC;;;OAGG;IACH,MAAM,QAAQ,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAElD;;;OAGG;IACH,MAAM,mBAAmB,GAAyB,IAAI,mBAAmB,CAAC,QAAQ,CAAC,CAAC;IAEpF;;OAEG;IACH,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAExD;;OAEG;IACH,MAAM,SAAS,GAAyB,IAAI,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAE5E,MAAM,UAAU,GAAyB,IAAI,sBAAsB,CAClE,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CACnC,CAAC;IAEF,MAAM,SAAS,GAAG;QACjB,IAAI,EAAE,KAAK,CAA2B,OAAO,CAAC;QAC9C,MAAM,EAAE,IAAI,sBAAsB,CAAC,IAAI,GAAG,EAAE,CAAC;KAC7C,CAAC;IAEF,MAAM,mBAAmB,GAAG;QAC3B,IAAI,EAAE,KAAK,CAA2B,qBAAqB,CAAC;QAC5D,MAAM,EAAE,IAAI,sBAAsB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,sBAAsB,CAAC,CAAC,CAAC,CAAC;KACnF,CAAC;IAEF,MAAM,sBAAsB,GAAG;QAC9B,IAAI,EAAE,KAAK,CAA2B,wBAAwB,CAAC;QAC/D,MAAM,EAAE,IAAI,sBAAsB,CACjC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3E;KACD,CAAC;IACF,MAAM,mBAAmB,GAAG;QAC3B,IAAI,EAAE,KAAK,CAA2B,qBAAqB,CAAC;QAC5D,MAAM,EAAE,IAAI,sBAAsB,CACjC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3E;KACD,CAAC;IACF,MAAM,aAAa,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IACvD,MAAM,mBAAmB,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/E,MAAM,gBAAgB,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC1D,MAAM,sBAAsB,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAElF,SAAS,gBAAgB,CACxB,IAA6B,EAC7B,UAAoC,EACpC,MAA4B;QAE5B,IAAI,CAAC,KAAK,CAAC;YACV,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,UAAU,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC;SAC/D,CAAC,CAAC;IACJ,CAAC;IAED,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;QACvB,MAAM,IAAI,GAAG,IAAI,0BAA0B,EAAE,CAAC;QAC9C,MAAM,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;QAC5D,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,CAAC;QAClD,MAAM,WAAW,GAA0B,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE;YAC3E,KAAK,CAAC,OAAO,CAAC;SACd,CAAC,CAAC;QACH,MAAM,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,sBAAsB,CAAC,EAAE,KAAK,CAAC,CAAC;QACrF,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QACvE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,mBAAmB,CAAC,EAAE,IAAI,CAAC,CAAC;QACjF,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,CAAC,KAAK,CACX,YAAY,CACX,mBAAmB,EACnB,IAAI,EACJ,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAClD,EACD,KAAK,CACL,CAAC;QACF,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5E,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,mBAAmB,CAAC,EAAE,KAAK,CAAC,CAAC;QAClF,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,gBAAgB,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/E,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,mBAAmB,EAAE,IAAI,EAAE,sBAAsB,CAAC,EAAE,KAAK,CAAC,CAAC;IACtF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACtB,MAAM,IAAI,GAAG,IAAI,0BAA0B,EAAE,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,IAAI,mBAAmB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACpF,MAAM,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QAC1D,MAAM,CAAC,KAAK,CACX,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,IAAI,sBAAsB,CAAC,QAAQ,CAAC,CAAC,EAC5E,KAAK,CACL,CAAC;QACF,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,mBAAmB,CAAC,EAAE,KAAK,CAAC,CAAC;QAEjF,MAAM,CACL,kBAAkB,CACjB,mBAAmB,EACnB,IAAI,EACJ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,EACnC,SAAS,CAAC,MAAM,CAChB,CACD,CAAC;QACF,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAEzD,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;QACxF,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;QACxF,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,sBAAsB,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,MAAM,IAAI,GAAG,IAAI,0BAA0B,EAAE,CAAC;QAC9C,MAAM,cAAc,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,aAAa,GAAG,IAAI,mBAAmB,CAAC,cAAc,CAAC,CAAC;QAC9D,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,WAAW,CAAC,EAAE,aAAa,CAAC,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG,IAAI,0BAA0B,EAAE,CAAC;QAC9C,MAAM,cAAc,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE;YACvD,KAAK,CAAC,WAAW,CAAC;YAClB,SAAS,CAAC,IAAI;SACd,CAAC,CAAC;QACH,MAAM,aAAa,GAAG,IAAI,mBAAmB,CAAC,cAAc,CAAC,CAAC;QAC9D,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QACzD,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,WAAW,CAAC,EAAE,aAAa,CAAC,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,mBAAmB,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC;IAC/D,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\tisNeverField,\n\tisNeverTree,\n\t// Allow importing from this specific file which is being tested:\n\t/* eslint-disable-next-line import/no-internal-modules */\n} from \"../../../feature-libraries/modular-schema/isNeverTree.js\";\nimport {\n\tTreeFieldStoredSchema,\n\tTreeNodeStoredSchema,\n\tTreeNodeSchemaIdentifier,\n\tstoredEmptyFieldSchema,\n\tFieldKindIdentifier,\n\tMapNodeStoredSchema,\n\tObjectNodeStoredSchema,\n\tMutableTreeStoredSchema,\n\tTreeStoredSchemaRepository,\n} from \"../../../core/index.js\";\nimport { brand } from \"../../../util/index.js\";\nimport { defaultSchemaPolicy, FieldKinds } from \"../../../feature-libraries/index.js\";\n/* eslint-disable-next-line import/no-internal-modules */\nimport { allowsTreeSuperset } from \"../../../feature-libraries/modular-schema/index.js\";\n\n/**\n * Empty readonly map.\n */\nconst emptyMap: ReadonlyMap<never, never> = new Map<never, never>();\n\n/**\n * Helper for building {@link TreeFieldStoredSchema}.\n * @internal\n */\nfunction fieldSchema(\n\tkind: { identifier: FieldKindIdentifier },\n\ttypes?: Iterable<TreeNodeSchemaIdentifier>,\n): TreeFieldStoredSchema {\n\treturn {\n\t\tkind,\n\t\ttypes: types === undefined ? undefined : new Set(types),\n\t};\n}\n\ndescribe(\"Schema Comparison\", () => {\n\t/**\n\t * TreeFieldStoredSchema permits anything.\n\t * Note that children inside the field still have to be in schema.\n\t */\n\tconst anyField = fieldSchema(FieldKinds.sequence);\n\n\t/**\n\t * TreeNodeStoredSchema that permits anything without a value.\n\t * Note that children under the fields still have to be in schema.\n\t */\n\tconst anyTreeWithoutValue: TreeNodeStoredSchema = new MapNodeStoredSchema(anyField);\n\n\t/**\n\t * TreeFieldStoredSchema which is impossible for any data to be in schema with.\n\t */\n\tconst neverField = fieldSchema(FieldKinds.required, []);\n\n\t/**\n\t * TreeNodeStoredSchema which is impossible for any data to be in schema with.\n\t */\n\tconst neverTree: TreeNodeStoredSchema = new MapNodeStoredSchema(neverField);\n\n\tconst neverTree2: TreeNodeStoredSchema = new ObjectNodeStoredSchema(\n\t\tnew Map([[brand(\"x\"), neverField]]),\n\t);\n\n\tconst emptyTree = {\n\t\tname: brand<TreeNodeSchemaIdentifier>(\"empty\"),\n\t\tschema: new ObjectNodeStoredSchema(new Map()),\n\t};\n\n\tconst emptyLocalFieldTree = {\n\t\tname: brand<TreeNodeSchemaIdentifier>(\"emptyLocalFieldTree\"),\n\t\tschema: new ObjectNodeStoredSchema(new Map([[brand(\"x\"), storedEmptyFieldSchema]])),\n\t};\n\n\tconst optionalLocalFieldTree = {\n\t\tname: brand<TreeNodeSchemaIdentifier>(\"optionalLocalFieldTree\"),\n\t\tschema: new ObjectNodeStoredSchema(\n\t\t\tnew Map([[brand(\"x\"), fieldSchema(FieldKinds.optional, [emptyTree.name])]]),\n\t\t),\n\t};\n\tconst valueLocalFieldTree = {\n\t\tname: brand<TreeNodeSchemaIdentifier>(\"valueLocalFieldTree\"),\n\t\tschema: new ObjectNodeStoredSchema(\n\t\t\tnew Map([[brand(\"x\"), fieldSchema(FieldKinds.required, [emptyTree.name])]]),\n\t\t),\n\t};\n\tconst valueAnyField = fieldSchema(FieldKinds.required);\n\tconst valueEmptyTreeField = fieldSchema(FieldKinds.required, [emptyTree.name]);\n\tconst optionalAnyField = fieldSchema(FieldKinds.optional);\n\tconst optionalEmptyTreeField = fieldSchema(FieldKinds.optional, [emptyTree.name]);\n\n\tfunction updateTreeSchema(\n\t\trepo: MutableTreeStoredSchema,\n\t\tidentifier: TreeNodeSchemaIdentifier,\n\t\tschema: TreeNodeStoredSchema,\n\t) {\n\t\trepo.apply({\n\t\t\trootFieldSchema: repo.rootFieldSchema,\n\t\t\tnodeSchema: new Map([...repo.nodeSchema, [identifier, schema]]),\n\t\t});\n\t}\n\n\tit(\"isNeverField\", () => {\n\t\tconst repo = new TreeStoredSchemaRepository();\n\t\tassert(isNeverField(defaultSchemaPolicy, repo, neverField));\n\t\tupdateTreeSchema(repo, brand(\"never\"), neverTree);\n\t\tconst neverField2: TreeFieldStoredSchema = fieldSchema(FieldKinds.required, [\n\t\t\tbrand(\"never\"),\n\t\t]);\n\t\tassert(isNeverField(defaultSchemaPolicy, repo, neverField2));\n\t\tassert.equal(isNeverField(defaultSchemaPolicy, repo, storedEmptyFieldSchema), false);\n\t\tassert.equal(isNeverField(defaultSchemaPolicy, repo, anyField), false);\n\t\tassert.equal(isNeverField(defaultSchemaPolicy, repo, valueEmptyTreeField), true);\n\t\tupdateTreeSchema(repo, brand(\"empty\"), emptyTree.schema);\n\t\tassert.equal(\n\t\t\tisNeverField(\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\trepo,\n\t\t\t\tfieldSchema(FieldKinds.required, [brand(\"empty\")]),\n\t\t\t),\n\t\t\tfalse,\n\t\t);\n\t\tassert.equal(isNeverField(defaultSchemaPolicy, repo, valueAnyField), false);\n\t\tassert.equal(isNeverField(defaultSchemaPolicy, repo, valueEmptyTreeField), false);\n\t\tassert.equal(isNeverField(defaultSchemaPolicy, repo, optionalAnyField), false);\n\t\tassert.equal(isNeverField(defaultSchemaPolicy, repo, optionalEmptyTreeField), false);\n\t});\n\n\tit(\"isNeverTree\", () => {\n\t\tconst repo = new TreeStoredSchemaRepository();\n\t\tassert(isNeverTree(defaultSchemaPolicy, repo, neverTree));\n\t\tassert(isNeverTree(defaultSchemaPolicy, repo, new MapNodeStoredSchema(neverField)));\n\t\tassert(isNeverTree(defaultSchemaPolicy, repo, neverTree2));\n\t\tassert(isNeverTree(defaultSchemaPolicy, repo, undefined));\n\t\tassert.equal(\n\t\t\tisNeverTree(defaultSchemaPolicy, repo, new ObjectNodeStoredSchema(emptyMap)),\n\t\t\tfalse,\n\t\t);\n\t\tassert.equal(isNeverTree(defaultSchemaPolicy, repo, anyTreeWithoutValue), false);\n\n\t\tassert(\n\t\t\tallowsTreeSuperset(\n\t\t\t\tdefaultSchemaPolicy,\n\t\t\t\trepo,\n\t\t\t\trepo.nodeSchema.get(emptyTree.name),\n\t\t\t\temptyTree.schema,\n\t\t\t),\n\t\t);\n\t\tupdateTreeSchema(repo, emptyTree.name, emptyTree.schema);\n\n\t\tassert.equal(isNeverTree(defaultSchemaPolicy, repo, emptyLocalFieldTree.schema), false);\n\t\tassert.equal(isNeverTree(defaultSchemaPolicy, repo, valueLocalFieldTree.schema), false);\n\t\tassert.equal(isNeverTree(defaultSchemaPolicy, repo, optionalLocalFieldTree.schema), false);\n\t});\n\n\tit(\"isNeverTreeRecursive\", () => {\n\t\tconst repo = new TreeStoredSchemaRepository();\n\t\tconst recursiveField = fieldSchema(FieldKinds.required, [brand(\"recursive\")]);\n\t\tconst recursiveType = new MapNodeStoredSchema(recursiveField);\n\t\tupdateTreeSchema(repo, brand(\"recursive\"), recursiveType);\n\t\tassert(isNeverTree(defaultSchemaPolicy, repo, recursiveType));\n\t});\n\n\tit(\"isNeverTreeRecursive non-never\", () => {\n\t\tconst repo = new TreeStoredSchemaRepository();\n\t\tconst recursiveField = fieldSchema(FieldKinds.required, [\n\t\t\tbrand(\"recursive\"),\n\t\t\temptyTree.name,\n\t\t]);\n\t\tconst recursiveType = new MapNodeStoredSchema(recursiveField);\n\t\tupdateTreeSchema(repo, emptyTree.name, emptyTree.schema);\n\t\tupdateTreeSchema(repo, brand(\"recursive\"), recursiveType);\n\t\tassert(isNeverTree(defaultSchemaPolicy, repo, recursiveType));\n\t});\n});\n"]}

package/lib/test/feature-libraries/modular-schema/modularChangeFamily.spec.d.ts

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

package/lib/test/feature-libraries/modular-schema/modularChangeFamily.spec.d.ts.map

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