@atlaskit/adf-schema 29.1.2 → 30.0.0

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
-  };
-}

package/dist/cjs/steps/table/utils/side-effects/rows.js

@@ -1,315 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.RowsSideEffectHandler = void 0;
-var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
-var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
-var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
-var _tableMap = require("../table-map");
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
-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; }
-function mergedRanges(first, second) {
-  var newRanges = [];
-  var firstLength = first.length;
-  var secondLength = second.length;
-  var i = 0;
-  var j = 0;
-  while (i < firstLength && j < secondLength) {
-    if (first[i] < second[j]) {
-      newRanges.push(first[i], first[i + 1], first[i + 2]);
-      i += 3;
-    } else {
-      newRanges.push(second[j], second[j + 1], second[j + 2]);
-      j += 3;
-    }
-  }
-  if (i < firstLength) {
-    newRanges.push.apply(newRanges, (0, _toConsumableArray2.default)(first.slice(i)));
-  }
-  if (j < secondLength) {
-    newRanges.push.apply(newRanges, (0, _toConsumableArray2.default)(second.slice(i)));
-  }
-  return newRanges;
-}
-function increaseRowSpan(tr, rect, row) {
-  var map = rect.map,
-    tableStart = rect.tableStart;
-  for (var _col2 = 0; _col2 < map.width; _col2++) {
-    var index = row * map.width + _col2;
-    var pos = map.map[index];
-    var mappedPos = tr.mapping.map(pos + tableStart);
-    var attrs = tr.doc.nodeAt(mappedPos).attrs;
-    tr.setNodeMarkup(mappedPos, undefined, _objectSpread(_objectSpread({}, attrs), {}, {
-      rowspan: attrs.rowspan + 1
-    }));
-    _col2 += attrs.colspan - 1;
-  }
-}
-function decreaseRowspan(tr, rect, row, colToRemove) {
-  var skipRows = 0;
-  var map = rect.map,
-    table = rect.table,
-    tableStart = rect.tableStart;
-  for (var _col3 = 0; _col3 < map.width; _col3++) {
-    var index = row * map.width + _col3;
-    var pos = map.map[index];
-    if (row > 0 && pos === map.map[index - map.width]) {
-      // If this cell starts in the row above, simply reduce its rowspan
-      var mappedPos = tr.mapping.map(pos + tableStart);
-      var attrs = tr.doc.nodeAt(mappedPos).attrs;
-      tr.setNodeMarkup(mappedPos, undefined, _objectSpread(_objectSpread({}, attrs), {}, {
-        rowspan: attrs.rowspan - 1
-      }));
-      _col3 += attrs.colspan - 1;
-    } else if (_col3 === colToRemove) {
-      skipRows = table.nodeAt(pos).attrs.rowspan - 1;
-    }
-  }
-  return skipRows;
-}
-function isLastCellInRow(rect, row, col) {
-  var rowNode = rect.table.child(row);
-  if (!rowNode) {
-    return false;
-  }
-  return rowNode.childCount === 1 && !(0, _tableMap.hasMergedColumns)(rect.map, row, col);
-}
-function removeRowWithLastCell(tr, rect, row, _col) {
-  // Get row pos
-  var from = rect.tableStart;
-  for (var i = 0; i < row; i++) {
-    from += rect.table.child(i).nodeSize;
-  }
-  var rowNode = rect.table.child(row);
-  var to = from + rowNode.nodeSize;
-
-  // Create sideEffect and delete the row
-  // We store original row position before modifications
-  tr.delete(tr.mapping.map(from), tr.mapping.map(to));
-
-  // Change rowspan of all cells except current col and get the rows to skip
-  var skipRows = decreaseRowspan(tr, rect, row, _col);
-  return {
-    skipRows: skipRows,
-    row: {
-      from: from,
-      to: to,
-      rowNode: rowNode.copy(rowNode.content)
-    }
-  };
-}
-function addRow(tr, rect, prevRow, rowSideEffect) {
-  var cellNode = rowSideEffect.rowNode.child(0);
-  tr.insert(tr.mapping.map(rowSideEffect.from), rowSideEffect.rowNode);
-  increaseRowSpan(tr, rect, prevRow);
-  return cellNode.attrs.rowspan - 1;
-}
-var RowsSideEffectHandler = /*#__PURE__*/function () {
-  function RowsSideEffectHandler(rowsSideEffect) {
-    var _this = this;
-    (0, _classCallCheck2.default)(this, RowsSideEffectHandler);
-    (0, _defineProperty2.default)(this, "deleteHandler", function () {
-      var newRows = [];
-      return {
-        handle: function handle(tr, rect, row, col, cell) {
-          if (!isLastCellInRow(rect, row, col)) {
-            return {
-              handled: false
-            };
-          }
-          var _removeRowWithLastCel = removeRowWithLastCell(tr, rect, row, col),
-            rowSideEffect = _removeRowWithLastCel.row,
-            skipRows = _removeRowWithLastCel.skipRows;
-          newRows.push(rowSideEffect);
-          return {
-            handled: true,
-            skipRows: skipRows
-          };
-        },
-        end: function end() {
-          if (newRows.length > 0) {
-            _this.rows = newRows;
-          } else {
-            _this.rows = undefined;
-          }
-        }
-      };
-    });
-    (0, _defineProperty2.default)(this, "addHandler", function () {
-      var lastCellFrom = 0;
-      var i = 0;
-      return {
-        handle: function handle(tr, rect, row, col, cell) {
-          // // If not sideEffects stored return;
-          if (!_this.rows || i >= _this.rows.length) {
-            return {
-              handled: false
-            };
-          }
-
-          // Next row to add;
-          var skipRows;
-          var nextRow;
-          while ((nextRow = _this.rows[i]) && nextRow.from > lastCellFrom && nextRow.from < cell.from) {
-            // I am in between of the previous and next row in the table;
-            skipRows = addRow(tr, rect, row - 1, nextRow);
-            i++;
-          }
-          lastCellFrom = cell.from;
-          if (!skipRows || skipRows === 0) {
-            return {
-              handled: false
-            };
-          }
-          return {
-            handled: true,
-            skipRows: skipRows - 1
-          };
-        },
-        end: function end(tr, rect, col) {
-          if (!_this.rows || i >= _this.rows.length) {
-            return;
-          }
-
-          // Add rows at the end of the table
-          var nextRow;
-          while (nextRow = _this.rows[i]) {
-            addRow(tr, rect, rect.map.height - 1, nextRow);
-            i++;
-          }
-        }
-      };
-    });
-    this.rows = rowsSideEffect;
-  }
-  (0, _createClass2.default)(RowsSideEffectHandler, [{
-    key: "start",
-    value: function start(isDelete) {
-      if (isDelete) {
-        return this.deleteHandler();
-      }
-      return this.addHandler();
-    }
-  }, {
-    key: "addRowRanges",
-    value: function addRowRanges(ranges, isDelete) {
-      if (!this.rows) {
-        return ranges;
-      }
-      var rowRanges = [];
-      var _iterator = _createForOfIteratorHelper(this.rows),
-        _step;
-      try {
-        for (_iterator.s(); !(_step = _iterator.n()).done;) {
-          var _row = _step.value;
-          var from = _row.from,
-            to = _row.to;
-          if (isDelete) {
-            rowRanges.push(from, to - from, 0);
-          } else {
-            rowRanges.push(from, 0, to - from);
-          }
-        }
-
-        // Merged ranges
-      } catch (err) {
-        _iterator.e(err);
-      } finally {
-        _iterator.f();
-      }
-      return mergedRanges(ranges, rowRanges);
-    }
-  }, {
-    key: "map",
-    value: function map(mapping) {
-      return [];
-    }
-  }, {
-    key: "invert",
-    value: function invert(originalDoc, isDelete, map) {
-      if (!this.rows) {
-        return;
-      }
-      var invertedRows = [];
-      var _iterator2 = _createForOfIteratorHelper(this.rows),
-        _step2;
-      try {
-        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-          var _row2 = _step2.value;
-          if (isDelete) {
-            // Moving from delete to add keep the inverted rows + offset
-            var offset = map.map(_row2.from) - _row2.from;
-            invertedRows.push(_objectSpread(_objectSpread({}, _row2), {}, {
-              from: _row2.from + offset,
-              to: _row2.from + offset
-            }));
-          } else {
-            // Moving from add to delete keep
-            // TODO: I think we need to add the respective cell into the cellSteps...... not sure....
-          }
-        }
-      } catch (err) {
-        _iterator2.e(err);
-      } finally {
-        _iterator2.f();
-      }
-      return invertedRows;
-    }
-  }, {
-    key: "toJSON",
-    value: function toJSON() {
-      if (!this.rows) {
-        return;
-      }
-      var rowsInJson = [];
-      var _iterator3 = _createForOfIteratorHelper(this.rows),
-        _step3;
-      try {
-        for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
-          var _row3 = _step3.value;
-          rowsInJson.push({
-            from: _row3.from,
-            to: _row3.to,
-            rowNode: _row3.rowNode.toJSON()
-          });
-        }
-      } catch (err) {
-        _iterator3.e(err);
-      } finally {
-        _iterator3.f();
-      }
-      return rowsInJson;
-    }
-  }], [{
-    key: "fromJSON",
-    value: function fromJSON(schema, json) {
-      var rowSideEffects = [];
-      var _iterator4 = _createForOfIteratorHelper(json),
-        _step4;
-      try {
-        for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
-          var _row4 = _step4.value;
-          rowSideEffects.push({
-            from: _row4.from,
-            to: _row4.to,
-            rowNode: schema.nodeFromJSON(_row4.rowNode)
-          });
-        }
-      } catch (err) {
-        _iterator4.e(err);
-      } finally {
-        _iterator4.f();
-      }
-      return rowSideEffects;
-    }
-  }]);
-  return RowsSideEffectHandler;
-}();
-exports.RowsSideEffectHandler = RowsSideEffectHandler;

package/dist/cjs/steps/table/utils/side-effects/side-effects.js

@@ -1,83 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.SideEffectsHandler = void 0;
-var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
-var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-var _table = require("./table");
-var _rows = require("./rows");
-var SideEffectsHandler = /*#__PURE__*/function () {
-  function SideEffectsHandler(sideEffects) {
-    (0, _classCallCheck2.default)(this, SideEffectsHandler);
-    this.table = new _table.TableSideEffectHandler(sideEffects && sideEffects.table);
-    this.rows = new _rows.RowsSideEffectHandler(sideEffects && sideEffects.rows);
-  }
-  (0, _createClass2.default)(SideEffectsHandler, [{
-    key: "getTableMap",
-    value: function getTableMap(isDelete) {
-      return this.table.getTableMap(isDelete);
-    }
-  }, {
-    key: "map",
-    value: function map(mapping) {
-      var sideEffects = {};
-      var tableSideEffect = this.table.map(mapping);
-      var rowsSideEffect = this.rows.map(mapping);
-      if (tableSideEffect) {
-        sideEffects.table = tableSideEffect;
-      }
-      if (rowsSideEffect) {
-        sideEffects.rows = rowsSideEffect;
-      }
-      return sideEffects;
-    }
-  }, {
-    key: "invert",
-    value: function invert(originalDoc, isDelete, map) {
-      var sideEffects = {};
-      var tableSideEffect = this.table.invert(originalDoc);
-      if (tableSideEffect) {
-        sideEffects.table = tableSideEffect;
-      }
-      var rowsSideEffect = this.rows.invert(originalDoc, isDelete, map);
-      if (rowsSideEffect) {
-        sideEffects.rows = rowsSideEffect;
-      }
-      return sideEffects;
-    }
-  }, {
-    key: "toJSON",
-    value: function toJSON() {
-      var tableSideEffectJson = this.table.toJSON();
-      var rowsSideEffectJson = this.rows.toJSON();
-      if (!tableSideEffectJson && !rowsSideEffectJson) {
-        return;
-      }
-      var sideEffectsJSON = {};
-      if (tableSideEffectJson) {
-        sideEffectsJSON.table = tableSideEffectJson;
-      }
-      if (rowsSideEffectJson) {
-        sideEffectsJSON.rows = rowsSideEffectJson;
-      }
-      return sideEffectsJSON;
-    }
-  }], [{
-    key: "fromJSON",
-    value: function fromJSON(schema, json) {
-      var sideEffects = {};
-      if (json.table) {
-        sideEffects.table = _table.TableSideEffectHandler.fromJSON(schema, json.table);
-      }
-      if (json.rows) {
-        sideEffects.rows = _rows.RowsSideEffectHandler.fromJSON(schema, json.rows);
-      }
-      return sideEffects;
-    }
-  }]);
-  return SideEffectsHandler;
-}();
-exports.SideEffectsHandler = SideEffectsHandler;