@visactor/vtable 0.13.0-alpha.2 → 0.13.0-alpha.3

package/cjs/data/DataSource.js

@@ -29,12 +29,12 @@ Object.defineProperty(exports, "__esModule", {
     value: !0
 }), exports.DataSource = exports.getField = void 0;
 
-const sort = __importStar(require("../tools/sort")), ts_types_1 = require("../ts-types"), helper_1 = require("../tools/helper"), EventTarget_1 = require("../event/EventTarget"), util_1 = require("../tools/util"), diff_cell_1 = require("../tools/diff-cell");
+const sort = __importStar(require("../tools/sort")), ts_types_1 = require("../ts-types"), helper_1 = require("../tools/helper"), EventTarget_1 = require("../event/EventTarget"), util_1 = require("../tools/util"), diff_cell_1 = require("../tools/diff-cell"), vutils_1 = require("@visactor/vutils");
 
 function isFieldAssessor(field) {
     if (helper_1.obj.isObject(field)) {
         const a = field;
-        if ((0, util_1.isValid)(a.get) && (0, util_1.isValid)(a.set)) return !0;
+        if ((0, vutils_1.isValid)(a.get) && (0, vutils_1.isValid)(a.set)) return !0;
     }
     return !1;
 }
@@ -76,7 +76,7 @@ function getField(record, field, promiseCallBack) {
 function _getIndex(sortedIndexMap, index) {
     if (!sortedIndexMap) return index;
     const mapIndex = sortedIndexMap[index];
-    return (0, util_1.isValid)(mapIndex) ? mapIndex : index;
+    return (0, vutils_1.isValid)(mapIndex) ? mapIndex : index;
 }
 
 exports.getField = getField;
@@ -186,7 +186,7 @@ class DataSource extends EventTarget_1.EventTarget {
                 length: nodeData.children.length
             }, ((_, i) => i));
             this.lastOrder && "normal" !== this.lastOrder && this.lastOrderField && sort.sort((index => (0, 
-            util_1.isValid)(subNodeSortedIndexArray[index]) ? subNodeSortedIndexArray[index] : subNodeSortedIndexArray[index] = index), ((index, rel) => {
+            vutils_1.isValid)(subNodeSortedIndexArray[index]) ? subNodeSortedIndexArray[index] : subNodeSortedIndexArray[index] = index), ((index, rel) => {
                 subNodeSortedIndexArray[index] = rel;
             }), nodeData.children.length, this.lastOrderFn, this.lastOrder, (index => this.getOriginalField(Array.isArray(indexKey) ? indexKey.concat([ index ]) : [ indexKey, index ], this.lastOrderField)));
             for (let i = 0; i < subNodeSortedIndexArray.length; i++) {
@@ -214,7 +214,7 @@ class DataSource extends EventTarget_1.EventTarget {
         this.updatePagerData(), void this.fireListeners(EVENT_TYPE.CHANGE_ORDER, null);
         const sortedIndexArray = [];
         if ("normal" === order) for (let i = 0; i < this._sourceLength; i++) sortedIndexArray[i] = i; else sort.sort((index => (0, 
-        util_1.isValid)(sortedIndexArray[index]) ? sortedIndexArray[index] : sortedIndexArray[index] = index), ((index, rel) => {
+        vutils_1.isValid)(sortedIndexArray[index]) ? sortedIndexArray[index] : sortedIndexArray[index] = index), ((index, rel) => {
             sortedIndexArray[index] = rel;
         }), this._sourceLength, orderFn, order, (index => this.getOriginalField(index, field)));
         if (this.currentIndexedData = sortedIndexArray, this.enableHierarchyState) {

package/cjs/data/DataSource.js.map

@@ -1 +1 @@
-{"version":3,"sources":["data/DataSource.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,oDAAsC;AAYtC,0CAA6C;AAC7C,4CAAsF;AACtF,sDAAmD;AACnD,wCAAwD;AACxD,kDAAqD;AAOrD,SAAS,eAAe,CAAC,KAAsC;IAC7D,IAAI,YAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;QACvB,MAAM,CAAC,GAAG,KAAsB,CAAC;QACjC,IAAI,IAAA,cAAO,EAAC,CAAC,CAAC,GAAG,CAAC,IAAI,IAAA,cAAO,EAAC,CAAC,CAAC,GAAG,CAAC,EAAE;YACpC,OAAO,IAAI,CAAC;SACb;KACF;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AACD,MAAM,UAAU,GAAG;IACjB,oBAAoB,EAAE,sBAAsB;IAC5C,YAAY,EAAE,cAAc;CACpB,CAAC;AASX,SAAS,QAAQ,CAAC,KAAoC,EAAE,eAA4B;IAClF,MAAM,mBAAmB,GAAG,IAAA,mBAAU,EAAC,KAAK,CAAC,CAAC;IAC9C,IAAI,IAAA,kBAAS,EAAC,mBAAmB,CAAC,EAAE;QAClC,MAAM,YAAY,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE;YACvD,eAAe,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QAEH,eAAe,CAAC,YAAY,CAAC,CAAC;QAC9B,OAAO,YAAY,CAAC;KACrB;IACD,OAAO,mBAAmB,CAAC;AAC7B,CAAC;AAQD,SAAgB,QAAQ,CACtB,MAA+B,EAC/B,KAAsC,EACtC,eAA4B;IAE5B,IAAI,MAAM,KAAK,IAAI,EAAE;QACnB,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,IAAA,kBAAS,EAAC,MAAM,CAAC,EAAE;QACrB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC;KACrE;IACD,MAAM,QAAQ,GAAQ,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;IACjE,IAAI,QAAQ,IAAK,MAAc,EAAE;QAC/B,MAAM,WAAW,GAAI,MAAc,CAAC,QAAQ,CAAC,CAAC;QAE9C,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;KAC/C;IACD,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE;QAClC,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;KAC/C;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAC3B,MAAM,WAAW,GAAG,IAAA,qBAAc,EAAC,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAC1D,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;KAC/C;IACD,MAAM,UAAU,GAAG,GAAG,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE;QAC1B,MAAM,WAAW,GAAI,MAAc,CAAC,QAAQ,CAAC,CAAC;QAC9C,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;KAC/C;IACD,MAAM,WAAW,GAAG,IAAA,uBAAc,EAAC,MAAM,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,gBAAc,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC;IAC9G,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;AAChD,CAAC;AAhCD,4BAgCC;AAED,SAAS,SAAS,CAAC,cAA4C,EAAE,KAAa;IAC5E,IAAI,CAAC,cAAc,EAAE;QACnB,OAAO,KAAK,CAAC;KACd;IACD,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,IAAA,cAAO,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;AAC9C,CAAC;AAaD,MAAa,UAAW,SAAQ,yBAAW;IAqBzC,MAAM,KAAK,UAAU;QACnB,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,YAAY,GAAkC,EAAE,UAAwB,EAAE,oBAA6B;;QACrG,KAAK,EAAE,CAAC;QAVA,uBAAkB,GAAiC,EAAE,CAAC;QAIhE,yBAAoB,GAAG,KAAK,CAAC;QAInB,2BAAsB,GAAyC,IAAI,GAAG,EAAE,CAAC;QAIjF,IAAI,CAAC,IAAI,GAAG,CAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,SAAiB,CAAC;QACrD,IAAI,CAAC,aAAa,GAAG,CAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,MAAM,KAAI,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,GAAG,MAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,MAAM,mCAAI,GAAG,CAAC;QAClC,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAA0B,CAAC;QAExD,IAAI,CAAC,wBAAwB,GAAG,EAAE,CAAC;QACnC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI;YAC9B,UAAU,EAAE,IAAI,CAAC,aAAa;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;YAChC,WAAW,EAAE,CAAC;SACf,CAAC;QACF,IAAI,oBAAoB,IAAI,CAAC,EAAE;YAC7B,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;SAClC;QAED,IAAI,CAAC,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAClF,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;gBAE3C,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC1C,QAAgB,CAAC,QAAQ,IAAI,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,EAAE,yBAAc,CAAC,QAAQ,CAAC,CAAC;aAC3F;SACF;QACD,IAAI,oBAAoB,GAAG,CAAC,EAAE;YAC5B,IAAI,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;gBACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;gBAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;gBAClD,IAAI,CAAA,MAAC,QAAgB,CAAC,QAAQ,0CAAE,MAAM,IAAG,CAAC,EAAE;oBAC1C,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAC7B,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EACvD,yBAAc,CAAC,MAAM,CACtB,CAAC;oBACF,MAAM,cAAc,GAAG,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,oBAAoB,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;oBACnG,CAAC,IAAI,cAAc,CAAC;oBACpB,UAAU,IAAI,cAAc,CAAC;iBAC9B;aACF;SACF;QACD,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IASD,yBAAyB,CACvB,QAA2B,EAE3B,oBAA4B,EAC5B,YAAoB,EACpB,QAAa;;QAEb,IAAI,YAAY,GAAG,oBAAoB,EAAE;YACvC,OAAO,CAAC,CAAC;SACV;QACD,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,MAAM,UAAU,GAAG,MAAA,MAAA,QAAQ,CAAC,QAAQ,0CAAE,MAAM,mCAAI,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;YACnC,gBAAgB,IAAI,CAAC,CAAC;YACtB,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,aAAa,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACnF,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAC5B,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,gBAAgB,EAE5D,CAAC,EACD,aAAa,CACd,CAAC;YACF,IAAI,CAAA,MAAA,aAAa,CAAC,QAAQ,0CAAE,MAAM,IAAG,CAAC,EAAE;gBACtC,IAAI,YAAY,GAAG,oBAAoB,EAAE;oBACvC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAC7B,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EACtE,yBAAc,CAAC,MAAM,CACtB,CAAC;iBACH;qBAAM;oBACL,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAC7B,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EACtE,yBAAc,CAAC,QAAQ,CACxB,CAAC;iBACH;aACF;YAED,gBAAgB,IAAI,IAAI,CAAC,yBAAyB,CAChD,aAAa,EACb,oBAAoB,EACpB,YAAY,GAAG,CAAC,EAChB,aAAa,CACd,CAAC;SACH;QACD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IACD,gBAAgB,CAAC,UAAwB;QACvC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI;YAC9B,UAAU,EAAE,IAAI,CAAC,aAAa;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;YAChC,WAAW,EAAE,CAAC;SACf,CAAC;QACF,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IACS,eAAe;QACvB,MAAM,EAAE,kBAAkB,EAAE,GAAG,IAAI,CAAC;QACpC,MAAM,EAAE,YAAY,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC;QACtD,MAAM,UAAU,GAAG,YAAY,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,UAAU,GAAG,YAAY,CAAC;QAC3C,IAAI,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,CAAC;QACzC,IAAI,kBAAkB,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE;YAEvD,IAAI,eAAe,GAAG,CAAC,CAAC,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAElD,IACE,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAK,kBAAkB,CAAC,CAAC,CAAmB,CAAC,MAAM,KAAK,CAAC,CAAC;oBAC/F,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,EACrC;oBACA,eAAe,EAAE,CAAC;iBACnB;gBACD,IAAI,eAAe,IAAI,UAAU,IAAI,eAAe,GAAG,QAAQ,EAAE;oBAC/D,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC3D;qBAAM,IAAI,eAAe,IAAI,QAAQ,EAAE;oBACtC,MAAM;iBACP;aACF;SACF;aAAM,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC,EAAE;YACjC,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;SAC1D;IACH,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD,GAAG,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC,CAAC;IAChF,CAAC;IACD,WAAW,CAAC,KAAa;QACvB,OAAO,SAAS,CAAC,IAAI,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;IACxD,CAAC;IACD,QAAQ,CAAC,KAAa,EAAE,KAAsC;QAC5D,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,uBAAuB,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IACtF,CAAC;IAED,QAAQ,CAAC,KAAa,EAAE,KAAe;QACrC,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,uBAAuB,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IACtF,CAAC;IAMD,iBAAiB,CAAC,KAAa;;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,MAAA,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,mCAAI,IAAI,CAAC;IACvG,CAAC;IAKD,oBAAoB,CAAC,KAAa;QAChC,MAAM,cAAc,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE5C,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAE7C,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,KAAK,KAAK,yBAAc,CAAC,QAAQ,EAAE;YAErC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,yBAAc,CAAC,MAAM,CAAC,CAAC;YAC7G,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,yBAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;SAC7D;aAAM,IAAI,KAAK,KAAK,yBAAc,CAAC,MAAM,EAAE;YAE1C,IAAI,cAAc,GAAG,CAAC,CAAC;YAQvB,MAAM,yBAAyB,GAAG,CAChC,QAA2B,EAC3B,cAA8B,EAC9B,QAAa,EACb,EAAE;gBACF,IAAI,CAAC,cAAc,IAAI,cAAc,KAAK,yBAAc,CAAC,QAAQ,IAAI,cAAc,KAAK,yBAAc,CAAC,IAAI,EAAE;oBAC3G,OAAO;iBACR;gBACD,IAAI,QAAQ,CAAC,QAAQ,EAAE;oBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACjD,cAAc,IAAI,CAAC,CAAC;wBACpB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;wBAElF,yBAAyB,CACvB,UAAU,EACV,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EACrD,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CACrB,CAAC;qBACH;iBACF;YACH,CAAC,CAAC;YACF,yBAAyB,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAEhD,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC;YAC7F,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,yBAAc,CAAC,QAAQ,CAAC,CAAC;SAChH;QAED,IAAI,CAAC,eAAe,EAAE,CAAC;QAEvB,OAAO,IAAA,2BAAe,EAAC,cAAc,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC;IAClE,CAAC;IASD,gBAAgB,CAAC,QAA2B,EAAE,cAA8B,EAAE,QAAa;QACzF,IAAI,CAAC,cAAc,IAAI,cAAc,KAAK,yBAAc,CAAC,QAAQ,IAAI,cAAc,KAAK,yBAAc,CAAC,IAAI,EAAE;YAC3G,OAAO,CAAC,CAAC;SACV;QACD,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,QAAQ,CAAC,QAAQ,EAAE;YACrB,MAAM,uBAAuB,GAAkB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7G,IAAI,CAAC,SAAS;gBACZ,IAAI,CAAC,SAAS,KAAK,QAAQ;gBAC3B,IAAI,CAAC,cAAc;gBACnB,IAAI,CAAC,IAAI,CACP,KAAK,CAAC,EAAE,CACN,IAAA,cAAO,EAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;oBACrC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC;oBAChC,CAAC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAC9C,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;oBACb,uBAAuB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;gBACvC,CAAC,EACD,QAAQ,CAAC,QAAQ,CAAC,MAAM,EACxB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,SAAS,EACd,KAAK,CAAC,EAAE,CACN,IAAI,CAAC,gBAAgB,CACnB,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,EACtE,IAAI,CAAC,cAAc,CACpB,CACJ,CAAC;YACJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACvD,cAAc,IAAI,CAAC,CAAC;gBACpB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;oBACxC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,CAAC,CAAC,CAAC,QAAQ,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAC5B,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,cAAc,EAI1D,CAAC,EACD,UAAU,CACX,CAAC;gBACF,MAAM,aAAa,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;gBACrD,IAAI,CAAC,aAAa,IAAK,SAAiB,CAAC,QAAQ,EAAE;oBACjD,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,yBAAc,CAAC,QAAQ,CAAC,CAAC;iBAChF;gBACD,cAAc,IAAI,IAAI,CAAC,gBAAgB,CACrC,UAAU,EACV,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EACrD,QAAQ,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAC9C,CAAC;aACH;SACF;QACD,OAAO,cAAc,CAAC;IACxB,CAAC;IAOD,SAAS,CAAC,MAAW,EAAE,KAAa;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;SACxC;aAAM;YACL,MAAM,YAAY,GAAI,OAAsB,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACjE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3E,MAAc,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;SAC1D;IACH,CAAC;IACD,IAAI,CACF,KAAe,EACf,KAAgB,EAChB,UAA8D,KAAK,KAAK,MAAM;QAC5E,CAAC,CAAC,CAAC,EAAO,EAAE,EAAO,EAAc,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC,CAAC,CAAC,EAAO,EAAE,EAAO,EAAc,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAExE,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC;QAC3B,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,WAAW,CAAC;QAEhB,IAAI,QAAQ,EAAE;YACZ,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC9B,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;gBACzC,IAAI,CAAC,kBAAkB,GAAG,WAAW,CAAC;gBACtC,IAAI,CAAC,eAAe,EAAE,CAAC;gBACvB,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;gBAClD,OAAO;aACR;SACF;QACD,MAAM,gBAAgB,GAAG,EAAc,CAAC;QACxC,IAAI,KAAK,KAAK,QAAQ,EAAE;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;gBAC3C,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aACzB;SACF;aAAM;YACL,IAAI,CAAC,IAAI,CACP,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,cAAO,EAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,EACzG,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;gBACb,gBAAgB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;YAChC,CAAC,EACD,IAAI,CAAC,aAAa,EAClB,OAAO,EACP,KAAK,EACL,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAC7C,CAAC;SACH;QACD,IAAI,CAAC,kBAAkB,GAAG,gBAAgB,CAAC;QAC3C,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC7B,IAAI,UAAU,GAAG,gBAAgB,CAAC,MAAM,CAAC;YACzC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;gBACnC,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CACzC,gBAAgB,CAAC,CAAC,CAAC,EACnB,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EACpD,IAAI,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAC5C,CAAC;gBACF,UAAU,IAAI,aAAa,CAAC;gBAC5B,CAAC,IAAI,aAAa,CAAC;aACpB;SACF;QACD,IAAI,CAAC,QAAQ,EAAE;YACb,QAAQ,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;SAC1C;QACD,QAAQ,CAAC,KAAK,CAAC,GAAG,gBAAgB,CAAC;QACnC,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC;IAID,mBAAmB;QACjB,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,SAAS,EAAE;YACzC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;gBAC3C,IAAI,GAAG,KAAK,IAAI,CAAC,cAAc,EAAE;oBAC/B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;iBACjC;qBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE;oBACnC,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC;oBAClB,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC;iBACrB;qBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,EAAE;oBACpC,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;oBACjB,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC;iBACrB;qBAAM;oBACL,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC;oBAClB,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;iBAClB;YACH,CAAC,CAAC,CAAC;SACJ;IACH,CAAC;IACD,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACD,IAAI,YAAY,CAAC,SAAiB;QAChC,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE;YACpC,OAAO;SACR;QACD,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;QAC/B,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,oBAAoB,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IAC1E,CAAC;IACD,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC;IAC7C,CAAC;IACD,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,uBAAuB;QACzB,IAAI,IAAI,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,EAAE;YAC5C,OAAO,IAAI,CAAC,wBAAwB,CAAC;SACtC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO;;QACL,MAAA,KAAK,CAAC,OAAO,oDAAI,CAAC;IACpB,CAAC;IACD,cAAc;QACZ,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChE,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC;QAC/B,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACjC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;IAC9B,CAAC;IACD,uBAAuB;QACrB,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC;QAC/B,IAAI,CAAC,uBAAuB,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1C,CAAC;IACS,iBAAiB,CAAC,KAAwB;QAClD,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAA4B,EAAE,EAAE;YACjE,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACL,CAAC;IACS,gBAAgB,CAAC,KAAwB,EAAE,KAAsC;QACzF,IAAI,KAAK,KAAK,IAAI,EAAE;YAClB,OAAO,SAAS,CAAC;SAClB;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE7C,OAAO,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,GAAQ,EAAE,EAAE;YAC1C,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;IACL,CAAC;IACS,gBAAgB,CAAC,KAAwB,EAAE,KAAe;QAClE,IAAI,KAAK,KAAK,IAAI,EAAE;YAClB,OAAO,KAAK,CAAC;SACd;QACD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE;YAC/B,OAAO,IAAI,CAAC;SACb;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,MAAM,IAAK,KAAa,IAAK,MAAc,CAAC,CAAC;IAC9D,CAAC;IAES,oBAAoB,CAC5B,MAAyB,EACzB,MAAuC,EACvC,MAA+B;IAGjC,CAAC;IACS,qBAAqB,CAAC,MAAyB,EAAE,OAAgC;IAE3F,CAAC;;AAzdH,gCAieC;AANQ,gBAAK,GAAG,IAAI,UAAU,CAAC;IAC5B,GAAG;IAEH,CAAC;IACD,MAAM,EAAE,CAAC;CACV,CAAC,CAAC","file":"DataSource.js","sourcesContent":["import * as sort from '../tools/sort';\nimport type {\n  DataSourceAPI,\n  FieldAssessor,\n  FieldData,\n  FieldDef,\n  FieldFormat,\n  IPagination,\n  MaybePromiseOrCallOrUndefined,\n  MaybePromiseOrUndefined,\n  SortOrder\n} from '../ts-types';\nimport { HierarchyState } from '../ts-types';\nimport { applyChainSafe, getOrApply, obj, isPromise, emptyFn } from '../tools/helper';\nimport { EventTarget } from '../event/EventTarget';\nimport { getValueByPath, isValid } from '../tools/util';\nimport { diffCellIndices } from '../tools/diff-cell';\n\n/**\n * 判断字段数据是否为访问器的格式\n * @param field\n * @returns boolean\n */\nfunction isFieldAssessor(field: FieldDef | FieldFormat | number): field is FieldAssessor {\n  if (obj.isObject(field)) {\n    const a = field as FieldAssessor;\n    if (isValid(a.get) && isValid(a.set)) {\n      return true;\n    }\n  }\n  return false;\n}\nconst EVENT_TYPE = {\n  SOURCE_LENGTH_UPDATE: 'source_length_update',\n  CHANGE_ORDER: 'change_order'\n} as const;\ntype PromiseBack = (value: MaybePromiseOrUndefined) => void;\n\n/**\n * 获取到的某个filed的值 处理可能为promise的情况\n * @param value\n * @param promiseCallBack\n * @returns\n */\nfunction getValue(value: MaybePromiseOrCallOrUndefined, promiseCallBack: PromiseBack): MaybePromiseOrUndefined {\n  const maybePromiseOrValue = getOrApply(value);\n  if (isPromise(maybePromiseOrValue)) {\n    const promiseValue = maybePromiseOrValue.then((r: any) => {\n      promiseCallBack(r);\n      return r;\n    });\n\n    promiseCallBack(promiseValue);\n    return promiseValue;\n  }\n  return maybePromiseOrValue;\n}\n/**\n * 根据field获取数据源record对应的值 获取到的可能是个异步Promise 需要设置回调处理逻辑\n * @param record\n * @param field\n * @param promiseCallBack\n * @returns\n */\nexport function getField(\n  record: MaybePromiseOrUndefined,\n  field: FieldDef | FieldFormat | number,\n  promiseCallBack: PromiseBack\n): FieldData {\n  if (record === null) {\n    return undefined;\n  }\n  if (isPromise(record)) {\n    return record.then((r: any) => getField(r, field, promiseCallBack));\n  }\n  const fieldGet: any = isFieldAssessor(field) ? field.get : field;\n  if (fieldGet in (record as any)) {\n    const fieldResult = (record as any)[fieldGet];\n\n    return getValue(fieldResult, promiseCallBack);\n  }\n  if (typeof fieldGet === 'function') {\n    const fieldResult = fieldGet(record);\n    return getValue(fieldResult, promiseCallBack);\n  }\n  if (Array.isArray(fieldGet)) {\n    const fieldResult = getValueByPath(record, [...fieldGet]);\n    return getValue(fieldResult, promiseCallBack);\n  }\n  const fieldArray = `${fieldGet}`.split('.');\n  if (fieldArray.length <= 1) {\n    const fieldResult = (record as any)[fieldGet];\n    return getValue(fieldResult, promiseCallBack);\n  }\n  const fieldResult = applyChainSafe(record, (val, name) => getField(val, name, emptyFn as any), ...fieldArray);\n  return getValue(fieldResult, promiseCallBack);\n}\n\nfunction _getIndex(sortedIndexMap: null | (number | number[])[], index: number): number | number[] {\n  if (!sortedIndexMap) {\n    return index;\n  }\n  const mapIndex = sortedIndexMap[index];\n  return isValid(mapIndex) ? mapIndex : index;\n}\n\nexport interface DataSourceParam {\n  get: (index: number) => any;\n  length: number;\n  source?: any;\n}\nexport interface ISortedMapItem {\n  asc?: (number | number[])[];\n  desc?: (number | number[])[];\n  normal?: (number | number[])[];\n}\n\nexport class DataSource extends EventTarget implements DataSourceAPI {\n  private _get: (index: number | number[]) => any;\n  /** 数据条目数 如果是树形结构的数据 则是第一层父节点的数量 */\n  private _sourceLength: number;\n\n  private readonly _source: any;\n  /**\n   * 缓存按字段进行排序的结果\n   */\n  protected sortedIndexMap: Map<FieldDef, ISortedMapItem>;\n  /**\n   * 记录最近一次排序规则 当展开树形结构的节点时需要用到\n   */\n  private lastOrder: SortOrder;\n  private lastOrderFn: (a: any, b: any, order: string) => number;\n  private lastOrderField: FieldDef;\n  protected currentIndexedData: (number | number[])[] | null = [];\n  protected pagination: IPagination;\n  protected _currentPagerIndexedData: (number | number[])[];\n  // 当前是否为层级的树形结构 排序时判断该值确实是否继续进行子节点排序\n  enableHierarchyState = false;\n  static get EVENT_TYPE(): typeof EVENT_TYPE {\n    return EVENT_TYPE;\n  }\n  protected treeDataHierarchyState: Map<number | string, HierarchyState> = new Map();\n  constructor(obj?: DataSourceParam | DataSource, pagination?: IPagination, hierarchyExpandLevel?: number) {\n    super();\n\n    this._get = obj?.get.bind(obj) || (undefined as any);\n    this._sourceLength = obj?.length || 0;\n    this._source = obj?.source ?? obj;\n    this.sortedIndexMap = new Map<string, ISortedMapItem>();\n\n    this._currentPagerIndexedData = [];\n    this.pagination = pagination || {\n      totalCount: this._sourceLength,\n      perPageCount: this._sourceLength,\n      currentPage: 0\n    };\n    if (hierarchyExpandLevel >= 1) {\n      this.enableHierarchyState = true;\n    }\n    // 初始化currentIndexedData 正常未排序。设置其状态\n    this.currentIndexedData = Array.from({ length: this._sourceLength }, (_, i) => i);\n    if (this.enableHierarchyState) {\n      for (let i = 0; i < this._sourceLength; i++) {\n        //expandLevel为有效值即需要按tree分析展示数据\n        const nodeData = this.getOriginalRecord(i);\n        (nodeData as any).children && this.treeDataHierarchyState.set(i, HierarchyState.collapse);\n      }\n    }\n    if (hierarchyExpandLevel > 1) {\n      let nodeLength = this._sourceLength;\n      for (let i = 0; i < nodeLength; i++) {\n        const indexKey = this.currentIndexedData[i];\n        const nodeData = this.getOriginalRecord(indexKey);\n        if ((nodeData as any).children?.length > 0) {\n          this.treeDataHierarchyState.set(\n            Array.isArray(indexKey) ? indexKey.join(',') : indexKey,\n            HierarchyState.expand\n          );\n          const childrenLength = this.initChildrenNodeHierarchy(indexKey, hierarchyExpandLevel, 2, nodeData);\n          i += childrenLength;\n          nodeLength += childrenLength;\n        }\n      }\n    }\n    this.updatePagerData();\n  }\n  /**\n   * 初始化子节点的层次信息\n   * @param indexKey 父节点的indexKey 即currentLevel-1的节点\n   * @param hierarchyExpandLevel 需要展开层级数\n   * @param currentLevel 当前要展开的是第几层\n   * @param nodeData 父节点数据 即currentLevel-1的节点\n   * @returns\n   */\n  initChildrenNodeHierarchy(\n    indexKey: number | number[],\n    // subNodeIndex:number,\n    hierarchyExpandLevel: number,\n    currentLevel: number,\n    nodeData: any\n  ): number {\n    if (currentLevel > hierarchyExpandLevel) {\n      return 0;\n    }\n    let childTotalLength = 0;\n    const nodeLength = nodeData.children?.length ?? 0;\n    for (let j = 0; j < nodeLength; j++) {\n      childTotalLength += 1;\n      const childNodeData = nodeData.children[j];\n      const childIndexKey = Array.isArray(indexKey) ? indexKey.concat(j) : [indexKey, j];\n      this.currentIndexedData.splice(\n        this.currentIndexedData.indexOf(indexKey) + childTotalLength,\n        // childTotalLength,\n        0,\n        childIndexKey\n      );\n      if (childNodeData.children?.length > 0) {\n        if (currentLevel < hierarchyExpandLevel) {\n          this.treeDataHierarchyState.set(\n            Array.isArray(childIndexKey) ? childIndexKey.join(',') : childIndexKey,\n            HierarchyState.expand\n          );\n        } else {\n          this.treeDataHierarchyState.set(\n            Array.isArray(childIndexKey) ? childIndexKey.join(',') : childIndexKey,\n            HierarchyState.collapse\n          );\n        }\n      }\n\n      childTotalLength += this.initChildrenNodeHierarchy(\n        childIndexKey,\n        hierarchyExpandLevel,\n        currentLevel + 1,\n        childNodeData\n      );\n    }\n    return childTotalLength;\n  }\n  updatePagination(pagination?: IPagination): void {\n    this.pagination = pagination || {\n      totalCount: this._sourceLength,\n      perPageCount: this._sourceLength,\n      currentPage: 0\n    };\n    this.updatePagerData();\n  }\n  protected updatePagerData(): void {\n    const { currentIndexedData } = this;\n    const { perPageCount, currentPage } = this.pagination;\n    const startIndex = perPageCount * (currentPage || 0);\n    const endIndex = startIndex + perPageCount;\n    this._currentPagerIndexedData.length = 0;\n    if (currentIndexedData && currentIndexedData.length > 0) {\n      // this._currentPagerIndexedData = currentIndexedData.slice(startIndex, endIndex);\n      let firstLevelIndex = -1;\n      for (let i = 0; i < currentIndexedData.length; i++) {\n        //计算第一层父级节点数量\n        if (\n          (Array.isArray(currentIndexedData[i]) && (currentIndexedData[i] as Array<number>).length === 1) ||\n          !Array.isArray(currentIndexedData[i])\n        ) {\n          firstLevelIndex++;\n        }\n        if (firstLevelIndex >= startIndex && firstLevelIndex < endIndex) {\n          this._currentPagerIndexedData.push(currentIndexedData[i]);\n        } else if (firstLevelIndex >= endIndex) {\n          break;\n        }\n      }\n    } else if (this._sourceLength > 0) {\n      throw new Error(`currentIndexedData should has values!`);\n    }\n  }\n\n  get source(): any {\n    return this._source;\n  }\n  get(index: number): MaybePromiseOrUndefined {\n    return this.getOriginalRecord(_getIndex(this.currentPagerIndexedData, index));\n  }\n  getIndexKey(index: number): number | number[] {\n    return _getIndex(this.currentPagerIndexedData, index);\n  }\n  getField(index: number, field: FieldDef | FieldFormat | number): FieldData {\n    return this.getOriginalField(_getIndex(this.currentPagerIndexedData, index), field);\n  }\n\n  hasField(index: number, field: FieldDef): boolean {\n    return this.hasOriginalField(_getIndex(this.currentPagerIndexedData, index), field);\n  }\n  /**\n   * 获取第index条数据的展示收起状态\n   * @param index\n   * @returns\n   */\n  getHierarchyState(index: number): HierarchyState {\n    const indexed = this.getIndexKey(index);\n    return this.treeDataHierarchyState.get(Array.isArray(indexed) ? indexed.join(',') : indexed) ?? null;\n  }\n  /**\n   * 展开或者收起数据index\n   * @param index\n   */\n  toggleHierarchyState(index: number) {\n    const oldIndexedData = this.currentIndexedData.slice(0);\n    const indexed = this.getIndexKey(index);\n    const state = this.getHierarchyState(index);\n\n    const data = this.getOriginalRecord(indexed);\n\n    this.clearSortedIndexMap();\n    if (state === HierarchyState.collapse) {\n      // 将节点状态置为expand\n      this.treeDataHierarchyState.set(Array.isArray(indexed) ? indexed.join(',') : indexed, HierarchyState.expand);\n      this.pushChildrenNode(indexed, HierarchyState.expand, data);\n    } else if (state === HierarchyState.expand) {\n      // 记录状态变化影响的子节点行数\n      let childrenLength = 0;\n      /**\n       * 当某个节点由展开变为折叠，需要计算出影响的节点数量 使用childrenLength来标记。同样需递归\n       * @param indexKey\n       * @param hierarchyState\n       * @param nodeData\n       * @returns\n       */\n      const computeChildrenNodeLength = (\n        indexKey: number | number[],\n        hierarchyState: HierarchyState,\n        nodeData: any\n      ) => {\n        if (!hierarchyState || hierarchyState === HierarchyState.collapse || hierarchyState === HierarchyState.none) {\n          return;\n        }\n        if (nodeData.children) {\n          for (let i = 0; i < nodeData.children.length; i++) {\n            childrenLength += 1;\n            const childIndex = Array.isArray(indexKey) ? indexKey.concat([i]) : [indexKey, i];\n\n            computeChildrenNodeLength(\n              childIndex,\n              this.treeDataHierarchyState.get(childIndex.join(',')),\n              nodeData.children[i]\n            );\n          }\n        }\n      };\n      computeChildrenNodeLength(indexed, state, data);\n\n      this.currentIndexedData.splice(this.currentIndexedData.indexOf(indexed) + 1, childrenLength);\n      this.treeDataHierarchyState.set(Array.isArray(indexed) ? indexed.join(',') : indexed, HierarchyState.collapse);\n    }\n    // 变更了pagerConfig所以需要更新分页数据  TODO待定 因为只关注根节点的数量的话 可能不会影响到\n    this.updatePagerData();\n\n    return diffCellIndices(oldIndexedData, this.currentIndexedData);\n  }\n  /**\n   * 某个节点状态由折叠变为展开，往this.currentIndexedData中插入展开后的新增节点，注意需要递归，因为展开节点下面的子节点也能是展开状态\n   * @param recordRowIndex 要计算节点的行号（从body部分开始计算）\n   * @param indexKey 需要判断节点的index\n   * @param hierarchyState 当前节点状态\n   * @param nodeData 当前节点数据 取children时用\n   * @returns\n   */\n  pushChildrenNode(indexKey: number | number[], hierarchyState: HierarchyState, nodeData: any): number {\n    if (!hierarchyState || hierarchyState === HierarchyState.collapse || hierarchyState === HierarchyState.none) {\n      return 0;\n    }\n    let childrenLength = 0;\n    if (nodeData.children) {\n      const subNodeSortedIndexArray: Array<number> = Array.from({ length: nodeData.children.length }, (_, i) => i);\n      this.lastOrder &&\n        this.lastOrder !== 'normal' &&\n        this.lastOrderField &&\n        sort.sort(\n          index =>\n            isValid(subNodeSortedIndexArray[index])\n              ? subNodeSortedIndexArray[index]\n              : (subNodeSortedIndexArray[index] = index),\n          (index, rel) => {\n            subNodeSortedIndexArray[index] = rel;\n          },\n          nodeData.children.length,\n          this.lastOrderFn,\n          this.lastOrder,\n          index =>\n            this.getOriginalField(\n              Array.isArray(indexKey) ? indexKey.concat([index]) : [indexKey, index],\n              this.lastOrderField\n            )\n        );\n      for (let i = 0; i < subNodeSortedIndexArray.length; i++) {\n        childrenLength += 1;\n        const childIndex = Array.isArray(indexKey)\n          ? indexKey.concat([subNodeSortedIndexArray[i]])\n          : [indexKey, subNodeSortedIndexArray[i]];\n        this.currentIndexedData.splice(\n          this.currentIndexedData.indexOf(indexKey) + childrenLength,\n          // this.pagination.currentPage * this.pagination.perPageCount +\n          // recordRowIndex +\n          // childrenLength,\n          0,\n          childIndex\n        );\n        const preChildState = this.treeDataHierarchyState.get(childIndex.join(','));\n        const childData = this.getOriginalRecord(childIndex);\n        if (!preChildState && (childData as any).children) {\n          this.treeDataHierarchyState.set(childIndex.join(','), HierarchyState.collapse);\n        }\n        childrenLength += this.pushChildrenNode(\n          childIndex,\n          this.treeDataHierarchyState.get(childIndex.join(',')),\n          nodeData.children[subNodeSortedIndexArray[i]]\n        );\n      }\n    }\n    return childrenLength;\n  }\n\n  /**\n   * 将数据record 替换到index位置处\n   * @param record\n   * @param index\n   */\n  setRecord(record: any, index: number) {\n    const indexed = this.getIndexKey(index);\n    if (!Array.isArray(indexed)) {\n      this.source.splice(indexed, 1, record);\n    } else {\n      const c_node_index = (indexed as Array<any>)[indexed.length - 1];\n      const p_node = this.getOriginalRecord(indexed.slice(0, indexed.length - 1));\n      (p_node as any).children.splice(c_node_index, 1, record);\n    }\n  }\n  sort(\n    field: FieldDef,\n    order: SortOrder,\n    orderFn: (v1: any, v2: any, order: SortOrder) => -1 | 0 | 1 = order !== 'desc'\n      ? (v1: any, v2: any): -1 | 0 | 1 => (v1 === v2 ? 0 : v1 > v2 ? 1 : -1)\n      : (v1: any, v2: any): -1 | 0 | 1 => (v1 === v2 ? 0 : v1 < v2 ? 1 : -1)\n  ): void {\n    this.lastOrderField = field;\n    this.lastOrder = order;\n    this.lastOrderFn = orderFn;\n    let filedMap = this.sortedIndexMap.get(field);\n    let orderedData;\n\n    if (filedMap) {\n      orderedData = filedMap[order];\n      if (orderedData && orderedData.length > 0) {\n        this.currentIndexedData = orderedData;\n        this.updatePagerData();\n        this.fireListeners(EVENT_TYPE.CHANGE_ORDER, null);\n        return;\n      }\n    }\n    const sortedIndexArray = [] as number[];\n    if (order === 'normal') {\n      for (let i = 0; i < this._sourceLength; i++) {\n        sortedIndexArray[i] = i;\n      }\n    } else {\n      sort.sort(\n        index => (isValid(sortedIndexArray[index]) ? sortedIndexArray[index] : (sortedIndexArray[index] = index)),\n        (index, rel) => {\n          sortedIndexArray[index] = rel;\n        },\n        this._sourceLength,\n        orderFn,\n        order,\n        index => this.getOriginalField(index, field)\n      );\n    }\n    this.currentIndexedData = sortedIndexArray;\n    if (this.enableHierarchyState) {\n      let nodeLength = sortedIndexArray.length;\n      const t0 = window.performance.now();\n      for (let i = 0; i < nodeLength; i++) {\n        const subNodeLength = this.pushChildrenNode(\n          sortedIndexArray[i],\n          this.treeDataHierarchyState.get(sortedIndexArray[i]),\n          this.getOriginalRecord(sortedIndexArray[i]) // ？sortedIndexArray 在这个过程中不是变化了吗 通过i取id还是对的吗？ 对哦！因为i和nodeLength都+subNodeLength 来动态调整过了！\n        );\n        nodeLength += subNodeLength;\n        i += subNodeLength;\n      }\n    }\n    if (!filedMap) {\n      filedMap = { asc: [], desc: [], normal: [] };\n      this.sortedIndexMap.set(field, filedMap);\n    }\n    filedMap[order] = sortedIndexArray;\n    this.updatePagerData();\n    this.fireListeners(EVENT_TYPE.CHANGE_ORDER, null);\n  }\n  /**\n   * 当节点折叠或者展开时 将排序缓存清空（非当前排序规则的缓存）\n   */\n  clearSortedIndexMap() {\n    if (this.lastOrderField && this.lastOrder) {\n      this.sortedIndexMap.forEach((sortMap, key) => {\n        if (key !== this.lastOrderField) {\n          this.sortedIndexMap.delete(key);\n        } else if (this.lastOrder === 'asc') {\n          sortMap.desc = [];\n          sortMap.normal = [];\n        } else if (this.lastOrder === 'desc') {\n          sortMap.asc = [];\n          sortMap.normal = [];\n        } else {\n          sortMap.desc = [];\n          sortMap.asc = [];\n        }\n      });\n    }\n  }\n  get sourceLenght(): number {\n    return this._sourceLength;\n  }\n  set sourceLength(sourceLen: number) {\n    if (this._sourceLength === sourceLen) {\n      return;\n    }\n    this._sourceLength = sourceLen;\n    this.fireListeners(EVENT_TYPE.SOURCE_LENGTH_UPDATE, this._sourceLength);\n  }\n  get length(): number {\n    return this.currentPagerIndexedData.length;\n  }\n  get dataSource(): DataSource {\n    return this;\n  }\n  get currentPagerIndexedData(): (number | number[])[] {\n    if (this._currentPagerIndexedData.length > 0) {\n      return this._currentPagerIndexedData;\n    }\n    return []; //this.currentIndexedData || [];\n  }\n  release(): void {\n    super.release?.();\n  }\n  clearSortedMap() {\n    this.currentIndexedData && (this.currentIndexedData.length = 0);\n    this.currentIndexedData = null;\n    this.sortedIndexMap.forEach(item => {\n      item.asc && (item.asc.length = 0);\n      item.desc && (item.desc.length = 0);\n    });\n    this.sortedIndexMap.clear();\n  }\n  clearCurrentIndexedData(): void {\n    this.currentIndexedData = null;\n    this.currentPagerIndexedData.length = 0;\n  }\n  protected getOriginalRecord(index: number | number[]): MaybePromiseOrUndefined {\n    return getValue(this._get(index), (val: MaybePromiseOrUndefined) => {\n      this.recordPromiseCallBack(index, val);\n    });\n  }\n  protected getOriginalField(index: number | number[], field: FieldDef | FieldFormat | number): FieldData {\n    if (field === null) {\n      return undefined;\n    }\n    const record = this.getOriginalRecord(index);\n    // return getField(record, field);\n    return getField(record, field, (val: any) => {\n      this.fieldPromiseCallBack(index, field, val);\n    });\n  }\n  protected hasOriginalField(index: number | number[], field: FieldDef): boolean {\n    if (field === null) {\n      return false;\n    }\n    if (typeof field === 'function') {\n      return true;\n    }\n    const record = this.getOriginalRecord(index);\n    return Boolean(record && (field as any) in (record as any));\n  }\n\n  protected fieldPromiseCallBack(\n    _index: number | number[],\n    _field: FieldDef | FieldFormat | number,\n    _value: MaybePromiseOrUndefined\n  ): void {\n    //\n  }\n  protected recordPromiseCallBack(_index: number | number[], _record: MaybePromiseOrUndefined): void {\n    //\n  }\n  /** 静态变量  代表数据为空 */\n  static EMPTY = new DataSource({\n    get() {\n      /* noop */\n    },\n    length: 0\n  });\n}\n"]}
+{"version":3,"sources":["data/DataSource.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,oDAAsC;AAYtC,0CAA6C;AAC7C,4CAAsF;AACtF,sDAAmD;AACnD,wCAA+C;AAC/C,kDAAqD;AACrD,6CAA2C;AAO3C,SAAS,eAAe,CAAC,KAAsC;IAC7D,IAAI,YAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;QACvB,MAAM,CAAC,GAAG,KAAsB,CAAC;QACjC,IAAI,IAAA,gBAAO,EAAC,CAAC,CAAC,GAAG,CAAC,IAAI,IAAA,gBAAO,EAAC,CAAC,CAAC,GAAG,CAAC,EAAE;YACpC,OAAO,IAAI,CAAC;SACb;KACF;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AACD,MAAM,UAAU,GAAG;IACjB,oBAAoB,EAAE,sBAAsB;IAC5C,YAAY,EAAE,cAAc;CACpB,CAAC;AASX,SAAS,QAAQ,CAAC,KAAoC,EAAE,eAA4B;IAClF,MAAM,mBAAmB,GAAG,IAAA,mBAAU,EAAC,KAAK,CAAC,CAAC;IAC9C,IAAI,IAAA,kBAAS,EAAC,mBAAmB,CAAC,EAAE;QAClC,MAAM,YAAY,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE;YACvD,eAAe,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QAEH,eAAe,CAAC,YAAY,CAAC,CAAC;QAC9B,OAAO,YAAY,CAAC;KACrB;IACD,OAAO,mBAAmB,CAAC;AAC7B,CAAC;AAQD,SAAgB,QAAQ,CACtB,MAA+B,EAC/B,KAAsC,EACtC,eAA4B;IAE5B,IAAI,MAAM,KAAK,IAAI,EAAE;QACnB,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,IAAA,kBAAS,EAAC,MAAM,CAAC,EAAE;QACrB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC;KACrE;IACD,MAAM,QAAQ,GAAQ,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;IACjE,IAAI,QAAQ,IAAK,MAAc,EAAE;QAC/B,MAAM,WAAW,GAAI,MAAc,CAAC,QAAQ,CAAC,CAAC;QAE9C,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;KAC/C;IACD,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE;QAClC,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;KAC/C;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAC3B,MAAM,WAAW,GAAG,IAAA,qBAAc,EAAC,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAC1D,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;KAC/C;IACD,MAAM,UAAU,GAAG,GAAG,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE;QAC1B,MAAM,WAAW,GAAI,MAAc,CAAC,QAAQ,CAAC,CAAC;QAC9C,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;KAC/C;IACD,MAAM,WAAW,GAAG,IAAA,uBAAc,EAAC,MAAM,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,gBAAc,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC;IAC9G,OAAO,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;AAChD,CAAC;AAhCD,4BAgCC;AAED,SAAS,SAAS,CAAC,cAA4C,EAAE,KAAa;IAC5E,IAAI,CAAC,cAAc,EAAE;QACnB,OAAO,KAAK,CAAC;KACd;IACD,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,IAAA,gBAAO,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;AAC9C,CAAC;AAaD,MAAa,UAAW,SAAQ,yBAAW;IAqBzC,MAAM,KAAK,UAAU;QACnB,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,YAAY,GAAkC,EAAE,UAAwB,EAAE,oBAA6B;;QACrG,KAAK,EAAE,CAAC;QAVA,uBAAkB,GAAiC,EAAE,CAAC;QAIhE,yBAAoB,GAAG,KAAK,CAAC;QAInB,2BAAsB,GAAyC,IAAI,GAAG,EAAE,CAAC;QAIjF,IAAI,CAAC,IAAI,GAAG,CAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,SAAiB,CAAC;QACrD,IAAI,CAAC,aAAa,GAAG,CAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,MAAM,KAAI,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,GAAG,MAAA,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,MAAM,mCAAI,GAAG,CAAC;QAClC,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAA0B,CAAC;QAExD,IAAI,CAAC,wBAAwB,GAAG,EAAE,CAAC;QACnC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI;YAC9B,UAAU,EAAE,IAAI,CAAC,aAAa;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;YAChC,WAAW,EAAE,CAAC;SACf,CAAC;QACF,IAAI,oBAAoB,IAAI,CAAC,EAAE;YAC7B,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;SAClC;QAED,IAAI,CAAC,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAClF,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;gBAE3C,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC1C,QAAgB,CAAC,QAAQ,IAAI,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,EAAE,yBAAc,CAAC,QAAQ,CAAC,CAAC;aAC3F;SACF;QACD,IAAI,oBAAoB,GAAG,CAAC,EAAE;YAC5B,IAAI,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;gBACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;gBAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;gBAClD,IAAI,CAAA,MAAC,QAAgB,CAAC,QAAQ,0CAAE,MAAM,IAAG,CAAC,EAAE;oBAC1C,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAC7B,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EACvD,yBAAc,CAAC,MAAM,CACtB,CAAC;oBACF,MAAM,cAAc,GAAG,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,oBAAoB,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;oBACnG,CAAC,IAAI,cAAc,CAAC;oBACpB,UAAU,IAAI,cAAc,CAAC;iBAC9B;aACF;SACF;QACD,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IASD,yBAAyB,CACvB,QAA2B,EAE3B,oBAA4B,EAC5B,YAAoB,EACpB,QAAa;;QAEb,IAAI,YAAY,GAAG,oBAAoB,EAAE;YACvC,OAAO,CAAC,CAAC;SACV;QACD,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,MAAM,UAAU,GAAG,MAAA,MAAA,QAAQ,CAAC,QAAQ,0CAAE,MAAM,mCAAI,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;YACnC,gBAAgB,IAAI,CAAC,CAAC;YACtB,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,aAAa,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACnF,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAC5B,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,gBAAgB,EAE5D,CAAC,EACD,aAAa,CACd,CAAC;YACF,IAAI,CAAA,MAAA,aAAa,CAAC,QAAQ,0CAAE,MAAM,IAAG,CAAC,EAAE;gBACtC,IAAI,YAAY,GAAG,oBAAoB,EAAE;oBACvC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAC7B,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EACtE,yBAAc,CAAC,MAAM,CACtB,CAAC;iBACH;qBAAM;oBACL,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAC7B,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EACtE,yBAAc,CAAC,QAAQ,CACxB,CAAC;iBACH;aACF;YAED,gBAAgB,IAAI,IAAI,CAAC,yBAAyB,CAChD,aAAa,EACb,oBAAoB,EACpB,YAAY,GAAG,CAAC,EAChB,aAAa,CACd,CAAC;SACH;QACD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IACD,gBAAgB,CAAC,UAAwB;QACvC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI;YAC9B,UAAU,EAAE,IAAI,CAAC,aAAa;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;YAChC,WAAW,EAAE,CAAC;SACf,CAAC;QACF,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IACS,eAAe;QACvB,MAAM,EAAE,kBAAkB,EAAE,GAAG,IAAI,CAAC;QACpC,MAAM,EAAE,YAAY,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC;QACtD,MAAM,UAAU,GAAG,YAAY,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,UAAU,GAAG,YAAY,CAAC;QAC3C,IAAI,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,CAAC;QACzC,IAAI,kBAAkB,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE;YAEvD,IAAI,eAAe,GAAG,CAAC,CAAC,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAElD,IACE,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAK,kBAAkB,CAAC,CAAC,CAAmB,CAAC,MAAM,KAAK,CAAC,CAAC;oBAC/F,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,EACrC;oBACA,eAAe,EAAE,CAAC;iBACnB;gBACD,IAAI,eAAe,IAAI,UAAU,IAAI,eAAe,GAAG,QAAQ,EAAE;oBAC/D,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC3D;qBAAM,IAAI,eAAe,IAAI,QAAQ,EAAE;oBACtC,MAAM;iBACP;aACF;SACF;aAAM,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC,EAAE;YACjC,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;SAC1D;IACH,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD,GAAG,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC,CAAC;IAChF,CAAC;IACD,WAAW,CAAC,KAAa;QACvB,OAAO,SAAS,CAAC,IAAI,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;IACxD,CAAC;IACD,QAAQ,CAAC,KAAa,EAAE,KAAsC;QAC5D,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,uBAAuB,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IACtF,CAAC;IAED,QAAQ,CAAC,KAAa,EAAE,KAAe;QACrC,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,uBAAuB,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IACtF,CAAC;IAMD,iBAAiB,CAAC,KAAa;;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,MAAA,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,mCAAI,IAAI,CAAC;IACvG,CAAC;IAKD,oBAAoB,CAAC,KAAa;QAChC,MAAM,cAAc,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE5C,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAE7C,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,KAAK,KAAK,yBAAc,CAAC,QAAQ,EAAE;YAErC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,yBAAc,CAAC,MAAM,CAAC,CAAC;YAC7G,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,yBAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;SAC7D;aAAM,IAAI,KAAK,KAAK,yBAAc,CAAC,MAAM,EAAE;YAE1C,IAAI,cAAc,GAAG,CAAC,CAAC;YAQvB,MAAM,yBAAyB,GAAG,CAChC,QAA2B,EAC3B,cAA8B,EAC9B,QAAa,EACb,EAAE;gBACF,IAAI,CAAC,cAAc,IAAI,cAAc,KAAK,yBAAc,CAAC,QAAQ,IAAI,cAAc,KAAK,yBAAc,CAAC,IAAI,EAAE;oBAC3G,OAAO;iBACR;gBACD,IAAI,QAAQ,CAAC,QAAQ,EAAE;oBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACjD,cAAc,IAAI,CAAC,CAAC;wBACpB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;wBAElF,yBAAyB,CACvB,UAAU,EACV,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EACrD,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CACrB,CAAC;qBACH;iBACF;YACH,CAAC,CAAC;YACF,yBAAyB,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAEhD,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC;YAC7F,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,yBAAc,CAAC,QAAQ,CAAC,CAAC;SAChH;QAED,IAAI,CAAC,eAAe,EAAE,CAAC;QAEvB,OAAO,IAAA,2BAAe,EAAC,cAAc,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC;IAClE,CAAC;IASD,gBAAgB,CAAC,QAA2B,EAAE,cAA8B,EAAE,QAAa;QACzF,IAAI,CAAC,cAAc,IAAI,cAAc,KAAK,yBAAc,CAAC,QAAQ,IAAI,cAAc,KAAK,yBAAc,CAAC,IAAI,EAAE;YAC3G,OAAO,CAAC,CAAC;SACV;QACD,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,QAAQ,CAAC,QAAQ,EAAE;YACrB,MAAM,uBAAuB,GAAkB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7G,IAAI,CAAC,SAAS;gBACZ,IAAI,CAAC,SAAS,KAAK,QAAQ;gBAC3B,IAAI,CAAC,cAAc;gBACnB,IAAI,CAAC,IAAI,CACP,KAAK,CAAC,EAAE,CACN,IAAA,gBAAO,EAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;oBACrC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC;oBAChC,CAAC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAC9C,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;oBACb,uBAAuB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;gBACvC,CAAC,EACD,QAAQ,CAAC,QAAQ,CAAC,MAAM,EACxB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,SAAS,EACd,KAAK,CAAC,EAAE,CACN,IAAI,CAAC,gBAAgB,CACnB,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,EACtE,IAAI,CAAC,cAAc,CACpB,CACJ,CAAC;YACJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACvD,cAAc,IAAI,CAAC,CAAC;gBACpB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;oBACxC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,CAAC,CAAC,CAAC,QAAQ,EAAE,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAC5B,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,cAAc,EAI1D,CAAC,EACD,UAAU,CACX,CAAC;gBACF,MAAM,aAAa,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;gBACrD,IAAI,CAAC,aAAa,IAAK,SAAiB,CAAC,QAAQ,EAAE;oBACjD,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,yBAAc,CAAC,QAAQ,CAAC,CAAC;iBAChF;gBACD,cAAc,IAAI,IAAI,CAAC,gBAAgB,CACrC,UAAU,EACV,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EACrD,QAAQ,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAC9C,CAAC;aACH;SACF;QACD,OAAO,cAAc,CAAC;IACxB,CAAC;IAOD,SAAS,CAAC,MAAW,EAAE,KAAa;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;SACxC;aAAM;YACL,MAAM,YAAY,GAAI,OAAsB,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACjE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3E,MAAc,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;SAC1D;IACH,CAAC;IACD,IAAI,CACF,KAAe,EACf,KAAgB,EAChB,UAA8D,KAAK,KAAK,MAAM;QAC5E,CAAC,CAAC,CAAC,EAAO,EAAE,EAAO,EAAc,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC,CAAC,CAAC,EAAO,EAAE,EAAO,EAAc,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAExE,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC;QAC3B,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,WAAW,CAAC;QAEhB,IAAI,QAAQ,EAAE;YACZ,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC9B,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;gBACzC,IAAI,CAAC,kBAAkB,GAAG,WAAW,CAAC;gBACtC,IAAI,CAAC,eAAe,EAAE,CAAC;gBACvB,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;gBAClD,OAAO;aACR;SACF;QACD,MAAM,gBAAgB,GAAG,EAAc,CAAC;QACxC,IAAI,KAAK,KAAK,QAAQ,EAAE;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;gBAC3C,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aACzB;SACF;aAAM;YACL,IAAI,CAAC,IAAI,CACP,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,EACzG,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;gBACb,gBAAgB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;YAChC,CAAC,EACD,IAAI,CAAC,aAAa,EAClB,OAAO,EACP,KAAK,EACL,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAC7C,CAAC;SACH;QACD,IAAI,CAAC,kBAAkB,GAAG,gBAAgB,CAAC;QAC3C,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC7B,IAAI,UAAU,GAAG,gBAAgB,CAAC,MAAM,CAAC;YACzC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;gBACnC,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CACzC,gBAAgB,CAAC,CAAC,CAAC,EACnB,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EACpD,IAAI,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAC5C,CAAC;gBACF,UAAU,IAAI,aAAa,CAAC;gBAC5B,CAAC,IAAI,aAAa,CAAC;aACpB;SACF;QACD,IAAI,CAAC,QAAQ,EAAE;YACb,QAAQ,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;SAC1C;QACD,QAAQ,CAAC,KAAK,CAAC,GAAG,gBAAgB,CAAC;QACnC,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC;IAID,mBAAmB;QACjB,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,SAAS,EAAE;YACzC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;gBAC3C,IAAI,GAAG,KAAK,IAAI,CAAC,cAAc,EAAE;oBAC/B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;iBACjC;qBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE;oBACnC,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC;oBAClB,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC;iBACrB;qBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,EAAE;oBACpC,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;oBACjB,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC;iBACrB;qBAAM;oBACL,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC;oBAClB,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;iBAClB;YACH,CAAC,CAAC,CAAC;SACJ;IACH,CAAC;IACD,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACD,IAAI,YAAY,CAAC,SAAiB;QAChC,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE;YACpC,OAAO;SACR;QACD,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;QAC/B,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,oBAAoB,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IAC1E,CAAC;IACD,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC;IAC7C,CAAC;IACD,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,uBAAuB;QACzB,IAAI,IAAI,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,EAAE;YAC5C,OAAO,IAAI,CAAC,wBAAwB,CAAC;SACtC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO;;QACL,MAAA,KAAK,CAAC,OAAO,oDAAI,CAAC;IACpB,CAAC;IACD,cAAc;QACZ,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChE,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC;QAC/B,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACjC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;IAC9B,CAAC;IACD,uBAAuB;QACrB,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC;QAC/B,IAAI,CAAC,uBAAuB,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1C,CAAC;IACS,iBAAiB,CAAC,KAAwB;QAClD,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAA4B,EAAE,EAAE;YACjE,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACL,CAAC;IACS,gBAAgB,CAAC,KAAwB,EAAE,KAAsC;QACzF,IAAI,KAAK,KAAK,IAAI,EAAE;YAClB,OAAO,SAAS,CAAC;SAClB;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE7C,OAAO,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,GAAQ,EAAE,EAAE;YAC1C,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;IACL,CAAC;IACS,gBAAgB,CAAC,KAAwB,EAAE,KAAe;QAClE,IAAI,KAAK,KAAK,IAAI,EAAE;YAClB,OAAO,KAAK,CAAC;SACd;QACD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE;YAC/B,OAAO,IAAI,CAAC;SACb;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,MAAM,IAAK,KAAa,IAAK,MAAc,CAAC,CAAC;IAC9D,CAAC;IAES,oBAAoB,CAC5B,MAAyB,EACzB,MAAuC,EACvC,MAA+B;IAGjC,CAAC;IACS,qBAAqB,CAAC,MAAyB,EAAE,OAAgC;IAE3F,CAAC;;AAzdH,gCAieC;AANQ,gBAAK,GAAG,IAAI,UAAU,CAAC;IAC5B,GAAG;IAEH,CAAC;IACD,MAAM,EAAE,CAAC;CACV,CAAC,CAAC","file":"DataSource.js","sourcesContent":["import * as sort from '../tools/sort';\nimport type {\n  DataSourceAPI,\n  FieldAssessor,\n  FieldData,\n  FieldDef,\n  FieldFormat,\n  IPagination,\n  MaybePromiseOrCallOrUndefined,\n  MaybePromiseOrUndefined,\n  SortOrder\n} from '../ts-types';\nimport { HierarchyState } from '../ts-types';\nimport { applyChainSafe, getOrApply, obj, isPromise, emptyFn } from '../tools/helper';\nimport { EventTarget } from '../event/EventTarget';\nimport { getValueByPath } from '../tools/util';\nimport { diffCellIndices } from '../tools/diff-cell';\nimport { isValid } from '@visactor/vutils';\n\n/**\n * 判断字段数据是否为访问器的格式\n * @param field\n * @returns boolean\n */\nfunction isFieldAssessor(field: FieldDef | FieldFormat | number): field is FieldAssessor {\n  if (obj.isObject(field)) {\n    const a = field as FieldAssessor;\n    if (isValid(a.get) && isValid(a.set)) {\n      return true;\n    }\n  }\n  return false;\n}\nconst EVENT_TYPE = {\n  SOURCE_LENGTH_UPDATE: 'source_length_update',\n  CHANGE_ORDER: 'change_order'\n} as const;\ntype PromiseBack = (value: MaybePromiseOrUndefined) => void;\n\n/**\n * 获取到的某个filed的值 处理可能为promise的情况\n * @param value\n * @param promiseCallBack\n * @returns\n */\nfunction getValue(value: MaybePromiseOrCallOrUndefined, promiseCallBack: PromiseBack): MaybePromiseOrUndefined {\n  const maybePromiseOrValue = getOrApply(value);\n  if (isPromise(maybePromiseOrValue)) {\n    const promiseValue = maybePromiseOrValue.then((r: any) => {\n      promiseCallBack(r);\n      return r;\n    });\n\n    promiseCallBack(promiseValue);\n    return promiseValue;\n  }\n  return maybePromiseOrValue;\n}\n/**\n * 根据field获取数据源record对应的值 获取到的可能是个异步Promise 需要设置回调处理逻辑\n * @param record\n * @param field\n * @param promiseCallBack\n * @returns\n */\nexport function getField(\n  record: MaybePromiseOrUndefined,\n  field: FieldDef | FieldFormat | number,\n  promiseCallBack: PromiseBack\n): FieldData {\n  if (record === null) {\n    return undefined;\n  }\n  if (isPromise(record)) {\n    return record.then((r: any) => getField(r, field, promiseCallBack));\n  }\n  const fieldGet: any = isFieldAssessor(field) ? field.get : field;\n  if (fieldGet in (record as any)) {\n    const fieldResult = (record as any)[fieldGet];\n\n    return getValue(fieldResult, promiseCallBack);\n  }\n  if (typeof fieldGet === 'function') {\n    const fieldResult = fieldGet(record);\n    return getValue(fieldResult, promiseCallBack);\n  }\n  if (Array.isArray(fieldGet)) {\n    const fieldResult = getValueByPath(record, [...fieldGet]);\n    return getValue(fieldResult, promiseCallBack);\n  }\n  const fieldArray = `${fieldGet}`.split('.');\n  if (fieldArray.length <= 1) {\n    const fieldResult = (record as any)[fieldGet];\n    return getValue(fieldResult, promiseCallBack);\n  }\n  const fieldResult = applyChainSafe(record, (val, name) => getField(val, name, emptyFn as any), ...fieldArray);\n  return getValue(fieldResult, promiseCallBack);\n}\n\nfunction _getIndex(sortedIndexMap: null | (number | number[])[], index: number): number | number[] {\n  if (!sortedIndexMap) {\n    return index;\n  }\n  const mapIndex = sortedIndexMap[index];\n  return isValid(mapIndex) ? mapIndex : index;\n}\n\nexport interface DataSourceParam {\n  get: (index: number) => any;\n  length: number;\n  source?: any;\n}\nexport interface ISortedMapItem {\n  asc?: (number | number[])[];\n  desc?: (number | number[])[];\n  normal?: (number | number[])[];\n}\n\nexport class DataSource extends EventTarget implements DataSourceAPI {\n  private _get: (index: number | number[]) => any;\n  /** 数据条目数 如果是树形结构的数据 则是第一层父节点的数量 */\n  private _sourceLength: number;\n\n  private readonly _source: any;\n  /**\n   * 缓存按字段进行排序的结果\n   */\n  protected sortedIndexMap: Map<FieldDef, ISortedMapItem>;\n  /**\n   * 记录最近一次排序规则 当展开树形结构的节点时需要用到\n   */\n  private lastOrder: SortOrder;\n  private lastOrderFn: (a: any, b: any, order: string) => number;\n  private lastOrderField: FieldDef;\n  protected currentIndexedData: (number | number[])[] | null = [];\n  protected pagination: IPagination;\n  protected _currentPagerIndexedData: (number | number[])[];\n  // 当前是否为层级的树形结构 排序时判断该值确实是否继续进行子节点排序\n  enableHierarchyState = false;\n  static get EVENT_TYPE(): typeof EVENT_TYPE {\n    return EVENT_TYPE;\n  }\n  protected treeDataHierarchyState: Map<number | string, HierarchyState> = new Map();\n  constructor(obj?: DataSourceParam | DataSource, pagination?: IPagination, hierarchyExpandLevel?: number) {\n    super();\n\n    this._get = obj?.get.bind(obj) || (undefined as any);\n    this._sourceLength = obj?.length || 0;\n    this._source = obj?.source ?? obj;\n    this.sortedIndexMap = new Map<string, ISortedMapItem>();\n\n    this._currentPagerIndexedData = [];\n    this.pagination = pagination || {\n      totalCount: this._sourceLength,\n      perPageCount: this._sourceLength,\n      currentPage: 0\n    };\n    if (hierarchyExpandLevel >= 1) {\n      this.enableHierarchyState = true;\n    }\n    // 初始化currentIndexedData 正常未排序。设置其状态\n    this.currentIndexedData = Array.from({ length: this._sourceLength }, (_, i) => i);\n    if (this.enableHierarchyState) {\n      for (let i = 0; i < this._sourceLength; i++) {\n        //expandLevel为有效值即需要按tree分析展示数据\n        const nodeData = this.getOriginalRecord(i);\n        (nodeData as any).children && this.treeDataHierarchyState.set(i, HierarchyState.collapse);\n      }\n    }\n    if (hierarchyExpandLevel > 1) {\n      let nodeLength = this._sourceLength;\n      for (let i = 0; i < nodeLength; i++) {\n        const indexKey = this.currentIndexedData[i];\n        const nodeData = this.getOriginalRecord(indexKey);\n        if ((nodeData as any).children?.length > 0) {\n          this.treeDataHierarchyState.set(\n            Array.isArray(indexKey) ? indexKey.join(',') : indexKey,\n            HierarchyState.expand\n          );\n          const childrenLength = this.initChildrenNodeHierarchy(indexKey, hierarchyExpandLevel, 2, nodeData);\n          i += childrenLength;\n          nodeLength += childrenLength;\n        }\n      }\n    }\n    this.updatePagerData();\n  }\n  /**\n   * 初始化子节点的层次信息\n   * @param indexKey 父节点的indexKey 即currentLevel-1的节点\n   * @param hierarchyExpandLevel 需要展开层级数\n   * @param currentLevel 当前要展开的是第几层\n   * @param nodeData 父节点数据 即currentLevel-1的节点\n   * @returns\n   */\n  initChildrenNodeHierarchy(\n    indexKey: number | number[],\n    // subNodeIndex:number,\n    hierarchyExpandLevel: number,\n    currentLevel: number,\n    nodeData: any\n  ): number {\n    if (currentLevel > hierarchyExpandLevel) {\n      return 0;\n    }\n    let childTotalLength = 0;\n    const nodeLength = nodeData.children?.length ?? 0;\n    for (let j = 0; j < nodeLength; j++) {\n      childTotalLength += 1;\n      const childNodeData = nodeData.children[j];\n      const childIndexKey = Array.isArray(indexKey) ? indexKey.concat(j) : [indexKey, j];\n      this.currentIndexedData.splice(\n        this.currentIndexedData.indexOf(indexKey) + childTotalLength,\n        // childTotalLength,\n        0,\n        childIndexKey\n      );\n      if (childNodeData.children?.length > 0) {\n        if (currentLevel < hierarchyExpandLevel) {\n          this.treeDataHierarchyState.set(\n            Array.isArray(childIndexKey) ? childIndexKey.join(',') : childIndexKey,\n            HierarchyState.expand\n          );\n        } else {\n          this.treeDataHierarchyState.set(\n            Array.isArray(childIndexKey) ? childIndexKey.join(',') : childIndexKey,\n            HierarchyState.collapse\n          );\n        }\n      }\n\n      childTotalLength += this.initChildrenNodeHierarchy(\n        childIndexKey,\n        hierarchyExpandLevel,\n        currentLevel + 1,\n        childNodeData\n      );\n    }\n    return childTotalLength;\n  }\n  updatePagination(pagination?: IPagination): void {\n    this.pagination = pagination || {\n      totalCount: this._sourceLength,\n      perPageCount: this._sourceLength,\n      currentPage: 0\n    };\n    this.updatePagerData();\n  }\n  protected updatePagerData(): void {\n    const { currentIndexedData } = this;\n    const { perPageCount, currentPage } = this.pagination;\n    const startIndex = perPageCount * (currentPage || 0);\n    const endIndex = startIndex + perPageCount;\n    this._currentPagerIndexedData.length = 0;\n    if (currentIndexedData && currentIndexedData.length > 0) {\n      // this._currentPagerIndexedData = currentIndexedData.slice(startIndex, endIndex);\n      let firstLevelIndex = -1;\n      for (let i = 0; i < currentIndexedData.length; i++) {\n        //计算第一层父级节点数量\n        if (\n          (Array.isArray(currentIndexedData[i]) && (currentIndexedData[i] as Array<number>).length === 1) ||\n          !Array.isArray(currentIndexedData[i])\n        ) {\n          firstLevelIndex++;\n        }\n        if (firstLevelIndex >= startIndex && firstLevelIndex < endIndex) {\n          this._currentPagerIndexedData.push(currentIndexedData[i]);\n        } else if (firstLevelIndex >= endIndex) {\n          break;\n        }\n      }\n    } else if (this._sourceLength > 0) {\n      throw new Error(`currentIndexedData should has values!`);\n    }\n  }\n\n  get source(): any {\n    return this._source;\n  }\n  get(index: number): MaybePromiseOrUndefined {\n    return this.getOriginalRecord(_getIndex(this.currentPagerIndexedData, index));\n  }\n  getIndexKey(index: number): number | number[] {\n    return _getIndex(this.currentPagerIndexedData, index);\n  }\n  getField(index: number, field: FieldDef | FieldFormat | number): FieldData {\n    return this.getOriginalField(_getIndex(this.currentPagerIndexedData, index), field);\n  }\n\n  hasField(index: number, field: FieldDef): boolean {\n    return this.hasOriginalField(_getIndex(this.currentPagerIndexedData, index), field);\n  }\n  /**\n   * 获取第index条数据的展示收起状态\n   * @param index\n   * @returns\n   */\n  getHierarchyState(index: number): HierarchyState {\n    const indexed = this.getIndexKey(index);\n    return this.treeDataHierarchyState.get(Array.isArray(indexed) ? indexed.join(',') : indexed) ?? null;\n  }\n  /**\n   * 展开或者收起数据index\n   * @param index\n   */\n  toggleHierarchyState(index: number) {\n    const oldIndexedData = this.currentIndexedData.slice(0);\n    const indexed = this.getIndexKey(index);\n    const state = this.getHierarchyState(index);\n\n    const data = this.getOriginalRecord(indexed);\n\n    this.clearSortedIndexMap();\n    if (state === HierarchyState.collapse) {\n      // 将节点状态置为expand\n      this.treeDataHierarchyState.set(Array.isArray(indexed) ? indexed.join(',') : indexed, HierarchyState.expand);\n      this.pushChildrenNode(indexed, HierarchyState.expand, data);\n    } else if (state === HierarchyState.expand) {\n      // 记录状态变化影响的子节点行数\n      let childrenLength = 0;\n      /**\n       * 当某个节点由展开变为折叠，需要计算出影响的节点数量 使用childrenLength来标记。同样需递归\n       * @param indexKey\n       * @param hierarchyState\n       * @param nodeData\n       * @returns\n       */\n      const computeChildrenNodeLength = (\n        indexKey: number | number[],\n        hierarchyState: HierarchyState,\n        nodeData: any\n      ) => {\n        if (!hierarchyState || hierarchyState === HierarchyState.collapse || hierarchyState === HierarchyState.none) {\n          return;\n        }\n        if (nodeData.children) {\n          for (let i = 0; i < nodeData.children.length; i++) {\n            childrenLength += 1;\n            const childIndex = Array.isArray(indexKey) ? indexKey.concat([i]) : [indexKey, i];\n\n            computeChildrenNodeLength(\n              childIndex,\n              this.treeDataHierarchyState.get(childIndex.join(',')),\n              nodeData.children[i]\n            );\n          }\n        }\n      };\n      computeChildrenNodeLength(indexed, state, data);\n\n      this.currentIndexedData.splice(this.currentIndexedData.indexOf(indexed) + 1, childrenLength);\n      this.treeDataHierarchyState.set(Array.isArray(indexed) ? indexed.join(',') : indexed, HierarchyState.collapse);\n    }\n    // 变更了pagerConfig所以需要更新分页数据  TODO待定 因为只关注根节点的数量的话 可能不会影响到\n    this.updatePagerData();\n\n    return diffCellIndices(oldIndexedData, this.currentIndexedData);\n  }\n  /**\n   * 某个节点状态由折叠变为展开，往this.currentIndexedData中插入展开后的新增节点，注意需要递归，因为展开节点下面的子节点也能是展开状态\n   * @param recordRowIndex 要计算节点的行号（从body部分开始计算）\n   * @param indexKey 需要判断节点的index\n   * @param hierarchyState 当前节点状态\n   * @param nodeData 当前节点数据 取children时用\n   * @returns\n   */\n  pushChildrenNode(indexKey: number | number[], hierarchyState: HierarchyState, nodeData: any): number {\n    if (!hierarchyState || hierarchyState === HierarchyState.collapse || hierarchyState === HierarchyState.none) {\n      return 0;\n    }\n    let childrenLength = 0;\n    if (nodeData.children) {\n      const subNodeSortedIndexArray: Array<number> = Array.from({ length: nodeData.children.length }, (_, i) => i);\n      this.lastOrder &&\n        this.lastOrder !== 'normal' &&\n        this.lastOrderField &&\n        sort.sort(\n          index =>\n            isValid(subNodeSortedIndexArray[index])\n              ? subNodeSortedIndexArray[index]\n              : (subNodeSortedIndexArray[index] = index),\n          (index, rel) => {\n            subNodeSortedIndexArray[index] = rel;\n          },\n          nodeData.children.length,\n          this.lastOrderFn,\n          this.lastOrder,\n          index =>\n            this.getOriginalField(\n              Array.isArray(indexKey) ? indexKey.concat([index]) : [indexKey, index],\n              this.lastOrderField\n            )\n        );\n      for (let i = 0; i < subNodeSortedIndexArray.length; i++) {\n        childrenLength += 1;\n        const childIndex = Array.isArray(indexKey)\n          ? indexKey.concat([subNodeSortedIndexArray[i]])\n          : [indexKey, subNodeSortedIndexArray[i]];\n        this.currentIndexedData.splice(\n          this.currentIndexedData.indexOf(indexKey) + childrenLength,\n          // this.pagination.currentPage * this.pagination.perPageCount +\n          // recordRowIndex +\n          // childrenLength,\n          0,\n          childIndex\n        );\n        const preChildState = this.treeDataHierarchyState.get(childIndex.join(','));\n        const childData = this.getOriginalRecord(childIndex);\n        if (!preChildState && (childData as any).children) {\n          this.treeDataHierarchyState.set(childIndex.join(','), HierarchyState.collapse);\n        }\n        childrenLength += this.pushChildrenNode(\n          childIndex,\n          this.treeDataHierarchyState.get(childIndex.join(',')),\n          nodeData.children[subNodeSortedIndexArray[i]]\n        );\n      }\n    }\n    return childrenLength;\n  }\n\n  /**\n   * 将数据record 替换到index位置处\n   * @param record\n   * @param index\n   */\n  setRecord(record: any, index: number) {\n    const indexed = this.getIndexKey(index);\n    if (!Array.isArray(indexed)) {\n      this.source.splice(indexed, 1, record);\n    } else {\n      const c_node_index = (indexed as Array<any>)[indexed.length - 1];\n      const p_node = this.getOriginalRecord(indexed.slice(0, indexed.length - 1));\n      (p_node as any).children.splice(c_node_index, 1, record);\n    }\n  }\n  sort(\n    field: FieldDef,\n    order: SortOrder,\n    orderFn: (v1: any, v2: any, order: SortOrder) => -1 | 0 | 1 = order !== 'desc'\n      ? (v1: any, v2: any): -1 | 0 | 1 => (v1 === v2 ? 0 : v1 > v2 ? 1 : -1)\n      : (v1: any, v2: any): -1 | 0 | 1 => (v1 === v2 ? 0 : v1 < v2 ? 1 : -1)\n  ): void {\n    this.lastOrderField = field;\n    this.lastOrder = order;\n    this.lastOrderFn = orderFn;\n    let filedMap = this.sortedIndexMap.get(field);\n    let orderedData;\n\n    if (filedMap) {\n      orderedData = filedMap[order];\n      if (orderedData && orderedData.length > 0) {\n        this.currentIndexedData = orderedData;\n        this.updatePagerData();\n        this.fireListeners(EVENT_TYPE.CHANGE_ORDER, null);\n        return;\n      }\n    }\n    const sortedIndexArray = [] as number[];\n    if (order === 'normal') {\n      for (let i = 0; i < this._sourceLength; i++) {\n        sortedIndexArray[i] = i;\n      }\n    } else {\n      sort.sort(\n        index => (isValid(sortedIndexArray[index]) ? sortedIndexArray[index] : (sortedIndexArray[index] = index)),\n        (index, rel) => {\n          sortedIndexArray[index] = rel;\n        },\n        this._sourceLength,\n        orderFn,\n        order,\n        index => this.getOriginalField(index, field)\n      );\n    }\n    this.currentIndexedData = sortedIndexArray;\n    if (this.enableHierarchyState) {\n      let nodeLength = sortedIndexArray.length;\n      const t0 = window.performance.now();\n      for (let i = 0; i < nodeLength; i++) {\n        const subNodeLength = this.pushChildrenNode(\n          sortedIndexArray[i],\n          this.treeDataHierarchyState.get(sortedIndexArray[i]),\n          this.getOriginalRecord(sortedIndexArray[i]) // ？sortedIndexArray 在这个过程中不是变化了吗 通过i取id还是对的吗？ 对哦！因为i和nodeLength都+subNodeLength 来动态调整过了！\n        );\n        nodeLength += subNodeLength;\n        i += subNodeLength;\n      }\n    }\n    if (!filedMap) {\n      filedMap = { asc: [], desc: [], normal: [] };\n      this.sortedIndexMap.set(field, filedMap);\n    }\n    filedMap[order] = sortedIndexArray;\n    this.updatePagerData();\n    this.fireListeners(EVENT_TYPE.CHANGE_ORDER, null);\n  }\n  /**\n   * 当节点折叠或者展开时 将排序缓存清空（非当前排序规则的缓存）\n   */\n  clearSortedIndexMap() {\n    if (this.lastOrderField && this.lastOrder) {\n      this.sortedIndexMap.forEach((sortMap, key) => {\n        if (key !== this.lastOrderField) {\n          this.sortedIndexMap.delete(key);\n        } else if (this.lastOrder === 'asc') {\n          sortMap.desc = [];\n          sortMap.normal = [];\n        } else if (this.lastOrder === 'desc') {\n          sortMap.asc = [];\n          sortMap.normal = [];\n        } else {\n          sortMap.desc = [];\n          sortMap.asc = [];\n        }\n      });\n    }\n  }\n  get sourceLenght(): number {\n    return this._sourceLength;\n  }\n  set sourceLength(sourceLen: number) {\n    if (this._sourceLength === sourceLen) {\n      return;\n    }\n    this._sourceLength = sourceLen;\n    this.fireListeners(EVENT_TYPE.SOURCE_LENGTH_UPDATE, this._sourceLength);\n  }\n  get length(): number {\n    return this.currentPagerIndexedData.length;\n  }\n  get dataSource(): DataSource {\n    return this;\n  }\n  get currentPagerIndexedData(): (number | number[])[] {\n    if (this._currentPagerIndexedData.length > 0) {\n      return this._currentPagerIndexedData;\n    }\n    return []; //this.currentIndexedData || [];\n  }\n  release(): void {\n    super.release?.();\n  }\n  clearSortedMap() {\n    this.currentIndexedData && (this.currentIndexedData.length = 0);\n    this.currentIndexedData = null;\n    this.sortedIndexMap.forEach(item => {\n      item.asc && (item.asc.length = 0);\n      item.desc && (item.desc.length = 0);\n    });\n    this.sortedIndexMap.clear();\n  }\n  clearCurrentIndexedData(): void {\n    this.currentIndexedData = null;\n    this.currentPagerIndexedData.length = 0;\n  }\n  protected getOriginalRecord(index: number | number[]): MaybePromiseOrUndefined {\n    return getValue(this._get(index), (val: MaybePromiseOrUndefined) => {\n      this.recordPromiseCallBack(index, val);\n    });\n  }\n  protected getOriginalField(index: number | number[], field: FieldDef | FieldFormat | number): FieldData {\n    if (field === null) {\n      return undefined;\n    }\n    const record = this.getOriginalRecord(index);\n    // return getField(record, field);\n    return getField(record, field, (val: any) => {\n      this.fieldPromiseCallBack(index, field, val);\n    });\n  }\n  protected hasOriginalField(index: number | number[], field: FieldDef): boolean {\n    if (field === null) {\n      return false;\n    }\n    if (typeof field === 'function') {\n      return true;\n    }\n    const record = this.getOriginalRecord(index);\n    return Boolean(record && (field as any) in (record as any));\n  }\n\n  protected fieldPromiseCallBack(\n    _index: number | number[],\n    _field: FieldDef | FieldFormat | number,\n    _value: MaybePromiseOrUndefined\n  ): void {\n    //\n  }\n  protected recordPromiseCallBack(_index: number | number[], _record: MaybePromiseOrUndefined): void {\n    //\n  }\n  /** 静态变量  代表数据为空 */\n  static EMPTY = new DataSource({\n    get() {\n      /* noop */\n    },\n    length: 0\n  });\n}\n"]}