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

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

@@ -1,211 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.bracketTyped = bracketTyped;
-exports.findFarthestParentNode = void 0;
-exports.getNodesCount = getNodesCount;
-exports.getStepRange = void 0;
-exports.hasDocAsParent = hasDocAsParent;
-exports.hasVisibleContent = hasVisibleContent;
-exports.isEmptyDocument = isEmptyDocument;
-exports.isEmptyParagraph = isEmptyParagraph;
-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)) {
-    return true;
-  } 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) {
-    child.isInline ? nonBlock.push(child) : block.push(child);
-  });
-  return !nonBlock.length && !block.filter(function (childNode) {
-    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;
-  transaction.steps.forEach(function (step) {
-    step.getMap().forEach(function (_oldStart, _oldEnd, newStart, newEnd) {
-      from = newStart < from || from === -1 ? newStart : from;
-      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,
-          start: $pos.start(i),
-          depth: i,
-          node: _node
-        };
-      }
-    }
-
-    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
-
-
-function hasDocAsParent($anchor) {
-  return $anchor.depth === 1;
-}
-
-function isInEmptyLine(state) {
-  var selection = state.selection;
-  var _ref = selection,
-      $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;
-
-  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

@@ -1,79 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-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);
-    }
-  }, {
-    key: "off",
-    value: function off(event, cb) {
-      if (!this.listeners[event]) {
-        return;
-      }
-
-      if (this.listeners[event].has(cb)) {
-        this.listeners[event]["delete"](cb);
-      }
-    }
-  }, {
-    key: "emit",
-    value: function emit(event, data) {
-      if (!this.listeners[event]) {
-        return;
-      }
-
-      this.listeners[event].forEach(function (cb) {
-        return cb(data);
-      });
-    }
-  }, {
-    key: "destroy",
-    value: function destroy() {
-      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

@@ -1,16 +0,0 @@
-"use strict";
-
-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] : {};
-  var keys1 = Object.keys(obj1);
-  var keys2 = Object.keys(obj2);
-  return keys1.length === keys2.length && keys1.reduce(function (acc, key) {
-    return acc && obj1[key] === obj2[key];
-  }, true);
-}

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

@@ -1,168 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.selectionContainsMark = exports.sanitiseSelectionMarksForWrapping = exports.sanitiseMarksInSelection = exports.removeBlockMarks = exports.isMarkExcluded = exports.isMarkAllowedInRange = void 0;
-
-function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }, _typeof(obj); }
-
-var isMarkAllowedInRange = function isMarkAllowedInRange(doc, ranges, type) {
-  var _loop = function _loop(i) {
-    var _ranges$i = ranges[i],
-        $from = _ranges$i.$from,
-        $to = _ranges$i.$to;
-    var can = $from.depth === 0 ? doc.type.allowsMarkType(type) : false;
-    doc.nodesBetween($from.pos, $to.pos, function (node) {
-      if (can) {
-        return false;
-      }
-
-      can = node.inlineContent && node.type.allowsMarkType(type);
-      return;
-    });
-
-    if (can) {
-      return {
-        v: can
-      };
-    }
-  };
-
-  for (var i = 0; i < ranges.length; i++) {
-    var _ret = _loop(i);
-
-    if (_typeof(_ret) === "object") return _ret.v;
-  }
-
-  return false;
-};
-
-exports.isMarkAllowedInRange = isMarkAllowedInRange;
-
-var isMarkExcluded = function isMarkExcluded(type, marks) {
-  if (marks) {
-    return marks.some(function (mark) {
-      return mark.type !== type && mark.type.excludes(type);
-    });
-  }
-
-  return false;
-};
-
-exports.isMarkExcluded = isMarkExcluded;
-
-var not = function not(fn) {
-  return function (arg) {
-    return !fn(arg);
-  };
-};
-
-var removeBlockMarks = function removeBlockMarks(state, marks) {
-  var selection = state.selection,
-      schema = state.schema;
-  var tr = state.tr; // Marks might not exist in Schema
-
-  var marksToRemove = marks.filter(Boolean);
-
-  if (marksToRemove.length === 0) {
-    return undefined;
-  }
-  /** Saves an extra dispatch */
-
-
-  var blockMarksExists = false;
-
-  var hasMark = function hasMark(mark) {
-    return marksToRemove.indexOf(mark.type) > -1;
-  };
-  /**
-   * When you need to toggle the selection
-   * when another type which does not allow alignment is applied
-   */
-
-
-  state.doc.nodesBetween(selection.from, selection.to, function (node, pos) {
-    if (node.type === schema.nodes.paragraph && node.marks.some(hasMark)) {
-      blockMarksExists = true;
-      var resolvedPos = state.doc.resolve(pos);
-      var withoutBlockMarks = node.marks.filter(not(hasMark));
-      tr = tr.setNodeMarkup(resolvedPos.pos, undefined, node.attrs, withoutBlockMarks);
-    }
-  });
-  return blockMarksExists ? tr : undefined;
-};
-/**
- * Removes marks from nodes in the current selection that are not supported
- */
-
-
-exports.removeBlockMarks = removeBlockMarks;
-
-var sanitiseSelectionMarksForWrapping = function sanitiseSelectionMarksForWrapping(state, newParentType) {
-  var tr = state.tr;
-  sanitiseMarksInSelection(tr, newParentType);
-  return tr;
-};
-
-exports.sanitiseSelectionMarksForWrapping = sanitiseSelectionMarksForWrapping;
-
-var sanitiseMarksInSelection = function sanitiseMarksInSelection(tr, newParentType) {
-  var _tr$selection = tr.selection,
-      from = _tr$selection.from,
-      to = _tr$selection.to;
-  var nodesSanitized = [];
-  tr.doc.nodesBetween(from, to, function (node, pos, parent) {
-    if (node.isText) {
-      return false;
-    } // Skip expands and layouts if they are outside selection
-    // but continue to iterate over their children.
-
-
-    if (['expand', 'layoutSection'].includes(node.type.name) && (pos < from || pos > to)) {
-      return true;
-    }
-
-    node.marks.forEach(function (mark) {
-      if (!parent.type.allowsMarkType(mark.type) || newParentType && !newParentType.allowsMarkType(mark.type)) {
-        var filteredMarks = node.marks.filter(function (m) {
-          return m.type !== mark.type;
-        });
-        var position = pos > 0 ? pos : 0;
-        var marksRemoved = node.marks.filter(function (m) {
-          return m.type === mark.type;
-        });
-        nodesSanitized.push({
-          node: node,
-          marksRemoved: marksRemoved
-        });
-        tr.setNodeMarkup(position, undefined, node.attrs, filteredMarks);
-      }
-    });
-  });
-  return nodesSanitized;
-};
-
-exports.sanitiseMarksInSelection = sanitiseMarksInSelection;
-
-var selectionContainsMark = function selectionContainsMark(state, markName) {
-  var _state$selection = state.selection,
-      from = _state$selection.from,
-      to = _state$selection.to,
-      $from = _state$selection.$from;
-  var marks = [];
-
-  if (from == to) {
-    marks = state.storedMarks || $from.marks();
-  } else {
-    state.doc.nodesBetween(from, to, function (node) {
-      marks = marks.concat(node.marks);
-    });
-  }
-
-  return marks.findIndex(function (m) {
-    return m.type.name == markName;
-  }) !== -1;
-};
-
-exports.selectionContainsMark = selectionContainsMark;

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

@@ -1,85 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.flatmap = flatmap;
-exports.getFragmentBackingArray = getFragmentBackingArray;
-exports.mapChildren = mapChildren;
-exports.mapFragment = mapFragment;
-exports.mapSlice = mapSlice;
-
-var _prosemirrorModel = require("prosemirror-model");
-
-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 _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 _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 _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; }
-
-/**
- * A helper to get the underlying array of a fragment.
- */
-function getFragmentBackingArray(fragment) {
-  return fragment.content;
-}
-
-function mapFragment(content, callback) {
-  var parent = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;
-  var children = [];
-
-  for (var i = 0, size = content.childCount; i < size; i++) {
-    var _node = content.child(i);
-
-    var transformed = _node.isLeaf ? callback(_node, parent, i) : callback(_node.copy(mapFragment(_node.content, callback, _node)), parent, i);
-
-    if (transformed) {
-      if (transformed instanceof _prosemirrorModel.Fragment) {
-        children.push.apply(children, _toConsumableArray(getFragmentBackingArray(transformed)));
-      } else if (Array.isArray(transformed)) {
-        children.push.apply(children, _toConsumableArray(transformed));
-      } else {
-        children.push(transformed);
-      }
-    }
-  }
-
-  return _prosemirrorModel.Fragment.fromArray(children);
-}
-
-function mapSlice(slice, callback) {
-  var fragment = mapFragment(slice.content, callback);
-  return new _prosemirrorModel.Slice(fragment, slice.openStart, slice.openEnd);
-}
-
-function flatmap(fragment, callback) {
-  var fragmentContent = [];
-
-  for (var i = 0; i < fragment.childCount; i++) {
-    var child = callback(fragment.child(i), i, fragment);
-
-    if (Array.isArray(child)) {
-      fragmentContent.push.apply(fragmentContent, _toConsumableArray(child));
-    } else {
-      fragmentContent.push(child);
-    }
-  }
-
-  return _prosemirrorModel.Fragment.fromArray(fragmentContent);
-}
-
-function mapChildren(node, callback) {
-  var array = [];
-
-  for (var i = 0; i < node.childCount; i++) {
-    array.push(callback(node.child(i), i, node instanceof _prosemirrorModel.Fragment ? node : node.content));
-  }
-
-  return array;
-}