@fgv/ts-sudoku-lib 2.0.2-alpha.0

package/lib/packlets/common/puzzle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"puzzle.js","sourceRoot":"","sources":["../../../src/packlets/common/puzzle.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,4CAAkE;AAWlE,iCAA8B;AAC9B,iCAA8B;AAC9B,+BAA4B;AAG5B,+CAA4C;AAE5C,MAAM,cAAc,GAAW,EAAE,CAAC;AAmBlC;;GAEG;AACH,MAAa,MAAM;IA8BjB;;;;OAIG;IACH,YAAsB,MAA0B,EAAE,UAA6B;QAC7E,6CAA6C;QAC7C,UAAU,GAAG,UAAU,aAAV,UAAU,cAAV,UAAU,GAAI,EAAE,CAAC;QAE9B,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,WAAW,MAAM,CAAC,WAAW,2BAA2B,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;SACxF;QACD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,WAAW,MAAM,CAAC,WAAW,8BAA8B,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;SAC3F;QACD,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE;YACrD,MAAM,IAAI,KAAK,CACb,WAAW,MAAM,CAAC,WAAW,cAAc,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,iBAClE,MAAM,CAAC,KAAK,CAAC,MACf,EAAE,CACH,CAAC;SACH;QAED,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;QAEtC,MAAM,IAAI,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACxE,MAAM,OAAO,GAAG,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9E,MAAM,QAAQ,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAChF,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,OAAO,EAAE,GAAG,QAAQ,EAAE,GAAG,UAAU,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QAExB,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACnC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;gBACjD,MAAM,EAAE,GAAG,SAAG,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC5D,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC;gBAE/E,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC9B,iGAAiG;gBACjG,MAAM,cAAc,GAAG,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,aAAJ,IAAI,cAAJ,IAAI,GAAI,GAAG,CAAC,CAAC;gBAC/E,IACE,cAAc,KAAK,SAAS;oBAC5B,CAAC,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC,CAAC,EAC1E;oBACA,MAAM,IAAI,KAAK,CAAC,UAAU,MAAM,CAAC,WAAW,mBAAmB,IAAI,cAAc,EAAE,EAAE,CAAC,CAAC;iBACxF;gBACD,MAAM,KAAK,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC5F,MAAM,IAAI,GAAG,IAAI,WAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;gBAC/D,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;aAC3B;SACF;QAED,IAAI,CAAC,YAAY,GAAG,yBAAW,CAAC,MAAM,CACpC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,EAAc,EAAE;YAChE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QACxD,CAAC,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED,IAAW,IAAI;QACb,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,IAAW,IAAI;QACb,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,IAAW,QAAQ;QACjB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,IAAW,KAAK;QACd,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,IAAW,KAAK;QACd,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACO,MAAM,CAAC,eAAe,CAAC,OAAe,EAAE,OAAe;QAC/D,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAChC,MAAM,EAAE,GAAG,SAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,OAAO,GAAG,SAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YAC9C,6DAA6D;YAC7D,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE;gBACvB,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC;aAC9B;YAED,MAAM,MAAM,GAAG,WAAI,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;gBACtF,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;gBACvB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC;YACH,6DAA6D;YAC7D,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE;gBACtB,OAAO,IAAA,eAAI,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC;aAC7B;SACF;QACD,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACO,MAAM,CAAC,kBAAkB,CAAC,OAAe,EAAE,OAAe;QAClE,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAChC,MAAM,EAAE,GAAG,SAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,OAAO,GAAG,SAAG,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,6DAA6D;YAC7D,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE;gBACvB,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC;aAC9B;YAED,MAAM,MAAM,GAAG,WAAI,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;gBACzF,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;gBACvB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC;YACH,6DAA6D;YAC7D,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE;gBACtB,OAAO,IAAA,eAAI,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC;aAC7B;SACF;QACD,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,mBAAmB,CAAC,OAAe,EAAE,OAAe;QACjE,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;gBACnC,MAAM,EAAE,GAAG,SAAG,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnC,MAAM,OAAO,GAAG,SAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACxC,6DAA6D;gBAC7D,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE;oBACvB,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC;iBAC9B;gBAED,MAAM,MAAM,GAAG,WAAI,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,cAAc,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;oBAC1F,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;oBACvB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;gBACvB,CAAC,CAAC,CAAC;gBACH,6DAA6D;gBAC7D,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE;oBACtB,OAAO,IAAA,eAAI,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC;iBAC7B;aACF;SACF;QACD,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAEM,aAAa,CAAC,KAAkB;QACrC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE;YACnC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;gBACvB,OAAO,KAAK,CAAC;aACd;SACF;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;gBACxB,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,YAAY,CAAC,KAAkB;QACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;gBACxB,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,aAAa,CAAC,KAAkB;QACrC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC;IAEM,eAAe,CAAC,KAAkB;QACvC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3E,CAAC;IAEM,eAAe,CACpB,IAAyB,EACzB,KAAkB;QAElB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;YAC3C,IAAI,IAAI,CAAC,SAAS,EAAE;gBAClB,MAAM,QAAQ,GAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,cAAc,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;gBAC1E,OAAO,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;aACpC;YACD,OAAO,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,QAAuB,EAAE,EAAE;gBAC1E,OAAO,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;YACrC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,OAAO,CAAC,IAAiC;QAC9C,MAAM,IAAI,GAAG,SAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE;YACpB,OAAO,IAAA,eAAI,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SAC3B;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,QAAQ,IAAI,CAAC,KAAK,YAAY,CAAC,CAAC;IACrE,CAAC;IAEM,eAAe,CACpB,IAAiC,EACjC,SAA8B,EAC9B,IAAoB;QAEpB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;YAC3C,MAAM,IAAI,GACR,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,OAAO;gBAC3C,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC;gBACzC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;YAC3C,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,cAAc,CAAC,WAAsC,EAAE,KAAkB;QAC9E,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACvE,OAAO,IAAA,qBAAU,EACf,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACpB,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE,CACvD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YACtD,MAAM,IAAI,mBAAiB,EAAE,EAAE,CAAC,CAAC,EAAE,IAAK,QAAQ,CAAC,QAAQ,CAAE,CAAC;YAC5D,OAAO,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CACH,CACF,CACF,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,EAAE;YAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,YAAyB,EAAE,EAAE;gBAC3F,OAAO,IAAA,kBAAO,EAAC;oBACb,IAAI,EAAE,KAAK;oBACX,EAAE,EAAE,YAAY;oBAChB,KAAK,EAAE,WAAW;iBACnB,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,YAAY,CAAC,WAAsC,EAAE,KAAkB;QAC5E,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACvE,OAAO,IAAA,qBAAU,EACf,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACpB,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE,CACvD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YACtE,MAAM,IAAI,mBAAiB,EAAE,EAAE,CAAC,CAAC,EAAE,IAAK,QAAQ,CAAC,QAAQ,CAAE,CAAC;YAC5D,OAAO,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CACH,CACF,CACF,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,EAAE;YAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,YAAyB,EAAE,EAAE;gBAC3F,OAAO,IAAA,kBAAO,EAAC;oBACb,IAAI,EAAE,KAAK;oBACX,EAAE,EAAE,YAAY;oBAChB,KAAK,EAAE,WAAW;iBACnB,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,WAAW,CAAC,WAAsC,EAAE,KAAkB;QAC3E,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACvE,OAAO,IAAA,qBAAU,EACf,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACpB,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE,CACvD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YACtE,MAAM,IAAI,mBAAiB,EAAE,EAAE,CAAC,CAAC,EAAE,IAAK,QAAQ,CAAC,QAAQ,CAAE,CAAC;YAC5D,OAAO,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CACH,CACF,CACF,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,EAAE;YAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,YAAyB,EAAE,EAAE;gBAC3F,OAAO,IAAA,kBAAO,EAAC;oBACb,IAAI,EAAE,KAAK;oBACX,EAAE,EAAE,YAAY;oBAChB,KAAK,EAAE,WAAW;iBACnB,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,eAAe,CACpB,IAAyB,EACzB,KAAyB,EACzB,KAAkB;QAElB,MAAM,QAAQ,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChF,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YAC/B,MAAM,MAAM,GAAe,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAChD,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,eAAe,CACpB,IAAyB,EACzB,KAAe,EACf,KAAkB;QAElB,MAAM,QAAQ,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChF,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YAC/B,MAAM,MAAM,GAAe,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAChD,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,MAAM,CAAC,GAAoB;QAChC,MAAM,EAAE,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IAC5D,CAAC;IAEM,SAAS,CAAC,GAAoB;QACnC,MAAM,EAAE,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IAC/D,CAAC;IAEM,UAAU,CAAC,IAAyB;QACzC,MAAM,EAAE,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAG,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACnF,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAChE,CAAC;IAEM,OAAO,CAAC,EAAU;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IAC7D,CAAC;IAEM,SAAS,CAAC,KAAkB;QACjC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3E,CAAC;IAEM,QAAQ,CAAC,KAAkB;QAChC,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IAEO,WAAW,CACjB,OAAmB,EACnB,SAA2B,EAC3B,IAAoB;QAEpB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;QAExB,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;QACtB,IAAI,SAAS,KAAK,MAAM,EAAE;YACxB,IAAI,GAAG,GAAG,CAAC,EAAE;gBACX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;aACf;iBAAM,IAAI,IAAI,KAAK,MAAM,EAAE;gBAC1B,GAAG,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;gBAC1B,IAAI,IAAI,KAAK,WAAW,EAAE;oBACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;iBACzD;aACF;iBAAM;gBACL,OAAO,IAAA,eAAI,EAAC,gCAAgC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;aAC5D;SACF;aAAM,IAAI,SAAS,KAAK,OAAO,EAAE;YAChC,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE;gBAC7B,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;aACf;iBAAM,IAAI,IAAI,KAAK,MAAM,EAAE;gBAC1B,GAAG,GAAG,CAAC,CAAC;gBACR,IAAI,IAAI,KAAK,WAAW,EAAE;oBACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;iBAC3D;aACF;iBAAM;gBACL,OAAO,IAAA,eAAI,EAAC,iCAAiC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;aAC7D;SACF;QACD,OAAO,IAAA,kBAAO,EAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC/B,CAAC;IAEO,QAAQ,CAAC,OAAmB,EAAE,SAAwB,EAAE,IAAoB;QAClF,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;QACtB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;QAExB,IAAI,SAAS,KAAK,IAAI,EAAE;YACtB,IAAI,GAAG,GAAG,CAAC,EAAE;gBACX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;aACf;iBAAM,IAAI,IAAI,KAAK,MAAM,EAAE;gBAC1B,GAAG,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;gBACvB,IAAI,IAAI,KAAK,WAAW,EAAE;oBACxB,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;iBAC9D;aACF;iBAAM;gBACL,OAAO,IAAA,eAAI,EAAC,2BAA2B,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;aACvD;SACF;aAAM,IAAI,SAAS,KAAK,MAAM,EAAE;YAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE;gBAC1B,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;aACf;iBAAM,IAAI,IAAI,KAAK,MAAM,EAAE;gBAC1B,GAAG,GAAG,CAAC,CAAC;gBACR,IAAI,IAAI,KAAK,WAAW,EAAE;oBACxB,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;iBAC/D;aACF;iBAAM;gBACL,OAAO,IAAA,eAAI,EAAC,6BAA6B,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;aACzD;SACF;QACD,OAAO,IAAA,kBAAO,EAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC/B,CAAC;CACF;AA1cD,wBA0cC","sourcesContent":["/*\n * MIT License\n *\n * Copyright (c) 2023 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { Result, fail, mapResults, succeed } from '@fgv/ts-utils';\nimport {\n  CageId,\n  CellId,\n  ICellContents,\n  ICellState,\n  IRowColumn,\n  NavigationDirection,\n  NavigationWrap\n} from './common';\n\nimport { Cage } from './cage';\nimport { Cell } from './cell';\nimport { Ids } from './ids';\nimport { IPuzzleDescription } from './model';\nimport { ICell } from './public';\nimport { PuzzleState } from './puzzleState';\n\nconst basicCageTotal: number = 45;\n\n/**\n * @internal\n */\nexport interface ICellUpdate {\n  from: ICellState;\n  to: ICellState;\n}\n\n/**\n * @internal\n */\nexport interface IPuzzleUpdate {\n  from: PuzzleState;\n  to: PuzzleState;\n  cells: ICellUpdate[];\n}\n\n/**\n * @internal\n */\nexport class Puzzle {\n  public readonly id?: string;\n  public readonly description: string;\n  public readonly initialState: PuzzleState;\n\n  /**\n   * @internal\n   */\n  protected readonly _rows: Map<CageId, Cage>;\n\n  /**\n   * @internal\n   */\n  protected readonly _columns: Map<CageId, Cage>;\n\n  /**\n   * @internal\n   */\n  protected readonly _sections: Map<CageId, Cage>;\n\n  /**\n   * @internal\n   */\n  protected readonly _cages: Map<CageId, Cage>;\n\n  /**\n   * @internal\n   */\n  protected readonly _cells: Map<CellId, Cell>;\n\n  /**\n   * Constructs a new puzzle state.\n   * @param puzzle - {@Link Data.Model.PuzzleDescription | Puzzle description} from which this puzzle state\n   * is to be initialized.\n   */\n  protected constructor(puzzle: IPuzzleDescription, extraCages?: [CageId, Cage][]) {\n    /* c8 ignore next - ?? is defense in depth */\n    extraCages = extraCages ?? [];\n\n    if (puzzle.rows !== 9) {\n      throw new Error(`Puzzle '${puzzle.description}' unsupported row count ${puzzle.rows}`);\n    }\n    if (puzzle.cols !== 9) {\n      throw new Error(`Puzzle '${puzzle.description}' unsupported column count ${puzzle.cols}`);\n    }\n    if (puzzle.cells.length !== puzzle.rows * puzzle.cols) {\n      throw new Error(\n        `Puzzle '${puzzle.description}\" expected ${puzzle.rows * puzzle.cols} cells, found ${\n          puzzle.cells.length\n        }`\n      );\n    }\n\n    this.id = puzzle.id;\n    this.description = puzzle.description;\n\n    const rows = Puzzle._createRowCages(puzzle.rows, puzzle.cols).orThrow();\n    const columns = Puzzle._createColumnCages(puzzle.rows, puzzle.cols).orThrow();\n    const sections = Puzzle._createSectionCages(puzzle.rows, puzzle.cols).orThrow();\n    const cages = [...rows, ...columns, ...sections, ...extraCages];\n    this._rows = new Map(rows);\n    this._columns = new Map(columns);\n    this._sections = new Map(sections);\n    this._cages = new Map(cages);\n    this._cells = new Map();\n\n    const cellInit = [...puzzle.cells];\n    for (let row = 0; row < this._rows.size; row++) {\n      const rowCage = this.getRow(row).orThrow();\n      for (let col = 0; col < this._columns.size; col++) {\n        const id = Ids.cellId({ row, col }).orThrow();\n        const colCage = this.getColumn(col).orThrow();\n        const sectionCage = this.getSection({ row, col }).orThrow();\n        const otherCages = extraCages.filter(([__key, cage]) => cage.containsCell(id));\n\n        const init = cellInit.shift();\n        /* c8 ignore next - defense in depth/make type check happy. undefined init should never happen */\n        const immutableValue = init === '.' ? undefined : Number.parseInt(init ?? '0');\n        if (\n          immutableValue !== undefined &&\n          (Number.isNaN(immutableValue) || immutableValue < 1 || immutableValue > 9)\n        ) {\n          throw new Error(`Puzzle ${puzzle.description} illegal value \"${init}\" for cell ${id}`);\n        }\n        const cages = [rowCage, colCage, sectionCage, ...otherCages.map(([__key, state]) => state)];\n        const cell = new Cell({ id, immutableValue, row, col }, cages);\n        this._cells.set(id, cell);\n      }\n    }\n\n    this.initialState = PuzzleState.create(\n      Array.from(this._cells.entries()).map(([id, state]): ICellState => {\n        return { id, value: state.immutableValue, notes: [] };\n      })\n    ).orThrow();\n  }\n\n  public get numRows(): number {\n    return this._rows.size;\n  }\n\n  public get numColumns(): number {\n    return this._columns.size;\n  }\n\n  public get rows(): Cage[] {\n    return Array.from(this._rows.values());\n  }\n\n  public get cols(): Cage[] {\n    return Array.from(this._columns.values());\n  }\n\n  public get sections(): Cage[] {\n    return Array.from(this._sections.values());\n  }\n\n  public get cages(): Cage[] {\n    return Array.from(this._cages.values());\n  }\n\n  public get cells(): Cell[] {\n    return Array.from(this._cells.values());\n  }\n\n  /**\n   * @internal\n   */\n  protected static _createRowCages(numRows: number, numCols: number): Result<[CageId, Cage][]> {\n    const cages: [CageId, Cage][] = [];\n    for (let r = 0; r < numRows; r++) {\n      const id = Ids.rowCageId(r);\n      const cellIds = Ids.cellIds(r, 1, 0, numCols);\n      /* c8 ignore next 3 - defense in depth should never happen */\n      if (cellIds.isFailure()) {\n        return fail(cellIds.message);\n      }\n\n      const result = Cage.create(id, 'row', basicCageTotal, cellIds.value).onSuccess((cage) => {\n        cages.push([id, cage]);\n        return succeed(cage);\n      });\n      /* c8 ignore next 3 - defense in depth should never happen */\n      if (result.isFailure()) {\n        return fail(result.message);\n      }\n    }\n    return succeed(cages);\n  }\n\n  /**\n   * @internal\n   */\n  protected static _createColumnCages(numRows: number, numCols: number): Result<[CageId, Cage][]> {\n    const cages: [CageId, Cage][] = [];\n    for (let c = 0; c < numCols; c++) {\n      const id = Ids.columnCageId(c);\n      const cellIds = Ids.cellIds(0, numRows, c, 1);\n      /* c8 ignore next 3 - defense in depth should never happen */\n      if (cellIds.isFailure()) {\n        return fail(cellIds.message);\n      }\n\n      const result = Cage.create(id, 'column', basicCageTotal, cellIds.value).onSuccess((cage) => {\n        cages.push([id, cage]);\n        return succeed(cage);\n      });\n      /* c8 ignore next 3 - defense in depth should never happen */\n      if (result.isFailure()) {\n        return fail(result.message);\n      }\n    }\n    return succeed(cages);\n  }\n\n  /**\n   * @internal\n   */\n  private static _createSectionCages(numRows: number, numCols: number): Result<[CageId, Cage][]> {\n    const cages: [CageId, Cage][] = [];\n    for (let r = 0; r < numRows; r += 3) {\n      for (let c = 0; c < numCols; c += 3) {\n        const id = Ids.sectionCageId(r, c);\n        const cellIds = Ids.cellIds(r, 3, c, 3);\n        /* c8 ignore next 3 - defense in depth should never happen */\n        if (cellIds.isFailure()) {\n          return fail(cellIds.message);\n        }\n\n        const result = Cage.create(id, 'section', basicCageTotal, cellIds.value).onSuccess((cage) => {\n          cages.push([id, cage]);\n          return succeed(cage);\n        });\n        /* c8 ignore next 3 - defense in depth should never happen */\n        if (result.isFailure()) {\n          return fail(result.message);\n        }\n      }\n    }\n    return succeed(cages);\n  }\n\n  public checkIsSolved(state: PuzzleState): boolean {\n    for (const id of this._cells.keys()) {\n      if (!state.hasValue(id)) {\n        return false;\n      }\n    }\n    for (const cell of this._cells.values()) {\n      if (!cell.isValid(state)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  public checkIsValid(state: PuzzleState): boolean {\n    for (const cell of this._cells.values()) {\n      if (!cell.isValid(state)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  public getEmptyCells(state: PuzzleState): Cell[] {\n    return Array.from(this._cells.values()).filter((c) => !state.hasValue(c.id));\n  }\n\n  public getInvalidCells(state: PuzzleState): Cell[] {\n    return Array.from(this._cells.values()).filter((c) => !c.isValid(state));\n  }\n\n  public getCellContents(\n    spec: string | IRowColumn,\n    state: PuzzleState\n  ): Result<{ cell: Cell; contents: ICellContents }> {\n    return this.getCell(spec).onSuccess((cell) => {\n      if (cell.immutable) {\n        const contents: ICellContents = { value: cell.immutableValue, notes: [] };\n        return succeed({ cell, contents });\n      }\n      return state.getCellContents(cell.id).onSuccess((contents: ICellContents) => {\n        return succeed({ cell, contents });\n      });\n    });\n  }\n\n  public getCell(spec: string | IRowColumn | ICell): Result<Cell> {\n    const want = Ids.cellId(spec);\n    if (want.isFailure()) {\n      return fail(want.message);\n    }\n\n    const cell = this._cells.get(want.value);\n    return cell ? succeed(cell) : fail(`Cell ${want.value} not found`);\n  }\n\n  public getCellNeighbor(\n    spec: string | IRowColumn | ICell,\n    direction: NavigationDirection,\n    wrap: NavigationWrap\n  ): Result<ICell> {\n    return this.getCell(spec).onSuccess((cell) => {\n      const move =\n        direction === 'left' || direction === 'right'\n          ? this._moveColumn(cell, direction, wrap)\n          : this._moveRow(cell, direction, wrap);\n      return move.onSuccess((next) => this.getCell(next));\n    });\n  }\n\n  public updateContents(wantUpdates: ICellState[] | ICellState, state: PuzzleState): Result<IPuzzleUpdate> {\n    wantUpdates = Array.isArray(wantUpdates) ? wantUpdates : [wantUpdates];\n    return mapResults(\n      wantUpdates.map((u) =>\n        this.getCellContents(u.id, state).onSuccess((existing) =>\n          existing.cell.update(u.value, u.notes).onSuccess((to) => {\n            const from: ICellState = { id: u.id, ...existing.contents };\n            return succeed({ from, to });\n          })\n        )\n      )\n    ).onSuccess((cellUpdates) => {\n      return state.update(cellUpdates.map(({ to }) => to)).onSuccess((updatedState: PuzzleState) => {\n        return succeed({\n          from: state,\n          to: updatedState,\n          cells: cellUpdates\n        });\n      });\n    });\n  }\n\n  public updateValues(wantUpdates: ICellState[] | ICellState, state: PuzzleState): Result<IPuzzleUpdate> {\n    wantUpdates = Array.isArray(wantUpdates) ? wantUpdates : [wantUpdates];\n    return mapResults(\n      wantUpdates.map((u) =>\n        this.getCellContents(u.id, state).onSuccess((existing) =>\n          existing.cell.update(u.value, existing.contents.notes).onSuccess((to) => {\n            const from: ICellState = { id: u.id, ...existing.contents };\n            return succeed({ from, to });\n          })\n        )\n      )\n    ).onSuccess((cellUpdates) => {\n      return state.update(cellUpdates.map(({ to }) => to)).onSuccess((updatedState: PuzzleState) => {\n        return succeed({\n          from: state,\n          to: updatedState,\n          cells: cellUpdates\n        });\n      });\n    });\n  }\n\n  public updateNotes(wantUpdates: ICellState[] | ICellState, state: PuzzleState): Result<IPuzzleUpdate> {\n    wantUpdates = Array.isArray(wantUpdates) ? wantUpdates : [wantUpdates];\n    return mapResults(\n      wantUpdates.map((u) =>\n        this.getCellContents(u.id, state).onSuccess((existing) =>\n          existing.cell.update(existing.contents.value, u.notes).onSuccess((to) => {\n            const from: ICellState = { id: u.id, ...existing.contents };\n            return succeed({ from, to });\n          })\n        )\n      )\n    ).onSuccess((cellUpdates) => {\n      return state.update(cellUpdates.map(({ to }) => to)).onSuccess((updatedState: PuzzleState) => {\n        return succeed({\n          from: state,\n          to: updatedState,\n          cells: cellUpdates\n        });\n      });\n    });\n  }\n\n  public updateCellValue(\n    want: string | IRowColumn,\n    value: number | undefined,\n    state: PuzzleState\n  ): Result<IPuzzleUpdate> {\n    const idResult = typeof want === 'string' ? Ids.cellId(want) : Ids.cellId(want);\n    const notes: number[] = [];\n    return idResult.onSuccess((id) => {\n      const update: ICellState = { id, value, notes };\n      return this.updateValues([update], state);\n    });\n  }\n\n  public updateCellNotes(\n    want: string | IRowColumn,\n    notes: number[],\n    state: PuzzleState\n  ): Result<IPuzzleUpdate> {\n    const idResult = typeof want === 'string' ? Ids.cellId(want) : Ids.cellId(want);\n    const value = undefined;\n    return idResult.onSuccess((id) => {\n      const update: ICellState = { id, value, notes };\n      return this.updateNotes([update], state);\n    });\n  }\n\n  public getRow(row: CageId | number): Result<Cage> {\n    const id = typeof row === 'number' ? Ids.rowCageId(row) : row;\n    const cage = this._rows.get(id);\n    return cage ? succeed(cage) : fail(`Row ${id} not found`);\n  }\n\n  public getColumn(col: CageId | number): Result<Cage> {\n    const id = typeof col === 'number' ? Ids.columnCageId(col) : col;\n    const cage = this._columns.get(id);\n    return cage ? succeed(cage) : fail(`Column ${id} not found`);\n  }\n\n  public getSection(spec: CageId | IRowColumn): Result<Cage> {\n    const id = typeof spec === 'object' ? Ids.sectionCageId(spec.row, spec.col) : spec;\n    const cage = this._sections.get(id);\n    return cage ? succeed(cage) : fail(`Section ${id} not found`);\n  }\n\n  public getCage(id: CageId): Result<Cage> {\n    const cage = this._cages.get(id);\n    return cage ? succeed(cage) : fail(`Cage ${id} not found`);\n  }\n\n  public toStrings(state: PuzzleState): string[] {\n    return Array.from(this._rows.values()).map((row) => row.toString(state));\n  }\n\n  public toString(state: PuzzleState): string {\n    return this.toStrings(state).join('\\n');\n  }\n\n  private _moveColumn(\n    current: IRowColumn,\n    direction: 'left' | 'right',\n    wrap: NavigationWrap\n  ): Result<IRowColumn> {\n    const row = current.row;\n\n    let col = current.col;\n    if (direction === 'left') {\n      if (col > 0) {\n        col = col - 1;\n      } else if (wrap !== 'none') {\n        col = this.numColumns - 1;\n        if (wrap === 'wrap-next') {\n          return this._moveRow({ row, col }, 'up', 'wrap-around');\n        }\n      } else {\n        return fail(`cannot move left from column ${current.col}`);\n      }\n    } else if (direction === 'right') {\n      if (col < this.numColumns - 1) {\n        col = col + 1;\n      } else if (wrap !== 'none') {\n        col = 0;\n        if (wrap === 'wrap-next') {\n          return this._moveRow({ row, col }, 'down', 'wrap-around');\n        }\n      } else {\n        return fail(`cannot move right from column ${current.col}`);\n      }\n    }\n    return succeed({ row, col });\n  }\n\n  private _moveRow(current: IRowColumn, direction: 'up' | 'down', wrap: NavigationWrap): Result<IRowColumn> {\n    let row = current.row;\n    const col = current.col;\n\n    if (direction === 'up') {\n      if (row > 0) {\n        row = row - 1;\n      } else if (wrap !== 'none') {\n        row = this.numRows - 1;\n        if (wrap === 'wrap-next') {\n          return this._moveColumn({ row, col }, 'left', 'wrap-around');\n        }\n      } else {\n        return fail(`cannot move up from row ${current.row}`);\n      }\n    } else if (direction === 'down') {\n      if (row < this.numRows - 1) {\n        row = row + 1;\n      } else if (wrap !== 'none') {\n        row = 0;\n        if (wrap === 'wrap-next') {\n          return this._moveColumn({ row, col }, 'right', 'wrap-around');\n        }\n      } else {\n        return fail(`cannot move down from row ${current.row}`);\n      }\n    }\n    return succeed({ row, col });\n  }\n}\n"]}

package/lib/packlets/common/puzzleSession.d.ts

@@ -0,0 +1,214 @@
+import { Result } from '@fgv/ts-utils';
+import { ICellContents, ICellState, IRowColumn, NavigationDirection, NavigationWrap } from './common';
+import { ICage, ICell } from './public';
+import { ICellUpdate, Puzzle } from './puzzle';
+import { PuzzleState } from './puzzleState';
+interface IPuzzleStep {
+    updates: ICellUpdate[];
+}
+/**
+ * Represents a single puzzle session, including puzzle, current state and redo/undo.
+ * @public
+ */
+export declare class PuzzleSession {
+    /**
+     * The current {@link PuzzleState | state} of this puzzle session.
+     */
+    state: PuzzleState;
+    protected readonly _puzzle: Puzzle;
+    protected _nextStep: number;
+    protected _numSteps: number;
+    protected _steps: IPuzzleStep[];
+    /**
+     * @internal
+     */
+    protected constructor(puzzle: Puzzle);
+    /**
+     * ID of the puzzle being solved.
+     */
+    get id(): string | undefined;
+    /**
+     * Description of the puzzle being solved.
+     */
+    get description(): string;
+    /**
+     * Number of rows in the puzzle being solved.
+     */
+    get numRows(): number;
+    /**
+     * Number of columns in the puzzle being solved.
+     */
+    get numColumns(): number;
+    /**
+     * The row {@link ICage | cages} in the puzzle being solved.
+     */
+    get rows(): ICage[];
+    /**
+     * The column {@link ICage | cages} in the puzzle being solved.
+     */
+    get cols(): ICage[];
+    /**
+     * The section {@link ICage | cages} in the puzzle being solved.
+     */
+    get sections(): ICage[];
+    /**
+     * All {@link ICage | cages} in the puzzle being solved.
+     */
+    get cages(): ICage[];
+    /**
+     * The cells {@link ICell | cells} in the puzzle being solved.
+     */
+    get cells(): ICell[];
+    /**
+     * Index of the next step in this puzzle session.
+     */
+    get nextStep(): number;
+    /**
+     * Number of steps currently elapsed in this puzzle session.  Note
+     * that after undo, `nextStep` will be less than `numSteps`.
+     */
+    get numSteps(): number;
+    /***
+     * Indicates whether undo is currently possible.
+     */
+    get canUndo(): boolean;
+    /**
+     * Indicates whether redo is currently possible.
+     */
+    get canRedo(): boolean;
+    /**
+     * Creates a new {@link PuzzleSession | puzzle session} from a supplied
+     * {@link Puzzle | puzzle}.
+     * @param puzzle - The {@link Puzzle | puzzle} from which the session is to be
+     * initialized.
+     * @returns `Success` with the requested {@link PuzzleSession | puzzle session},
+     * or `Failure` with details if an error occurs.
+     */
+    static create(puzzle: Puzzle): Result<PuzzleSession>;
+    /**
+     * Determines if the puzzle is correctly solved.
+     * @returns `true` if the puzzle is solved, `false` if the puzzle has
+     * empty or invalid cells.
+     */
+    checkIsSolved(): boolean;
+    /**
+     * Determines if the puzzle is valid in its current state.
+     * @returns `true` if all non-empty cells in the puzzle are valid,
+     * or `false` if any cells are invalid.
+     */
+    checkIsValid(): boolean;
+    /**
+     * Gets all of the currently empty {@link ICell | cells} in the puzzle.
+     * @returns An array of {@link ICell | ICell} with all empty cells.
+     */
+    getEmptyCells(): ICell[];
+    /**
+     * Gets all of the currently invalid {@link ICell | cells} in the puzzle.
+     * @returns An array of {@link ICell | ICell} with all invalid cells.
+     */
+    getInvalidCells(): ICell[];
+    /**
+     * Determines if a cell is valid.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be tested.
+     * @returns `true` if the cell value is valid, `false` if the cell value or the cell itself is invalid.
+     */
+    cellIsValid(spec: string | IRowColumn | ICell): boolean;
+    /**
+     * Determines if a cell has a value.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be tested.
+     * @returns `true` if the cell has a value, `false` if the cell is empty or the cell itself is invalid.
+     */
+    cellHasValue(spec: string | IRowColumn | ICell): boolean;
+    /**
+     * Determines if supplied value is valid for a specific cell.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be tested.
+     * @param value - The value to be tested.
+     * @returns `true` if `value` is valid for the requested cell, `false` if the value or the cell itself is invalid.
+     */
+    isValidForCell(spec: string | IRowColumn | ICell, value: number): boolean;
+    /**
+     * Gets the neighbor for a cell in a given direction using specified wrapping rules.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be tested.
+     * @param direction - The direction of the desired neighbor.
+     * @param wrap - Wrapping rules to be applied.
+     * @returns `Success` with the requested {@link ICell | cell}, or `Failure` with details if an error occurs.
+     */
+    getCellNeighbor(spec: string | IRowColumn | ICell, direction: NavigationDirection, wrap: NavigationWrap): Result<ICell>;
+    /**
+     * Gets the {@link ICellContents | contents} for a specified cell.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be queried.
+     * @returns `Success` with the {@link ICell | cell description} and {@link ICellContents | cell contents}, or
+     * `Failure` with details if an error occurs.
+     */
+    getCellContents(spec: string | IRowColumn): Result<{
+        cell: ICell;
+        contents: ICellContents;
+    }>;
+    /**
+     * Updates the value of a cell.
+     * @param spec - A `string`, {@link IRowColumn | row and column}, or {@link ICell | cell} identifying
+     * the cell to be updated.
+     * @param value - A new value for the cell.
+     * @returns `Success` with `this` if the update is applied, `Failure` with details if an error occurs.
+     */
+    updateCellValue(spec: string | IRowColumn | ICell, value: number | undefined): Result<this>;
+    /**
+     * Updates the notes on a cell.
+     * @param spec - A `string`, {@link IRowColumn | row and column}, or {@link ICell | cell} identifying
+     * the cell to be updated.
+     * @param notes - New notes for the cell.
+     * @returns `Success` with `this` if the update is applied, `Failure` with details if an error occurs.
+     */
+    updateCellNotes(spec: string | IRowColumn | ICell, notes: number[]): Result<this>;
+    /**
+     * Updates value & notes for multiple cells.
+     * @param updates - An array of {@link ICellState | cell state} objects, each describing
+     * one cell to be updated.
+     * @returns `Success` with `this` if the updates are applied, `Failure` with details if
+     * an error occurs.
+     */
+    updateCells(updates: ICellState[]): Result<this>;
+    /**
+     * Determines if some {@link ICage | cage} contains a specific value.
+     * @param spec - A `string` ({@link CageId | CageId}) or {@link ICage | ICage}
+     * indicating the cage to be tested.
+     * @param value - The value to be tested.
+     * @returns `true` if the cage exists and contains the specified value,
+     * `false` otherwise.
+     */
+    cageContainsValue(spec: string | ICage, value: number): boolean;
+    /**
+     * Determines the numbers currently present in some cage.
+     * @param spec - A `string` ({@link CageId | CageId}) or {@link ICage | ICage}
+     * indicating the cage to be tested.
+     * @returns A `Set<number>` containing all numbers present in the cage.
+     */
+    cageContainedValues(spec: string | ICage): Set<number>;
+    /**
+     * Undo a single move in this puzzle session.
+     * @returns `Success` with `this` if the undo is applied, or `Failure`
+     * with details if an error occurs.
+     */
+    undo(): Result<this>;
+    /**
+     * Redo a single move in this puzzle session.
+     * @returns `Success` with `this` if the redo is applied, or `Failure`
+     * with details if an error occurs.
+     */
+    redo(): Result<this>;
+    /**
+     * Gets a string representation of this puzzle, one string
+     * per row.
+     */
+    toStrings(): string[];
+    private _addMove;
+    private _cage;
+    private _cell;
+}
+export {};
+//# sourceMappingURL=puzzleSession.d.ts.map

package/lib/packlets/common/puzzleSession.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"puzzleSession.d.ts","sourceRoot":"","sources":["../../../src/packlets/common/puzzleSession.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,MAAM,EAAgC,MAAM,eAAe,CAAC;AAGrE,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,EAAE,mBAAmB,EAAE,cAAc,EAAE,MAAM,UAAU,CAAC;AAEtG,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACxC,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C,UAAU,WAAW;IACnB,OAAO,EAAE,WAAW,EAAE,CAAC;CACxB;AAED;;;GAGG;AACH,qBAAa,aAAa;IACxB;;OAEG;IACI,KAAK,EAAE,WAAW,CAAC;IAE1B,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACnC,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC;IAC5B,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC;IAC5B,SAAS,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC;IAEhC;;OAEG;IACH,SAAS,aAAa,MAAM,EAAE,MAAM;IAQpC;;OAEG;IACH,IAAW,EAAE,IAAI,MAAM,GAAG,SAAS,CAElC;IAED;;OAEG;IACH,IAAW,WAAW,IAAI,MAAM,CAE/B;IAED;;OAEG;IACH,IAAW,OAAO,IAAI,MAAM,CAE3B;IAED;;OAEG;IACH,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED;;OAEG;IACH,IAAW,IAAI,IAAI,KAAK,EAAE,CAEzB;IAED;;OAEG;IACH,IAAW,IAAI,IAAI,KAAK,EAAE,CAEzB;IAED;;OAEG;IACH,IAAW,QAAQ,IAAI,KAAK,EAAE,CAE7B;IAED;;OAEG;IACH,IAAW,KAAK,IAAI,KAAK,EAAE,CAE1B;IAED;;OAEG;IACH,IAAW,KAAK,IAAI,KAAK,EAAE,CAE1B;IAED;;OAEG;IACH,IAAW,QAAQ,IAAI,MAAM,CAE5B;IAED;;;OAGG;IACH,IAAW,QAAQ,IAAI,MAAM,CAE5B;IAED;;OAEG;IACH,IAAW,OAAO,IAAI,OAAO,CAE5B;IAED;;OAEG;IACH,IAAW,OAAO,IAAI,OAAO,CAE5B;IAED;;;;;;;OAOG;WACW,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;IAI3D;;;;OAIG;IACI,aAAa,IAAI,OAAO;IAI/B;;;;OAIG;IACI,YAAY,IAAI,OAAO;IAI9B;;;OAGG;IACI,aAAa,IAAI,KAAK,EAAE;IAI/B;;;OAGG;IACI,eAAe,IAAI,KAAK,EAAE;IAIjC;;;;;OAKG;IACI,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,KAAK,GAAG,OAAO;IAI9D;;;;;OAKG;IACI,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,KAAK,GAAG,OAAO;IAI/D;;;;;;OAMG;IACI,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;IAIhF;;;;;;;OAOG;IACI,eAAe,CACpB,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,KAAK,EACjC,SAAS,EAAE,mBAAmB,EAC9B,IAAI,EAAE,cAAc,GACnB,MAAM,CAAC,KAAK,CAAC;IAIhB;;;;;;OAMG;IACI,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,MAAM,CAAC;QAAE,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,EAAE,aAAa,CAAA;KAAE,CAAC;IAInG;;;;;;OAMG;IACI,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC;IAalG;;;;;;OAMG;IACI,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC;IAaxF;;;;;;OAMG;IACI,WAAW,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC;IAQvD;;;;;;;OAOG;IACI,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;IAItE;;;;;OAKG;IACI,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC;IAI7D;;;;OAIG;IACI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC;IAiB3B;;;;OAIG;IACI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC;IAgB3B;;;OAGG;IACI,SAAS,IAAI,MAAM,EAAE;IAI5B,OAAO,CAAC,QAAQ;IAUhB,OAAO,CAAC,KAAK;IAWb,OAAO,CAAC,KAAK;CAMd"}

package/lib/packlets/common/puzzleSession.js

@@ -0,0 +1,361 @@
+"use strict";
+/*
+ * MIT License
+ *
+ * Copyright (c) 2023 Erik Fortune
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PuzzleSession = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const cage_1 = require("./cage");
+const cell_1 = require("./cell");
+const ids_1 = require("./ids");
+/**
+ * Represents a single puzzle session, including puzzle, current state and redo/undo.
+ * @public
+ */
+class PuzzleSession {
+    /**
+     * @internal
+     */
+    constructor(puzzle) {
+        this._puzzle = puzzle;
+        this.state = puzzle.initialState;
+        this._nextStep = 0;
+        this._numSteps = 0;
+        this._steps = [];
+    }
+    /**
+     * ID of the puzzle being solved.
+     */
+    get id() {
+        return this._puzzle.id;
+    }
+    /**
+     * Description of the puzzle being solved.
+     */
+    get description() {
+        return this._puzzle.description;
+    }
+    /**
+     * Number of rows in the puzzle being solved.
+     */
+    get numRows() {
+        return this._puzzle.numRows;
+    }
+    /**
+     * Number of columns in the puzzle being solved.
+     */
+    get numColumns() {
+        return this._puzzle.numColumns;
+    }
+    /**
+     * The row {@link ICage | cages} in the puzzle being solved.
+     */
+    get rows() {
+        return this._puzzle.rows;
+    }
+    /**
+     * The column {@link ICage | cages} in the puzzle being solved.
+     */
+    get cols() {
+        return this._puzzle.cols;
+    }
+    /**
+     * The section {@link ICage | cages} in the puzzle being solved.
+     */
+    get sections() {
+        return this._puzzle.sections;
+    }
+    /**
+     * All {@link ICage | cages} in the puzzle being solved.
+     */
+    get cages() {
+        return this._puzzle.cages;
+    }
+    /**
+     * The cells {@link ICell | cells} in the puzzle being solved.
+     */
+    get cells() {
+        return this._puzzle.cells;
+    }
+    /**
+     * Index of the next step in this puzzle session.
+     */
+    get nextStep() {
+        return this._nextStep;
+    }
+    /**
+     * Number of steps currently elapsed in this puzzle session.  Note
+     * that after undo, `nextStep` will be less than `numSteps`.
+     */
+    get numSteps() {
+        return this._numSteps;
+    }
+    /***
+     * Indicates whether undo is currently possible.
+     */
+    get canUndo() {
+        return this._nextStep > 0;
+    }
+    /**
+     * Indicates whether redo is currently possible.
+     */
+    get canRedo() {
+        return this._nextStep < this._numSteps;
+    }
+    /**
+     * Creates a new {@link PuzzleSession | puzzle session} from a supplied
+     * {@link Puzzle | puzzle}.
+     * @param puzzle - The {@link Puzzle | puzzle} from which the session is to be
+     * initialized.
+     * @returns `Success` with the requested {@link PuzzleSession | puzzle session},
+     * or `Failure` with details if an error occurs.
+     */
+    static create(puzzle) {
+        return (0, ts_utils_1.captureResult)(() => new PuzzleSession(puzzle));
+    }
+    /**
+     * Determines if the puzzle is correctly solved.
+     * @returns `true` if the puzzle is solved, `false` if the puzzle has
+     * empty or invalid cells.
+     */
+    checkIsSolved() {
+        return this._puzzle.checkIsSolved(this.state);
+    }
+    /**
+     * Determines if the puzzle is valid in its current state.
+     * @returns `true` if all non-empty cells in the puzzle are valid,
+     * or `false` if any cells are invalid.
+     */
+    checkIsValid() {
+        return this._puzzle.checkIsValid(this.state);
+    }
+    /**
+     * Gets all of the currently empty {@link ICell | cells} in the puzzle.
+     * @returns An array of {@link ICell | ICell} with all empty cells.
+     */
+    getEmptyCells() {
+        return this._puzzle.getEmptyCells(this.state);
+    }
+    /**
+     * Gets all of the currently invalid {@link ICell | cells} in the puzzle.
+     * @returns An array of {@link ICell | ICell} with all invalid cells.
+     */
+    getInvalidCells() {
+        return this._puzzle.getInvalidCells(this.state);
+    }
+    /**
+     * Determines if a cell is valid.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be tested.
+     * @returns `true` if the cell value is valid, `false` if the cell value or the cell itself is invalid.
+     */
+    cellIsValid(spec) {
+        var _a;
+        return ((_a = this._cell(spec)) === null || _a === void 0 ? void 0 : _a.isValid(this.state)) === true;
+    }
+    /**
+     * Determines if a cell has a value.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be tested.
+     * @returns `true` if the cell has a value, `false` if the cell is empty or the cell itself is invalid.
+     */
+    cellHasValue(spec) {
+        var _a;
+        return ((_a = this._cell(spec)) === null || _a === void 0 ? void 0 : _a.hasValue(this.state)) === true;
+    }
+    /**
+     * Determines if supplied value is valid for a specific cell.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be tested.
+     * @param value - The value to be tested.
+     * @returns `true` if `value` is valid for the requested cell, `false` if the value or the cell itself is invalid.
+     */
+    isValidForCell(spec, value) {
+        var _a;
+        return ((_a = this._cell(spec)) === null || _a === void 0 ? void 0 : _a.isValidValue(value, this.state)) === true;
+    }
+    /**
+     * Gets the neighbor for a cell in a given direction using specified wrapping rules.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be tested.
+     * @param direction - The direction of the desired neighbor.
+     * @param wrap - Wrapping rules to be applied.
+     * @returns `Success` with the requested {@link ICell | cell}, or `Failure` with details if an error occurs.
+     */
+    getCellNeighbor(spec, direction, wrap) {
+        return this._puzzle.getCellNeighbor(spec, direction, wrap);
+    }
+    /**
+     * Gets the {@link ICellContents | contents} for a specified cell.
+     * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}
+     * describing the cell to be queried.
+     * @returns `Success` with the {@link ICell | cell description} and {@link ICellContents | cell contents}, or
+     * `Failure` with details if an error occurs.
+     */
+    getCellContents(spec) {
+        return this._puzzle.getCellContents(spec, this.state);
+    }
+    /**
+     * Updates the value of a cell.
+     * @param spec - A `string`, {@link IRowColumn | row and column}, or {@link ICell | cell} identifying
+     * the cell to be updated.
+     * @param value - A new value for the cell.
+     * @returns `Success` with `this` if the update is applied, `Failure` with details if an error occurs.
+     */
+    updateCellValue(spec, value) {
+        const idResult = ids_1.Ids.cellId(spec);
+        return idResult.onSuccess((id) => {
+            const notes = [];
+            const update = { id, value, notes };
+            return this._puzzle.updateValues(update, this.state).onSuccess((update) => {
+                this._addMove(update.cells);
+                this.state = update.to;
+                return (0, ts_utils_1.succeed)(this);
+            });
+        });
+    }
+    /**
+     * Updates the notes on a cell.
+     * @param spec - A `string`, {@link IRowColumn | row and column}, or {@link ICell | cell} identifying
+     * the cell to be updated.
+     * @param notes - New notes for the cell.
+     * @returns `Success` with `this` if the update is applied, `Failure` with details if an error occurs.
+     */
+    updateCellNotes(spec, notes) {
+        const idResult = ids_1.Ids.cellId(spec);
+        return idResult.onSuccess((id) => {
+            const value = undefined;
+            const update = { id, value, notes };
+            return this._puzzle.updateNotes(update, this.state).onSuccess((update) => {
+                this._addMove(update.cells);
+                this.state = update.to;
+                return (0, ts_utils_1.succeed)(this);
+            });
+        });
+    }
+    /**
+     * Updates value & notes for multiple cells.
+     * @param updates - An array of {@link ICellState | cell state} objects, each describing
+     * one cell to be updated.
+     * @returns `Success` with `this` if the updates are applied, `Failure` with details if
+     * an error occurs.
+     */
+    updateCells(updates) {
+        return this._puzzle.updateContents(updates, this.state).onSuccess((update) => {
+            this._addMove(update.cells);
+            this.state = update.to;
+            return (0, ts_utils_1.succeed)(this);
+        });
+    }
+    /**
+     * Determines if some {@link ICage | cage} contains a specific value.
+     * @param spec - A `string` ({@link CageId | CageId}) or {@link ICage | ICage}
+     * indicating the cage to be tested.
+     * @param value - The value to be tested.
+     * @returns `true` if the cage exists and contains the specified value,
+     * `false` otherwise.
+     */
+    cageContainsValue(spec, value) {
+        var _a;
+        return ((_a = this._cage(spec)) === null || _a === void 0 ? void 0 : _a.containsValue(value, this.state)) === true;
+    }
+    /**
+     * Determines the numbers currently present in some cage.
+     * @param spec - A `string` ({@link CageId | CageId}) or {@link ICage | ICage}
+     * indicating the cage to be tested.
+     * @returns A `Set<number>` containing all numbers present in the cage.
+     */
+    cageContainedValues(spec) {
+        var _a, _b;
+        return (_b = (_a = this._cage(spec)) === null || _a === void 0 ? void 0 : _a.containedValues(this.state)) !== null && _b !== void 0 ? _b : new Set();
+    }
+    /**
+     * Undo a single move in this puzzle session.
+     * @returns `Success` with `this` if the undo is applied, or `Failure`
+     * with details if an error occurs.
+     */
+    undo() {
+        if (!this.canUndo) {
+            return (0, ts_utils_1.fail)(`nothing to undo`);
+        }
+        return this._puzzle
+            .updateContents(this._steps[this._nextStep - 1].updates.map((u) => u.from), this.state)
+            .onSuccess((update) => {
+            this._nextStep--;
+            this.state = update.to;
+            return (0, ts_utils_1.succeed)(this);
+        });
+    }
+    /**
+     * Redo a single move in this puzzle session.
+     * @returns `Success` with `this` if the redo is applied, or `Failure`
+     * with details if an error occurs.
+     */
+    redo() {
+        if (!this.canRedo) {
+            return (0, ts_utils_1.fail)('nothing to redo');
+        }
+        return this._puzzle
+            .updateContents(this._steps[this._nextStep].updates.map((u) => u.to), this.state)
+            .onSuccess((update) => {
+            this._nextStep++;
+            this.state = update.to;
+            return (0, ts_utils_1.succeed)(this);
+        });
+    }
+    /**
+     * Gets a string representation of this puzzle, one string
+     * per row.
+     */
+    toStrings() {
+        return this._puzzle.toStrings(this.state);
+    }
+    _addMove(updates) {
+        if (this._nextStep < this._steps.length) {
+            this._steps[this._nextStep++] = { updates };
+        }
+        else {
+            this._steps.push({ updates });
+            this._nextStep = this._steps.length;
+        }
+        this._numSteps = this._nextStep;
+    }
+    _cage(spec) {
+        if (spec instanceof cage_1.Cage) {
+            return spec;
+        }
+        return ids_1.Ids.cageId(spec)
+            .onSuccess((id) => {
+            return this._puzzle.getCage(id);
+        })
+            .orDefault();
+    }
+    _cell(spec) {
+        if (spec instanceof cell_1.Cell) {
+            return spec;
+        }
+        return this._puzzle.getCell(spec).orDefault();
+    }
+}
+exports.PuzzleSession = PuzzleSession;
+//# sourceMappingURL=puzzleSession.js.map