@titaui/pc 1.10.35 → 1.10.39

package/lib/components/rich-editor/plugins/block/lists/actions/indent-list-items-selected.js

@@ -0,0 +1,163 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indentListItemsSelected = void 0;
+
+var _prosemirrorState = require("prosemirror-state");
+
+var _prosemirrorModel = require("prosemirror-model");
+
+var _node = require("../utils/node");
+
+var _find = require("../utils/find");
+
+var _selection = require("../utils/selection");
+
+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; }
+
+// import { GapCursorSelection } from '../../selection/gap-cursor-selection';
+var indentListItemsSelected = function indentListItemsSelected(tr) {
+  var originalSelection = tr.selection;
+  var normalizedSelection = (0, _selection.normalizeListItemsSelection)({
+    selection: originalSelection,
+    doc: tr.doc
+  });
+  var $from = normalizedSelection.$from,
+      $to = normalizedSelection.$to;
+  var range = calculateRange({
+    selection: normalizedSelection
+  });
+
+  if (!range) {
+    return false;
+  }
+
+  var listItemsSelected = {
+    from: (0, _find.findFirstParentListItemNode)($from),
+    to: (0, _find.findFirstParentListItemNode)($to)
+  };
+
+  if (listItemsSelected.from === null || listItemsSelected.to === null) {
+    return null;
+  }
+
+  var resolvedPos = tr.doc.resolve(listItemsSelected.from.pos);
+  var listItemIndex = resolvedPos.index(); // @ts-ignore
+
+  var positionListItemPosition = resolvedPos.posAtIndex(listItemIndex - 1);
+  var previousListItem = tr.doc.nodeAt(positionListItemPosition);
+
+  if (!previousListItem || !(0, _node.isListItemNode)(previousListItem)) {
+    return null;
+  }
+
+  if ((0, _node.isListItemNode)(previousListItem) && listItemIndex === 0) {
+    return null;
+  }
+
+  var listItemSelectedCommonParent = range.parent;
+  var previousNestedList = (0, _node.isListNode)(previousListItem.lastChild) ? previousListItem.lastChild : null;
+  var listNodeType = previousNestedList ? previousNestedList.type : listItemSelectedCommonParent.type;
+  var nestedList = listItemsSelected.to.node.lastChild;
+  var nestedItemsOffset = nestedList && (0, _node.isListNode)(nestedList) ? nestedList.nodeSize : 0;
+  var from = listItemsSelected.from.pos;
+  var to = listItemsSelected.to.pos + listItemsSelected.to.node.nodeSize - nestedItemsOffset;
+
+  var _createIndentedListIt = createIndentedListItemsSlice({
+    tr: tr,
+    listNodeType: listNodeType,
+    range: range,
+    from: from,
+    to: to
+  }),
+      _createIndentedListIt2 = _slicedToArray(_createIndentedListIt, 2),
+      sliceSelected = _createIndentedListIt2[0],
+      nestedListItemsLeftover = _createIndentedListIt2[1];
+
+  var hasPreviousNestedList = Boolean(previousNestedList);
+  var start = from - 1;
+  tr.replaceRange(hasPreviousNestedList ? start - 1 : start, range.end, sliceSelected);
+  var leftoverContentPosition = tr.mapping.map(to) - 2;
+
+  if (nestedListItemsLeftover.openStart === 0) {
+    tr.insert(leftoverContentPosition, nestedListItemsLeftover.content);
+  } else {
+    tr.replace(leftoverContentPosition - nestedListItemsLeftover.openStart, leftoverContentPosition - nestedListItemsLeftover.openStart, nestedListItemsLeftover);
+  }
+
+  var nextSelection = calculateNewSelection({
+    originalSelection: originalSelection,
+    normalizedSelection: normalizedSelection,
+    tr: tr,
+    hasPreviousNestedList: hasPreviousNestedList
+  });
+  tr.setSelection(nextSelection);
+};
+
+exports.indentListItemsSelected = indentListItemsSelected;
+
+var calculateRange = function calculateRange(_ref) {
+  var selection = _ref.selection;
+  var $from = selection.$from,
+      $to = selection.$to;
+  var range = $from.blockRange($to, _node.isListNode);
+
+  if (!range) {
+    return null;
+  }
+
+  return range;
+};
+
+var calculateNewSelection = function calculateNewSelection(_ref2) {
+  var tr = _ref2.tr,
+      normalizedSelection = _ref2.normalizedSelection,
+      originalSelection = _ref2.originalSelection,
+      hasPreviousNestedList = _ref2.hasPreviousNestedList;
+  var offset = hasPreviousNestedList ? 2 : 0;
+  var $from = normalizedSelection.$from,
+      $to = normalizedSelection.$to; // if (normalizedSelection instanceof GapCursorSelection) {
+  //   const nextSelectionFrom = tr.doc.resolve($from.pos - offset);
+  //   return new GapCursorSelection(nextSelectionFrom, normalizedSelection.side);
+  // }
+
+  if (originalSelection instanceof _prosemirrorState.NodeSelection) {
+    return _prosemirrorState.NodeSelection.create(tr.doc, $from.pos - offset);
+  }
+
+  var _Selection$near = _prosemirrorState.Selection.near(tr.doc.resolve($from.pos - offset)),
+      nextSelectionFrom = _Selection$near.$from;
+
+  var _Selection$near2 = _prosemirrorState.Selection.near(tr.doc.resolve($to.pos - offset), -1),
+      nextSelectionTo = _Selection$near2.$to;
+
+  return new _prosemirrorState.TextSelection(nextSelectionFrom, nextSelectionTo);
+};
+
+var createIndentedListItemsSlice = function createIndentedListItemsSlice(_ref3) {
+  var tr = _ref3.tr,
+      from = _ref3.from,
+      to = _ref3.to,
+      listNodeType = _ref3.listNodeType,
+      range = _ref3.range;
+  var listItemsSlice = tr.doc.slice(from, to - 2);
+
+  var listFragment = _prosemirrorModel.Fragment.from(listNodeType.create(null, listItemsSlice.content));
+
+  var nonSelectedListItemsSlice = tr.doc.slice(to, range.end - 2);
+  var openStart = tr.doc.slice(from - 1, range.end).openStart;
+  var slice = new _prosemirrorModel.Slice(listFragment, openStart, 0);
+  return [slice, nonSelectedListItemsSlice];
+};

package/lib/components/rich-editor/plugins/block/lists/actions/indent-list.js

@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indentList = void 0;
+
+var _prosemirrorTransform = require("prosemirror-transform");
+
+var _prosemirrorModel = require("prosemirror-model");
+
+// adapted from https://github.com/ProseMirror/prosemirror-schema-list/blob/master/src/schema-list.js#L206:L231
+var indentList = function indentList(tr) {
+  var _tr$selection = tr.selection,
+      $from = _tr$selection.$from,
+      $to = _tr$selection.$to;
+  var listItem = tr.doc.type.schema.nodes.listItem;
+  var range = $from.blockRange($to, function (node) {
+    return !!node.childCount && !!node.firstChild && node.firstChild.type === listItem;
+  });
+
+  if (!range) {
+    return false;
+  } // get the index of the selected list item in the list it is part of
+
+
+  var startIndex = range.startIndex;
+
+  if (startIndex === 0) {
+    return false;
+  } // get the parent list of the list item(s) in the selected range
+
+
+  var parent = range.parent; // get the list immediately before the selection start
+
+  var previousListItem = parent.child(startIndex - 1);
+
+  if (previousListItem.type !== listItem) {
+    return false;
+  } // if that list was nested, join the selected list items into the same
+  // nested list; if not, create a new child list of the same type and
+  // nest it under the current level
+
+
+  var isPreviousListNested = previousListItem.lastChild && ['bulletList', 'orderedList'].includes(previousListItem.lastChild.type.name);
+
+  var inner = _prosemirrorModel.Fragment.from(isPreviousListNested ? listItem.create() : undefined);
+
+  var nextListNodeType = isPreviousListNested ? previousListItem.lastChild.type : parent.type;
+
+  var nextListNodeContent = _prosemirrorModel.Fragment.from(nextListNodeType.create(null, inner));
+
+  var slice = new _prosemirrorModel.Slice(_prosemirrorModel.Fragment.from(listItem.create(null, nextListNodeContent)), isPreviousListNested ? 3 : 1, 0);
+  var before = range.start;
+  var after = range.end;
+  tr.step(new _prosemirrorTransform.ReplaceAroundStep(before - (isPreviousListNested ? 3 : 1), after, before, after, slice, 1, true));
+};
+
+exports.indentList = indentList;

package/lib/components/rich-editor/plugins/block/lists/actions/join-list-items-forward.js

@@ -0,0 +1,74 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.calcJoinListScenario = void 0;
+
+var _node = require("../utils/node");
+
+var _selection = require("../utils/selection");
+
+var _joinListItemsScenarios = require("./join-list-items-scenarios");
+
+// import { WalkNode } from '../../../utils/commands';
+// import { LIST_TEXT_SCENARIOS } from '../../analytics';
+var calcJoinListScenario = function calcJoinListScenario(walkNode, $head) {
+  var $next = walkNode.$pos,
+      nextFoundNode = walkNode.foundNode;
+  var headParent = $head.parent;
+  var headGrandParent = $head.node(-1);
+  var headInList = (0, _selection.isPosInsideList)($head);
+  var headInParagraph = (0, _selection.isPosInsideParagraph)($head);
+  var headInLastNonListChild = headGrandParent && headGrandParent.lastChild && (headGrandParent.lastChild === headParent || headGrandParent.childCount > 1 && headGrandParent.child(headGrandParent.childCount - 2) === headParent && //find the second last child if a list item may be the last child
+  (0, _node.isListNode)(headGrandParent.lastChild));
+  var nextInList = (0, _selection.isPosInsideList)($next);
+  var nextInParagraph = (0, _selection.isPosInsideParagraph)($next);
+
+  if (!headInList && headInParagraph && nextInList) {
+    return _joinListItemsScenarios.joinListItemWithParagraph;
+  }
+
+  if (!nextFoundNode || !headInList || !headInParagraph || !headInLastNonListChild) {
+    return false;
+  }
+
+  if (!nextInList && nextInParagraph) {
+    return _joinListItemsScenarios.joinParagrapWithList;
+  }
+
+  if (!nextInList) {
+    return false;
+  }
+
+  var nextNodeAfter = $next.nodeAfter;
+  var nextGrandParent = $next.node(-1);
+  var headGreatGrandParent = $head.node(-2);
+  var nextInListItem = (0, _node.isListItemNode)($next.parent);
+  var nextNodeAfterListItem = (0, _node.isListItemNode)(nextNodeAfter);
+  var nextListItemHasFirstChildParagraph = nextNodeAfter && //Redundant check but the linter complains otherwise
+  nextNodeAfterListItem && (0, _node.isParagraphNode)(nextNodeAfter.firstChild);
+
+  if (!nextInListItem && nextListItemHasFirstChildParagraph) {
+    return _joinListItemsScenarios.joinNestedListWithParentListItem;
+  }
+
+  if (!nextInListItem) {
+    return false;
+  }
+
+  var nextParentSiblingOfHeadParent = nextGrandParent && nextGrandParent === headGreatGrandParent;
+  var nextNodeAfterIsParagraph = (0, _node.isParagraphNode)(nextNodeAfter);
+
+  if (!nextNodeAfterIsParagraph) {
+    return false;
+  }
+
+  if (nextParentSiblingOfHeadParent) {
+    return _joinListItemsScenarios.joinSiblingListItems;
+  }
+
+  return _joinListItemsScenarios.joinListItemWithParentNestedList;
+};
+
+exports.calcJoinListScenario = calcJoinListScenario;

package/lib/components/rich-editor/plugins/block/lists/actions/join-list-items-scenarios/index.js

@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "joinListItemWithParagraph", {
+  enumerable: true,
+  get: function get() {
+    return _joinListItemWithParagraph.joinListItemWithParagraph;
+  }
+});
+Object.defineProperty(exports, "joinListItemWithParentNestedList", {
+  enumerable: true,
+  get: function get() {
+    return _joinListItemWithParentNestedList.joinListItemWithParentNestedList;
+  }
+});
+Object.defineProperty(exports, "joinNestedListWithParentListItem", {
+  enumerable: true,
+  get: function get() {
+    return _joinNestedListWithParentListItem.joinNestedListWithParentListItem;
+  }
+});
+Object.defineProperty(exports, "joinParagrapWithList", {
+  enumerable: true,
+  get: function get() {
+    return _joinParagraphWithList.joinParagrapWithList;
+  }
+});
+Object.defineProperty(exports, "joinSiblingListItems", {
+  enumerable: true,
+  get: function get() {
+    return _joinSiblingListItems.joinSiblingListItems;
+  }
+});
+
+var _joinParagraphWithList = require("./join-paragraph-with-list");
+
+var _joinSiblingListItems = require("./join-sibling-list-items");
+
+var _joinNestedListWithParentListItem = require("./join-nested-list-with-parent-list-item");
+
+var _joinListItemWithParentNestedList = require("./join-list-item-with-parent-nested-list");
+
+var _joinListItemWithParagraph = require("./join-list-item-with-paragraph");

package/lib/components/rich-editor/plugins/block/lists/actions/join-list-items-scenarios/join-list-item-with-paragraph.js

@@ -0,0 +1,104 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.joinListItemWithParagraph = void 0;
+
+var _prosemirrorModel = require("prosemirror-model");
+
+var _commond = require("../../commond");
+
+var _node = require("../../utils/node");
+
+// Case for when a users selection is at the end of a paragraph, the paragraph
+// is followed by a list, and they delete forward
+var joinListItemWithParagraph = function joinListItemWithParagraph(_ref) {
+  var tr = _ref.tr,
+      $next = _ref.$next,
+      $head = _ref.$head;
+
+  // For empty paragraphs before a list
+  if ($head.parent.content.size < 1) {
+    (0, _commond.insertContentDeleteRange)(tr, function (tr) {
+      return tr.doc.resolve($head.pos);
+    }, [], [[$head.pos - 1, $head.pos]]);
+    return true;
+  }
+
+  var paragraphPosition = $head.pos;
+  var list = tr.doc.nodeAt($next.pos - 1);
+  var firstListItem = tr.doc.nodeAt($next.pos);
+
+  if (!list || !firstListItem) {
+    return false;
+  }
+
+  var firstChildNodeOfFirstListItem = firstListItem.firstChild;
+
+  if (!firstChildNodeOfFirstListItem) {
+    return false;
+  }
+
+  var lastChildOfFirstListItem = firstListItem.lastChild;
+  var firstGrandchildOfFirstListItem = firstChildNodeOfFirstListItem.firstChild;
+  var firstListItemHasOneChildWithNoNestedLists = hasSingleChild(firstListItem) && firstChildNodeOfFirstListItem.childCount < 2 && $next.nodeAfter;
+  var firstListItemContainsParagraphAndNestedList = !hasSingleChild(firstListItem) && lastChildOfFirstListItem && (0, _node.isListNode)(lastChildOfFirstListItem);
+  var insertions = [];
+  var deletions = []; // For lists that only have one list item with no children - need to remove remaining list
+
+  if (hasSingleChild(list) && hasSingleChild(firstListItem) && $next.nodeAfter) {
+    deletions.push([tr.mapping.map($next.pos - 1), tr.mapping.map($next.pos + $next.nodeAfter.nodeSize + 1)]);
+  } // For first list items that have a paragraph and a list
+
+
+  if (firstListItemContainsParagraphAndNestedList) {
+    var firstListItemNestedList = _prosemirrorModel.Fragment.from(lastChildOfFirstListItem.content);
+
+    insertions.push([firstListItemNestedList, tr.mapping.map($next.pos)]);
+  } // For first list item has one child & no nested lists OR first list items that have a paragraph and a list
+
+
+  if (firstListItemHasOneChildWithNoNestedLists || firstListItemContainsParagraphAndNestedList) {
+    deletions.push([tr.mapping.map($next.pos), tr.mapping.map($next.pos + firstListItem.nodeSize - 1)]);
+
+    var firstListItemText = _prosemirrorModel.Fragment.from(firstChildNodeOfFirstListItem.content);
+
+    insertions.push([firstListItemText, paragraphPosition]);
+    (0, _commond.insertContentDeleteRange)(tr, function (tr) {
+      return tr.doc.resolve($head.pos);
+    }, insertions, deletions);
+    return true;
+  } // For any first list items that have multiple children (eg. multiple paragraphs)
+
+
+  if (firstListItem.childCount > 1) {
+    insertions.push([_prosemirrorModel.Fragment.from(firstChildNodeOfFirstListItem.content), paragraphPosition]);
+    deletions.push([tr.mapping.map($next.pos + 1), tr.mapping.map($next.pos + firstChildNodeOfFirstListItem.nodeSize + 1)]);
+    (0, _commond.insertContentDeleteRange)(tr, function (tr) {
+      return tr.doc.resolve($head.pos);
+    }, insertions, deletions);
+    return true;
+  } // For any remaining first list items that have a single child (eg. single paragraph, multiple lines of text)
+
+
+  if (firstGrandchildOfFirstListItem && firstGrandchildOfFirstListItem.type.name === 'hardBreak') {
+    var nodeSizeOfGrandchild = firstGrandchildOfFirstListItem ? firstGrandchildOfFirstListItem.nodeSize : 0;
+    deletions.push([tr.mapping.map($next.pos + 2), tr.mapping.map($next.pos + 2 + nodeSizeOfGrandchild)]);
+  } else {
+    insertions.push([_prosemirrorModel.Fragment.from(firstChildNodeOfFirstListItem.content), paragraphPosition]);
+    var nodeSizeOfFirstChild = firstChildNodeOfFirstListItem.nodeSize;
+    deletions.push([tr.mapping.map($next.pos), tr.mapping.map($next.pos + 2 + nodeSizeOfFirstChild)]);
+  }
+
+  (0, _commond.insertContentDeleteRange)(tr, function (tr) {
+    return tr.doc.resolve($head.pos);
+  }, insertions, deletions);
+  return true;
+};
+
+exports.joinListItemWithParagraph = joinListItemWithParagraph;
+
+var hasSingleChild = function hasSingleChild(node) {
+  return node.childCount === 1;
+};

package/lib/components/rich-editor/plugins/block/lists/actions/join-list-items-scenarios/join-list-item-with-parent-nested-list.js

@@ -0,0 +1,92 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.joinListItemWithParentNestedList = void 0;
+
+var _commond = require("../../commond");
+
+var _node = require("../../utils/node");
+
+//Case for two adjacent list items with the first being of greater indentation
+var joinListItemWithParentNestedList = function joinListItemWithParentNestedList(_ref) {
+  var tr = _ref.tr,
+      $next = _ref.$next,
+      $head = _ref.$head;
+
+  /* CASE 4
+   * Initial Structure:
+   *
+   * List A {
+   *   ListItem B {
+   *     Paragraph C { text1 }
+   *     ...Children D
+   *     List E {
+   *       ...
+   *         List F {       //May be multiple levels of lists
+   *           ...Children G
+   *           ListItem H {        //Last node of the block
+   *             ...Children I
+   *             Paragraph J { text2 |$head||textInsertPos| } |childrenMInsertPos|        //Cant have children since this ListItem is the last of the block
+   *           }
+   *         }
+   *       ...
+   *     |childrenOInsertPos| }
+   *   }
+   *   ListItem K { |$next|
+   *      Paragraph L { text3 }
+   *      ...Children M
+   *      List? N {
+   *       ...Children O
+   *      }
+   *   }
+   * }
+   *
+   * Converts to:
+   *
+   * List A {
+   *   ListItem B {
+   *     Paragraph C { text1 }
+   *     ...Children D
+   *     List E {
+   *       ...
+   *         List F {
+   *           ...Children G
+   *           ListItem H {
+   *             ...Children I
+   *             Paragraph J { text2text3 }
+   *             ...Children M
+   *           }
+   *         }
+   *       ...
+   *       ...Children O
+   *     }
+   *   }
+   * }
+   *
+   */
+  var listItemK = $next.parent; //List must have at least one child
+
+  if (!listItemK.firstChild || !listItemK.lastChild) {
+    return false;
+  }
+
+  var beforeListItemK = $next.before();
+  var afterListItemB = $next.before();
+  var afterListItemK = $next.after();
+  var containsChildrenO = (0, _node.isListNode)(listItemK.lastChild);
+  var textInsertPos = $head.pos;
+  var childrenMInsertPos = $head.pos + 1;
+  var childrenOInsertPos = afterListItemB - 2;
+  var textContent = listItemK.firstChild.content;
+  var childrenMContent = containsChildrenO ? listItemK.content.cut(listItemK.firstChild.nodeSize, listItemK.nodeSize - listItemK.lastChild.nodeSize - 2 //Get the position before
+  ) : listItemK.content.cut(listItemK.firstChild.nodeSize);
+  var childrenOContent = listItemK.lastChild.content;
+  (0, _commond.insertContentDeleteRange)(tr, function (tr) {
+    return tr.doc.resolve(textInsertPos);
+  }, containsChildrenO ? [[textContent, textInsertPos], [childrenMContent, childrenMInsertPos], [childrenOContent, childrenOInsertPos]] : [[textContent, textInsertPos], [childrenMContent, childrenMInsertPos]], [[beforeListItemK, afterListItemK]]);
+  return true;
+};
+
+exports.joinListItemWithParentNestedList = joinListItemWithParentNestedList;

package/lib/components/rich-editor/plugins/block/lists/actions/join-list-items-scenarios/join-nested-list-with-parent-list-item.js

@@ -0,0 +1,89 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.joinNestedListWithParentListItem = void 0;
+
+var _commond = require("../../commond");
+
+var _node = require("../../utils/node");
+
+//Case for two adjacent list items with the first being of lower indentation
+var joinNestedListWithParentListItem = function joinNestedListWithParentListItem(_ref) {
+  var tr = _ref.tr,
+      $next = _ref.$next,
+      $head = _ref.$head;
+
+  /* CASE 3
+   * Initial Structure:
+   *
+   * List A {
+   *   ListItem B {
+   *     ...Children C
+   *     Paragraph D { text1 |$head||textInsertPos| } |childrenHInsertPos|
+   *     List E { |$next||childrenJInsertPos|
+   *       ListItem F {
+   *         Paragraph G { text2 }
+   *         ...Children H
+   *         List? I {
+   *           ...Children J
+   *         }
+   *       }
+   *       ...Children K
+   *     }
+   *   }
+   * }
+   *
+   * Converts to:
+   *
+   * List A {
+   *   ListItem B {
+   *     ...Children C
+   *     Paragraph D { text1text2 }
+   *     ...Children H
+   *     List E {
+   *       ...Children J
+   *       ...Children K
+   *     }
+   *   }
+   * }
+   *
+   */
+  var listE = $next.parent;
+  var listItemF = $next.nodeAfter; //We know next is before a ListItem. ListItem must have at least one child
+
+  if (!listItemF || !listItemF.lastChild) {
+    return false;
+  }
+
+  var paragraphG = listItemF.firstChild; //ListItem must have at least one child
+
+  if (!paragraphG) {
+    return false;
+  }
+
+  var beforeListE = $next.before();
+  var beforeListItemF = $next.pos;
+  var afterParagraphD = $head.after();
+  var afterListE = $next.after();
+  var afterListItemF = tr.doc.resolve($next.pos + 1).after(); //List must always have at least one listItem
+
+  var containsChildrenJ = (0, _node.isListNode)(listItemF.lastChild);
+  var shouldRemoveListE = listE.childCount === 1 && !containsChildrenJ; //Assures no Children J and K
+
+  var textInsertPos = $head.pos;
+  var childrenHInsertPos = afterParagraphD;
+  var childrenJInsertPos = $next.pos;
+  var textContent = paragraphG.content;
+  var childrenHContent = containsChildrenJ ? listItemF.content.cut(paragraphG.nodeSize, listItemF.nodeSize - listItemF.lastChild.nodeSize - 2) : listItemF.content.cut(paragraphG.nodeSize); //If Children J doesn't exist then Children H will include the last node
+
+  var childrenJContent = listItemF.lastChild.content; //Will be invalid if there are no Children J but it will be unused
+
+  (0, _commond.insertContentDeleteRange)(tr, function (tr) {
+    return tr.doc.resolve(textInsertPos);
+  }, containsChildrenJ ? [[textContent, textInsertPos], [childrenHContent, childrenHInsertPos], [childrenJContent, childrenJInsertPos]] : [[textContent, textInsertPos], [childrenHContent, childrenHInsertPos]], [shouldRemoveListE ? [beforeListE, afterListE] : [beforeListItemF, afterListItemF]]);
+  return true;
+};
+
+exports.joinNestedListWithParentListItem = joinNestedListWithParentListItem;

package/lib/components/rich-editor/plugins/block/lists/actions/join-list-items-scenarios/join-paragraph-with-list.js

@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.joinParagrapWithList = void 0;
+
+var _commond = require("../../commond");
+
+//Case for two adjacent nodes with the first being a list item and the last being a paragraph
+var joinParagrapWithList = function joinParagrapWithList(_ref) {
+  var tr = _ref.tr,
+      $next = _ref.$next,
+      $head = _ref.$head;
+
+  /* CASE 1
+   * Initial Structure:
+   *
+   * List A {
+   *   ListItem B {
+   *     ...Children C
+   *     Paragraph D { text1 |$head||textInsertPos| }
+   *   }
+   * }
+   * Paragraph E { |$next| text 2 }
+   *
+   * Converts to:
+   *
+   * List A {
+   *   ListItem B {
+   *     ...Children C
+   *     Paragraph D { text1text2 }
+   *   }
+   * }
+   *
+   */
+  var paragraphE = $next.parent;
+  var beforeParagraphE = $next.before();
+  var afterParagraphE = $next.after();
+  var textInsertPos = $head.pos;
+  var textContent = paragraphE.content;
+  (0, _commond.insertContentDeleteRange)(tr, function (tr) {
+    return tr.doc.resolve(textInsertPos);
+  }, [[textContent, textInsertPos]], [[beforeParagraphE, afterParagraphE]]);
+  return true;
+};
+
+exports.joinParagrapWithList = joinParagrapWithList;