@atlaskit/adf-schema 29.2.0 → 30.0.1

package/dist/cjs/steps/table/utils/cell-step.js

@@ -1,202 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.applyCellStep = applyCellStep;
-exports.createCellStep = createCellStep;
-exports.getMapFromCellStep = getMapFromCellStep;
-exports.invertCellStep = invertCellStep;
-var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
-var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
-var _utils = require("@atlaskit/editor-tables/utils");
-function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
-function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { (0, _defineProperty2.default)(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
-var EmptyCellNodeSize = 4;
-function calculateRowsToSkip(attrs) {
-  if (attrs && attrs.rowspan) {
-    return attrs.rowspan - 1;
-  }
-  return 0;
-}
-
-/**
- * Given a cell step, this function has to do the specific transformation to executed that step.
- * It returns the applied cellStep and rows that needs to skip (because it was already handled).
- * @param tr
- * @param tableRect
- * @param cell
- * @param cellStep
- * @param isDelete
- * @param column
- */
-function applyCellStep(tr, tableRect, cell, cellStep, isDelete, column) {
-  // Apply the merge actions,
-  if (cellStep.mergeWith !== undefined) {
-    var cellNode = tr.doc.nodeAt(tr.mapping.map(cellStep.mergeWith));
-    var columns = column - tableRect.map.colCount(cellStep.mergeWith - tableRect.tableStart);
-    var cellAttrs = isDelete ? (0, _utils.removeColSpan)(cellNode.attrs, columns) : (0, _utils.addColSpan)(cellNode.attrs, columns);
-    if (cellAttrs.colspan > 0) {
-      // When colspan is 0 should remove the cell
-      tr.setNodeMarkup(tr.mapping.map(cellStep.mergeWith), undefined, cellAttrs);
-      return {
-        tr: tr,
-        skipRows: calculateRowsToSkip(cellAttrs),
-        cellStep: cellStep
-      };
-    }
-
-    // When the new colspan is 0, I need to change the operation to a delete operation
-    // Update cellStep with the proper data
-    cellStep.from = cellStep.mergeWith;
-    cellStep.to = cellStep.from + cellNode.nodeSize;
-    cellStep.mergeWith = undefined;
-  }
-  var skipRows = 0;
-  // Modify temporary document
-  if (isDelete) {
-    var _cellNode = tr.doc.nodeAt(tr.mapping.map(cellStep.from));
-    skipRows = calculateRowsToSkip(_cellNode.attrs);
-    tr.delete(tr.mapping.map(cellStep.from), tr.mapping.map(cellStep.to));
-  } else {
-    if (cellStep.newCell) {
-      tr.insert(tr.mapping.map(cellStep.from), cellStep.newCell);
-      skipRows = calculateRowsToSkip(cellStep.newCell.attrs);
-    } else {
-      tr.insert(tr.mapping.map(cellStep.from), cell.type.createAndFill());
-    }
-  }
-  return {
-    tr: tr,
-    skipRows: skipRows,
-    cellStep: cellStep
-  };
-}
-
-/**
- * Given a cell step, this functions return un StepMap representing this action.
- * [position, oldSize, newSize]
- * @param cellStep
- * @param isDelete
- */
-function getMapFromCellStep(cellStep, isDelete) {
-  if (cellStep.mergeWith !== undefined) {
-    return [cellStep.mergeWith, 1, 1];
-  }
-  if (isDelete) {
-    return [cellStep.from, cellStep.to - cellStep.from, 0];
-  } else {
-    if (cellStep.newCell) {
-      return [cellStep.from, 0, cellStep.newCell.nodeSize];
-    }
-    return [cellStep.from, 0, EmptyCellNodeSize];
-  }
-}
-
-/**
- * Helper to calculate the offset of the inverted cells.
- * When you delete consecutive rows in a single step, the position in the generated document
- *  are skipped by the all the changes except your own. (StepMap.map is not valid)
- * @param map
- * @param cellStep
- * @param isDelete
- */
-function getOffset(map, cellStep, isDelete) {
-  if (isDelete) {
-    return map.map(cellStep.from) - cellStep.from;
-  }
-  var _getMapFromCellStep = getMapFromCellStep(cellStep, isDelete),
-    _getMapFromCellStep2 = (0, _slicedToArray2.default)(_getMapFromCellStep, 3),
-    oldSize = _getMapFromCellStep2[1],
-    newSize = _getMapFromCellStep2[2];
-  return map.map(cellStep.from) - cellStep.from - (newSize - oldSize);
-}
-
-/**
- * Given a cell step, this function invert that step.
- * @param doc
- * @param getTableRectAndColumn
- * @param cellStep
- * @param isDelete
- * @param stepMap
- */
-function invertCellStep(doc, getTableRectAndColumn, cellStep, isDelete, stepMap) {
-  /**
-   * We need a correct map when a cell is added
-   * We need the normal map position minus the size of the cell you added it. Why?
-   * Having a table 3x3 and we add a new column at 2 creates this ranges
-   * [
-   *  10, 0, 4,
-   *  20, 0, 4,
-   *  30, 0, 4,
-   *  ]
-   *  Where:
-   *    * [10, 20, 30] are the original cell positions where we add the cells
-   *    * [0, 0, 0] are the old size. We are adding new cells, so it's always zero
-   *    * [4, 4, 4] are the new size. In this case, we are adding empty cell and has size 4, this will be different for prefill cells.
-   *  In the document generated the cells that I want to delete (if I invert this step) are [10, 24, 38]
-   *  this is calculated in the given way
-   *    * Map the position using this step mapping function, this will return the cell in the next column
-   *    * Remove the diff (4 - 0 in this case) of the current position.
-   *  For a delete action this not happen, it will always return the right value
-   */
-  var offset = getOffset(stepMap, cellStep, isDelete);
-  var newCellStepInfo = _objectSpread(_objectSpread({}, cellStep), {}, {
-    // Map the position to position of the generated document
-    from: cellStep.from + offset,
-    to: cellStep.to + offset
-  });
-  if (cellStep.mergeWith !== undefined) {
-    newCellStepInfo.mergeWith = cellStep.mergeWith + offset;
-  }
-  if (isDelete) {
-    // Add the removed cell as the new cell of the inverted step
-    var removedCell = doc.nodeAt(cellStep.from);
-    newCellStepInfo.newCell = removedCell.copy(removedCell.content);
-
-    // When we delete a column we can end in a position that doesnt represent the right column.
-    // This only happens on merged cell that ends in the deleted column.
-    // We need to remap this position to the "next" cell (AKA cellStep.to)
-    var _getTableRectAndColum = getTableRectAndColumn(),
-      column = _getTableRectAndColum.column,
-      rect = _getTableRectAndColum.rect;
-    if (column < rect.map.width) {
-      var isAtTheEnd = rect.map.colCount(cellStep.from - rect.tableStart) + removedCell.attrs.colspan - 1 === column;
-      if (cellStep.mergeWith !== undefined && isAtTheEnd) {
-        newCellStepInfo.mergeWith = newCellStepInfo.from;
-        newCellStepInfo.from = newCellStepInfo.to;
-      }
-    }
-  }
-  return newCellStepInfo;
-}
-
-/**
- * Create a cell step based on the current cell and operation (add/delete)
- * @param cell
- * @param column
- * @param isDelete
- * @param previousCellStep
- */
-function createCellStep(cell, column, isDelete, previousCellStep) {
-  var newCellStepInfo = {
-    from: cell.from,
-    to: cell.to
-  };
-  if (cell.hasMergedCells) {
-    // Check what column has to merge
-    if (column !== cell.col || isDelete) {
-      newCellStepInfo.mergeWith = cell.from;
-    }
-  }
-  if (previousCellStep) {
-    if (previousCellStep.mergeWith !== undefined) {
-      newCellStepInfo.mergeWith = previousCellStep.mergeWith;
-    }
-    if (previousCellStep.newCell) {
-      newCellStepInfo.newCell = previousCellStep.newCell;
-    }
-  }
-  return newCellStepInfo;
-}

package/dist/cjs/steps/table/utils/cells-at-column.js

@@ -1,73 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.cellsAtColumn = cellsAtColumn;
-var _regenerator = _interopRequireDefault(require("@babel/runtime/regenerator"));
-var _utils = require("@atlaskit/editor-tables/utils");
-var _tableMap = require("./table-map");
-var _marked = /*#__PURE__*/_regenerator.default.mark(cellsAtColumn);
-/**
- * Helper to have a consistent way to iterate for all the cells in a column.
- * You can skip rows by passing the rows to skipped in the next arguments.
- * For example: `iter.next(1)` to skip the next row
- * @param rect
- * @param col
- */
-function cellsAtColumn(rect, col) {
-  var map, tableStart, table, refColumn, row, index, pos, hasMergedCells, type, cell, cellInfo, skippedRows;
-  return _regenerator.default.wrap(function cellsAtColumn$(_context) {
-    while (1) switch (_context.prev = _context.next) {
-      case 0:
-        map = rect.map, tableStart = rect.tableStart, table = rect.table;
-        refColumn = col > 0 ? -1 : 0;
-        if ((0, _utils.columnIsHeader)(map, table, col + refColumn)) {
-          refColumn = col === 0 || col === map.width ? null : 0;
-        }
-        row = 0;
-      case 4:
-        if (!(row < map.height)) {
-          _context.next = 20;
-          break;
-        }
-        index = (0, _tableMap.getCellIndex)(rect.map, row, col);
-        pos = map.map[index]; // We only consider to has merged cell to the first cell in a rowspan.
-        hasMergedCells = (0, _tableMap.hasMergedColumns)(rect.map, row, col) && (0, _tableMap.isRootRow)(rect.map, row, col); // If this position falls inside a col-spanning cell
-        type = refColumn == null ? (0, _utils.tableNodeTypes)(table.type.schema).cell : table.nodeAt(map.map[index + refColumn]).type;
-        if (!hasMergedCells) {
-          pos = map.positionAt(row, col, table);
-        }
-        cell = table.nodeAt(pos);
-        cellInfo = {
-          from: tableStart + pos,
-          to: tableStart + pos,
-          row: row,
-          col: hasMergedCells ? map.colCount(pos) : col,
-          type: type,
-          hasMergedCells: hasMergedCells
-        };
-        if (cell) {
-          cellInfo.attrs = cell.attrs;
-          cellInfo.to = tableStart + pos + cell.nodeSize;
-        }
-
-        // We let the consumer to pass the rows that we want to skip
-        _context.next = 15;
-        return cellInfo;
-      case 15:
-        skippedRows = _context.sent;
-        if (skippedRows && skippedRows > 0) {
-          row += skippedRows;
-        }
-      case 17:
-        row++;
-        _context.next = 4;
-        break;
-      case 20:
-      case "end":
-        return _context.stop();
-    }
-  }, _marked);
-}

package/dist/cjs/steps/table/utils/find-column.js

@@ -1,90 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.findColumn = findColumn;
-/**
- * Try to find the right column based on the cell steps in column info..
- * @param columnInfo  - Map of cell positions sorted from lower to greather
- * @param rect - map rect
- */
-function findColumn(columnInfo, rect) {
-  /**
-   * Algorithm explained
-   * Given a table like this:
-   *    | 5  | 10      |
-   *    | 15      | 20 |
-   *    | 25 | 30 | 35 |
-   * Represented by a table map like this:
-   *   rect.map = [5, 10, 10,
-   *              15, 15, 20,
-   *              25, 30, 35]
-   * And a have this inputs:
-   *   columnInfo[].from = [10, 15, 30]
-   *
-   * Algorithm:
-   *    * Initial state
-   *      start = 0;
-   *      end = 2 (rect.width - 1 === 3 - 1)
-   *    * Iterate until find first cell position
-   *      start = 1
-   *      end = 2 (min(start column + colspan - 1, start column + end column))
-   *    * Iterate until find second cell position
-   *      start = 1
-   *      end = 1
-   *    * Start === end return 1
-   */
-
-  // Initial range (start and end column) to search for each row
-  var start = 0,
-    end = rect.map.width - 1;
-  var iter = columnInfo.values();
-  var next = iter.next();
-
-  // Iterate for each row
-  for (var row = 0; row < rect.map.height; row++) {
-    if (next.done) {
-      break;
-    }
-    // Iterate for the column. Starting with the current start range
-    for (var col = start; col <= end; col++) {
-      var i = row * rect.map.width + col;
-      var cell = rect.map.map[i];
-      var cellInfo = next.value.from - rect.tableStart;
-
-      // When cell is found update range with the new values
-      if (cell === cellInfo) {
-        start = col; // Start column will be the current column
-        // Try to find the end column. End column will be different that start when has merged cells.
-        var endIndex = end - start + i;
-        for (var j = i; j <= endIndex; j++) {
-          if (rect.map.map[j] !== cell) {
-            break;
-          }
-
-          // merged columns
-          end = start + j - i; // Update the end column with the new position
-        }
-
-        if (start === end) {
-          // We found the right column only when start and end columns are the same.
-          return start;
-        }
-        next = iter.next();
-        break;
-      }
-
-      // Sometimes I want to find a column at the end of the table (It doesn't exist, but we can add a new cell there).
-      // This is represented by the end position of the last cell in the column.
-      // In this case return, table width
-      if (col === rect.map.width - 1) {
-        var cellNode = rect.table.nodeAt(cell);
-        if (cell + cellNode.nodeSize === cellInfo) {
-          return rect.map.width;
-        }
-      }
-    }
-  }
-  return null;
-}

package/dist/cjs/steps/table/utils/get-table-rect-from-doc.js

@@ -1,36 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.getTableRectFromDoc = getTableRectFromDoc;
-var _tableMap = require("@atlaskit/editor-tables/table-map");
-/**
- * Util to get the table rect from the docs
- * @param doc
- * @param tablePos
- */
-function getTableRectFromDoc(doc, tablePos) {
-  var table = doc.nodeAt(tablePos);
-
-  // Check for table existence
-  if (!table || table.type.name !== 'table') {
-    throw new Error("No table at position \"".concat(tablePos, "\"."));
-  }
-
-  // Create transform base on the doc
-  var map = _tableMap.TableMap.get(table);
-  var $table = doc.resolve(tablePos);
-  // Nested tables start position might differ from the original position
-  var start = $table.start($table.depth + 1);
-  return {
-    map: map,
-    table: table,
-    tableStart: start,
-    // Default to zero
-    bottom: 0,
-    left: 0,
-    right: 0,
-    top: 0
-  };
-}