@titaui/pc 1.10.44 → 1.10.45

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

@@ -0,0 +1,266 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.chainTransactions = chainTransactions;
+exports.filter = exports.clearNodes = void 0;
+exports.findCutBefore = findCutBefore;
+exports.selectNode = exports.isFirstChildOfParent = exports.isEmptySelectionAtStart = exports.isEmptySelectionAtEnd = exports.insertContentDeleteRange = void 0;
+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);
+    }, false);
+    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();
+  return (0, _prosemirrorCommands.setBlockType)(node.type, _objectSpread(_objectSpread({}, node.attrs), {}, {
+    textAlign: alignment
+  }))(state, dispatchTransiction);
+}
+
+var clearNodes = function clearNodes() {
+  return function (state, dispatch) {
+    var tr = state.tr;
+    var selection = tr.selection;
+    var ranges = selection.ranges;
+    ranges.forEach(function (range) {
+      state.doc.nodesBetween(range.$from.pos, range.$to.pos, function (node, pos) {
+        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;
+
+          tr.setNodeMarkup(nodeRange.start, defaultType);
+        }
+
+        if ((targetLiftDepth || targetLiftDepth === 0) && dispatch) {
+          tr.lift(nodeRange, targetLiftDepth);
+        }
+      });
+    });
+    tr.docChanged && dispatch(tr);
+    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 &&
+  //     $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) {
+    // search up the tree from the pos's *parent*
+    for (var i = $pos.depth - 1; i >= 0; i--) {
+      // starting from the inner most node's parent, find out
+      // if we're not its first child
+      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;
+  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;
+  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.
+ *
+ * @param $startPos Position to start walking from.
+ */
+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
+  // 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.
+ * The new selection is handled as a function since it may not always be necessary to resolve a position to the transactions mapping
+ *
+ * @param getSelectionResolvedPos get the resolved position to create a new selection
+ * @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];
+
+    tr.insert(tr.mapping.map(pos), content);
+  });
+  deletions.forEach(function (deleteRange) {
+    var _deleteRange = _slicedToArray(deleteRange, 2),
+        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

@@ -0,0 +1,160 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.findFarthestParentNode = void 0;
+exports.getNodesCount = getNodesCount;
+exports.getStepRange = void 0;
+exports.hasVisibleContent = hasVisibleContent;
+exports.isEmptyDocument = isEmptyDocument;
+exports.isEmptyParagraph = isEmptyParagraph;
+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;
+}

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

@@ -0,0 +1,79 @@
+"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

@@ -0,0 +1,16 @@
+"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

@@ -0,0 +1,168 @@
+"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;