@titaui/pc 1.16.94 → 1.16.95

package/lib/components/rich-editor/plugins/block/lists/transforms.js

@@ -6,65 +6,43 @@ Object.defineProperty(exports, "__esModule", {
 exports.liftFollowingList = liftFollowingList;
 exports.liftSelectionList = liftSelectionList;
 exports.upgradeTextToLists = exports.splitParagraphs = void 0;
-
 var _prosemirrorModel = require("prosemirror-model");
-
 var _prosemirrorState = require("prosemirror-state");
-
 var _prosemirrorTransform = require("prosemirror-transform");
-
 var _prosemirrorCommands = require("prosemirror-commands");
-
 var _node = require("./utils/node");
-
 var _slice = require("../../../utils/slice");
-
 var _indentation = require("./utils/indentation");
-
 function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
-
 function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
-
 function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
-
 function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
-
 function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
-
 function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
-
 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 _iterableToArrayLimit(arr, i) { var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"]; if (_i == null) return; var _arr = []; var _n = true; var _d = false; var _s, _e; try { for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
-
 function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
-
 function liftListItem(selection, tr) {
   var $from = selection.$from,
-      $to = selection.$to;
+    $to = selection.$to;
   var nodeType = tr.doc.type.schema.nodes.listItem;
   var range = $from.blockRange($to, function (node) {
     return !!node.childCount && !!node.firstChild && node.firstChild.type === nodeType;
   });
-
   if (!range || range.depth < 2 || $from.node(range.depth - 1).type !== nodeType) {
     return tr;
   }
-
   var end = range.end;
   var endOfList = $to.end(range.depth);
-
   if (end < endOfList) {
     tr.step(new _prosemirrorTransform.ReplaceAroundStep(end - 1, endOfList, end, endOfList, new _prosemirrorModel.Slice(_prosemirrorModel.Fragment.from(nodeType.create(undefined, range.parent.copy())), 1, 0), 1, true));
     range = new _prosemirrorModel.NodeRange(tr.doc.resolve($from.pos), tr.doc.resolve(endOfList), range.depth);
   }
-
   return tr.lift(range, (0, _prosemirrorTransform.liftTarget)(range)).scrollIntoView();
-} // Function will lift list item following selection to level-1.
-
+}
 
+// Function will lift list item following selection to level-1.
 function liftFollowingList(from, to, rootListDepth, tr) {
   var listItem = tr.doc.type.schema.nodes.listItem;
   var lifted = false;
@@ -72,7 +50,6 @@ function liftFollowingList(from, to, rootListDepth, tr) {
     if (!lifted && node.type === listItem && pos > from) {
       lifted = true;
       var listDepth = rootListDepth + 3;
-
       while (listDepth > rootListDepth + 2) {
         var start = tr.doc.resolve(tr.mapping.map(pos));
         listDepth = start.depth;
@@ -83,12 +60,12 @@ function liftFollowingList(from, to, rootListDepth, tr) {
     }
   });
   return tr;
-} // The function will list paragraphs in selection out to level 1 below root list.
-
+}
 
+// The function will list paragraphs in selection out to level 1 below root list.
 function liftSelectionList(selection, tr) {
   var from = selection.from,
-      to = selection.to;
+    to = selection.to;
   var paragraph = tr.doc.type.schema.nodes.paragraph;
   var listCol = [];
   tr.doc.nodesBetween(from, to, function (node, pos) {
@@ -99,43 +76,35 @@ function liftSelectionList(selection, tr) {
       });
     }
   });
-
   for (var i = listCol.length - 1; i >= 0; i--) {
     var _paragraph = listCol[i];
     var start = tr.doc.resolve(tr.mapping.map(_paragraph.pos));
-
     if (start.depth > 0) {
       var end = void 0;
-
       if (_paragraph.node.textContent && _paragraph.node.textContent.length > 0) {
         end = tr.doc.resolve(tr.mapping.map(_paragraph.pos + _paragraph.node.textContent.length));
       } else {
         end = tr.doc.resolve(tr.mapping.map(_paragraph.pos + 1));
       }
-
       var range = start.blockRange(end);
-
       if (range) {
         tr.lift(range, (0, _indentation.getListLiftTarget)(start));
       }
     }
   }
-
   return tr;
-} // matchers for text lists
-
+}
 
+// matchers for text lists
 var bullets = /^\s*[\*\-\u2022](\s+|\s+$)/;
 var numbers = /^\s*\d[\.\)](\s+|$)/;
-
 var getListType = function getListType(node, schema) {
   if (!node.text) {
     return null;
   }
-
   var _schema$nodes = schema.nodes,
-      bulletList = _schema$nodes.bulletList,
-      orderedList = _schema$nodes.orderedList;
+    bulletList = _schema$nodes.bulletList,
+    orderedList = _schema$nodes.orderedList;
   return [{
     node: bulletList,
     matcher: bullets
@@ -146,160 +115,147 @@ var getListType = function getListType(node, schema) {
     if (lastMatch) {
       return lastMatch;
     }
-
     var match = node.text.match(listType.matcher);
     return match ? [listType.node, match[0].length] : lastMatch;
   }, null);
 };
-
 var extractListFromParagraph = function extractListFromParagraph(node, parent, schema) {
   var _schema$nodes2 = schema.nodes,
-      hardBreak = _schema$nodes2.hardBreak,
-      bulletList = _schema$nodes2.bulletList,
-      orderedList = _schema$nodes2.orderedList;
+    hardBreak = _schema$nodes2.hardBreak,
+    bulletList = _schema$nodes2.bulletList,
+    orderedList = _schema$nodes2.orderedList;
   var content = (0, _slice.mapChildren)(node.content, function (node) {
     return node;
   });
-  var listTypes = [bulletList, orderedList]; // wrap each line into a listItem and a containing list
+  var listTypes = [bulletList, orderedList];
 
+  // wrap each line into a listItem and a containing list
   var listified = content.map(function (child, index) {
     var listMatch = getListType(child, schema);
-    var prevChild = index > 0 && content[index - 1]; // only extract list when preceded by a hardbreak
+    var prevChild = index > 0 && content[index - 1];
 
+    // only extract list when preceded by a hardbreak
     if (prevChild && prevChild.type !== hardBreak) {
       return child;
     }
-
     if (!listMatch || !child.text) {
       return child;
     }
-
     var _listMatch = _slicedToArray(listMatch, 2),
-        nodeType = _listMatch[0],
-        length = _listMatch[1]; // convert to list item
-
+      nodeType = _listMatch[0],
+      length = _listMatch[1];
 
+    // convert to list item
     var newText = child.text.substr(length);
     var listItemNode = schema.nodes.listItem.createAndFill(undefined, schema.nodes.paragraph.createChecked(undefined, newText.length ? schema.text(newText) : undefined));
-
     if (!listItemNode) {
       return child;
     }
-
-    var newList = nodeType.createChecked(undefined, [listItemNode]); // Check whether our new list is valid content in our current structure,
+    var newList = nodeType.createChecked(undefined, [listItemNode]);
+    // Check whether our new list is valid content in our current structure,
     // otherwise dont convert.
-
     if (parent && !parent.type.validContent(_prosemirrorModel.Fragment.from(newList))) {
       return child;
     }
-
     return newList;
   }).filter(function (child, idx, arr) {
     // remove hardBreaks that have a list node on either side
+
     // wasn't hardBreak, leave as-is
     if (child.type !== hardBreak) {
       return child;
     }
-
     if (idx > 0 && listTypes.indexOf(arr[idx - 1].type) > -1) {
       // list node on the left
       return null;
     }
-
     if (idx < arr.length - 1 && listTypes.indexOf(arr[idx + 1].type) > -1) {
       // list node on the right
       return null;
     }
-
     return child;
-  }); // try to join
+  });
 
+  // try to join
   var mockState = _prosemirrorState.EditorState.create({
     schema: schema
   });
-
   var joinedListsTr;
-
   var mockDispatch = function mockDispatch(tr) {
     joinedListsTr = tr;
   };
-
   (0, _prosemirrorCommands.autoJoin)(function (state, dispatch) {
     if (!dispatch) {
       return false;
-    } // Return false to prevent replaceWith from wrapping the text node in a paragraph
+    }
+
+    // Return false to prevent replaceWith from wrapping the text node in a paragraph
     // paragraph since that will be done later. If it's done here, it will fail
     // the paragraph.validContent check.
     // Dont return false if there are lists, as they arent validContent for paragraphs
     // and will result in hanging textNodes
-
-
     var containsList = listified.some(function (node) {
       return node.type === bulletList || node.type === orderedList;
     });
-
     if (listified.some(function (node) {
       return node.isText;
     }) && !containsList) {
       return false;
     }
-
     dispatch(state.tr.replaceWith(0, 2, listified));
     return true;
   }, function (before, after) {
     return (0, _node.isListNode)(before) && (0, _node.isListNode)(after);
   })(mockState, mockDispatch);
-  var fragment = joinedListsTr ? joinedListsTr.doc.content : _prosemirrorModel.Fragment.from(listified); // try to re-wrap fragment in paragraph (which is the original node we unwrapped)
+  var fragment = joinedListsTr ? joinedListsTr.doc.content : _prosemirrorModel.Fragment.from(listified);
 
+  // try to re-wrap fragment in paragraph (which is the original node we unwrapped)
   var paragraph = schema.nodes.paragraph;
-
   if (paragraph.validContent(fragment)) {
     return _prosemirrorModel.Fragment.from(paragraph.create(node.attrs, fragment, node.marks));
-  } // fragment now contains other nodes, get Prosemirror to wrap with ContentMatch later
-
+  }
 
+  // fragment now contains other nodes, get Prosemirror to wrap with ContentMatch later
   return fragment;
 };
+
 /**
  * Walks the slice, creating paragraphs that were previously separated by hardbreaks.
  * Returns the original paragraph node (as a fragment), or a fragment containing multiple nodes.
  */
-
-
 var splitIntoParagraphs = function splitIntoParagraphs(_ref) {
   var fragment = _ref.fragment,
-      _ref$blockMarks = _ref.blockMarks,
-      blockMarks = _ref$blockMarks === void 0 ? [] : _ref$blockMarks,
-      schema = _ref.schema;
+    _ref$blockMarks = _ref.blockMarks,
+    blockMarks = _ref$blockMarks === void 0 ? [] : _ref$blockMarks,
+    schema = _ref.schema;
   var paragraphs = [];
   var curChildren = [];
   var lastNode = null;
   var _schema$nodes3 = schema.nodes,
-      hardBreak = _schema$nodes3.hardBreak,
-      paragraph = _schema$nodes3.paragraph;
+    hardBreak = _schema$nodes3.hardBreak,
+    paragraph = _schema$nodes3.paragraph;
   fragment.forEach(function (node) {
     if (lastNode && lastNode.type === hardBreak && node.type === hardBreak) {
       // double hardbreak
+
       // backtrack a little; remove the trailing hardbreak we added last loop
-      curChildren.pop(); // create a new paragraph
+      curChildren.pop();
 
+      // create a new paragraph
       paragraphs.push(paragraph.createChecked(undefined, curChildren, _toConsumableArray(blockMarks)));
       curChildren = [];
       return;
-    } // add to this paragraph
-
+    }
 
+    // add to this paragraph
     curChildren.push(node);
     lastNode = node;
   });
-
   if (curChildren.length) {
     paragraphs.push(paragraph.createChecked(undefined, curChildren, _toConsumableArray(blockMarks)));
   }
-
   return _prosemirrorModel.Fragment.from(paragraphs.length ? paragraphs : [paragraph.createAndFill(undefined, undefined, _toConsumableArray(blockMarks))]);
 };
-
 var splitParagraphs = function splitParagraphs(slice, schema) {
   // exclude Text nodes with a code mark, since we transform those later
   // into a codeblock
@@ -308,8 +264,9 @@ var splitParagraphs = function splitParagraphs(slice, schema) {
     hasCodeMark = hasCodeMark || child.marks.some(function (mark) {
       return mark.type === schema.marks.code;
     });
-  }); // slice might just be a raw text string
+  });
 
+  // slice might just be a raw text string
   if (schema.nodes.paragraph.validContent(slice.content) && !hasCodeMark) {
     var replSlice = splitIntoParagraphs({
       fragment: slice.content,
@@ -317,7 +274,6 @@ var splitParagraphs = function splitParagraphs(slice, schema) {
     });
     return new _prosemirrorModel.Slice(replSlice, slice.openStart + 1, slice.openEnd + 1);
   }
-
   return (0, _slice.mapSlice)(slice, function (node) {
     if (node.type === schema.nodes.paragraph) {
       return splitIntoParagraphs({
@@ -326,22 +282,18 @@ var splitParagraphs = function splitParagraphs(slice, schema) {
         schema: schema
       });
     }
-
     return node;
   });
-}; // above will wrap everything in paragraphs for us
-
+};
 
+// above will wrap everything in paragraphs for us
 exports.splitParagraphs = splitParagraphs;
-
 var upgradeTextToLists = function upgradeTextToLists(slice, schema) {
   return (0, _slice.mapSlice)(slice, function (node, parent) {
     if (node.type === schema.nodes.paragraph) {
       return extractListFromParagraph(node, parent, schema);
     }
-
     return node;
   });
 };
-
 exports.upgradeTextToLists = upgradeTextToLists;

package/lib/components/rich-editor/plugins/block/lists/utils/analytics.js

@@ -4,15 +4,12 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.getCommonListAnalyticsAttributes = exports.countListItemsInSelection = void 0;
-
 var _node = require("./node");
-
 var _selection = require("./selection");
-
 var getCommonListAnalyticsAttributes = function getCommonListAnalyticsAttributes(state) {
   var _state$selection = state.selection,
-      $from = _state$selection.$from,
-      $to = _state$selection.$to;
+    $from = _state$selection.$from,
+    $to = _state$selection.$to;
   var fromAttrs = (0, _selection.getListItemAttributes)($from);
   var toAttrs = (0, _selection.getListItemAttributes)($to);
   return {
@@ -23,18 +20,14 @@ var getCommonListAnalyticsAttributes = function getCommonListAnalyticsAttributes
     itemsInSelection: countListItemsInSelection(state)
   };
 };
-
 exports.getCommonListAnalyticsAttributes = getCommonListAnalyticsAttributes;
-
 var countListItemsInSelection = function countListItemsInSelection(state) {
   var _state$selection2 = state.selection,
-      from = _state$selection2.from,
-      to = _state$selection2.to;
-
+    from = _state$selection2.from,
+    to = _state$selection2.to;
   if (from === to) {
     return 1;
   }
-
   var count = 0;
   var listSlice = state.doc.cut(from, to);
   listSlice.content.nodesBetween(0, listSlice.content.size, function (node, pos, parent, index) {
@@ -44,5 +37,4 @@ var countListItemsInSelection = function countListItemsInSelection(state) {
   });
   return count;
 };
-
 exports.countListItemsInSelection = countListItemsInSelection;

package/lib/components/rich-editor/plugins/block/lists/utils/find.js

@@ -7,120 +7,89 @@ exports.findFirstNestedList = findFirstNestedList;
 exports.findFirstParentListItemNode = findFirstParentListItemNode;
 exports.findFirstParentListNode = findFirstParentListNode;
 exports.findRootParentListNode = findRootParentListNode;
-
 var _prosemirrorUtils = require("prosemirror-utils");
-
 var _node = require("./node");
-
 function findFirstNestedList($pos) {
   var currentNode = $pos.doc.nodeAt($pos.pos);
   var currentListItemPos = null;
-
   if ((0, _node.isListItemNode)(currentNode)) {
     currentListItemPos = $pos.pos;
   } else {
     var result = (0, _prosemirrorUtils.findParentNodeClosestToPos)($pos, _node.isListItemNode);
     currentListItemPos = (result === null || result === void 0 ? void 0 : result.pos) || null;
   }
-
   if (!currentListItemPos) {
     return null;
   }
-
   var currentListItemNode = $pos.doc.nodeAt(currentListItemPos);
-
   if (!currentListItemNode) {
     return null;
   }
-
   var lastListItemChild = currentListItemNode.child(currentListItemNode.childCount - 1);
-
   if (!(0, _node.isListNode)(lastListItemChild)) {
     return null;
   }
-
   var firstNestedListPosition = currentListItemNode.nodeSize - lastListItemChild.nodeSize;
   var firstNestedListNode = $pos.doc.nodeAt(firstNestedListPosition);
-
   if (!(0, _node.isListNode)(firstNestedListNode)) {
     return null;
   }
-
   return $pos.doc.resolve(firstNestedListPosition);
 }
-
 function findFirstParentListNode($pos) {
   var currentNode = $pos.doc.nodeAt($pos.pos);
   var listNodePosition = null;
-
   if ((0, _node.isListNode)(currentNode)) {
     listNodePosition = $pos.pos;
   } else {
     var result = (0, _prosemirrorUtils.findParentNodeClosestToPos)($pos, _node.isListNode);
     listNodePosition = result && result.pos;
   }
-
   if (listNodePosition == null) {
     return null;
   }
-
   var node = $pos.doc.nodeAt(listNodePosition);
-
   if (!node) {
     return null;
   }
-
   return {
     node: node,
     pos: listNodePosition
   };
 }
-
 function findFirstParentListItemNode($pos) {
   var currentNode = $pos.doc.nodeAt($pos.pos);
   var listItemNodePosition = (0, _node.isListItemNode)(currentNode) ? $pos : (0, _prosemirrorUtils.findParentNodeClosestToPos)($pos, _node.isListItemNode);
-
   if (!listItemNodePosition || listItemNodePosition.pos === null) {
     return null;
   }
-
   var node = $pos.doc.nodeAt(listItemNodePosition.pos);
-
   if (!node) {
     return null;
   }
-
   return {
     node: node,
     pos: listItemNodePosition.pos
   };
 }
-
 function findRootParentListNode($pos) {
   var doc = $pos.doc;
-
   if ($pos.pos + 1 > doc.content.size) {
     return null;
   }
-
   if ($pos.depth === 0) {
     return doc.resolve($pos.pos + 1);
   }
-
   var currentNode = doc.nodeAt($pos.pos);
   var beforePosition = $pos.before();
   var nodeBefore = doc.nodeAt(beforePosition);
-
   if ((0, _node.isListNode)(currentNode) && !(0, _node.isListItemNode)(nodeBefore)) {
     return doc.resolve($pos.pos + 1);
   }
-
   var parentList = (0, _prosemirrorUtils.findParentNodeClosestToPos)($pos, _node.isListNode);
-
   if (!parentList) {
     return null;
   }
-
   var listNodePosition = doc.resolve(parentList.pos);
   return findRootParentListNode(listNodePosition);
 }

package/lib/components/rich-editor/plugins/block/lists/utils/indentation.js

@@ -4,84 +4,61 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.hasValidListIndentationLevel = exports.getNextSiblingListItemPosition = exports.getListLiftTarget = void 0;
-
 var _selection = require("./selection");
-
 var _node = require("./node");
-
 // This will return (depth - 1) for root list parent of a list.
 var getListLiftTarget = function getListLiftTarget(resPos) {
   var target = resPos.depth;
-
   for (var i = resPos.depth; i > 0; i--) {
     var node = resPos.node(i);
-
     if ((0, _node.isListNode)(node)) {
       target = i;
     }
-
     if (!(0, _node.isListItemNode)(node) && !(0, _node.isListNode)(node)) {
       break;
     }
   }
-
   return target - 1;
 };
-
 exports.getListLiftTarget = getListLiftTarget;
-
 var getNextSiblingListItemPosition = function getNextSiblingListItemPosition($pos) {
   var _$pos$doc$nodeAt;
-
   var target = $pos.depth;
   var found = false;
-
   for (var i = $pos.depth; i > 0; i--) {
     var node = $pos.node(i);
-
     if ((0, _node.isListItemNode)(node)) {
       target = i;
       found = true;
     }
-
     if (found) {
       break;
     }
   }
-
   var listItemPosition = target - 1;
   var listItemNodePosition = ((_$pos$doc$nodeAt = $pos.doc.nodeAt(listItemPosition)) === null || _$pos$doc$nodeAt === void 0 ? void 0 : _$pos$doc$nodeAt.nodeSize) || 0;
   var nextListItemPosition = listItemPosition + listItemNodePosition;
   var nextListItemNode = $pos.doc.nodeAt(nextListItemPosition);
-
   if (nextListItemNode) {
     return $pos.doc.resolve(nextListItemPosition);
   }
-
   return null;
 };
-
 exports.getNextSiblingListItemPosition = getNextSiblingListItemPosition;
-
 var hasValidListIndentationLevel = function hasValidListIndentationLevel(_ref) {
   var tr = _ref.tr,
-      maxIndentation = _ref.maxIndentation;
+    maxIndentation = _ref.maxIndentation;
   var initialIndentationLevel = (0, _selection.numberNestedLists)(tr.selection.$from);
   var currentIndentationLevel;
   var currentPos = tr.selection.$to.pos;
-
   do {
     var resolvedPos = tr.doc.resolve(currentPos);
     currentIndentationLevel = (0, _selection.numberNestedLists)(resolvedPos);
-
     if (currentIndentationLevel > maxIndentation) {
       return false;
     }
-
     currentPos++;
   } while (currentIndentationLevel >= initialIndentationLevel);
-
   return true;
 };
-
 exports.hasValidListIndentationLevel = hasValidListIndentationLevel;