@titaui/pc 1.11.52-beta.1 → 1.11.52-beta.2

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

@@ -0,0 +1,180 @@
+"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]);
+    }
+  }
+}

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

@@ -0,0 +1,328 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addListNodes = addListNodes;
+exports.bulletList = void 0;
+exports.liftListItem = liftListItem;
+exports.orderedList = exports.listItem = void 0;
+exports.sinkListItem = sinkListItem;
+exports.splitListItem = splitListItem;
+exports.wrapInList = wrapInList;
+
+var _prosemirrorTransform = require("prosemirror-transform");
+
+var _prosemirrorModel = require("prosemirror-model");
+
+var olDOM = ["ol", 0],
+    ulDOM = ["ul", 0],
+    liDOM = ["li", 0]; // :: NodeSpec
+// An ordered list [node spec](#model.NodeSpec). Has a single
+// attribute, `order`, which determines the number at which the list
+// starts counting, and defaults to 1. Represented as an `<ol>`
+// element.
+
+var orderedList = {
+  attrs: {
+    order: {
+      "default": 1
+    }
+  },
+  parseDOM: [{
+    tag: "ol",
+    getAttrs: function getAttrs(dom) {
+      return {
+        order: dom.hasAttribute("start") ? +dom.getAttribute("start") : 1
+      };
+    }
+  }],
+  toDOM: function toDOM(node) {
+    return node.attrs.order == 1 ? olDOM : ["ol", {
+      start: node.attrs.order
+    }, 0];
+  }
+}; // :: NodeSpec
+// A bullet list node spec, represented in the DOM as `<ul>`.
+
+exports.orderedList = orderedList;
+var bulletList = {
+  parseDOM: [{
+    tag: "ul"
+  }],
+  toDOM: function toDOM() {
+    return ulDOM;
+  }
+}; // :: NodeSpec
+// A list item (`<li>`) spec.
+
+exports.bulletList = bulletList;
+var listItem = {
+  parseDOM: [{
+    tag: "li"
+  }],
+  toDOM: function toDOM() {
+    return liDOM;
+  },
+  defining: true
+};
+exports.listItem = listItem;
+
+function add(obj, props) {
+  var copy = {};
+
+  for (var prop in obj) {
+    copy[prop] = obj[prop];
+  }
+
+  for (var _prop in props) {
+    copy[_prop] = props[_prop];
+  }
+
+  return copy;
+} // :: (OrderedMap<NodeSpec>, string, ?string) → OrderedMap<NodeSpec>
+// Convenience function for adding list-related node types to a map
+// specifying the nodes for a schema. Adds
+// [`orderedList`](#schema-list.orderedList) as `"ordered_list"`,
+// [`bulletList`](#schema-list.bulletList) as `"bullet_list"`, and
+// [`listItem`](#schema-list.listItem) as `"list_item"`.
+//
+// `itemContent` determines the content expression for the list items.
+// If you want the commands defined in this module to apply to your
+// list structure, it should have a shape like `"paragraph block*"` or
+// `"paragraph (ordered_list | bullet_list)*"`. `listGroup` can be
+// given to assign a group name to the list node types, for example
+// `"block"`.
+
+
+function addListNodes(nodes, itemContent, listGroup) {
+  return nodes.append({
+    ordered_list: add(orderedList, {
+      content: "list_item+",
+      group: listGroup
+    }),
+    bullet_list: add(bulletList, {
+      content: "list_item+",
+      group: listGroup
+    }),
+    list_item: add(listItem, {
+      content: itemContent
+    })
+  });
+} // :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
+// Returns a command function that wraps the selection in a list with
+// the given type an attributes. If `dispatch` is null, only return a
+// value to indicate whether this is possible, but don't actually
+// perform the change.
+
+
+function wrapInList(listType, attrs) {
+  return function (state, dispatch) {
+    var _state$selection = state.selection,
+        $from = _state$selection.$from,
+        $to = _state$selection.$to;
+    var range = $from.blockRange($to),
+        doJoin = false,
+        outerRange = range;
+    if (!range) return false; // This is at the top of an existing list item
+
+    if (range.depth >= 2 && $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 = state.doc.resolve(range.start - 2);
+      outerRange = new _prosemirrorModel.NodeRange($insert, $insert, range.depth);
+      if (range.endIndex < range.parent.childCount) range = new _prosemirrorModel.NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth);
+      doJoin = true;
+    }
+
+    var wrap = (0, _prosemirrorTransform.findWrapping)(outerRange, listType, attrs, range);
+    if (!wrap) return false;
+    if (dispatch) dispatch(doWrapInList(state.tr, range, wrap, doJoin, listType).scrollIntoView());
+    return true;
+  };
+}
+
+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),
+      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;
+} // :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
+// Build a command that splits a non-empty textblock at the top level
+// of a list item by also splitting that list item.
+
+
+function splitListItem(itemType) {
+  return function (state, dispatch) {
+    var _state$selection2 = state.selection,
+        $from = _state$selection2.$from,
+        $to = _state$selection2.$to,
+        node = _state$selection2.node;
+    if (node && node.isBlock || $from.depth < 2 || !$from.sameParent($to)) return false;
+    var grandParent = $from.node(-1);
+    if (grandParent.type != itemType) return false;
+
+    if ($from.parent.content.size == 0 && $from.node(-1).childCount == $from.indexAfter(-1)) {
+      // In an empty block. If this is a nested list, the wrapping
+      // list item should be split. Otherwise, bail out and let next
+      // command handle lifting.
+      if ($from.depth == 2 || $from.node(-3).type != itemType || $from.index(-2) != $from.node(-2).childCount - 1) return false;
+
+      if (dispatch) {
+        var wrap = _prosemirrorModel.Fragment.empty;
+        var depthBefore = $from.index(-1) ? 1 : $from.index(-2) ? 2 : 3; // Build a fragment containing empty versions of the structure
+        // from the outer list item to the parent node of the cursor
+
+        for (var d = $from.depth - depthBefore; d >= $from.depth - 3; d--) {
+          wrap = _prosemirrorModel.Fragment.from($from.node(d).copy(wrap));
+        }
+
+        var depthAfter = $from.indexAfter(-1) < $from.node(-2).childCount ? 1 : $from.indexAfter(-2) < $from.node(-3).childCount ? 2 : 3; // Add a second list item with an empty default start node
+
+        wrap = wrap.append(_prosemirrorModel.Fragment.from(itemType.createAndFill()));
+        var start = $from.before($from.depth - (depthBefore - 1));
+
+        var _tr = state.tr.replace(start, $from.after(-depthAfter), new _prosemirrorModel.Slice(wrap, 4 - depthBefore, 0));
+
+        var sel = -1;
+
+        _tr.doc.nodesBetween(start, _tr.doc.content.size, function (node, pos) {
+          if (sel > -1) return false;
+          if (node.isTextblock && node.content.size == 0) sel = pos + 1;
+        });
+
+        if (sel > -1) _tr.setSelection(state.selection.constructor.near(_tr.doc.resolve(sel)));
+        dispatch(_tr.scrollIntoView());
+      }
+
+      return true;
+    }
+
+    var nextType = $to.pos == $from.end() ? grandParent.contentMatchAt(0).defaultType : null;
+    var tr = state.tr["delete"]($from.pos, $to.pos);
+    var types = nextType && [null, {
+      type: nextType
+    }];
+    if (!(0, _prosemirrorTransform.canSplit)(tr.doc, $from.pos, 2, types)) return false;
+    if (dispatch) dispatch(tr.split($from.pos, 2, types).scrollIntoView());
+    return true;
+  };
+} // :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
+// Create a command to lift the list item around the selection up into
+// a wrapping list.
+
+
+function liftListItem(itemType) {
+  return function (state, dispatch) {
+    var _state$selection3 = state.selection,
+        $from = _state$selection3.$from,
+        $to = _state$selection3.$to;
+    var range = $from.blockRange($to, function (node) {
+      return node.childCount && node.firstChild.type == itemType;
+    });
+    if (!range) return false;
+    if (!dispatch) return true;
+    if ($from.node(range.depth - 1).type == itemType) // Inside a parent list
+      return liftToOuterList(state, dispatch, itemType, range);else // Outer list node
+      return liftOutOfList(state, dispatch, range);
+  };
+}
+
+function liftToOuterList(state, dispatch, itemType, range) {
+  var tr = state.tr,
+      end = range.end,
+      endOfList = range.$to.end(range.depth);
+
+  if (end < endOfList) {
+    // There are siblings after the lifted items, which must become
+    // children of the last item
+    tr.step(new _prosemirrorTransform.ReplaceAroundStep(end - 1, endOfList, end, endOfList, new _prosemirrorModel.Slice(_prosemirrorModel.Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));
+    range = new _prosemirrorModel.NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);
+  }
+
+  dispatch(tr.lift(range, (0, _prosemirrorTransform.liftTarget)(range)).scrollIntoView());
+  return true;
+}
+
+function liftOutOfList(state, dispatch, range) {
+  var tr = state.tr,
+      list = range.parent; // Merge the list items into a single big item
+
+  for (var pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {
+    pos -= list.child(i).nodeSize;
+    tr["delete"](pos - 1, pos + 1);
+  }
+
+  var $start = tr.doc.resolve(range.start),
+      item = $start.nodeAfter;
+  if (tr.mapping.map(range.end) != range.start + $start.nodeAfter.nodeSize) return false;
+  var atStart = range.startIndex == 0,
+      atEnd = range.endIndex == list.childCount;
+  var parent = $start.node(-1),
+      indexBefore = $start.index(-1);
+  if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1, item.content.append(atEnd ? _prosemirrorModel.Fragment.empty : _prosemirrorModel.Fragment.from(list)))) return false;
+  var start = $start.pos,
+      end = start + item.nodeSize; // Strip off the surrounding list. At the sides where we're not at
+  // the end of the list, the existing list is closed. At sides where
+  // this is the end, it is overwritten to its end.
+
+  tr.step(new _prosemirrorTransform.ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1, new _prosemirrorModel.Slice((atStart ? _prosemirrorModel.Fragment.empty : _prosemirrorModel.Fragment.from(list.copy(_prosemirrorModel.Fragment.empty))).append(atEnd ? _prosemirrorModel.Fragment.empty : _prosemirrorModel.Fragment.from(list.copy(_prosemirrorModel.Fragment.empty))), atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));
+  dispatch(tr.scrollIntoView());
+  return true;
+} // :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
+// Create a command to sink the list item around the selection down
+// into an inner list.
+
+
+function sinkListItem(itemType) {
+  return function (state, dispatch) {
+    var _state$selection4 = state.selection,
+        $from = _state$selection4.$from,
+        $to = _state$selection4.$to;
+    var range = $from.blockRange($to, function (node) {
+      return node.childCount && node.firstChild.type == itemType;
+    });
+    if (!range) return false;
+    var startIndex = range.startIndex;
+    if (startIndex == 0) return false;
+    var parent = range.parent,
+        nodeBefore = parent.child(startIndex - 1);
+    if (nodeBefore.type != itemType) return false;
+
+    if (dispatch) {
+      var nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;
+
+      var inner = _prosemirrorModel.Fragment.from(nestedBefore ? itemType.create() : null);
+
+      var slice = new _prosemirrorModel.Slice(_prosemirrorModel.Fragment.from(itemType.create(null, _prosemirrorModel.Fragment.from(parent.type.create(null, inner)))), nestedBefore ? 3 : 1, 0);
+      var before = range.start,
+          after = range.end;
+      dispatch(state.tr.step(new _prosemirrorTransform.ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after, before, after, slice, 1, true)).scrollIntoView());
+    }
+
+    return true;
+  };
+}

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

@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.MAX_NESTED_LIST_INDENTATION = void 0;
+exports.indentList = indentList;
+
+var _indentation = require("../utils/indentation");
+
+var _indentListItemsSelected = require("../actions/indent-list-items-selected");
+
+var _find = require("../utils/find");
+
+var _selection = require("../utils/selection");
+
+// import { Command } from '../../../types';
+var MAX_NESTED_LIST_INDENTATION = 6;
+exports.MAX_NESTED_LIST_INDENTATION = MAX_NESTED_LIST_INDENTATION;
+
+function indentList() {
+  return function (state, dispatch) {
+    var tr = state.tr,
+        $from = state.selection.$from; // don't indent if selection is not inside a list
+
+    if (!(0, _selection.isInsideListItem)(state)) {
+      return false;
+    }
+
+    var firstListItemSelectedAttributes = (0, _selection.getListItemAttributes)($from);
+    var parentListNode = (0, _find.findFirstParentListNode)($from);
+
+    if (!parentListNode || firstListItemSelectedAttributes && firstListItemSelectedAttributes.indentLevel === 0 && firstListItemSelectedAttributes.itemIndex === 0) {
+      if ((0, _selection.isInsideTableCell)(state)) {
+        // dont consume tab, as table-keymap should move cursor to next cell
+        return false;
+      } else {
+        // Even though this is a non-operation, we don't want to send this event to the browser. Because if we return false, the browser will move the focus to another place
+        return true;
+      }
+    }
+
+    (0, _indentListItemsSelected.indentListItemsSelected)(tr);
+    var maximimunNestedLevelReached = !(0, _indentation.hasValidListIndentationLevel)({
+      tr: tr,
+      maxIndentation: MAX_NESTED_LIST_INDENTATION
+    });
+
+    if (maximimunNestedLevelReached || !tr.docChanged) {
+      // Even though this is a non-operation, we don't want to send this event to the browser. Because if we return false, the browser will move the focus to another place
+      return true;
+    }
+
+    if (dispatch) {
+      dispatch(tr);
+    }
+
+    return true;
+  };
+}