@hrforte/react-pivottable 2.2.2 → 3.0.0

package/dist/pivotCompute.js

@@ -3,7 +3,7 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.WORKER_DEBOUNCE_MS = exports.DEFAULT_WORKER_THRESHOLD = undefined;
+exports.WORKER_DEBOUNCE_MS = exports.VIRTUAL_COLUMN_THRESHOLD = exports.VIRTUAL_ROW_THRESHOLD = exports.DEFAULT_WORKER_THRESHOLD = undefined;
 
 var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; /* eslint-disable no-console */
 /* eslint-disable valid-jsdoc */
@@ -22,6 +22,11 @@ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol
 exports.materializeData = materializeData;
 exports.computePivotState = computePivotState;
 exports.serializePivotData = serializePivotData;
+exports.getPivotViewportRowCount = getPivotViewportRowCount;
+exports.getPivotViewportColumnCount = getPivotViewportColumnCount;
+exports.alignSparseColumnsToRows = alignSparseColumnsToRows;
+exports.createVirtualPivotSummary = createVirtualPivotSummary;
+exports.computePivotViewport = computePivotViewport;
 exports.sortersHaveFunctions = sortersHaveFunctions;
 exports.sanitizeSorters = sanitizeSorters;
 exports.createWorkerConfig = createWorkerConfig;
@@ -34,21 +39,34 @@ var _Utilities = require('./Utilities');
 // larger ones are handed off to the Web Worker.
 var DEFAULT_WORKER_THRESHOLD = exports.DEFAULT_WORKER_THRESHOLD = 200;
 
+// Keep this in the computation module so the worker and renderer make the
+// same decision about when a compact, viewport-backed result can be used.
+var VIRTUAL_ROW_THRESHOLD = exports.VIRTUAL_ROW_THRESHOLD = 300;
+var VIRTUAL_COLUMN_THRESHOLD = exports.VIRTUAL_COLUMN_THRESHOLD = 100;
+
+var FLAT_KEY_SEPARATOR = String.fromCharCode(0);
+var SPARSE_CELL_FACTOR = 4;
+
 // Trailing debounce before a worker computation is dispatched, so rapid
 // interactions do not queue one full computation per single change.
 var WORKER_DEBOUNCE_MS = exports.WORKER_DEBOUNCE_MS = 100;
 
 /*
  * Walks the raw input once and computes the attribute-value inventory plus a
- * "materialized" copy of the records (with derived attributes applied).
+ * materialized view of the records (with derived attributes applied). Object
+ * arrays without derived attributes are reused to avoid a second pointer
+ * array for large datasets.
  * This is an exact extraction of the historical PivotTableUI behavior.
  */
 function materializeData(data, derivedAttributes) {
   var attrValues = {};
-  var materializedInput = [];
+  var canReuseInput = Array.isArray(data) && !Array.isArray(data[0]) && Object.keys(derivedAttributes || {}).length === 0;
+  var materializedInput = canReuseInput ? data : [];
   var recordsProcessed = 0;
   _Utilities.PivotData.forEachRecord(data, derivedAttributes || {}, function (record) {
-    materializedInput.push(record);
+    if (!canReuseInput) {
+      materializedInput.push(record);
+    }
     var _iteratorNormalCompletion = true;
     var _didIteratorError = false;
     var _iteratorError = undefined;
@@ -114,14 +132,10 @@ function computePivotState(materialized, config) {
  */
 function serializePivotData(pivotData, materialized) {
   var serializeCell = function serializeCell(cell) {
-    var values = {};
-    pivotData.aggregations.forEach(function (agg) {
+    return pivotData.aggregations.map(function (agg) {
       var instance = cell.getInstance(agg.key);
-      if (instance) {
-        values[agg.key] = instance.value();
-      }
+      return instance ? instance.value() : null;
     });
-    return { values: values };
   };
 
   var tree = {};
@@ -157,11 +171,203 @@ function serializePivotData(pivotData, materialized) {
       return Object.assign({}, agg);
     }),
     attrValues: materialized.attrValues,
-    materializedInput: materialized.materializedInput,
     totalRecords: materialized.totalRecords
   };
 }
 
+function getPivotViewportRowCount(precomputed, columnMode) {
+  var aggregations = precomputed.aggregations || [];
+  var expandAggregations = aggregations.length > 1 && !columnMode;
+  var rowKeyCount = precomputed.rowKeys.length || (expandAggregations ? 1 : 0);
+  return rowKeyCount * (expandAggregations ? aggregations.length : 1);
+}
+
+function getPivotViewportColumnCount(precomputed, columnMode) {
+  var colKeys = precomputed.colKeys || [];
+  if (!columnMode) {
+    return colKeys.length;
+  }
+  var aggregations = precomputed.aggregations || [];
+  var baseColumnCount = colKeys.length || 1;
+  return baseColumnCount * aggregations.length;
+}
+
+// A high-cardinality field on both axes creates a sparse matrix. Natural row
+// and column sorting can put every populated cell outside the first viewport,
+// making a correctly computed table look empty. For extremely sparse virtual
+// tables, keep every column but order it by the first sorted row that contains
+// a value. Dense pivots keep their normal column order.
+function alignSparseColumnsToRows(precomputed) {
+  var rowKeys = precomputed.rowKeys || [];
+  var colKeys = precomputed.colKeys || [];
+  if (rowKeys.length <= VIRTUAL_ROW_THRESHOLD || colKeys.length <= VIRTUAL_COLUMN_THRESHOLD) {
+    return false;
+  }
+
+  var maxSparseCells = Math.max(rowKeys.length, colKeys.length) * SPARSE_CELL_FACTOR;
+  var nonEmptyCells = 0;
+  var columnIndexByFlatKey = {};
+  colKeys.forEach(function (colKey, index) {
+    columnIndexByFlatKey[colKey.join(FLAT_KEY_SEPARATOR)] = index;
+  });
+  var seenColumnIndexes = {};
+  var orderedColumnIndexes = [];
+
+  var _loop = function _loop(rowIndex) {
+    var flatRowKey = rowKeys[rowIndex].join(FLAT_KEY_SEPARATOR);
+    var rowBranch = (precomputed.tree || {})[flatRowKey] || {};
+    var rowColumnIndexes = [];
+    var flatColumnKeys = Object.keys(rowBranch);
+    nonEmptyCells += flatColumnKeys.length;
+    if (nonEmptyCells > maxSparseCells) {
+      return {
+        v: false
+      };
+    }
+    flatColumnKeys.forEach(function (flatColumnKey) {
+      var columnIndex = columnIndexByFlatKey[flatColumnKey];
+      if (typeof columnIndex === 'number' && !seenColumnIndexes[columnIndex]) {
+        seenColumnIndexes[columnIndex] = true;
+        rowColumnIndexes.push(columnIndex);
+      }
+    });
+    rowColumnIndexes.sort(function (a, b) {
+      return a - b;
+    });
+    rowColumnIndexes.forEach(function (columnIndex) {
+      return orderedColumnIndexes.push(columnIndex);
+    });
+  };
+
+  for (var rowIndex = 0; rowIndex < rowKeys.length; rowIndex++) {
+    var _ret = _loop(rowIndex);
+
+    if ((typeof _ret === 'undefined' ? 'undefined' : _typeof(_ret)) === "object") return _ret.v;
+  }
+
+  if (nonEmptyCells === 0) {
+    return false;
+  }
+  colKeys.forEach(function (colKey, index) {
+    if (!seenColumnIndexes[index]) {
+      orderedColumnIndexes.push(index);
+    }
+  });
+  precomputed.colKeys = orderedColumnIndexes.map(function (index) {
+    return colKeys[index];
+  });
+  return true;
+}
+
+/*
+ * Creates the small result kept on the main thread for a virtualized table.
+ * Cell and row-total values stay in the worker and are transferred only for
+ * the visible viewport. Column totals remain here because the totals footer
+ * is always visible.
+ */
+function createVirtualPivotSummary(precomputed, columnMode) {
+  return {
+    rowKeys: [],
+    colKeys: precomputed.colKeys,
+    tree: {},
+    rowTotals: {},
+    colTotals: {},
+    allTotal: precomputed.allTotal,
+    aggregations: precomputed.aggregations,
+    attrValues: precomputed.attrValues,
+    totalRecords: precomputed.totalRecords,
+    totalRows: getPivotViewportRowCount(precomputed, columnMode),
+    totalColumns: getPivotViewportColumnCount(precomputed, columnMode),
+    virtualized: true
+  };
+}
+
+// Build only the rows requested by a virtualized table. The result contains
+// plain data and can cross the worker boundary without cloning the full pivot.
+function computePivotViewport(precomputed, start, end, columnMode) {
+  var columnStart = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;
+  var columnEnd = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : Number.MAX_SAFE_INTEGER;
+
+  var aggregations = precomputed.aggregations || [];
+  var expandAggregations = aggregations.length > 1 && !columnMode;
+  var rowKeys = expandAggregations && precomputed.rowKeys.length === 0 ? [[]] : precomputed.rowKeys;
+  var totalRows = getPivotViewportRowCount(precomputed, columnMode);
+  var first = Math.max(0, Math.min(totalRows, Math.floor(start)));
+  var last = Math.max(first, Math.min(totalRows, Math.floor(end)));
+  var colKeys = precomputed.colKeys || [];
+  var baseColKeys = columnMode && colKeys.length === 0 ? [[]] : colKeys;
+  var totalColumns = getPivotViewportColumnCount(precomputed, columnMode);
+  var firstColumn = Math.max(0, Math.min(totalColumns, Math.floor(columnStart)));
+  var lastColumn = Math.max(firstColumn, Math.min(totalColumns, Math.floor(columnEnd)));
+  var visibleFlatColumnKeys = {};
+  for (var column = firstColumn; column < lastColumn; column++) {
+    var baseColumnIndex = columnMode ? Math.floor(column / aggregations.length) : column;
+    var colKey = baseColKeys[baseColumnIndex];
+    if (colKey) {
+      visibleFlatColumnKeys[colKey.join(FLAT_KEY_SEPARATOR)] = true;
+    }
+  }
+  var selectVisibleCells = function selectVisibleCells(source) {
+    if (!source) {
+      return null;
+    }
+    var selected = {};
+    Object.keys(visibleFlatColumnKeys).forEach(function (flatColKey) {
+      if (flatColKey in source) {
+        selected[flatColKey] = source[flatColKey];
+      }
+    });
+    return selected;
+  };
+  var rows = [];
+
+  for (var index = first; index < last; index++) {
+    var rowIndex = expandAggregations ? Math.floor(index / aggregations.length) : index;
+    var rowKey = rowKeys[rowIndex];
+    var aggregation = expandAggregations ? aggregations[index % aggregations.length] : aggregations[0];
+    var flatRowKey = rowKey.join(FLAT_KEY_SEPARATOR);
+    rows.push({
+      displayKey: expandAggregations ? rowKey.concat([aggregation.label || aggregation.aggregatorName]) : rowKey,
+      actualKey: rowKey,
+      aggregationKey: aggregation.key,
+      spans: [],
+      cells: precomputed.tree ? selectVisibleCells(precomputed.tree[flatRowKey] || {}) : null,
+      rowTotal: precomputed.rowTotals ? precomputed.rowTotals[flatRowKey] || null : null
+    });
+  }
+
+  // Merge repeated row labels inside this window. Doing it here keeps the
+  // prefix comparisons off the main thread for worker-backed tables.
+  var columns = rows.length > 0 ? rows[0].displayKey.length : 0;
+  for (var _column = 0; _column < columns; _column++) {
+    var runStart = 0;
+    for (var _index = 1; _index <= rows.length; _index++) {
+      var samePrefix = _index < rows.length;
+      for (var part = 0; samePrefix && part <= _column; part++) {
+        samePrefix = rows[_index - 1].displayKey[part] === rows[_index].displayKey[part];
+      }
+      if (!samePrefix) {
+        rows[runStart].spans[_column] = _index - runStart;
+        for (var merged = runStart + 1; merged < _index; merged++) {
+          rows[merged].spans[_column] = -1;
+        }
+        runStart = _index;
+      }
+    }
+  }
+
+  return {
+    start: first,
+    end: last,
+    totalRows: totalRows,
+    columnStart: firstColumn,
+    columnEnd: lastColumn,
+    totalColumns: totalColumns,
+    colTotals: selectVisibleCells(precomputed.colTotals || {}),
+    rows: rows
+  };
+}
+
 /*
  * Sorters containing functions cannot be structured-cloned into a worker.
  * Returns true when the sorters prop itself, or any of its entries, is a
@@ -215,7 +421,11 @@ function createWorkerConfig(props) {
     rowOrder: props.rowOrder,
     colOrder: props.colOrder,
     rowSorts: props.rowSorts,
-    colSorts: props.colSorts
+    colSorts: props.colSorts,
+    virtualizeRows: Boolean(props.virtualizeRows),
+    rendererName: props.rendererName,
+    aggregationDisplayMode: props.tableOptions && props.tableOptions.aggregationDisplayMode,
+    sortersRequireMainThread: sortersHaveFunctions(props.sorters)
   };
 }
 
@@ -249,6 +459,21 @@ function canComputeInWorker(props) {
     return false;
   }
 
+  if (Object.keys(props.derivedAttributes || {}).length > 0) {
+    return false;
+  }
+
+  var requestedAggregatorNames = Array.isArray(props.aggregations) ? props.aggregations.map(function (aggregation) {
+    return aggregation.aggregatorName;
+  }) : [props.aggregatorName || 'Count'];
+  var aggregatorMap = props.aggregators || _Utilities.PivotData.defaultProps.aggregators;
+  var usesCustomAggregator = requestedAggregatorNames.some(function (name) {
+    return typeof aggregatorMap[name] !== 'undefined' && aggregatorMap[name] !== _Utilities.PivotData.defaultProps.aggregators[name];
+  });
+  if (usesCustomAggregator) {
+    return false;
+  }
+
   return true;
 }
 //# sourceMappingURL=pivotCompute.js.map

package/dist/pivotCompute.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/pivotCompute.js"],"names":["materializeData","computePivotState","serializePivotData","sortersHaveFunctions","sanitizeSorters","createWorkerConfig","createComputeSignature","canComputeInWorker","DEFAULT_WORKER_THRESHOLD","WORKER_DEBOUNCE_MS","data","derivedAttributes","attrValues","materializedInput","recordsProcessed","PivotData","forEachRecord","record","push","Object","keys","attr","null","value","totalRecords","materialized","config","pivotData","assign","getRowKeys","getColKeys","serializeCell","values","aggregations","forEach","instance","cell","getInstance","agg","key","tree","rowBranch","flatRowKey","serializedRow","flatColKey","serializeTotals","serialized","totals","flatKey","rowKeys","map","slice","colKeys","rowTotals","colTotals","allTotal","sorters","some","clean","sorter","Array","isArray","props","rows","cols","aggregatorName","vals","valueFilter","rowOrder","colOrder","rowSorts","colSorts","JSON","stringify","options","enabled","Worker","threshold","length"],"mappings":";;;;;;;8QAAA;AACA;AACA;;;;;;;;;;;;QAyBgBA,e,GAAAA,e;QA+BAC,iB,GAAAA,iB;QAkBAC,kB,GAAAA,kB;QAkDAC,oB,GAAAA,oB;QAcAC,e,GAAAA,e;QAuBAC,kB,GAAAA,kB;QAoBAC,sB,GAAAA,sB;QAUAC,kB,GAAAA,kB;;AArLhB;;AAEA;AACA;AACO,IAAMC,8DAA2B,GAAjC;;AAEP;AACA;AACO,IAAMC,kDAAqB,GAA3B;;AAEP;;;;;AAKO,SAAST,eAAT,CAAyBU,IAAzB,EAA+BC,iBAA/B,EAAkD;AACvD,MAAMC,aAAa,EAAnB;AACA,MAAMC,oBAAoB,EAA1B;AACA,MAAIC,mBAAmB,CAAvB;AACAC,uBAAUC,aAAV,CAAwBN,IAAxB,EAA8BC,qBAAqB,EAAnD,EAAuD,UAASM,MAAT,EAAiB;AACtEJ,sBAAkBK,IAAlB,CAAuBD,MAAvB;AADsE;AAAA;AAAA;;AAAA;AAEtE,2BAAmBE,OAAOC,IAAP,CAAYH,MAAZ,CAAnB,8HAAwC;AAAA,YAA7BI,IAA6B;;AACtC,YAAI,EAAEA,QAAQT,UAAV,CAAJ,EAA2B;AACzBA,qBAAWS,IAAX,IAAmB,EAAnB;AACA,cAAIP,mBAAmB,CAAvB,EAA0B;AACxBF,uBAAWS,IAAX,EAAiBC,IAAjB,GAAwBR,gBAAxB;AACD;AACF;AACF;AATqE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAUtE,SAAK,IAAMO,KAAX,IAAmBT,UAAnB,EAA+B;AAC7B,UAAMW,QAAQF,SAAQJ,MAAR,GAAiBA,OAAOI,KAAP,CAAjB,GAAgC,MAA9C;AACA,UAAI,EAAEE,SAASX,WAAWS,KAAX,CAAX,CAAJ,EAAkC;AAChCT,mBAAWS,KAAX,EAAiBE,KAAjB,IAA0B,CAA1B;AACD;AACDX,iBAAWS,KAAX,EAAiBE,KAAjB;AACD;AACDT;AACD,GAlBD;AAmBA,SAAO,EAACF,sBAAD,EAAaC,oCAAb,EAAgCW,cAAcV,gBAA9C,EAAP;AACD;;AAED;;;;;AAKO,SAASb,iBAAT,CAA2BwB,YAA3B,EAAyCC,MAAzC,EAAiD;AACtD,MAAMC,YAAY,IAAIZ,oBAAJ,CAChBI,OAAOS,MAAP,CAAc,EAAd,EAAkBF,MAAlB,EAA0B;AACxBhB,UAAMe,aAAaZ,iBADK;AAExBF,uBAAmB;AAFK,GAA1B,CADgB,CAAlB;AAMA;AACAgB,YAAUE,UAAV;AACAF,YAAUG,UAAV;AACA,SAAO5B,mBAAmByB,SAAnB,EAA8BF,YAA9B,CAAP;AACD;;AAED;;;;;AAKO,SAASvB,kBAAT,CAA4ByB,SAA5B,EAAuCF,YAAvC,EAAqD;AAC1D,MAAMM,gBAAgB,SAAhBA,aAAgB,OAAQ;AAC5B,QAAMC,SAAS,EAAf;AACAL,cAAUM,YAAV,CAAuBC,OAAvB,CAA+B,eAAO;AACpC,UAAMC,WAAWC,KAAKC,WAAL,CAAiBC,IAAIC,GAArB,CAAjB;AACA,UAAIJ,QAAJ,EAAc;AACZH,eAAOM,IAAIC,GAAX,IAAkBJ,SAASZ,KAAT,EAAlB;AACD;AACF,KALD;AAMA,WAAO,EAACS,cAAD,EAAP;AACD,GATD;;AAWA,MAAMQ,OAAO,EAAb;AACArB,SAAOC,IAAP,CAAYO,UAAUa,IAAtB,EAA4BN,OAA5B,CAAoC,sBAAc;AAChD,QAAMO,YAAYd,UAAUa,IAAV,CAAeE,UAAf,CAAlB;AACA,QAAMC,gBAAgB,EAAtB;AACAxB,WAAOC,IAAP,CAAYqB,SAAZ,EAAuBP,OAAvB,CAA+B,sBAAc;AAC3CS,oBAAcC,UAAd,IAA4Bb,cAAcU,UAAUG,UAAV,CAAd,CAA5B;AACD,KAFD;AAGAJ,SAAKE,UAAL,IAAmBC,aAAnB;AACD,GAPD;;AASA,MAAME,kBAAkB,SAAlBA,eAAkB,SAAU;AAChC,QAAMC,aAAa,EAAnB;AACA3B,WAAOC,IAAP,CAAY2B,MAAZ,EAAoBb,OAApB,CAA4B,mBAAW;AACrCY,iBAAWE,OAAX,IAAsBjB,cAAcgB,OAAOC,OAAP,CAAd,CAAtB;AACD,KAFD;AAGA,WAAOF,UAAP;AACD,GAND;;AAQA,SAAO;AACLG,aAAStB,UAAUsB,OAAV,CAAkBC,GAAlB,CAAsB;AAAA,aAAOX,IAAIY,KAAJ,EAAP;AAAA,KAAtB,CADJ;AAELC,aAASzB,UAAUyB,OAAV,CAAkBF,GAAlB,CAAsB;AAAA,aAAOX,IAAIY,KAAJ,EAAP;AAAA,KAAtB,CAFJ;AAGLX,cAHK;AAILa,eAAWR,gBAAgBlB,UAAU0B,SAA1B,CAJN;AAKLC,eAAWT,gBAAgBlB,UAAU2B,SAA1B,CALN;AAMLC,cAAUxB,cAAcJ,UAAU4B,QAAxB,CANL;AAOLtB,kBAAcN,UAAUM,YAAV,CAAuBiB,GAAvB,CAA2B;AAAA,aAAO/B,OAAOS,MAAP,CAAc,EAAd,EAAkBU,GAAlB,CAAP;AAAA,KAA3B,CAPT;AAQL1B,gBAAYa,aAAab,UARpB;AASLC,uBAAmBY,aAAaZ,iBAT3B;AAULW,kBAAcC,aAAaD;AAVtB,GAAP;AAYD;;AAED;;;;;;AAMO,SAASrB,oBAAT,CAA8BqD,OAA9B,EAAuC;AAC5C,MAAI,OAAOA,OAAP,KAAmB,UAAvB,EAAmC;AACjC,WAAO,IAAP;AACD;AACD,MAAI,CAACA,OAAD,IAAY,QAAOA,OAAP,yCAAOA,OAAP,OAAmB,QAAnC,EAA6C;AAC3C,WAAO,KAAP;AACD;AACD,SAAOrC,OAAOC,IAAP,CAAYoC,OAAZ,EAAqBC,IAArB,CAA0B;AAAA,WAAQ,OAAOD,QAAQnC,IAAR,CAAP,KAAyB,UAAjC;AAAA,GAA1B,CAAP;AACD;;AAED;;;;AAIO,SAASjB,eAAT,CAAyBoD,OAAzB,EAAkC;AACvC,MACE,CAACA,OAAD,IACA,QAAOA,OAAP,yCAAOA,OAAP,OAAmB,QADnB,IAEA,OAAOA,OAAP,KAAmB,UAHrB,EAIE;AACA,WAAO,EAAP;AACD;AACD,MAAME,QAAQ,EAAd;AACAvC,SAAOC,IAAP,CAAYoC,OAAZ,EAAqBtB,OAArB,CAA6B,gBAAQ;AACnC,QAAMyB,SAASH,QAAQnC,IAAR,CAAf;AACA,QAAI,OAAOsC,MAAP,KAAkB,QAAlB,IAA8BC,MAAMC,OAAN,CAAcF,MAAd,CAAlC,EAAyD;AACvDD,YAAMrC,IAAN,IAAcsC,MAAd;AACD;AACF,GALD;AAMA,SAAOD,KAAP;AACD;;AAED;;;;;AAKO,SAASrD,kBAAT,CAA4ByD,KAA5B,EAAmC;AACxC,SAAO;AACLC,UAAMD,MAAMC,IADP;AAELC,UAAMF,MAAME,IAFP;AAGLC,oBAAgBH,MAAMG,cAHjB;AAILhC,kBAAc6B,MAAM7B,YAJf;AAKLiC,UAAMJ,MAAMI,IALP;AAMLC,iBAAaL,MAAMK,WANd;AAOLX,aAASpD,gBAAgB0D,MAAMN,OAAtB,CAPJ;AAQLY,cAAUN,MAAMM,QARX;AASLC,cAAUP,MAAMO,QATX;AAULC,cAAUR,MAAMQ,QAVX;AAWLC,cAAUT,MAAMS;AAXX,GAAP;AAaD;;AAED;;;;AAIO,SAASjE,sBAAT,CAAgCwD,KAAhC,EAAuC;AAC5C,SAAOU,KAAKC,SAAL,CAAepE,mBAAmByD,KAAnB,CAAf,CAAP;AACD;;AAED;;;;;;AAMO,SAASvD,kBAAT,CAA4BuD,KAA5B,EAAiD;AAAA,MAAdY,OAAc,uEAAJ,EAAI;;AACtD,MAAIA,QAAQC,OAAR,KAAoB,KAAxB,EAA+B;AAC7B,WAAO,KAAP;AACD;AACD,MAAI,OAAOC,MAAP,KAAkB,WAAtB,EAAmC;AACjC,WAAO,KAAP;AACD;AACD,MAAMC,YACJ,OAAOH,QAAQG,SAAf,KAA6B,QAA7B,GACIH,QAAQG,SADZ,GAEIrE,wBAHN;;AAKA,MAAME,OAAOoD,MAAMpD,IAAnB;AACA,MAAI,CAACkD,MAAMC,OAAN,CAAcnD,IAAd,CAAD,IAAwBA,KAAKoE,MAAL,GAAcD,SAA1C,EAAqD;AACnD,WAAO,KAAP;AACD;;AAED,SAAO,IAAP;AACD","file":"pivotCompute.js","sourcesContent":["/* eslint-disable no-console */\n/* eslint-disable valid-jsdoc */\n/*\n * Shared pivot-computation logic.\n *\n * This module contains the pure, DOM-free parts of the pivot computation so\n * that the exact same code paths can run:\n *   - on the main thread (classic synchronous rendering path), and\n *   - inside a Web Worker (src/pivotWorker.js) for large datasets.\n *\n * It must stay free of React and of any `window`/`document` references.\n */\nimport {PivotData} from './Utilities';\n\n// Datasets smaller than this are computed synchronously on the main thread;\n// larger ones are handed off to the Web Worker.\nexport const DEFAULT_WORKER_THRESHOLD = 200;\n\n// Trailing debounce before a worker computation is dispatched, so rapid\n// interactions do not queue one full computation per single change.\nexport const WORKER_DEBOUNCE_MS = 100;\n\n/*\n * Walks the raw input once and computes the attribute-value inventory plus a\n * \"materialized\" copy of the records (with derived attributes applied).\n * This is an exact extraction of the historical PivotTableUI behavior.\n */\nexport function materializeData(data, derivedAttributes) {\n  const attrValues = {};\n  const materializedInput = [];\n  let recordsProcessed = 0;\n  PivotData.forEachRecord(data, derivedAttributes || {}, function(record) {\n    materializedInput.push(record);\n    for (const attr of Object.keys(record)) {\n      if (!(attr in attrValues)) {\n        attrValues[attr] = {};\n        if (recordsProcessed > 0) {\n          attrValues[attr].null = recordsProcessed;\n        }\n      }\n    }\n    for (const attr in attrValues) {\n      const value = attr in record ? record[attr] : 'null';\n      if (!(value in attrValues[attr])) {\n        attrValues[attr][value] = 0;\n      }\n      attrValues[attr][value]++;\n    }\n    recordsProcessed++;\n  });\n  return {attrValues, materializedInput, totalRecords: recordsProcessed};\n}\n\n/*\n * Aggregates an already-materialized dataset into a PivotData instance and\n * serializes the result into a plain (structured-cloneable) object that can\n * cross the worker boundary and later hydrate PivotData on the main thread.\n */\nexport function computePivotState(materialized, config) {\n  const pivotData = new PivotData(\n    Object.assign({}, config, {\n      data: materialized.materializedInput,\n      derivedAttributes: {},\n    })\n  );\n  // Force key sorting to happen while we are (possibly) inside the worker.\n  pivotData.getRowKeys();\n  pivotData.getColKeys();\n  return serializePivotData(pivotData, materialized);\n}\n\n/*\n * Serializes a fully-built PivotData instance into plain data. Only the final\n * aggregated value of every cell is kept; `value()` and `format()` behavior\n * are reconstructed on the main thread by the PivotData hydration step.\n */\nexport function serializePivotData(pivotData, materialized) {\n  const serializeCell = cell => {\n    const values = {};\n    pivotData.aggregations.forEach(agg => {\n      const instance = cell.getInstance(agg.key);\n      if (instance) {\n        values[agg.key] = instance.value();\n      }\n    });\n    return {values};\n  };\n\n  const tree = {};\n  Object.keys(pivotData.tree).forEach(flatRowKey => {\n    const rowBranch = pivotData.tree[flatRowKey];\n    const serializedRow = {};\n    Object.keys(rowBranch).forEach(flatColKey => {\n      serializedRow[flatColKey] = serializeCell(rowBranch[flatColKey]);\n    });\n    tree[flatRowKey] = serializedRow;\n  });\n\n  const serializeTotals = totals => {\n    const serialized = {};\n    Object.keys(totals).forEach(flatKey => {\n      serialized[flatKey] = serializeCell(totals[flatKey]);\n    });\n    return serialized;\n  };\n\n  return {\n    rowKeys: pivotData.rowKeys.map(key => key.slice()),\n    colKeys: pivotData.colKeys.map(key => key.slice()),\n    tree,\n    rowTotals: serializeTotals(pivotData.rowTotals),\n    colTotals: serializeTotals(pivotData.colTotals),\n    allTotal: serializeCell(pivotData.allTotal),\n    aggregations: pivotData.aggregations.map(agg => Object.assign({}, agg)),\n    attrValues: materialized.attrValues,\n    materializedInput: materialized.materializedInput,\n    totalRecords: materialized.totalRecords,\n  };\n}\n\n/*\n * Sorters containing functions cannot be structured-cloned into a worker.\n * Returns true when the sorters prop itself, or any of its entries, is a\n * function. In that case PivotData re-sorts on the main thread after\n * hydration (distinct keys are few, so this stays cheap).\n */\nexport function sortersHaveFunctions(sorters) {\n  if (typeof sorters === 'function') {\n    return true;\n  }\n  if (!sorters || typeof sorters !== 'object') {\n    return false;\n  }\n  return Object.keys(sorters).some(attr => typeof sorters[attr] === 'function');\n}\n\n/*\n * Returns a structured-cloneable subset of the sorters prop: data-type names\n * and sample-value arrays survive the worker boundary, functions do not.\n */\nexport function sanitizeSorters(sorters) {\n  if (\n    !sorters ||\n    typeof sorters !== 'object' ||\n    typeof sorters === 'function'\n  ) {\n    return {};\n  }\n  const clean = {};\n  Object.keys(sorters).forEach(attr => {\n    const sorter = sorters[attr];\n    if (typeof sorter === 'string' || Array.isArray(sorter)) {\n      clean[attr] = sorter;\n    }\n  });\n  return clean;\n}\n\n/*\n * Extracts exactly the props PivotData needs to compute results, with\n * everything non-serializable stripped, so the object can be posted to the\n * worker and fed straight into PivotData.\n */\nexport function createWorkerConfig(props) {\n  return {\n    rows: props.rows,\n    cols: props.cols,\n    aggregatorName: props.aggregatorName,\n    aggregations: props.aggregations,\n    vals: props.vals,\n    valueFilter: props.valueFilter,\n    sorters: sanitizeSorters(props.sorters),\n    rowOrder: props.rowOrder,\n    colOrder: props.colOrder,\n    rowSorts: props.rowSorts,\n    colSorts: props.colSorts,\n  };\n}\n\n/*\n * Stable string signature of everything that influences a worker computation.\n * Data identity is NOT part of it; callers append their own data version.\n */\nexport function createComputeSignature(props) {\n  return JSON.stringify(createWorkerConfig(props));\n}\n\n/*\n * Decides whether the current props can be computed inside the Web Worker.\n * Anything that cannot be structured-cloned (function data sources, custom\n * derivedAttributes, custom aggregator maps) forces the classic path.\n * Function-based sorters are allowed: they are re-applied on the main thread.\n */\nexport function canComputeInWorker(props, options = {}) {\n  if (options.enabled === false) {\n    return false;\n  }\n  if (typeof Worker === 'undefined') {\n    return false;\n  }\n  const threshold =\n    typeof options.threshold === 'number'\n      ? options.threshold\n      : DEFAULT_WORKER_THRESHOLD;\n\n  const data = props.data;\n  if (!Array.isArray(data) || data.length < threshold) {\n    return false;\n  }\n\n  return true;\n}\n"]}
+{"version":3,"sources":["../src/pivotCompute.js"],"names":["materializeData","computePivotState","serializePivotData","getPivotViewportRowCount","getPivotViewportColumnCount","alignSparseColumnsToRows","createVirtualPivotSummary","computePivotViewport","sortersHaveFunctions","sanitizeSorters","createWorkerConfig","createComputeSignature","canComputeInWorker","DEFAULT_WORKER_THRESHOLD","VIRTUAL_ROW_THRESHOLD","VIRTUAL_COLUMN_THRESHOLD","FLAT_KEY_SEPARATOR","String","fromCharCode","SPARSE_CELL_FACTOR","WORKER_DEBOUNCE_MS","data","derivedAttributes","attrValues","canReuseInput","Array","isArray","Object","keys","length","materializedInput","recordsProcessed","PivotData","forEachRecord","record","push","attr","null","value","totalRecords","materialized","config","pivotData","assign","getRowKeys","getColKeys","serializeCell","aggregations","map","instance","cell","getInstance","agg","key","tree","forEach","rowBranch","flatRowKey","serializedRow","flatColKey","serializeTotals","serialized","totals","flatKey","rowKeys","slice","colKeys","rowTotals","colTotals","allTotal","precomputed","columnMode","expandAggregations","rowKeyCount","baseColumnCount","maxSparseCells","Math","max","nonEmptyCells","columnIndexByFlatKey","colKey","index","join","seenColumnIndexes","orderedColumnIndexes","rowIndex","rowColumnIndexes","flatColumnKeys","columnIndex","flatColumnKey","sort","a","b","totalRows","totalColumns","virtualized","start","end","columnStart","columnEnd","Number","MAX_SAFE_INTEGER","first","min","floor","last","baseColKeys","firstColumn","lastColumn","visibleFlatColumnKeys","column","baseColumnIndex","selectVisibleCells","source","selected","rows","rowKey","aggregation","displayKey","concat","label","aggregatorName","actualKey","aggregationKey","spans","cells","rowTotal","columns","runStart","samePrefix","part","merged","sorters","some","clean","sorter","props","cols","vals","valueFilter","rowOrder","colOrder","rowSorts","colSorts","virtualizeRows","Boolean","rendererName","aggregationDisplayMode","tableOptions","sortersRequireMainThread","JSON","stringify","options","enabled","Worker","threshold","requestedAggregatorNames","aggregatorMap","aggregators","defaultProps","usesCustomAggregator","name"],"mappings":";;;;;;;8QAAA;AACA;AACA;;;;;;;;;;;;QAmCgBA,e,GAAAA,e;QAqCAC,iB,GAAAA,iB;QAkBAC,kB,GAAAA,kB;QAsCAC,wB,GAAAA,wB;QAQAC,2B,GAAAA,2B;QAeAC,wB,GAAAA,wB;QA4DAC,yB,GAAAA,yB;QAmBAC,oB,GAAAA,oB;QAoHAC,oB,GAAAA,oB;QAcAC,e,GAAAA,e;QAuBAC,kB,GAAAA,kB;QAyBAC,sB,GAAAA,sB;QAUAC,kB,GAAAA,kB;;AAxZhB;;AAEA;AACA;AACO,IAAMC,8DAA2B,GAAjC;;AAEP;AACA;AACO,IAAMC,wDAAwB,GAA9B;AACA,IAAMC,8DAA2B,GAAjC;;AAEP,IAAMC,qBAAqBC,OAAOC,YAAP,CAAoB,CAApB,CAA3B;AACA,IAAMC,qBAAqB,CAA3B;;AAEA;AACA;AACO,IAAMC,kDAAqB,GAA3B;;AAEP;;;;;;;AAOO,SAASpB,eAAT,CAAyBqB,IAAzB,EAA+BC,iBAA/B,EAAkD;AACvD,MAAMC,aAAa,EAAnB;AACA,MAAMC,gBACJC,MAAMC,OAAN,CAAcL,IAAd,KACA,CAACI,MAAMC,OAAN,CAAcL,KAAK,CAAL,CAAd,CADD,IAEAM,OAAOC,IAAP,CAAYN,qBAAqB,EAAjC,EAAqCO,MAArC,KAAgD,CAHlD;AAIA,MAAMC,oBAAoBN,gBAAgBH,IAAhB,GAAuB,EAAjD;AACA,MAAIU,mBAAmB,CAAvB;AACAC,uBAAUC,aAAV,CAAwBZ,IAAxB,EAA8BC,qBAAqB,EAAnD,EAAuD,UAASY,MAAT,EAAiB;AACtE,QAAI,CAACV,aAAL,EAAoB;AAClBM,wBAAkBK,IAAlB,CAAuBD,MAAvB;AACD;AAHqE;AAAA;AAAA;;AAAA;AAItE,2BAAmBP,OAAOC,IAAP,CAAYM,MAAZ,CAAnB,8HAAwC;AAAA,YAA7BE,IAA6B;;AACtC,YAAI,EAAEA,QAAQb,UAAV,CAAJ,EAA2B;AACzBA,qBAAWa,IAAX,IAAmB,EAAnB;AACA,cAAIL,mBAAmB,CAAvB,EAA0B;AACxBR,uBAAWa,IAAX,EAAiBC,IAAjB,GAAwBN,gBAAxB;AACD;AACF;AACF;AAXqE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAYtE,SAAK,IAAMK,KAAX,IAAmBb,UAAnB,EAA+B;AAC7B,UAAMe,QAAQF,SAAQF,MAAR,GAAiBA,OAAOE,KAAP,CAAjB,GAAgC,MAA9C;AACA,UAAI,EAAEE,SAASf,WAAWa,KAAX,CAAX,CAAJ,EAAkC;AAChCb,mBAAWa,KAAX,EAAiBE,KAAjB,IAA0B,CAA1B;AACD;AACDf,iBAAWa,KAAX,EAAiBE,KAAjB;AACD;AACDP;AACD,GApBD;AAqBA,SAAO,EAACR,sBAAD,EAAaO,oCAAb,EAAgCS,cAAcR,gBAA9C,EAAP;AACD;;AAED;;;;;AAKO,SAAS9B,iBAAT,CAA2BuC,YAA3B,EAAyCC,MAAzC,EAAiD;AACtD,MAAMC,YAAY,IAAIV,oBAAJ,CAChBL,OAAOgB,MAAP,CAAc,EAAd,EAAkBF,MAAlB,EAA0B;AACxBpB,UAAMmB,aAAaV,iBADK;AAExBR,uBAAmB;AAFK,GAA1B,CADgB,CAAlB;AAMA;AACAoB,YAAUE,UAAV;AACAF,YAAUG,UAAV;AACA,SAAO3C,mBAAmBwC,SAAnB,EAA8BF,YAA9B,CAAP;AACD;;AAED;;;;;AAKO,SAAStC,kBAAT,CAA4BwC,SAA5B,EAAuCF,YAAvC,EAAqD;AAC1D,MAAMM,gBAAgB,SAAhBA,aAAgB;AAAA,WACpBJ,UAAUK,YAAV,CAAuBC,GAAvB,CAA2B,eAAO;AAChC,UAAMC,WAAWC,KAAKC,WAAL,CAAiBC,IAAIC,GAArB,CAAjB;AACA,aAAOJ,WAAWA,SAASX,KAAT,EAAX,GAA8B,IAArC;AACD,KAHD,CADoB;AAAA,GAAtB;;AAMA,MAAMgB,OAAO,EAAb;AACA3B,SAAOC,IAAP,CAAYc,UAAUY,IAAtB,EAA4BC,OAA5B,CAAoC,sBAAc;AAChD,QAAMC,YAAYd,UAAUY,IAAV,CAAeG,UAAf,CAAlB;AACA,QAAMC,gBAAgB,EAAtB;AACA/B,WAAOC,IAAP,CAAY4B,SAAZ,EAAuBD,OAAvB,CAA+B,sBAAc;AAC3CG,oBAAcC,UAAd,IAA4Bb,cAAcU,UAAUG,UAAV,CAAd,CAA5B;AACD,KAFD;AAGAL,SAAKG,UAAL,IAAmBC,aAAnB;AACD,GAPD;;AASA,MAAME,kBAAkB,SAAlBA,eAAkB,SAAU;AAChC,QAAMC,aAAa,EAAnB;AACAlC,WAAOC,IAAP,CAAYkC,MAAZ,EAAoBP,OAApB,CAA4B,mBAAW;AACrCM,iBAAWE,OAAX,IAAsBjB,cAAcgB,OAAOC,OAAP,CAAd,CAAtB;AACD,KAFD;AAGA,WAAOF,UAAP;AACD,GAND;;AAQA,SAAO;AACLG,aAAStB,UAAUsB,OAAV,CAAkBhB,GAAlB,CAAsB;AAAA,aAAOK,IAAIY,KAAJ,EAAP;AAAA,KAAtB,CADJ;AAELC,aAASxB,UAAUwB,OAAV,CAAkBlB,GAAlB,CAAsB;AAAA,aAAOK,IAAIY,KAAJ,EAAP;AAAA,KAAtB,CAFJ;AAGLX,cAHK;AAILa,eAAWP,gBAAgBlB,UAAUyB,SAA1B,CAJN;AAKLC,eAAWR,gBAAgBlB,UAAU0B,SAA1B,CALN;AAMLC,cAAUvB,cAAcJ,UAAU2B,QAAxB,CANL;AAOLtB,kBAAcL,UAAUK,YAAV,CAAuBC,GAAvB,CAA2B;AAAA,aAAOrB,OAAOgB,MAAP,CAAc,EAAd,EAAkBS,GAAlB,CAAP;AAAA,KAA3B,CAPT;AAQL7B,gBAAYiB,aAAajB,UARpB;AASLgB,kBAAcC,aAAaD;AATtB,GAAP;AAWD;;AAEM,SAASpC,wBAAT,CAAkCmE,WAAlC,EAA+CC,UAA/C,EAA2D;AAChE,MAAMxB,eAAeuB,YAAYvB,YAAZ,IAA4B,EAAjD;AACA,MAAMyB,qBAAqBzB,aAAalB,MAAb,GAAsB,CAAtB,IAA2B,CAAC0C,UAAvD;AACA,MAAME,cACJH,YAAYN,OAAZ,CAAoBnC,MAApB,KAA+B2C,qBAAqB,CAArB,GAAyB,CAAxD,CADF;AAEA,SAAOC,eAAeD,qBAAqBzB,aAAalB,MAAlC,GAA2C,CAA1D,CAAP;AACD;;AAEM,SAASzB,2BAAT,CAAqCkE,WAArC,EAAkDC,UAAlD,EAA8D;AACnE,MAAML,UAAUI,YAAYJ,OAAZ,IAAuB,EAAvC;AACA,MAAI,CAACK,UAAL,EAAiB;AACf,WAAOL,QAAQrC,MAAf;AACD;AACD,MAAMkB,eAAeuB,YAAYvB,YAAZ,IAA4B,EAAjD;AACA,MAAM2B,kBAAkBR,QAAQrC,MAAR,IAAkB,CAA1C;AACA,SAAO6C,kBAAkB3B,aAAalB,MAAtC;AACD;;AAED;AACA;AACA;AACA;AACA;AACO,SAASxB,wBAAT,CAAkCiE,WAAlC,EAA+C;AACpD,MAAMN,UAAUM,YAAYN,OAAZ,IAAuB,EAAvC;AACA,MAAME,UAAUI,YAAYJ,OAAZ,IAAuB,EAAvC;AACA,MACEF,QAAQnC,MAAR,IAAkBf,qBAAlB,IACAoD,QAAQrC,MAAR,IAAkBd,wBAFpB,EAGE;AACA,WAAO,KAAP;AACD;;AAED,MAAM4D,iBACJC,KAAKC,GAAL,CAASb,QAAQnC,MAAjB,EAAyBqC,QAAQrC,MAAjC,IAA2CV,kBAD7C;AAEA,MAAI2D,gBAAgB,CAApB;AACA,MAAMC,uBAAuB,EAA7B;AACAb,UAAQX,OAAR,CAAgB,UAACyB,MAAD,EAASC,KAAT,EAAmB;AACjCF,yBAAqBC,OAAOE,IAAP,CAAYlE,kBAAZ,CAArB,IAAwDiE,KAAxD;AACD,GAFD;AAGA,MAAME,oBAAoB,EAA1B;AACA,MAAMC,uBAAuB,EAA7B;;AAlBoD,6BAoB3CC,QApB2C;AAqBlD,QAAM5B,aAAaO,QAAQqB,QAAR,EAAkBH,IAAlB,CAAuBlE,kBAAvB,CAAnB;AACA,QAAMwC,YAAY,CAACc,YAAYhB,IAAZ,IAAoB,EAArB,EAAyBG,UAAzB,KAAwC,EAA1D;AACA,QAAM6B,mBAAmB,EAAzB;AACA,QAAMC,iBAAiB5D,OAAOC,IAAP,CAAY4B,SAAZ,CAAvB;AACAsB,qBAAiBS,eAAe1D,MAAhC;AACA,QAAIiD,gBAAgBH,cAApB,EAAoC;AAClC;AAAA,WAAO;AAAP;AACD;AACDY,mBAAehC,OAAf,CAAuB,yBAAiB;AACtC,UAAMiC,cAAcT,qBAAqBU,aAArB,CAApB;AACA,UAAI,OAAOD,WAAP,KAAuB,QAAvB,IAAmC,CAACL,kBAAkBK,WAAlB,CAAxC,EAAwE;AACtEL,0BAAkBK,WAAlB,IAAiC,IAAjC;AACAF,yBAAiBnD,IAAjB,CAAsBqD,WAAtB;AACD;AACF,KAND;AAOAF,qBAAiBI,IAAjB,CAAsB,UAACC,CAAD,EAAIC,CAAJ;AAAA,aAAUD,IAAIC,CAAd;AAAA,KAAtB;AACAN,qBAAiB/B,OAAjB,CAAyB;AAAA,aACvB6B,qBAAqBjD,IAArB,CAA0BqD,WAA1B,CADuB;AAAA,KAAzB;AArCkD;;AAoBpD,OAAK,IAAIH,WAAW,CAApB,EAAuBA,WAAWrB,QAAQnC,MAA1C,EAAkDwD,UAAlD,EAA8D;AAAA,qBAArDA,QAAqD;;AAAA;AAoB7D;;AAED,MAAIP,kBAAkB,CAAtB,EAAyB;AACvB,WAAO,KAAP;AACD;AACDZ,UAAQX,OAAR,CAAgB,UAACyB,MAAD,EAASC,KAAT,EAAmB;AACjC,QAAI,CAACE,kBAAkBF,KAAlB,CAAL,EAA+B;AAC7BG,2BAAqBjD,IAArB,CAA0B8C,KAA1B;AACD;AACF,GAJD;AAKAX,cAAYJ,OAAZ,GAAsBkB,qBAAqBpC,GAArB,CAAyB;AAAA,WAASkB,QAAQe,KAAR,CAAT;AAAA,GAAzB,CAAtB;AACA,SAAO,IAAP;AACD;;AAED;;;;;;AAMO,SAAS3E,yBAAT,CAAmCgE,WAAnC,EAAgDC,UAAhD,EAA4D;AACjE,SAAO;AACLP,aAAS,EADJ;AAELE,aAASI,YAAYJ,OAFhB;AAGLZ,UAAM,EAHD;AAILa,eAAW,EAJN;AAKLC,eAAW,EALN;AAMLC,cAAUC,YAAYD,QANjB;AAOLtB,kBAAcuB,YAAYvB,YAPrB;AAQLxB,gBAAY+C,YAAY/C,UARnB;AASLgB,kBAAc+B,YAAY/B,YATrB;AAULsD,eAAW1F,yBAAyBmE,WAAzB,EAAsCC,UAAtC,CAVN;AAWLuB,kBAAc1F,4BAA4BkE,WAA5B,EAAyCC,UAAzC,CAXT;AAYLwB,iBAAa;AAZR,GAAP;AAcD;;AAED;AACA;AACO,SAASxF,oBAAT,CACL+D,WADK,EAEL0B,KAFK,EAGLC,GAHK,EAIL1B,UAJK,EAOL;AAAA,MAFA2B,WAEA,uEAFc,CAEd;AAAA,MADAC,SACA,uEADYC,OAAOC,gBACnB;;AACA,MAAMtD,eAAeuB,YAAYvB,YAAZ,IAA4B,EAAjD;AACA,MAAMyB,qBAAqBzB,aAAalB,MAAb,GAAsB,CAAtB,IAA2B,CAAC0C,UAAvD;AACA,MAAMP,UACJQ,sBAAsBF,YAAYN,OAAZ,CAAoBnC,MAApB,KAA+B,CAArD,GACI,CAAC,EAAD,CADJ,GAEIyC,YAAYN,OAHlB;AAIA,MAAM6B,YAAY1F,yBAAyBmE,WAAzB,EAAsCC,UAAtC,CAAlB;AACA,MAAM+B,QAAQ1B,KAAKC,GAAL,CAAS,CAAT,EAAYD,KAAK2B,GAAL,CAASV,SAAT,EAAoBjB,KAAK4B,KAAL,CAAWR,KAAX,CAApB,CAAZ,CAAd;AACA,MAAMS,OAAO7B,KAAKC,GAAL,CAASyB,KAAT,EAAgB1B,KAAK2B,GAAL,CAASV,SAAT,EAAoBjB,KAAK4B,KAAL,CAAWP,GAAX,CAApB,CAAhB,CAAb;AACA,MAAM/B,UAAUI,YAAYJ,OAAZ,IAAuB,EAAvC;AACA,MAAMwC,cAAcnC,cAAcL,QAAQrC,MAAR,KAAmB,CAAjC,GAAqC,CAAC,EAAD,CAArC,GAA4CqC,OAAhE;AACA,MAAM4B,eAAe1F,4BAA4BkE,WAA5B,EAAyCC,UAAzC,CAArB;AACA,MAAMoC,cAAc/B,KAAKC,GAAL,CAClB,CADkB,EAElBD,KAAK2B,GAAL,CAAST,YAAT,EAAuBlB,KAAK4B,KAAL,CAAWN,WAAX,CAAvB,CAFkB,CAApB;AAIA,MAAMU,aAAahC,KAAKC,GAAL,CACjB8B,WADiB,EAEjB/B,KAAK2B,GAAL,CAAST,YAAT,EAAuBlB,KAAK4B,KAAL,CAAWL,SAAX,CAAvB,CAFiB,CAAnB;AAIA,MAAMU,wBAAwB,EAA9B;AACA,OAAK,IAAIC,SAASH,WAAlB,EAA+BG,SAASF,UAAxC,EAAoDE,QAApD,EAA8D;AAC5D,QAAMC,kBAAkBxC,aACpBK,KAAK4B,KAAL,CAAWM,SAAS/D,aAAalB,MAAjC,CADoB,GAEpBiF,MAFJ;AAGA,QAAM9B,SAAS0B,YAAYK,eAAZ,CAAf;AACA,QAAI/B,MAAJ,EAAY;AACV6B,4BAAsB7B,OAAOE,IAAP,CAAYlE,kBAAZ,CAAtB,IAAyD,IAAzD;AACD;AACF;AACD,MAAMgG,qBAAqB,SAArBA,kBAAqB,SAAU;AACnC,QAAI,CAACC,MAAL,EAAa;AACX,aAAO,IAAP;AACD;AACD,QAAMC,WAAW,EAAjB;AACAvF,WAAOC,IAAP,CAAYiF,qBAAZ,EAAmCtD,OAAnC,CAA2C,sBAAc;AACvD,UAAII,cAAcsD,MAAlB,EAA0B;AACxBC,iBAASvD,UAAT,IAAuBsD,OAAOtD,UAAP,CAAvB;AACD;AACF,KAJD;AAKA,WAAOuD,QAAP;AACD,GAXD;AAYA,MAAMC,OAAO,EAAb;;AAEA,OAAK,IAAIlC,QAAQqB,KAAjB,EAAwBrB,QAAQwB,IAAhC,EAAsCxB,OAAtC,EAA+C;AAC7C,QAAMI,WAAWb,qBACbI,KAAK4B,KAAL,CAAWvB,QAAQlC,aAAalB,MAAhC,CADa,GAEboD,KAFJ;AAGA,QAAMmC,SAASpD,QAAQqB,QAAR,CAAf;AACA,QAAMgC,cAAc7C,qBAChBzB,aAAakC,QAAQlC,aAAalB,MAAlC,CADgB,GAEhBkB,aAAa,CAAb,CAFJ;AAGA,QAAMU,aAAa2D,OAAOlC,IAAP,CAAYlE,kBAAZ,CAAnB;AACAmG,SAAKhF,IAAL,CAAU;AACRmF,kBAAY9C,qBACR4C,OAAOG,MAAP,CAAc,CAACF,YAAYG,KAAZ,IAAqBH,YAAYI,cAAlC,CAAd,CADQ,GAERL,MAHI;AAIRM,iBAAWN,MAJH;AAKRO,sBAAgBN,YAAYhE,GALpB;AAMRuE,aAAO,EANC;AAORC,aAAOvD,YAAYhB,IAAZ,GACH0D,mBAAmB1C,YAAYhB,IAAZ,CAAiBG,UAAjB,KAAgC,EAAnD,CADG,GAEH,IATI;AAURqE,gBAAUxD,YAAYH,SAAZ,GACNG,YAAYH,SAAZ,CAAsBV,UAAtB,KAAqC,IAD/B,GAEN;AAZI,KAAV;AAcD;;AAED;AACA;AACA,MAAMsE,UAAUZ,KAAKtF,MAAL,GAAc,CAAd,GAAkBsF,KAAK,CAAL,EAAQG,UAAR,CAAmBzF,MAArC,GAA8C,CAA9D;AACA,OAAK,IAAIiF,UAAS,CAAlB,EAAqBA,UAASiB,OAA9B,EAAuCjB,SAAvC,EAAiD;AAC/C,QAAIkB,WAAW,CAAf;AACA,SAAK,IAAI/C,SAAQ,CAAjB,EAAoBA,UAASkC,KAAKtF,MAAlC,EAA0CoD,QAA1C,EAAmD;AACjD,UAAIgD,aAAahD,SAAQkC,KAAKtF,MAA9B;AACA,WAAK,IAAIqG,OAAO,CAAhB,EAAmBD,cAAcC,QAAQpB,OAAzC,EAAiDoB,MAAjD,EAAyD;AACvDD,qBACEd,KAAKlC,SAAQ,CAAb,EAAgBqC,UAAhB,CAA2BY,IAA3B,MAAqCf,KAAKlC,MAAL,EAAYqC,UAAZ,CAAuBY,IAAvB,CADvC;AAED;AACD,UAAI,CAACD,UAAL,EAAiB;AACfd,aAAKa,QAAL,EAAeJ,KAAf,CAAqBd,OAArB,IAA+B7B,SAAQ+C,QAAvC;AACA,aAAK,IAAIG,SAASH,WAAW,CAA7B,EAAgCG,SAASlD,MAAzC,EAAgDkD,QAAhD,EAA0D;AACxDhB,eAAKgB,MAAL,EAAaP,KAAb,CAAmBd,OAAnB,IAA6B,CAAC,CAA9B;AACD;AACDkB,mBAAW/C,MAAX;AACD;AACF;AACF;;AAED,SAAO;AACLe,WAAOM,KADF;AAELL,SAAKQ,IAFA;AAGLZ,wBAHK;AAILK,iBAAaS,WAJR;AAKLR,eAAWS,UALN;AAMLd,8BANK;AAOL1B,eAAW4C,mBAAmB1C,YAAYF,SAAZ,IAAyB,EAA5C,CAPN;AAQL+C;AARK,GAAP;AAUD;;AAED;;;;;;AAMO,SAAS3G,oBAAT,CAA8B4H,OAA9B,EAAuC;AAC5C,MAAI,OAAOA,OAAP,KAAmB,UAAvB,EAAmC;AACjC,WAAO,IAAP;AACD;AACD,MAAI,CAACA,OAAD,IAAY,QAAOA,OAAP,yCAAOA,OAAP,OAAmB,QAAnC,EAA6C;AAC3C,WAAO,KAAP;AACD;AACD,SAAOzG,OAAOC,IAAP,CAAYwG,OAAZ,EAAqBC,IAArB,CAA0B;AAAA,WAAQ,OAAOD,QAAQhG,IAAR,CAAP,KAAyB,UAAjC;AAAA,GAA1B,CAAP;AACD;;AAED;;;;AAIO,SAAS3B,eAAT,CAAyB2H,OAAzB,EAAkC;AACvC,MACE,CAACA,OAAD,IACA,QAAOA,OAAP,yCAAOA,OAAP,OAAmB,QADnB,IAEA,OAAOA,OAAP,KAAmB,UAHrB,EAIE;AACA,WAAO,EAAP;AACD;AACD,MAAME,QAAQ,EAAd;AACA3G,SAAOC,IAAP,CAAYwG,OAAZ,EAAqB7E,OAArB,CAA6B,gBAAQ;AACnC,QAAMgF,SAASH,QAAQhG,IAAR,CAAf;AACA,QAAI,OAAOmG,MAAP,KAAkB,QAAlB,IAA8B9G,MAAMC,OAAN,CAAc6G,MAAd,CAAlC,EAAyD;AACvDD,YAAMlG,IAAN,IAAcmG,MAAd;AACD;AACF,GALD;AAMA,SAAOD,KAAP;AACD;;AAED;;;;;AAKO,SAAS5H,kBAAT,CAA4B8H,KAA5B,EAAmC;AACxC,SAAO;AACLrB,UAAMqB,MAAMrB,IADP;AAELsB,UAAMD,MAAMC,IAFP;AAGLhB,oBAAgBe,MAAMf,cAHjB;AAIL1E,kBAAcyF,MAAMzF,YAJf;AAKL2F,UAAMF,MAAME,IALP;AAMLC,iBAAaH,MAAMG,WANd;AAOLP,aAAS3H,gBAAgB+H,MAAMJ,OAAtB,CAPJ;AAQLQ,cAAUJ,MAAMI,QARX;AASLC,cAAUL,MAAMK,QATX;AAULC,cAAUN,MAAMM,QAVX;AAWLC,cAAUP,MAAMO,QAXX;AAYLC,oBAAgBC,QAAQT,MAAMQ,cAAd,CAZX;AAaLE,kBAAcV,MAAMU,YAbf;AAcLC,4BACEX,MAAMY,YAAN,IAAsBZ,MAAMY,YAAN,CAAmBD,sBAftC;AAgBLE,8BAA0B7I,qBAAqBgI,MAAMJ,OAA3B;AAhBrB,GAAP;AAkBD;;AAED;;;;AAIO,SAASzH,sBAAT,CAAgC6H,KAAhC,EAAuC;AAC5C,SAAOc,KAAKC,SAAL,CAAe7I,mBAAmB8H,KAAnB,CAAf,CAAP;AACD;;AAED;;;;;;AAMO,SAAS5H,kBAAT,CAA4B4H,KAA5B,EAAiD;AAAA,MAAdgB,OAAc,uEAAJ,EAAI;;AACtD,MAAIA,QAAQC,OAAR,KAAoB,KAAxB,EAA+B;AAC7B,WAAO,KAAP;AACD;AACD,MAAI,OAAOC,MAAP,KAAkB,WAAtB,EAAmC;AACjC,WAAO,KAAP;AACD;AACD,MAAMC,YACJ,OAAOH,QAAQG,SAAf,KAA6B,QAA7B,GACIH,QAAQG,SADZ,GAEI9I,wBAHN;;AAKA,MAAMQ,OAAOmH,MAAMnH,IAAnB;AACA,MAAI,CAACI,MAAMC,OAAN,CAAcL,IAAd,CAAD,IAAwBA,KAAKQ,MAAL,GAAc8H,SAA1C,EAAqD;AACnD,WAAO,KAAP;AACD;;AAED,MAAIhI,OAAOC,IAAP,CAAY4G,MAAMlH,iBAAN,IAA2B,EAAvC,EAA2CO,MAA3C,GAAoD,CAAxD,EAA2D;AACzD,WAAO,KAAP;AACD;;AAED,MAAM+H,2BAA2BnI,MAAMC,OAAN,CAAc8G,MAAMzF,YAApB,IAC7ByF,MAAMzF,YAAN,CAAmBC,GAAnB,CAAuB;AAAA,WAAeqE,YAAYI,cAA3B;AAAA,GAAvB,CAD6B,GAE7B,CAACe,MAAMf,cAAN,IAAwB,OAAzB,CAFJ;AAGA,MAAMoC,gBAAgBrB,MAAMsB,WAAN,IAAqB9H,qBAAU+H,YAAV,CAAuBD,WAAlE;AACA,MAAME,uBAAuBJ,yBAAyBvB,IAAzB,CAC3B;AAAA,WACE,OAAOwB,cAAcI,IAAd,CAAP,KAA+B,WAA/B,IACAJ,cAAcI,IAAd,MAAwBjI,qBAAU+H,YAAV,CAAuBD,WAAvB,CAAmCG,IAAnC,CAF1B;AAAA,GAD2B,CAA7B;AAKA,MAAID,oBAAJ,EAA0B;AACxB,WAAO,KAAP;AACD;;AAED,SAAO,IAAP;AACD","file":"pivotCompute.js","sourcesContent":["/* eslint-disable no-console */\n/* eslint-disable valid-jsdoc */\n/*\n * Shared pivot-computation logic.\n *\n * This module contains the pure, DOM-free parts of the pivot computation so\n * that the exact same code paths can run:\n *   - on the main thread (classic synchronous rendering path), and\n *   - inside a Web Worker (src/pivotWorker.js) for large datasets.\n *\n * It must stay free of React and of any `window`/`document` references.\n */\nimport {PivotData} from './Utilities';\n\n// Datasets smaller than this are computed synchronously on the main thread;\n// larger ones are handed off to the Web Worker.\nexport const DEFAULT_WORKER_THRESHOLD = 200;\n\n// Keep this in the computation module so the worker and renderer make the\n// same decision about when a compact, viewport-backed result can be used.\nexport const VIRTUAL_ROW_THRESHOLD = 300;\nexport const VIRTUAL_COLUMN_THRESHOLD = 100;\n\nconst FLAT_KEY_SEPARATOR = String.fromCharCode(0);\nconst SPARSE_CELL_FACTOR = 4;\n\n// Trailing debounce before a worker computation is dispatched, so rapid\n// interactions do not queue one full computation per single change.\nexport const WORKER_DEBOUNCE_MS = 100;\n\n/*\n * Walks the raw input once and computes the attribute-value inventory plus a\n * materialized view of the records (with derived attributes applied). Object\n * arrays without derived attributes are reused to avoid a second pointer\n * array for large datasets.\n * This is an exact extraction of the historical PivotTableUI behavior.\n */\nexport function materializeData(data, derivedAttributes) {\n  const attrValues = {};\n  const canReuseInput =\n    Array.isArray(data) &&\n    !Array.isArray(data[0]) &&\n    Object.keys(derivedAttributes || {}).length === 0;\n  const materializedInput = canReuseInput ? data : [];\n  let recordsProcessed = 0;\n  PivotData.forEachRecord(data, derivedAttributes || {}, function(record) {\n    if (!canReuseInput) {\n      materializedInput.push(record);\n    }\n    for (const attr of Object.keys(record)) {\n      if (!(attr in attrValues)) {\n        attrValues[attr] = {};\n        if (recordsProcessed > 0) {\n          attrValues[attr].null = recordsProcessed;\n        }\n      }\n    }\n    for (const attr in attrValues) {\n      const value = attr in record ? record[attr] : 'null';\n      if (!(value in attrValues[attr])) {\n        attrValues[attr][value] = 0;\n      }\n      attrValues[attr][value]++;\n    }\n    recordsProcessed++;\n  });\n  return {attrValues, materializedInput, totalRecords: recordsProcessed};\n}\n\n/*\n * Aggregates an already-materialized dataset into a PivotData instance and\n * serializes the result into a plain (structured-cloneable) object that can\n * cross the worker boundary and later hydrate PivotData on the main thread.\n */\nexport function computePivotState(materialized, config) {\n  const pivotData = new PivotData(\n    Object.assign({}, config, {\n      data: materialized.materializedInput,\n      derivedAttributes: {},\n    })\n  );\n  // Force key sorting to happen while we are (possibly) inside the worker.\n  pivotData.getRowKeys();\n  pivotData.getColKeys();\n  return serializePivotData(pivotData, materialized);\n}\n\n/*\n * Serializes a fully-built PivotData instance into plain data. Only the final\n * aggregated value of every cell is kept; `value()` and `format()` behavior\n * are reconstructed on the main thread by the PivotData hydration step.\n */\nexport function serializePivotData(pivotData, materialized) {\n  const serializeCell = cell =>\n    pivotData.aggregations.map(agg => {\n      const instance = cell.getInstance(agg.key);\n      return instance ? instance.value() : null;\n    });\n\n  const tree = {};\n  Object.keys(pivotData.tree).forEach(flatRowKey => {\n    const rowBranch = pivotData.tree[flatRowKey];\n    const serializedRow = {};\n    Object.keys(rowBranch).forEach(flatColKey => {\n      serializedRow[flatColKey] = serializeCell(rowBranch[flatColKey]);\n    });\n    tree[flatRowKey] = serializedRow;\n  });\n\n  const serializeTotals = totals => {\n    const serialized = {};\n    Object.keys(totals).forEach(flatKey => {\n      serialized[flatKey] = serializeCell(totals[flatKey]);\n    });\n    return serialized;\n  };\n\n  return {\n    rowKeys: pivotData.rowKeys.map(key => key.slice()),\n    colKeys: pivotData.colKeys.map(key => key.slice()),\n    tree,\n    rowTotals: serializeTotals(pivotData.rowTotals),\n    colTotals: serializeTotals(pivotData.colTotals),\n    allTotal: serializeCell(pivotData.allTotal),\n    aggregations: pivotData.aggregations.map(agg => Object.assign({}, agg)),\n    attrValues: materialized.attrValues,\n    totalRecords: materialized.totalRecords,\n  };\n}\n\nexport function getPivotViewportRowCount(precomputed, columnMode) {\n  const aggregations = precomputed.aggregations || [];\n  const expandAggregations = aggregations.length > 1 && !columnMode;\n  const rowKeyCount =\n    precomputed.rowKeys.length || (expandAggregations ? 1 : 0);\n  return rowKeyCount * (expandAggregations ? aggregations.length : 1);\n}\n\nexport function getPivotViewportColumnCount(precomputed, columnMode) {\n  const colKeys = precomputed.colKeys || [];\n  if (!columnMode) {\n    return colKeys.length;\n  }\n  const aggregations = precomputed.aggregations || [];\n  const baseColumnCount = colKeys.length || 1;\n  return baseColumnCount * aggregations.length;\n}\n\n// A high-cardinality field on both axes creates a sparse matrix. Natural row\n// and column sorting can put every populated cell outside the first viewport,\n// making a correctly computed table look empty. For extremely sparse virtual\n// tables, keep every column but order it by the first sorted row that contains\n// a value. Dense pivots keep their normal column order.\nexport function alignSparseColumnsToRows(precomputed) {\n  const rowKeys = precomputed.rowKeys || [];\n  const colKeys = precomputed.colKeys || [];\n  if (\n    rowKeys.length <= VIRTUAL_ROW_THRESHOLD ||\n    colKeys.length <= VIRTUAL_COLUMN_THRESHOLD\n  ) {\n    return false;\n  }\n\n  const maxSparseCells =\n    Math.max(rowKeys.length, colKeys.length) * SPARSE_CELL_FACTOR;\n  let nonEmptyCells = 0;\n  const columnIndexByFlatKey = {};\n  colKeys.forEach((colKey, index) => {\n    columnIndexByFlatKey[colKey.join(FLAT_KEY_SEPARATOR)] = index;\n  });\n  const seenColumnIndexes = {};\n  const orderedColumnIndexes = [];\n\n  for (let rowIndex = 0; rowIndex < rowKeys.length; rowIndex++) {\n    const flatRowKey = rowKeys[rowIndex].join(FLAT_KEY_SEPARATOR);\n    const rowBranch = (precomputed.tree || {})[flatRowKey] || {};\n    const rowColumnIndexes = [];\n    const flatColumnKeys = Object.keys(rowBranch);\n    nonEmptyCells += flatColumnKeys.length;\n    if (nonEmptyCells > maxSparseCells) {\n      return false;\n    }\n    flatColumnKeys.forEach(flatColumnKey => {\n      const columnIndex = columnIndexByFlatKey[flatColumnKey];\n      if (typeof columnIndex === 'number' && !seenColumnIndexes[columnIndex]) {\n        seenColumnIndexes[columnIndex] = true;\n        rowColumnIndexes.push(columnIndex);\n      }\n    });\n    rowColumnIndexes.sort((a, b) => a - b);\n    rowColumnIndexes.forEach(columnIndex =>\n      orderedColumnIndexes.push(columnIndex)\n    );\n  }\n\n  if (nonEmptyCells === 0) {\n    return false;\n  }\n  colKeys.forEach((colKey, index) => {\n    if (!seenColumnIndexes[index]) {\n      orderedColumnIndexes.push(index);\n    }\n  });\n  precomputed.colKeys = orderedColumnIndexes.map(index => colKeys[index]);\n  return true;\n}\n\n/*\n * Creates the small result kept on the main thread for a virtualized table.\n * Cell and row-total values stay in the worker and are transferred only for\n * the visible viewport. Column totals remain here because the totals footer\n * is always visible.\n */\nexport function createVirtualPivotSummary(precomputed, columnMode) {\n  return {\n    rowKeys: [],\n    colKeys: precomputed.colKeys,\n    tree: {},\n    rowTotals: {},\n    colTotals: {},\n    allTotal: precomputed.allTotal,\n    aggregations: precomputed.aggregations,\n    attrValues: precomputed.attrValues,\n    totalRecords: precomputed.totalRecords,\n    totalRows: getPivotViewportRowCount(precomputed, columnMode),\n    totalColumns: getPivotViewportColumnCount(precomputed, columnMode),\n    virtualized: true,\n  };\n}\n\n// Build only the rows requested by a virtualized table. The result contains\n// plain data and can cross the worker boundary without cloning the full pivot.\nexport function computePivotViewport(\n  precomputed,\n  start,\n  end,\n  columnMode,\n  columnStart = 0,\n  columnEnd = Number.MAX_SAFE_INTEGER\n) {\n  const aggregations = precomputed.aggregations || [];\n  const expandAggregations = aggregations.length > 1 && !columnMode;\n  const rowKeys =\n    expandAggregations && precomputed.rowKeys.length === 0\n      ? [[]]\n      : precomputed.rowKeys;\n  const totalRows = getPivotViewportRowCount(precomputed, columnMode);\n  const first = Math.max(0, Math.min(totalRows, Math.floor(start)));\n  const last = Math.max(first, Math.min(totalRows, Math.floor(end)));\n  const colKeys = precomputed.colKeys || [];\n  const baseColKeys = columnMode && colKeys.length === 0 ? [[]] : colKeys;\n  const totalColumns = getPivotViewportColumnCount(precomputed, columnMode);\n  const firstColumn = Math.max(\n    0,\n    Math.min(totalColumns, Math.floor(columnStart))\n  );\n  const lastColumn = Math.max(\n    firstColumn,\n    Math.min(totalColumns, Math.floor(columnEnd))\n  );\n  const visibleFlatColumnKeys = {};\n  for (let column = firstColumn; column < lastColumn; column++) {\n    const baseColumnIndex = columnMode\n      ? Math.floor(column / aggregations.length)\n      : column;\n    const colKey = baseColKeys[baseColumnIndex];\n    if (colKey) {\n      visibleFlatColumnKeys[colKey.join(FLAT_KEY_SEPARATOR)] = true;\n    }\n  }\n  const selectVisibleCells = source => {\n    if (!source) {\n      return null;\n    }\n    const selected = {};\n    Object.keys(visibleFlatColumnKeys).forEach(flatColKey => {\n      if (flatColKey in source) {\n        selected[flatColKey] = source[flatColKey];\n      }\n    });\n    return selected;\n  };\n  const rows = [];\n\n  for (let index = first; index < last; index++) {\n    const rowIndex = expandAggregations\n      ? Math.floor(index / aggregations.length)\n      : index;\n    const rowKey = rowKeys[rowIndex];\n    const aggregation = expandAggregations\n      ? aggregations[index % aggregations.length]\n      : aggregations[0];\n    const flatRowKey = rowKey.join(FLAT_KEY_SEPARATOR);\n    rows.push({\n      displayKey: expandAggregations\n        ? rowKey.concat([aggregation.label || aggregation.aggregatorName])\n        : rowKey,\n      actualKey: rowKey,\n      aggregationKey: aggregation.key,\n      spans: [],\n      cells: precomputed.tree\n        ? selectVisibleCells(precomputed.tree[flatRowKey] || {})\n        : null,\n      rowTotal: precomputed.rowTotals\n        ? precomputed.rowTotals[flatRowKey] || null\n        : null,\n    });\n  }\n\n  // Merge repeated row labels inside this window. Doing it here keeps the\n  // prefix comparisons off the main thread for worker-backed tables.\n  const columns = rows.length > 0 ? rows[0].displayKey.length : 0;\n  for (let column = 0; column < columns; column++) {\n    let runStart = 0;\n    for (let index = 1; index <= rows.length; index++) {\n      let samePrefix = index < rows.length;\n      for (let part = 0; samePrefix && part <= column; part++) {\n        samePrefix =\n          rows[index - 1].displayKey[part] === rows[index].displayKey[part];\n      }\n      if (!samePrefix) {\n        rows[runStart].spans[column] = index - runStart;\n        for (let merged = runStart + 1; merged < index; merged++) {\n          rows[merged].spans[column] = -1;\n        }\n        runStart = index;\n      }\n    }\n  }\n\n  return {\n    start: first,\n    end: last,\n    totalRows,\n    columnStart: firstColumn,\n    columnEnd: lastColumn,\n    totalColumns,\n    colTotals: selectVisibleCells(precomputed.colTotals || {}),\n    rows,\n  };\n}\n\n/*\n * Sorters containing functions cannot be structured-cloned into a worker.\n * Returns true when the sorters prop itself, or any of its entries, is a\n * function. In that case PivotData re-sorts on the main thread after\n * hydration (distinct keys are few, so this stays cheap).\n */\nexport function sortersHaveFunctions(sorters) {\n  if (typeof sorters === 'function') {\n    return true;\n  }\n  if (!sorters || typeof sorters !== 'object') {\n    return false;\n  }\n  return Object.keys(sorters).some(attr => typeof sorters[attr] === 'function');\n}\n\n/*\n * Returns a structured-cloneable subset of the sorters prop: data-type names\n * and sample-value arrays survive the worker boundary, functions do not.\n */\nexport function sanitizeSorters(sorters) {\n  if (\n    !sorters ||\n    typeof sorters !== 'object' ||\n    typeof sorters === 'function'\n  ) {\n    return {};\n  }\n  const clean = {};\n  Object.keys(sorters).forEach(attr => {\n    const sorter = sorters[attr];\n    if (typeof sorter === 'string' || Array.isArray(sorter)) {\n      clean[attr] = sorter;\n    }\n  });\n  return clean;\n}\n\n/*\n * Extracts exactly the props PivotData needs to compute results, with\n * everything non-serializable stripped, so the object can be posted to the\n * worker and fed straight into PivotData.\n */\nexport function createWorkerConfig(props) {\n  return {\n    rows: props.rows,\n    cols: props.cols,\n    aggregatorName: props.aggregatorName,\n    aggregations: props.aggregations,\n    vals: props.vals,\n    valueFilter: props.valueFilter,\n    sorters: sanitizeSorters(props.sorters),\n    rowOrder: props.rowOrder,\n    colOrder: props.colOrder,\n    rowSorts: props.rowSorts,\n    colSorts: props.colSorts,\n    virtualizeRows: Boolean(props.virtualizeRows),\n    rendererName: props.rendererName,\n    aggregationDisplayMode:\n      props.tableOptions && props.tableOptions.aggregationDisplayMode,\n    sortersRequireMainThread: sortersHaveFunctions(props.sorters),\n  };\n}\n\n/*\n * Stable string signature of everything that influences a worker computation.\n * Data identity is NOT part of it; callers append their own data version.\n */\nexport function createComputeSignature(props) {\n  return JSON.stringify(createWorkerConfig(props));\n}\n\n/*\n * Decides whether the current props can be computed inside the Web Worker.\n * Anything that cannot be structured-cloned (function data sources, custom\n * derivedAttributes, custom aggregator maps) forces the classic path.\n * Function-based sorters are allowed: they are re-applied on the main thread.\n */\nexport function canComputeInWorker(props, options = {}) {\n  if (options.enabled === false) {\n    return false;\n  }\n  if (typeof Worker === 'undefined') {\n    return false;\n  }\n  const threshold =\n    typeof options.threshold === 'number'\n      ? options.threshold\n      : DEFAULT_WORKER_THRESHOLD;\n\n  const data = props.data;\n  if (!Array.isArray(data) || data.length < threshold) {\n    return false;\n  }\n\n  if (Object.keys(props.derivedAttributes || {}).length > 0) {\n    return false;\n  }\n\n  const requestedAggregatorNames = Array.isArray(props.aggregations)\n    ? props.aggregations.map(aggregation => aggregation.aggregatorName)\n    : [props.aggregatorName || 'Count'];\n  const aggregatorMap = props.aggregators || PivotData.defaultProps.aggregators;\n  const usesCustomAggregator = requestedAggregatorNames.some(\n    name =>\n      typeof aggregatorMap[name] !== 'undefined' &&\n      aggregatorMap[name] !== PivotData.defaultProps.aggregators[name]\n  );\n  if (usesCustomAggregator) {\n    return false;\n  }\n\n  return true;\n}\n"]}

package/dist/pivotWorker.js

@@ -2,13 +2,26 @@
 
 var _pivotCompute = require('./pivotCompute');
 
-var MAX_CACHED_DATASETS = 4;
+var MAX_CACHED_DATASETS = 2;
+var MAX_CACHED_PIVOTS = 2;
 
 var datasetCache = new Map();
+var pendingDatasets = new Map();
+var pivotCache = new Map();
+var pivotDataKeys = new Map();
+var pivotOwners = new Map();
 
 var debugEnabled = false;
 
-var cacheDataset = function cacheDataset(dataKey, dataset) {
+var cacheDataset = function cacheDataset(dataKey, dataset, ownerKey) {
+  if (ownerKey) {
+    datasetCache.forEach(function (cached, cachedKey) {
+      if (cached.ownerKey === ownerKey && cachedKey !== dataKey) {
+        datasetCache.delete(cachedKey);
+      }
+    });
+  }
+  dataset.ownerKey = ownerKey || null;
   datasetCache.delete(dataKey);
   datasetCache.set(dataKey, dataset);
   while (datasetCache.size > MAX_CACHED_DATASETS) {
@@ -45,7 +58,7 @@ self.addEventListener('message', function (event) {
     var startedAt = Date.now();
     log('#' + message.id + ' setData received: ' + (message.data || []).length + ' records (dataKey=' + message.dataKey + ')');
     try {
-      var dataset = cacheDataset(message.dataKey, (0, _pivotCompute.materializeData)(message.data, {}));
+      var dataset = cacheDataset(message.dataKey, (0, _pivotCompute.materializeData)(message.data, {}), message.ownerKey);
       log('#' + message.id + ' materialized ' + dataset.totalRecords + ' records in ' + (Date.now() - startedAt + 'ms (attributes: ' + Object.keys(dataset.attrValues).join(', ') + ')'));
     } catch (error) {
       log('#' + message.id + ' setData failed: ' + toErrorMessage(error));
@@ -58,20 +71,78 @@ self.addEventListener('message', function (event) {
     return;
   }
 
-  if (message.type === 'pivot:compute') {
+  if (message.type === 'pivot:setDataStart') {
+    pendingDatasets.set(message.dataKey, {
+      records: [],
+      ownerKey: message.ownerKey
+    });
+    return;
+  }
+
+  if (message.type === 'pivot:setDataChunk') {
+    var pending = pendingDatasets.get(message.dataKey);
+    if (pending) {
+      (message.data || []).forEach(function (record) {
+        return pending.records.push(record);
+      });
+    }
+    return;
+  }
+
+  if (message.type === 'pivot:setDataEnd') {
     var _startedAt = Date.now();
+    try {
+      var _pending = pendingDatasets.get(message.dataKey);
+      if (!_pending) {
+        throw new Error('no dataset staging buffer for key ' + message.dataKey);
+      }
+      pendingDatasets.delete(message.dataKey);
+      var _dataset = cacheDataset(message.dataKey, (0, _pivotCompute.materializeData)(_pending.records, {}), _pending.ownerKey);
+      log('#' + message.id + ' materialized ' + _dataset.totalRecords + ' chunked records ' + ('in ' + (Date.now() - _startedAt) + 'ms'));
+    } catch (error) {
+      pendingDatasets.delete(message.dataKey);
+      postToMain({
+        type: 'pivot:error',
+        id: message.id,
+        message: toErrorMessage(error)
+      });
+    }
+    return;
+  }
+
+  if (message.type === 'pivot:compute') {
+    var _startedAt2 = Date.now();
     var config = message.config || {};
     try {
-      var _dataset = datasetCache.get(message.dataKey);
-      if (!_dataset) {
+      var _dataset2 = datasetCache.get(message.dataKey);
+      if (!_dataset2) {
         throw new Error('no dataset staged for key ' + message.dataKey);
       }
       log('#' + message.id + ' compute received (rows=[' + (config.rows || []).join(', ') + '] cols=[' + (config.cols || []).join(', ') + '])');
-      var result = (0, _pivotCompute.computePivotState)(_dataset, message.config);
-      log('#' + message.id + ' computed in ' + (Date.now() - _startedAt) + 'ms (rowKeys: ' + result.rowKeys.length + ', colKeys: ' + result.colKeys.length + ', aggregations: ' + result.aggregations.map(function (agg) {
+      var result = (0, _pivotCompute.computePivotState)(_dataset2, message.config);
+      var columnMode = config.aggregationDisplayMode === 'column';
+      var totalRows = (0, _pivotCompute.getPivotViewportRowCount)(result, columnMode);
+      var totalColumns = (0, _pivotCompute.getPivotViewportColumnCount)(result, columnMode);
+      var useVirtualSummary = config.virtualizeRows && (config.rendererName || 'Table') === 'Table' && !config.sortersRequireMainThread && (totalRows > _pivotCompute.VIRTUAL_ROW_THRESHOLD || totalColumns > _pivotCompute.VIRTUAL_COLUMN_THRESHOLD);
+      var sparseColumnsAligned = useVirtualSummary && (0, _pivotCompute.alignSparseColumnsToRows)(result);
+      var resultForMain = useVirtualSummary ? (0, _pivotCompute.createVirtualPivotSummary)(result, columnMode) : result;
+      resultForMain.viewportKey = message.id;
+      pivotCache.set(message.id, useVirtualSummary ? result : {
+        rowKeys: result.rowKeys,
+        aggregations: result.aggregations
+      });
+      pivotDataKeys.set(message.id, message.dataKey);
+      pivotOwners.set(message.id, message.ownerKey || null);
+      while (pivotCache.size > MAX_CACHED_PIVOTS) {
+        var oldestKey = pivotCache.keys().next().value;
+        pivotCache.delete(oldestKey);
+        pivotDataKeys.delete(oldestKey);
+        pivotOwners.delete(oldestKey);
+      }
+      log('#' + message.id + ' computed in ' + (Date.now() - _startedAt2) + 'ms (rowKeys: ' + result.rowKeys.length + ', colKeys: ' + result.colKeys.length + ', sparse columns aligned: ' + sparseColumnsAligned + ', aggregations: ' + result.aggregations.map(function (agg) {
         return agg.key;
       }).join(', ') + ')');
-      postToMain({ type: 'pivot:result', id: message.id, result: result });
+      postToMain({ type: 'pivot:result', id: message.id, result: resultForMain });
     } catch (error) {
       log('#' + message.id + ' compute failed: ' + toErrorMessage(error));
       postToMain({
@@ -80,6 +151,91 @@ self.addEventListener('message', function (event) {
         message: toErrorMessage(error)
       });
     }
+    return;
+  }
+
+  if (message.type === 'pivot:viewport') {
+    try {
+      var pivot = pivotCache.get(message.viewportKey);
+      if (!pivot) {
+        throw new Error('Pivot viewport cache is unavailable');
+      }
+      var _result = (0, _pivotCompute.computePivotViewport)(pivot, message.start, message.end, message.columnMode, message.columnStart, message.columnEnd);
+      postToMain({ type: 'pivot:viewportResult', id: message.id, result: _result });
+      log('#' + message.id + ' viewport released after postMessage', {
+        rows: _result.rows.length,
+        datasets: datasetCache.size,
+        pivots: pivotCache.size
+      });
+    } catch (error) {
+      postToMain({
+        type: 'pivot:error',
+        id: message.id,
+        message: toErrorMessage(error)
+      });
+    }
+    return;
+  }
+
+  if (message.type === 'pivot:release') {
+    pivotCache.delete(message.viewportKey);
+    pivotDataKeys.delete(message.viewportKey);
+    pivotOwners.delete(message.viewportKey);
+    log('released pivot ' + message.viewportKey, {
+      datasets: datasetCache.size,
+      pivots: pivotCache.size
+    });
+    return;
+  }
+
+  if (message.type === 'pivot:releaseData') {
+    var _dataset3 = datasetCache.get(message.dataKey);
+    if (_dataset3) {
+      if (Array.isArray(_dataset3.materializedInput)) {
+        _dataset3.materializedInput.length = 0;
+      }
+      _dataset3.attrValues = null;
+    }
+    datasetCache.delete(message.dataKey);
+    pendingDatasets.delete(message.dataKey);
+    pivotCache.forEach(function (pivot, viewportKey) {
+      if (pivotDataKeys.get(viewportKey) === message.dataKey) {
+        pivot.attrValues = null;
+      }
+    });
+    log('released dataset ' + message.dataKey, {
+      datasets: datasetCache.size,
+      pivots: pivotCache.size
+    });
+    return;
+  }
+
+  if (message.type === 'pivot:releaseOwner') {
+    pendingDatasets.forEach(function (pending, dataKey) {
+      if (pending.ownerKey === message.ownerKey) {
+        pending.records.length = 0;
+        pendingDatasets.delete(dataKey);
+      }
+    });
+    datasetCache.forEach(function (dataset, dataKey) {
+      if (dataset.ownerKey === message.ownerKey) {
+        if (Array.isArray(dataset.materializedInput)) {
+          dataset.materializedInput.length = 0;
+        }
+        datasetCache.delete(dataKey);
+      }
+    });
+    pivotCache.forEach(function (pivot, viewportKey) {
+      if (pivotOwners.get(viewportKey) === message.ownerKey) {
+        pivotCache.delete(viewportKey);
+        pivotDataKeys.delete(viewportKey);
+        pivotOwners.delete(viewportKey);
+      }
+    });
+    log('released owner ' + message.ownerKey, {
+      datasets: datasetCache.size,
+      pivots: pivotCache.size
+    });
   }
 });
 //# sourceMappingURL=pivotWorker.js.map