@titaui/pc 1.16.90 → 1.16.92

package/lib/components/rich-editor/utils/browser.js

@@ -15,6 +15,7 @@ var result = {
   ios: false,
   webkit: false
 };
+
 if (typeof navigator !== 'undefined') {
   var ieEdge = /Edge\/(\d+)/.exec(navigator.userAgent);
   var ieUpTo10 = /MSIE \d/.test(navigator.userAgent);
@@ -29,5 +30,6 @@ if (typeof navigator !== 'undefined') {
   result.ios = !ie && /AppleWebKit/.test(navigator.userAgent) && /Mobile\/\w+/.test(navigator.userAgent);
   result.webkit = !ie && !!document.documentElement && 'WebkitAppearance' in document.documentElement.style;
 }
+
 var _default = result;
 exports["default"] = _default;

package/lib/components/rich-editor/utils/commands.js

@@ -10,29 +10,46 @@ exports.selectNode = exports.isFirstChildOfParent = exports.isEmptySelectionAtSt
 exports.setAlignment = setAlignment;
 exports.setHeadLine = setHeadLine;
 exports.walkPrevNode = exports.walkNextNode = void 0;
+
 var _prosemirrorCommands = require("prosemirror-commands");
+
 var _prosemirrorState = require("prosemirror-state");
+
 var _prosemirrorTransform = require("prosemirror-transform");
+
 var _schemas = _interopRequireDefault(require("../schemas"));
+
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
+
 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 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) { _defineProperty(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; }
+
 function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+
 function chainTransactions() {
   for (var _len = arguments.length, commands = new Array(_len), _key = 0; _key < _len; _key++) {
     commands[_key] = arguments[_key];
   }
+
   return function (state, dispatch) {
     var dispatcher = function dispatcher(tr) {
       state = state.apply(tr);
       dispatch(tr);
     };
+
     var last = commands.pop();
     var reduced = commands.reduce(function (result, command) {
       return result || command(state, dispatcher);
@@ -40,16 +57,20 @@ function chainTransactions() {
     return reduced && last !== undefined && last(state, dispatch);
   };
 }
+
 function setHeadLine(state, dispatchTransiction, level) {
   var $from = state.selection.$from;
   var node = $from.node();
+
   if (node.type === _schemas["default"].nodes.heading && level === node.attrs.level) {
     return (0, _prosemirrorCommands.setBlockType)(_schemas["default"].nodes.paragraph, node.attrs)(state, dispatchTransiction);
   }
+
   return chainTransactions(clearNodes(), (0, _prosemirrorCommands.setBlockType)(_schemas["default"].nodes.heading, _objectSpread(_objectSpread({}, node.attrs), {}, {
     level: level
   })))(state, dispatchTransiction);
 }
+
 function setAlignment(state, dispatchTransiction, alignment) {
   var $from = state.selection.$from;
   var node = $from.node();
@@ -57,6 +78,7 @@ function setAlignment(state, dispatchTransiction, alignment) {
     textAlign: alignment
   }))(state, dispatchTransiction);
 }
+
 var clearNodes = function clearNodes() {
   return function (state, dispatch) {
     var tr = state.tr;
@@ -67,18 +89,24 @@ var clearNodes = function clearNodes() {
         if (node.type.isText) {
           return;
         }
+
         var $fromPos = tr.doc.resolve(tr.mapping.map(pos));
         var $toPos = tr.doc.resolve(tr.mapping.map(pos + node.nodeSize));
         var nodeRange = $fromPos.blockRange($toPos);
+
         if (!nodeRange) {
           return;
         }
+
         var targetLiftDepth = (0, _prosemirrorTransform.liftTarget)(nodeRange);
+
         if (node.type.isTextblock && dispatch) {
           var _$fromPos$parent$cont = $fromPos.parent.contentMatchAt($fromPos.index()),
-            defaultType = _$fromPos$parent$cont.defaultType;
+              defaultType = _$fromPos$parent$cont.defaultType;
+
           tr.setNodeMarkup(nodeRange.start, defaultType);
         }
+
         if ((targetLiftDepth || targetLiftDepth === 0) && dispatch) {
           tr.lift(nodeRange, targetLiftDepth);
         }
@@ -88,29 +116,36 @@ var clearNodes = function clearNodes() {
     return true;
   };
 };
+
 exports.clearNodes = clearNodes;
+
 var filter = function filter(predicates, cmd) {
   return function (state, dispatch, view) {
     if (!Array.isArray(predicates)) {
       predicates = [predicates];
     }
+
     if (predicates.some(function (pred) {
       return !pred(state, view);
     })) {
       return false;
     }
+
     return cmd(state, dispatch, view) || false;
   };
 };
+
 exports.filter = filter;
+
 var isFirstChildOfParent = function isFirstChildOfParent(state) {
   var $from = state.selection.$from;
-  return $from.depth > 1 ?
-  // ? (state.selection instanceof GapCursorSelection &&
+  return $from.depth > 1 ? // ? (state.selection instanceof GapCursorSelection &&
   //     $from.parentOffset === 0) ||
   $from.index($from.depth - 1) === 0 : true;
 };
+
 exports.isFirstChildOfParent = isFirstChildOfParent;
+
 function findCutBefore($pos) {
   // parent is non-isolating, so we can look across this boundary
   if (!$pos.parent.type.spec.isolating) {
@@ -121,27 +156,34 @@ function findCutBefore($pos) {
       if ($pos.index(i) > 0) {
         return $pos.doc.resolve($pos.before(i + 1));
       }
+
       if ($pos.node(i).type.spec.isolating) {
         break;
       }
     }
   }
+
   return null;
 }
+
 var isEmptySelectionAtStart = function isEmptySelectionAtStart(state) {
   var _state$selection = state.selection,
-    empty = _state$selection.empty,
-    $from = _state$selection.$from;
+      empty = _state$selection.empty,
+      $from = _state$selection.$from;
   return empty && $from.parentOffset === 0;
 };
+
 exports.isEmptySelectionAtStart = isEmptySelectionAtStart;
+
 var isEmptySelectionAtEnd = function isEmptySelectionAtEnd(state) {
   var _state$selection2 = state.selection,
-    empty = _state$selection2.empty,
-    $from = _state$selection2.$from;
+      empty = _state$selection2.empty,
+      $from = _state$selection2.$from;
   return empty && $from.end() === $from.pos;
 };
+
 exports.isEmptySelectionAtEnd = isEmptySelectionAtEnd;
+
 /**
  * Walk backwards from a position until we encounter the (inside) end of
  * the previous node, or reach the start of the document.
@@ -150,31 +192,34 @@ exports.isEmptySelectionAtEnd = isEmptySelectionAtEnd;
  */
 var walkPrevNode = function walkPrevNode($startPos) {
   var $pos = $startPos;
+
   while ($pos.pos > 0 && ($pos.pos === $startPos.pos || $pos.parentOffset < $pos.parent.nodeSize - 2)) {
     $pos = $pos.doc.resolve($pos.pos - 1);
   }
+
   return {
     $pos: $pos,
     foundNode: $pos.pos > 0
   };
 };
+
 exports.walkPrevNode = walkPrevNode;
-var walkNextNode = function walkNextNode($startPos) {
-  var $pos = $startPos;
 
-  // invariant 1: don't walk past the end of the document
+var walkNextNode = function walkNextNode($startPos) {
+  var $pos = $startPos; // invariant 1: don't walk past the end of the document
   // invariant 2: we are at the beginning or
   //              we haven't walked to the start of *any* node
   //              parentOffset includes textOffset.
+
   while ($pos.pos < $pos.doc.nodeSize - 2 && ($pos.pos === $startPos.pos || $pos.parentOffset > 0)) {
     $pos = $pos.doc.resolve($pos.pos + 1);
   }
+
   return {
     $pos: $pos,
     foundNode: $pos.pos < $pos.doc.nodeSize - 2
   };
 };
-
 /**
  * Insert content, delete a range and create a new selection
  * This function automatically handles the mapping of positions for insertion and deletion.
@@ -184,29 +229,38 @@ var walkNextNode = function walkNextNode($startPos) {
  * @param insertions content to insert at the specified position
  * @param deletions the ranges to delete
  */
+
+
 exports.walkNextNode = walkNextNode;
+
 var insertContentDeleteRange = function insertContentDeleteRange(tr, getSelectionResolvedPos, insertions, deletions) {
   insertions.forEach(function (contentInsert) {
     var _contentInsert = _slicedToArray(contentInsert, 2),
-      content = _contentInsert[0],
-      pos = _contentInsert[1];
+        content = _contentInsert[0],
+        pos = _contentInsert[1];
+
     tr.insert(tr.mapping.map(pos), content);
   });
   deletions.forEach(function (deleteRange) {
     var _deleteRange = _slicedToArray(deleteRange, 2),
-      firstPos = _deleteRange[0],
-      lastPos = _deleteRange[1];
+        firstPos = _deleteRange[0],
+        lastPos = _deleteRange[1];
+
     tr["delete"](tr.mapping.map(firstPos), tr.mapping.map(lastPos));
   });
   tr.setSelection(new _prosemirrorState.TextSelection(getSelectionResolvedPos(tr)));
 };
+
 exports.insertContentDeleteRange = insertContentDeleteRange;
+
 var selectNode = function selectNode(pos) {
   return function (state, dispatch) {
     if (dispatch) {
       dispatch(state.tr.setSelection(new _prosemirrorState.NodeSelection(state.doc.resolve(pos))));
     }
+
     return true;
   };
 };
+
 exports.selectNode = selectNode;

package/lib/components/rich-editor/utils/document.js

@@ -15,20 +15,23 @@ exports.isInEmptyLine = isInEmptyLine;
 exports.isNodeEmpty = isNodeEmpty;
 exports.isSelectionEndOfParagraph = void 0;
 exports.nodesBetweenChanged = nodesBetweenChanged;
+
 /**
  * Checks if node is an empty paragraph.
  */
 function isEmptyParagraph(node) {
   return !node || node.type.name === 'paragraph' && !node.textContent && !node.childCount;
 }
-
 /**
  * Returns false if node contains only empty inline nodes and hardBreaks.
  */
+
+
 function hasVisibleContent(node) {
   var isInlineNodeHasVisibleContent = function isInlineNodeHasVisibleContent(inlineNode) {
     return inlineNode.isText ? !!inlineNode.textContent.trim() : inlineNode.type.name !== 'hardBreak';
   };
+
   if (node.isInline) {
     return isInlineNodeHasVisibleContent(node);
   } else if (node.isBlock && (node.isLeaf || node.isAtom)) {
@@ -36,25 +39,31 @@ function hasVisibleContent(node) {
   } else if (!node.childCount) {
     return false;
   }
+
   for (var _index = 0; _index < node.childCount; _index++) {
     var child = node.child(_index);
+
     if (hasVisibleContent(child)) {
       return true;
     }
   }
+
   return false;
 }
-
 /**
  * Checks if a node has any content. Ignores node that only contain empty block nodes.
  */
+
+
 function isNodeEmpty(node) {
   if (node && node.textContent) {
     return false;
   }
+
   if (!node || !node.childCount || node.childCount === 1 && isEmptyParagraph(node.firstChild)) {
     return true;
   }
+
   var block = [];
   var nonBlock = [];
   node.forEach(function (child) {
@@ -64,17 +73,21 @@ function isNodeEmpty(node) {
     return !!childNode.childCount && !(childNode.childCount === 1 && isEmptyParagraph(childNode.firstChild)) || childNode.isAtom;
   }).length;
 }
-
 /**
  * Checks if a node looks like an empty document
  */
+
+
 function isEmptyDocument(node) {
   var nodeChild = node.content.firstChild;
+
   if (node.childCount !== 1 || !nodeChild) {
     return false;
   }
+
   return nodeChild.type.name === 'paragraph' && !nodeChild.childCount && nodeChild.nodeSize === 2 && (!nodeChild.marks || nodeChild.marks.length === 0);
 }
+
 var getStepRange = function getStepRange(transaction) {
   var from = -1;
   var to = -1;
@@ -84,25 +97,31 @@ var getStepRange = function getStepRange(transaction) {
       to = newEnd < to || to === -1 ? newEnd : to;
     });
   });
+
   if (from !== -1) {
     return {
       from: from,
       to: to
     };
   }
+
   return null;
 };
-
 /**
  * Find the farthest node given a condition
  * @param predicate Function to check the node
  */
+
+
 exports.getStepRange = getStepRange;
+
 var findFarthestParentNode = function findFarthestParentNode(predicate) {
   return function ($pos) {
     var candidate = null;
+
     for (var i = $pos.depth; i > 0; i--) {
       var _node = $pos.node(i);
+
       if (predicate(_node)) {
         candidate = {
           pos: i > 0 ? $pos.before(i) : 0,
@@ -112,62 +131,81 @@ var findFarthestParentNode = function findFarthestParentNode(predicate) {
         };
       }
     }
+
     return candidate;
   };
 };
+
 exports.findFarthestParentNode = findFarthestParentNode;
+
 var isSelectionEndOfParagraph = function isSelectionEndOfParagraph(state) {
   return state.selection.$to.parent.type === state.schema.nodes.paragraph && state.selection.$to.pos === state.doc.resolve(state.selection.$to.pos).end();
 };
+
 exports.isSelectionEndOfParagraph = isSelectionEndOfParagraph;
+
 function nodesBetweenChanged(tr, f, startPos) {
   var stepRange = getStepRange(tr);
+
   if (!stepRange) {
     return;
   }
+
   tr.doc.nodesBetween(stepRange.from, stepRange.to, f, startPos);
 }
+
 function getNodesCount(node) {
   var count = {};
   node.nodesBetween(0, node.nodeSize - 2, function (node) {
     count[node.type.name] = (count[node.type.name] || 0) + 1;
   });
   return count;
-}
+} // Checks to see if the parent node is the document, ie not contained within another entity
+
 
-// Checks to see if the parent node is the document, ie not contained within another entity
 function hasDocAsParent($anchor) {
   return $anchor.depth === 1;
 }
+
 function isInEmptyLine(state) {
   var selection = state.selection;
   var _ref = selection,
-    $cursor = _ref.$cursor,
-    $anchor = _ref.$anchor;
+      $cursor = _ref.$cursor,
+      $anchor = _ref.$anchor;
+
   if (!$cursor) {
     return false;
   }
+
   var node = $cursor.node();
+
   if (!node) {
     return false;
   }
+
   return isEmptyParagraph(node) && hasDocAsParent($anchor);
 }
+
 function bracketTyped(state) {
   var selection = state.selection;
   var _ref2 = selection,
-    $cursor = _ref2.$cursor,
-    $anchor = _ref2.$anchor;
+      $cursor = _ref2.$cursor,
+      $anchor = _ref2.$anchor;
+
   if (!$cursor) {
     return false;
   }
+
   var node = $cursor.nodeBefore;
+
   if (!node) {
     return false;
   }
+
   if (node.type.name === 'text' && node.text === '{') {
     var paragraphNode = $anchor.node();
     return paragraphNode.marks.length === 0 && hasDocAsParent($anchor);
   }
+
   return false;
 }

package/lib/components/rich-editor/utils/event.js

@@ -5,20 +5,27 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.EventDispatcher = void 0;
 exports.createDispatch = createDispatch;
+
 function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
 function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }
+
 function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
+
 var EventDispatcher = /*#__PURE__*/function () {
   function EventDispatcher() {
     _classCallCheck(this, EventDispatcher);
+
     this.listeners = {};
   }
+
   _createClass(EventDispatcher, [{
     key: "on",
     value: function on(event, cb) {
       if (!this.listeners[event]) {
         this.listeners[event] = new Set();
       }
+
       this.listeners[event].add(cb);
     }
   }, {
@@ -27,6 +34,7 @@ var EventDispatcher = /*#__PURE__*/function () {
       if (!this.listeners[event]) {
         return;
       }
+
       if (this.listeners[event].has(cb)) {
         this.listeners[event]["delete"](cb);
       }
@@ -37,6 +45,7 @@ var EventDispatcher = /*#__PURE__*/function () {
       if (!this.listeners[event]) {
         return;
       }
+
       this.listeners[event].forEach(function (cb) {
         return cb(data);
       });
@@ -47,18 +56,23 @@ var EventDispatcher = /*#__PURE__*/function () {
       this.listeners = {};
     }
   }]);
+
   return EventDispatcher;
 }();
 /**
  * Creates a dispatch function that can be called inside ProseMirror Plugin
  * to notify listeners about that plugin's state change.
  */
+
+
 exports.EventDispatcher = EventDispatcher;
+
 function createDispatch(eventDispatcher) {
   return function (eventName, data) {
     if (!eventName) {
       throw new Error('event name is required!');
     }
+
     var event = typeof eventName === 'string' ? eventName : eventName.key;
     eventDispatcher.emit(event, data);
   };

package/lib/components/rich-editor/utils/helpers.js

@@ -4,6 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.shallowEqual = shallowEqual;
+
 function shallowEqual() {
   var obj1 = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};
   var obj2 = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};