@cj-tech-master/excelts 5.1.0 → 5.1.1

package/dist/iife/excelts.iife.js

@@ -1,5 +1,5 @@
 /*!
- * @cj-tech-master/excelts v5.1.0
+ * @cj-tech-master/excelts v5.1.1
  * TypeScript Excel Workbook Manager - Read and Write xlsx and csv Files.
  * (c) 2026 cjnoname
  * Released under the MIT License
@@ -5918,6 +5918,10 @@ var ExcelTS = (function(exports) {
 		* the rows will still be shifted as if the values existed
 		*/
 		spliceColumns(start, count, ...inserts) {
+			for (const merge of Object.values(this._merges)) for (let r = merge.top; r <= merge.bottom; r++) for (let c = merge.left; c <= merge.right; c++) {
+				const cell = this.findCell(r, c);
+				if (cell && cell.type === Enums.ValueType.Merge) cell.unmerge();
+			}
 			const nRows = this._rows.length;
 			if (inserts.length > 0) for (let i = 0; i < nRows; i++) {
 				const insertValues = inserts.map((insert) => insert[i] ?? null);
@@ -5940,6 +5944,7 @@ var ExcelTS = (function(exports) {
 					if (br && br.nativeCol >= start - 1) br.nativeCol = Math.max(0, br.nativeCol + nExpand);
 				}
 			}
+			this._spliceMerges("col", start, count, inserts.length);
 		}
 		/**
 		* Get the last column in a worksheet
@@ -6079,6 +6084,8 @@ var ExcelTS = (function(exports) {
 		duplicateRow(rowNum, count, insert = false) {
 			const rSrc = this._rows[rowNum - 1];
 			const inserts = Array.from({ length: count }).fill(rSrc.values);
+			const srcMerges = [];
+			for (const merge of Object.values(this._merges)) if (merge.top === rowNum && merge.bottom === rowNum) srcMerges.push(merge);
 			this.spliceRows(rowNum + 1, insert ? 0 : count, ...inserts);
 			for (let i = 0; i < count; i++) {
 				const rDst = this._rows[rowNum + i];
@@ -6088,6 +6095,15 @@ var ExcelTS = (function(exports) {
 					rDst.getCell(colNumber).style = cell.style;
 				});
 			}
+			if (srcMerges.length > 0) for (let i = 0; i < count; i++) {
+				const dstRow = rowNum + 1 + i;
+				if (!insert) {
+					const toRemove = [];
+					for (const [key, merge] of Object.entries(this._merges)) if (merge.top <= dstRow && merge.bottom >= dstRow) toRemove.push(key);
+					for (const key of toRemove) this._unMergeMaster(this.getCell(key));
+				}
+				for (const srcMerge of srcMerges) this.mergeCellsWithoutStyle(dstRow, srcMerge.left, dstRow, srcMerge.right);
+			}
 		}
 		/**
 		* Cut one or more rows (rows below are shifted up)
@@ -6096,6 +6112,10 @@ var ExcelTS = (function(exports) {
 		* Known limitation: If a splice causes any merged cells to move, the results may be unpredictable
 		*/
 		spliceRows(start, count, ...inserts) {
+			for (const merge of Object.values(this._merges)) for (let r = merge.top; r <= merge.bottom; r++) for (let c = merge.left; c <= merge.right; c++) {
+				const cell = this.findCell(r, c);
+				if (cell && cell.type === Enums.ValueType.Merge) cell.unmerge();
+			}
 			const nKeep = start + count;
 			const nInserts = inserts.length;
 			const nExpand = nInserts - count;
@@ -6126,12 +6146,6 @@ var ExcelTS = (function(exports) {
 					rDst.height = rSrc.height;
 					rSrc.eachCell({ includeEmpty: true }, (cell, colNumber) => {
 						rDst.getCell(colNumber).style = cell.style;
-						if (cell.type === Enums.ValueType.Merge) {
-							const cellToBeMerged = this.getRow(cell.row + nInserts).getCell(colNumber);
-							const prevMaster = cell.master;
-							const newMaster = this.getRow(prevMaster.row + nInserts).getCell(prevMaster.col);
-							cellToBeMerged.merge(newMaster);
-						}
 					});
 				} else this._rows[i + nExpand - 1] = void 0;
 			}
@@ -6148,6 +6162,7 @@ var ExcelTS = (function(exports) {
 					if (br && br.nativeRow >= start - 1) br.nativeRow = Math.max(0, br.nativeRow + nExpand);
 				}
 			}
+			this._spliceMerges("row", start, count, nInserts);
 		}
 		eachRow(optOrCallback, maybeCallback) {
 			let options;
@@ -6221,6 +6236,56 @@ var ExcelTS = (function(exports) {
 				delete this._merges[master.address];
 			}
 		}
+		/**
+		* Update _merges dictionary and cell-level merge references after a row or column splice.
+		*/
+		_spliceMerges(axis, start, count, nInserts) {
+			const nExpand = nInserts - count;
+			if (nExpand === 0 && count === 0) return;
+			const nKeep = start + count;
+			const isRow = axis === "row";
+			const newMerges = {};
+			for (const merge of Object.values(this._merges)) {
+				const { top, left, bottom, right } = merge.model;
+				const lo = isRow ? top : left;
+				const hi = isRow ? bottom : right;
+				if (nExpand <= 0 && count > 0) {
+					const deleteEnd = nKeep - 1;
+					if (lo > deleteEnd) {
+						const newRange = isRow ? new Range(top + nExpand, left, bottom + nExpand, right) : new Range(top, left + nExpand, bottom, right + nExpand);
+						newMerges[colCache.encodeAddress(newRange.top, newRange.left)] = newRange;
+					} else if (hi < start) newMerges[colCache.encodeAddress(top, left)] = merge;
+					else if (lo >= start && hi <= deleteEnd) {} else {
+						let newTop = top;
+						let newLeft = left;
+						let newBottom = bottom;
+						let newRight = right;
+						if (isRow) {
+							newTop = top < start ? top : start;
+							newBottom = Math.max(newTop, bottom + nExpand);
+						} else {
+							newLeft = left < start ? left : start;
+							newRight = Math.max(newLeft, right + nExpand);
+						}
+						const newRange = new Range(newTop, newLeft, newBottom, newRight);
+						if (newTop === newBottom && newLeft === newRight) {} else newMerges[colCache.encodeAddress(newRange.top, newRange.left)] = newRange;
+					}
+				} else if (lo >= nKeep) {
+					const newRange = isRow ? new Range(top + nExpand, left, bottom + nExpand, right) : new Range(top, left + nExpand, bottom, right + nExpand);
+					newMerges[colCache.encodeAddress(newRange.top, newRange.left)] = newRange;
+				} else if (hi < nKeep) newMerges[colCache.encodeAddress(top, left)] = merge;
+				else {
+					if (isRow) merge.model.bottom = bottom + nExpand;
+					else merge.model.right = right + nExpand;
+					newMerges[colCache.encodeAddress(top, left)] = merge;
+				}
+			}
+			this._merges = newMerges;
+			for (const m of Object.values(newMerges)) {
+				const master = this.getCell(m.top, m.left);
+				for (let r = m.top; r <= m.bottom; r++) for (let c = m.left; c <= m.right; c++) if (r > m.top || c > m.left) this.getCell(r, c).merge(master, true);
+			}
+		}
 		get hasMerges() {
 			return Object.values(this._merges).some(Boolean);
 		}