npm - @titaui/pc - Versions diffs - 1.16.20-beta.2 → 1.16.22 - Mend

@titaui/pc 1.16.20-beta.2 → 1.16.22

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1138) hide show

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

@@ -1,61 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.joinSiblingListItems = void 0;
-var _commond = require("../../commond");
-//Case for two adjacent list items of the same indentation
-var joinSiblingListItems = function joinSiblingListItems(_ref) {
-  var tr = _ref.tr,
-      $next = _ref.$next,
-      $head = _ref.$head;
-  /* CASE 2
-   * Initial Structure:
-   *
-   * List A {
-   *   ListItem B {
-   *     ...Children C
-   *     Paragraph D { text1 |$head||textInsertPos| }       //Cant have children since that would be Case 4
-   *   |childrenGInsertPos| }
-   *   ListItem E { |$next|
-   *     Paragraph F { text2 }
-   *     ...Children G
-   *   }
-   * }
-   *
-   * Converts to:
-   *
-   * List A {
-   *   ListItem B {
-   *     ...Children C
-   *     Paragraph C { text1text2 }
-   *     ...Children G
-   *   }
-   * }
-   *
-   */
-  var listItemE = $next.parent;
-  var paragraphF = $next.nodeAfter; //ListItem must have at least one child
-  if (!paragraphF) {
-    return false;
-  }
-  var beforeListItemE = $next.before();
-  var afterListItemE = $next.after();
-  var endListItemB = $head.end(-1);
-  var textInsertPos = $head.pos;
-  var childrenGInsertPos = endListItemB;
-  var textContent = paragraphF.content;
-  var childrenGContent = listItemE.content.cut(paragraphF.nodeSize);
-  (0, _commond.insertContentDeleteRange)(tr, function (tr) {
-    return tr.doc.resolve(textInsertPos);
-  }, [[textContent, textInsertPos], [childrenGContent, childrenGInsertPos]], [[beforeListItemE, afterListItemE]]);
-  return true;
-};
-exports.joinSiblingListItems = joinSiblingListItems;

package/lib/components/rich-editor/plugins/block/lists/actions/merge-lists.js DELETED Viewed

@@ -1,34 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.mergeNextListAtPosition = mergeNextListAtPosition;
-var _node = require("../utils/node");
-function mergeNextListAtPosition(_ref) {
-  var tr = _ref.tr,
-      listPosition = _ref.listPosition;
-  var listNodeAtPosition = tr.doc.nodeAt(listPosition);
-  if (!(0, _node.isListNode)(listNodeAtPosition)) {
-    return;
-  }
-  var listPositionResolved = tr.doc.resolve(listPosition + listNodeAtPosition.nodeSize);
-  var pos = listPositionResolved.pos,
-      nodeAfter = listPositionResolved.nodeAfter,
-      nodeBefore = listPositionResolved.nodeBefore;
-  if (!(0, _node.isListNode)(nodeBefore) || !(0, _node.isListNode)(nodeAfter)) {
-    return;
-  }
-  if ((nodeAfter === null || nodeAfter === void 0 ? void 0 : nodeAfter.type.name) !== (nodeBefore === null || nodeBefore === void 0 ? void 0 : nodeBefore.type.name)) {
-    var previousListPosition = pos - nodeBefore.nodeSize;
-    tr.setNodeMarkup(previousListPosition, nodeAfter.type);
-  }
-  tr.join(pos);
-}

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

@@ -1,289 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.outdentListItemsSelected = void 0;
-var _prosemirrorState = require("prosemirror-state");
-var _prosemirrorModel = require("prosemirror-model");
-var _prosemirrorTransform = require("prosemirror-transform");
-var _node = require("../utils/node");
-var _find = require("../utils/find");
-var _selection = require("../utils/selection");
-// import { GapCursorSelection } from '../../selection/gap-cursor-selection';
-var outdentListItemsSelected = function outdentListItemsSelected(tr) {
-  var originalSelection = tr.selection;
-  var normalizedSelection = (0, _selection.normalizeListItemsSelection)({
-    selection: tr.selection,
-    doc: tr.doc
-  });
-  var rootList = (0, _find.findRootParentListNode)(normalizedSelection.$from);
-  if (!rootList) {
-    return;
-  }
-  var commonList = normalizedSelection.$from.blockRange(rootList, _node.isListNode);
-  if (!commonList) {
-    return;
-  }
-  var hasNormalizedToPositionLiftedOut = false;
-  var hasNormalizedFromPositionLiftedOut = false;
-  var oldFrom = normalizedSelection.from,
-      oldTo = normalizedSelection.to;
-  var nodeRanges = splitRangeSelection(normalizedSelection);
-  nodeRanges.forEach(function (range) {
-    var $from = tr.doc.resolve(tr.mapping.map(range.from));
-    var $to = tr.doc.resolve(tr.mapping.map(range.to));
-    var mappedRange = $from.blockRange($to, _node.isListNode);
-    if (!mappedRange) {
-      return;
-    }
-    if ((0, _node.isListItemNode)($from.node(mappedRange.depth - 1))) {
-      outdentRangeToParentList({
-        tr: tr,
-        range: mappedRange
-      });
-    } else {
-      extractListItemsRangeFromList({
-        tr: tr,
-        range: mappedRange
-      });
-      hasNormalizedToPositionLiftedOut = hasNormalizedToPositionLiftedOut || oldTo >= range.from && oldTo < range.to;
-      hasNormalizedFromPositionLiftedOut = hasNormalizedFromPositionLiftedOut || oldFrom >= range.from && oldFrom < range.to;
-    }
-  });
-  var hasCommonListMoved = commonList.start !== tr.mapping.map(commonList.start);
-  var nextSelection = calculateNewSelection({
-    originalSelection: originalSelection,
-    normalizedSelection: normalizedSelection,
-    tr: tr,
-    hasCommonListMoved: hasCommonListMoved,
-    hasNormalizedToPositionLiftedOut: hasNormalizedToPositionLiftedOut,
-    hasNormalizedFromPositionLiftedOut: hasNormalizedFromPositionLiftedOut
-  });
-  tr.setSelection(nextSelection);
-  (0, _node.joinSiblingLists)({
-    tr: tr,
-    direction: _node.JoinDirection.RIGHT
-  });
-};
-exports.outdentListItemsSelected = outdentListItemsSelected;
-var calculateNewSelection = function calculateNewSelection(_ref) {
-  var tr = _ref.tr,
-      originalSelection = _ref.originalSelection,
-      normalizedSelection = _ref.normalizedSelection,
-      hasCommonListMoved = _ref.hasCommonListMoved,
-      hasNormalizedToPositionLiftedOut = _ref.hasNormalizedToPositionLiftedOut,
-      hasNormalizedFromPositionLiftedOut = _ref.hasNormalizedFromPositionLiftedOut;
-  var $from = normalizedSelection.$from,
-      $to = normalizedSelection.$to;
-  var isCursorSelection = normalizedSelection.empty;
-  var from = tr.mapping.map($from.pos);
-  var to = tr.mapping.map($to.pos);
-  var LIST_STRUCTURE_CHANGED_OFFSET = 2;
-  var isToFromSameListItem = $from.sameParent($to);
-  if (hasNormalizedFromPositionLiftedOut) {
-    var fromMapped = isToFromSameListItem ? $from.pos : from;
-    from = hasNormalizedFromPositionLiftedOut ? $from.pos : fromMapped;
-    from = hasCommonListMoved ? from - LIST_STRUCTURE_CHANGED_OFFSET : from;
-    from = Math.max(from, 0);
-  }
-  if (hasNormalizedToPositionLiftedOut) {
-    var toMapped = isToFromSameListItem ? $to.pos : to;
-    to = hasNormalizedToPositionLiftedOut ? $to.pos : toMapped;
-    to = hasCommonListMoved ? to - LIST_STRUCTURE_CHANGED_OFFSET : to;
-    to = Math.min(to, tr.doc.nodeSize - 2);
-  } // if (normalizedSelection instanceof GapCursorSelection) {
-  //   const nextSelectionFrom = tr.doc.resolve(from);
-  //   return new GapCursorSelection(nextSelectionFrom, normalizedSelection.side);
-  // }
-  if (originalSelection instanceof _prosemirrorState.NodeSelection) {
-    return _prosemirrorState.NodeSelection.create(tr.doc, from);
-  }
-  if (isCursorSelection) {
-    return _prosemirrorState.TextSelection.between(tr.doc.resolve(to), tr.doc.resolve(to), -1);
-  }
-  return _prosemirrorState.TextSelection.between(tr.doc.resolve(from), tr.doc.resolve(to), -1);
-};
-var splitRangeSelection = function splitRangeSelection(selection) {
-  var commonListRange = (0, _selection.createListNodeRange)({
-    selection: selection
-  });
-  if (!commonListRange) {
-    return [];
-  }
-  var $from = selection.$from,
-      $to = selection.$to;
-  if ($from.pos === $to.pos && $from.sameParent($to)) {
-    return [{
-      from: commonListRange.start,
-      to: commonListRange.end,
-      depth: commonListRange.depth
-    }];
-  }
-  var lastListItem = findPreviousListItemSibling($from);
-  if (!lastListItem) {
-    return [];
-  }
-  var nodeRanges = [];
-  var doc = $from.doc;
-  var previousListItem = findPreviousListItemSibling($to);
-  while (previousListItem && previousListItem.pos >= lastListItem.pos && previousListItem.pos >= commonListRange.start) {
-    var node = doc.nodeAt(previousListItem.pos);
-    if (!node || !(0, _node.isListItemNode)(node)) {
-      return [];
-    }
-    var offset = 0;
-    if (node && node.lastChild && (0, _node.isListNode)(node.lastChild)) {
-      offset = node.lastChild.nodeSize;
-    }
-    var start = previousListItem.pos + 1;
-    nodeRanges.push({
-      from: start,
-      to: doc.resolve(start).end() - offset,
-      depth: previousListItem.depth
-    });
-    previousListItem = findPreviousListItemSibling(previousListItem);
-  }
-  return nodeRanges;
-};
-var outdentRangeToParentList = function outdentRangeToParentList(_ref2) {
-  var tr = _ref2.tr,
-      range = _ref2.range;
-  var end = range.end;
-  var endOfList = range.$to.end(range.depth);
-  var listItem = tr.doc.type.schema.nodes.listItem;
-  if (end < endOfList) {
-    var slice = new _prosemirrorModel.Slice(_prosemirrorModel.Fragment.from(listItem.create(null, range.parent.copy())), 1, 0);
-    var step = new _prosemirrorTransform.ReplaceAroundStep(end - 1, endOfList, end, endOfList, slice, 1, true);
-    tr.step(step);
-    range = new _prosemirrorModel.NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);
-  }
-  var target = (0, _prosemirrorTransform.liftTarget)(range);
-  if (target) {
-    tr.lift(range, target);
-  }
-};
-var extractListItemsRangeFromList = function extractListItemsRangeFromList(_ref3) {
-  var tr = _ref3.tr,
-      range = _ref3.range;
-  var list = range.parent;
-  var $start = tr.doc.resolve(range.start);
-  var listStart = $start.start(range.depth);
-  var listEnd = $start.end(range.depth);
-  var isAtTop = listStart === range.start;
-  var isAtBottom = listEnd === range.end;
-  var isTheEntireList = isAtTop && isAtBottom;
-  var listItemContent = isAtTop ? _prosemirrorModel.Fragment.empty : _prosemirrorModel.Fragment.from(list.copy(_prosemirrorModel.Fragment.empty));
-  for (var i = range.startIndex; i < range.endIndex; i++) {
-    listItemContent = listItemContent.append(list.child(i).content);
-  }
-  if (isAtTop) {
-    for (var _i = 0; _i < listItemContent.childCount; _i++) {
-      var child = listItemContent.child(_i);
-      if (child && (0, _node.isListNode)(child) && child.type !== list.type) {
-        var newNestedList = list.type.create(null, child.content);
-        listItemContent = listItemContent.replaceChild(_i, newNestedList);
-      }
-    }
-  }
-  var nextListFragment = listItemContent.append(_prosemirrorModel.Fragment.from(list.copy(_prosemirrorModel.Fragment.empty)));
-  if (isTheEntireList) {
-    var slice = new _prosemirrorModel.Slice(listItemContent, 0, 0);
-    var step = new _prosemirrorTransform.ReplaceStep($start.pos - 1, range.end + 1, slice, false);
-    tr.step(step);
-  } else if (isAtTop) {
-    var _slice = new _prosemirrorModel.Slice(nextListFragment, 0, 1);
-    var _step = new _prosemirrorTransform.ReplaceStep($start.pos - 1, range.end, _slice, false);
-    tr.step(_step);
-  } else if (isAtBottom) {
-    var _slice2 = new _prosemirrorModel.Slice(listItemContent, 1, 0);
-    var _step2 = new _prosemirrorTransform.ReplaceStep($start.pos, listEnd + 1, _slice2, false);
-    tr.step(_step2);
-  } else {
-    var _slice3 = new _prosemirrorModel.Slice(nextListFragment, 1, 1);
-    var _step3 = new _prosemirrorTransform.ReplaceAroundStep($start.pos, listEnd, range.end, listEnd, _slice3, _slice3.size, false);
-    tr.step(_step3);
-  }
-};
-var findPreviousListItemSibling = function findPreviousListItemSibling($pos) {
-  var doc = $pos.doc;
-  var isPositionListItem = (0, _node.isListNode)($pos.node());
-  var listItemPosition = $pos;
-  if (!isPositionListItem) {
-    var listItem = (0, _find.findFirstParentListItemNode)($pos);
-    if (!listItem) {
-      return null;
-    }
-    return doc.resolve(listItem.pos);
-  }
-  var resolved = doc.resolve(listItemPosition.pos);
-  var foundPosition = _prosemirrorState.Selection.findFrom(resolved, -1);
-  if (!foundPosition) {
-    return null;
-  }
-  var parentListItemNode = (0, _find.findFirstParentListItemNode)(foundPosition.$from);
-  if (!parentListItemNode) {
-    return null;
-  }
-  return doc.resolve(parentListItemNode.pos);
-};

package/lib/components/rich-editor/plugins/block/lists/actions/wrap-and-join-lists.js DELETED Viewed

@@ -1,180 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.autoJoin = autoJoin;
-exports.wrapInList = wrapInList;
-exports.wrapInListAndJoin = wrapInListAndJoin;
-var _prosemirrorModel = require("prosemirror-model");
-var _prosemirrorTransform = require("prosemirror-transform");
-/**
- * Wraps the selection in a list with the given type. If this results in
- * two adjacent lists of the same type, those will be joined together.
- */
-function wrapInListAndJoin(nodeType, tr) {
-  wrapInList(nodeType)(tr);
-  autoJoin(tr, function (before, after) {
-    return before.type === after.type && before.type === nodeType;
-  });
-}
-/**
- * Wraps the selection in a list with the given type and attributes.
- *
- * Adapted from https://github.com/ProseMirror/prosemirror-schema-list/blob/master/src/schema-list.js#L64-L89
- */
-function wrapInList(listType, attrs) {
-  return function (tr) {
-    var _tr$selection = tr.selection,
-        $from = _tr$selection.$from,
-        $to = _tr$selection.$to;
-    var range = $from.blockRange($to);
-    var doJoin = false;
-    var outerRange = range;
-    if (!range) {
-      return false;
-    } // This is at the top of an existing list item
-    if (range.depth >= 2 && // @ts-ignore - missing type for compatibleContent
-    $from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex === 0) {
-      // Don't do anything if this is the top of the list
-      if ($from.index(range.depth - 1) === 0) {
-        return false;
-      }
-      var $insert = tr.doc.resolve(range.start - 2);
-      outerRange = new _prosemirrorModel.NodeRange($insert, $insert, range.depth);
-      if (range.endIndex < range.parent.childCount) {
-        range = new _prosemirrorModel.NodeRange($from, tr.doc.resolve($to.end(range.depth)), range.depth);
-      }
-      doJoin = true;
-    }
-    var wrap = (0, _prosemirrorTransform.findWrapping)(outerRange, listType, attrs, range);
-    if (!wrap) {
-      return false;
-    }
-    tr = doWrapInList(tr, range, wrap, doJoin, listType);
-    return true;
-  };
-}
-/**
- * Internal function used by wrapInList
- *
- * Adapted from https://github.com/ProseMirror/prosemirror-schema-list/blob/master/src/schema-list.js#L91-L112
- */
-function doWrapInList(tr, range, wrappers, joinBefore, listType) {
-  var content = _prosemirrorModel.Fragment.empty;
-  for (var i = wrappers.length - 1; i >= 0; i--) {
-    content = _prosemirrorModel.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));
-  }
-  tr.step(new _prosemirrorTransform.ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end, new _prosemirrorModel.Slice(content, 0, 0), wrappers.length, true));
-  var found = 0;
-  for (var _i = 0; _i < wrappers.length; _i++) {
-    if (wrappers[_i].type === listType) {
-      found = _i + 1;
-    }
-  }
-  var splitDepth = wrappers.length - found;
-  var splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0);
-  var parent = range.parent;
-  for (var _i2 = range.startIndex, e = range.endIndex, first = true; _i2 < e; _i2++, first = false) {
-    if (!first && (0, _prosemirrorTransform.canSplit)(tr.doc, splitPos, splitDepth)) {
-      tr.split(splitPos, splitDepth);
-      splitPos += 2 * splitDepth;
-    }
-    splitPos += parent.child(_i2).nodeSize;
-  }
-  return tr;
-}
-/**
- * Checks whether two adjacent nodes can be joined. If so, the document
- * will be updated to join those nodes. If not, the original transaction
- * remains untouched.
- *
- * Nodes are considered joinable if the `isJoinable` predicate returns true.
- *
- * Adapted from https://github.com/ProseMirror/prosemirror-commands/blob/master/src/commands.js#L597-L610
- */
-function autoJoin(tr, isJoinable) {
-  if (!tr.isGeneric) {
-    return;
-  }
-  var ranges = [];
-  for (var i = 0; i < tr.mapping.maps.length; i++) {
-    var map = tr.mapping.maps[i];
-    for (var j = 0; j < ranges.length; j++) {
-      ranges[j] = map.map(ranges[j]);
-    }
-    map.forEach(function (_s, _e, from, to) {
-      return ranges.push(from, to);
-    });
-  } // Figure out which joinable points exist inside those ranges,
-  // by checking all node boundaries in their parent nodes.
-  var joinable = [];
-  for (var _i3 = 0; _i3 < ranges.length; _i3 += 2) {
-    var from = ranges[_i3];
-    var to = ranges[_i3 + 1];
-    var $from = tr.doc.resolve(from);
-    var depth = $from.sharedDepth(to);
-    var parent = $from.node(depth);
-    for (var index = $from.indexAfter(depth), pos = $from.after(depth + 1); pos <= to; ++index) {
-      var _after = parent.maybeChild(index);
-      if (!_after) {
-        break;
-      }
-      if (index && joinable.indexOf(pos) === -1) {
-        var _before = parent.child(index - 1);
-        if (_before.type === _after.type && isJoinable(_before, _after)) {
-          joinable.push(pos);
-        }
-      }
-      pos += _after.nodeSize;
-    }
-  } // Join the joinable points
-  joinable.sort(function (a, b) {
-    return a - b;
-  });
-  for (var _i4 = joinable.length - 1; _i4 >= 0; _i4--) {
-    if ((0, _prosemirrorTransform.canJoin)(tr.doc, joinable[_i4])) {
-      tr.join(joinable[_i4]);
-    }
-  }
-}