@atlaskit/adf-schema 25.1.0 → 25.2.0

package/dist/cjs/steps/table/constants.js

@@ -6,7 +6,6 @@ Object.defineProperty(exports, "__esModule", {
 exports.SortOrder = void 0;
 var SortOrder;
 exports.SortOrder = SortOrder;
-
 (function (SortOrder) {
   SortOrder["ASC"] = "asc";
   SortOrder["DESC"] = "desc";

package/dist/cjs/steps/table/sort-column.js

@@ -1,41 +1,26 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.tableSortingStepType = exports.TableSortStep = void 0;
-
 var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
-
 var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-
 var _inherits2 = _interopRequireDefault(require("@babel/runtime/helpers/inherits"));
-
 var _possibleConstructorReturn2 = _interopRequireDefault(require("@babel/runtime/helpers/possibleConstructorReturn"));
-
 var _getPrototypeOf2 = _interopRequireDefault(require("@babel/runtime/helpers/getPrototypeOf"));
-
 var _prosemirrorModel = require("prosemirror-model");
-
 var _prosemirrorTransform = require("prosemirror-transform");
-
 function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2.default)(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2.default)(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2.default)(this, result); }; }
-
 function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
-
 var tableSortingStepType = 'atlaskit-table-sorting-ordering';
 exports.tableSortingStepType = tableSortingStepType;
-
 var TableSortStep = /*#__PURE__*/function (_Step) {
   (0, _inherits2.default)(TableSortStep, _Step);
-
   var _super = _createSuper(TableSortStep);
-
   function TableSortStep(pos, prev, next) {
     var _this;
-
     (0, _classCallCheck2.default)(this, TableSortStep);
     _this = _super.call(this);
     _this.prev = prev;
@@ -43,7 +28,6 @@ var TableSortStep = /*#__PURE__*/function (_Step) {
     _this.pos = pos;
     return _this;
   }
-
   (0, _createClass2.default)(TableSortStep, [{
     key: "invert",
     value: function invert() {
@@ -80,8 +64,5 @@ var TableSortStep = /*#__PURE__*/function (_Step) {
   return TableSortStep;
 }(_prosemirrorTransform.Step);
 /** Register this step with Prosemirror */
-
-
 exports.TableSortStep = TableSortStep;
-
 _prosemirrorTransform.Step.jsonID(tableSortingStepType, TableSortStep);

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

@@ -1,7 +1,6 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
@@ -9,26 +8,19 @@ 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(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-
 function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2.default)(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-
 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).
@@ -39,15 +31,12 @@ function calculateRowsToSkip(attrs) {
  * @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);
@@ -56,20 +45,18 @@ function applyCellStep(tr, tableRect, cell, cellStep, isDelete, column) {
         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
-
+    }
 
+    // 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
-
+  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 {
@@ -80,36 +67,33 @@ function applyCellStep(tr, tableRect, cell, cellStep, isDelete, column) {
       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
@@ -118,20 +102,17 @@ function getMapFromCellStep(cellStep, isDelete) {
  * @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];
-
+    _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
@@ -140,8 +121,6 @@ function getOffset(map, cellStep, isDelete) {
  * @param isDelete
  * @param stepMap
  */
-
-
 function invertCellStep(doc, getTableRectAndColumn, cellStep, isDelete, stepMap) {
   /**
    * We need a correct map when a cell is added
@@ -163,40 +142,36 @@ function invertCellStep(doc, getTableRectAndColumn, cellStep, isDelete, stepMap)
    *  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.
+    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;
-
+      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
@@ -204,30 +179,24 @@ function invertCellStep(doc, getTableRectAndColumn, cellStep, isDelete, stepMap)
  * @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,20 +1,14 @@
 "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.
@@ -30,30 +24,22 @@ function cellsAtColumn(rect, col) {
         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,
@@ -63,28 +49,23 @@ function cellsAtColumn(rect, 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
-
+          }
 
+          // 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();

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

@@ -4,7 +4,6 @@ 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
@@ -36,35 +35,35 @@ function findColumn(columnInfo, rect) {
    *      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;
+    end = rect.map.width - 1;
   var iter = columnInfo.values();
-  var next = iter.next(); // Iterate for each row
+  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
-
-
+    }
+    // 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
+      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
-
+          }
 
+          // merged columns
           end = start + j - i; // Update the end column with the new position
         }
 
@@ -72,23 +71,20 @@ function findColumn(columnInfo, rect) {
           // 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).
+      }
+
+      // 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

@@ -4,26 +4,24 @@ 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
+  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
-
+  }
 
+  // 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 $table = doc.resolve(tablePos);
+  // Nested tables start position might differ from the original position
   var start = $table.start($table.depth + 1);
   return {
     map: map,