\n "
+ })
+ };
+ },
+ beforeDestroy: function beforeDestroy() {
+ this.editor.destroy();
+ }
+});
+
/***/ }),
/***/ "./node_modules/babel-loader/lib/index.js?!./node_modules/vue-loader/lib/index.js?!./resources/js/views/Main.vue?vue&type=script&lang=js&":
@@ -1896,6 +1982,14 @@ __webpack_require__.r(__webpack_exports__);
//
//
//
+//
+//
+//
+//
+//
+//
+//
+//
/* harmony default export */ __webpack_exports__["default"] = ({
data: function data() {
return {
@@ -1922,6 +2016,9 @@ __webpack_require__.r(__webpack_exports__);
console.log("Logout unsuccessful.");
console.log(error);
});
+ },
+ editPage: function editPage() {
+ this.$router.push('/edit_page');
}
},
created: function created() {
@@ -2156,6 +2253,1227 @@ __webpack_require__.r(__webpack_exports__);
}
});
+/***/ }),
+
+/***/ "./node_modules/fault/index.js":
+/*!*************************************!*\
+ !*** ./node_modules/fault/index.js ***!
+ \*************************************/
+/*! no static exports found */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+var formatter = __webpack_require__(/*! format */ "./node_modules/format/format.js")
+
+var fault = create(Error)
+
+module.exports = fault
+
+fault.eval = create(EvalError)
+fault.range = create(RangeError)
+fault.reference = create(ReferenceError)
+fault.syntax = create(SyntaxError)
+fault.type = create(TypeError)
+fault.uri = create(URIError)
+
+fault.create = create
+
+// Create a new `EConstructor`, with the formatted `format` as a first argument.
+function create(EConstructor) {
+ FormattedError.displayName = EConstructor.displayName || EConstructor.name
+
+ return FormattedError
+
+ function FormattedError(format) {
+ if (format) {
+ format = formatter.apply(null, arguments)
+ }
+
+ return new EConstructor(format)
+ }
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/format/format.js":
+/*!***************************************!*\
+ !*** ./node_modules/format/format.js ***!
+ \***************************************/
+/*! no static exports found */
+/***/ (function(module, exports, __webpack_require__) {
+
+//
+// format - printf-like string formatting for JavaScript
+// github.com/samsonjs/format
+// @_sjs
+//
+// Copyright 2010 - 2013 Sami Samhuri
+//
+// MIT License
+// http://sjs.mit-license.org
+//
+
+;(function() {
+
+ //// Export the API
+ var namespace;
+
+ // CommonJS / Node module
+ if (true) {
+ namespace = module.exports = format;
+ }
+
+ // Browsers and other environments
+ else {}
+
+ namespace.format = format;
+ namespace.vsprintf = vsprintf;
+
+ if (typeof console !== 'undefined' && typeof console.log === 'function') {
+ namespace.printf = printf;
+ }
+
+ function printf(/* ... */) {
+ console.log(format.apply(null, arguments));
+ }
+
+ function vsprintf(fmt, replacements) {
+ return format.apply(null, [fmt].concat(replacements));
+ }
+
+ function format(fmt) {
+ var argIndex = 1 // skip initial format argument
+ , args = [].slice.call(arguments)
+ , i = 0
+ , n = fmt.length
+ , result = ''
+ , c
+ , escaped = false
+ , arg
+ , tmp
+ , leadingZero = false
+ , precision
+ , nextArg = function() { return args[argIndex++]; }
+ , slurpNumber = function() {
+ var digits = '';
+ while (/\d/.test(fmt[i])) {
+ digits += fmt[i++];
+ c = fmt[i];
+ }
+ return digits.length > 0 ? parseInt(digits) : null;
+ }
+ ;
+ for (; i < n; ++i) {
+ c = fmt[i];
+ if (escaped) {
+ escaped = false;
+ if (c == '.') {
+ leadingZero = false;
+ c = fmt[++i];
+ }
+ else if (c == '0' && fmt[i + 1] == '.') {
+ leadingZero = true;
+ i += 2;
+ c = fmt[i];
+ }
+ else {
+ leadingZero = true;
+ }
+ precision = slurpNumber();
+ switch (c) {
+ case 'b': // number in binary
+ result += parseInt(nextArg(), 10).toString(2);
+ break;
+ case 'c': // character
+ arg = nextArg();
+ if (typeof arg === 'string' || arg instanceof String)
+ result += arg;
+ else
+ result += String.fromCharCode(parseInt(arg, 10));
+ break;
+ case 'd': // number in decimal
+ result += parseInt(nextArg(), 10);
+ break;
+ case 'f': // floating point number
+ tmp = String(parseFloat(nextArg()).toFixed(precision || 6));
+ result += leadingZero ? tmp : tmp.replace(/^0/, '');
+ break;
+ case 'j': // JSON
+ result += JSON.stringify(nextArg());
+ break;
+ case 'o': // number in octal
+ result += '0' + parseInt(nextArg(), 10).toString(8);
+ break;
+ case 's': // string
+ result += nextArg();
+ break;
+ case 'x': // lowercase hexadecimal
+ result += '0x' + parseInt(nextArg(), 10).toString(16);
+ break;
+ case 'X': // uppercase hexadecimal
+ result += '0x' + parseInt(nextArg(), 10).toString(16).toUpperCase();
+ break;
+ default:
+ result += c;
+ break;
+ }
+ } else if (c === '%') {
+ escaped = true;
+ } else {
+ result += c;
+ }
+ }
+ return result;
+ }
+
+}());
+
+
+/***/ }),
+
+/***/ "./node_modules/highlight.js/lib/highlight.js":
+/*!****************************************************!*\
+ !*** ./node_modules/highlight.js/lib/highlight.js ***!
+ \****************************************************/
+/*! no static exports found */
+/***/ (function(module, exports, __webpack_require__) {
+
+var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/*
+Syntax highlighting with language autodetection.
+https://highlightjs.org/
+*/
+
+(function(factory) {
+
+ // Find the global object for export to both the browser and web workers.
+ var globalObject = typeof window === 'object' && window ||
+ typeof self === 'object' && self;
+
+ // Setup highlight.js for different environments. First is Node.js or
+ // CommonJS.
+ // `nodeType` is checked to ensure that `exports` is not a HTML element.
+ if( true && !exports.nodeType) {
+ factory(exports);
+ } else if(globalObject) {
+ // Export hljs globally even when using AMD for cases when this script
+ // is loaded with others that may still expect a global hljs.
+ globalObject.hljs = factory({});
+
+ // Finally register the global hljs with AMD.
+ if(true) {
+ !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = (function() {
+ return globalObject.hljs;
+ }).apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__),
+ __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));
+ }
+ }
+
+}(function(hljs) {
+ // Convenience variables for build-in objects
+ var ArrayProto = [],
+ objectKeys = Object.keys;
+
+ // Global internal variables used within the highlight.js library.
+ var languages = {},
+ aliases = {};
+
+ // Regular expressions used throughout the highlight.js library.
+ var noHighlightRe = /^(no-?highlight|plain|text)$/i,
+ languagePrefixRe = /\blang(?:uage)?-([\w-]+)\b/i,
+ fixMarkupRe = /((^(<[^>]+>|\t|)+|(?:\n)))/gm;
+
+ // The object will be assigned by the build tool. It used to synchronize API
+ // of external language files with minified version of the highlight.js library.
+ var API_REPLACES;
+
+ var spanEndTag = '';
+
+ // Global options used when within external APIs. This is modified when
+ // calling the `hljs.configure` function.
+ var options = {
+ classPrefix: 'hljs-',
+ tabReplace: null,
+ useBR: false,
+ languages: undefined
+ };
+
+ // keywords that should have no default relevance value
+ var COMMON_KEYWORDS = 'of and for in not or if then'.split(' ')
+
+
+ /* Utility functions */
+
+ function escape(value) {
+ return value.replace(/&/g, '&').replace(//g, '>');
+ }
+
+ function tag(node) {
+ return node.nodeName.toLowerCase();
+ }
+
+ function testRe(re, lexeme) {
+ var match = re && re.exec(lexeme);
+ return match && match.index === 0;
+ }
+
+ function isNotHighlighted(language) {
+ return noHighlightRe.test(language);
+ }
+
+ function blockLanguage(block) {
+ var i, match, length, _class;
+ var classes = block.className + ' ';
+
+ classes += block.parentNode ? block.parentNode.className : '';
+
+ // language-* takes precedence over non-prefixed class names.
+ match = languagePrefixRe.exec(classes);
+ if (match) {
+ return getLanguage(match[1]) ? match[1] : 'no-highlight';
+ }
+
+ classes = classes.split(/\s+/);
+
+ for (i = 0, length = classes.length; i < length; i++) {
+ _class = classes[i];
+
+ if (isNotHighlighted(_class) || getLanguage(_class)) {
+ return _class;
+ }
+ }
+ }
+
+ function inherit(parent) { // inherit(parent, override_obj, override_obj, ...)
+ var key;
+ var result = {};
+ var objects = Array.prototype.slice.call(arguments, 1);
+
+ for (key in parent)
+ result[key] = parent[key];
+ objects.forEach(function(obj) {
+ for (key in obj)
+ result[key] = obj[key];
+ });
+ return result;
+ }
+
+ /* Stream merging */
+
+ function nodeStream(node) {
+ var result = [];
+ (function _nodeStream(node, offset) {
+ for (var child = node.firstChild; child; child = child.nextSibling) {
+ if (child.nodeType === 3)
+ offset += child.nodeValue.length;
+ else if (child.nodeType === 1) {
+ result.push({
+ event: 'start',
+ offset: offset,
+ node: child
+ });
+ offset = _nodeStream(child, offset);
+ // Prevent void elements from having an end tag that would actually
+ // double them in the output. There are more void elements in HTML
+ // but we list only those realistically expected in code display.
+ if (!tag(child).match(/br|hr|img|input/)) {
+ result.push({
+ event: 'stop',
+ offset: offset,
+ node: child
+ });
+ }
+ }
+ }
+ return offset;
+ })(node, 0);
+ return result;
+ }
+
+ function mergeStreams(original, highlighted, value) {
+ var processed = 0;
+ var result = '';
+ var nodeStack = [];
+
+ function selectStream() {
+ if (!original.length || !highlighted.length) {
+ return original.length ? original : highlighted;
+ }
+ if (original[0].offset !== highlighted[0].offset) {
+ return (original[0].offset < highlighted[0].offset) ? original : highlighted;
+ }
+
+ /*
+ To avoid starting the stream just before it should stop the order is
+ ensured that original always starts first and closes last:
+
+ if (event1 == 'start' && event2 == 'start')
+ return original;
+ if (event1 == 'start' && event2 == 'stop')
+ return highlighted;
+ if (event1 == 'stop' && event2 == 'start')
+ return original;
+ if (event1 == 'stop' && event2 == 'stop')
+ return highlighted;
+
+ ... which is collapsed to:
+ */
+ return highlighted[0].event === 'start' ? original : highlighted;
+ }
+
+ function open(node) {
+ function attr_str(a) {return ' ' + a.nodeName + '="' + escape(a.value).replace('"', '"') + '"';}
+ result += '<' + tag(node) + ArrayProto.map.call(node.attributes, attr_str).join('') + '>';
+ }
+
+ function close(node) {
+ result += '';
+ }
+
+ function render(event) {
+ (event.event === 'start' ? open : close)(event.node);
+ }
+
+ while (original.length || highlighted.length) {
+ var stream = selectStream();
+ result += escape(value.substring(processed, stream[0].offset));
+ processed = stream[0].offset;
+ if (stream === original) {
+ /*
+ On any opening or closing tag of the original markup we first close
+ the entire highlighted node stack, then render the original tag along
+ with all the following original tags at the same offset and then
+ reopen all the tags on the highlighted stack.
+ */
+ nodeStack.reverse().forEach(close);
+ do {
+ render(stream.splice(0, 1)[0]);
+ stream = selectStream();
+ } while (stream === original && stream.length && stream[0].offset === processed);
+ nodeStack.reverse().forEach(open);
+ } else {
+ if (stream[0].event === 'start') {
+ nodeStack.push(stream[0].node);
+ } else {
+ nodeStack.pop();
+ }
+ render(stream.splice(0, 1)[0]);
+ }
+ }
+ return result + escape(value.substr(processed));
+ }
+
+ /* Initialization */
+
+ function dependencyOnParent(mode) {
+ if (!mode) return false;
+
+ return mode.endsWithParent || dependencyOnParent(mode.starts)
+ }
+
+ function expand_or_clone_mode(mode) {
+ if (mode.variants && !mode.cached_variants) {
+ mode.cached_variants = mode.variants.map(function(variant) {
+ return inherit(mode, {variants: null}, variant);
+ });
+ }
+
+ // EXPAND
+ // if we have variants then essentually "replace" the mode with the variants
+ // this happens in compileMode, where this function is called from
+ if (mode.cached_variants)
+ return mode.cached_variants;
+
+ // CLONE
+ // if we have dependencies on parents then we need a unique
+ // instance of ourselves, so we can be reused with many
+ // different parents without issue
+ if (dependencyOnParent(mode))
+ return [inherit(mode, { starts: mode.starts ? inherit(mode.starts) : null })]
+
+ // no special dependency issues, just return ourselves
+ return [mode]
+ }
+
+ function restoreLanguageApi(obj) {
+ if(API_REPLACES && !obj.langApiRestored) {
+ obj.langApiRestored = true;
+ for(var key in API_REPLACES)
+ obj[key] && (obj[API_REPLACES[key]] = obj[key]);
+ (obj.contains || []).concat(obj.variants || []).forEach(restoreLanguageApi);
+ }
+ }
+
+ function compileKeywords(rawKeywords, case_insensitive) {
+ var compiled_keywords = {};
+
+ if (typeof rawKeywords === 'string') { // string
+ splitAndCompile('keyword', rawKeywords);
+ } else {
+ objectKeys(rawKeywords).forEach(function (className) {
+ splitAndCompile(className, rawKeywords[className]);
+ });
+ }
+ return compiled_keywords;
+
+ // ---
+
+ function splitAndCompile(className, str) {
+ if (case_insensitive) {
+ str = str.toLowerCase();
+ }
+ str.split(' ').forEach(function(keyword) {
+ var pair = keyword.split('|');
+ compiled_keywords[pair[0]] = [className, scoreForKeyword(pair[0], pair[1])];
+ });
+ };
+ }
+
+ function scoreForKeyword(keyword, providedScore) {
+ // manual scores always win over common keywords
+ // so you can force a score of 1 if you really insist
+ if (providedScore)
+ return Number(providedScore)
+
+ return commonKeyword(keyword) ? 0 : 1;
+ }
+
+ function commonKeyword(word) {
+ return COMMON_KEYWORDS.indexOf(word.toLowerCase()) != -1
+ }
+
+ function compileLanguage(language) {
+
+ function reStr(re) {
+ return (re && re.source) || re;
+ }
+
+ function langRe(value, global) {
+ return new RegExp(
+ reStr(value),
+ 'm' + (language.case_insensitive ? 'i' : '') + (global ? 'g' : '')
+ );
+ }
+
+ function reCountMatchGroups(re) {
+ return (new RegExp(re.toString() + '|')).exec('').length - 1;
+ }
+
+ // joinRe logically computes regexps.join(separator), but fixes the
+ // backreferences so they continue to match.
+ // it also places each individual regular expression into it's own
+ // match group, keeping track of the sequencing of those match groups
+ // is currently an exercise for the caller. :-)
+ function joinRe(regexps, separator) {
+ // backreferenceRe matches an open parenthesis or backreference. To avoid
+ // an incorrect parse, it additionally matches the following:
+ // - [...] elements, where the meaning of parentheses and escapes change
+ // - other escape sequences, so we do not misparse escape sequences as
+ // interesting elements
+ // - non-matching or lookahead parentheses, which do not capture. These
+ // follow the '(' with a '?'.
+ var backreferenceRe = /\[(?:[^\\\]]|\\.)*\]|\(\??|\\([1-9][0-9]*)|\\./;
+ var numCaptures = 0;
+ var ret = '';
+ for (var i = 0; i < regexps.length; i++) {
+ numCaptures += 1;
+ var offset = numCaptures;
+ var re = reStr(regexps[i]);
+ if (i > 0) {
+ ret += separator;
+ }
+ ret += "(";
+ while (re.length > 0) {
+ var match = backreferenceRe.exec(re);
+ if (match == null) {
+ ret += re;
+ break;
+ }
+ ret += re.substring(0, match.index);
+ re = re.substring(match.index + match[0].length);
+ if (match[0][0] == '\\' && match[1]) {
+ // Adjust the backreference.
+ ret += '\\' + String(Number(match[1]) + offset);
+ } else {
+ ret += match[0];
+ if (match[0] == '(') {
+ numCaptures++;
+ }
+ }
+ }
+ ret += ")";
+ }
+ return ret;
+ }
+
+ function buildModeRegex(mode) {
+
+ var matchIndexes = {};
+ var matcherRe;
+ var regexes = [];
+ var matcher = {};
+ var matchAt = 1;
+
+ function addRule(rule, regex) {
+ matchIndexes[matchAt] = rule;
+ regexes.push([rule, regex]);
+ matchAt += reCountMatchGroups(regex) + 1;
+ }
+
+ var term;
+ for (var i=0; i < mode.contains.length; i++) {
+ var re;
+ term = mode.contains[i];
+ if (term.beginKeywords) {
+ re = '\\.?(?:' + term.begin + ')\\.?';
+ } else {
+ re = term.begin;
+ }
+ addRule(term, re);
+ }
+ if (mode.terminator_end)
+ addRule("end", mode.terminator_end);
+ if (mode.illegal)
+ addRule("illegal", mode.illegal);
+
+ var terminators = regexes.map(function(el) { return el[1] });
+ matcherRe = langRe(joinRe(terminators, '|'), true);
+
+ matcher.lastIndex = 0;
+ matcher.exec = function(s) {
+ var rule;
+
+ if( regexes.length === 0) return null;
+
+ matcherRe.lastIndex = matcher.lastIndex;
+ var match = matcherRe.exec(s);
+ if (!match) { return null; }
+
+ for(var i = 0; i';
+
+ return openSpan + insideSpan + closeSpan;
+ }
+
+ function processKeywords() {
+ var keyword_match, last_index, match, result;
+
+ if (!top.keywords)
+ return escape(mode_buffer);
+
+ result = '';
+ last_index = 0;
+ top.lexemesRe.lastIndex = 0;
+ match = top.lexemesRe.exec(mode_buffer);
+
+ while (match) {
+ result += escape(mode_buffer.substring(last_index, match.index));
+ keyword_match = keywordMatch(top, match);
+ if (keyword_match) {
+ relevance += keyword_match[1];
+ result += buildSpan(keyword_match[0], escape(match[0]));
+ } else {
+ result += escape(match[0]);
+ }
+ last_index = top.lexemesRe.lastIndex;
+ match = top.lexemesRe.exec(mode_buffer);
+ }
+ return result + escape(mode_buffer.substr(last_index));
+ }
+
+ function processSubLanguage() {
+ var explicit = typeof top.subLanguage === 'string';
+ if (explicit && !languages[top.subLanguage]) {
+ return escape(mode_buffer);
+ }
+
+ var result = explicit ?
+ highlight(top.subLanguage, mode_buffer, true, continuations[top.subLanguage]) :
+ highlightAuto(mode_buffer, top.subLanguage.length ? top.subLanguage : undefined);
+
+ // Counting embedded language score towards the host language may be disabled
+ // with zeroing the containing mode relevance. Usecase in point is Markdown that
+ // allows XML everywhere and makes every XML snippet to have a much larger Markdown
+ // score.
+ if (top.relevance > 0) {
+ relevance += result.relevance;
+ }
+ if (explicit) {
+ continuations[top.subLanguage] = result.top;
+ }
+ return buildSpan(result.language, result.value, false, true);
+ }
+
+ function processBuffer() {
+ result += (top.subLanguage != null ? processSubLanguage() : processKeywords());
+ mode_buffer = '';
+ }
+
+ function startNewMode(mode) {
+ result += mode.className? buildSpan(mode.className, '', true): '';
+ top = Object.create(mode, {parent: {value: top}});
+ }
+
+
+ function doBeginMatch(match) {
+ var lexeme = match[0];
+ var new_mode = match.rule;
+
+ if (new_mode && new_mode.endSameAsBegin) {
+ new_mode.endRe = escapeRe( lexeme );
+ }
+
+ if (new_mode.skip) {
+ mode_buffer += lexeme;
+ } else {
+ if (new_mode.excludeBegin) {
+ mode_buffer += lexeme;
+ }
+ processBuffer();
+ if (!new_mode.returnBegin && !new_mode.excludeBegin) {
+ mode_buffer = lexeme;
+ }
+ }
+ startNewMode(new_mode, lexeme);
+ return new_mode.returnBegin ? 0 : lexeme.length;
+ }
+
+ function doEndMatch(match) {
+ var lexeme = match[0];
+ var end_mode = endOfMode(top, lexeme);
+ if (!end_mode) { return; }
+
+ var origin = top;
+ if (origin.skip) {
+ mode_buffer += lexeme;
+ } else {
+ if (!(origin.returnEnd || origin.excludeEnd)) {
+ mode_buffer += lexeme;
+ }
+ processBuffer();
+ if (origin.excludeEnd) {
+ mode_buffer = lexeme;
+ }
+ }
+ do {
+ if (top.className) {
+ result += spanEndTag;
+ }
+ if (!top.skip && !top.subLanguage) {
+ relevance += top.relevance;
+ }
+ top = top.parent;
+ } while (top !== end_mode.parent);
+ if (end_mode.starts) {
+ if (end_mode.endSameAsBegin) {
+ end_mode.starts.endRe = end_mode.endRe;
+ }
+ startNewMode(end_mode.starts, '');
+ }
+ return origin.returnEnd ? 0 : lexeme.length;
+ }
+
+ var lastMatch = {};
+ function processLexeme(text_before_match, match) {
+
+ var lexeme = match && match[0];
+
+ // add non-matched text to the current mode buffer
+ mode_buffer += text_before_match;
+
+ if (lexeme == null) {
+ processBuffer();
+ return 0;
+ }
+
+ // we've found a 0 width match and we're stuck, so we need to advance
+ // this happens when we have badly behaved rules that have optional matchers to the degree that
+ // sometimes they can end up matching nothing at all
+ // Ref: https://github.com/highlightjs/highlight.js/issues/2140
+ if (lastMatch.type=="begin" && match.type=="end" && lastMatch.index == match.index && lexeme === "") {
+ // spit the "skipped" character that our regex choked on back into the output sequence
+ mode_buffer += value.slice(match.index, match.index + 1)
+ return 1;
+ }
+ lastMatch = match;
+
+ if (match.type==="begin") {
+ return doBeginMatch(match);
+ } else if (match.type==="illegal" && !ignore_illegals) {
+ // illegal match, we do not continue processing
+ throw new Error('Illegal lexeme "' + lexeme + '" for mode "' + (top.className || '') + '"');
+ } else if (match.type==="end") {
+ var processed = doEndMatch(match);
+ if (processed != undefined)
+ return processed;
+ }
+
+ /*
+ Why might be find ourselves here? Only one occasion now. An end match that was
+ triggered but could not be completed. When might this happen? When an `endSameasBegin`
+ rule sets the end rule to a specific match. Since the overall mode termination rule that's
+ being used to scan the text isn't recompiled that means that any match that LOOKS like
+ the end (but is not, because it is not an exact match to the beginning) will
+ end up here. A definite end match, but when `doEndMatch` tries to "reapply"
+ the end rule and fails to match, we wind up here, and just silently ignore the end.
+
+ This causes no real harm other than stopping a few times too many.
+ */
+
+ mode_buffer += lexeme;
+ return lexeme.length;
+ }
+
+ var language = getLanguage(name);
+ if (!language) {
+ throw new Error('Unknown language: "' + name + '"');
+ }
+
+ compileLanguage(language);
+ var top = continuation || language;
+ var continuations = {}; // keep continuations for sub-languages
+ var result = '', current;
+ for(current = top; current !== language; current = current.parent) {
+ if (current.className) {
+ result = buildSpan(current.className, '', true) + result;
+ }
+ }
+ var mode_buffer = '';
+ var relevance = 0;
+ try {
+ var match, count, index = 0;
+ while (true) {
+ top.terminators.lastIndex = index;
+ match = top.terminators.exec(value);
+ if (!match)
+ break;
+ count = processLexeme(value.substring(index, match.index), match);
+ index = match.index + count;
+ }
+ processLexeme(value.substr(index));
+ for(current = top; current.parent; current = current.parent) { // close dangling modes
+ if (current.className) {
+ result += spanEndTag;
+ }
+ }
+ return {
+ relevance: relevance,
+ value: result,
+ illegal:false,
+ language: name,
+ top: top
+ };
+ } catch (e) {
+ if (e.message && e.message.indexOf('Illegal') !== -1) {
+ return {
+ illegal: true,
+ relevance: 0,
+ value: escape(value)
+ };
+ } else {
+ throw e;
+ }
+ }
+ }
+
+ /*
+ Highlighting with language detection. Accepts a string with the code to
+ highlight. Returns an object with the following properties:
+
+ - language (detected language)
+ - relevance (int)
+ - value (an HTML string with highlighting markup)
+ - second_best (object with the same structure for second-best heuristically
+ detected language, may be absent)
+
+ */
+ function highlightAuto(text, languageSubset) {
+ languageSubset = languageSubset || options.languages || objectKeys(languages);
+ var result = {
+ relevance: 0,
+ value: escape(text)
+ };
+ var second_best = result;
+ languageSubset.filter(getLanguage).filter(autoDetection).forEach(function(name) {
+ var current = highlight(name, text, false);
+ current.language = name;
+ if (current.relevance > second_best.relevance) {
+ second_best = current;
+ }
+ if (current.relevance > result.relevance) {
+ second_best = result;
+ result = current;
+ }
+ });
+ if (second_best.language) {
+ result.second_best = second_best;
+ }
+ return result;
+ }
+
+ /*
+ Post-processing of the highlighted markup:
+
+ - replace TABs with something more useful
+ - replace real line-breaks with ' ' for non-pre containers
+
+ */
+ function fixMarkup(value) {
+ return !(options.tabReplace || options.useBR)
+ ? value
+ : value.replace(fixMarkupRe, function(match, p1) {
+ if (options.useBR && match === '\n') {
+ return ' ';
+ } else if (options.tabReplace) {
+ return p1.replace(/\t/g, options.tabReplace);
+ }
+ return '';
+ });
+ }
+
+ function buildClassName(prevClassName, currentLang, resultLang) {
+ var language = currentLang ? aliases[currentLang] : resultLang,
+ result = [prevClassName.trim()];
+
+ if (!prevClassName.match(/\bhljs\b/)) {
+ result.push('hljs');
+ }
+
+ if (prevClassName.indexOf(language) === -1) {
+ result.push(language);
+ }
+
+ return result.join(' ').trim();
+ }
+
+ /*
+ Applies highlighting to a DOM node containing code. Accepts a DOM node and
+ two optional parameters for fixMarkup.
+ */
+ function highlightBlock(block) {
+ var node, originalStream, result, resultNode, text;
+ var language = blockLanguage(block);
+
+ if (isNotHighlighted(language))
+ return;
+
+ if (options.useBR) {
+ node = document.createElementNS('http://www.w3.org/1999/xhtml', 'div');
+ node.innerHTML = block.innerHTML.replace(/\n/g, '').replace(//g, '\n');
+ } else {
+ node = block;
+ }
+ text = node.textContent;
+ result = language ? highlight(language, text, true) : highlightAuto(text);
+
+ originalStream = nodeStream(node);
+ if (originalStream.length) {
+ resultNode = document.createElementNS('http://www.w3.org/1999/xhtml', 'div');
+ resultNode.innerHTML = result.value;
+ result.value = mergeStreams(originalStream, nodeStream(resultNode), text);
+ }
+ result.value = fixMarkup(result.value);
+
+ block.innerHTML = result.value;
+ block.className = buildClassName(block.className, language, result.language);
+ block.result = {
+ language: result.language,
+ re: result.relevance
+ };
+ if (result.second_best) {
+ block.second_best = {
+ language: result.second_best.language,
+ re: result.second_best.relevance
+ };
+ }
+ }
+
+ /*
+ Updates highlight.js global options with values passed in the form of an object.
+ */
+ function configure(user_options) {
+ options = inherit(options, user_options);
+ }
+
+ /*
+ Applies highlighting to all
..
blocks on a page.
+ */
+ function initHighlighting() {
+ if (initHighlighting.called)
+ return;
+ initHighlighting.called = true;
+
+ var blocks = document.querySelectorAll('pre code');
+ ArrayProto.forEach.call(blocks, highlightBlock);
+ }
+
+ /*
+ Attaches highlighting to the page load event.
+ */
+ function initHighlightingOnLoad() {
+ addEventListener('DOMContentLoaded', initHighlighting, false);
+ addEventListener('load', initHighlighting, false);
+ }
+
+ function registerLanguage(name, language) {
+ var lang = languages[name] = language(hljs);
+ restoreLanguageApi(lang);
+ lang.rawDefinition = language.bind(null,hljs);
+
+ if (lang.aliases) {
+ lang.aliases.forEach(function(alias) {aliases[alias] = name;});
+ }
+ }
+
+ function listLanguages() {
+ return objectKeys(languages);
+ }
+
+ function getLanguage(name) {
+ name = (name || '').toLowerCase();
+ return languages[name] || languages[aliases[name]];
+ }
+
+ function autoDetection(name) {
+ var lang = getLanguage(name);
+ return lang && !lang.disableAutodetect;
+ }
+
+ /* Interface definition */
+
+ hljs.highlight = highlight;
+ hljs.highlightAuto = highlightAuto;
+ hljs.fixMarkup = fixMarkup;
+ hljs.highlightBlock = highlightBlock;
+ hljs.configure = configure;
+ hljs.initHighlighting = initHighlighting;
+ hljs.initHighlightingOnLoad = initHighlightingOnLoad;
+ hljs.registerLanguage = registerLanguage;
+ hljs.listLanguages = listLanguages;
+ hljs.getLanguage = getLanguage;
+ hljs.autoDetection = autoDetection;
+ hljs.inherit = inherit;
+
+ // Common regexps
+ hljs.IDENT_RE = '[a-zA-Z]\\w*';
+ hljs.UNDERSCORE_IDENT_RE = '[a-zA-Z_]\\w*';
+ hljs.NUMBER_RE = '\\b\\d+(\\.\\d+)?';
+ hljs.C_NUMBER_RE = '(-?)(\\b0[xX][a-fA-F0-9]+|(\\b\\d+(\\.\\d*)?|\\.\\d+)([eE][-+]?\\d+)?)'; // 0x..., 0..., decimal, float
+ hljs.BINARY_NUMBER_RE = '\\b(0b[01]+)'; // 0b...
+ hljs.RE_STARTERS_RE = '!|!=|!==|%|%=|&|&&|&=|\\*|\\*=|\\+|\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\?|\\[|\\{|\\(|\\^|\\^=|\\||\\|=|\\|\\||~';
+
+ // Common modes
+ hljs.BACKSLASH_ESCAPE = {
+ begin: '\\\\[\\s\\S]', relevance: 0
+ };
+ hljs.APOS_STRING_MODE = {
+ className: 'string',
+ begin: '\'', end: '\'',
+ illegal: '\\n',
+ contains: [hljs.BACKSLASH_ESCAPE]
+ };
+ hljs.QUOTE_STRING_MODE = {
+ className: 'string',
+ begin: '"', end: '"',
+ illegal: '\\n',
+ contains: [hljs.BACKSLASH_ESCAPE]
+ };
+ hljs.PHRASAL_WORDS_MODE = {
+ begin: /\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\b/
+ };
+ hljs.COMMENT = function (begin, end, inherits) {
+ var mode = hljs.inherit(
+ {
+ className: 'comment',
+ begin: begin, end: end,
+ contains: []
+ },
+ inherits || {}
+ );
+ mode.contains.push(hljs.PHRASAL_WORDS_MODE);
+ mode.contains.push({
+ className: 'doctag',
+ begin: '(?:TODO|FIXME|NOTE|BUG|XXX):',
+ relevance: 0
+ });
+ return mode;
+ };
+ hljs.C_LINE_COMMENT_MODE = hljs.COMMENT('//', '$');
+ hljs.C_BLOCK_COMMENT_MODE = hljs.COMMENT('/\\*', '\\*/');
+ hljs.HASH_COMMENT_MODE = hljs.COMMENT('#', '$');
+ hljs.NUMBER_MODE = {
+ className: 'number',
+ begin: hljs.NUMBER_RE,
+ relevance: 0
+ };
+ hljs.C_NUMBER_MODE = {
+ className: 'number',
+ begin: hljs.C_NUMBER_RE,
+ relevance: 0
+ };
+ hljs.BINARY_NUMBER_MODE = {
+ className: 'number',
+ begin: hljs.BINARY_NUMBER_RE,
+ relevance: 0
+ };
+ hljs.CSS_NUMBER_MODE = {
+ className: 'number',
+ begin: hljs.NUMBER_RE + '(' +
+ '%|em|ex|ch|rem' +
+ '|vw|vh|vmin|vmax' +
+ '|cm|mm|in|pt|pc|px' +
+ '|deg|grad|rad|turn' +
+ '|s|ms' +
+ '|Hz|kHz' +
+ '|dpi|dpcm|dppx' +
+ ')?',
+ relevance: 0
+ };
+ hljs.REGEXP_MODE = {
+ className: 'regexp',
+ begin: /\//, end: /\/[gimuy]*/,
+ illegal: /\n/,
+ contains: [
+ hljs.BACKSLASH_ESCAPE,
+ {
+ begin: /\[/, end: /\]/,
+ relevance: 0,
+ contains: [hljs.BACKSLASH_ESCAPE]
+ }
+ ]
+ };
+ hljs.TITLE_MODE = {
+ className: 'title',
+ begin: hljs.IDENT_RE,
+ relevance: 0
+ };
+ hljs.UNDERSCORE_TITLE_MODE = {
+ className: 'title',
+ begin: hljs.UNDERSCORE_IDENT_RE,
+ relevance: 0
+ };
+ hljs.METHOD_GUARD = {
+ // excludes method names from keyword processing
+ begin: '\\.\\s*' + hljs.UNDERSCORE_IDENT_RE,
+ relevance: 0
+ };
+
+ return hljs;
+}));
+
+
/***/ }),
/***/ "./node_modules/is-buffer/index.js":
@@ -2178,6 +3496,1084 @@ module.exports = function isBuffer (obj) {
}
+/***/ }),
+
+/***/ "./node_modules/lowlight/lib/core.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lowlight/lib/core.js ***!
+ \*******************************************/
+/*! no static exports found */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+var high = __webpack_require__(/*! highlight.js/lib/highlight.js */ "./node_modules/highlight.js/lib/highlight.js")
+var fault = __webpack_require__(/*! fault */ "./node_modules/fault/index.js")
+
+// The lowlight interface, which has to be compatible with highlight.js, as
+// this object is passed to highlight.js syntaxes.
+
+function High() {}
+
+High.prototype = high
+
+// Expose.
+var low = new High() // Ha!
+
+module.exports = low
+
+low.highlight = highlight
+low.highlightAuto = autoHighlight
+low.registerLanguage = registerLanguage
+low.listLanguages = listLanguages
+low.registerAlias = registerAlias
+low.getLanguage = getLanguage
+
+var inherit = high.inherit
+var own = {}.hasOwnProperty
+
+var defaultPrefix = 'hljs-'
+var keyInsensitive = 'case_insensitive'
+var keyCachedVariants = 'cached_variants'
+var keyTerminatorEnd = 'terminator_end'
+var space = ' '
+var verticalBar = '|'
+var parenOpen = '('
+var parenClose = ')'
+var backslash = '\\'
+var commonKeywords = ['of', 'and', 'for', 'in', 'not', 'or', 'if', 'then']
+
+// Maps of syntaxes.
+var languageNames = []
+var languages = {}
+var aliases = {}
+
+// Highlighting with language detection.
+// Accepts a string with the code to highlight.
+// Returns an object with the following properties:
+//
+// * `language` — Detected language
+// * `relevance` — Integer
+// * `value` — HAST tree with highlighting markup
+// * `secondBest` — Object with the same structure for second-best
+// heuristically detected language, may be absent.
+function autoHighlight(value, options) {
+ var settings = options || {}
+ var subset = settings.subset || languageNames
+ var prefix = settings.prefix
+ var length = subset.length
+ var index = -1
+ var result
+ var secondBest
+ var current
+ var name
+
+ if (prefix === null || prefix === undefined) {
+ prefix = defaultPrefix
+ }
+
+ if (typeof value !== 'string') {
+ throw fault('Expected `string` for value, got `%s`', value)
+ }
+
+ secondBest = normalize({})
+ result = normalize({})
+
+ while (++index < length) {
+ name = subset[index]
+
+ if (!getLanguage(name)) {
+ continue
+ }
+
+ current = normalize(coreHighlight(name, value, false, prefix))
+
+ current.language = name
+
+ if (current.relevance > secondBest.relevance) {
+ secondBest = current
+ }
+
+ if (current.relevance > result.relevance) {
+ secondBest = result
+ result = current
+ }
+ }
+
+ if (secondBest.language) {
+ result.secondBest = secondBest
+ }
+
+ return result
+}
+
+// Highlighting `value` in the language `language`.
+function highlight(language, value, options) {
+ var settings = options || {}
+ var prefix = settings.prefix
+
+ if (prefix === null || prefix === undefined) {
+ prefix = defaultPrefix
+ }
+
+ return normalize(coreHighlight(language, value, true, prefix))
+}
+
+// Register a language.
+function registerLanguage(name, syntax) {
+ var lang = syntax(low)
+
+ lang.rawDefinition = syntax.bind(null, low)
+
+ languages[name] = lang
+
+ languageNames.push(name)
+
+ if (lang.aliases) {
+ registerAlias(name, lang.aliases)
+ }
+}
+
+// Get a list of all registered languages.
+function listLanguages() {
+ return languageNames.concat()
+}
+
+// Register more aliases for an already registered language.
+function registerAlias(name, alias) {
+ var map = name
+ var key
+ var list
+ var length
+ var index
+
+ if (alias) {
+ map = {}
+ map[name] = alias
+ }
+
+ for (key in map) {
+ list = map[key]
+ list = typeof list === 'string' ? [list] : list
+ length = list.length
+ index = -1
+
+ while (++index < length) {
+ aliases[list[index]] = key
+ }
+ }
+}
+
+// Core highlighting function.
+// Accepts a language name, or an alias, and a string with the code to
+// highlight.
+// eslint-disable-next-line max-params
+function coreHighlight(name, value, ignore, prefix, continuation) {
+ var lastMatch = {}
+ var continuations = {}
+ var stack = []
+ var modeBuffer = ''
+ var relevance = 0
+ var language
+ var top
+ var current
+ var currentChildren
+ var offset
+ var count
+ var match
+ var children
+
+ if (typeof name !== 'string') {
+ throw fault('Expected `string` for name, got `%s`', name)
+ }
+
+ if (typeof value !== 'string') {
+ throw fault('Expected `string` for value, got `%s`', value)
+ }
+
+ language = getLanguage(name)
+ top = continuation || language
+ children = []
+
+ current = top
+ currentChildren = children
+
+ if (!language) {
+ throw fault('Unknown language: `%s` is not registered', name)
+ }
+
+ compileLanguage(language)
+
+ try {
+ top.terminators.lastIndex = 0
+ offset = 0
+ match = top.terminators.exec(value)
+
+ while (match) {
+ count = processLexeme(value.slice(offset, match.index), match)
+ offset = match.index + count
+ top.terminators.lastIndex = offset
+ match = top.terminators.exec(value)
+ }
+
+ processLexeme(value.slice(offset))
+ current = top
+
+ while (current.parent) {
+ if (current.className) {
+ pop()
+ }
+
+ current = current.parent
+ }
+
+ return {
+ relevance: relevance,
+ value: currentChildren,
+ illegal: false,
+ language: name,
+ top: top
+ }
+ } catch (error) {
+ /* istanbul ignore if - Catch-all */
+ if (error.message.indexOf('Illegal') === -1) {
+ throw error
+ }
+
+ return {relevance: 0, illegal: true, value: addText(value, [])}
+ }
+
+ function escapeRe(value) {
+ return new RegExp(value.replace(/[-/\\^$*+?.()|[\]{}]/g, '\\$&'), 'm')
+ }
+
+ function doBeginMatch(match) {
+ var lexeme = match[0]
+ var newMode = match.rule
+
+ if (newMode && newMode.endSameAsBegin) {
+ newMode.endRe = escapeRe(lexeme)
+ }
+
+ if (newMode.skip) {
+ modeBuffer += lexeme
+ } else {
+ if (newMode.excludeBegin) {
+ modeBuffer += lexeme
+ }
+
+ addSiblings(processBuffer(), currentChildren)
+
+ if (!newMode.returnBegin && !newMode.excludeBegin) {
+ modeBuffer = lexeme
+ }
+ }
+
+ startNewMode(newMode)
+
+ return newMode.returnBegin ? 0 : lexeme.length
+ }
+
+ function doEndMatch(match) {
+ var lexeme = match[0]
+ var matchPlusRemainder = value.slice(match.index)
+ var endMode = endOfMode(top, matchPlusRemainder)
+
+ if (!endMode) {
+ return
+ }
+
+ var origin = top
+
+ if (origin.skip) {
+ modeBuffer += lexeme
+ } else {
+ if (!(origin.returnEnd || origin.excludeEnd)) {
+ modeBuffer += lexeme
+ }
+
+ addSiblings(processBuffer(), currentChildren)
+
+ if (origin.excludeEnd) {
+ modeBuffer = lexeme
+ }
+ }
+
+ do {
+ if (top.className) {
+ pop()
+ }
+
+ if (!top.skip && !top.subLanguage) {
+ relevance += top.relevance
+ }
+
+ top = top.parent
+ } while (top !== endMode.parent)
+
+ if (endMode.starts) {
+ /* istanbul ignore if - hljs 9.16 added support for this but didn’t use it yet. */
+ if (endMode.endSameAsBegin) {
+ endMode.starts.endRe = endMode.endRe
+ }
+
+ startNewMode(endMode.starts)
+ }
+
+ return origin.returnEnd ? 0 : lexeme.length
+ }
+
+ function processLexeme(textBeforeMatch, match) {
+ var lexeme = match && match[0]
+ var processed
+
+ // Add non-matched text to the current mode buffer
+ modeBuffer += textBeforeMatch
+
+ if (lexeme === undefined) {
+ addSiblings(processBuffer(), currentChildren)
+ return 0
+ }
+
+ // We've found a 0 width match and we're stuck, so we need to advance
+ // this happens when we have badly behaved rules that have optional matchers to the degree that
+ // sometimes they can end up matching nothing at all
+ // Ref: https://github.com/highlightjs/highlight.js/issues/2140
+ /* istanbul ignore if - Unknown what this fixes or which case fixes it */
+ if (
+ lastMatch.type === 'begin' &&
+ match.type === 'end' &&
+ lastMatch.index === match.index &&
+ lexeme === ''
+ ) {
+ // Spit the “skipped” character that our regex choked on back into the output sequence
+ modeBuffer += value.slice(match.index, match.index + 1)
+ return 1
+ }
+
+ lastMatch = match
+
+ if (match.type === 'begin') {
+ return doBeginMatch(match)
+ }
+
+ if (match.type === 'end') {
+ processed = doEndMatch(match)
+
+ if (processed !== undefined) {
+ return processed
+ }
+ }
+
+ if (match.type === 'illegal' && !ignore) {
+ // Illegal match, we do not continue processing
+ throw fault(
+ 'Illegal lexeme "%s" for mode "%s"',
+ lexeme,
+ top.className || ''
+ )
+ }
+
+ // Why might be find ourselves here?
+ // Only one occasion now.
+ // An end match that was triggered but could not be completed.
+ // When might this happen?
+ // When an `endSameasBegin` rule sets the end rule to a specific match.
+ // Since the overall mode termination rule that’s being used to scan the
+ // text isn’t recompiled that means that any match that LOOKS like the end
+ // (but is not, because it is not an exact match to the beginning) will end
+ // up here.
+ // A definite end match, but when `doEndMatch` tries to “reapply” the end
+ // rule and fails to match, we wind up here, and just silently ignore the
+ // end.
+ // This causes no real harm other than stopping a few times too many.
+ modeBuffer += lexeme
+
+ return lexeme.length
+ }
+
+ // Start a new mode with a `lexeme` to process.
+ function startNewMode(mode) {
+ var node
+
+ if (mode.className) {
+ node = build(mode.className, [])
+ }
+
+ // Enter a new mode.
+ if (node) {
+ currentChildren.push(node)
+ stack.push(currentChildren)
+ currentChildren = node.children
+ }
+
+ top = Object.create(mode, {parent: {value: top}})
+ }
+
+ // Process the buffer.
+ function processBuffer() {
+ var result = top.subLanguage ? processSubLanguage() : processKeywords()
+ modeBuffer = ''
+ return result
+ }
+
+ // Process a sublanguage (returns a list of nodes).
+ function processSubLanguage() {
+ var explicit = typeof top.subLanguage === 'string'
+ var subvalue
+
+ /* istanbul ignore if - support non-loaded sublanguages */
+ if (explicit && !languages[top.subLanguage]) {
+ return addText(modeBuffer, [])
+ }
+
+ if (explicit) {
+ subvalue = coreHighlight(
+ top.subLanguage,
+ modeBuffer,
+ true,
+ prefix,
+ continuations[top.subLanguage]
+ )
+ } else {
+ subvalue = autoHighlight(modeBuffer, {
+ subset: top.subLanguage.length === 0 ? undefined : top.subLanguage,
+ prefix: prefix
+ })
+ }
+
+ // If we couldn’t highlight, for example because the requests subset isn’t
+ // loaded, return a text node.
+ if (!subvalue.language) {
+ return [buildText(modeBuffer)]
+ }
+
+ // Counting embedded language score towards the host language may be
+ // disabled with zeroing the containing mode relevance.
+ // Usecase in point is Markdown that allows XML everywhere and makes every
+ // XML snippet to have a much larger Markdown score.
+ if (top.relevance > 0) {
+ relevance += subvalue.relevance
+ }
+
+ if (explicit) {
+ continuations[top.subLanguage] = subvalue.top
+ }
+
+ return [build(subvalue.language, subvalue.value, true)]
+ }
+
+ // Process keywords. Returns nodes.
+ function processKeywords() {
+ var nodes = []
+ var lastIndex
+ var keyword
+ var node
+ var submatch
+
+ if (!top.keywords) {
+ return addText(modeBuffer, nodes)
+ }
+
+ lastIndex = 0
+
+ top.lexemesRe.lastIndex = 0
+
+ keyword = top.lexemesRe.exec(modeBuffer)
+
+ while (keyword) {
+ addText(modeBuffer.slice(lastIndex, keyword.index), nodes)
+
+ submatch = keywordMatch(top, keyword)
+
+ if (submatch) {
+ relevance += submatch[1]
+
+ node = build(submatch[0], [])
+
+ nodes.push(node)
+
+ addText(keyword[0], node.children)
+ } else {
+ addText(keyword[0], nodes)
+ }
+
+ lastIndex = top.lexemesRe.lastIndex
+ keyword = top.lexemesRe.exec(modeBuffer)
+ }
+
+ addText(modeBuffer.slice(lastIndex), nodes)
+
+ return nodes
+ }
+
+ // Add siblings.
+ function addSiblings(siblings, nodes) {
+ var length = siblings.length
+ var index = -1
+ var sibling
+
+ while (++index < length) {
+ sibling = siblings[index]
+
+ if (sibling.type === 'text') {
+ addText(sibling.value, nodes)
+ } else {
+ nodes.push(sibling)
+ }
+ }
+ }
+
+ // Add a text.
+ function addText(value, nodes) {
+ var tail
+
+ if (value) {
+ tail = nodes[nodes.length - 1]
+
+ if (tail && tail.type === 'text') {
+ tail.value += value
+ } else {
+ nodes.push(buildText(value))
+ }
+ }
+
+ return nodes
+ }
+
+ // Build a text.
+ function buildText(value) {
+ return {type: 'text', value: value}
+ }
+
+ // Build a span.
+ function build(name, contents, noPrefix) {
+ return {
+ type: 'element',
+ tagName: 'span',
+ properties: {
+ className: [(noPrefix ? '' : prefix) + name]
+ },
+ children: contents
+ }
+ }
+
+ // Check if the first word in `keywords` is a keyword.
+ function keywordMatch(mode, keywords) {
+ var keyword = keywords[0]
+
+ if (language[keyInsensitive]) {
+ keyword = keyword.toLowerCase()
+ }
+
+ return own.call(mode.keywords, keyword) && mode.keywords[keyword]
+ }
+
+ // Check if `lexeme` ends `mode`.
+ function endOfMode(mode, lexeme) {
+ if (test(mode.endRe, lexeme)) {
+ while (mode.endsParent && mode.parent) {
+ mode = mode.parent
+ }
+
+ return mode
+ }
+
+ if (mode.endsWithParent) {
+ return endOfMode(mode.parent, lexeme)
+ }
+ }
+
+ // Exit the current context.
+ function pop() {
+ /* istanbul ignore next - removed in hljs 9.3 */
+ currentChildren = stack.pop() || children
+ }
+}
+
+// Compile a language.
+function compileLanguage(language) {
+ compileMode(language)
+
+ // Compile a language mode, optionally with a parent.
+ function compileMode(mode, parent) {
+ if (mode.compiled) {
+ return
+ }
+
+ mode.compiled = true
+
+ mode.keywords = mode.keywords || mode.beginKeywords
+
+ if (mode.keywords) {
+ mode.keywords = compileKeywords(mode.keywords, language[keyInsensitive])
+ }
+
+ mode.lexemesRe = langRe(mode.lexemes || /\w+/, true)
+
+ if (parent) {
+ if (mode.beginKeywords) {
+ mode.begin =
+ '\\b(' + mode.beginKeywords.split(space).join(verticalBar) + ')\\b'
+ }
+
+ if (!mode.begin) {
+ mode.begin = /\B|\b/
+ }
+
+ mode.beginRe = langRe(mode.begin)
+
+ if (mode.endSameAsBegin) {
+ mode.end = mode.begin
+ }
+
+ if (!mode.end && !mode.endsWithParent) {
+ mode.end = /\B|\b/
+ }
+
+ if (mode.end) {
+ mode.endRe = langRe(mode.end)
+ }
+
+ mode[keyTerminatorEnd] = source(mode.end) || ''
+
+ if (mode.endsWithParent && parent[keyTerminatorEnd]) {
+ mode[keyTerminatorEnd] +=
+ (mode.end ? verticalBar : '') + parent[keyTerminatorEnd]
+ }
+ }
+
+ if (mode.illegal) {
+ mode.illegalRe = langRe(mode.illegal)
+ }
+
+ if (mode.relevance === undefined) {
+ mode.relevance = 1
+ }
+
+ mode.contains = compileContains(mode.contains || [], mode)
+
+ if (mode.starts) {
+ compileMode(mode.starts, parent)
+ }
+
+ mode.terminators = buildModeRegex(mode)
+ }
+
+ function compileContains(contains, mode) {
+ var result = []
+ var length = contains.length
+ var index = -1
+ var contained
+
+ while (++index < length) {
+ contained = contains[index]
+ result = result.concat(
+ expandOrCloneMode(contained === 'self' ? mode : contained)
+ )
+ }
+
+ length = result.length
+ index = -1
+
+ while (++index < length) {
+ compileMode(result[index], mode)
+ }
+
+ return result
+ }
+
+ function buildModeRegex(mode) {
+ var indices = {}
+ var expression
+ var regexes = []
+ var matcher = {}
+ var matchAt = 1
+ var term
+ var values = mode.contains
+ var length = values.length
+ var index = -1
+ var terminators = []
+
+ while (++index < length) {
+ term = values[index]
+
+ addRule(
+ term,
+ term.beginKeywords ? '\\.?(?:' + term.begin + ')\\.?' : term.begin
+ )
+ }
+
+ if (mode[keyTerminatorEnd]) {
+ addRule('end', mode[keyTerminatorEnd])
+ }
+
+ if (mode.illegal) {
+ addRule('illegal', mode.illegal)
+ }
+
+ length = regexes.length
+ index = -1
+
+ while (++index < length) {
+ terminators[index] = regexes[index][1]
+ }
+
+ expression = langRe(joinRe(terminators, verticalBar), true)
+
+ matcher = {lastIndex: 0, exec: exec}
+
+ return matcher
+
+ function exec(value) {
+ var length
+ var index
+ var rule
+ var match
+ var submatch
+
+ if (regexes.length === 0) return null
+
+ expression.lastIndex = matcher.lastIndex
+ match = expression.exec(value)
+
+ if (!match) {
+ return null
+ }
+
+ length = match.length
+ index = -1
+
+ while (++index < length) {
+ submatch = match[index]
+
+ if (submatch !== undefined && indices[index] !== undefined) {
+ rule = indices[index]
+ break
+ }
+ }
+
+ // Illegal or end match
+ if (typeof rule === 'string') {
+ match.type = rule
+ match.extra = [mode.illegal, mode.terminator_end]
+ } else {
+ match.type = 'begin'
+ match.rule = rule
+ }
+
+ return match
+ }
+
+ function addRule(rule, regex) {
+ indices[matchAt] = rule
+ regexes.push([rule, regex])
+ matchAt += new RegExp(regex.toString() + verticalBar).exec('').length
+ }
+ }
+
+ function joinRe(regexes, separator) {
+ var backreferenceRe = /\[(?:[^\\\]]|\\.)*\]|\(\??|\\([1-9]\d*)|\\./
+ var captures = 0
+ var result = ''
+ var length = regexes.length
+ var index = -1
+ var regex
+ var offset
+ var expression
+ var match
+
+ while (++index < length) {
+ regex = regexes[index]
+ expression = source(regex)
+ captures += 1
+ offset = captures
+
+ if (index !== 0) {
+ result += separator
+ }
+
+ result += parenOpen
+
+ while (expression.length > 0) {
+ match = backreferenceRe.exec(expression)
+
+ if (match === null) {
+ result += expression
+ break
+ }
+
+ result += expression.slice(0, match.index)
+ expression = expression.slice(match.index + match[0].length)
+
+ if (match[0][0] === backslash && match[1]) {
+ // Adjust the backreference.
+ result += backslash + String(Number(match[1]) + offset)
+ } else {
+ result += match[0]
+
+ if (match[0] === parenOpen) {
+ captures++
+ }
+ }
+ }
+
+ result += parenClose
+ }
+
+ return result
+ }
+
+ // Create a regex for `value`.
+ function langRe(value, global) {
+ return new RegExp(
+ source(value),
+ 'm' + (language[keyInsensitive] ? 'i' : '') + (global ? 'g' : '')
+ )
+ }
+
+ // Get the source of an expression or string.
+ function source(re) {
+ return (re && re.source) || re
+ }
+}
+
+function compileKeywords(values, caseInsensitive) {
+ var compiled = {}
+ var key
+
+ if (typeof values === 'string') {
+ flatten('keyword', values)
+ } else {
+ for (key in values) {
+ flatten(key, values[key])
+ }
+ }
+
+ return compiled
+
+ function flatten(key, value) {
+ var val = caseInsensitive ? value.toLowerCase() : value
+ all(key, val.split(space))
+ }
+
+ function all(key, values) {
+ var length = values.length
+ var index = -1
+ var pair
+
+ while (++index < length) {
+ pair = values[index].split(verticalBar)
+ compiled[pair[0]] = [key, Number(pair[1]) || common(pair[0]) ? 0 : 1]
+ }
+ }
+}
+
+function common(value) {
+ return commonKeywords.indexOf(value.toLowerCase()) !== -1
+}
+
+function expandOrCloneMode(mode) {
+ var length
+ var index
+ var variants
+ var result
+
+ if (mode.variants && !mode[keyCachedVariants]) {
+ variants = mode.variants
+ length = variants.length
+ index = -1
+ result = []
+
+ while (++index < length) {
+ result[index] = inherit(mode, {variants: null}, variants[index])
+ }
+
+ mode[keyCachedVariants] = result
+ }
+
+ // Expand.
+ if (mode.cached_variants) return mode.cached_variants
+
+ // Clone.
+ if (dependencyOnParent(mode))
+ return [inherit(mode, {starts: mode.starts ? inherit(mode.starts) : null})]
+
+ return [mode]
+}
+
+function dependencyOnParent(mode) {
+ return mode ? mode.endsWithParent || dependencyOnParent(mode.starts) : false
+}
+
+// Normalize a syntax result.
+function normalize(result) {
+ return {
+ relevance: result.relevance || 0,
+ language: result.language || null,
+ value: result.value || []
+ }
+}
+
+// Check if `expression` matches `lexeme`.
+function test(expression, lexeme) {
+ var match = expression && expression.exec(lexeme)
+ return match && match.index === 0
+}
+
+// Get a language by `name`.
+function getLanguage(name) {
+ name = name.toLowerCase()
+
+ return languages[name] || languages[aliases[name]]
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/orderedmap/index.es.js":
+/*!*********************************************!*\
+ !*** ./node_modules/orderedmap/index.es.js ***!
+ \*********************************************/
+/*! exports provided: default */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+// ::- Persistent data structure representing an ordered mapping from
+// strings to values, with some convenient update methods.
+function OrderedMap(content) {
+ this.content = content;
+}
+
+OrderedMap.prototype = {
+ constructor: OrderedMap,
+
+ find: function(key) {
+ for (var i = 0; i < this.content.length; i += 2)
+ if (this.content[i] === key) return i
+ return -1
+ },
+
+ // :: (string) → ?any
+ // Retrieve the value stored under `key`, or return undefined when
+ // no such key exists.
+ get: function(key) {
+ var found = this.find(key);
+ return found == -1 ? undefined : this.content[found + 1]
+ },
+
+ // :: (string, any, ?string) → OrderedMap
+ // Create a new map by replacing the value of `key` with a new
+ // value, or adding a binding to the end of the map. If `newKey` is
+ // given, the key of the binding will be replaced with that key.
+ update: function(key, value, newKey) {
+ var self = newKey && newKey != key ? this.remove(newKey) : this;
+ var found = self.find(key), content = self.content.slice();
+ if (found == -1) {
+ content.push(newKey || key, value);
+ } else {
+ content[found + 1] = value;
+ if (newKey) content[found] = newKey;
+ }
+ return new OrderedMap(content)
+ },
+
+ // :: (string) → OrderedMap
+ // Return a map with the given key removed, if it existed.
+ remove: function(key) {
+ var found = this.find(key);
+ if (found == -1) return this
+ var content = this.content.slice();
+ content.splice(found, 2);
+ return new OrderedMap(content)
+ },
+
+ // :: (string, any) → OrderedMap
+ // Add a new key to the start of the map.
+ addToStart: function(key, value) {
+ return new OrderedMap([key, value].concat(this.remove(key).content))
+ },
+
+ // :: (string, any) → OrderedMap
+ // Add a new key to the end of the map.
+ addToEnd: function(key, value) {
+ var content = this.remove(key).content.slice();
+ content.push(key, value);
+ return new OrderedMap(content)
+ },
+
+ // :: (string, string, any) → OrderedMap
+ // Add a key after the given key. If `place` is not found, the new
+ // key is added to the end.
+ addBefore: function(place, key, value) {
+ var without = this.remove(key), content = without.content.slice();
+ var found = without.find(place);
+ content.splice(found == -1 ? content.length : found, 0, key, value);
+ return new OrderedMap(content)
+ },
+
+ // :: ((key: string, value: any))
+ // Call the given function for each key/value pair in the map, in
+ // order.
+ forEach: function(f) {
+ for (var i = 0; i < this.content.length; i += 2)
+ f(this.content[i], this.content[i + 1]);
+ },
+
+ // :: (union) → OrderedMap
+ // Create a new map by prepending the keys in this map that don't
+ // appear in `map` before the keys in `map`.
+ prepend: function(map) {
+ map = OrderedMap.from(map);
+ if (!map.size) return this
+ return new OrderedMap(map.content.concat(this.subtract(map).content))
+ },
+
+ // :: (union) → OrderedMap
+ // Create a new map by appending the keys in this map that don't
+ // appear in `map` after the keys in `map`.
+ append: function(map) {
+ map = OrderedMap.from(map);
+ if (!map.size) return this
+ return new OrderedMap(this.subtract(map).content.concat(map.content))
+ },
+
+ // :: (union) → OrderedMap
+ // Create a map containing all the keys in this map that don't
+ // appear in `map`.
+ subtract: function(map) {
+ var result = this;
+ map = OrderedMap.from(map);
+ for (var i = 0; i < map.content.length; i += 2)
+ result = result.remove(map.content[i]);
+ return result
+ },
+
+ // :: number
+ // The amount of keys in this map.
+ get size() {
+ return this.content.length >> 1
+ }
+};
+
+// :: (?union) → OrderedMap
+// Return a map with the given content. If null, create an empty
+// map. If given an ordered map, return that map itself. If given an
+// object, create a map from the object's properties.
+OrderedMap.from = function(value) {
+ if (value instanceof OrderedMap) return value
+ var content = [];
+ if (value) for (var prop in value) content.push(prop, value[prop]);
+ return new OrderedMap(content)
+};
+
+var orderedmap = OrderedMap;
+
+/* harmony default export */ __webpack_exports__["default"] = (orderedmap);
+
+
/***/ }),
/***/ "./node_modules/process/browser.js":
@@ -2373,6 +4769,18257 @@ process.chdir = function (dir) {
process.umask = function() { return 0; };
+/***/ }),
+
+/***/ "./node_modules/prosemirror-collab/dist/index.es.js":
+/*!**********************************************************!*\
+ !*** ./node_modules/prosemirror-collab/dist/index.es.js ***!
+ \**********************************************************/
+/*! exports provided: collab, getVersion, rebaseSteps, receiveTransaction, sendableSteps */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "collab", function() { return collab; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "getVersion", function() { return getVersion; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "rebaseSteps", function() { return rebaseSteps; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "receiveTransaction", function() { return receiveTransaction; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "sendableSteps", function() { return sendableSteps; });
+/* harmony import */ var prosemirror_state__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+
+
+var Rebaseable = function Rebaseable(step, inverted, origin) {
+ this.step = step;
+ this.inverted = inverted;
+ this.origin = origin;
+};
+
+// : ([Rebaseable], [Step], Transform) → [Rebaseable]
+// Undo a given set of steps, apply a set of other steps, and then
+// redo them.
+function rebaseSteps(steps, over, transform) {
+ for (var i = steps.length - 1; i >= 0; i--) { transform.step(steps[i].inverted); }
+ for (var i$1 = 0; i$1 < over.length; i$1++) { transform.step(over[i$1]); }
+ var result = [];
+ for (var i$2 = 0, mapFrom = steps.length; i$2 < steps.length; i$2++) {
+ var mapped = steps[i$2].step.map(transform.mapping.slice(mapFrom));
+ mapFrom--;
+ if (mapped && !transform.maybeStep(mapped).failed) {
+ transform.mapping.setMirror(mapFrom, transform.steps.length - 1);
+ result.push(new Rebaseable(mapped, mapped.invert(transform.docs[transform.docs.length - 1]), steps[i$2].origin));
+ }
+ }
+ return result
+}
+
+// This state field accumulates changes that have to be sent to the
+// central authority in the collaborating group and makes it possible
+// to integrate changes made by peers into our local document. It is
+// defined by the plugin, and will be available as the `collab` field
+// in the resulting editor state.
+var CollabState = function CollabState(version, unconfirmed) {
+ // : number
+ // The version number of the last update received from the central
+ // authority. Starts at 0 or the value of the `version` property
+ // in the option object, for the editor's value when the option
+ // was enabled.
+ this.version = version;
+
+ // : [Rebaseable]
+ // The local steps that havent been successfully sent to the
+ // server yet.
+ this.unconfirmed = unconfirmed;
+};
+
+function unconfirmedFrom(transform) {
+ var result = [];
+ for (var i = 0; i < transform.steps.length; i++)
+ { result.push(new Rebaseable(transform.steps[i],
+ transform.steps[i].invert(transform.docs[i]),
+ transform)); }
+ return result
+}
+
+var collabKey = new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["PluginKey"]("collab");
+
+// :: (?Object) → Plugin
+//
+// Creates a plugin that enables the collaborative editing framework
+// for the editor.
+//
+// config::- An optional set of options
+//
+// version:: ?number
+// The starting version number of the collaborative editing.
+// Defaults to 0.
+//
+// clientID:: ?union
+// This client's ID, used to distinguish its changes from those of
+// other clients. Defaults to a random 32-bit number.
+function collab(config) {
+ if ( config === void 0 ) config = {};
+
+ config = {version: config.version || 0,
+ clientID: config.clientID == null ? Math.floor(Math.random() * 0xFFFFFFFF) : config.clientID};
+
+ return new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Plugin"]({
+ key: collabKey,
+
+ state: {
+ init: function () { return new CollabState(config.version, []); },
+ apply: function apply(tr, collab) {
+ var newState = tr.getMeta(collabKey);
+ if (newState)
+ { return newState }
+ if (tr.docChanged)
+ { return new CollabState(collab.version, collab.unconfirmed.concat(unconfirmedFrom(tr))) }
+ return collab
+ }
+ },
+
+ config: config,
+ // This is used to notify the history plugin to not merge steps,
+ // so that the history can be rebased.
+ historyPreserveItems: true
+ })
+}
+
+// :: (state: EditorState, steps: [Step], clientIDs: [union], options: ?Object) → Transaction
+// Create a transaction that represents a set of new steps received from
+// the authority. Applying this transaction moves the state forward to
+// adjust to the authority's view of the document.
+//
+// options::- Additional options.
+//
+// mapSelectionBackward:: ?boolean
+// When enabled (the default is `false`), if the current selection
+// is a [text selection](#state.TextSelection), its sides are
+// mapped with a negative bias for this transaction, so that
+// content inserted at the cursor ends up after the cursor. Users
+// usually prefer this, but it isn't done by default for reasons
+// of backwards compatibility.
+function receiveTransaction(state, steps, clientIDs, options) {
+ // Pushes a set of steps (received from the central authority) into
+ // the editor state (which should have the collab plugin enabled).
+ // Will recognize its own changes, and confirm unconfirmed steps as
+ // appropriate. Remaining unconfirmed steps will be rebased over
+ // remote steps.
+ var collabState = collabKey.getState(state);
+ var version = collabState.version + steps.length;
+ var ourID = collabKey.get(state).spec.config.clientID;
+
+ // Find out which prefix of the steps originated with us
+ var ours = 0;
+ while (ours < clientIDs.length && clientIDs[ours] == ourID) { ++ours; }
+ var unconfirmed = collabState.unconfirmed.slice(ours);
+ steps = ours ? steps.slice(ours) : steps;
+
+ // If all steps originated with us, we're done.
+ if (!steps.length)
+ { return state.tr.setMeta(collabKey, new CollabState(version, unconfirmed)) }
+
+ var nUnconfirmed = unconfirmed.length;
+ var tr = state.tr;
+ if (nUnconfirmed) {
+ unconfirmed = rebaseSteps(unconfirmed, steps, tr);
+ } else {
+ for (var i = 0; i < steps.length; i++) { tr.step(steps[i]); }
+ unconfirmed = [];
+ }
+
+ var newCollabState = new CollabState(version, unconfirmed);
+ if (options && options.mapSelectionBackward && state.selection instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"]) {
+ tr.setSelection(prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"].between(tr.doc.resolve(tr.mapping.map(state.selection.anchor, -1)),
+ tr.doc.resolve(tr.mapping.map(state.selection.head, -1)), -1));
+ tr.updated &= ~1;
+ }
+ return tr.setMeta("rebased", nUnconfirmed).setMeta("addToHistory", false).setMeta(collabKey, newCollabState)
+}
+
+// :: (state: EditorState) → ?{version: number, steps: [Step], clientID: union, origins: [Transaction]}
+// Provides data describing the editor's unconfirmed steps, which need
+// to be sent to the central authority. Returns null when there is
+// nothing to send.
+//
+// `origins` holds the _original_ transactions that produced each
+// steps. This can be useful for looking up time stamps and other
+// metadata for the steps, but note that the steps may have been
+// rebased, whereas the origin transactions are still the old,
+// unchanged objects.
+function sendableSteps(state) {
+ var collabState = collabKey.getState(state);
+ if (collabState.unconfirmed.length == 0) { return null }
+ return {
+ version: collabState.version,
+ steps: collabState.unconfirmed.map(function (s) { return s.step; }),
+ clientID: collabKey.get(state).spec.config.clientID,
+ get origins() { return this._origins || (this._origins = collabState.unconfirmed.map(function (s) { return s.origin; })) }
+ }
+}
+
+// :: (EditorState) → number
+// Get the version up to which the collab plugin has synced with the
+// central authority.
+function getVersion(state) {
+ return collabKey.getState(state).version
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-commands/dist/index.es.js":
+/*!************************************************************!*\
+ !*** ./node_modules/prosemirror-commands/dist/index.es.js ***!
+ \************************************************************/
+/*! exports provided: autoJoin, baseKeymap, chainCommands, createParagraphNear, deleteSelection, exitCode, joinBackward, joinDown, joinForward, joinUp, lift, liftEmptyBlock, macBaseKeymap, newlineInCode, pcBaseKeymap, selectAll, selectNodeBackward, selectNodeForward, selectParentNode, setBlockType, splitBlock, splitBlockKeepMarks, toggleMark, wrapIn */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "autoJoin", function() { return autoJoin; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "baseKeymap", function() { return baseKeymap; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "chainCommands", function() { return chainCommands; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "createParagraphNear", function() { return createParagraphNear; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "deleteSelection", function() { return deleteSelection; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "exitCode", function() { return exitCode; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "joinBackward", function() { return joinBackward; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "joinDown", function() { return joinDown; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "joinForward", function() { return joinForward; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "joinUp", function() { return joinUp; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "lift", function() { return lift; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "liftEmptyBlock", function() { return liftEmptyBlock; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "macBaseKeymap", function() { return macBaseKeymap; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "newlineInCode", function() { return newlineInCode; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "pcBaseKeymap", function() { return pcBaseKeymap; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "selectAll", function() { return selectAll; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "selectNodeBackward", function() { return selectNodeBackward; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "selectNodeForward", function() { return selectNodeForward; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "selectParentNode", function() { return selectParentNode; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "setBlockType", function() { return setBlockType; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "splitBlock", function() { return splitBlock; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "splitBlockKeepMarks", function() { return splitBlockKeepMarks; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toggleMark", function() { return toggleMark; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "wrapIn", function() { return wrapIn; });
+/* harmony import */ var prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-transform */ "./node_modules/prosemirror-transform/dist/index.es.js");
+/* harmony import */ var prosemirror_model__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-model */ "./node_modules/prosemirror-model/dist/index.es.js");
+/* harmony import */ var prosemirror_state__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+
+
+
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Delete the selection, if there is one.
+function deleteSelection(state, dispatch) {
+ if (state.selection.empty) { return false }
+ if (dispatch) { dispatch(state.tr.deleteSelection().scrollIntoView()); }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
+// If the selection is empty and at the start of a textblock, try to
+// reduce the distance between that block and the one before it—if
+// there's a block directly before it that can be joined, join them.
+// If not, try to move the selected block closer to the next one in
+// the document structure by lifting it out of its parent or moving it
+// into a parent of the previous block. Will use the view for accurate
+// (bidi-aware) start-of-textblock detection if given.
+function joinBackward(state, dispatch, view) {
+ var ref = state.selection;
+ var $cursor = ref.$cursor;
+ if (!$cursor || (view ? !view.endOfTextblock("backward", state)
+ : $cursor.parentOffset > 0))
+ { return false }
+
+ var $cut = findCutBefore($cursor);
+
+ // If there is no node before this, try to lift
+ if (!$cut) {
+ var range = $cursor.blockRange(), target = range && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["liftTarget"])(range);
+ if (target == null) { return false }
+ if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
+ return true
+ }
+
+ var before = $cut.nodeBefore;
+ // Apply the joining algorithm
+ if (!before.type.spec.isolating && deleteBarrier(state, $cut, dispatch))
+ { return true }
+
+ // If the node below has no content and the node above is
+ // selectable, delete the node below and select the one above.
+ if ($cursor.parent.content.size == 0 &&
+ (textblockAt(before, "end") || prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].isSelectable(before))) {
+ if (dispatch) {
+ var tr = state.tr.deleteRange($cursor.before(), $cursor.after());
+ tr.setSelection(textblockAt(before, "end") ? prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["Selection"].findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1)
+ : prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].create(tr.doc, $cut.pos - before.nodeSize));
+ dispatch(tr.scrollIntoView());
+ }
+ return true
+ }
+
+ // If the node before is an atom, delete it
+ if (before.isAtom && $cut.depth == $cursor.depth - 1) {
+ if (dispatch) { dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView()); }
+ return true
+ }
+
+ return false
+}
+
+function textblockAt(node, side) {
+ for (; node; node = (side == "start" ? node.firstChild : node.lastChild))
+ { if (node.isTextblock) { return true } }
+ return false
+}
+
+// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
+// When the selection is empty and at the start of a textblock, select
+// the node before that textblock, if possible. This is intended to be
+// bound to keys like backspace, after
+// [`joinBackward`](#commands.joinBackward) or other deleting
+// commands, as a fall-back behavior when the schema doesn't allow
+// deletion at the selected point.
+function selectNodeBackward(state, dispatch, view) {
+ var ref = state.selection;
+ var $cursor = ref.$cursor;
+ if (!$cursor || (view ? !view.endOfTextblock("backward", state)
+ : $cursor.parentOffset > 0))
+ { return false }
+
+ var $cut = findCutBefore($cursor), node = $cut && $cut.nodeBefore;
+ if (!node || !prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].isSelectable(node)) { return false }
+ if (dispatch)
+ { dispatch(state.tr.setSelection(prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView()); }
+ return true
+}
+
+function findCutBefore($pos) {
+ if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {
+ if ($pos.index(i) > 0) { return $pos.doc.resolve($pos.before(i + 1)) }
+ if ($pos.node(i).type.spec.isolating) { break }
+ } }
+ return null
+}
+
+// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
+// If the selection is empty and the cursor is at the end of a
+// textblock, try to reduce or remove the boundary between that block
+// and the one after it, either by joining them or by moving the other
+// block closer to this one in the tree structure. Will use the view
+// for accurate start-of-textblock detection if given.
+function joinForward(state, dispatch, view) {
+ var ref = state.selection;
+ var $cursor = ref.$cursor;
+ if (!$cursor || (view ? !view.endOfTextblock("forward", state)
+ : $cursor.parentOffset < $cursor.parent.content.size))
+ { return false }
+
+ var $cut = findCutAfter($cursor);
+
+ // If there is no node after this, there's nothing to do
+ if (!$cut) { return false }
+
+ var after = $cut.nodeAfter;
+ // Try the joining algorithm
+ if (deleteBarrier(state, $cut, dispatch)) { return true }
+
+ // If the node above has no content and the node below is
+ // selectable, delete the node above and select the one below.
+ if ($cursor.parent.content.size == 0 &&
+ (textblockAt(after, "start") || prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].isSelectable(after))) {
+ if (dispatch) {
+ var tr = state.tr.deleteRange($cursor.before(), $cursor.after());
+ tr.setSelection(textblockAt(after, "start") ? prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["Selection"].findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1)
+ : prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].create(tr.doc, tr.mapping.map($cut.pos)));
+ dispatch(tr.scrollIntoView());
+ }
+ return true
+ }
+
+ // If the next node is an atom, delete it
+ if (after.isAtom && $cut.depth == $cursor.depth - 1) {
+ if (dispatch) { dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView()); }
+ return true
+ }
+
+ return false
+}
+
+// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
+// When the selection is empty and at the end of a textblock, select
+// the node coming after that textblock, if possible. This is intended
+// to be bound to keys like delete, after
+// [`joinForward`](#commands.joinForward) and similar deleting
+// commands, to provide a fall-back behavior when the schema doesn't
+// allow deletion at the selected point.
+function selectNodeForward(state, dispatch, view) {
+ var ref = state.selection;
+ var $cursor = ref.$cursor;
+ if (!$cursor || (view ? !view.endOfTextblock("forward", state)
+ : $cursor.parentOffset < $cursor.parent.content.size))
+ { return false }
+
+ var $cut = findCutAfter($cursor), node = $cut && $cut.nodeAfter;
+ if (!node || !prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].isSelectable(node)) { return false }
+ if (dispatch)
+ { dispatch(state.tr.setSelection(prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].create(state.doc, $cut.pos)).scrollIntoView()); }
+ return true
+}
+
+function findCutAfter($pos) {
+ if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {
+ var parent = $pos.node(i);
+ if ($pos.index(i) + 1 < parent.childCount) { return $pos.doc.resolve($pos.after(i + 1)) }
+ if (parent.type.spec.isolating) { break }
+ } }
+ return null
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Join the selected block or, if there is a text selection, the
+// closest ancestor block of the selection that can be joined, with
+// the sibling above it.
+function joinUp(state, dispatch) {
+ var sel = state.selection, nodeSel = sel instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"], point;
+ if (nodeSel) {
+ if (sel.node.isTextblock || !Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canJoin"])(state.doc, sel.from)) { return false }
+ point = sel.from;
+ } else {
+ point = Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["joinPoint"])(state.doc, sel.from, -1);
+ if (point == null) { return false }
+ }
+ if (dispatch) {
+ var tr = state.tr.join(point);
+ if (nodeSel) { tr.setSelection(prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize)); }
+ dispatch(tr.scrollIntoView());
+ }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Join the selected block, or the closest ancestor of the selection
+// that can be joined, with the sibling after it.
+function joinDown(state, dispatch) {
+ var sel = state.selection, point;
+ if (sel instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"]) {
+ if (sel.node.isTextblock || !Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canJoin"])(state.doc, sel.to)) { return false }
+ point = sel.to;
+ } else {
+ point = Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["joinPoint"])(state.doc, sel.to, 1);
+ if (point == null) { return false }
+ }
+ if (dispatch)
+ { dispatch(state.tr.join(point).scrollIntoView()); }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Lift the selected block, or the closest ancestor block of the
+// selection that can be lifted, out of its parent node.
+function lift(state, dispatch) {
+ var ref = state.selection;
+ var $from = ref.$from;
+ var $to = ref.$to;
+ var range = $from.blockRange($to), target = range && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["liftTarget"])(range);
+ if (target == null) { return false }
+ if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// If the selection is in a node whose type has a truthy
+// [`code`](#model.NodeSpec.code) property in its spec, replace the
+// selection with a newline character.
+function newlineInCode(state, dispatch) {
+ var ref = state.selection;
+ var $head = ref.$head;
+ var $anchor = ref.$anchor;
+ if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }
+ if (dispatch) { dispatch(state.tr.insertText("\n").scrollIntoView()); }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// When the selection is in a node with a truthy
+// [`code`](#model.NodeSpec.code) property in its spec, create a
+// default block after the code block, and move the cursor there.
+function exitCode(state, dispatch) {
+ var ref = state.selection;
+ var $head = ref.$head;
+ var $anchor = ref.$anchor;
+ if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }
+ var above = $head.node(-1), after = $head.indexAfter(-1), type = above.contentMatchAt(after).defaultType;
+ if (!above.canReplaceWith(after, after, type)) { return false }
+ if (dispatch) {
+ var pos = $head.after(), tr = state.tr.replaceWith(pos, pos, type.createAndFill());
+ tr.setSelection(prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["Selection"].near(tr.doc.resolve(pos), 1));
+ dispatch(tr.scrollIntoView());
+ }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// If a block node is selected, create an empty paragraph before (if
+// it is its parent's first child) or after it.
+function createParagraphNear(state, dispatch) {
+ var ref = state.selection;
+ var $from = ref.$from;
+ var $to = ref.$to;
+ if ($from.parent.inlineContent || $to.parent.inlineContent) { return false }
+ var type = $from.parent.contentMatchAt($to.indexAfter()).defaultType;
+ if (!type || !type.isTextblock) { return false }
+ if (dispatch) {
+ var side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;
+ var tr = state.tr.insert(side, type.createAndFill());
+ tr.setSelection(prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["TextSelection"].create(tr.doc, side + 1));
+ dispatch(tr.scrollIntoView());
+ }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// If the cursor is in an empty textblock that can be lifted, lift the
+// block.
+function liftEmptyBlock(state, dispatch) {
+ var ref = state.selection;
+ var $cursor = ref.$cursor;
+ if (!$cursor || $cursor.parent.content.size) { return false }
+ if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {
+ var before = $cursor.before();
+ if (Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canSplit"])(state.doc, before)) {
+ if (dispatch) { dispatch(state.tr.split(before).scrollIntoView()); }
+ return true
+ }
+ }
+ var range = $cursor.blockRange(), target = range && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["liftTarget"])(range);
+ if (target == null) { return false }
+ if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Split the parent block of the selection. If the selection is a text
+// selection, also delete its content.
+function splitBlock(state, dispatch) {
+ var ref = state.selection;
+ var $from = ref.$from;
+ var $to = ref.$to;
+ if (state.selection instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"] && state.selection.node.isBlock) {
+ if (!$from.parentOffset || !Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canSplit"])(state.doc, $from.pos)) { return false }
+ if (dispatch) { dispatch(state.tr.split($from.pos).scrollIntoView()); }
+ return true
+ }
+
+ if (!$from.parent.isBlock) { return false }
+
+ if (dispatch) {
+ var atEnd = $to.parentOffset == $to.parent.content.size;
+ var tr = state.tr;
+ if (state.selection instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["TextSelection"]) { tr.deleteSelection(); }
+ var deflt = $from.depth == 0 ? null : $from.node(-1).contentMatchAt($from.indexAfter(-1)).defaultType;
+ var types = atEnd && deflt ? [{type: deflt}] : null;
+ var can = Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canSplit"])(tr.doc, tr.mapping.map($from.pos), 1, types);
+ if (!types && !can && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canSplit"])(tr.doc, tr.mapping.map($from.pos), 1, deflt && [{type: deflt}])) {
+ types = [{type: deflt}];
+ can = true;
+ }
+ if (can) {
+ tr.split(tr.mapping.map($from.pos), 1, types);
+ if (!atEnd && !$from.parentOffset && $from.parent.type != deflt &&
+ $from.node(-1).canReplace($from.index(-1), $from.indexAfter(-1), prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(deflt.create(), $from.parent)))
+ { tr.setNodeMarkup(tr.mapping.map($from.before()), deflt); }
+ }
+ dispatch(tr.scrollIntoView());
+ }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Acts like [`splitBlock`](#commands.splitBlock), but without
+// resetting the set of active marks at the cursor.
+function splitBlockKeepMarks(state, dispatch) {
+ return splitBlock(state, dispatch && (function (tr) {
+ var marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());
+ if (marks) { tr.ensureMarks(marks); }
+ dispatch(tr);
+ }))
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Move the selection to the node wrapping the current selection, if
+// any. (Will not select the document node.)
+function selectParentNode(state, dispatch) {
+ var ref = state.selection;
+ var $from = ref.$from;
+ var to = ref.to;
+ var pos;
+ var same = $from.sharedDepth(to);
+ if (same == 0) { return false }
+ pos = $from.before(same);
+ if (dispatch) { dispatch(state.tr.setSelection(prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["NodeSelection"].create(state.doc, pos))); }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Select the whole document.
+function selectAll(state, dispatch) {
+ if (dispatch) { dispatch(state.tr.setSelection(new prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["AllSelection"](state.doc))); }
+ return true
+}
+
+function joinMaybeClear(state, $pos, dispatch) {
+ var before = $pos.nodeBefore, after = $pos.nodeAfter, index = $pos.index();
+ if (!before || !after || !before.type.compatibleContent(after.type)) { return false }
+ if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {
+ if (dispatch) { dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView()); }
+ return true
+ }
+ if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canJoin"])(state.doc, $pos.pos)))
+ { return false }
+ if (dispatch)
+ { dispatch(state.tr
+ .clearIncompatible($pos.pos, before.type, before.contentMatchAt(before.childCount))
+ .join($pos.pos)
+ .scrollIntoView()); }
+ return true
+}
+
+function deleteBarrier(state, $cut, dispatch) {
+ var before = $cut.nodeBefore, after = $cut.nodeAfter, conn, match;
+ if (before.type.spec.isolating || after.type.spec.isolating) { return false }
+ if (joinMaybeClear(state, $cut, dispatch)) { return true }
+
+ if ($cut.parent.canReplace($cut.index(), $cut.index() + 1) &&
+ (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) &&
+ match.matchType(conn[0] || after.type).validEnd) {
+ if (dispatch) {
+ var end = $cut.pos + after.nodeSize, wrap = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty;
+ for (var i = conn.length - 1; i >= 0; i--)
+ { wrap = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(conn[i].create(null, wrap)); }
+ wrap = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(before.copy(wrap));
+ var tr = state.tr.step(new prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["ReplaceAroundStep"]($cut.pos - 1, end, $cut.pos, end, new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](wrap, 1, 0), conn.length, true));
+ var joinAt = end + 2 * conn.length;
+ if (Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canJoin"])(tr.doc, joinAt)) { tr.join(joinAt); }
+ dispatch(tr.scrollIntoView());
+ }
+ return true
+ }
+
+ var selAfter = prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["Selection"].findFrom($cut, 1);
+ var range = selAfter && selAfter.$from.blockRange(selAfter.$to), target = range && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["liftTarget"])(range);
+ if (target != null && target >= $cut.depth) {
+ if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
+ return true
+ }
+
+ return false
+}
+
+// Parameterized commands
+
+// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
+// Wrap the selection in a node of the given type with the given
+// attributes.
+function wrapIn(nodeType, attrs) {
+ return function(state, dispatch) {
+ var ref = state.selection;
+ var $from = ref.$from;
+ var $to = ref.$to;
+ var range = $from.blockRange($to), wrapping = range && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["findWrapping"])(range, nodeType, attrs);
+ if (!wrapping) { return false }
+ if (dispatch) { dispatch(state.tr.wrap(range, wrapping).scrollIntoView()); }
+ return true
+ }
+}
+
+// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
+// Returns a command that tries to set the selected textblocks to the
+// given node type with the given attributes.
+function setBlockType(nodeType, attrs) {
+ return function(state, dispatch) {
+ var ref = state.selection;
+ var from = ref.from;
+ var to = ref.to;
+ var applicable = false;
+ state.doc.nodesBetween(from, to, function (node, pos) {
+ if (applicable) { return false }
+ if (!node.isTextblock || node.hasMarkup(nodeType, attrs)) { return }
+ if (node.type == nodeType) {
+ applicable = true;
+ } else {
+ var $pos = state.doc.resolve(pos), index = $pos.index();
+ applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);
+ }
+ });
+ if (!applicable) { return false }
+ if (dispatch) { dispatch(state.tr.setBlockType(from, to, nodeType, attrs).scrollIntoView()); }
+ return true
+ }
+}
+
+function markApplies(doc, ranges, type) {
+ var loop = function ( i ) {
+ var ref = ranges[i];
+ var $from = ref.$from;
+ var $to = ref.$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);
+ });
+ if (can) { return { v: true } }
+ };
+
+ for (var i = 0; i < ranges.length; i++) {
+ var returned = loop( i );
+
+ if ( returned ) return returned.v;
+ }
+ return false
+}
+
+// :: (MarkType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
+// Create a command function that toggles the given mark with the
+// given attributes. Will return `false` when the current selection
+// doesn't support that mark. This will remove the mark if any marks
+// of that type exist in the selection, or add it otherwise. If the
+// selection is empty, this applies to the [stored
+// marks](#state.EditorState.storedMarks) instead of a range of the
+// document.
+function toggleMark(markType, attrs) {
+ return function(state, dispatch) {
+ var ref = state.selection;
+ var empty = ref.empty;
+ var $cursor = ref.$cursor;
+ var ranges = ref.ranges;
+ if ((empty && !$cursor) || !markApplies(state.doc, ranges, markType)) { return false }
+ if (dispatch) {
+ if ($cursor) {
+ if (markType.isInSet(state.storedMarks || $cursor.marks()))
+ { dispatch(state.tr.removeStoredMark(markType)); }
+ else
+ { dispatch(state.tr.addStoredMark(markType.create(attrs))); }
+ } else {
+ var has = false, tr = state.tr;
+ for (var i = 0; !has && i < ranges.length; i++) {
+ var ref$1 = ranges[i];
+ var $from = ref$1.$from;
+ var $to = ref$1.$to;
+ has = state.doc.rangeHasMark($from.pos, $to.pos, markType);
+ }
+ for (var i$1 = 0; i$1 < ranges.length; i$1++) {
+ var ref$2 = ranges[i$1];
+ var $from$1 = ref$2.$from;
+ var $to$1 = ref$2.$to;
+ if (has) { tr.removeMark($from$1.pos, $to$1.pos, markType); }
+ else { tr.addMark($from$1.pos, $to$1.pos, markType.create(attrs)); }
+ }
+ dispatch(tr.scrollIntoView());
+ }
+ }
+ return true
+ }
+}
+
+function wrapDispatchForJoin(dispatch, isJoinable) {
+ return function (tr) {
+ if (!tr.isGeneric) { return dispatch(tr) }
+
+ 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 i$1 = 0; i$1 < ranges.length; i$1 += 2) {
+ var from = ranges[i$1], to = ranges[i$1 + 1];
+ var $from = tr.doc.resolve(from), depth = $from.sharedDepth(to), 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 i$2 = joinable.length - 1; i$2 >= 0; i$2--) {
+ if (Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canJoin"])(tr.doc, joinable[i$2])) { tr.join(joinable[i$2]); }
+ }
+ dispatch(tr);
+ }
+}
+
+// :: ((state: EditorState, ?(tr: Transaction)) → bool, union<(before: Node, after: Node) → bool, [string]>) → (state: EditorState, ?(tr: Transaction)) → bool
+// Wrap a command so that, when it produces a transform that causes
+// two joinable nodes to end up next to each other, those are joined.
+// Nodes are considered joinable when they are of the same type and
+// when the `isJoinable` predicate returns true for them or, if an
+// array of strings was passed, if their node type name is in that
+// array.
+function autoJoin(command, isJoinable) {
+ if (Array.isArray(isJoinable)) {
+ var types = isJoinable;
+ isJoinable = function (node) { return types.indexOf(node.type.name) > -1; };
+ }
+ return function (state, dispatch) { return command(state, dispatch && wrapDispatchForJoin(dispatch, isJoinable)); }
+}
+
+// :: (...[(EditorState, ?(tr: Transaction), ?EditorView) → bool]) → (EditorState, ?(tr: Transaction), ?EditorView) → bool
+// Combine a number of command functions into a single function (which
+// calls them one by one until one returns true).
+function chainCommands() {
+ var commands = [], len = arguments.length;
+ while ( len-- ) commands[ len ] = arguments[ len ];
+
+ return function(state, dispatch, view) {
+ for (var i = 0; i < commands.length; i++)
+ { if (commands[i](state, dispatch, view)) { return true } }
+ return false
+ }
+}
+
+var backspace = chainCommands(deleteSelection, joinBackward, selectNodeBackward);
+var del = chainCommands(deleteSelection, joinForward, selectNodeForward);
+
+// :: Object
+// A basic keymap containing bindings not specific to any schema.
+// Binds the following keys (when multiple commands are listed, they
+// are chained with [`chainCommands`](#commands.chainCommands)):
+//
+// * **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`
+// * **Mod-Enter** to `exitCode`
+// * **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`
+// * **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
+// * **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
+// * **Mod-a** to `selectAll`
+var pcBaseKeymap = {
+ "Enter": chainCommands(newlineInCode, createParagraphNear, liftEmptyBlock, splitBlock),
+ "Mod-Enter": exitCode,
+ "Backspace": backspace,
+ "Mod-Backspace": backspace,
+ "Delete": del,
+ "Mod-Delete": del,
+ "Mod-a": selectAll
+};
+
+// :: Object
+// A copy of `pcBaseKeymap` that also binds **Ctrl-h** like Backspace,
+// **Ctrl-d** like Delete, **Alt-Backspace** like Ctrl-Backspace, and
+// **Ctrl-Alt-Backspace**, **Alt-Delete**, and **Alt-d** like
+// Ctrl-Delete.
+var macBaseKeymap = {
+ "Ctrl-h": pcBaseKeymap["Backspace"],
+ "Alt-Backspace": pcBaseKeymap["Mod-Backspace"],
+ "Ctrl-d": pcBaseKeymap["Delete"],
+ "Ctrl-Alt-Backspace": pcBaseKeymap["Mod-Delete"],
+ "Alt-Delete": pcBaseKeymap["Mod-Delete"],
+ "Alt-d": pcBaseKeymap["Mod-Delete"]
+};
+for (var key in pcBaseKeymap) { macBaseKeymap[key] = pcBaseKeymap[key]; }
+
+// declare global: os, navigator
+var mac = typeof navigator != "undefined" ? /Mac/.test(navigator.platform)
+ : typeof os != "undefined" ? os.platform() == "darwin" : false;
+
+// :: Object
+// Depending on the detected platform, this will hold
+// [`pcBasekeymap`](#commands.pcBaseKeymap) or
+// [`macBaseKeymap`](#commands.macBaseKeymap).
+var baseKeymap = mac ? macBaseKeymap : pcBaseKeymap;
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-dropcursor/dist/index.es.js":
+/*!**************************************************************!*\
+ !*** ./node_modules/prosemirror-dropcursor/dist/index.es.js ***!
+ \**************************************************************/
+/*! exports provided: dropCursor */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "dropCursor", function() { return dropCursor; });
+/* harmony import */ var prosemirror_state__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+/* harmony import */ var prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-transform */ "./node_modules/prosemirror-transform/dist/index.es.js");
+
+
+
+// :: (options: ?Object) → Plugin
+// Create a plugin that, when added to a ProseMirror instance,
+// causes a decoration to show up at the drop position when something
+// is dragged over the editor.
+//
+// options::- These options are supported:
+//
+// color:: ?string
+// The color of the cursor. Defaults to `black`.
+//
+// width:: ?number
+// The precise width of the cursor in pixels. Defaults to 1.
+//
+// class:: ?string
+// A CSS class name to add to the cursor element.
+function dropCursor(options) {
+ if ( options === void 0 ) options = {};
+
+ return new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Plugin"]({
+ view: function view(editorView) { return new DropCursorView(editorView, options) }
+ })
+}
+
+var DropCursorView = function DropCursorView(editorView, options) {
+ var this$1 = this;
+
+ this.editorView = editorView;
+ this.width = options.width || 1;
+ this.color = options.color || "black";
+ this.class = options.class;
+ this.cursorPos = null;
+ this.element = null;
+ this.timeout = null;
+
+ this.handlers = ["dragover", "dragend", "drop", "dragleave"].map(function (name) {
+ var handler = function (e) { return this$1[name](e); };
+ editorView.dom.addEventListener(name, handler);
+ return {name: name, handler: handler}
+ });
+};
+
+DropCursorView.prototype.destroy = function destroy () {
+ var this$1 = this;
+
+ this.handlers.forEach(function (ref) {
+ var name = ref.name;
+ var handler = ref.handler;
+
+ return this$1.editorView.dom.removeEventListener(name, handler);
+ });
+};
+
+DropCursorView.prototype.update = function update (editorView, prevState) {
+ if (this.cursorPos != null && prevState.doc != editorView.state.doc) { this.updateOverlay(); }
+};
+
+DropCursorView.prototype.setCursor = function setCursor (pos) {
+ if (pos == this.cursorPos) { return }
+ this.cursorPos = pos;
+ if (pos == null) {
+ this.element.parentNode.removeChild(this.element);
+ this.element = null;
+ } else {
+ this.updateOverlay();
+ }
+};
+
+DropCursorView.prototype.updateOverlay = function updateOverlay () {
+ var $pos = this.editorView.state.doc.resolve(this.cursorPos), rect;
+ if (!$pos.parent.inlineContent) {
+ var before = $pos.nodeBefore, after = $pos.nodeAfter;
+ if (before || after) {
+ var nodeRect = this.editorView.nodeDOM(this.cursorPos - (before ?before.nodeSize : 0)).getBoundingClientRect();
+ var top = before ? nodeRect.bottom : nodeRect.top;
+ if (before && after)
+ { top = (top + this.editorView.nodeDOM(this.cursorPos).getBoundingClientRect().top) / 2; }
+ rect = {left: nodeRect.left, right: nodeRect.right, top: top - this.width / 2, bottom: top + this.width / 2};
+ }
+ }
+ if (!rect) {
+ var coords = this.editorView.coordsAtPos(this.cursorPos);
+ rect = {left: coords.left - this.width / 2, right: coords.left + this.width / 2, top: coords.top, bottom: coords.bottom};
+ }
+
+ var parent = this.editorView.dom.offsetParent;
+ if (!this.element) {
+ this.element = parent.appendChild(document.createElement("div"));
+ if (this.class) { this.element.className = this.class; }
+ this.element.style.cssText = "position: absolute; z-index: 50; pointer-events: none; background-color: " + this.color;
+ }
+ var parentRect = !parent || parent == document.body && getComputedStyle(parent).position == "static"
+ ? {left: -pageXOffset, top: -pageYOffset} : parent.getBoundingClientRect();
+ this.element.style.left = (rect.left - parentRect.left) + "px";
+ this.element.style.top = (rect.top - parentRect.top) + "px";
+ this.element.style.width = (rect.right - rect.left) + "px";
+ this.element.style.height = (rect.bottom - rect.top) + "px";
+};
+
+DropCursorView.prototype.scheduleRemoval = function scheduleRemoval (timeout) {
+ var this$1 = this;
+
+ clearTimeout(this.timeout);
+ this.timeout = setTimeout(function () { return this$1.setCursor(null); }, timeout);
+};
+
+DropCursorView.prototype.dragover = function dragover (event) {
+ if (!this.editorView.editable) { return }
+ var pos = this.editorView.posAtCoords({left: event.clientX, top: event.clientY});
+ if (pos) {
+ var target = pos.pos;
+ if (this.editorView.dragging && this.editorView.dragging.slice) {
+ target = Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__["dropPoint"])(this.editorView.state.doc, target, this.editorView.dragging.slice);
+ if (target == null) { target = pos.pos; }
+ }
+ this.setCursor(target);
+ this.scheduleRemoval(5000);
+ }
+};
+
+DropCursorView.prototype.dragend = function dragend () {
+ this.scheduleRemoval(20);
+};
+
+DropCursorView.prototype.drop = function drop () {
+ this.scheduleRemoval(20);
+};
+
+DropCursorView.prototype.dragleave = function dragleave (event) {
+ if (event.target == this.editorView.dom || !this.editorView.dom.contains(event.relatedTarget))
+ { this.setCursor(null); }
+};
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-gapcursor/dist/index.es.js":
+/*!*************************************************************!*\
+ !*** ./node_modules/prosemirror-gapcursor/dist/index.es.js ***!
+ \*************************************************************/
+/*! exports provided: GapCursor, gapCursor */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "GapCursor", function() { return GapCursor; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "gapCursor", function() { return gapCursor; });
+/* harmony import */ var prosemirror_keymap__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-keymap */ "./node_modules/prosemirror-keymap/dist/index.es.js");
+/* harmony import */ var prosemirror_state__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+/* harmony import */ var prosemirror_view__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prosemirror-view */ "./node_modules/prosemirror-view/dist/index.es.js");
+/* harmony import */ var prosemirror_model__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! prosemirror-model */ "./node_modules/prosemirror-model/dist/index.es.js");
+
+
+
+
+
+// ::- Gap cursor selections are represented using this class. Its
+// `$anchor` and `$head` properties both point at the cursor position.
+var GapCursor = /*@__PURE__*/(function (Selection) {
+ function GapCursor($pos) {
+ Selection.call(this, $pos, $pos);
+ }
+
+ if ( Selection ) GapCursor.__proto__ = Selection;
+ GapCursor.prototype = Object.create( Selection && Selection.prototype );
+ GapCursor.prototype.constructor = GapCursor;
+
+ GapCursor.prototype.map = function map (doc, mapping) {
+ var $pos = doc.resolve(mapping.map(this.head));
+ return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos)
+ };
+
+ GapCursor.prototype.content = function content () { return prosemirror_model__WEBPACK_IMPORTED_MODULE_3__["Slice"].empty };
+
+ GapCursor.prototype.eq = function eq (other) {
+ return other instanceof GapCursor && other.head == this.head
+ };
+
+ GapCursor.prototype.toJSON = function toJSON () {
+ return {type: "gapcursor", pos: this.head}
+ };
+
+ GapCursor.fromJSON = function fromJSON (doc, json) {
+ if (typeof json.pos != "number") { throw new RangeError("Invalid input for GapCursor.fromJSON") }
+ return new GapCursor(doc.resolve(json.pos))
+ };
+
+ GapCursor.prototype.getBookmark = function getBookmark () { return new GapBookmark(this.anchor) };
+
+ GapCursor.valid = function valid ($pos) {
+ var parent = $pos.parent;
+ if (parent.isTextblock || !closedBefore($pos) || !closedAfter($pos)) { return false }
+ var override = parent.type.spec.allowGapCursor;
+ if (override != null) { return override }
+ var deflt = parent.contentMatchAt($pos.index()).defaultType;
+ return deflt && deflt.isTextblock
+ };
+
+ GapCursor.findFrom = function findFrom ($pos, dir, mustMove) {
+ if (!mustMove && GapCursor.valid($pos)) { return $pos }
+
+ var pos = $pos.pos, next = null;
+ // Scan up from this position
+ for (var d = $pos.depth;; d--) {
+ var parent = $pos.node(d);
+ if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {
+ next = parent.maybeChild(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1);
+ break
+ } else if (d == 0) {
+ return null
+ }
+ pos += dir;
+ var $cur = $pos.doc.resolve(pos);
+ if (GapCursor.valid($cur)) { return $cur }
+ }
+
+ // And then down into the next node
+ for (;;) {
+ next = dir > 0 ? next.firstChild : next.lastChild;
+ if (!next) { break }
+ pos += dir;
+ var $cur$1 = $pos.doc.resolve(pos);
+ if (GapCursor.valid($cur$1)) { return $cur$1 }
+ }
+
+ return null
+ };
+
+ return GapCursor;
+}(prosemirror_state__WEBPACK_IMPORTED_MODULE_1__["Selection"]));
+
+GapCursor.prototype.visible = false;
+
+prosemirror_state__WEBPACK_IMPORTED_MODULE_1__["Selection"].jsonID("gapcursor", GapCursor);
+
+var GapBookmark = function GapBookmark(pos) {
+ this.pos = pos;
+};
+GapBookmark.prototype.map = function map (mapping) {
+ return new GapBookmark(mapping.map(this.pos))
+};
+GapBookmark.prototype.resolve = function resolve (doc) {
+ var $pos = doc.resolve(this.pos);
+ return GapCursor.valid($pos) ? new GapCursor($pos) : prosemirror_state__WEBPACK_IMPORTED_MODULE_1__["Selection"].near($pos)
+};
+
+function closedBefore($pos) {
+ for (var d = $pos.depth; d >= 0; d--) {
+ var index = $pos.index(d);
+ // At the start of this parent, look at next one
+ if (index == 0) { continue }
+ // See if the node before (or its first ancestor) is closed
+ for (var before = $pos.node(d).child(index - 1);; before = before.lastChild) {
+ if ((before.childCount == 0 && !before.inlineContent) || before.isAtom || before.type.spec.isolating) { return true }
+ if (before.inlineContent) { return false }
+ }
+ }
+ // Hit start of document
+ return true
+}
+
+function closedAfter($pos) {
+ for (var d = $pos.depth; d >= 0; d--) {
+ var index = $pos.indexAfter(d), parent = $pos.node(d);
+ if (index == parent.childCount) { continue }
+ for (var after = parent.child(index);; after = after.firstChild) {
+ if ((after.childCount == 0 && !after.inlineContent) || after.isAtom || after.type.spec.isolating) { return true }
+ if (after.inlineContent) { return false }
+ }
+ }
+ return true
+}
+
+// :: () → Plugin
+// Create a gap cursor plugin. When enabled, this will capture clicks
+// near and arrow-key-motion past places that don't have a normally
+// selectable position nearby, and create a gap cursor selection for
+// them. The cursor is drawn as an element with class
+// `ProseMirror-gapcursor`. You can either include
+// `style/gapcursor.css` from the package's directory or add your own
+// styles to make it visible.
+var gapCursor = function() {
+ return new prosemirror_state__WEBPACK_IMPORTED_MODULE_1__["Plugin"]({
+ props: {
+ decorations: drawGapCursor,
+
+ createSelectionBetween: function createSelectionBetween(_view, $anchor, $head) {
+ if ($anchor.pos == $head.pos && GapCursor.valid($head)) { return new GapCursor($head) }
+ },
+
+ handleClick: handleClick,
+ handleKeyDown: handleKeyDown
+ }
+ })
+};
+
+var handleKeyDown = Object(prosemirror_keymap__WEBPACK_IMPORTED_MODULE_0__["keydownHandler"])({
+ "ArrowLeft": arrow("horiz", -1),
+ "ArrowRight": arrow("horiz", 1),
+ "ArrowUp": arrow("vert", -1),
+ "ArrowDown": arrow("vert", 1)
+});
+
+function arrow(axis, dir) {
+ var dirStr = axis == "vert" ? (dir > 0 ? "down" : "up") : (dir > 0 ? "right" : "left");
+ return function(state, dispatch, view) {
+ var sel = state.selection;
+ var $start = dir > 0 ? sel.$to : sel.$from, mustMove = sel.empty;
+ if (sel instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_1__["TextSelection"]) {
+ if (!view.endOfTextblock(dirStr)) { return false }
+ mustMove = false;
+ $start = state.doc.resolve(dir > 0 ? $start.after() : $start.before());
+ }
+ var $found = GapCursor.findFrom($start, dir, mustMove);
+ if (!$found) { return false }
+ if (dispatch) { dispatch(state.tr.setSelection(new GapCursor($found))); }
+ return true
+ }
+}
+
+function handleClick(view, pos, event) {
+ if (!view.editable) { return false }
+ var $pos = view.state.doc.resolve(pos);
+ if (!GapCursor.valid($pos)) { return false }
+ var ref = view.posAtCoords({left: event.clientX, top: event.clientY});
+ var inside = ref.inside;
+ if (inside > -1 && prosemirror_state__WEBPACK_IMPORTED_MODULE_1__["NodeSelection"].isSelectable(view.state.doc.nodeAt(inside))) { return false }
+ view.dispatch(view.state.tr.setSelection(new GapCursor($pos)));
+ return true
+}
+
+function drawGapCursor(state) {
+ if (!(state.selection instanceof GapCursor)) { return null }
+ var node = document.createElement("div");
+ node.className = "ProseMirror-gapcursor";
+ return prosemirror_view__WEBPACK_IMPORTED_MODULE_2__["DecorationSet"].create(state.doc, [prosemirror_view__WEBPACK_IMPORTED_MODULE_2__["Decoration"].widget(state.selection.head, node, {key: "gapcursor"})])
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-history/dist/index.es.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/prosemirror-history/dist/index.es.js ***!
+ \***********************************************************/
+/*! exports provided: HistoryState, closeHistory, history, redo, redoDepth, undo, undoDepth */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "HistoryState", function() { return HistoryState; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "closeHistory", function() { return closeHistory; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "history", function() { return history; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "redo", function() { return redo; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "redoDepth", function() { return redoDepth; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "undo", function() { return undo; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "undoDepth", function() { return undoDepth; });
+/* harmony import */ var rope_sequence__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! rope-sequence */ "./node_modules/rope-sequence/dist/index.es.js");
+/* harmony import */ var prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-transform */ "./node_modules/prosemirror-transform/dist/index.es.js");
+/* harmony import */ var prosemirror_state__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+
+
+
+
+// ProseMirror's history isn't simply a way to roll back to a previous
+// state, because ProseMirror supports applying changes without adding
+// them to the history (for example during collaboration).
+//
+// To this end, each 'Branch' (one for the undo history and one for
+// the redo history) keeps an array of 'Items', which can optionally
+// hold a step (an actual undoable change), and always hold a position
+// map (which is needed to move changes below them to apply to the
+// current document).
+//
+// An item that has both a step and a selection bookmark is the start
+// of an 'event' — a group of changes that will be undone or redone at
+// once. (It stores only the bookmark, since that way we don't have to
+// provide a document until the selection is actually applied, which
+// is useful when compressing.)
+
+// Used to schedule history compression
+var max_empty_items = 500;
+
+var Branch = function Branch(items, eventCount) {
+ this.items = items;
+ this.eventCount = eventCount;
+};
+
+// : (EditorState, bool) → ?{transform: Transform, selection: ?SelectionBookmark, remaining: Branch}
+// Pop the latest event off the branch's history and apply it
+// to a document transform.
+Branch.prototype.popEvent = function popEvent (state, preserveItems) {
+ var this$1 = this;
+
+ if (this.eventCount == 0) { return null }
+
+ var end = this.items.length;
+ for (;; end--) {
+ var next = this.items.get(end - 1);
+ if (next.selection) { --end; break }
+ }
+
+ var remap, mapFrom;
+ if (preserveItems) {
+ remap = this.remapping(end, this.items.length);
+ mapFrom = remap.maps.length;
+ }
+ var transform = state.tr;
+ var selection, remaining;
+ var addAfter = [], addBefore = [];
+
+ this.items.forEach(function (item, i) {
+ if (!item.step) {
+ if (!remap) {
+ remap = this$1.remapping(end, i + 1);
+ mapFrom = remap.maps.length;
+ }
+ mapFrom--;
+ addBefore.push(item);
+ return
+ }
+
+ if (remap) {
+ addBefore.push(new Item(item.map));
+ var step = item.step.map(remap.slice(mapFrom)), map;
+
+ if (step && transform.maybeStep(step).doc) {
+ map = transform.mapping.maps[transform.mapping.maps.length - 1];
+ addAfter.push(new Item(map, null, null, addAfter.length + addBefore.length));
+ }
+ mapFrom--;
+ if (map) { remap.appendMap(map, mapFrom); }
+ } else {
+ transform.maybeStep(item.step);
+ }
+
+ if (item.selection) {
+ selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;
+ remaining = new Branch(this$1.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this$1.eventCount - 1);
+ return false
+ }
+ }, this.items.length, 0);
+
+ return {remaining: remaining, transform: transform, selection: selection}
+};
+
+// : (Transform, ?SelectionBookmark, Object) → Branch
+// Create a new branch with the given transform added.
+Branch.prototype.addTransform = function addTransform (transform, selection, histOptions, preserveItems) {
+ var newItems = [], eventCount = this.eventCount;
+ var oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;
+
+ for (var i = 0; i < transform.steps.length; i++) {
+ var step = transform.steps[i].invert(transform.docs[i]);
+ var item = new Item(transform.mapping.maps[i], step, selection), merged = (void 0);
+ if (merged = lastItem && lastItem.merge(item)) {
+ item = merged;
+ if (i) { newItems.pop(); }
+ else { oldItems = oldItems.slice(0, oldItems.length - 1); }
+ }
+ newItems.push(item);
+ if (selection) {
+ eventCount++;
+ selection = null;
+ }
+ if (!preserveItems) { lastItem = item; }
+ }
+ var overflow = eventCount - histOptions.depth;
+ if (overflow > DEPTH_OVERFLOW) {
+ oldItems = cutOffEvents(oldItems, overflow);
+ eventCount -= overflow;
+ }
+ return new Branch(oldItems.append(newItems), eventCount)
+};
+
+Branch.prototype.remapping = function remapping (from, to) {
+ var maps = new prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__["Mapping"];
+ this.items.forEach(function (item, i) {
+ var mirrorPos = item.mirrorOffset != null && i - item.mirrorOffset >= from
+ ? mirrorPos = maps.maps.length - item.mirrorOffset : null;
+ maps.appendMap(item.map, mirrorPos);
+ }, from, to);
+ return maps
+};
+
+Branch.prototype.addMaps = function addMaps (array) {
+ if (this.eventCount == 0) { return this }
+ return new Branch(this.items.append(array.map(function (map) { return new Item(map); })), this.eventCount)
+};
+
+// : (Transform, number)
+// When the collab module receives remote changes, the history has
+// to know about those, so that it can adjust the steps that were
+// rebased on top of the remote changes, and include the position
+// maps for the remote changes in its array of items.
+Branch.prototype.rebased = function rebased (rebasedTransform, rebasedCount) {
+ if (!this.eventCount) { return this }
+
+ var rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);
+
+ var mapping = rebasedTransform.mapping;
+ var newUntil = rebasedTransform.steps.length;
+ var eventCount = this.eventCount;
+ this.items.forEach(function (item) { if (item.selection) { eventCount--; } }, start);
+
+ var iRebased = rebasedCount;
+ this.items.forEach(function (item) {
+ var pos = mapping.getMirror(--iRebased);
+ if (pos == null) { return }
+ newUntil = Math.min(newUntil, pos);
+ var map = mapping.maps[pos];
+ if (item.step) {
+ var step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);
+ var selection = item.selection && item.selection.map(mapping.slice(iRebased + 1, pos));
+ if (selection) { eventCount++; }
+ rebasedItems.push(new Item(map, step, selection));
+ } else {
+ rebasedItems.push(new Item(map));
+ }
+ }, start);
+
+ var newMaps = [];
+ for (var i = rebasedCount; i < newUntil; i++)
+ { newMaps.push(new Item(mapping.maps[i])); }
+ var items = this.items.slice(0, start).append(newMaps).append(rebasedItems);
+ var branch = new Branch(items, eventCount);
+
+ if (branch.emptyItemCount() > max_empty_items)
+ { branch = branch.compress(this.items.length - rebasedItems.length); }
+ return branch
+};
+
+Branch.prototype.emptyItemCount = function emptyItemCount () {
+ var count = 0;
+ this.items.forEach(function (item) { if (!item.step) { count++; } });
+ return count
+};
+
+// Compressing a branch means rewriting it to push the air (map-only
+// items) out. During collaboration, these naturally accumulate
+// because each remote change adds one. The `upto` argument is used
+// to ensure that only the items below a given level are compressed,
+// because `rebased` relies on a clean, untouched set of items in
+// order to associate old items with rebased steps.
+Branch.prototype.compress = function compress (upto) {
+ if ( upto === void 0 ) upto = this.items.length;
+
+ var remap = this.remapping(0, upto), mapFrom = remap.maps.length;
+ var items = [], events = 0;
+ this.items.forEach(function (item, i) {
+ if (i >= upto) {
+ items.push(item);
+ if (item.selection) { events++; }
+ } else if (item.step) {
+ var step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();
+ mapFrom--;
+ if (map) { remap.appendMap(map, mapFrom); }
+ if (step) {
+ var selection = item.selection && item.selection.map(remap.slice(mapFrom));
+ if (selection) { events++; }
+ var newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1;
+ if (merged = items.length && items[last].merge(newItem))
+ { items[last] = merged; }
+ else
+ { items.push(newItem); }
+ }
+ } else if (item.map) {
+ mapFrom--;
+ }
+ }, this.items.length, 0);
+ return new Branch(rope_sequence__WEBPACK_IMPORTED_MODULE_0__["default"].from(items.reverse()), events)
+};
+
+Branch.empty = new Branch(rope_sequence__WEBPACK_IMPORTED_MODULE_0__["default"].empty, 0);
+
+function cutOffEvents(items, n) {
+ var cutPoint;
+ items.forEach(function (item, i) {
+ if (item.selection && (n-- == 0)) {
+ cutPoint = i;
+ return false
+ }
+ });
+ return items.slice(cutPoint)
+}
+
+var Item = function Item(map, step, selection, mirrorOffset) {
+ // The (forward) step map for this item.
+ this.map = map;
+ // The inverted step
+ this.step = step;
+ // If this is non-null, this item is the start of a group, and
+ // this selection is the starting selection for the group (the one
+ // that was active before the first step was applied)
+ this.selection = selection;
+ // If this item is the inverse of a previous mapping on the stack,
+ // this points at the inverse's offset
+ this.mirrorOffset = mirrorOffset;
+};
+
+Item.prototype.merge = function merge (other) {
+ if (this.step && other.step && !other.selection) {
+ var step = other.step.merge(this.step);
+ if (step) { return new Item(step.getMap().invert(), step, this.selection) }
+ }
+};
+
+// The value of the state field that tracks undo/redo history for that
+// state. Will be stored in the plugin state when the history plugin
+// is active.
+var HistoryState = function HistoryState(done, undone, prevRanges, prevTime) {
+ this.done = done;
+ this.undone = undone;
+ this.prevRanges = prevRanges;
+ this.prevTime = prevTime;
+};
+
+var DEPTH_OVERFLOW = 20;
+
+// : (HistoryState, EditorState, Transaction, Object)
+// Record a transformation in undo history.
+function applyTransaction(history, state, tr, options) {
+ var historyTr = tr.getMeta(historyKey), rebased;
+ if (historyTr) { return historyTr.historyState }
+
+ if (tr.getMeta(closeHistoryKey)) { history = new HistoryState(history.done, history.undone, null, 0); }
+
+ var appended = tr.getMeta("appendedTransaction");
+
+ if (tr.steps.length == 0) {
+ return history
+ } else if (appended && appended.getMeta(historyKey)) {
+ if (appended.getMeta(historyKey).redo)
+ { return new HistoryState(history.done.addTransform(tr, null, options, mustPreserveItems(state)),
+ history.undone, rangesFor(tr.mapping.maps[tr.steps.length - 1]), history.prevTime) }
+ else
+ { return new HistoryState(history.done, history.undone.addTransform(tr, null, options, mustPreserveItems(state)),
+ null, history.prevTime) }
+ } else if (tr.getMeta("addToHistory") !== false && !(appended && appended.getMeta("addToHistory") === false)) {
+ // Group transforms that occur in quick succession into one event.
+ var newGroup = !appended && (history.prevTime < (tr.time || 0) - options.newGroupDelay ||
+ !isAdjacentTo(tr, history.prevRanges));
+ var prevRanges = appended ? mapRanges(history.prevRanges, tr.mapping) : rangesFor(tr.mapping.maps[tr.steps.length - 1]);
+ return new HistoryState(history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : null,
+ options, mustPreserveItems(state)),
+ Branch.empty, prevRanges, tr.time)
+ } else if (rebased = tr.getMeta("rebased")) {
+ // Used by the collab module to tell the history that some of its
+ // content has been rebased.
+ return new HistoryState(history.done.rebased(tr, rebased),
+ history.undone.rebased(tr, rebased),
+ mapRanges(history.prevRanges, tr.mapping), history.prevTime)
+ } else {
+ return new HistoryState(history.done.addMaps(tr.mapping.maps),
+ history.undone.addMaps(tr.mapping.maps),
+ mapRanges(history.prevRanges, tr.mapping), history.prevTime)
+ }
+}
+
+function isAdjacentTo(transform, prevRanges) {
+ if (!prevRanges) { return false }
+ if (!transform.docChanged) { return true }
+ var adjacent = false;
+ transform.mapping.maps[0].forEach(function (start, end) {
+ for (var i = 0; i < prevRanges.length; i += 2)
+ { if (start <= prevRanges[i + 1] && end >= prevRanges[i])
+ { adjacent = true; } }
+ });
+ return adjacent
+}
+
+function rangesFor(map) {
+ var result = [];
+ map.forEach(function (_from, _to, from, to) { return result.push(from, to); });
+ return result
+}
+
+function mapRanges(ranges, mapping) {
+ if (!ranges) { return null }
+ var result = [];
+ for (var i = 0; i < ranges.length; i += 2) {
+ var from = mapping.map(ranges[i], 1), to = mapping.map(ranges[i + 1], -1);
+ if (from <= to) { result.push(from, to); }
+ }
+ return result
+}
+
+// : (HistoryState, EditorState, (tr: Transaction), bool)
+// Apply the latest event from one branch to the document and shift the event
+// onto the other branch.
+function histTransaction(history, state, dispatch, redo) {
+ var preserveItems = mustPreserveItems(state), histOptions = historyKey.get(state).spec.config;
+ var pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);
+ if (!pop) { return }
+
+ var selection = pop.selection.resolve(pop.transform.doc);
+ var added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(),
+ histOptions, preserveItems);
+
+ var newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0);
+ dispatch(pop.transform.setSelection(selection).setMeta(historyKey, {redo: redo, historyState: newHist}).scrollIntoView());
+}
+
+var cachedPreserveItems = false, cachedPreserveItemsPlugins = null;
+// Check whether any plugin in the given state has a
+// `historyPreserveItems` property in its spec, in which case we must
+// preserve steps exactly as they came in, so that they can be
+// rebased.
+function mustPreserveItems(state) {
+ var plugins = state.plugins;
+ if (cachedPreserveItemsPlugins != plugins) {
+ cachedPreserveItems = false;
+ cachedPreserveItemsPlugins = plugins;
+ for (var i = 0; i < plugins.length; i++) { if (plugins[i].spec.historyPreserveItems) {
+ cachedPreserveItems = true;
+ break
+ } }
+ }
+ return cachedPreserveItems
+}
+
+// :: (Transaction) → Transaction
+// Set a flag on the given transaction that will prevent further steps
+// from being appended to an existing history event (so that they
+// require a separate undo command to undo).
+function closeHistory(tr) {
+ return tr.setMeta(closeHistoryKey, true)
+}
+
+var historyKey = new prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["PluginKey"]("history");
+var closeHistoryKey = new prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["PluginKey"]("closeHistory");
+
+// :: (?Object) → Plugin
+// Returns a plugin that enables the undo history for an editor. The
+// plugin will track undo and redo stacks, which can be used with the
+// [`undo`](#history.undo) and [`redo`](#history.redo) commands.
+//
+// You can set an `"addToHistory"` [metadata
+// property](#state.Transaction.setMeta) of `false` on a transaction
+// to prevent it from being rolled back by undo.
+//
+// config::-
+// Supports the following configuration options:
+//
+// depth:: ?number
+// The amount of history events that are collected before the
+// oldest events are discarded. Defaults to 100.
+//
+// newGroupDelay:: ?number
+// The delay between changes after which a new group should be
+// started. Defaults to 500 (milliseconds). Note that when changes
+// aren't adjacent, a new group is always started.
+function history(config) {
+ config = {depth: config && config.depth || 100,
+ newGroupDelay: config && config.newGroupDelay || 500};
+ return new prosemirror_state__WEBPACK_IMPORTED_MODULE_2__["Plugin"]({
+ key: historyKey,
+
+ state: {
+ init: function init() {
+ return new HistoryState(Branch.empty, Branch.empty, null, 0)
+ },
+ apply: function apply(tr, hist, state) {
+ return applyTransaction(hist, state, tr, config)
+ }
+ },
+
+ config: config
+ })
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// A command function that undoes the last change, if any.
+function undo(state, dispatch) {
+ var hist = historyKey.getState(state);
+ if (!hist || hist.done.eventCount == 0) { return false }
+ if (dispatch) { histTransaction(hist, state, dispatch, false); }
+ return true
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// A command function that redoes the last undone change, if any.
+function redo(state, dispatch) {
+ var hist = historyKey.getState(state);
+ if (!hist || hist.undone.eventCount == 0) { return false }
+ if (dispatch) { histTransaction(hist, state, dispatch, true); }
+ return true
+}
+
+// :: (EditorState) → number
+// The amount of undoable events available in a given state.
+function undoDepth(state) {
+ var hist = historyKey.getState(state);
+ return hist ? hist.done.eventCount : 0
+}
+
+// :: (EditorState) → number
+// The amount of redoable events available in a given editor state.
+function redoDepth(state) {
+ var hist = historyKey.getState(state);
+ return hist ? hist.undone.eventCount : 0
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-inputrules/dist/index.es.js":
+/*!**************************************************************!*\
+ !*** ./node_modules/prosemirror-inputrules/dist/index.es.js ***!
+ \**************************************************************/
+/*! exports provided: InputRule, closeDoubleQuote, closeSingleQuote, ellipsis, emDash, inputRules, openDoubleQuote, openSingleQuote, smartQuotes, textblockTypeInputRule, undoInputRule, wrappingInputRule */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "InputRule", function() { return InputRule; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "closeDoubleQuote", function() { return closeDoubleQuote; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "closeSingleQuote", function() { return closeSingleQuote; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ellipsis", function() { return ellipsis; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "emDash", function() { return emDash; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "inputRules", function() { return inputRules; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "openDoubleQuote", function() { return openDoubleQuote; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "openSingleQuote", function() { return openSingleQuote; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "smartQuotes", function() { return smartQuotes; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "textblockTypeInputRule", function() { return textblockTypeInputRule; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "undoInputRule", function() { return undoInputRule; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "wrappingInputRule", function() { return wrappingInputRule; });
+/* harmony import */ var prosemirror_state__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+/* harmony import */ var prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-transform */ "./node_modules/prosemirror-transform/dist/index.es.js");
+
+
+
+// ::- Input rules are regular expressions describing a piece of text
+// that, when typed, causes something to happen. This might be
+// changing two dashes into an emdash, wrapping a paragraph starting
+// with `"> "` into a blockquote, or something entirely different.
+var InputRule = function InputRule(match, handler) {
+ this.match = match;
+ this.handler = typeof handler == "string" ? stringHandler(handler) : handler;
+};
+
+function stringHandler(string) {
+ return function(state, match, start, end) {
+ var insert = string;
+ if (match[1]) {
+ var offset = match[0].lastIndexOf(match[1]);
+ insert += match[0].slice(offset + match[1].length);
+ start += offset;
+ var cutOff = start - end;
+ if (cutOff > 0) {
+ insert = match[0].slice(offset - cutOff, offset) + insert;
+ start = end;
+ }
+ }
+ return state.tr.insertText(insert, start, end)
+ }
+}
+
+var MAX_MATCH = 500;
+
+// :: (config: {rules: [InputRule]}) → Plugin
+// Create an input rules plugin. When enabled, it will cause text
+// input that matches any of the given rules to trigger the rule's
+// action.
+function inputRules(ref) {
+ var rules = ref.rules;
+
+ var plugin = new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Plugin"]({
+ state: {
+ init: function init() { return null },
+ apply: function apply(tr, prev) {
+ var stored = tr.getMeta(this);
+ if (stored) { return stored }
+ return tr.selectionSet || tr.docChanged ? null : prev
+ }
+ },
+
+ props: {
+ handleTextInput: function handleTextInput(view, from, to, text) {
+ return run(view, from, to, text, rules, plugin)
+ },
+ handleDOMEvents: {
+ compositionend: function (view) {
+ setTimeout(function () {
+ var ref = view.state.selection;
+ var $cursor = ref.$cursor;
+ if ($cursor) { run(view, $cursor.pos, $cursor.pos, "", rules, plugin); }
+ });
+ }
+ }
+ },
+
+ isInputRules: true
+ });
+ return plugin
+}
+
+function run(view, from, to, text, rules, plugin) {
+ if (view.composing) { return false }
+ var state = view.state, $from = state.doc.resolve(from);
+ if ($from.parent.type.spec.code) { return false }
+ var textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - MAX_MATCH), $from.parentOffset,
+ null, "\ufffc") + text;
+ for (var i = 0; i < rules.length; i++) {
+ var match = rules[i].match.exec(textBefore);
+ var tr = match && rules[i].handler(state, match, from - (match[0].length - text.length), to);
+ if (!tr) { continue }
+ view.dispatch(tr.setMeta(plugin, {transform: tr, from: from, to: to, text: text}));
+ return true
+ }
+ return false
+}
+
+// :: (EditorState, ?(Transaction)) → bool
+// This is a command that will undo an input rule, if applying such a
+// rule was the last thing that the user did.
+function undoInputRule(state, dispatch) {
+ var plugins = state.plugins;
+ for (var i = 0; i < plugins.length; i++) {
+ var plugin = plugins[i], undoable = (void 0);
+ if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {
+ if (dispatch) {
+ var tr = state.tr, toUndo = undoable.transform;
+ for (var j = toUndo.steps.length - 1; j >= 0; j--)
+ { tr.step(toUndo.steps[j].invert(toUndo.docs[j])); }
+ var marks = tr.doc.resolve(undoable.from).marks();
+ dispatch(tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks)));
+ }
+ return true
+ }
+ }
+ return false
+}
+
+// :: InputRule Converts double dashes to an emdash.
+var emDash = new InputRule(/--$/, "—");
+// :: InputRule Converts three dots to an ellipsis character.
+var ellipsis = new InputRule(/\.\.\.$/, "…");
+// :: InputRule “Smart” opening double quotes.
+var openDoubleQuote = new InputRule(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(")$/, "“");
+// :: InputRule “Smart” closing double quotes.
+var closeDoubleQuote = new InputRule(/"$/, "”");
+// :: InputRule “Smart” opening single quotes.
+var openSingleQuote = new InputRule(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(')$/, "‘");
+// :: InputRule “Smart” closing single quotes.
+var closeSingleQuote = new InputRule(/'$/, "’");
+
+// :: [InputRule] Smart-quote related input rules.
+var smartQuotes = [openDoubleQuote, closeDoubleQuote, openSingleQuote, closeSingleQuote];
+
+// :: (RegExp, NodeType, ?union, ?([string], Node) → bool) → InputRule
+// Build an input rule for automatically wrapping a textblock when a
+// given string is typed. The `regexp` argument is
+// directly passed through to the `InputRule` constructor. You'll
+// probably want the regexp to start with `^`, so that the pattern can
+// only occur at the start of a textblock.
+//
+// `nodeType` is the type of node to wrap in. If it needs attributes,
+// you can either pass them directly, or pass a function that will
+// compute them from the regular expression match.
+//
+// By default, if there's a node with the same type above the newly
+// wrapped node, the rule will try to [join](#transform.Transform.join) those
+// two nodes. You can pass a join predicate, which takes a regular
+// expression match and the node before the wrapped node, and can
+// return a boolean to indicate whether a join should happen.
+function wrappingInputRule(regexp, nodeType, getAttrs, joinPredicate) {
+ return new InputRule(regexp, function (state, match, start, end) {
+ var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;
+ var tr = state.tr.delete(start, end);
+ var $start = tr.doc.resolve(start), range = $start.blockRange(), wrapping = range && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__["findWrapping"])(range, nodeType, attrs);
+ if (!wrapping) { return null }
+ tr.wrap(range, wrapping);
+ var before = tr.doc.resolve(start - 1).nodeBefore;
+ if (before && before.type == nodeType && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__["canJoin"])(tr.doc, start - 1) &&
+ (!joinPredicate || joinPredicate(match, before)))
+ { tr.join(start - 1); }
+ return tr
+ })
+}
+
+// :: (RegExp, NodeType, ?union) → InputRule
+// Build an input rule that changes the type of a textblock when the
+// matched text is typed into it. You'll usually want to start your
+// regexp with `^` to that it is only matched at the start of a
+// textblock. The optional `getAttrs` parameter can be used to compute
+// the new node's attributes, and works the same as in the
+// `wrappingInputRule` function.
+function textblockTypeInputRule(regexp, nodeType, getAttrs) {
+ return new InputRule(regexp, function (state, match, start, end) {
+ var $start = state.doc.resolve(start);
+ var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;
+ if (!$start.node(-1).canReplaceWith($start.index(-1), $start.indexAfter(-1), nodeType)) { return null }
+ return state.tr
+ .delete(start, end)
+ .setBlockType(start, start, nodeType, attrs)
+ })
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-keymap/dist/index.es.js":
+/*!**********************************************************!*\
+ !*** ./node_modules/prosemirror-keymap/dist/index.es.js ***!
+ \**********************************************************/
+/*! exports provided: keydownHandler, keymap */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "keydownHandler", function() { return keydownHandler; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "keymap", function() { return keymap; });
+/* harmony import */ var w3c_keyname__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! w3c-keyname */ "./node_modules/w3c-keyname/index.es.js");
+/* harmony import */ var prosemirror_state__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+
+
+
+// declare global: navigator
+
+var mac = typeof navigator != "undefined" ? /Mac/.test(navigator.platform) : false;
+
+function normalizeKeyName(name) {
+ var parts = name.split(/-(?!$)/), result = parts[parts.length - 1];
+ if (result == "Space") { result = " "; }
+ var alt, ctrl, shift, meta;
+ for (var i = 0; i < parts.length - 1; i++) {
+ var mod = parts[i];
+ if (/^(cmd|meta|m)$/i.test(mod)) { meta = true; }
+ else if (/^a(lt)?$/i.test(mod)) { alt = true; }
+ else if (/^(c|ctrl|control)$/i.test(mod)) { ctrl = true; }
+ else if (/^s(hift)?$/i.test(mod)) { shift = true; }
+ else if (/^mod$/i.test(mod)) { if (mac) { meta = true; } else { ctrl = true; } }
+ else { throw new Error("Unrecognized modifier name: " + mod) }
+ }
+ if (alt) { result = "Alt-" + result; }
+ if (ctrl) { result = "Ctrl-" + result; }
+ if (meta) { result = "Meta-" + result; }
+ if (shift) { result = "Shift-" + result; }
+ return result
+}
+
+function normalize(map) {
+ var copy = Object.create(null);
+ for (var prop in map) { copy[normalizeKeyName(prop)] = map[prop]; }
+ return copy
+}
+
+function modifiers(name, event, shift) {
+ if (event.altKey) { name = "Alt-" + name; }
+ if (event.ctrlKey) { name = "Ctrl-" + name; }
+ if (event.metaKey) { name = "Meta-" + name; }
+ if (shift !== false && event.shiftKey) { name = "Shift-" + name; }
+ return name
+}
+
+// :: (Object) → Plugin
+// Create a keymap plugin for the given set of bindings.
+//
+// Bindings should map key names to [command](#commands)-style
+// functions, which will be called with `(EditorState, dispatch,
+// EditorView)` arguments, and should return true when they've handled
+// the key. Note that the view argument isn't part of the command
+// protocol, but can be used as an escape hatch if a binding needs to
+// directly interact with the UI.
+//
+// Key names may be strings like `"Shift-Ctrl-Enter"`—a key
+// identifier prefixed with zero or more modifiers. Key identifiers
+// are based on the strings that can appear in
+// [`KeyEvent.key`](https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).
+// Use lowercase letters to refer to letter keys (or uppercase letters
+// if you want shift to be held). You may use `"Space"` as an alias
+// for the `" "` name.
+//
+// Modifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or
+// `a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or
+// `Meta-`) are recognized. For characters that are created by holding
+// shift, the `Shift-` prefix is implied, and should not be added
+// explicitly.
+//
+// You can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on
+// other platforms.
+//
+// You can add multiple keymap plugins to an editor. The order in
+// which they appear determines their precedence (the ones early in
+// the array get to dispatch first).
+function keymap(bindings) {
+ return new prosemirror_state__WEBPACK_IMPORTED_MODULE_1__["Plugin"]({props: {handleKeyDown: keydownHandler(bindings)}})
+}
+
+// :: (Object) → (view: EditorView, event: dom.Event) → bool
+// Given a set of bindings (using the same format as
+// [`keymap`](#keymap.keymap), return a [keydown
+// handler](#view.EditorProps.handleKeyDown) that handles them.
+function keydownHandler(bindings) {
+ var map = normalize(bindings);
+ return function(view, event) {
+ var name = Object(w3c_keyname__WEBPACK_IMPORTED_MODULE_0__["keyName"])(event), isChar = name.length == 1 && name != " ", baseName;
+ var direct = map[modifiers(name, event, !isChar)];
+ if (direct && direct(view.state, view.dispatch, view)) { return true }
+ if (isChar && (event.shiftKey || event.altKey || event.metaKey) &&
+ (baseName = w3c_keyname__WEBPACK_IMPORTED_MODULE_0__["base"][event.keyCode]) && baseName != name) {
+ var fromCode = map[modifiers(baseName, event, true)];
+ if (fromCode && fromCode(view.state, view.dispatch, view)) { return true }
+ } else if (isChar && event.shiftKey) {
+ var withShift = map[modifiers(name, event, true)];
+ if (withShift && withShift(view.state, view.dispatch, view)) { return true }
+ }
+ return false
+ }
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-model/dist/index.es.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/prosemirror-model/dist/index.es.js ***!
+ \*********************************************************/
+/*! exports provided: ContentMatch, DOMParser, DOMSerializer, Fragment, Mark, MarkType, Node, NodeRange, NodeType, ReplaceError, ResolvedPos, Schema, Slice */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ContentMatch", function() { return ContentMatch; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "DOMParser", function() { return DOMParser; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "DOMSerializer", function() { return DOMSerializer; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Fragment", function() { return Fragment; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Mark", function() { return Mark; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "MarkType", function() { return MarkType; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Node", function() { return Node; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "NodeRange", function() { return NodeRange; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "NodeType", function() { return NodeType; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ReplaceError", function() { return ReplaceError; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ResolvedPos", function() { return ResolvedPos; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Schema", function() { return Schema; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Slice", function() { return Slice; });
+/* harmony import */ var orderedmap__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! orderedmap */ "./node_modules/orderedmap/index.es.js");
+
+
+function findDiffStart(a, b, pos) {
+ for (var i = 0;; i++) {
+ if (i == a.childCount || i == b.childCount)
+ { return a.childCount == b.childCount ? null : pos }
+
+ var childA = a.child(i), childB = b.child(i);
+ if (childA == childB) { pos += childA.nodeSize; continue }
+
+ if (!childA.sameMarkup(childB)) { return pos }
+
+ if (childA.isText && childA.text != childB.text) {
+ for (var j = 0; childA.text[j] == childB.text[j]; j++)
+ { pos++; }
+ return pos
+ }
+ if (childA.content.size || childB.content.size) {
+ var inner = findDiffStart(childA.content, childB.content, pos + 1);
+ if (inner != null) { return inner }
+ }
+ pos += childA.nodeSize;
+ }
+}
+
+function findDiffEnd(a, b, posA, posB) {
+ for (var iA = a.childCount, iB = b.childCount;;) {
+ if (iA == 0 || iB == 0)
+ { return iA == iB ? null : {a: posA, b: posB} }
+
+ var childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize;
+ if (childA == childB) {
+ posA -= size; posB -= size;
+ continue
+ }
+
+ if (!childA.sameMarkup(childB)) { return {a: posA, b: posB} }
+
+ if (childA.isText && childA.text != childB.text) {
+ var same = 0, minSize = Math.min(childA.text.length, childB.text.length);
+ while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {
+ same++; posA--; posB--;
+ }
+ return {a: posA, b: posB}
+ }
+ if (childA.content.size || childB.content.size) {
+ var inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);
+ if (inner) { return inner }
+ }
+ posA -= size; posB -= size;
+ }
+}
+
+// ::- A fragment represents a node's collection of child nodes.
+//
+// Like nodes, fragments are persistent data structures, and you
+// should not mutate them or their content. Rather, you create new
+// instances whenever needed. The API tries to make this easy.
+var Fragment = function Fragment(content, size) {
+ this.content = content;
+ // :: number
+ // The size of the fragment, which is the total of the size of its
+ // content nodes.
+ this.size = size || 0;
+ if (size == null) { for (var i = 0; i < content.length; i++)
+ { this.size += content[i].nodeSize; } }
+};
+
+var prototypeAccessors = { firstChild: { configurable: true },lastChild: { configurable: true },childCount: { configurable: true } };
+
+// :: (number, number, (node: Node, start: number, parent: Node, index: number) → ?bool, ?number)
+// Invoke a callback for all descendant nodes between the given two
+// positions (relative to start of this fragment). Doesn't descend
+// into a node when the callback returns `false`.
+Fragment.prototype.nodesBetween = function nodesBetween (from, to, f, nodeStart, parent) {
+ if ( nodeStart === void 0 ) nodeStart = 0;
+
+ for (var i = 0, pos = 0; pos < to; i++) {
+ var child = this.content[i], end = pos + child.nodeSize;
+ if (end > from && f(child, nodeStart + pos, parent, i) !== false && child.content.size) {
+ var start = pos + 1;
+ child.nodesBetween(Math.max(0, from - start),
+ Math.min(child.content.size, to - start),
+ f, nodeStart + start);
+ }
+ pos = end;
+ }
+};
+
+// :: ((node: Node, pos: number, parent: Node) → ?bool)
+// Call the given callback for every descendant node. The callback
+// may return `false` to prevent traversal of a given node's children.
+Fragment.prototype.descendants = function descendants (f) {
+ this.nodesBetween(0, this.size, f);
+};
+
+// : (number, number, ?string, ?string) → string
+Fragment.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {
+ var text = "", separated = true;
+ this.nodesBetween(from, to, function (node, pos) {
+ if (node.isText) {
+ text += node.text.slice(Math.max(from, pos) - pos, to - pos);
+ separated = !blockSeparator;
+ } else if (node.isLeaf && leafText) {
+ text += leafText;
+ separated = !blockSeparator;
+ } else if (!separated && node.isBlock) {
+ text += blockSeparator;
+ separated = true;
+ }
+ }, 0);
+ return text
+};
+
+// :: (Fragment) → Fragment
+// Create a new fragment containing the combined content of this
+// fragment and the other.
+Fragment.prototype.append = function append (other) {
+ if (!other.size) { return this }
+ if (!this.size) { return other }
+ var last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0;
+ if (last.isText && last.sameMarkup(first)) {
+ content[content.length - 1] = last.withText(last.text + first.text);
+ i = 1;
+ }
+ for (; i < other.content.length; i++) { content.push(other.content[i]); }
+ return new Fragment(content, this.size + other.size)
+};
+
+// :: (number, ?number) → Fragment
+// Cut out the sub-fragment between the two given positions.
+Fragment.prototype.cut = function cut (from, to) {
+ if (to == null) { to = this.size; }
+ if (from == 0 && to == this.size) { return this }
+ var result = [], size = 0;
+ if (to > from) { for (var i = 0, pos = 0; pos < to; i++) {
+ var child = this.content[i], end = pos + child.nodeSize;
+ if (end > from) {
+ if (pos < from || end > to) {
+ if (child.isText)
+ { child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos)); }
+ else
+ { child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1)); }
+ }
+ result.push(child);
+ size += child.nodeSize;
+ }
+ pos = end;
+ } }
+ return new Fragment(result, size)
+};
+
+Fragment.prototype.cutByIndex = function cutByIndex (from, to) {
+ if (from == to) { return Fragment.empty }
+ if (from == 0 && to == this.content.length) { return this }
+ return new Fragment(this.content.slice(from, to))
+};
+
+// :: (number, Node) → Fragment
+// Create a new fragment in which the node at the given index is
+// replaced by the given node.
+Fragment.prototype.replaceChild = function replaceChild (index, node) {
+ var current = this.content[index];
+ if (current == node) { return this }
+ var copy = this.content.slice();
+ var size = this.size + node.nodeSize - current.nodeSize;
+ copy[index] = node;
+ return new Fragment(copy, size)
+};
+
+// : (Node) → Fragment
+// Create a new fragment by prepending the given node to this
+// fragment.
+Fragment.prototype.addToStart = function addToStart (node) {
+ return new Fragment([node].concat(this.content), this.size + node.nodeSize)
+};
+
+// : (Node) → Fragment
+// Create a new fragment by appending the given node to this
+// fragment.
+Fragment.prototype.addToEnd = function addToEnd (node) {
+ return new Fragment(this.content.concat(node), this.size + node.nodeSize)
+};
+
+// :: (Fragment) → bool
+// Compare this fragment to another one.
+Fragment.prototype.eq = function eq (other) {
+ if (this.content.length != other.content.length) { return false }
+ for (var i = 0; i < this.content.length; i++)
+ { if (!this.content[i].eq(other.content[i])) { return false } }
+ return true
+};
+
+// :: ?Node
+// The first child of the fragment, or `null` if it is empty.
+prototypeAccessors.firstChild.get = function () { return this.content.length ? this.content[0] : null };
+
+// :: ?Node
+// The last child of the fragment, or `null` if it is empty.
+prototypeAccessors.lastChild.get = function () { return this.content.length ? this.content[this.content.length - 1] : null };
+
+// :: number
+// The number of child nodes in this fragment.
+prototypeAccessors.childCount.get = function () { return this.content.length };
+
+// :: (number) → Node
+// Get the child node at the given index. Raise an error when the
+// index is out of range.
+Fragment.prototype.child = function child (index) {
+ var found = this.content[index];
+ if (!found) { throw new RangeError("Index " + index + " out of range for " + this) }
+ return found
+};
+
+// :: (number) → ?Node
+// Get the child node at the given index, if it exists.
+Fragment.prototype.maybeChild = function maybeChild (index) {
+ return this.content[index]
+};
+
+// :: ((node: Node, offset: number, index: number))
+// Call `f` for every child node, passing the node, its offset
+// into this parent node, and its index.
+Fragment.prototype.forEach = function forEach (f) {
+ for (var i = 0, p = 0; i < this.content.length; i++) {
+ var child = this.content[i];
+ f(child, p, i);
+ p += child.nodeSize;
+ }
+};
+
+// :: (Fragment) → ?number
+// Find the first position at which this fragment and another
+// fragment differ, or `null` if they are the same.
+Fragment.prototype.findDiffStart = function findDiffStart$1 (other, pos) {
+ if ( pos === void 0 ) pos = 0;
+
+ return findDiffStart(this, other, pos)
+};
+
+// :: (Fragment) → ?{a: number, b: number}
+// Find the first position, searching from the end, at which this
+// fragment and the given fragment differ, or `null` if they are the
+// same. Since this position will not be the same in both nodes, an
+// object with two separate positions is returned.
+Fragment.prototype.findDiffEnd = function findDiffEnd$1 (other, pos, otherPos) {
+ if ( pos === void 0 ) pos = this.size;
+ if ( otherPos === void 0 ) otherPos = other.size;
+
+ return findDiffEnd(this, other, pos, otherPos)
+};
+
+// : (number, ?number) → {index: number, offset: number}
+// Find the index and inner offset corresponding to a given relative
+// position in this fragment. The result object will be reused
+// (overwritten) the next time the function is called. (Not public.)
+Fragment.prototype.findIndex = function findIndex (pos, round) {
+ if ( round === void 0 ) round = -1;
+
+ if (pos == 0) { return retIndex(0, pos) }
+ if (pos == this.size) { return retIndex(this.content.length, pos) }
+ if (pos > this.size || pos < 0) { throw new RangeError(("Position " + pos + " outside of fragment (" + (this) + ")")) }
+ for (var i = 0, curPos = 0;; i++) {
+ var cur = this.child(i), end = curPos + cur.nodeSize;
+ if (end >= pos) {
+ if (end == pos || round > 0) { return retIndex(i + 1, end) }
+ return retIndex(i, curPos)
+ }
+ curPos = end;
+ }
+};
+
+// :: () → string
+// Return a debugging string that describes this fragment.
+Fragment.prototype.toString = function toString () { return "<" + this.toStringInner() + ">" };
+
+Fragment.prototype.toStringInner = function toStringInner () { return this.content.join(", ") };
+
+// :: () → ?Object
+// Create a JSON-serializeable representation of this fragment.
+Fragment.prototype.toJSON = function toJSON () {
+ return this.content.length ? this.content.map(function (n) { return n.toJSON(); }) : null
+};
+
+// :: (Schema, ?Object) → Fragment
+// Deserialize a fragment from its JSON representation.
+Fragment.fromJSON = function fromJSON (schema, value) {
+ if (!value) { return Fragment.empty }
+ if (!Array.isArray(value)) { throw new RangeError("Invalid input for Fragment.fromJSON") }
+ return new Fragment(value.map(schema.nodeFromJSON))
+};
+
+// :: ([Node]) → Fragment
+// Build a fragment from an array of nodes. Ensures that adjacent
+// text nodes with the same marks are joined together.
+Fragment.fromArray = function fromArray (array) {
+ if (!array.length) { return Fragment.empty }
+ var joined, size = 0;
+ for (var i = 0; i < array.length; i++) {
+ var node = array[i];
+ size += node.nodeSize;
+ if (i && node.isText && array[i - 1].sameMarkup(node)) {
+ if (!joined) { joined = array.slice(0, i); }
+ joined[joined.length - 1] = node.withText(joined[joined.length - 1].text + node.text);
+ } else if (joined) {
+ joined.push(node);
+ }
+ }
+ return new Fragment(joined || array, size)
+};
+
+// :: (?union) → Fragment
+// Create a fragment from something that can be interpreted as a set
+// of nodes. For `null`, it returns the empty fragment. For a
+// fragment, the fragment itself. For a node or array of nodes, a
+// fragment containing those nodes.
+Fragment.from = function from (nodes) {
+ if (!nodes) { return Fragment.empty }
+ if (nodes instanceof Fragment) { return nodes }
+ if (Array.isArray(nodes)) { return this.fromArray(nodes) }
+ if (nodes.attrs) { return new Fragment([nodes], nodes.nodeSize) }
+ throw new RangeError("Can not convert " + nodes + " to a Fragment" +
+ (nodes.nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""))
+};
+
+Object.defineProperties( Fragment.prototype, prototypeAccessors );
+
+var found = {index: 0, offset: 0};
+function retIndex(index, offset) {
+ found.index = index;
+ found.offset = offset;
+ return found
+}
+
+// :: Fragment
+// An empty fragment. Intended to be reused whenever a node doesn't
+// contain anything (rather than allocating a new empty fragment for
+// each leaf node).
+Fragment.empty = new Fragment([], 0);
+
+function compareDeep(a, b) {
+ if (a === b) { return true }
+ if (!(a && typeof a == "object") ||
+ !(b && typeof b == "object")) { return false }
+ var array = Array.isArray(a);
+ if (Array.isArray(b) != array) { return false }
+ if (array) {
+ if (a.length != b.length) { return false }
+ for (var i = 0; i < a.length; i++) { if (!compareDeep(a[i], b[i])) { return false } }
+ } else {
+ for (var p in a) { if (!(p in b) || !compareDeep(a[p], b[p])) { return false } }
+ for (var p$1 in b) { if (!(p$1 in a)) { return false } }
+ }
+ return true
+}
+
+// ::- A mark is a piece of information that can be attached to a node,
+// such as it being emphasized, in code font, or a link. It has a type
+// and optionally a set of attributes that provide further information
+// (such as the target of the link). Marks are created through a
+// `Schema`, which controls which types exist and which
+// attributes they have.
+var Mark = function Mark(type, attrs) {
+ // :: MarkType
+ // The type of this mark.
+ this.type = type;
+ // :: Object
+ // The attributes associated with this mark.
+ this.attrs = attrs;
+};
+
+// :: ([Mark]) → [Mark]
+// Given a set of marks, create a new set which contains this one as
+// well, in the right position. If this mark is already in the set,
+// the set itself is returned. If any marks that are set to be
+// [exclusive](#model.MarkSpec.excludes) with this mark are present,
+// those are replaced by this one.
+Mark.prototype.addToSet = function addToSet (set) {
+ var copy, placed = false;
+ for (var i = 0; i < set.length; i++) {
+ var other = set[i];
+ if (this.eq(other)) { return set }
+ if (this.type.excludes(other.type)) {
+ if (!copy) { copy = set.slice(0, i); }
+ } else if (other.type.excludes(this.type)) {
+ return set
+ } else {
+ if (!placed && other.type.rank > this.type.rank) {
+ if (!copy) { copy = set.slice(0, i); }
+ copy.push(this);
+ placed = true;
+ }
+ if (copy) { copy.push(other); }
+ }
+ }
+ if (!copy) { copy = set.slice(); }
+ if (!placed) { copy.push(this); }
+ return copy
+};
+
+// :: ([Mark]) → [Mark]
+// Remove this mark from the given set, returning a new set. If this
+// mark is not in the set, the set itself is returned.
+Mark.prototype.removeFromSet = function removeFromSet (set) {
+ for (var i = 0; i < set.length; i++)
+ { if (this.eq(set[i]))
+ { return set.slice(0, i).concat(set.slice(i + 1)) } }
+ return set
+};
+
+// :: ([Mark]) → bool
+// Test whether this mark is in the given set of marks.
+Mark.prototype.isInSet = function isInSet (set) {
+ for (var i = 0; i < set.length; i++)
+ { if (this.eq(set[i])) { return true } }
+ return false
+};
+
+// :: (Mark) → bool
+// Test whether this mark has the same type and attributes as
+// another mark.
+Mark.prototype.eq = function eq (other) {
+ return this == other ||
+ (this.type == other.type && compareDeep(this.attrs, other.attrs))
+};
+
+// :: () → Object
+// Convert this mark to a JSON-serializeable representation.
+Mark.prototype.toJSON = function toJSON () {
+ var obj = {type: this.type.name};
+ for (var _ in this.attrs) {
+ obj.attrs = this.attrs;
+ break
+ }
+ return obj
+};
+
+// :: (Schema, Object) → Mark
+Mark.fromJSON = function fromJSON (schema, json) {
+ if (!json) { throw new RangeError("Invalid input for Mark.fromJSON") }
+ var type = schema.marks[json.type];
+ if (!type) { throw new RangeError(("There is no mark type " + (json.type) + " in this schema")) }
+ return type.create(json.attrs)
+};
+
+// :: ([Mark], [Mark]) → bool
+// Test whether two sets of marks are identical.
+Mark.sameSet = function sameSet (a, b) {
+ if (a == b) { return true }
+ if (a.length != b.length) { return false }
+ for (var i = 0; i < a.length; i++)
+ { if (!a[i].eq(b[i])) { return false } }
+ return true
+};
+
+// :: (?union) → [Mark]
+// Create a properly sorted mark set from null, a single mark, or an
+// unsorted array of marks.
+Mark.setFrom = function setFrom (marks) {
+ if (!marks || marks.length == 0) { return Mark.none }
+ if (marks instanceof Mark) { return [marks] }
+ var copy = marks.slice();
+ copy.sort(function (a, b) { return a.type.rank - b.type.rank; });
+ return copy
+};
+
+// :: [Mark] The empty set of marks.
+Mark.none = [];
+
+// ReplaceError:: class extends Error
+// Error type raised by [`Node.replace`](#model.Node.replace) when
+// given an invalid replacement.
+
+function ReplaceError(message) {
+ var err = Error.call(this, message);
+ err.__proto__ = ReplaceError.prototype;
+ return err
+}
+
+ReplaceError.prototype = Object.create(Error.prototype);
+ReplaceError.prototype.constructor = ReplaceError;
+ReplaceError.prototype.name = "ReplaceError";
+
+// ::- A slice represents a piece cut out of a larger document. It
+// stores not only a fragment, but also the depth up to which nodes on
+// both side are ‘open’ (cut through).
+var Slice = function Slice(content, openStart, openEnd) {
+ // :: Fragment The slice's content.
+ this.content = content;
+ // :: number The open depth at the start.
+ this.openStart = openStart;
+ // :: number The open depth at the end.
+ this.openEnd = openEnd;
+};
+
+var prototypeAccessors$1 = { size: { configurable: true } };
+
+// :: number
+// The size this slice would add when inserted into a document.
+prototypeAccessors$1.size.get = function () {
+ return this.content.size - this.openStart - this.openEnd
+};
+
+Slice.prototype.insertAt = function insertAt (pos, fragment) {
+ var content = insertInto(this.content, pos + this.openStart, fragment, null);
+ return content && new Slice(content, this.openStart, this.openEnd)
+};
+
+Slice.prototype.removeBetween = function removeBetween (from, to) {
+ return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd)
+};
+
+// :: (Slice) → bool
+// Tests whether this slice is equal to another slice.
+Slice.prototype.eq = function eq (other) {
+ return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd
+};
+
+Slice.prototype.toString = function toString () {
+ return this.content + "(" + this.openStart + "," + this.openEnd + ")"
+};
+
+// :: () → ?Object
+// Convert a slice to a JSON-serializable representation.
+Slice.prototype.toJSON = function toJSON () {
+ if (!this.content.size) { return null }
+ var json = {content: this.content.toJSON()};
+ if (this.openStart > 0) { json.openStart = this.openStart; }
+ if (this.openEnd > 0) { json.openEnd = this.openEnd; }
+ return json
+};
+
+// :: (Schema, ?Object) → Slice
+// Deserialize a slice from its JSON representation.
+Slice.fromJSON = function fromJSON (schema, json) {
+ if (!json) { return Slice.empty }
+ var openStart = json.openStart || 0, openEnd = json.openEnd || 0;
+ if (typeof openStart != "number" || typeof openEnd != "number")
+ { throw new RangeError("Invalid input for Slice.fromJSON") }
+ return new Slice(Fragment.fromJSON(schema, json.content), json.openStart || 0, json.openEnd || 0)
+};
+
+// :: (Fragment, ?bool) → Slice
+// Create a slice from a fragment by taking the maximum possible
+// open value on both side of the fragment.
+Slice.maxOpen = function maxOpen (fragment, openIsolating) {
+ if ( openIsolating === void 0 ) openIsolating=true;
+
+ var openStart = 0, openEnd = 0;
+ for (var n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild) { openStart++; }
+ for (var n$1 = fragment.lastChild; n$1 && !n$1.isLeaf && (openIsolating || !n$1.type.spec.isolating); n$1 = n$1.lastChild) { openEnd++; }
+ return new Slice(fragment, openStart, openEnd)
+};
+
+Object.defineProperties( Slice.prototype, prototypeAccessors$1 );
+
+function removeRange(content, from, to) {
+ var ref = content.findIndex(from);
+ var index = ref.index;
+ var offset = ref.offset;
+ var child = content.maybeChild(index);
+ var ref$1 = content.findIndex(to);
+ var indexTo = ref$1.index;
+ var offsetTo = ref$1.offset;
+ if (offset == from || child.isText) {
+ if (offsetTo != to && !content.child(indexTo).isText) { throw new RangeError("Removing non-flat range") }
+ return content.cut(0, from).append(content.cut(to))
+ }
+ if (index != indexTo) { throw new RangeError("Removing non-flat range") }
+ return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)))
+}
+
+function insertInto(content, dist, insert, parent) {
+ var ref = content.findIndex(dist);
+ var index = ref.index;
+ var offset = ref.offset;
+ var child = content.maybeChild(index);
+ if (offset == dist || child.isText) {
+ if (parent && !parent.canReplace(index, index, insert)) { return null }
+ return content.cut(0, dist).append(insert).append(content.cut(dist))
+ }
+ var inner = insertInto(child.content, dist - offset - 1, insert);
+ return inner && content.replaceChild(index, child.copy(inner))
+}
+
+// :: Slice
+// The empty slice.
+Slice.empty = new Slice(Fragment.empty, 0, 0);
+
+function replace($from, $to, slice) {
+ if (slice.openStart > $from.depth)
+ { throw new ReplaceError("Inserted content deeper than insertion position") }
+ if ($from.depth - slice.openStart != $to.depth - slice.openEnd)
+ { throw new ReplaceError("Inconsistent open depths") }
+ return replaceOuter($from, $to, slice, 0)
+}
+
+function replaceOuter($from, $to, slice, depth) {
+ var index = $from.index(depth), node = $from.node(depth);
+ if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {
+ var inner = replaceOuter($from, $to, slice, depth + 1);
+ return node.copy(node.content.replaceChild(index, inner))
+ } else if (!slice.content.size) {
+ return close(node, replaceTwoWay($from, $to, depth))
+ } else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case
+ var parent = $from.parent, content = parent.content;
+ return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)))
+ } else {
+ var ref = prepareSliceForReplace(slice, $from);
+ var start = ref.start;
+ var end = ref.end;
+ return close(node, replaceThreeWay($from, start, end, $to, depth))
+ }
+}
+
+function checkJoin(main, sub) {
+ if (!sub.type.compatibleContent(main.type))
+ { throw new ReplaceError("Cannot join " + sub.type.name + " onto " + main.type.name) }
+}
+
+function joinable($before, $after, depth) {
+ var node = $before.node(depth);
+ checkJoin(node, $after.node(depth));
+ return node
+}
+
+function addNode(child, target) {
+ var last = target.length - 1;
+ if (last >= 0 && child.isText && child.sameMarkup(target[last]))
+ { target[last] = child.withText(target[last].text + child.text); }
+ else
+ { target.push(child); }
+}
+
+function addRange($start, $end, depth, target) {
+ var node = ($end || $start).node(depth);
+ var startIndex = 0, endIndex = $end ? $end.index(depth) : node.childCount;
+ if ($start) {
+ startIndex = $start.index(depth);
+ if ($start.depth > depth) {
+ startIndex++;
+ } else if ($start.textOffset) {
+ addNode($start.nodeAfter, target);
+ startIndex++;
+ }
+ }
+ for (var i = startIndex; i < endIndex; i++) { addNode(node.child(i), target); }
+ if ($end && $end.depth == depth && $end.textOffset)
+ { addNode($end.nodeBefore, target); }
+}
+
+function close(node, content) {
+ if (!node.type.validContent(content))
+ { throw new ReplaceError("Invalid content for node " + node.type.name) }
+ return node.copy(content)
+}
+
+function replaceThreeWay($from, $start, $end, $to, depth) {
+ var openStart = $from.depth > depth && joinable($from, $start, depth + 1);
+ var openEnd = $to.depth > depth && joinable($end, $to, depth + 1);
+
+ var content = [];
+ addRange(null, $from, depth, content);
+ if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {
+ checkJoin(openStart, openEnd);
+ addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content);
+ } else {
+ if (openStart)
+ { addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content); }
+ addRange($start, $end, depth, content);
+ if (openEnd)
+ { addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content); }
+ }
+ addRange($to, null, depth, content);
+ return new Fragment(content)
+}
+
+function replaceTwoWay($from, $to, depth) {
+ var content = [];
+ addRange(null, $from, depth, content);
+ if ($from.depth > depth) {
+ var type = joinable($from, $to, depth + 1);
+ addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content);
+ }
+ addRange($to, null, depth, content);
+ return new Fragment(content)
+}
+
+function prepareSliceForReplace(slice, $along) {
+ var extra = $along.depth - slice.openStart, parent = $along.node(extra);
+ var node = parent.copy(slice.content);
+ for (var i = extra - 1; i >= 0; i--)
+ { node = $along.node(i).copy(Fragment.from(node)); }
+ return {start: node.resolveNoCache(slice.openStart + extra),
+ end: node.resolveNoCache(node.content.size - slice.openEnd - extra)}
+}
+
+// ::- You can [_resolve_](#model.Node.resolve) a position to get more
+// information about it. Objects of this class represent such a
+// resolved position, providing various pieces of context information,
+// and some helper methods.
+//
+// Throughout this interface, methods that take an optional `depth`
+// parameter will interpret undefined as `this.depth` and negative
+// numbers as `this.depth + value`.
+var ResolvedPos = function ResolvedPos(pos, path, parentOffset) {
+ // :: number The position that was resolved.
+ this.pos = pos;
+ this.path = path;
+ // :: number
+ // The number of levels the parent node is from the root. If this
+ // position points directly into the root node, it is 0. If it
+ // points into a top-level paragraph, 1, and so on.
+ this.depth = path.length / 3 - 1;
+ // :: number The offset this position has into its parent node.
+ this.parentOffset = parentOffset;
+};
+
+var prototypeAccessors$2 = { parent: { configurable: true },doc: { configurable: true },textOffset: { configurable: true },nodeAfter: { configurable: true },nodeBefore: { configurable: true } };
+
+ResolvedPos.prototype.resolveDepth = function resolveDepth (val) {
+ if (val == null) { return this.depth }
+ if (val < 0) { return this.depth + val }
+ return val
+};
+
+// :: Node
+// The parent node that the position points into. Note that even if
+// a position points into a text node, that node is not considered
+// the parent—text nodes are ‘flat’ in this model, and have no content.
+prototypeAccessors$2.parent.get = function () { return this.node(this.depth) };
+
+// :: Node
+// The root node in which the position was resolved.
+prototypeAccessors$2.doc.get = function () { return this.node(0) };
+
+// :: (?number) → Node
+// The ancestor node at the given level. `p.node(p.depth)` is the
+// same as `p.parent`.
+ResolvedPos.prototype.node = function node (depth) { return this.path[this.resolveDepth(depth) * 3] };
+
+// :: (?number) → number
+// The index into the ancestor at the given level. If this points at
+// the 3rd node in the 2nd paragraph on the top level, for example,
+// `p.index(0)` is 1 and `p.index(1)` is 2.
+ResolvedPos.prototype.index = function index (depth) { return this.path[this.resolveDepth(depth) * 3 + 1] };
+
+// :: (?number) → number
+// The index pointing after this position into the ancestor at the
+// given level.
+ResolvedPos.prototype.indexAfter = function indexAfter (depth) {
+ depth = this.resolveDepth(depth);
+ return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1)
+};
+
+// :: (?number) → number
+// The (absolute) position at the start of the node at the given
+// level.
+ResolvedPos.prototype.start = function start (depth) {
+ depth = this.resolveDepth(depth);
+ return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1
+};
+
+// :: (?number) → number
+// The (absolute) position at the end of the node at the given
+// level.
+ResolvedPos.prototype.end = function end (depth) {
+ depth = this.resolveDepth(depth);
+ return this.start(depth) + this.node(depth).content.size
+};
+
+// :: (?number) → number
+// The (absolute) position directly before the wrapping node at the
+// given level, or, when `depth` is `this.depth + 1`, the original
+// position.
+ResolvedPos.prototype.before = function before (depth) {
+ depth = this.resolveDepth(depth);
+ if (!depth) { throw new RangeError("There is no position before the top-level node") }
+ return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1]
+};
+
+// :: (?number) → number
+// The (absolute) position directly after the wrapping node at the
+// given level, or the original position when `depth` is `this.depth + 1`.
+ResolvedPos.prototype.after = function after (depth) {
+ depth = this.resolveDepth(depth);
+ if (!depth) { throw new RangeError("There is no position after the top-level node") }
+ return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize
+};
+
+// :: number
+// When this position points into a text node, this returns the
+// distance between the position and the start of the text node.
+// Will be zero for positions that point between nodes.
+prototypeAccessors$2.textOffset.get = function () { return this.pos - this.path[this.path.length - 1] };
+
+// :: ?Node
+// Get the node directly after the position, if any. If the position
+// points into a text node, only the part of that node after the
+// position is returned.
+prototypeAccessors$2.nodeAfter.get = function () {
+ var parent = this.parent, index = this.index(this.depth);
+ if (index == parent.childCount) { return null }
+ var dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index);
+ return dOff ? parent.child(index).cut(dOff) : child
+};
+
+// :: ?Node
+// Get the node directly before the position, if any. If the
+// position points into a text node, only the part of that node
+// before the position is returned.
+prototypeAccessors$2.nodeBefore.get = function () {
+ var index = this.index(this.depth);
+ var dOff = this.pos - this.path[this.path.length - 1];
+ if (dOff) { return this.parent.child(index).cut(0, dOff) }
+ return index == 0 ? null : this.parent.child(index - 1)
+};
+
+// :: () → [Mark]
+// Get the marks at this position, factoring in the surrounding
+// marks' [`inclusive`](#model.MarkSpec.inclusive) property. If the
+// position is at the start of a non-empty node, the marks of the
+// node after it (if any) are returned.
+ResolvedPos.prototype.marks = function marks () {
+ var parent = this.parent, index = this.index();
+
+ // In an empty parent, return the empty array
+ if (parent.content.size == 0) { return Mark.none }
+
+ // When inside a text node, just return the text node's marks
+ if (this.textOffset) { return parent.child(index).marks }
+
+ var main = parent.maybeChild(index - 1), other = parent.maybeChild(index);
+ // If the `after` flag is true of there is no node before, make
+ // the node after this position the main reference.
+ if (!main) { var tmp = main; main = other; other = tmp; }
+
+ // Use all marks in the main node, except those that have
+ // `inclusive` set to false and are not present in the other node.
+ var marks = main.marks;
+ for (var i = 0; i < marks.length; i++)
+ { if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))
+ { marks = marks[i--].removeFromSet(marks); } }
+
+ return marks
+};
+
+// :: (ResolvedPos) → ?[Mark]
+// Get the marks after the current position, if any, except those
+// that are non-inclusive and not present at position `$end`. This
+// is mostly useful for getting the set of marks to preserve after a
+// deletion. Will return `null` if this position is at the end of
+// its parent node or its parent node isn't a textblock (in which
+// case no marks should be preserved).
+ResolvedPos.prototype.marksAcross = function marksAcross ($end) {
+ var after = this.parent.maybeChild(this.index());
+ if (!after || !after.isInline) { return null }
+
+ var marks = after.marks, next = $end.parent.maybeChild($end.index());
+ for (var i = 0; i < marks.length; i++)
+ { if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))
+ { marks = marks[i--].removeFromSet(marks); } }
+ return marks
+};
+
+// :: (number) → number
+// The depth up to which this position and the given (non-resolved)
+// position share the same parent nodes.
+ResolvedPos.prototype.sharedDepth = function sharedDepth (pos) {
+ for (var depth = this.depth; depth > 0; depth--)
+ { if (this.start(depth) <= pos && this.end(depth) >= pos) { return depth } }
+ return 0
+};
+
+// :: (?ResolvedPos, ?(Node) → bool) → ?NodeRange
+// Returns a range based on the place where this position and the
+// given position diverge around block content. If both point into
+// the same textblock, for example, a range around that textblock
+// will be returned. If they point into different blocks, the range
+// around those blocks in their shared ancestor is returned. You can
+// pass in an optional predicate that will be called with a parent
+// node to see if a range into that parent is acceptable.
+ResolvedPos.prototype.blockRange = function blockRange (other, pred) {
+ if ( other === void 0 ) other = this;
+
+ if (other.pos < this.pos) { return other.blockRange(this) }
+ for (var d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)
+ { if (other.pos <= this.end(d) && (!pred || pred(this.node(d))))
+ { return new NodeRange(this, other, d) } }
+};
+
+// :: (ResolvedPos) → bool
+// Query whether the given position shares the same parent node.
+ResolvedPos.prototype.sameParent = function sameParent (other) {
+ return this.pos - this.parentOffset == other.pos - other.parentOffset
+};
+
+// :: (ResolvedPos) → ResolvedPos
+// Return the greater of this and the given position.
+ResolvedPos.prototype.max = function max (other) {
+ return other.pos > this.pos ? other : this
+};
+
+// :: (ResolvedPos) → ResolvedPos
+// Return the smaller of this and the given position.
+ResolvedPos.prototype.min = function min (other) {
+ return other.pos < this.pos ? other : this
+};
+
+ResolvedPos.prototype.toString = function toString () {
+ var str = "";
+ for (var i = 1; i <= this.depth; i++)
+ { str += (str ? "/" : "") + this.node(i).type.name + "_" + this.index(i - 1); }
+ return str + ":" + this.parentOffset
+};
+
+ResolvedPos.resolve = function resolve (doc, pos) {
+ if (!(pos >= 0 && pos <= doc.content.size)) { throw new RangeError("Position " + pos + " out of range") }
+ var path = [];
+ var start = 0, parentOffset = pos;
+ for (var node = doc;;) {
+ var ref = node.content.findIndex(parentOffset);
+ var index = ref.index;
+ var offset = ref.offset;
+ var rem = parentOffset - offset;
+ path.push(node, index, start + offset);
+ if (!rem) { break }
+ node = node.child(index);
+ if (node.isText) { break }
+ parentOffset = rem - 1;
+ start += offset + 1;
+ }
+ return new ResolvedPos(pos, path, parentOffset)
+};
+
+ResolvedPos.resolveCached = function resolveCached (doc, pos) {
+ for (var i = 0; i < resolveCache.length; i++) {
+ var cached = resolveCache[i];
+ if (cached.pos == pos && cached.doc == doc) { return cached }
+ }
+ var result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos);
+ resolveCachePos = (resolveCachePos + 1) % resolveCacheSize;
+ return result
+};
+
+Object.defineProperties( ResolvedPos.prototype, prototypeAccessors$2 );
+
+var resolveCache = [], resolveCachePos = 0, resolveCacheSize = 12;
+
+// ::- Represents a flat range of content, i.e. one that starts and
+// ends in the same node.
+var NodeRange = function NodeRange($from, $to, depth) {
+ // :: ResolvedPos A resolved position along the start of the
+ // content. May have a `depth` greater than this object's `depth`
+ // property, since these are the positions that were used to
+ // compute the range, not re-resolved positions directly at its
+ // boundaries.
+ this.$from = $from;
+ // :: ResolvedPos A position along the end of the content. See
+ // caveat for [`$from`](#model.NodeRange.$from).
+ this.$to = $to;
+ // :: number The depth of the node that this range points into.
+ this.depth = depth;
+};
+
+var prototypeAccessors$1$1 = { start: { configurable: true },end: { configurable: true },parent: { configurable: true },startIndex: { configurable: true },endIndex: { configurable: true } };
+
+// :: number The position at the start of the range.
+prototypeAccessors$1$1.start.get = function () { return this.$from.before(this.depth + 1) };
+// :: number The position at the end of the range.
+prototypeAccessors$1$1.end.get = function () { return this.$to.after(this.depth + 1) };
+
+// :: Node The parent node that the range points into.
+prototypeAccessors$1$1.parent.get = function () { return this.$from.node(this.depth) };
+// :: number The start index of the range in the parent node.
+prototypeAccessors$1$1.startIndex.get = function () { return this.$from.index(this.depth) };
+// :: number The end index of the range in the parent node.
+prototypeAccessors$1$1.endIndex.get = function () { return this.$to.indexAfter(this.depth) };
+
+Object.defineProperties( NodeRange.prototype, prototypeAccessors$1$1 );
+
+var emptyAttrs = Object.create(null);
+
+// ::- This class represents a node in the tree that makes up a
+// ProseMirror document. So a document is an instance of `Node`, with
+// children that are also instances of `Node`.
+//
+// Nodes are persistent data structures. Instead of changing them, you
+// create new ones with the content you want. Old ones keep pointing
+// at the old document shape. This is made cheaper by sharing
+// structure between the old and new data as much as possible, which a
+// tree shape like this (without back pointers) makes easy.
+//
+// **Do not** directly mutate the properties of a `Node` object. See
+// [the guide](/docs/guide/#doc) for more information.
+var Node = function Node(type, attrs, content, marks) {
+ // :: NodeType
+ // The type of node that this is.
+ this.type = type;
+
+ // :: Object
+ // An object mapping attribute names to values. The kind of
+ // attributes allowed and required are
+ // [determined](#model.NodeSpec.attrs) by the node type.
+ this.attrs = attrs;
+
+ // :: Fragment
+ // A container holding the node's children.
+ this.content = content || Fragment.empty;
+
+ // :: [Mark]
+ // The marks (things like whether it is emphasized or part of a
+ // link) applied to this node.
+ this.marks = marks || Mark.none;
+};
+
+var prototypeAccessors$3 = { nodeSize: { configurable: true },childCount: { configurable: true },textContent: { configurable: true },firstChild: { configurable: true },lastChild: { configurable: true },isBlock: { configurable: true },isTextblock: { configurable: true },inlineContent: { configurable: true },isInline: { configurable: true },isText: { configurable: true },isLeaf: { configurable: true },isAtom: { configurable: true } };
+
+// text:: ?string
+// For text nodes, this contains the node's text content.
+
+// :: number
+// The size of this node, as defined by the integer-based [indexing
+// scheme](/docs/guide/#doc.indexing). For text nodes, this is the
+// amount of characters. For other leaf nodes, it is one. For
+// non-leaf nodes, it is the size of the content plus two (the start
+// and end token).
+prototypeAccessors$3.nodeSize.get = function () { return this.isLeaf ? 1 : 2 + this.content.size };
+
+// :: number
+// The number of children that the node has.
+prototypeAccessors$3.childCount.get = function () { return this.content.childCount };
+
+// :: (number) → Node
+// Get the child node at the given index. Raises an error when the
+// index is out of range.
+Node.prototype.child = function child (index) { return this.content.child(index) };
+
+// :: (number) → ?Node
+// Get the child node at the given index, if it exists.
+Node.prototype.maybeChild = function maybeChild (index) { return this.content.maybeChild(index) };
+
+// :: ((node: Node, offset: number, index: number))
+// Call `f` for every child node, passing the node, its offset
+// into this parent node, and its index.
+Node.prototype.forEach = function forEach (f) { this.content.forEach(f); };
+
+// :: (number, number, (node: Node, pos: number, parent: Node, index: number) → ?bool, ?number)
+// Invoke a callback for all descendant nodes recursively between
+// the given two positions that are relative to start of this node's
+// content. The callback is invoked with the node, its
+// parent-relative position, its parent node, and its child index.
+// When the callback returns false for a given node, that node's
+// children will not be recursed over. The last parameter can be
+// used to specify a starting position to count from.
+Node.prototype.nodesBetween = function nodesBetween (from, to, f, startPos) {
+ if ( startPos === void 0 ) startPos = 0;
+
+ this.content.nodesBetween(from, to, f, startPos, this);
+};
+
+// :: ((node: Node, pos: number, parent: Node) → ?bool)
+// Call the given callback for every descendant node. Doesn't
+// descend into a node when the callback returns `false`.
+Node.prototype.descendants = function descendants (f) {
+ this.nodesBetween(0, this.content.size, f);
+};
+
+// :: string
+// Concatenates all the text nodes found in this fragment and its
+// children.
+prototypeAccessors$3.textContent.get = function () { return this.textBetween(0, this.content.size, "") };
+
+// :: (number, number, ?string, ?string) → string
+// Get all text between positions `from` and `to`. When
+// `blockSeparator` is given, it will be inserted whenever a new
+// block node is started. When `leafText` is given, it'll be
+// inserted for every non-text leaf node encountered.
+Node.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {
+ return this.content.textBetween(from, to, blockSeparator, leafText)
+};
+
+// :: ?Node
+// Returns this node's first child, or `null` if there are no
+// children.
+prototypeAccessors$3.firstChild.get = function () { return this.content.firstChild };
+
+// :: ?Node
+// Returns this node's last child, or `null` if there are no
+// children.
+prototypeAccessors$3.lastChild.get = function () { return this.content.lastChild };
+
+// :: (Node) → bool
+// Test whether two nodes represent the same piece of document.
+Node.prototype.eq = function eq (other) {
+ return this == other || (this.sameMarkup(other) && this.content.eq(other.content))
+};
+
+// :: (Node) → bool
+// Compare the markup (type, attributes, and marks) of this node to
+// those of another. Returns `true` if both have the same markup.
+Node.prototype.sameMarkup = function sameMarkup (other) {
+ return this.hasMarkup(other.type, other.attrs, other.marks)
+};
+
+// :: (NodeType, ?Object, ?[Mark]) → bool
+// Check whether this node's markup correspond to the given type,
+// attributes, and marks.
+Node.prototype.hasMarkup = function hasMarkup (type, attrs, marks) {
+ return this.type == type &&
+ compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) &&
+ Mark.sameSet(this.marks, marks || Mark.none)
+};
+
+// :: (?Fragment) → Node
+// Create a new node with the same markup as this node, containing
+// the given content (or empty, if no content is given).
+Node.prototype.copy = function copy (content) {
+ if ( content === void 0 ) content = null;
+
+ if (content == this.content) { return this }
+ return new this.constructor(this.type, this.attrs, content, this.marks)
+};
+
+// :: ([Mark]) → Node
+// Create a copy of this node, with the given set of marks instead
+// of the node's own marks.
+Node.prototype.mark = function mark (marks) {
+ return marks == this.marks ? this : new this.constructor(this.type, this.attrs, this.content, marks)
+};
+
+// :: (number, ?number) → Node
+// Create a copy of this node with only the content between the
+// given positions. If `to` is not given, it defaults to the end of
+// the node.
+Node.prototype.cut = function cut (from, to) {
+ if (from == 0 && to == this.content.size) { return this }
+ return this.copy(this.content.cut(from, to))
+};
+
+// :: (number, ?number) → Slice
+// Cut out the part of the document between the given positions, and
+// return it as a `Slice` object.
+Node.prototype.slice = function slice (from, to, includeParents) {
+ if ( to === void 0 ) to = this.content.size;
+ if ( includeParents === void 0 ) includeParents = false;
+
+ if (from == to) { return Slice.empty }
+
+ var $from = this.resolve(from), $to = this.resolve(to);
+ var depth = includeParents ? 0 : $from.sharedDepth(to);
+ var start = $from.start(depth), node = $from.node(depth);
+ var content = node.content.cut($from.pos - start, $to.pos - start);
+ return new Slice(content, $from.depth - depth, $to.depth - depth)
+};
+
+// :: (number, number, Slice) → Node
+// Replace the part of the document between the given positions with
+// the given slice. The slice must 'fit', meaning its open sides
+// must be able to connect to the surrounding content, and its
+// content nodes must be valid children for the node they are placed
+// into. If any of this is violated, an error of type
+// [`ReplaceError`](#model.ReplaceError) is thrown.
+Node.prototype.replace = function replace$1 (from, to, slice) {
+ return replace(this.resolve(from), this.resolve(to), slice)
+};
+
+// :: (number) → ?Node
+// Find the node directly after the given position.
+Node.prototype.nodeAt = function nodeAt (pos) {
+ for (var node = this;;) {
+ var ref = node.content.findIndex(pos);
+ var index = ref.index;
+ var offset = ref.offset;
+ node = node.maybeChild(index);
+ if (!node) { return null }
+ if (offset == pos || node.isText) { return node }
+ pos -= offset + 1;
+ }
+};
+
+// :: (number) → {node: ?Node, index: number, offset: number}
+// Find the (direct) child node after the given offset, if any,
+// and return it along with its index and offset relative to this
+// node.
+Node.prototype.childAfter = function childAfter (pos) {
+ var ref = this.content.findIndex(pos);
+ var index = ref.index;
+ var offset = ref.offset;
+ return {node: this.content.maybeChild(index), index: index, offset: offset}
+};
+
+// :: (number) → {node: ?Node, index: number, offset: number}
+// Find the (direct) child node before the given offset, if any,
+// and return it along with its index and offset relative to this
+// node.
+Node.prototype.childBefore = function childBefore (pos) {
+ if (pos == 0) { return {node: null, index: 0, offset: 0} }
+ var ref = this.content.findIndex(pos);
+ var index = ref.index;
+ var offset = ref.offset;
+ if (offset < pos) { return {node: this.content.child(index), index: index, offset: offset} }
+ var node = this.content.child(index - 1);
+ return {node: node, index: index - 1, offset: offset - node.nodeSize}
+};
+
+// :: (number) → ResolvedPos
+// Resolve the given position in the document, returning an
+// [object](#model.ResolvedPos) with information about its context.
+Node.prototype.resolve = function resolve (pos) { return ResolvedPos.resolveCached(this, pos) };
+
+Node.prototype.resolveNoCache = function resolveNoCache (pos) { return ResolvedPos.resolve(this, pos) };
+
+// :: (number, number, MarkType) → bool
+// Test whether a mark of the given type occurs in this document
+// between the two given positions.
+Node.prototype.rangeHasMark = function rangeHasMark (from, to, type) {
+ var found = false;
+ if (to > from) { this.nodesBetween(from, to, function (node) {
+ if (type.isInSet(node.marks)) { found = true; }
+ return !found
+ }); }
+ return found
+};
+
+// :: bool
+// True when this is a block (non-inline node)
+prototypeAccessors$3.isBlock.get = function () { return this.type.isBlock };
+
+// :: bool
+// True when this is a textblock node, a block node with inline
+// content.
+prototypeAccessors$3.isTextblock.get = function () { return this.type.isTextblock };
+
+// :: bool
+// True when this node allows inline content.
+prototypeAccessors$3.inlineContent.get = function () { return this.type.inlineContent };
+
+// :: bool
+// True when this is an inline node (a text node or a node that can
+// appear among text).
+prototypeAccessors$3.isInline.get = function () { return this.type.isInline };
+
+// :: bool
+// True when this is a text node.
+prototypeAccessors$3.isText.get = function () { return this.type.isText };
+
+// :: bool
+// True when this is a leaf node.
+prototypeAccessors$3.isLeaf.get = function () { return this.type.isLeaf };
+
+// :: bool
+// True when this is an atom, i.e. when it does not have directly
+// editable content. This is usually the same as `isLeaf`, but can
+// be configured with the [`atom` property](#model.NodeSpec.atom) on
+// a node's spec (typically used when the node is displayed as an
+// uneditable [node view](#view.NodeView)).
+prototypeAccessors$3.isAtom.get = function () { return this.type.isAtom };
+
+// :: () → string
+// Return a string representation of this node for debugging
+// purposes.
+Node.prototype.toString = function toString () {
+ if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }
+ var name = this.type.name;
+ if (this.content.size)
+ { name += "(" + this.content.toStringInner() + ")"; }
+ return wrapMarks(this.marks, name)
+};
+
+// :: (number) → ContentMatch
+// Get the content match in this node at the given index.
+Node.prototype.contentMatchAt = function contentMatchAt (index) {
+ var match = this.type.contentMatch.matchFragment(this.content, 0, index);
+ if (!match) { throw new Error("Called contentMatchAt on a node with invalid content") }
+ return match
+};
+
+// :: (number, number, ?Fragment, ?number, ?number) → bool
+// Test whether replacing the range between `from` and `to` (by
+// child index) with the given replacement fragment (which defaults
+// to the empty fragment) would leave the node's content valid. You
+// can optionally pass `start` and `end` indices into the
+// replacement fragment.
+Node.prototype.canReplace = function canReplace (from, to, replacement, start, end) {
+ if ( replacement === void 0 ) replacement = Fragment.empty;
+ if ( start === void 0 ) start = 0;
+ if ( end === void 0 ) end = replacement.childCount;
+
+ var one = this.contentMatchAt(from).matchFragment(replacement, start, end);
+ var two = one && one.matchFragment(this.content, to);
+ if (!two || !two.validEnd) { return false }
+ for (var i = start; i < end; i++) { if (!this.type.allowsMarks(replacement.child(i).marks)) { return false } }
+ return true
+};
+
+// :: (number, number, NodeType, ?[Mark]) → bool
+// Test whether replacing the range `from` to `to` (by index) with a
+// node of the given type would leave the node's content valid.
+Node.prototype.canReplaceWith = function canReplaceWith (from, to, type, marks) {
+ if (marks && !this.type.allowsMarks(marks)) { return false }
+ var start = this.contentMatchAt(from).matchType(type);
+ var end = start && start.matchFragment(this.content, to);
+ return end ? end.validEnd : false
+};
+
+// :: (Node) → bool
+// Test whether the given node's content could be appended to this
+// node. If that node is empty, this will only return true if there
+// is at least one node type that can appear in both nodes (to avoid
+// merging completely incompatible nodes).
+Node.prototype.canAppend = function canAppend (other) {
+ if (other.content.size) { return this.canReplace(this.childCount, this.childCount, other.content) }
+ else { return this.type.compatibleContent(other.type) }
+};
+
+// Unused. Left for backwards compatibility.
+Node.prototype.defaultContentType = function defaultContentType (at) {
+ return this.contentMatchAt(at).defaultType
+};
+
+// :: ()
+// Check whether this node and its descendants conform to the
+// schema, and raise error when they do not.
+Node.prototype.check = function check () {
+ if (!this.type.validContent(this.content))
+ { throw new RangeError(("Invalid content for node " + (this.type.name) + ": " + (this.content.toString().slice(0, 50)))) }
+ this.content.forEach(function (node) { return node.check(); });
+};
+
+// :: () → Object
+// Return a JSON-serializeable representation of this node.
+Node.prototype.toJSON = function toJSON () {
+ var obj = {type: this.type.name};
+ for (var _ in this.attrs) {
+ obj.attrs = this.attrs;
+ break
+ }
+ if (this.content.size)
+ { obj.content = this.content.toJSON(); }
+ if (this.marks.length)
+ { obj.marks = this.marks.map(function (n) { return n.toJSON(); }); }
+ return obj
+};
+
+// :: (Schema, Object) → Node
+// Deserialize a node from its JSON representation.
+Node.fromJSON = function fromJSON (schema, json) {
+ if (!json) { throw new RangeError("Invalid input for Node.fromJSON") }
+ var marks = null;
+ if (json.marks) {
+ if (!Array.isArray(json.marks)) { throw new RangeError("Invalid mark data for Node.fromJSON") }
+ marks = json.marks.map(schema.markFromJSON);
+ }
+ if (json.type == "text") {
+ if (typeof json.text != "string") { throw new RangeError("Invalid text node in JSON") }
+ return schema.text(json.text, marks)
+ }
+ var content = Fragment.fromJSON(schema, json.content);
+ return schema.nodeType(json.type).create(json.attrs, content, marks)
+};
+
+Object.defineProperties( Node.prototype, prototypeAccessors$3 );
+
+var TextNode = /*@__PURE__*/(function (Node) {
+ function TextNode(type, attrs, content, marks) {
+ Node.call(this, type, attrs, null, marks);
+
+ if (!content) { throw new RangeError("Empty text nodes are not allowed") }
+
+ this.text = content;
+ }
+
+ if ( Node ) TextNode.__proto__ = Node;
+ TextNode.prototype = Object.create( Node && Node.prototype );
+ TextNode.prototype.constructor = TextNode;
+
+ var prototypeAccessors$1 = { textContent: { configurable: true },nodeSize: { configurable: true } };
+
+ TextNode.prototype.toString = function toString () {
+ if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }
+ return wrapMarks(this.marks, JSON.stringify(this.text))
+ };
+
+ prototypeAccessors$1.textContent.get = function () { return this.text };
+
+ TextNode.prototype.textBetween = function textBetween (from, to) { return this.text.slice(from, to) };
+
+ prototypeAccessors$1.nodeSize.get = function () { return this.text.length };
+
+ TextNode.prototype.mark = function mark (marks) {
+ return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks)
+ };
+
+ TextNode.prototype.withText = function withText (text) {
+ if (text == this.text) { return this }
+ return new TextNode(this.type, this.attrs, text, this.marks)
+ };
+
+ TextNode.prototype.cut = function cut (from, to) {
+ if ( from === void 0 ) from = 0;
+ if ( to === void 0 ) to = this.text.length;
+
+ if (from == 0 && to == this.text.length) { return this }
+ return this.withText(this.text.slice(from, to))
+ };
+
+ TextNode.prototype.eq = function eq (other) {
+ return this.sameMarkup(other) && this.text == other.text
+ };
+
+ TextNode.prototype.toJSON = function toJSON () {
+ var base = Node.prototype.toJSON.call(this);
+ base.text = this.text;
+ return base
+ };
+
+ Object.defineProperties( TextNode.prototype, prototypeAccessors$1 );
+
+ return TextNode;
+}(Node));
+
+function wrapMarks(marks, str) {
+ for (var i = marks.length - 1; i >= 0; i--)
+ { str = marks[i].type.name + "(" + str + ")"; }
+ return str
+}
+
+// ::- Instances of this class represent a match state of a node
+// type's [content expression](#model.NodeSpec.content), and can be
+// used to find out whether further content matches here, and whether
+// a given position is a valid end of the node.
+var ContentMatch = function ContentMatch(validEnd) {
+ // :: bool
+ // True when this match state represents a valid end of the node.
+ this.validEnd = validEnd;
+ this.next = [];
+ this.wrapCache = [];
+};
+
+var prototypeAccessors$4 = { inlineContent: { configurable: true },defaultType: { configurable: true },edgeCount: { configurable: true } };
+
+ContentMatch.parse = function parse (string, nodeTypes) {
+ var stream = new TokenStream(string, nodeTypes);
+ if (stream.next == null) { return ContentMatch.empty }
+ var expr = parseExpr(stream);
+ if (stream.next) { stream.err("Unexpected trailing text"); }
+ var match = dfa(nfa(expr));
+ checkForDeadEnds(match, stream);
+ return match
+};
+
+// :: (NodeType) → ?ContentMatch
+// Match a node type, returning a match after that node if
+// successful.
+ContentMatch.prototype.matchType = function matchType (type) {
+ for (var i = 0; i < this.next.length; i += 2)
+ { if (this.next[i] == type) { return this.next[i + 1] } }
+ return null
+};
+
+// :: (Fragment, ?number, ?number) → ?ContentMatch
+// Try to match a fragment. Returns the resulting match when
+// successful.
+ContentMatch.prototype.matchFragment = function matchFragment (frag, start, end) {
+ if ( start === void 0 ) start = 0;
+ if ( end === void 0 ) end = frag.childCount;
+
+ var cur = this;
+ for (var i = start; cur && i < end; i++)
+ { cur = cur.matchType(frag.child(i).type); }
+ return cur
+};
+
+prototypeAccessors$4.inlineContent.get = function () {
+ var first = this.next[0];
+ return first ? first.isInline : false
+};
+
+// :: ?NodeType
+// Get the first matching node type at this match position that can
+// be generated.
+prototypeAccessors$4.defaultType.get = function () {
+ for (var i = 0; i < this.next.length; i += 2) {
+ var type = this.next[i];
+ if (!(type.isText || type.hasRequiredAttrs())) { return type }
+ }
+};
+
+ContentMatch.prototype.compatible = function compatible (other) {
+ for (var i = 0; i < this.next.length; i += 2)
+ { for (var j = 0; j < other.next.length; j += 2)
+ { if (this.next[i] == other.next[j]) { return true } } }
+ return false
+};
+
+// :: (Fragment, bool, ?number) → ?Fragment
+// Try to match the given fragment, and if that fails, see if it can
+// be made to match by inserting nodes in front of it. When
+// successful, return a fragment of inserted nodes (which may be
+// empty if nothing had to be inserted). When `toEnd` is true, only
+// return a fragment if the resulting match goes to the end of the
+// content expression.
+ContentMatch.prototype.fillBefore = function fillBefore (after, toEnd, startIndex) {
+ if ( toEnd === void 0 ) toEnd = false;
+ if ( startIndex === void 0 ) startIndex = 0;
+
+ var seen = [this];
+ function search(match, types) {
+ var finished = match.matchFragment(after, startIndex);
+ if (finished && (!toEnd || finished.validEnd))
+ { return Fragment.from(types.map(function (tp) { return tp.createAndFill(); })) }
+
+ for (var i = 0; i < match.next.length; i += 2) {
+ var type = match.next[i], next = match.next[i + 1];
+ if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {
+ seen.push(next);
+ var found = search(next, types.concat(type));
+ if (found) { return found }
+ }
+ }
+ }
+
+ return search(this, [])
+};
+
+// :: (NodeType) → ?[NodeType]
+// Find a set of wrapping node types that would allow a node of the
+// given type to appear at this position. The result may be empty
+// (when it fits directly) and will be null when no such wrapping
+// exists.
+ContentMatch.prototype.findWrapping = function findWrapping (target) {
+ for (var i = 0; i < this.wrapCache.length; i += 2)
+ { if (this.wrapCache[i] == target) { return this.wrapCache[i + 1] } }
+ var computed = this.computeWrapping(target);
+ this.wrapCache.push(target, computed);
+ return computed
+};
+
+ContentMatch.prototype.computeWrapping = function computeWrapping (target) {
+ var seen = Object.create(null), active = [{match: this, type: null, via: null}];
+ while (active.length) {
+ var current = active.shift(), match = current.match;
+ if (match.matchType(target)) {
+ var result = [];
+ for (var obj = current; obj.type; obj = obj.via)
+ { result.push(obj.type); }
+ return result.reverse()
+ }
+ for (var i = 0; i < match.next.length; i += 2) {
+ var type = match.next[i];
+ if (!type.isLeaf && !type.hasRequiredAttrs() && !(type.name in seen) && (!current.type || match.next[i + 1].validEnd)) {
+ active.push({match: type.contentMatch, type: type, via: current});
+ seen[type.name] = true;
+ }
+ }
+ }
+};
+
+// :: number
+// The number of outgoing edges this node has in the finite
+// automaton that describes the content expression.
+prototypeAccessors$4.edgeCount.get = function () {
+ return this.next.length >> 1
+};
+
+// :: (number) → {type: NodeType, next: ContentMatch}
+// Get the _n_th outgoing edge from this node in the finite
+// automaton that describes the content expression.
+ContentMatch.prototype.edge = function edge (n) {
+ var i = n << 1;
+ if (i >= this.next.length) { throw new RangeError(("There's no " + n + "th edge in this content match")) }
+ return {type: this.next[i], next: this.next[i + 1]}
+};
+
+ContentMatch.prototype.toString = function toString () {
+ var seen = [];
+ function scan(m) {
+ seen.push(m);
+ for (var i = 1; i < m.next.length; i += 2)
+ { if (seen.indexOf(m.next[i]) == -1) { scan(m.next[i]); } }
+ }
+ scan(this);
+ return seen.map(function (m, i) {
+ var out = i + (m.validEnd ? "*" : " ") + " ";
+ for (var i$1 = 0; i$1 < m.next.length; i$1 += 2)
+ { out += (i$1 ? ", " : "") + m.next[i$1].name + "->" + seen.indexOf(m.next[i$1 + 1]); }
+ return out
+ }).join("\n")
+};
+
+Object.defineProperties( ContentMatch.prototype, prototypeAccessors$4 );
+
+ContentMatch.empty = new ContentMatch(true);
+
+var TokenStream = function TokenStream(string, nodeTypes) {
+ this.string = string;
+ this.nodeTypes = nodeTypes;
+ this.inline = null;
+ this.pos = 0;
+ this.tokens = string.split(/\s*(?=\b|\W|$)/);
+ if (this.tokens[this.tokens.length - 1] == "") { this.tokens.pop(); }
+ if (this.tokens[0] == "") { this.tokens.unshift(); }
+};
+
+var prototypeAccessors$1$2 = { next: { configurable: true } };
+
+prototypeAccessors$1$2.next.get = function () { return this.tokens[this.pos] };
+
+TokenStream.prototype.eat = function eat (tok) { return this.next == tok && (this.pos++ || true) };
+
+TokenStream.prototype.err = function err (str) { throw new SyntaxError(str + " (in content expression '" + this.string + "')") };
+
+Object.defineProperties( TokenStream.prototype, prototypeAccessors$1$2 );
+
+function parseExpr(stream) {
+ var exprs = [];
+ do { exprs.push(parseExprSeq(stream)); }
+ while (stream.eat("|"))
+ return exprs.length == 1 ? exprs[0] : {type: "choice", exprs: exprs}
+}
+
+function parseExprSeq(stream) {
+ var exprs = [];
+ do { exprs.push(parseExprSubscript(stream)); }
+ while (stream.next && stream.next != ")" && stream.next != "|")
+ return exprs.length == 1 ? exprs[0] : {type: "seq", exprs: exprs}
+}
+
+function parseExprSubscript(stream) {
+ var expr = parseExprAtom(stream);
+ for (;;) {
+ if (stream.eat("+"))
+ { expr = {type: "plus", expr: expr}; }
+ else if (stream.eat("*"))
+ { expr = {type: "star", expr: expr}; }
+ else if (stream.eat("?"))
+ { expr = {type: "opt", expr: expr}; }
+ else if (stream.eat("{"))
+ { expr = parseExprRange(stream, expr); }
+ else { break }
+ }
+ return expr
+}
+
+function parseNum(stream) {
+ if (/\D/.test(stream.next)) { stream.err("Expected number, got '" + stream.next + "'"); }
+ var result = Number(stream.next);
+ stream.pos++;
+ return result
+}
+
+function parseExprRange(stream, expr) {
+ var min = parseNum(stream), max = min;
+ if (stream.eat(",")) {
+ if (stream.next != "}") { max = parseNum(stream); }
+ else { max = -1; }
+ }
+ if (!stream.eat("}")) { stream.err("Unclosed braced range"); }
+ return {type: "range", min: min, max: max, expr: expr}
+}
+
+function resolveName(stream, name) {
+ var types = stream.nodeTypes, type = types[name];
+ if (type) { return [type] }
+ var result = [];
+ for (var typeName in types) {
+ var type$1 = types[typeName];
+ if (type$1.groups.indexOf(name) > -1) { result.push(type$1); }
+ }
+ if (result.length == 0) { stream.err("No node type or group '" + name + "' found"); }
+ return result
+}
+
+function parseExprAtom(stream) {
+ if (stream.eat("(")) {
+ var expr = parseExpr(stream);
+ if (!stream.eat(")")) { stream.err("Missing closing paren"); }
+ return expr
+ } else if (!/\W/.test(stream.next)) {
+ var exprs = resolveName(stream, stream.next).map(function (type) {
+ if (stream.inline == null) { stream.inline = type.isInline; }
+ else if (stream.inline != type.isInline) { stream.err("Mixing inline and block content"); }
+ return {type: "name", value: type}
+ });
+ stream.pos++;
+ return exprs.length == 1 ? exprs[0] : {type: "choice", exprs: exprs}
+ } else {
+ stream.err("Unexpected token '" + stream.next + "'");
+ }
+}
+
+// The code below helps compile a regular-expression-like language
+// into a deterministic finite automaton. For a good introduction to
+// these concepts, see https://swtch.com/~rsc/regexp/regexp1.html
+
+// : (Object) → [[{term: ?any, to: number}]]
+// Construct an NFA from an expression as returned by the parser. The
+// NFA is represented as an array of states, which are themselves
+// arrays of edges, which are `{term, to}` objects. The first state is
+// the entry state and the last node is the success state.
+//
+// Note that unlike typical NFAs, the edge ordering in this one is
+// significant, in that it is used to contruct filler content when
+// necessary.
+function nfa(expr) {
+ var nfa = [[]];
+ connect(compile(expr, 0), node());
+ return nfa
+
+ function node() { return nfa.push([]) - 1 }
+ function edge(from, to, term) {
+ var edge = {term: term, to: to};
+ nfa[from].push(edge);
+ return edge
+ }
+ function connect(edges, to) { edges.forEach(function (edge) { return edge.to = to; }); }
+
+ function compile(expr, from) {
+ if (expr.type == "choice") {
+ return expr.exprs.reduce(function (out, expr) { return out.concat(compile(expr, from)); }, [])
+ } else if (expr.type == "seq") {
+ for (var i = 0;; i++) {
+ var next = compile(expr.exprs[i], from);
+ if (i == expr.exprs.length - 1) { return next }
+ connect(next, from = node());
+ }
+ } else if (expr.type == "star") {
+ var loop = node();
+ edge(from, loop);
+ connect(compile(expr.expr, loop), loop);
+ return [edge(loop)]
+ } else if (expr.type == "plus") {
+ var loop$1 = node();
+ connect(compile(expr.expr, from), loop$1);
+ connect(compile(expr.expr, loop$1), loop$1);
+ return [edge(loop$1)]
+ } else if (expr.type == "opt") {
+ return [edge(from)].concat(compile(expr.expr, from))
+ } else if (expr.type == "range") {
+ var cur = from;
+ for (var i$1 = 0; i$1 < expr.min; i$1++) {
+ var next$1 = node();
+ connect(compile(expr.expr, cur), next$1);
+ cur = next$1;
+ }
+ if (expr.max == -1) {
+ connect(compile(expr.expr, cur), cur);
+ } else {
+ for (var i$2 = expr.min; i$2 < expr.max; i$2++) {
+ var next$2 = node();
+ edge(cur, next$2);
+ connect(compile(expr.expr, cur), next$2);
+ cur = next$2;
+ }
+ }
+ return [edge(cur)]
+ } else if (expr.type == "name") {
+ return [edge(from, null, expr.value)]
+ }
+ }
+}
+
+function cmp(a, b) { return b - a }
+
+// Get the set of nodes reachable by null edges from `node`. Omit
+// nodes with only a single null-out-edge, since they may lead to
+// needless duplicated nodes.
+function nullFrom(nfa, node) {
+ var result = [];
+ scan(node);
+ return result.sort(cmp)
+
+ function scan(node) {
+ var edges = nfa[node];
+ if (edges.length == 1 && !edges[0].term) { return scan(edges[0].to) }
+ result.push(node);
+ for (var i = 0; i < edges.length; i++) {
+ var ref = edges[i];
+ var term = ref.term;
+ var to = ref.to;
+ if (!term && result.indexOf(to) == -1) { scan(to); }
+ }
+ }
+}
+
+// : ([[{term: ?any, to: number}]]) → ContentMatch
+// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set
+// of state objects (`ContentMatch` instances) with transitions
+// between them.
+function dfa(nfa) {
+ var labeled = Object.create(null);
+ return explore(nullFrom(nfa, 0))
+
+ function explore(states) {
+ var out = [];
+ states.forEach(function (node) {
+ nfa[node].forEach(function (ref) {
+ var term = ref.term;
+ var to = ref.to;
+
+ if (!term) { return }
+ var known = out.indexOf(term), set = known > -1 && out[known + 1];
+ nullFrom(nfa, to).forEach(function (node) {
+ if (!set) { out.push(term, set = []); }
+ if (set.indexOf(node) == -1) { set.push(node); }
+ });
+ });
+ });
+ var state = labeled[states.join(",")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1);
+ for (var i = 0; i < out.length; i += 2) {
+ var states$1 = out[i + 1].sort(cmp);
+ state.next.push(out[i], labeled[states$1.join(",")] || explore(states$1));
+ }
+ return state
+ }
+}
+
+function checkForDeadEnds(match, stream) {
+ for (var i = 0, work = [match]; i < work.length; i++) {
+ var state = work[i], dead = !state.validEnd, nodes = [];
+ for (var j = 0; j < state.next.length; j += 2) {
+ var node = state.next[j], next = state.next[j + 1];
+ nodes.push(node.name);
+ if (dead && !(node.isText || node.hasRequiredAttrs())) { dead = false; }
+ if (work.indexOf(next) == -1) { work.push(next); }
+ }
+ if (dead) { stream.err("Only non-generatable nodes (" + nodes.join(", ") + ") in a required position"); }
+ }
+}
+
+// For node types where all attrs have a default value (or which don't
+// have any attributes), build up a single reusable default attribute
+// object, and use it for all nodes that don't specify specific
+// attributes.
+function defaultAttrs(attrs) {
+ var defaults = Object.create(null);
+ for (var attrName in attrs) {
+ var attr = attrs[attrName];
+ if (!attr.hasDefault) { return null }
+ defaults[attrName] = attr.default;
+ }
+ return defaults
+}
+
+function computeAttrs(attrs, value) {
+ var built = Object.create(null);
+ for (var name in attrs) {
+ var given = value && value[name];
+ if (given === undefined) {
+ var attr = attrs[name];
+ if (attr.hasDefault) { given = attr.default; }
+ else { throw new RangeError("No value supplied for attribute " + name) }
+ }
+ built[name] = given;
+ }
+ return built
+}
+
+function initAttrs(attrs) {
+ var result = Object.create(null);
+ if (attrs) { for (var name in attrs) { result[name] = new Attribute(attrs[name]); } }
+ return result
+}
+
+// ::- Node types are objects allocated once per `Schema` and used to
+// [tag](#model.Node.type) `Node` instances. They contain information
+// about the node type, such as its name and what kind of node it
+// represents.
+var NodeType = function NodeType(name, schema, spec) {
+ // :: string
+ // The name the node type has in this schema.
+ this.name = name;
+
+ // :: Schema
+ // A link back to the `Schema` the node type belongs to.
+ this.schema = schema;
+
+ // :: NodeSpec
+ // The spec that this type is based on
+ this.spec = spec;
+
+ this.groups = spec.group ? spec.group.split(" ") : [];
+ this.attrs = initAttrs(spec.attrs);
+
+ this.defaultAttrs = defaultAttrs(this.attrs);
+
+ // :: ContentMatch
+ // The starting match of the node type's content expression.
+ this.contentMatch = null;
+
+ // : ?[MarkType]
+ // The set of marks allowed in this node. `null` means all marks
+ // are allowed.
+ this.markSet = null;
+
+ // :: bool
+ // True if this node type has inline content.
+ this.inlineContent = null;
+
+ // :: bool
+ // True if this is a block type
+ this.isBlock = !(spec.inline || name == "text");
+
+ // :: bool
+ // True if this is the text node type.
+ this.isText = name == "text";
+};
+
+var prototypeAccessors$5 = { isInline: { configurable: true },isTextblock: { configurable: true },isLeaf: { configurable: true },isAtom: { configurable: true } };
+
+// :: bool
+// True if this is an inline type.
+prototypeAccessors$5.isInline.get = function () { return !this.isBlock };
+
+// :: bool
+// True if this is a textblock type, a block that contains inline
+// content.
+prototypeAccessors$5.isTextblock.get = function () { return this.isBlock && this.inlineContent };
+
+// :: bool
+// True for node types that allow no content.
+prototypeAccessors$5.isLeaf.get = function () { return this.contentMatch == ContentMatch.empty };
+
+// :: bool
+// True when this node is an atom, i.e. when it does not have
+// directly editable content.
+prototypeAccessors$5.isAtom.get = function () { return this.isLeaf || this.spec.atom };
+
+NodeType.prototype.hasRequiredAttrs = function hasRequiredAttrs (ignore) {
+ for (var n in this.attrs)
+ { if (this.attrs[n].isRequired && (!ignore || !(n in ignore))) { return true } }
+ return false
+};
+
+NodeType.prototype.compatibleContent = function compatibleContent (other) {
+ return this == other || this.contentMatch.compatible(other.contentMatch)
+};
+
+NodeType.prototype.computeAttrs = function computeAttrs$1 (attrs) {
+ if (!attrs && this.defaultAttrs) { return this.defaultAttrs }
+ else { return computeAttrs(this.attrs, attrs) }
+};
+
+// :: (?Object, ?union, ?[Mark]) → Node
+// Create a `Node` of this type. The given attributes are
+// checked and defaulted (you can pass `null` to use the type's
+// defaults entirely, if no required attributes exist). `content`
+// may be a `Fragment`, a node, an array of nodes, or
+// `null`. Similarly `marks` may be `null` to default to the empty
+// set of marks.
+NodeType.prototype.create = function create (attrs, content, marks) {
+ if (this.isText) { throw new Error("NodeType.create can't construct text nodes") }
+ return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark.setFrom(marks))
+};
+
+// :: (?Object, ?union, ?[Mark]) → Node
+// Like [`create`](#model.NodeType.create), but check the given content
+// against the node type's content restrictions, and throw an error
+// if it doesn't match.
+NodeType.prototype.createChecked = function createChecked (attrs, content, marks) {
+ content = Fragment.from(content);
+ if (!this.validContent(content))
+ { throw new RangeError("Invalid content for node " + this.name) }
+ return new Node(this, this.computeAttrs(attrs), content, Mark.setFrom(marks))
+};
+
+// :: (?Object, ?union, ?[Mark]) → ?Node
+// Like [`create`](#model.NodeType.create), but see if it is necessary to
+// add nodes to the start or end of the given fragment to make it
+// fit the node. If no fitting wrapping can be found, return null.
+// Note that, due to the fact that required nodes can always be
+// created, this will always succeed if you pass null or
+// `Fragment.empty` as content.
+NodeType.prototype.createAndFill = function createAndFill (attrs, content, marks) {
+ attrs = this.computeAttrs(attrs);
+ content = Fragment.from(content);
+ if (content.size) {
+ var before = this.contentMatch.fillBefore(content);
+ if (!before) { return null }
+ content = before.append(content);
+ }
+ var after = this.contentMatch.matchFragment(content).fillBefore(Fragment.empty, true);
+ if (!after) { return null }
+ return new Node(this, attrs, content.append(after), Mark.setFrom(marks))
+};
+
+// :: (Fragment) → bool
+// Returns true if the given fragment is valid content for this node
+// type with the given attributes.
+NodeType.prototype.validContent = function validContent (content) {
+ var result = this.contentMatch.matchFragment(content);
+ if (!result || !result.validEnd) { return false }
+ for (var i = 0; i < content.childCount; i++)
+ { if (!this.allowsMarks(content.child(i).marks)) { return false } }
+ return true
+};
+
+// :: (MarkType) → bool
+// Check whether the given mark type is allowed in this node.
+NodeType.prototype.allowsMarkType = function allowsMarkType (markType) {
+ return this.markSet == null || this.markSet.indexOf(markType) > -1
+};
+
+// :: ([Mark]) → bool
+// Test whether the given set of marks are allowed in this node.
+NodeType.prototype.allowsMarks = function allowsMarks (marks) {
+ if (this.markSet == null) { return true }
+ for (var i = 0; i < marks.length; i++) { if (!this.allowsMarkType(marks[i].type)) { return false } }
+ return true
+};
+
+// :: ([Mark]) → [Mark]
+// Removes the marks that are not allowed in this node from the given set.
+NodeType.prototype.allowedMarks = function allowedMarks (marks) {
+ if (this.markSet == null) { return marks }
+ var copy;
+ for (var i = 0; i < marks.length; i++) {
+ if (!this.allowsMarkType(marks[i].type)) {
+ if (!copy) { copy = marks.slice(0, i); }
+ } else if (copy) {
+ copy.push(marks[i]);
+ }
+ }
+ return !copy ? marks : copy.length ? copy : Mark.empty
+};
+
+NodeType.compile = function compile (nodes, schema) {
+ var result = Object.create(null);
+ nodes.forEach(function (name, spec) { return result[name] = new NodeType(name, schema, spec); });
+
+ var topType = schema.spec.topNode || "doc";
+ if (!result[topType]) { throw new RangeError("Schema is missing its top node type ('" + topType + "')") }
+ if (!result.text) { throw new RangeError("Every schema needs a 'text' type") }
+ for (var _ in result.text.attrs) { throw new RangeError("The text node type should not have attributes") }
+
+ return result
+};
+
+Object.defineProperties( NodeType.prototype, prototypeAccessors$5 );
+
+// Attribute descriptors
+
+var Attribute = function Attribute(options) {
+ this.hasDefault = Object.prototype.hasOwnProperty.call(options, "default");
+ this.default = options.default;
+};
+
+var prototypeAccessors$1$3 = { isRequired: { configurable: true } };
+
+prototypeAccessors$1$3.isRequired.get = function () {
+ return !this.hasDefault
+};
+
+Object.defineProperties( Attribute.prototype, prototypeAccessors$1$3 );
+
+// Marks
+
+// ::- Like nodes, marks (which are associated with nodes to signify
+// things like emphasis or being part of a link) are
+// [tagged](#model.Mark.type) with type objects, which are
+// instantiated once per `Schema`.
+var MarkType = function MarkType(name, rank, schema, spec) {
+ // :: string
+ // The name of the mark type.
+ this.name = name;
+
+ // :: Schema
+ // The schema that this mark type instance is part of.
+ this.schema = schema;
+
+ // :: MarkSpec
+ // The spec on which the type is based.
+ this.spec = spec;
+
+ this.attrs = initAttrs(spec.attrs);
+
+ this.rank = rank;
+ this.excluded = null;
+ var defaults = defaultAttrs(this.attrs);
+ this.instance = defaults && new Mark(this, defaults);
+};
+
+// :: (?Object) → Mark
+// Create a mark of this type. `attrs` may be `null` or an object
+// containing only some of the mark's attributes. The others, if
+// they have defaults, will be added.
+MarkType.prototype.create = function create (attrs) {
+ if (!attrs && this.instance) { return this.instance }
+ return new Mark(this, computeAttrs(this.attrs, attrs))
+};
+
+MarkType.compile = function compile (marks, schema) {
+ var result = Object.create(null), rank = 0;
+ marks.forEach(function (name, spec) { return result[name] = new MarkType(name, rank++, schema, spec); });
+ return result
+};
+
+// :: ([Mark]) → [Mark]
+// When there is a mark of this type in the given set, a new set
+// without it is returned. Otherwise, the input set is returned.
+MarkType.prototype.removeFromSet = function removeFromSet (set) {
+ for (var i = 0; i < set.length; i++)
+ { if (set[i].type == this)
+ { return set.slice(0, i).concat(set.slice(i + 1)) } }
+ return set
+};
+
+// :: ([Mark]) → ?Mark
+// Tests whether there is a mark of this type in the given set.
+MarkType.prototype.isInSet = function isInSet (set) {
+ for (var i = 0; i < set.length; i++)
+ { if (set[i].type == this) { return set[i] } }
+};
+
+// :: (MarkType) → bool
+// Queries whether a given mark type is
+// [excluded](#model.MarkSpec.excludes) by this one.
+MarkType.prototype.excludes = function excludes (other) {
+ return this.excluded.indexOf(other) > -1
+};
+
+// SchemaSpec:: interface
+// An object describing a schema, as passed to the [`Schema`](#model.Schema)
+// constructor.
+//
+// nodes:: union, OrderedMap>
+// The node types in this schema. Maps names to
+// [`NodeSpec`](#model.NodeSpec) objects that describe the node type
+// associated with that name. Their order is significant—it
+// determines which [parse rules](#model.NodeSpec.parseDOM) take
+// precedence by default, and which nodes come first in a given
+// [group](#model.NodeSpec.group).
+//
+// marks:: ?union, OrderedMap>
+// The mark types that exist in this schema. The order in which they
+// are provided determines the order in which [mark
+// sets](#model.Mark.addToSet) are sorted and in which [parse
+// rules](#model.MarkSpec.parseDOM) are tried.
+//
+// topNode:: ?string
+// The name of the default top-level node for the schema. Defaults
+// to `"doc"`.
+
+// NodeSpec:: interface
+//
+// content:: ?string
+// The content expression for this node, as described in the [schema
+// guide](/docs/guide/#schema.content_expressions). When not given,
+// the node does not allow any content.
+//
+// marks:: ?string
+// The marks that are allowed inside of this node. May be a
+// space-separated string referring to mark names or groups, `"_"`
+// to explicitly allow all marks, or `""` to disallow marks. When
+// not given, nodes with inline content default to allowing all
+// marks, other nodes default to not allowing marks.
+//
+// group:: ?string
+// The group or space-separated groups to which this node belongs,
+// which can be referred to in the content expressions for the
+// schema.
+//
+// inline:: ?bool
+// Should be set to true for inline nodes. (Implied for text nodes.)
+//
+// atom:: ?bool
+// Can be set to true to indicate that, though this isn't a [leaf
+// node](#model.NodeType.isLeaf), it doesn't have directly editable
+// content and should be treated as a single unit in the view.
+//
+// attrs:: ?Object
+// The attributes that nodes of this type get.
+//
+// selectable:: ?bool
+// Controls whether nodes of this type can be selected as a [node
+// selection](#state.NodeSelection). Defaults to true for non-text
+// nodes.
+//
+// draggable:: ?bool
+// Determines whether nodes of this type can be dragged without
+// being selected. Defaults to false.
+//
+// code:: ?bool
+// Can be used to indicate that this node contains code, which
+// causes some commands to behave differently.
+//
+// defining:: ?bool
+// Determines whether this node is considered an important parent
+// node during replace operations (such as paste). Non-defining (the
+// default) nodes get dropped when their entire content is replaced,
+// whereas defining nodes persist and wrap the inserted content.
+// Likewise, in _inserted_ content the defining parents of the
+// content are preserved when possible. Typically,
+// non-default-paragraph textblock types, and possibly list items,
+// are marked as defining.
+//
+// isolating:: ?bool
+// When enabled (default is false), the sides of nodes of this type
+// count as boundaries that regular editing operations, like
+// backspacing or lifting, won't cross. An example of a node that
+// should probably have this enabled is a table cell.
+//
+// toDOM:: ?(node: Node) → DOMOutputSpec
+// Defines the default way a node of this type should be serialized
+// to DOM/HTML (as used by
+// [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)).
+// Should return a DOM node or an [array
+// structure](#model.DOMOutputSpec) that describes one, with an
+// optional number zero (“hole”) in it to indicate where the node's
+// content should be inserted.
+//
+// For text nodes, the default is to create a text DOM node. Though
+// it is possible to create a serializer where text is rendered
+// differently, this is not supported inside the editor, so you
+// shouldn't override that in your text node spec.
+//
+// parseDOM:: ?[ParseRule]
+// Associates DOM parser information with this node, which can be
+// used by [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) to
+// automatically derive a parser. The `node` field in the rules is
+// implied (the name of this node will be filled in automatically).
+// If you supply your own parser, you do not need to also specify
+// parsing rules in your schema.
+//
+// toDebugString:: ?(node: Node) -> string
+// Defines the default way a node of this type should be serialized
+// to a string representation for debugging (e.g. in error messages).
+
+// MarkSpec:: interface
+//
+// attrs:: ?Object
+// The attributes that marks of this type get.
+//
+// inclusive:: ?bool
+// Whether this mark should be active when the cursor is positioned
+// at its end (or at its start when that is also the start of the
+// parent node). Defaults to true.
+//
+// excludes:: ?string
+// Determines which other marks this mark can coexist with. Should
+// be a space-separated strings naming other marks or groups of marks.
+// When a mark is [added](#model.Mark.addToSet) to a set, all marks
+// that it excludes are removed in the process. If the set contains
+// any mark that excludes the new mark but is not, itself, excluded
+// by the new mark, the mark can not be added an the set. You can
+// use the value `"_"` to indicate that the mark excludes all
+// marks in the schema.
+//
+// Defaults to only being exclusive with marks of the same type. You
+// can set it to an empty string (or any string not containing the
+// mark's own name) to allow multiple marks of a given type to
+// coexist (as long as they have different attributes).
+//
+// group:: ?string
+// The group or space-separated groups to which this mark belongs.
+//
+// spanning:: ?bool
+// Determines whether marks of this type can span multiple adjacent
+// nodes when serialized to DOM/HTML. Defaults to true.
+//
+// toDOM:: ?(mark: Mark, inline: bool) → DOMOutputSpec
+// Defines the default way marks of this type should be serialized
+// to DOM/HTML. When the resulting spec contains a hole, that is
+// where the marked content is placed. Otherwise, it is appended to
+// the top node.
+//
+// parseDOM:: ?[ParseRule]
+// Associates DOM parser information with this mark (see the
+// corresponding [node spec field](#model.NodeSpec.parseDOM)). The
+// `mark` field in the rules is implied.
+
+// AttributeSpec:: interface
+//
+// Used to [define](#model.NodeSpec.attrs) attributes on nodes or
+// marks.
+//
+// default:: ?any
+// The default value for this attribute, to use when no explicit
+// value is provided. Attributes that have no default must be
+// provided whenever a node or mark of a type that has them is
+// created.
+
+// ::- A document schema. Holds [node](#model.NodeType) and [mark
+// type](#model.MarkType) objects for the nodes and marks that may
+// occur in conforming documents, and provides functionality for
+// creating and deserializing such documents.
+var Schema = function Schema(spec) {
+ // :: SchemaSpec
+ // The [spec](#model.SchemaSpec) on which the schema is based,
+ // with the added guarantee that its `nodes` and `marks`
+ // properties are
+ // [`OrderedMap`](https://github.com/marijnh/orderedmap) instances
+ // (not raw objects).
+ this.spec = {};
+ for (var prop in spec) { this.spec[prop] = spec[prop]; }
+ this.spec.nodes = orderedmap__WEBPACK_IMPORTED_MODULE_0__["default"].from(spec.nodes);
+ this.spec.marks = orderedmap__WEBPACK_IMPORTED_MODULE_0__["default"].from(spec.marks);
+
+ // :: Object
+ // An object mapping the schema's node names to node type objects.
+ this.nodes = NodeType.compile(this.spec.nodes, this);
+
+ // :: Object
+ // A map from mark names to mark type objects.
+ this.marks = MarkType.compile(this.spec.marks, this);
+
+ var contentExprCache = Object.create(null);
+ for (var prop$1 in this.nodes) {
+ if (prop$1 in this.marks)
+ { throw new RangeError(prop$1 + " can not be both a node and a mark") }
+ var type = this.nodes[prop$1], contentExpr = type.spec.content || "", markExpr = type.spec.marks;
+ type.contentMatch = contentExprCache[contentExpr] ||
+ (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));
+ type.inlineContent = type.contentMatch.inlineContent;
+ type.markSet = markExpr == "_" ? null :
+ markExpr ? gatherMarks(this, markExpr.split(" ")) :
+ markExpr == "" || !type.inlineContent ? [] : null;
+ }
+ for (var prop$2 in this.marks) {
+ var type$1 = this.marks[prop$2], excl = type$1.spec.excludes;
+ type$1.excluded = excl == null ? [type$1] : excl == "" ? [] : gatherMarks(this, excl.split(" "));
+ }
+
+ this.nodeFromJSON = this.nodeFromJSON.bind(this);
+ this.markFromJSON = this.markFromJSON.bind(this);
+
+ // :: NodeType
+ // The type of the [default top node](#model.SchemaSpec.topNode)
+ // for this schema.
+ this.topNodeType = this.nodes[this.spec.topNode || "doc"];
+
+ // :: Object
+ // An object for storing whatever values modules may want to
+ // compute and cache per schema. (If you want to store something
+ // in it, try to use property names unlikely to clash.)
+ this.cached = Object.create(null);
+ this.cached.wrappings = Object.create(null);
+};
+
+// :: (union, ?Object, ?union, ?[Mark]) → Node
+// Create a node in this schema. The `type` may be a string or a
+// `NodeType` instance. Attributes will be extended
+// with defaults, `content` may be a `Fragment`,
+// `null`, a `Node`, or an array of nodes.
+Schema.prototype.node = function node (type, attrs, content, marks) {
+ if (typeof type == "string")
+ { type = this.nodeType(type); }
+ else if (!(type instanceof NodeType))
+ { throw new RangeError("Invalid node type: " + type) }
+ else if (type.schema != this)
+ { throw new RangeError("Node type from different schema used (" + type.name + ")") }
+
+ return type.createChecked(attrs, content, marks)
+};
+
+// :: (string, ?[Mark]) → Node
+// Create a text node in the schema. Empty text nodes are not
+// allowed.
+Schema.prototype.text = function text (text$1, marks) {
+ var type = this.nodes.text;
+ return new TextNode(type, type.defaultAttrs, text$1, Mark.setFrom(marks))
+};
+
+// :: (union, ?Object) → Mark
+// Create a mark with the given type and attributes.
+Schema.prototype.mark = function mark (type, attrs) {
+ if (typeof type == "string") { type = this.marks[type]; }
+ return type.create(attrs)
+};
+
+// :: (Object) → Node
+// Deserialize a node from its JSON representation. This method is
+// bound.
+Schema.prototype.nodeFromJSON = function nodeFromJSON (json) {
+ return Node.fromJSON(this, json)
+};
+
+// :: (Object) → Mark
+// Deserialize a mark from its JSON representation. This method is
+// bound.
+Schema.prototype.markFromJSON = function markFromJSON (json) {
+ return Mark.fromJSON(this, json)
+};
+
+Schema.prototype.nodeType = function nodeType (name) {
+ var found = this.nodes[name];
+ if (!found) { throw new RangeError("Unknown node type: " + name) }
+ return found
+};
+
+function gatherMarks(schema, marks) {
+ var found = [];
+ for (var i = 0; i < marks.length; i++) {
+ var name = marks[i], mark = schema.marks[name], ok = mark;
+ if (mark) {
+ found.push(mark);
+ } else {
+ for (var prop in schema.marks) {
+ var mark$1 = schema.marks[prop];
+ if (name == "_" || (mark$1.spec.group && mark$1.spec.group.split(" ").indexOf(name) > -1))
+ { found.push(ok = mark$1); }
+ }
+ }
+ if (!ok) { throw new SyntaxError("Unknown mark type: '" + marks[i] + "'") }
+ }
+ return found
+}
+
+// ParseOptions:: interface
+// These are the options recognized by the
+// [`parse`](#model.DOMParser.parse) and
+// [`parseSlice`](#model.DOMParser.parseSlice) methods.
+//
+// preserveWhitespace:: ?union
+// By default, whitespace is collapsed as per HTML's rules. Pass
+// `true` to preserve whitespace, but normalize newlines to
+// spaces, and `"full"` to preserve whitespace entirely.
+//
+// findPositions:: ?[{node: dom.Node, offset: number}]
+// When given, the parser will, beside parsing the content,
+// record the document positions of the given DOM positions. It
+// will do so by writing to the objects, adding a `pos` property
+// that holds the document position. DOM positions that are not
+// in the parsed content will not be written to.
+//
+// from:: ?number
+// The child node index to start parsing from.
+//
+// to:: ?number
+// The child node index to stop parsing at.
+//
+// topNode:: ?Node
+// By default, the content is parsed into the schema's default
+// [top node type](#model.Schema.topNodeType). You can pass this
+// option to use the type and attributes from a different node
+// as the top container.
+//
+// topMatch:: ?ContentMatch
+// Provide the starting content match that content parsed into the
+// top node is matched against.
+//
+// context:: ?ResolvedPos
+// A set of additional nodes to count as
+// [context](#model.ParseRule.context) when parsing, above the
+// given [top node](#model.ParseOptions.topNode).
+
+// ParseRule:: interface
+// A value that describes how to parse a given DOM node or inline
+// style as a ProseMirror node or mark.
+//
+// tag:: ?string
+// A CSS selector describing the kind of DOM elements to match. A
+// single rule should have _either_ a `tag` or a `style` property.
+//
+// namespace:: ?string
+// The namespace to match. This should be used with `tag`.
+// Nodes are only matched when the namespace matches or this property
+// is null.
+//
+// style:: ?string
+// A CSS property name to match. When given, this rule matches
+// inline styles that list that property. May also have the form
+// `"property=value"`, in which case the rule only matches if the
+// propery's value exactly matches the given value. (For more
+// complicated filters, use [`getAttrs`](#model.ParseRule.getAttrs)
+// and return false to indicate that the match failed.)
+//
+// priority:: ?number
+// Can be used to change the order in which the parse rules in a
+// schema are tried. Those with higher priority come first. Rules
+// without a priority are counted as having priority 50. This
+// property is only meaningful in a schema—when directly
+// constructing a parser, the order of the rule array is used.
+//
+// context:: ?string
+// When given, restricts this rule to only match when the current
+// context—the parent nodes into which the content is being
+// parsed—matches this expression. Should contain one or more node
+// names or node group names followed by single or double slashes.
+// For example `"paragraph/"` means the rule only matches when the
+// parent node is a paragraph, `"blockquote/paragraph/"` restricts
+// it to be in a paragraph that is inside a blockquote, and
+// `"section//"` matches any position inside a section—a double
+// slash matches any sequence of ancestor nodes. To allow multiple
+// different contexts, they can be separated by a pipe (`|`)
+// character, as in `"blockquote/|list_item/"`.
+//
+// node:: ?string
+// The name of the node type to create when this rule matches. Only
+// valid for rules with a `tag` property, not for style rules. Each
+// rule should have one of a `node`, `mark`, or `ignore` property
+// (except when it appears in a [node](#model.NodeSpec.parseDOM) or
+// [mark spec](#model.MarkSpec.parseDOM), in which case the `node`
+// or `mark` property will be derived from its position).
+//
+// mark:: ?string
+// The name of the mark type to wrap the matched content in.
+//
+// ignore:: ?bool
+// When true, ignore content that matches this rule.
+//
+// skip:: ?bool
+// When true, ignore the node that matches this rule, but do parse
+// its content.
+//
+// attrs:: ?Object
+// Attributes for the node or mark created by this rule. When
+// `getAttrs` is provided, it takes precedence.
+//
+// getAttrs:: ?(union) → ?union
+// A function used to compute the attributes for the node or mark
+// created by this rule. Can also be used to describe further
+// conditions the DOM element or style must match. When it returns
+// `false`, the rule won't match. When it returns null or undefined,
+// that is interpreted as an empty/default set of attributes.
+//
+// Called with a DOM Element for `tag` rules, and with a string (the
+// style's value) for `style` rules.
+//
+// contentElement:: ?union
+// For `tag` rules that produce non-leaf nodes or marks, by default
+// the content of the DOM element is parsed as content of the mark
+// or node. If the child nodes are in a descendent node, this may be
+// a CSS selector string that the parser must use to find the actual
+// content element, or a function that returns the actual content
+// element to the parser.
+//
+// getContent:: ?(dom.Node, schema: Schema) → Fragment
+// Can be used to override the content of a matched node. When
+// present, instead of parsing the node's child nodes, the result of
+// this function is used.
+//
+// preserveWhitespace:: ?union
+// Controls whether whitespace should be preserved when parsing the
+// content inside the matched element. `false` means whitespace may
+// be collapsed, `true` means that whitespace should be preserved
+// but newlines normalized to spaces, and `"full"` means that
+// newlines should also be preserved.
+
+// ::- A DOM parser represents a strategy for parsing DOM content into
+// a ProseMirror document conforming to a given schema. Its behavior
+// is defined by an array of [rules](#model.ParseRule).
+var DOMParser = function DOMParser(schema, rules) {
+ var this$1 = this;
+
+ // :: Schema
+ // The schema into which the parser parses.
+ this.schema = schema;
+ // :: [ParseRule]
+ // The set of [parse rules](#model.ParseRule) that the parser
+ // uses, in order of precedence.
+ this.rules = rules;
+ this.tags = [];
+ this.styles = [];
+
+ rules.forEach(function (rule) {
+ if (rule.tag) { this$1.tags.push(rule); }
+ else if (rule.style) { this$1.styles.push(rule); }
+ });
+};
+
+// :: (dom.Node, ?ParseOptions) → Node
+// Parse a document from the content of a DOM node.
+DOMParser.prototype.parse = function parse (dom, options) {
+ if ( options === void 0 ) options = {};
+
+ var context = new ParseContext(this, options, false);
+ context.addAll(dom, null, options.from, options.to);
+ return context.finish()
+};
+
+// :: (dom.Node, ?ParseOptions) → Slice
+// Parses the content of the given DOM node, like
+// [`parse`](#model.DOMParser.parse), and takes the same set of
+// options. But unlike that method, which produces a whole node,
+// this one returns a slice that is open at the sides, meaning that
+// the schema constraints aren't applied to the start of nodes to
+// the left of the input and the end of nodes at the end.
+DOMParser.prototype.parseSlice = function parseSlice (dom, options) {
+ if ( options === void 0 ) options = {};
+
+ var context = new ParseContext(this, options, true);
+ context.addAll(dom, null, options.from, options.to);
+ return Slice.maxOpen(context.finish())
+};
+
+DOMParser.prototype.matchTag = function matchTag (dom, context) {
+ for (var i = 0; i < this.tags.length; i++) {
+ var rule = this.tags[i];
+ if (matches(dom, rule.tag) &&
+ (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&
+ (!rule.context || context.matchesContext(rule.context))) {
+ if (rule.getAttrs) {
+ var result = rule.getAttrs(dom);
+ if (result === false) { continue }
+ rule.attrs = result;
+ }
+ return rule
+ }
+ }
+};
+
+DOMParser.prototype.matchStyle = function matchStyle (prop, value, context) {
+ for (var i = 0; i < this.styles.length; i++) {
+ var rule = this.styles[i];
+ if (rule.style.indexOf(prop) != 0 ||
+ rule.context && !context.matchesContext(rule.context) ||
+ // Test that the style string either precisely matches the prop,
+ // or has an '=' sign after the prop, followed by the given
+ // value.
+ rule.style.length > prop.length &&
+ (rule.style.charCodeAt(prop.length) != 61 || rule.style.slice(prop.length + 1) != value))
+ { continue }
+ if (rule.getAttrs) {
+ var result = rule.getAttrs(value);
+ if (result === false) { continue }
+ rule.attrs = result;
+ }
+ return rule
+ }
+};
+
+// : (Schema) → [ParseRule]
+DOMParser.schemaRules = function schemaRules (schema) {
+ var result = [];
+ function insert(rule) {
+ var priority = rule.priority == null ? 50 : rule.priority, i = 0;
+ for (; i < result.length; i++) {
+ var next = result[i], nextPriority = next.priority == null ? 50 : next.priority;
+ if (nextPriority < priority) { break }
+ }
+ result.splice(i, 0, rule);
+ }
+
+ var loop = function ( name ) {
+ var rules = schema.marks[name].spec.parseDOM;
+ if (rules) { rules.forEach(function (rule) {
+ insert(rule = copy(rule));
+ rule.mark = name;
+ }); }
+ };
+
+ for (var name in schema.marks) loop( name );
+ var loop$1 = function ( name ) {
+ var rules$1 = schema.nodes[name$1].spec.parseDOM;
+ if (rules$1) { rules$1.forEach(function (rule) {
+ insert(rule = copy(rule));
+ rule.node = name$1;
+ }); }
+ };
+
+ for (var name$1 in schema.nodes) loop$1();
+ return result
+};
+
+// :: (Schema) → DOMParser
+// Construct a DOM parser using the parsing rules listed in a
+// schema's [node specs](#model.NodeSpec.parseDOM), reordered by
+// [priority](#model.ParseRule.priority).
+DOMParser.fromSchema = function fromSchema (schema) {
+ return schema.cached.domParser ||
+ (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)))
+};
+
+// : Object The block-level tags in HTML5
+var blockTags = {
+ address: true, article: true, aside: true, blockquote: true, canvas: true,
+ dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,
+ footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,
+ h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,
+ output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true
+};
+
+// : Object The tags that we normally ignore.
+var ignoreTags = {
+ head: true, noscript: true, object: true, script: true, style: true, title: true
+};
+
+// : Object List tags.
+var listTags = {ol: true, ul: true};
+
+// Using a bitfield for node context options
+var OPT_PRESERVE_WS = 1, OPT_PRESERVE_WS_FULL = 2, OPT_OPEN_LEFT = 4;
+
+function wsOptionsFor(preserveWhitespace) {
+ return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === "full" ? OPT_PRESERVE_WS_FULL : 0)
+}
+
+var NodeContext = function NodeContext(type, attrs, marks, solid, match, options) {
+ this.type = type;
+ this.attrs = attrs;
+ this.solid = solid;
+ this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch);
+ this.options = options;
+ this.content = [];
+ this.marks = marks;
+ this.activeMarks = Mark.none;
+};
+
+NodeContext.prototype.findWrapping = function findWrapping (node) {
+ if (!this.match) {
+ if (!this.type) { return [] }
+ var fill = this.type.contentMatch.fillBefore(Fragment.from(node));
+ if (fill) {
+ this.match = this.type.contentMatch.matchFragment(fill);
+ } else {
+ var start = this.type.contentMatch, wrap;
+ if (wrap = start.findWrapping(node.type)) {
+ this.match = start;
+ return wrap
+ } else {
+ return null
+ }
+ }
+ }
+ return this.match.findWrapping(node.type)
+};
+
+NodeContext.prototype.finish = function finish (openEnd) {
+ if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace
+ var last = this.content[this.content.length - 1], m;
+ if (last && last.isText && (m = /[ \t\r\n\u000c]+$/.exec(last.text))) {
+ if (last.text.length == m[0].length) { this.content.pop(); }
+ else { this.content[this.content.length - 1] = last.withText(last.text.slice(0, last.text.length - m[0].length)); }
+ }
+ }
+ var content = Fragment.from(this.content);
+ if (!openEnd && this.match)
+ { content = content.append(this.match.fillBefore(Fragment.empty, true)); }
+ return this.type ? this.type.create(this.attrs, content, this.marks) : content
+};
+
+var ParseContext = function ParseContext(parser, options, open) {
+ // : DOMParser The parser we are using.
+ this.parser = parser;
+ // : Object The options passed to this parse.
+ this.options = options;
+ this.isOpen = open;
+ this.pendingMarks = [];
+ var topNode = options.topNode, topContext;
+ var topOptions = wsOptionsFor(options.preserveWhitespace) | (open ? OPT_OPEN_LEFT : 0);
+ if (topNode)
+ { topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, true,
+ options.topMatch || topNode.type.contentMatch, topOptions); }
+ else if (open)
+ { topContext = new NodeContext(null, null, Mark.none, true, null, topOptions); }
+ else
+ { topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, true, null, topOptions); }
+ this.nodes = [topContext];
+ // : [Mark] The current set of marks
+ this.open = 0;
+ this.find = options.findPositions;
+ this.needsBlock = false;
+};
+
+var prototypeAccessors$6 = { top: { configurable: true },currentPos: { configurable: true } };
+
+prototypeAccessors$6.top.get = function () {
+ return this.nodes[this.open]
+};
+
+// : (dom.Node)
+// Add a DOM node to the content. Text is inserted as text node,
+// otherwise, the node is passed to `addElement` or, if it has a
+// `style` attribute, `addElementWithStyles`.
+ParseContext.prototype.addDOM = function addDOM (dom) {
+ if (dom.nodeType == 3) {
+ this.addTextNode(dom);
+ } else if (dom.nodeType == 1) {
+ var style = dom.getAttribute("style");
+ var marks = style ? this.readStyles(parseStyles(style)) : null;
+ if (marks != null) { for (var i = 0; i < marks.length; i++) { this.addPendingMark(marks[i]); } }
+ this.addElement(dom);
+ if (marks != null) { for (var i$1 = 0; i$1 < marks.length; i$1++) { this.removePendingMark(marks[i$1]); } }
+ }
+};
+
+ParseContext.prototype.addTextNode = function addTextNode (dom) {
+ var value = dom.nodeValue;
+ var top = this.top;
+ if ((top.type ? top.type.inlineContent : top.content.length && top.content[0].isInline) || /[^ \t\r\n\u000c]/.test(value)) {
+ if (!(top.options & OPT_PRESERVE_WS)) {
+ value = value.replace(/[ \t\r\n\u000c]+/g, " ");
+ // If this starts with whitespace, and there is no node before it, or
+ // a hard break, or a text node that ends with whitespace, strip the
+ // leading space.
+ if (/^[ \t\r\n\u000c]/.test(value) && this.open == this.nodes.length - 1) {
+ var nodeBefore = top.content[top.content.length - 1];
+ var domNodeBefore = dom.previousSibling;
+ if (!nodeBefore ||
+ (domNodeBefore && domNodeBefore.nodeName == 'BR') ||
+ (nodeBefore.isText && /[ \t\r\n\u000c]$/.test(nodeBefore.text)))
+ { value = value.slice(1); }
+ }
+ } else if (!(top.options & OPT_PRESERVE_WS_FULL)) {
+ value = value.replace(/\r?\n|\r/g, " ");
+ }
+ if (value) { this.insertNode(this.parser.schema.text(value)); }
+ this.findInText(dom);
+ } else {
+ this.findInside(dom);
+ }
+};
+
+// : (dom.Element)
+// Try to find a handler for the given tag and use that to parse. If
+// none is found, the element's content nodes are added directly.
+ParseContext.prototype.addElement = function addElement (dom) {
+ var name = dom.nodeName.toLowerCase();
+ if (listTags.hasOwnProperty(name)) { normalizeList(dom); }
+ var rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) || this.parser.matchTag(dom, this);
+ if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {
+ this.findInside(dom);
+ } else if (!rule || rule.skip) {
+ if (rule && rule.skip.nodeType) { dom = rule.skip; }
+ var sync, top = this.top, oldNeedsBlock = this.needsBlock;
+ if (blockTags.hasOwnProperty(name)) {
+ sync = true;
+ if (!top.type) { this.needsBlock = true; }
+ } else if (!dom.firstChild) {
+ this.leafFallback(dom);
+ return
+ }
+ this.addAll(dom);
+ if (sync) { this.sync(top); }
+ this.needsBlock = oldNeedsBlock;
+ } else {
+ this.addElementByRule(dom, rule);
+ }
+};
+
+// Called for leaf DOM nodes that would otherwise be ignored
+ParseContext.prototype.leafFallback = function leafFallback (dom) {
+ if (dom.nodeName == "BR" && this.top.type && this.top.type.inlineContent)
+ { this.addTextNode(dom.ownerDocument.createTextNode("\n")); }
+};
+
+// Run any style parser associated with the node's styles. Either
+// return an array of marks, or null to indicate some of the styles
+// had a rule with `ignore` set.
+ParseContext.prototype.readStyles = function readStyles (styles) {
+ var marks = Mark.none;
+ for (var i = 0; i < styles.length; i += 2) {
+ var rule = this.parser.matchStyle(styles[i], styles[i + 1], this);
+ if (!rule) { continue }
+ if (rule.ignore) { return null }
+ marks = this.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(marks);
+ }
+ return marks
+};
+
+// : (dom.Element, ParseRule) → bool
+// Look up a handler for the given node. If none are found, return
+// false. Otherwise, apply it, use its return value to drive the way
+// the node's content is wrapped, and return true.
+ParseContext.prototype.addElementByRule = function addElementByRule (dom, rule) {
+ var this$1 = this;
+
+ var sync, nodeType, markType, mark;
+ if (rule.node) {
+ nodeType = this.parser.schema.nodes[rule.node];
+ if (!nodeType.isLeaf) {
+ sync = this.enter(nodeType, rule.attrs, rule.preserveWhitespace);
+ } else if (!this.insertNode(nodeType.create(rule.attrs))) {
+ this.leafFallback(dom);
+ }
+ } else {
+ markType = this.parser.schema.marks[rule.mark];
+ mark = markType.create(rule.attrs);
+ this.addPendingMark(mark);
+ }
+ var startIn = this.top;
+
+ if (nodeType && nodeType.isLeaf) {
+ this.findInside(dom);
+ } else if (rule.getContent) {
+ this.findInside(dom);
+ rule.getContent(dom, this.parser.schema).forEach(function (node) { return this$1.insertNode(node); });
+ } else {
+ var contentDOM = rule.contentElement;
+ if (typeof contentDOM == "string") { contentDOM = dom.querySelector(contentDOM); }
+ else if (typeof contentDOM == "function") { contentDOM = contentDOM(dom); }
+ if (!contentDOM) { contentDOM = dom; }
+ this.findAround(dom, contentDOM, true);
+ this.addAll(contentDOM, sync);
+ }
+ if (sync) { this.sync(startIn); this.open--; }
+ if (mark) { this.removePendingMark(mark); }
+};
+
+// : (dom.Node, ?NodeBuilder, ?number, ?number)
+// Add all child nodes between `startIndex` and `endIndex` (or the
+// whole node, if not given). If `sync` is passed, use it to
+// synchronize after every block element.
+ParseContext.prototype.addAll = function addAll (parent, sync, startIndex, endIndex) {
+ var index = startIndex || 0;
+ for (var dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild,
+ end = endIndex == null ? null : parent.childNodes[endIndex];
+ dom != end; dom = dom.nextSibling, ++index) {
+ this.findAtPoint(parent, index);
+ this.addDOM(dom);
+ if (sync && blockTags.hasOwnProperty(dom.nodeName.toLowerCase()))
+ { this.sync(sync); }
+ }
+ this.findAtPoint(parent, index);
+};
+
+// Try to find a way to fit the given node type into the current
+// context. May add intermediate wrappers and/or leave non-solid
+// nodes that we're in.
+ParseContext.prototype.findPlace = function findPlace (node) {
+ var route, sync;
+ for (var depth = this.open; depth >= 0; depth--) {
+ var cx = this.nodes[depth];
+ var found = cx.findWrapping(node);
+ if (found && (!route || route.length > found.length)) {
+ route = found;
+ sync = cx;
+ if (!found.length) { break }
+ }
+ if (cx.solid) { break }
+ }
+ if (!route) { return false }
+ this.sync(sync);
+ for (var i = 0; i < route.length; i++)
+ { this.enterInner(route[i], null, false); }
+ return true
+};
+
+// : (Node) → ?Node
+// Try to insert the given node, adjusting the context when needed.
+ParseContext.prototype.insertNode = function insertNode (node) {
+ if (node.isInline && this.needsBlock && !this.top.type) {
+ var block = this.textblockFromContext();
+ if (block) { this.enterInner(block); }
+ }
+ if (this.findPlace(node)) {
+ this.closeExtra();
+ var top = this.top;
+ this.applyPendingMarks(top);
+ if (top.match) { top.match = top.match.matchType(node.type); }
+ var marks = top.activeMarks;
+ for (var i = 0; i < node.marks.length; i++)
+ { if (!top.type || top.type.allowsMarkType(node.marks[i].type))
+ { marks = node.marks[i].addToSet(marks); } }
+ top.content.push(node.mark(marks));
+ return true
+ }
+ return false
+};
+
+ParseContext.prototype.applyPendingMarks = function applyPendingMarks (top) {
+ for (var i = 0; i < this.pendingMarks.length; i++) {
+ var mark = this.pendingMarks[i];
+ if ((!top.type || top.type.allowsMarkType(mark.type)) && !mark.isInSet(top.activeMarks)) {
+ top.activeMarks = mark.addToSet(top.activeMarks);
+ this.pendingMarks.splice(i--, 1);
+ }
+ }
+};
+
+// : (NodeType, ?Object) → bool
+// Try to start a node of the given type, adjusting the context when
+// necessary.
+ParseContext.prototype.enter = function enter (type, attrs, preserveWS) {
+ var ok = this.findPlace(type.create(attrs));
+ if (ok) {
+ this.applyPendingMarks(this.top);
+ this.enterInner(type, attrs, true, preserveWS);
+ }
+ return ok
+};
+
+// Open a node of the given type
+ParseContext.prototype.enterInner = function enterInner (type, attrs, solid, preserveWS) {
+ this.closeExtra();
+ var top = this.top;
+ top.match = top.match && top.match.matchType(type, attrs);
+ var options = preserveWS == null ? top.options & ~OPT_OPEN_LEFT : wsOptionsFor(preserveWS);
+ if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0) { options |= OPT_OPEN_LEFT; }
+ this.nodes.push(new NodeContext(type, attrs, top.activeMarks, solid, null, options));
+ this.open++;
+};
+
+// Make sure all nodes above this.open are finished and added to
+// their parents
+ParseContext.prototype.closeExtra = function closeExtra (openEnd) {
+ var i = this.nodes.length - 1;
+ if (i > this.open) {
+ for (; i > this.open; i--) { this.nodes[i - 1].content.push(this.nodes[i].finish(openEnd)); }
+ this.nodes.length = this.open + 1;
+ }
+};
+
+ParseContext.prototype.finish = function finish () {
+ this.open = 0;
+ this.closeExtra(this.isOpen);
+ return this.nodes[0].finish(this.isOpen || this.options.topOpen)
+};
+
+ParseContext.prototype.sync = function sync (to) {
+ for (var i = this.open; i >= 0; i--) { if (this.nodes[i] == to) {
+ this.open = i;
+ return
+ } }
+};
+
+ParseContext.prototype.addPendingMark = function addPendingMark (mark) {
+ this.pendingMarks.push(mark);
+};
+
+ParseContext.prototype.removePendingMark = function removePendingMark (mark) {
+ var found = this.pendingMarks.lastIndexOf(mark);
+ if (found > -1) {
+ this.pendingMarks.splice(found, 1);
+ } else {
+ var top = this.top;
+ top.activeMarks = mark.removeFromSet(top.activeMarks);
+ }
+};
+
+prototypeAccessors$6.currentPos.get = function () {
+ this.closeExtra();
+ var pos = 0;
+ for (var i = this.open; i >= 0; i--) {
+ var content = this.nodes[i].content;
+ for (var j = content.length - 1; j >= 0; j--)
+ { pos += content[j].nodeSize; }
+ if (i) { pos++; }
+ }
+ return pos
+};
+
+ParseContext.prototype.findAtPoint = function findAtPoint (parent, offset) {
+ if (this.find) { for (var i = 0; i < this.find.length; i++) {
+ if (this.find[i].node == parent && this.find[i].offset == offset)
+ { this.find[i].pos = this.currentPos; }
+ } }
+};
+
+ParseContext.prototype.findInside = function findInside (parent) {
+ if (this.find) { for (var i = 0; i < this.find.length; i++) {
+ if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node))
+ { this.find[i].pos = this.currentPos; }
+ } }
+};
+
+ParseContext.prototype.findAround = function findAround (parent, content, before) {
+ if (parent != content && this.find) { for (var i = 0; i < this.find.length; i++) {
+ if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node)) {
+ var pos = content.compareDocumentPosition(this.find[i].node);
+ if (pos & (before ? 2 : 4))
+ { this.find[i].pos = this.currentPos; }
+ }
+ } }
+};
+
+ParseContext.prototype.findInText = function findInText (textNode) {
+ if (this.find) { for (var i = 0; i < this.find.length; i++) {
+ if (this.find[i].node == textNode)
+ { this.find[i].pos = this.currentPos - (textNode.nodeValue.length - this.find[i].offset); }
+ } }
+};
+
+// : (string) → bool
+// Determines whether the given [context
+// string](#ParseRule.context) matches this context.
+ParseContext.prototype.matchesContext = function matchesContext (context) {
+ var this$1 = this;
+
+ if (context.indexOf("|") > -1)
+ { return context.split(/\s*\|\s*/).some(this.matchesContext, this) }
+
+ var parts = context.split("/");
+ var option = this.options.context;
+ var useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);
+ var minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);
+ var match = function (i, depth) {
+ for (; i >= 0; i--) {
+ var part = parts[i];
+ if (part == "") {
+ if (i == parts.length - 1 || i == 0) { continue }
+ for (; depth >= minDepth; depth--)
+ { if (match(i - 1, depth)) { return true } }
+ return false
+ } else {
+ var next = depth > 0 || (depth == 0 && useRoot) ? this$1.nodes[depth].type
+ : option && depth >= minDepth ? option.node(depth - minDepth).type
+ : null;
+ if (!next || (next.name != part && next.groups.indexOf(part) == -1))
+ { return false }
+ depth--;
+ }
+ }
+ return true
+ };
+ return match(parts.length - 1, this.open)
+};
+
+ParseContext.prototype.textblockFromContext = function textblockFromContext () {
+ var $context = this.options.context;
+ if ($context) { for (var d = $context.depth; d >= 0; d--) {
+ var deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;
+ if (deflt && deflt.isTextblock && deflt.defaultAttrs) { return deflt }
+ } }
+ for (var name in this.parser.schema.nodes) {
+ var type = this.parser.schema.nodes[name];
+ if (type.isTextblock && type.defaultAttrs) { return type }
+ }
+};
+
+Object.defineProperties( ParseContext.prototype, prototypeAccessors$6 );
+
+// Kludge to work around directly nested list nodes produced by some
+// tools and allowed by browsers to mean that the nested list is
+// actually part of the list item above it.
+function normalizeList(dom) {
+ for (var child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {
+ var name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null;
+ if (name && listTags.hasOwnProperty(name) && prevItem) {
+ prevItem.appendChild(child);
+ child = prevItem;
+ } else if (name == "li") {
+ prevItem = child;
+ } else if (name) {
+ prevItem = null;
+ }
+ }
+}
+
+// Apply a CSS selector.
+function matches(dom, selector) {
+ return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector)
+}
+
+// : (string) → [string]
+// Tokenize a style attribute into property/value pairs.
+function parseStyles(style) {
+ var re = /\s*([\w-]+)\s*:\s*([^;]+)/g, m, result = [];
+ while (m = re.exec(style)) { result.push(m[1], m[2].trim()); }
+ return result
+}
+
+function copy(obj) {
+ var copy = {};
+ for (var prop in obj) { copy[prop] = obj[prop]; }
+ return copy
+}
+
+// DOMOutputSpec:: interface
+// A description of a DOM structure. Can be either a string, which is
+// interpreted as a text node, a DOM node, which is interpreted as
+// itself, or an array.
+//
+// An array describes a DOM element. The first value in the array
+// should be a string—the name of the DOM element. If the second
+// element is plain object, it is interpreted as a set of attributes
+// for the element. Any elements after that (including the 2nd if it's
+// not an attribute object) are interpreted as children of the DOM
+// elements, and must either be valid `DOMOutputSpec` values, or the
+// number zero.
+//
+// The number zero (pronounced “hole”) is used to indicate the place
+// where a node's child nodes should be inserted. If it occurs in an
+// output spec, it should be the only child element in its parent
+// node.
+
+// ::- A DOM serializer knows how to convert ProseMirror nodes and
+// marks of various types to DOM nodes.
+var DOMSerializer = function DOMSerializer(nodes, marks) {
+ // :: Object<(node: Node) → DOMOutputSpec>
+ // The node serialization functions.
+ this.nodes = nodes || {};
+ // :: Object
+ // The mark serialization functions.
+ this.marks = marks || {};
+};
+
+// :: (Fragment, ?Object) → dom.DocumentFragment
+// Serialize the content of this fragment to a DOM fragment. When
+// not in the browser, the `document` option, containing a DOM
+// document, should be passed so that the serializer can create
+// nodes.
+DOMSerializer.prototype.serializeFragment = function serializeFragment (fragment, options, target) {
+ var this$1 = this;
+ if ( options === void 0 ) options = {};
+
+ if (!target) { target = doc(options).createDocumentFragment(); }
+
+ var top = target, active = null;
+ fragment.forEach(function (node) {
+ if (active || node.marks.length) {
+ if (!active) { active = []; }
+ var keep = 0, rendered = 0;
+ while (keep < active.length && rendered < node.marks.length) {
+ var next = node.marks[rendered];
+ if (!this$1.marks[next.type.name]) { rendered++; continue }
+ if (!next.eq(active[keep]) || next.type.spec.spanning === false) { break }
+ keep += 2; rendered++;
+ }
+ while (keep < active.length) {
+ top = active.pop();
+ active.pop();
+ }
+ while (rendered < node.marks.length) {
+ var add = node.marks[rendered++];
+ var markDOM = this$1.serializeMark(add, node.isInline, options);
+ if (markDOM) {
+ active.push(add, top);
+ top.appendChild(markDOM.dom);
+ top = markDOM.contentDOM || markDOM.dom;
+ }
+ }
+ }
+ top.appendChild(this$1.serializeNode(node, options));
+ });
+
+ return target
+};
+
+// :: (Node, ?Object) → dom.Node
+// Serialize this node to a DOM node. This can be useful when you
+// need to serialize a part of a document, as opposed to the whole
+// document. To serialize a whole document, use
+// [`serializeFragment`](#model.DOMSerializer.serializeFragment) on
+// its [content](#model.Node.content).
+DOMSerializer.prototype.serializeNode = function serializeNode (node, options) {
+ if ( options === void 0 ) options = {};
+
+ var ref =
+ DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node));
+ var dom = ref.dom;
+ var contentDOM = ref.contentDOM;
+ if (contentDOM) {
+ if (node.isLeaf)
+ { throw new RangeError("Content hole not allowed in a leaf node spec") }
+ if (options.onContent)
+ { options.onContent(node, contentDOM, options); }
+ else
+ { this.serializeFragment(node.content, options, contentDOM); }
+ }
+ return dom
+};
+
+DOMSerializer.prototype.serializeNodeAndMarks = function serializeNodeAndMarks (node, options) {
+ if ( options === void 0 ) options = {};
+
+ var dom = this.serializeNode(node, options);
+ for (var i = node.marks.length - 1; i >= 0; i--) {
+ var wrap = this.serializeMark(node.marks[i], node.isInline, options);
+ if (wrap) {
+(wrap.contentDOM || wrap.dom).appendChild(dom);
+ dom = wrap.dom;
+ }
+ }
+ return dom
+};
+
+DOMSerializer.prototype.serializeMark = function serializeMark (mark, inline, options) {
+ if ( options === void 0 ) options = {};
+
+ var toDOM = this.marks[mark.type.name];
+ return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline))
+};
+
+// :: (dom.Document, DOMOutputSpec) → {dom: dom.Node, contentDOM: ?dom.Node}
+// Render an [output spec](#model.DOMOutputSpec) to a DOM node. If
+// the spec has a hole (zero) in it, `contentDOM` will point at the
+// node with the hole.
+DOMSerializer.renderSpec = function renderSpec (doc, structure) {
+ if (typeof structure == "string")
+ { return {dom: doc.createTextNode(structure)} }
+ if (structure.nodeType != null)
+ { return {dom: structure} }
+ var dom = doc.createElement(structure[0]), contentDOM = null;
+ var attrs = structure[1], start = 1;
+ if (attrs && typeof attrs == "object" && attrs.nodeType == null && !Array.isArray(attrs)) {
+ start = 2;
+ for (var name in attrs) {
+ if (attrs[name] != null) { dom.setAttribute(name, attrs[name]); }
+ }
+ }
+ for (var i = start; i < structure.length; i++) {
+ var child = structure[i];
+ if (child === 0) {
+ if (i < structure.length - 1 || i > start)
+ { throw new RangeError("Content hole must be the only child of its parent node") }
+ return {dom: dom, contentDOM: dom}
+ } else {
+ var ref = DOMSerializer.renderSpec(doc, child);
+ var inner = ref.dom;
+ var innerContent = ref.contentDOM;
+ dom.appendChild(inner);
+ if (innerContent) {
+ if (contentDOM) { throw new RangeError("Multiple content holes") }
+ contentDOM = innerContent;
+ }
+ }
+ }
+ return {dom: dom, contentDOM: contentDOM}
+};
+
+// :: (Schema) → DOMSerializer
+// Build a serializer using the [`toDOM`](#model.NodeSpec.toDOM)
+// properties in a schema's node and mark specs.
+DOMSerializer.fromSchema = function fromSchema (schema) {
+ return schema.cached.domSerializer ||
+ (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)))
+};
+
+// : (Schema) → Object<(node: Node) → DOMOutputSpec>
+// Gather the serializers in a schema's node specs into an object.
+// This can be useful as a base to build a custom serializer from.
+DOMSerializer.nodesFromSchema = function nodesFromSchema (schema) {
+ var result = gatherToDOM(schema.nodes);
+ if (!result.text) { result.text = function (node) { return node.text; }; }
+ return result
+};
+
+// : (Schema) → Object<(mark: Mark) → DOMOutputSpec>
+// Gather the serializers in a schema's mark specs into an object.
+DOMSerializer.marksFromSchema = function marksFromSchema (schema) {
+ return gatherToDOM(schema.marks)
+};
+
+function gatherToDOM(obj) {
+ var result = {};
+ for (var name in obj) {
+ var toDOM = obj[name].spec.toDOM;
+ if (toDOM) { result[name] = toDOM; }
+ }
+ return result
+}
+
+function doc(options) {
+ // declare global: window
+ return options.document || window.document
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-schema-list/dist/index.es.js":
+/*!***************************************************************!*\
+ !*** ./node_modules/prosemirror-schema-list/dist/index.es.js ***!
+ \***************************************************************/
+/*! exports provided: addListNodes, bulletList, liftListItem, listItem, orderedList, sinkListItem, splitListItem, wrapInList */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "addListNodes", function() { return addListNodes; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "bulletList", function() { return bulletList; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "liftListItem", function() { return liftListItem; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "listItem", function() { return listItem; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "orderedList", function() { return orderedList; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "sinkListItem", function() { return sinkListItem; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "splitListItem", function() { return splitListItem; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "wrapInList", function() { return wrapInList; });
+/* harmony import */ var prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-transform */ "./node_modules/prosemirror-transform/dist/index.es.js");
+/* harmony import */ var prosemirror_model__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-model */ "./node_modules/prosemirror-model/dist/index.es.js");
+
+
+
+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 ``
+// 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 `
`.
+var bulletList = {
+ parseDOM: [{tag: "ul"}],
+ toDOM: function toDOM() { return ulDOM }
+};
+
+// :: NodeSpec
+// A list item (`
`) spec.
+var listItem = {
+ parseDOM: [{tag: "li"}],
+ toDOM: function toDOM() { return liDOM },
+ defining: true
+};
+
+function add(obj, props) {
+ var copy = {};
+ for (var prop in obj) { copy[prop] = obj[prop]; }
+ for (var prop$1 in props) { copy[prop$1] = props[prop$1]; }
+ return copy
+}
+
+// :: (OrderedMap, string, ?string) → OrderedMap
+// 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 ref = state.selection;
+ var $from = ref.$from;
+ var $to = ref.$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 prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["NodeRange"]($insert, $insert, range.depth);
+ if (range.endIndex < range.parent.childCount)
+ { range = new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["NodeRange"]($from, state.doc.resolve($to.end(range.depth)), range.depth); }
+ doJoin = true;
+ }
+ var wrap = Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["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 = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty;
+ for (var i = wrappers.length - 1; i >= 0; i--)
+ { content = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(wrappers[i].type.create(wrappers[i].attrs, content)); }
+
+ tr.step(new prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["ReplaceAroundStep"](range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end,
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](content, 0, 0), wrappers.length, true));
+
+ var found = 0;
+ for (var i$1 = 0; i$1 < wrappers.length; i$1++) { if (wrappers[i$1].type == listType) { found = i$1 + 1; } }
+ var splitDepth = wrappers.length - found;
+
+ var splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;
+ for (var i$2 = range.startIndex, e = range.endIndex, first = true; i$2 < e; i$2++, first = false) {
+ if (!first && Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["canSplit"])(tr.doc, splitPos, splitDepth)) {
+ tr.split(splitPos, splitDepth);
+ splitPos += 2 * splitDepth;
+ }
+ splitPos += parent.child(i$2).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 ref = state.selection;
+ var $from = ref.$from;
+ var $to = ref.$to;
+ var node = ref.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) {
+ // 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 = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty, keepItem = $from.index(-1) > 0;
+ // 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 - (keepItem ? 1 : 2); d >= $from.depth - 3; d--)
+ { wrap = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from($from.node(d).copy(wrap)); }
+ // Add a second list item with an empty default start node
+ wrap = wrap.append(prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(itemType.createAndFill()));
+ var tr$1 = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](wrap, keepItem ? 3 : 2, 2));
+ tr$1.setSelection(state.selection.constructor.near(tr$1.doc.resolve($from.pos + (keepItem ? 3 : 2))));
+ dispatch(tr$1.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 (!Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["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 ref = state.selection;
+ var $from = ref.$from;
+ var $to = ref.$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 prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["ReplaceAroundStep"](end - 1, endOfList, end, endOfList,
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));
+ range = new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["NodeRange"](tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);
+ }
+ dispatch(tr.lift(range, Object(prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["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;
+ 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 ? prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty : prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["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 prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["ReplaceAroundStep"](start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1,
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"]((atStart ? prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty : prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(list.copy(prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty)))
+ .append(atEnd ? prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty : prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(list.copy(prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["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 ref = state.selection;
+ var $from = ref.$from;
+ var $to = ref.$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 = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(nestedBefore ? itemType.create() : null);
+ var slice = new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(itemType.create(null, prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(parent.type.create(null, inner)))),
+ nestedBefore ? 3 : 1, 0);
+ var before = range.start, after = range.end;
+ dispatch(state.tr.step(new prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__["ReplaceAroundStep"](before - (nestedBefore ? 3 : 1), after,
+ before, after, slice, 1, true))
+ .scrollIntoView());
+ }
+ return true
+ }
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-state/dist/index.es.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/prosemirror-state/dist/index.es.js ***!
+ \*********************************************************/
+/*! exports provided: AllSelection, EditorState, NodeSelection, Plugin, PluginKey, Selection, SelectionRange, TextSelection, Transaction */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "AllSelection", function() { return AllSelection; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "EditorState", function() { return EditorState; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "NodeSelection", function() { return NodeSelection; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Plugin", function() { return Plugin; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "PluginKey", function() { return PluginKey; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Selection", function() { return Selection; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "SelectionRange", function() { return SelectionRange; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "TextSelection", function() { return TextSelection; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Transaction", function() { return Transaction; });
+/* harmony import */ var prosemirror_model__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-model */ "./node_modules/prosemirror-model/dist/index.es.js");
+/* harmony import */ var prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-transform */ "./node_modules/prosemirror-transform/dist/index.es.js");
+
+
+
+var classesById = Object.create(null);
+
+// ::- Superclass for editor selections. Every selection type should
+// extend this. Should not be instantiated directly.
+var Selection = function Selection($anchor, $head, ranges) {
+ // :: [SelectionRange]
+ // The ranges covered by the selection.
+ this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];
+ // :: ResolvedPos
+ // The resolved anchor of the selection (the side that stays in
+ // place when the selection is modified).
+ this.$anchor = $anchor;
+ // :: ResolvedPos
+ // The resolved head of the selection (the side that moves when
+ // the selection is modified).
+ this.$head = $head;
+};
+
+var prototypeAccessors = { anchor: { configurable: true },head: { configurable: true },from: { configurable: true },to: { configurable: true },$from: { configurable: true },$to: { configurable: true },empty: { configurable: true } };
+
+// :: number
+// The selection's anchor, as an unresolved position.
+prototypeAccessors.anchor.get = function () { return this.$anchor.pos };
+
+// :: number
+// The selection's head.
+prototypeAccessors.head.get = function () { return this.$head.pos };
+
+// :: number
+// The lower bound of the selection's main range.
+prototypeAccessors.from.get = function () { return this.$from.pos };
+
+// :: number
+// The upper bound of the selection's main range.
+prototypeAccessors.to.get = function () { return this.$to.pos };
+
+// :: ResolvedPos
+// The resolved lowerbound of the selection's main range.
+prototypeAccessors.$from.get = function () {
+ return this.ranges[0].$from
+};
+
+// :: ResolvedPos
+// The resolved upper bound of the selection's main range.
+prototypeAccessors.$to.get = function () {
+ return this.ranges[0].$to
+};
+
+// :: bool
+// Indicates whether the selection contains any content.
+prototypeAccessors.empty.get = function () {
+ var ranges = this.ranges;
+ for (var i = 0; i < ranges.length; i++)
+ { if (ranges[i].$from.pos != ranges[i].$to.pos) { return false } }
+ return true
+};
+
+// eq:: (Selection) → bool
+// Test whether the selection is the same as another selection.
+
+// map:: (doc: Node, mapping: Mappable) → Selection
+// Map this selection through a [mappable](#transform.Mappable) thing. `doc`
+// should be the new document to which we are mapping.
+
+// :: () → Slice
+// Get the content of this selection as a slice.
+Selection.prototype.content = function content () {
+ return this.$from.node(0).slice(this.from, this.to, true)
+};
+
+// :: (Transaction, ?Slice)
+// Replace the selection with a slice or, if no slice is given,
+// delete the selection. Will append to the given transaction.
+Selection.prototype.replace = function replace (tr, content) {
+ if ( content === void 0 ) content = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty;
+
+ // Put the new selection at the position after the inserted
+ // content. When that ended in an inline node, search backwards,
+ // to get the position after that node. If not, search forward.
+ var lastNode = content.content.lastChild, lastParent = null;
+ for (var i = 0; i < content.openEnd; i++) {
+ lastParent = lastNode;
+ lastNode = lastNode.lastChild;
+ }
+
+ var mapFrom = tr.steps.length, ranges = this.ranges;
+ for (var i$1 = 0; i$1 < ranges.length; i$1++) {
+ var ref = ranges[i$1];
+ var $from = ref.$from;
+ var $to = ref.$to;
+ var mapping = tr.mapping.slice(mapFrom);
+ tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i$1 ? prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty : content);
+ if (i$1 == 0)
+ { selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1); }
+ }
+};
+
+// :: (Transaction, Node)
+// Replace the selection with the given node, appending the changes
+// to the given transaction.
+Selection.prototype.replaceWith = function replaceWith (tr, node) {
+ var mapFrom = tr.steps.length, ranges = this.ranges;
+ for (var i = 0; i < ranges.length; i++) {
+ var ref = ranges[i];
+ var $from = ref.$from;
+ var $to = ref.$to;
+ var mapping = tr.mapping.slice(mapFrom);
+ var from = mapping.map($from.pos), to = mapping.map($to.pos);
+ if (i) {
+ tr.deleteRange(from, to);
+ } else {
+ tr.replaceRangeWith(from, to, node);
+ selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);
+ }
+ }
+};
+
+// toJSON:: () → Object
+// Convert the selection to a JSON representation. When implementing
+// this for a custom selection class, make sure to give the object a
+// `type` property whose value matches the ID under which you
+// [registered](#state.Selection^jsonID) your class.
+
+// :: (ResolvedPos, number, ?bool) → ?Selection
+// Find a valid cursor or leaf node selection starting at the given
+// position and searching back if `dir` is negative, and forward if
+// positive. When `textOnly` is true, only consider cursor
+// selections. Will return null when no valid selection position is
+// found.
+Selection.findFrom = function findFrom ($pos, dir, textOnly) {
+ var inner = $pos.parent.inlineContent ? new TextSelection($pos)
+ : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);
+ if (inner) { return inner }
+
+ for (var depth = $pos.depth - 1; depth >= 0; depth--) {
+ var found = dir < 0
+ ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)
+ : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);
+ if (found) { return found }
+ }
+};
+
+// :: (ResolvedPos, ?number) → Selection
+// Find a valid cursor or leaf node selection near the given
+// position. Searches forward first by default, but if `bias` is
+// negative, it will search backwards first.
+Selection.near = function near ($pos, bias) {
+ if ( bias === void 0 ) bias = 1;
+
+ return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0))
+};
+
+// :: (Node) → Selection
+// Find the cursor or leaf node selection closest to the start of
+// the given document. Will return an
+// [`AllSelection`](#state.AllSelection) if no valid position
+// exists.
+Selection.atStart = function atStart (doc) {
+ return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc)
+};
+
+// :: (Node) → Selection
+// Find the cursor or leaf node selection closest to the end of the
+// given document.
+Selection.atEnd = function atEnd (doc) {
+ return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc)
+};
+
+// :: (Node, Object) → Selection
+// Deserialize the JSON representation of a selection. Must be
+// implemented for custom classes (as a static class method).
+Selection.fromJSON = function fromJSON (doc, json) {
+ if (!json || !json.type) { throw new RangeError("Invalid input for Selection.fromJSON") }
+ var cls = classesById[json.type];
+ if (!cls) { throw new RangeError(("No selection type " + (json.type) + " defined")) }
+ return cls.fromJSON(doc, json)
+};
+
+// :: (string, constructor)
+// To be able to deserialize selections from JSON, custom selection
+// classes must register themselves with an ID string, so that they
+// can be disambiguated. Try to pick something that's unlikely to
+// clash with classes from other modules.
+Selection.jsonID = function jsonID (id, selectionClass) {
+ if (id in classesById) { throw new RangeError("Duplicate use of selection JSON ID " + id) }
+ classesById[id] = selectionClass;
+ selectionClass.prototype.jsonID = id;
+ return selectionClass
+};
+
+// :: () → SelectionBookmark
+// Get a [bookmark](#state.SelectionBookmark) for this selection,
+// which is a value that can be mapped without having access to a
+// current document, and later resolved to a real selection for a
+// given document again. (This is used mostly by the history to
+// track and restore old selections.) The default implementation of
+// this method just converts the selection to a text selection and
+// returns the bookmark for that.
+Selection.prototype.getBookmark = function getBookmark () {
+ return TextSelection.between(this.$anchor, this.$head).getBookmark()
+};
+
+Object.defineProperties( Selection.prototype, prototypeAccessors );
+
+// :: bool
+// Controls whether, when a selection of this type is active in the
+// browser, the selected range should be visible to the user. Defaults
+// to `true`.
+Selection.prototype.visible = true;
+
+// SelectionBookmark:: interface
+// A lightweight, document-independent representation of a selection.
+// You can define a custom bookmark type for a custom selection class
+// to make the history handle it well.
+//
+// map:: (mapping: Mapping) → SelectionBookmark
+// Map the bookmark through a set of changes.
+//
+// resolve:: (doc: Node) → Selection
+// Resolve the bookmark to a real selection again. This may need to
+// do some error checking and may fall back to a default (usually
+// [`TextSelection.between`](#state.TextSelection^between)) if
+// mapping made the bookmark invalid.
+
+// ::- Represents a selected range in a document.
+var SelectionRange = function SelectionRange($from, $to) {
+ // :: ResolvedPos
+ // The lower bound of the range.
+ this.$from = $from;
+ // :: ResolvedPos
+ // The upper bound of the range.
+ this.$to = $to;
+};
+
+// ::- A text selection represents a classical editor selection, with
+// a head (the moving side) and anchor (immobile side), both of which
+// point into textblock nodes. It can be empty (a regular cursor
+// position).
+var TextSelection = /*@__PURE__*/(function (Selection) {
+ function TextSelection($anchor, $head) {
+ if ( $head === void 0 ) $head = $anchor;
+
+ Selection.call(this, $anchor, $head);
+ }
+
+ if ( Selection ) TextSelection.__proto__ = Selection;
+ TextSelection.prototype = Object.create( Selection && Selection.prototype );
+ TextSelection.prototype.constructor = TextSelection;
+
+ var prototypeAccessors$1 = { $cursor: { configurable: true } };
+
+ // :: ?ResolvedPos
+ // Returns a resolved position if this is a cursor selection (an
+ // empty text selection), and null otherwise.
+ prototypeAccessors$1.$cursor.get = function () { return this.$anchor.pos == this.$head.pos ? this.$head : null };
+
+ TextSelection.prototype.map = function map (doc, mapping) {
+ var $head = doc.resolve(mapping.map(this.head));
+ if (!$head.parent.inlineContent) { return Selection.near($head) }
+ var $anchor = doc.resolve(mapping.map(this.anchor));
+ return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head)
+ };
+
+ TextSelection.prototype.replace = function replace (tr, content) {
+ if ( content === void 0 ) content = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty;
+
+ Selection.prototype.replace.call(this, tr, content);
+ if (content == prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty) {
+ var marks = this.$from.marksAcross(this.$to);
+ if (marks) { tr.ensureMarks(marks); }
+ }
+ };
+
+ TextSelection.prototype.eq = function eq (other) {
+ return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head
+ };
+
+ TextSelection.prototype.getBookmark = function getBookmark () {
+ return new TextBookmark(this.anchor, this.head)
+ };
+
+ TextSelection.prototype.toJSON = function toJSON () {
+ return {type: "text", anchor: this.anchor, head: this.head}
+ };
+
+ TextSelection.fromJSON = function fromJSON (doc, json) {
+ if (typeof json.anchor != "number" || typeof json.head != "number")
+ { throw new RangeError("Invalid input for TextSelection.fromJSON") }
+ return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head))
+ };
+
+ // :: (Node, number, ?number) → TextSelection
+ // Create a text selection from non-resolved positions.
+ TextSelection.create = function create (doc, anchor, head) {
+ if ( head === void 0 ) head = anchor;
+
+ var $anchor = doc.resolve(anchor);
+ return new this($anchor, head == anchor ? $anchor : doc.resolve(head))
+ };
+
+ // :: (ResolvedPos, ResolvedPos, ?number) → Selection
+ // Return a text selection that spans the given positions or, if
+ // they aren't text positions, find a text selection near them.
+ // `bias` determines whether the method searches forward (default)
+ // or backwards (negative number) first. Will fall back to calling
+ // [`Selection.near`](#state.Selection^near) when the document
+ // doesn't contain a valid text position.
+ TextSelection.between = function between ($anchor, $head, bias) {
+ var dPos = $anchor.pos - $head.pos;
+ if (!bias || dPos) { bias = dPos >= 0 ? 1 : -1; }
+ if (!$head.parent.inlineContent) {
+ var found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);
+ if (found) { $head = found.$head; }
+ else { return Selection.near($head, bias) }
+ }
+ if (!$anchor.parent.inlineContent) {
+ if (dPos == 0) {
+ $anchor = $head;
+ } else {
+ $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;
+ if (($anchor.pos < $head.pos) != (dPos < 0)) { $anchor = $head; }
+ }
+ }
+ return new TextSelection($anchor, $head)
+ };
+
+ Object.defineProperties( TextSelection.prototype, prototypeAccessors$1 );
+
+ return TextSelection;
+}(Selection));
+
+Selection.jsonID("text", TextSelection);
+
+var TextBookmark = function TextBookmark(anchor, head) {
+ this.anchor = anchor;
+ this.head = head;
+};
+TextBookmark.prototype.map = function map (mapping) {
+ return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head))
+};
+TextBookmark.prototype.resolve = function resolve (doc) {
+ return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head))
+};
+
+// ::- A node selection is a selection that points at a single node.
+// All nodes marked [selectable](#model.NodeSpec.selectable) can be
+// the target of a node selection. In such a selection, `from` and
+// `to` point directly before and after the selected node, `anchor`
+// equals `from`, and `head` equals `to`..
+var NodeSelection = /*@__PURE__*/(function (Selection) {
+ function NodeSelection($pos) {
+ var node = $pos.nodeAfter;
+ var $end = $pos.node(0).resolve($pos.pos + node.nodeSize);
+ Selection.call(this, $pos, $end);
+ // :: Node The selected node.
+ this.node = node;
+ }
+
+ if ( Selection ) NodeSelection.__proto__ = Selection;
+ NodeSelection.prototype = Object.create( Selection && Selection.prototype );
+ NodeSelection.prototype.constructor = NodeSelection;
+
+ NodeSelection.prototype.map = function map (doc, mapping) {
+ var ref = mapping.mapResult(this.anchor);
+ var deleted = ref.deleted;
+ var pos = ref.pos;
+ var $pos = doc.resolve(pos);
+ if (deleted) { return Selection.near($pos) }
+ return new NodeSelection($pos)
+ };
+
+ NodeSelection.prototype.content = function content () {
+ return new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from(this.node), 0, 0)
+ };
+
+ NodeSelection.prototype.eq = function eq (other) {
+ return other instanceof NodeSelection && other.anchor == this.anchor
+ };
+
+ NodeSelection.prototype.toJSON = function toJSON () {
+ return {type: "node", anchor: this.anchor}
+ };
+
+ NodeSelection.prototype.getBookmark = function getBookmark () { return new NodeBookmark(this.anchor) };
+
+ NodeSelection.fromJSON = function fromJSON (doc, json) {
+ if (typeof json.anchor != "number")
+ { throw new RangeError("Invalid input for NodeSelection.fromJSON") }
+ return new NodeSelection(doc.resolve(json.anchor))
+ };
+
+ // :: (Node, number) → NodeSelection
+ // Create a node selection from non-resolved positions.
+ NodeSelection.create = function create (doc, from) {
+ return new this(doc.resolve(from))
+ };
+
+ // :: (Node) → bool
+ // Determines whether the given node may be selected as a node
+ // selection.
+ NodeSelection.isSelectable = function isSelectable (node) {
+ return !node.isText && node.type.spec.selectable !== false
+ };
+
+ return NodeSelection;
+}(Selection));
+
+NodeSelection.prototype.visible = false;
+
+Selection.jsonID("node", NodeSelection);
+
+var NodeBookmark = function NodeBookmark(anchor) {
+ this.anchor = anchor;
+};
+NodeBookmark.prototype.map = function map (mapping) {
+ var ref = mapping.mapResult(this.anchor);
+ var deleted = ref.deleted;
+ var pos = ref.pos;
+ return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos)
+};
+NodeBookmark.prototype.resolve = function resolve (doc) {
+ var $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;
+ if (node && NodeSelection.isSelectable(node)) { return new NodeSelection($pos) }
+ return Selection.near($pos)
+};
+
+// ::- A selection type that represents selecting the whole document
+// (which can not necessarily be expressed with a text selection, when
+// there are for example leaf block nodes at the start or end of the
+// document).
+var AllSelection = /*@__PURE__*/(function (Selection) {
+ function AllSelection(doc) {
+ Selection.call(this, doc.resolve(0), doc.resolve(doc.content.size));
+ }
+
+ if ( Selection ) AllSelection.__proto__ = Selection;
+ AllSelection.prototype = Object.create( Selection && Selection.prototype );
+ AllSelection.prototype.constructor = AllSelection;
+
+ AllSelection.prototype.toJSON = function toJSON () { return {type: "all"} };
+
+ AllSelection.fromJSON = function fromJSON (doc) { return new AllSelection(doc) };
+
+ AllSelection.prototype.map = function map (doc) { return new AllSelection(doc) };
+
+ AllSelection.prototype.eq = function eq (other) { return other instanceof AllSelection };
+
+ AllSelection.prototype.getBookmark = function getBookmark () { return AllBookmark };
+
+ return AllSelection;
+}(Selection));
+
+Selection.jsonID("all", AllSelection);
+
+var AllBookmark = {
+ map: function map() { return this },
+ resolve: function resolve(doc) { return new AllSelection(doc) }
+};
+
+// FIXME we'll need some awareness of text direction when scanning for selections
+
+// Try to find a selection inside the given node. `pos` points at the
+// position where the search starts. When `text` is true, only return
+// text selections.
+function findSelectionIn(doc, node, pos, index, dir, text) {
+ if (node.inlineContent) { return TextSelection.create(doc, pos) }
+ for (var i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {
+ var child = node.child(i);
+ if (!child.isAtom) {
+ var inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);
+ if (inner) { return inner }
+ } else if (!text && NodeSelection.isSelectable(child)) {
+ return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0))
+ }
+ pos += child.nodeSize * dir;
+ }
+}
+
+function selectionToInsertionEnd(tr, startLen, bias) {
+ var last = tr.steps.length - 1;
+ if (last < startLen) { return }
+ var step = tr.steps[last];
+ if (!(step instanceof prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__["ReplaceStep"] || step instanceof prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__["ReplaceAroundStep"])) { return }
+ var map = tr.mapping.maps[last], end;
+ map.forEach(function (_from, _to, _newFrom, newTo) { if (end == null) { end = newTo; } });
+ tr.setSelection(Selection.near(tr.doc.resolve(end), bias));
+}
+
+var UPDATED_SEL = 1, UPDATED_MARKS = 2, UPDATED_SCROLL = 4;
+
+// ::- An editor state transaction, which can be applied to a state to
+// create an updated state. Use
+// [`EditorState.tr`](#state.EditorState.tr) to create an instance.
+//
+// Transactions track changes to the document (they are a subclass of
+// [`Transform`](#transform.Transform)), but also other state changes,
+// like selection updates and adjustments of the set of [stored
+// marks](#state.EditorState.storedMarks). In addition, you can store
+// metadata properties in a transaction, which are extra pieces of
+// information that client code or plugins can use to describe what a
+// transacion represents, so that they can update their [own
+// state](#state.StateField) accordingly.
+//
+// The [editor view](#view.EditorView) uses a few metadata properties:
+// it will attach a property `"pointer"` with the value `true` to
+// selection transactions directly caused by mouse or touch input, and
+// a `"uiEvent"` property of that may be `"paste"`, `"cut"`, or `"drop"`.
+var Transaction = /*@__PURE__*/(function (Transform) {
+ function Transaction(state) {
+ Transform.call(this, state.doc);
+ // :: number
+ // The timestamp associated with this transaction, in the same
+ // format as `Date.now()`.
+ this.time = Date.now();
+ this.curSelection = state.selection;
+ // The step count for which the current selection is valid.
+ this.curSelectionFor = 0;
+ // :: ?[Mark]
+ // The stored marks set by this transaction, if any.
+ this.storedMarks = state.storedMarks;
+ // Bitfield to track which aspects of the state were updated by
+ // this transaction.
+ this.updated = 0;
+ // Object used to store metadata properties for the transaction.
+ this.meta = Object.create(null);
+ }
+
+ if ( Transform ) Transaction.__proto__ = Transform;
+ Transaction.prototype = Object.create( Transform && Transform.prototype );
+ Transaction.prototype.constructor = Transaction;
+
+ var prototypeAccessors = { selection: { configurable: true },selectionSet: { configurable: true },storedMarksSet: { configurable: true },isGeneric: { configurable: true },scrolledIntoView: { configurable: true } };
+
+ // :: Selection
+ // The transaction's current selection. This defaults to the editor
+ // selection [mapped](#state.Selection.map) through the steps in the
+ // transaction, but can be overwritten with
+ // [`setSelection`](#state.Transaction.setSelection).
+ prototypeAccessors.selection.get = function () {
+ if (this.curSelectionFor < this.steps.length) {
+ this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));
+ this.curSelectionFor = this.steps.length;
+ }
+ return this.curSelection
+ };
+
+ // :: (Selection) → Transaction
+ // Update the transaction's current selection. Will determine the
+ // selection that the editor gets when the transaction is applied.
+ Transaction.prototype.setSelection = function setSelection (selection) {
+ if (selection.$from.doc != this.doc)
+ { throw new RangeError("Selection passed to setSelection must point at the current document") }
+ this.curSelection = selection;
+ this.curSelectionFor = this.steps.length;
+ this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;
+ this.storedMarks = null;
+ return this
+ };
+
+ // :: bool
+ // Whether the selection was explicitly updated by this transaction.
+ prototypeAccessors.selectionSet.get = function () {
+ return (this.updated & UPDATED_SEL) > 0
+ };
+
+ // :: (?[Mark]) → Transaction
+ // Set the current stored marks.
+ Transaction.prototype.setStoredMarks = function setStoredMarks (marks) {
+ this.storedMarks = marks;
+ this.updated |= UPDATED_MARKS;
+ return this
+ };
+
+ // :: ([Mark]) → Transaction
+ // Make sure the current stored marks or, if that is null, the marks
+ // at the selection, match the given set of marks. Does nothing if
+ // this is already the case.
+ Transaction.prototype.ensureMarks = function ensureMarks (marks) {
+ if (!prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Mark"].sameSet(this.storedMarks || this.selection.$from.marks(), marks))
+ { this.setStoredMarks(marks); }
+ return this
+ };
+
+ // :: (Mark) → Transaction
+ // Add a mark to the set of stored marks.
+ Transaction.prototype.addStoredMark = function addStoredMark (mark) {
+ return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()))
+ };
+
+ // :: (union) → Transaction
+ // Remove a mark or mark type from the set of stored marks.
+ Transaction.prototype.removeStoredMark = function removeStoredMark (mark) {
+ return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()))
+ };
+
+ // :: bool
+ // Whether the stored marks were explicitly set for this transaction.
+ prototypeAccessors.storedMarksSet.get = function () {
+ return (this.updated & UPDATED_MARKS) > 0
+ };
+
+ Transaction.prototype.addStep = function addStep (step, doc) {
+ Transform.prototype.addStep.call(this, step, doc);
+ this.updated = this.updated & ~UPDATED_MARKS;
+ this.storedMarks = null;
+ };
+
+ // :: (number) → Transaction
+ // Update the timestamp for the transaction.
+ Transaction.prototype.setTime = function setTime (time) {
+ this.time = time;
+ return this
+ };
+
+ // :: (Slice) → Transaction
+ // Replace the current selection with the given slice.
+ Transaction.prototype.replaceSelection = function replaceSelection (slice) {
+ this.selection.replace(this, slice);
+ return this
+ };
+
+ // :: (Node, ?bool) → Transaction
+ // Replace the selection with the given node. When `inheritMarks` is
+ // true and the content is inline, it inherits the marks from the
+ // place where it is inserted.
+ Transaction.prototype.replaceSelectionWith = function replaceSelectionWith (node, inheritMarks) {
+ var selection = this.selection;
+ if (inheritMarks !== false)
+ { node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Mark"].none))); }
+ selection.replaceWith(this, node);
+ return this
+ };
+
+ // :: () → Transaction
+ // Delete the selection.
+ Transaction.prototype.deleteSelection = function deleteSelection () {
+ this.selection.replace(this);
+ return this
+ };
+
+ // :: (string, from: ?number, to: ?number) → Transaction
+ // Replace the given range, or the selection if no range is given,
+ // with a text node containing the given string.
+ Transaction.prototype.insertText = function insertText (text, from, to) {
+ if ( to === void 0 ) to = from;
+
+ var schema = this.doc.type.schema;
+ if (from == null) {
+ if (!text) { return this.deleteSelection() }
+ return this.replaceSelectionWith(schema.text(text), true)
+ } else {
+ if (!text) { return this.deleteRange(from, to) }
+ var marks = this.storedMarks;
+ if (!marks) {
+ var $from = this.doc.resolve(from);
+ marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));
+ }
+ this.replaceRangeWith(from, to, schema.text(text, marks));
+ if (!this.selection.empty) { this.setSelection(Selection.near(this.selection.$to)); }
+ return this
+ }
+ };
+
+ // :: (union, any) → Transaction
+ // Store a metadata property in this transaction, keyed either by
+ // name or by plugin.
+ Transaction.prototype.setMeta = function setMeta (key, value) {
+ this.meta[typeof key == "string" ? key : key.key] = value;
+ return this
+ };
+
+ // :: (union) → any
+ // Retrieve a metadata property for a given name or plugin.
+ Transaction.prototype.getMeta = function getMeta (key) {
+ return this.meta[typeof key == "string" ? key : key.key]
+ };
+
+ // :: bool
+ // Returns true if this transaction doesn't contain any metadata,
+ // and can thus safely be extended.
+ prototypeAccessors.isGeneric.get = function () {
+ for (var _ in this.meta) { return false }
+ return true
+ };
+
+ // :: () → Transaction
+ // Indicate that the editor should scroll the selection into view
+ // when updated to the state produced by this transaction.
+ Transaction.prototype.scrollIntoView = function scrollIntoView () {
+ this.updated |= UPDATED_SCROLL;
+ return this
+ };
+
+ prototypeAccessors.scrolledIntoView.get = function () {
+ return (this.updated & UPDATED_SCROLL) > 0
+ };
+
+ Object.defineProperties( Transaction.prototype, prototypeAccessors );
+
+ return Transaction;
+}(prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__["Transform"]));
+
+function bind(f, self) {
+ return !self || !f ? f : f.bind(self)
+}
+
+var FieldDesc = function FieldDesc(name, desc, self) {
+ this.name = name;
+ this.init = bind(desc.init, self);
+ this.apply = bind(desc.apply, self);
+};
+
+var baseFields = [
+ new FieldDesc("doc", {
+ init: function init(config) { return config.doc || config.schema.topNodeType.createAndFill() },
+ apply: function apply(tr) { return tr.doc }
+ }),
+
+ new FieldDesc("selection", {
+ init: function init(config, instance) { return config.selection || Selection.atStart(instance.doc) },
+ apply: function apply(tr) { return tr.selection }
+ }),
+
+ new FieldDesc("storedMarks", {
+ init: function init(config) { return config.storedMarks || null },
+ apply: function apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null }
+ }),
+
+ new FieldDesc("scrollToSelection", {
+ init: function init() { return 0 },
+ apply: function apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev }
+ })
+];
+
+// Object wrapping the part of a state object that stays the same
+// across transactions. Stored in the state's `config` property.
+var Configuration = function Configuration(schema, plugins) {
+ var this$1 = this;
+
+ this.schema = schema;
+ this.fields = baseFields.concat();
+ this.plugins = [];
+ this.pluginsByKey = Object.create(null);
+ if (plugins) { plugins.forEach(function (plugin) {
+ if (this$1.pluginsByKey[plugin.key])
+ { throw new RangeError("Adding different instances of a keyed plugin (" + plugin.key + ")") }
+ this$1.plugins.push(plugin);
+ this$1.pluginsByKey[plugin.key] = plugin;
+ if (plugin.spec.state)
+ { this$1.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin)); }
+ }); }
+};
+
+// ::- The state of a ProseMirror editor is represented by an object
+// of this type. A state is a persistent data structure—it isn't
+// updated, but rather a new state value is computed from an old one
+// using the [`apply`](#state.EditorState.apply) method.
+//
+// A state holds a number of built-in fields, and plugins can
+// [define](#state.PluginSpec.state) additional fields.
+var EditorState = function EditorState(config) {
+ this.config = config;
+};
+
+var prototypeAccessors$1 = { schema: { configurable: true },plugins: { configurable: true },tr: { configurable: true } };
+
+// doc:: Node
+// The current document.
+
+// selection:: Selection
+// The selection.
+
+// storedMarks:: ?[Mark]
+// A set of marks to apply to the next input. Will be null when
+// no explicit marks have been set.
+
+// :: Schema
+// The schema of the state's document.
+prototypeAccessors$1.schema.get = function () {
+ return this.config.schema
+};
+
+// :: [Plugin]
+// The plugins that are active in this state.
+prototypeAccessors$1.plugins.get = function () {
+ return this.config.plugins
+};
+
+// :: (Transaction) → EditorState
+// Apply the given transaction to produce a new state.
+EditorState.prototype.apply = function apply (tr) {
+ return this.applyTransaction(tr).state
+};
+
+// : (Transaction) → bool
+EditorState.prototype.filterTransaction = function filterTransaction (tr, ignore) {
+ if ( ignore === void 0 ) ignore = -1;
+
+ for (var i = 0; i < this.config.plugins.length; i++) { if (i != ignore) {
+ var plugin = this.config.plugins[i];
+ if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this))
+ { return false }
+ } }
+ return true
+};
+
+// :: (Transaction) → {state: EditorState, transactions: [Transaction]}
+// Verbose variant of [`apply`](#state.EditorState.apply) that
+// returns the precise transactions that were applied (which might
+// be influenced by the [transaction
+// hooks](#state.PluginSpec.filterTransaction) of
+// plugins) along with the new state.
+EditorState.prototype.applyTransaction = function applyTransaction (rootTr) {
+ if (!this.filterTransaction(rootTr)) { return {state: this, transactions: []} }
+
+ var trs = [rootTr], newState = this.applyInner(rootTr), seen = null;
+ // This loop repeatedly gives plugins a chance to respond to
+ // transactions as new transactions are added, making sure to only
+ // pass the transactions the plugin did not see before.
+ for (;;) {
+ var haveNew = false;
+ for (var i = 0; i < this.config.plugins.length; i++) {
+ var plugin = this.config.plugins[i];
+ if (plugin.spec.appendTransaction) {
+ var n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this;
+ var tr = n < trs.length &&
+ plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);
+ if (tr && newState.filterTransaction(tr, i)) {
+ tr.setMeta("appendedTransaction", rootTr);
+ if (!seen) {
+ seen = [];
+ for (var j = 0; j < this.config.plugins.length; j++)
+ { seen.push(j < i ? {state: newState, n: trs.length} : {state: this, n: 0}); }
+ }
+ trs.push(tr);
+ newState = newState.applyInner(tr);
+ haveNew = true;
+ }
+ if (seen) { seen[i] = {state: newState, n: trs.length}; }
+ }
+ }
+ if (!haveNew) { return {state: newState, transactions: trs} }
+ }
+};
+
+// : (Transaction) → EditorState
+EditorState.prototype.applyInner = function applyInner (tr) {
+ if (!tr.before.eq(this.doc)) { throw new RangeError("Applying a mismatched transaction") }
+ var newInstance = new EditorState(this.config), fields = this.config.fields;
+ for (var i = 0; i < fields.length; i++) {
+ var field = fields[i];
+ newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance);
+ }
+ for (var i$1 = 0; i$1 < applyListeners.length; i$1++) { applyListeners[i$1](this, tr, newInstance); }
+ return newInstance
+};
+
+// :: Transaction
+// Start a [transaction](#state.Transaction) from this state.
+prototypeAccessors$1.tr.get = function () { return new Transaction(this) };
+
+// :: (Object) → EditorState
+// Create a new state.
+//
+// config::- Configuration options. Must contain `schema` or `doc` (or both).
+//
+// schema:: ?Schema
+// The schema to use.
+//
+// doc:: ?Node
+// The starting document.
+//
+// selection:: ?Selection
+// A valid selection in the document.
+//
+// storedMarks:: ?[Mark]
+// The initial set of [stored marks](#state.EditorState.storedMarks).
+//
+// plugins:: ?[Plugin]
+// The plugins that should be active in this state.
+EditorState.create = function create (config) {
+ var $config = new Configuration(config.schema || config.doc.type.schema, config.plugins);
+ var instance = new EditorState($config);
+ for (var i = 0; i < $config.fields.length; i++)
+ { instance[$config.fields[i].name] = $config.fields[i].init(config, instance); }
+ return instance
+};
+
+// :: (Object) → EditorState
+// Create a new state based on this one, but with an adjusted set of
+// active plugins. State fields that exist in both sets of plugins
+// are kept unchanged. Those that no longer exist are dropped, and
+// those that are new are initialized using their
+// [`init`](#state.StateField.init) method, passing in the new
+// configuration object..
+//
+// config::- configuration options
+//
+// schema:: ?Schema
+// New schema to use.
+//
+// plugins:: ?[Plugin]
+// New set of active plugins.
+EditorState.prototype.reconfigure = function reconfigure (config) {
+ var $config = new Configuration(config.schema || this.schema, config.plugins);
+ var fields = $config.fields, instance = new EditorState($config);
+ for (var i = 0; i < fields.length; i++) {
+ var name = fields[i].name;
+ instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance);
+ }
+ return instance
+};
+
+// :: (?union, string, number>) → Object
+// Serialize this state to JSON. If you want to serialize the state
+// of plugins, pass an object mapping property names to use in the
+// resulting JSON object to plugin objects. The argument may also be
+// a string or number, in which case it is ignored, to support the
+// way `JSON.stringify` calls `toString` methods.
+EditorState.prototype.toJSON = function toJSON (pluginFields) {
+ var result = {doc: this.doc.toJSON(), selection: this.selection.toJSON()};
+ if (this.storedMarks) { result.storedMarks = this.storedMarks.map(function (m) { return m.toJSON(); }); }
+ if (pluginFields && typeof pluginFields == 'object') { for (var prop in pluginFields) {
+ if (prop == "doc" || prop == "selection")
+ { throw new RangeError("The JSON fields `doc` and `selection` are reserved") }
+ var plugin = pluginFields[prop], state = plugin.spec.state;
+ if (state && state.toJSON) { result[prop] = state.toJSON.call(plugin, this[plugin.key]); }
+ } }
+ return result
+};
+
+// :: (Object, Object, ?Object) → EditorState
+// Deserialize a JSON representation of a state. `config` should
+// have at least a `schema` field, and should contain array of
+// plugins to initialize the state with. `pluginFields` can be used
+// to deserialize the state of plugins, by associating plugin
+// instances with the property names they use in the JSON object.
+//
+// config::- configuration options
+//
+// schema:: Schema
+// The schema to use.
+//
+// plugins:: ?[Plugin]
+// The set of active plugins.
+EditorState.fromJSON = function fromJSON (config, json, pluginFields) {
+ if (!json) { throw new RangeError("Invalid input for EditorState.fromJSON") }
+ if (!config.schema) { throw new RangeError("Required config field 'schema' missing") }
+ var $config = new Configuration(config.schema, config.plugins);
+ var instance = new EditorState($config);
+ $config.fields.forEach(function (field) {
+ if (field.name == "doc") {
+ instance.doc = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Node"].fromJSON(config.schema, json.doc);
+ } else if (field.name == "selection") {
+ instance.selection = Selection.fromJSON(instance.doc, json.selection);
+ } else if (field.name == "storedMarks") {
+ if (json.storedMarks) { instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON); }
+ } else {
+ if (pluginFields) { for (var prop in pluginFields) {
+ var plugin = pluginFields[prop], state = plugin.spec.state;
+ if (plugin.key == field.name && state && state.fromJSON &&
+ Object.prototype.hasOwnProperty.call(json, prop)) {
+ // This field belongs to a plugin mapped to a JSON field, read it from there.
+ instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);
+ return
+ }
+ } }
+ instance[field.name] = field.init(config, instance);
+ }
+ });
+ return instance
+};
+
+// Kludge to allow the view to track mappings between different
+// instances of a state.
+//
+// FIXME this is no longer needed as of prosemirror-view 1.9.0,
+// though due to backwards-compat we should probably keep it around
+// for a while (if only as a no-op)
+EditorState.addApplyListener = function addApplyListener (f) {
+ applyListeners.push(f);
+};
+EditorState.removeApplyListener = function removeApplyListener (f) {
+ var found = applyListeners.indexOf(f);
+ if (found > -1) { applyListeners.splice(found, 1); }
+};
+
+Object.defineProperties( EditorState.prototype, prototypeAccessors$1 );
+
+var applyListeners = [];
+
+// PluginSpec:: interface
+//
+// This is the type passed to the [`Plugin`](#state.Plugin)
+// constructor. It provides a definition for a plugin.
+//
+// props:: ?EditorProps
+// The [view props](#view.EditorProps) added by this plugin. Props
+// that are functions will be bound to have the plugin instance as
+// their `this` binding.
+//
+// state:: ?StateField
+// Allows a plugin to define a [state field](#state.StateField), an
+// extra slot in the state object in which it can keep its own data.
+//
+// key:: ?PluginKey
+// Can be used to make this a keyed plugin. You can have only one
+// plugin with a given key in a given state, but it is possible to
+// access the plugin's configuration and state through the key,
+// without having access to the plugin instance object.
+//
+// view:: ?(EditorView) → Object
+// When the plugin needs to interact with the editor view, or
+// set something up in the DOM, use this field. The function
+// will be called when the plugin's state is associated with an
+// editor view.
+//
+// return::-
+// Should return an object with the following optional
+// properties:
+//
+// update:: ?(view: EditorView, prevState: EditorState)
+// Called whenever the view's state is updated.
+//
+// destroy:: ?()
+// Called when the view is destroyed or receives a state
+// with different plugins.
+//
+// filterTransaction:: ?(Transaction, EditorState) → bool
+// When present, this will be called before a transaction is
+// applied by the state, allowing the plugin to cancel it (by
+// returning false).
+//
+// appendTransaction:: ?(transactions: [Transaction], oldState: EditorState, newState: EditorState) → ?Transaction
+// Allows the plugin to append another transaction to be applied
+// after the given array of transactions. When another plugin
+// appends a transaction after this was called, it is called again
+// with the new state and new transactions—but only the new
+// transactions, i.e. it won't be passed transactions that it
+// already saw.
+
+function bindProps(obj, self, target) {
+ for (var prop in obj) {
+ var val = obj[prop];
+ if (val instanceof Function) { val = val.bind(self); }
+ else if (prop == "handleDOMEvents") { val = bindProps(val, self, {}); }
+ target[prop] = val;
+ }
+ return target
+}
+
+// ::- Plugins bundle functionality that can be added to an editor.
+// They are part of the [editor state](#state.EditorState) and
+// may influence that state and the view that contains it.
+var Plugin = function Plugin(spec) {
+ // :: EditorProps
+ // The [props](#view.EditorProps) exported by this plugin.
+ this.props = {};
+ if (spec.props) { bindProps(spec.props, this, this.props); }
+ // :: Object
+ // The plugin's [spec object](#state.PluginSpec).
+ this.spec = spec;
+ this.key = spec.key ? spec.key.key : createKey("plugin");
+};
+
+// :: (EditorState) → any
+// Extract the plugin's state field from an editor state.
+Plugin.prototype.getState = function getState (state) { return state[this.key] };
+
+// StateField:: interface
+// A plugin spec may provide a state field (under its
+// [`state`](#state.PluginSpec.state) property) of this type, which
+// describes the state it wants to keep. Functions provided here are
+// always called with the plugin instance as their `this` binding.
+//
+// init:: (config: Object, instance: EditorState) → T
+// Initialize the value of the field. `config` will be the object
+// passed to [`EditorState.create`](#state.EditorState^create). Note
+// that `instance` is a half-initialized state instance, and will
+// not have values for plugin fields initialized after this one.
+//
+// apply:: (tr: Transaction, value: T, oldState: EditorState, newState: EditorState) → T
+// Apply the given transaction to this state field, producing a new
+// field value. Note that the `newState` argument is again a partially
+// constructed state does not yet contain the state from plugins
+// coming after this one.
+//
+// toJSON:: ?(value: T) → *
+// Convert this field to JSON. Optional, can be left off to disable
+// JSON serialization for the field.
+//
+// fromJSON:: ?(config: Object, value: *, state: EditorState) → T
+// Deserialize the JSON representation of this field. Note that the
+// `state` argument is again a half-initialized state.
+
+var keys = Object.create(null);
+
+function createKey(name) {
+ if (name in keys) { return name + "$" + ++keys[name] }
+ keys[name] = 0;
+ return name + "$"
+}
+
+// ::- A key is used to [tag](#state.PluginSpec.key)
+// plugins in a way that makes it possible to find them, given an
+// editor state. Assigning a key does mean only one plugin of that
+// type can be active in a state.
+var PluginKey = function PluginKey(name) {
+if ( name === void 0 ) name = "key";
+ this.key = createKey(name); };
+
+// :: (EditorState) → ?Plugin
+// Get the active plugin with this key, if any, from an editor
+// state.
+PluginKey.prototype.get = function get (state) { return state.config.pluginsByKey[this.key] };
+
+// :: (EditorState) → ?any
+// Get the plugin's state from an editor state.
+PluginKey.prototype.getState = function getState (state) { return state[this.key] };
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-tables/dist/index.es.js":
+/*!**********************************************************!*\
+ !*** ./node_modules/prosemirror-tables/dist/index.es.js ***!
+ \**********************************************************/
+/*! exports provided: CellSelection, TableMap, __clipCells, __insertCells, __pastedCells, addColumn, addColumnAfter, addColumnBefore, addRow, addRowAfter, addRowBefore, cellAround, colCount, columnResizing, columnResizingPluginKey, deleteColumn, deleteRow, deleteTable, findCell, fixTables, fixTablesKey, goToNextCell, handlePaste, inSameTable, isInTable, mergeCells, moveCellForward, nextCell, removeColumn, removeRow, rowIsHeader, selectedRect, selectionCell, setCellAttr, splitCell, splitCellWithType, tableEditing, tableEditingKey, tableNodes, toggleHeader, toggleHeaderCell, toggleHeaderColumn, toggleHeaderRow, updateColumnsOnResize */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "CellSelection", function() { return CellSelection; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "TableMap", function() { return TableMap; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "__clipCells", function() { return clipCells; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "__insertCells", function() { return insertCells; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "__pastedCells", function() { return pastedCells; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "addColumn", function() { return addColumn; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "addColumnAfter", function() { return addColumnAfter; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "addColumnBefore", function() { return addColumnBefore; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "addRow", function() { return addRow; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "addRowAfter", function() { return addRowAfter; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "addRowBefore", function() { return addRowBefore; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "cellAround", function() { return cellAround; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "colCount", function() { return colCount; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "columnResizing", function() { return columnResizing; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "columnResizingPluginKey", function() { return key$1; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "deleteColumn", function() { return deleteColumn; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "deleteRow", function() { return deleteRow; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "deleteTable", function() { return deleteTable; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "findCell", function() { return findCell; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "fixTables", function() { return fixTables; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "fixTablesKey", function() { return fixTablesKey; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "goToNextCell", function() { return goToNextCell; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "handlePaste", function() { return handlePaste; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "inSameTable", function() { return inSameTable; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "isInTable", function() { return isInTable; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "mergeCells", function() { return mergeCells; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "moveCellForward", function() { return moveCellForward; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "nextCell", function() { return nextCell; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "removeColumn", function() { return removeColumn; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "removeRow", function() { return removeRow; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "rowIsHeader", function() { return rowIsHeader; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "selectedRect", function() { return selectedRect; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "selectionCell", function() { return selectionCell; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "setCellAttr", function() { return setCellAttr; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "splitCell", function() { return splitCell; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "splitCellWithType", function() { return splitCellWithType; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "tableEditing", function() { return tableEditing; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "tableEditingKey", function() { return key; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "tableNodes", function() { return tableNodes; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toggleHeader", function() { return toggleHeader; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toggleHeaderCell", function() { return toggleHeaderCell; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toggleHeaderColumn", function() { return toggleHeaderColumn; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "toggleHeaderRow", function() { return toggleHeaderRow; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "updateColumnsOnResize", function() { return updateColumns; });
+/* harmony import */ var prosemirror_state__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+/* harmony import */ var prosemirror_model__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prosemirror-model */ "./node_modules/prosemirror-model/dist/index.es.js");
+/* harmony import */ var prosemirror_keymap__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prosemirror-keymap */ "./node_modules/prosemirror-keymap/dist/index.es.js");
+/* harmony import */ var prosemirror_view__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! prosemirror-view */ "./node_modules/prosemirror-view/dist/index.es.js");
+/* harmony import */ var prosemirror_transform__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! prosemirror-transform */ "./node_modules/prosemirror-transform/dist/index.es.js");
+
+
+
+
+
+
+// Because working with row and column-spanning cells is not quite
+// trivial, this code builds up a descriptive structure for a given
+// table node. The structures are cached with the (persistent) table
+// nodes as key, so that they only have to be recomputed when the
+// content of the table changes.
+//
+// This does mean that they have to store table-relative, not
+// document-relative positions. So code that uses them will typically
+// compute the start position of the table and offset positions passed
+// to or gotten from this structure by that amount.
+
+var readFromCache, addToCache;
+// Prefer using a weak map to cache table maps. Fall back on a
+// fixed-size cache if that's not supported.
+if (typeof WeakMap != "undefined") {
+ var cache = new WeakMap;
+ readFromCache = function (key) { return cache.get(key); };
+ addToCache = function (key, value) {
+ cache.set(key, value);
+ return value
+ };
+} else {
+ var cache$1 = [], cacheSize = 10, cachePos = 0;
+ readFromCache = function (key) {
+ for (var i = 0; i < cache$1.length; i += 2)
+ { if (cache$1[i] == key) { return cache$1[i + 1] } }
+ };
+ addToCache = function (key, value) {
+ if (cachePos == cacheSize) { cachePos = 0; }
+ cache$1[cachePos++] = key;
+ return cache$1[cachePos++] = value
+ };
+}
+
+var Rect = function Rect(left, top, right, bottom) {
+ this.left = left; this.top = top; this.right = right; this.bottom = bottom;
+};
+
+// ::- A table map describes the structore of a given table. To avoid
+// recomputing them all the time, they are cached per table node. To
+// be able to do that, positions saved in the map are relative to the
+// start of the table, rather than the start of the document.
+var TableMap = function TableMap(width, height, map, problems) {
+ // :: number The width of the table
+ this.width = width;
+ // :: number The table's height
+ this.height = height;
+ // :: [number] A width * height array with the start position of
+ // the cell covering that part of the table in each slot
+ this.map = map;
+ // An optional array of problems (cell overlap or non-rectangular
+ // shape) for the table, used by the table normalizer.
+ this.problems = problems;
+};
+
+// :: (number) → Rect
+// Find the dimensions of the cell at the given position.
+TableMap.prototype.findCell = function findCell (pos) {
+ for (var i = 0; i < this.map.length; i++) {
+ var curPos = this.map[i];
+ if (curPos != pos) { continue }
+ var left = i % this.width, top = (i / this.width) | 0;
+ var right = left + 1, bottom = top + 1;
+ for (var j = 1; right < this.width && this.map[i + j] == curPos; j++) { right++; }
+ for (var j$1 = 1; bottom < this.height && this.map[i + (this.width * j$1)] == curPos; j$1++) { bottom++; }
+ return new Rect(left, top, right, bottom)
+ }
+ throw new RangeError("No cell with offset " + pos + " found")
+};
+
+// :: (number) → number
+// Find the left side of the cell at the given position.
+TableMap.prototype.colCount = function colCount (pos) {
+ for (var i = 0; i < this.map.length; i++)
+ { if (this.map[i] == pos) { return i % this.width } }
+ throw new RangeError("No cell with offset " + pos + " found")
+};
+
+// :: (number, string, number) → ?number
+// Find the next cell in the given direction, starting from the cell
+// at `pos`, if any.
+TableMap.prototype.nextCell = function nextCell (pos, axis, dir) {
+ var ref = this.findCell(pos);
+ var left = ref.left;
+ var right = ref.right;
+ var top = ref.top;
+ var bottom = ref.bottom;
+ if (axis == "horiz") {
+ if (dir < 0 ? left == 0 : right == this.width) { return null }
+ return this.map[top * this.width + (dir < 0 ? left - 1 : right)]
+ } else {
+ if (dir < 0 ? top == 0 : bottom == this.height) { return null }
+ return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)]
+ }
+};
+
+// :: (number, number) → Rect
+// Get the rectangle spanning the two given cells.
+TableMap.prototype.rectBetween = function rectBetween (a, b) {
+ var ref = this.findCell(a);
+ var leftA = ref.left;
+ var rightA = ref.right;
+ var topA = ref.top;
+ var bottomA = ref.bottom;
+ var ref$1 = this.findCell(b);
+ var leftB = ref$1.left;
+ var rightB = ref$1.right;
+ var topB = ref$1.top;
+ var bottomB = ref$1.bottom;
+ return new Rect(Math.min(leftA, leftB), Math.min(topA, topB),
+ Math.max(rightA, rightB), Math.max(bottomA, bottomB))
+};
+
+// :: (Rect) → [number]
+// Return the position of all cells that have the top left corner in
+// the given rectangle.
+TableMap.prototype.cellsInRect = function cellsInRect (rect) {
+ var result = [], seen = {};
+ for (var row = rect.top; row < rect.bottom; row++) {
+ for (var col = rect.left; col < rect.right; col++) {
+ var index = row * this.width + col, pos = this.map[index];
+ if (seen[pos]) { continue }
+ seen[pos] = true;
+ if ((col != rect.left || !col || this.map[index - 1] != pos) &&
+ (row != rect.top || !row || this.map[index - this.width] != pos))
+ { result.push(pos); }
+ }
+ }
+ return result
+};
+
+// :: (number, number, Node) → number
+// Return the position at which the cell at the given row and column
+// starts, or would start, if a cell started there.
+TableMap.prototype.positionAt = function positionAt (row, col, table) {
+ for (var i = 0, rowStart = 0;; i++) {
+ var rowEnd = rowStart + table.child(i).nodeSize;
+ if (i == row) {
+ var index = col + row * this.width, rowEndIndex = (row + 1) * this.width;
+ // Skip past cells from previous rows (via rowspan)
+ while (index < rowEndIndex && this.map[index] < rowStart) { index++; }
+ return index == rowEndIndex ? rowEnd - 1 : this.map[index]
+ }
+ rowStart = rowEnd;
+ }
+};
+
+// :: (Node) → TableMap
+// Find the table map for the given table node.
+TableMap.get = function get (table) {
+ return readFromCache(table) || addToCache(table, computeMap(table))
+};
+
+// Compute a table map.
+function computeMap(table) {
+ if (table.type.spec.tableRole != "table") { throw new RangeError("Not a table node: " + table.type.name) }
+ var width = findWidth(table), height = table.childCount;
+ var map = [], mapPos = 0, problems = null, colWidths = [];
+ for (var i = 0, e = width * height; i < e; i++) { map[i] = 0; }
+
+ for (var row = 0, pos = 0; row < height; row++) {
+ var rowNode = table.child(row);
+ pos++;
+ for (var i$1 = 0;; i$1++) {
+ while (mapPos < map.length && map[mapPos] != 0) { mapPos++; }
+ if (i$1 == rowNode.childCount) { break }
+ var cellNode = rowNode.child(i$1);
+ var ref = cellNode.attrs;
+ var colspan = ref.colspan;
+ var rowspan = ref.rowspan;
+ var colwidth = ref.colwidth;
+ for (var h = 0; h < rowspan; h++) {
+ if (h + row >= height) {
+ (problems || (problems = [])).push({type: "overlong_rowspan", pos: pos, n: rowspan - h});
+ break
+ }
+ var start = mapPos + (h * width);
+ for (var w = 0; w < colspan; w++) {
+ if (map[start + w] == 0)
+ { map[start + w] = pos; }
+ else
+ { (problems || (problems = [])).push({type: "collision", row: row, pos: pos, n: colspan - w}); }
+ var colW = colwidth && colwidth[w];
+ if (colW) {
+ var widthIndex = ((start + w) % width) * 2, prev = colWidths[widthIndex];
+ if (prev == null || (prev != colW && colWidths[widthIndex + 1] == 1)) {
+ colWidths[widthIndex] = colW;
+ colWidths[widthIndex + 1] = 1;
+ } else if (prev == colW) {
+ colWidths[widthIndex + 1]++;
+ }
+ }
+ }
+ }
+ mapPos += colspan;
+ pos += cellNode.nodeSize;
+ }
+ var expectedPos = (row + 1) * width, missing = 0;
+ while (mapPos < expectedPos) { if (map[mapPos++] == 0) { missing++; } }
+ if (missing) { (problems || (problems = [])).push({type: "missing", row: row, n: missing}); }
+ pos++;
+ }
+
+ var tableMap = new TableMap(width, height, map, problems), badWidths = false;
+
+ // For columns that have defined widths, but whose widths disagree
+ // between rows, fix up the cells whose width doesn't match the
+ // computed one.
+ for (var i$2 = 0; !badWidths && i$2 < colWidths.length; i$2 += 2)
+ { if (colWidths[i$2] != null && colWidths[i$2 + 1] < height) { badWidths = true; } }
+ if (badWidths) { findBadColWidths(tableMap, colWidths, table); }
+
+ return tableMap
+}
+
+function findWidth(table) {
+ var width = -1, hasRowSpan = false;
+ for (var row = 0; row < table.childCount; row++) {
+ var rowNode = table.child(row), rowWidth = 0;
+ if (hasRowSpan) { for (var j = 0; j < row; j++) {
+ var prevRow = table.child(j);
+ for (var i = 0; i < prevRow.childCount; i++) {
+ var cell = prevRow.child(i);
+ if (j + cell.attrs.rowspan > row) { rowWidth += cell.attrs.colspan; }
+ }
+ } }
+ for (var i$1 = 0; i$1 < rowNode.childCount; i$1++) {
+ var cell$1 = rowNode.child(i$1);
+ rowWidth += cell$1.attrs.colspan;
+ if (cell$1.attrs.rowspan > 1) { hasRowSpan = true; }
+ }
+ if (width == -1)
+ { width = rowWidth; }
+ else if (width != rowWidth)
+ { width = Math.max(width, rowWidth); }
+ }
+ return width
+}
+
+function findBadColWidths(map, colWidths, table) {
+ if (!map.problems) { map.problems = []; }
+ for (var i = 0, seen = {}; i < map.map.length; i++) {
+ var pos = map.map[i];
+ if (seen[pos]) { continue }
+ seen[pos] = true;
+ var node = table.nodeAt(pos), updated = null;
+ for (var j = 0; j < node.attrs.colspan; j++) {
+ var col = (i + j) % map.width, colWidth = colWidths[col * 2];
+ if (colWidth != null && (!node.attrs.colwidth || node.attrs.colwidth[j] != colWidth))
+ { (updated || (updated = freshColWidth(node.attrs)))[j] = colWidth; }
+ }
+ if (updated) { map.problems.unshift({type: "colwidth mismatch", pos: pos, colwidth: updated}); }
+ }
+}
+
+function freshColWidth(attrs) {
+ if (attrs.colwidth) { return attrs.colwidth.slice() }
+ var result = [];
+ for (var i = 0; i < attrs.colspan; i++) { result.push(0); }
+ return result
+}
+
+// Various helper function for working with tables
+
+var key = new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["PluginKey"]("selectingCells");
+
+function cellAround($pos) {
+ for (var d = $pos.depth - 1; d > 0; d--)
+ { if ($pos.node(d).type.spec.tableRole == "row") { return $pos.node(0).resolve($pos.before(d + 1)) } }
+ return null
+}
+
+function cellWrapping($pos) {
+ for (var d = $pos.depth; d > 0; d--) { // Sometimes the cell can be in the same depth.
+ var role = $pos.node(d).type.spec.tableRole;
+ if (role === "cell" || role === 'header_cell') { return $pos.node(d) }
+ }
+ return null
+}
+
+function isInTable(state) {
+ var $head = state.selection.$head;
+ for (var d = $head.depth; d > 0; d--) { if ($head.node(d).type.spec.tableRole == "row") { return true } }
+ return false
+}
+
+function selectionCell(state) {
+ var sel = state.selection;
+ if (sel.$anchorCell) {
+ return sel.$anchorCell.pos > sel.$headCell.pos ? sel.$anchorCell : sel.$headCell;
+ } else if (sel.node && sel.node.type.spec.tableRole == "cell") {
+ return sel.$anchor
+ }
+ return cellAround(sel.$head) || cellNear(sel.$head)
+}
+
+function cellNear($pos) {
+ for (var after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {
+ var role = after.type.spec.tableRole;
+ if (role == "cell" || role == "header_cell") { return $pos.doc.resolve(pos) }
+ }
+ for (var before = $pos.nodeBefore, pos$1 = $pos.pos; before; before = before.lastChild, pos$1--) {
+ var role$1 = before.type.spec.tableRole;
+ if (role$1 == "cell" || role$1 == "header_cell") { return $pos.doc.resolve(pos$1 - before.nodeSize) }
+ }
+}
+
+function pointsAtCell($pos) {
+ return $pos.parent.type.spec.tableRole == "row" && $pos.nodeAfter
+}
+
+function moveCellForward($pos) {
+ return $pos.node(0).resolve($pos.pos + $pos.nodeAfter.nodeSize)
+}
+
+function inSameTable($a, $b) {
+ return $a.depth == $b.depth && $a.pos >= $b.start(-1) && $a.pos <= $b.end(-1)
+}
+
+function findCell($pos) {
+ return TableMap.get($pos.node(-1)).findCell($pos.pos - $pos.start(-1))
+}
+
+function colCount($pos) {
+ return TableMap.get($pos.node(-1)).colCount($pos.pos - $pos.start(-1))
+}
+
+function nextCell($pos, axis, dir) {
+ var start = $pos.start(-1), map = TableMap.get($pos.node(-1));
+ var moved = map.nextCell($pos.pos - start, axis, dir);
+ return moved == null ? null : $pos.node(0).resolve(start + moved)
+}
+
+function setAttr(attrs, name, value) {
+ var result = {};
+ for (var prop in attrs) { result[prop] = attrs[prop]; }
+ result[name] = value;
+ return result
+}
+
+function rmColSpan(attrs, pos, n) {
+ if ( n === void 0 ) n=1;
+
+ var result = setAttr(attrs, "colspan", attrs.colspan - n);
+ if (result.colwidth) {
+ result.colwidth = result.colwidth.slice();
+ result.colwidth.splice(pos, n);
+ if (!result.colwidth.some(function (w) { return w > 0; })) { result.colwidth = null; }
+ }
+ return result
+}
+
+function addColSpan(attrs, pos, n) {
+ if ( n === void 0 ) n=1;
+
+ var result = setAttr(attrs, "colspan", attrs.colspan + n);
+ if (result.colwidth) {
+ result.colwidth = result.colwidth.slice();
+ for (var i = 0; i < n; i++) { result.colwidth.splice(pos, 0, 0); }
+ }
+ return result
+}
+
+// This file defines a ProseMirror selection subclass that models
+
+// ::- A [`Selection`](http://prosemirror.net/docs/ref/#state.Selection)
+// subclass that represents a cell selection spanning part of a table.
+// With the plugin enabled, these will be created when the user
+// selects across cells, and will be drawn by giving selected cells a
+// `selectedCell` CSS class.
+var CellSelection = /*@__PURE__*/(function (Selection) {
+ function CellSelection($anchorCell, $headCell) {
+ if ( $headCell === void 0 ) $headCell = $anchorCell;
+
+ var table = $anchorCell.node(-1), map = TableMap.get(table), start = $anchorCell.start(-1);
+ var rect = map.rectBetween($anchorCell.pos - start, $headCell.pos - start);
+ var doc = $anchorCell.node(0);
+ var cells = map.cellsInRect(rect).filter(function (p) { return p != $headCell.pos - start; });
+ // Make the head cell the first range, so that it counts as the
+ // primary part of the selection
+ cells.unshift($headCell.pos - start);
+ var ranges = cells.map(function (pos) {
+ var cell = table.nodeAt(pos), from = pos + start + 1;
+ return new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["SelectionRange"](doc.resolve(from), doc.resolve(from + cell.content.size))
+ });
+ Selection.call(this, ranges[0].$from, ranges[0].$to, ranges);
+ // :: ResolvedPos
+ // A resolved position pointing _in front of_ the anchor cell (the one
+ // that doesn't move when extending the selection).
+ this.$anchorCell = $anchorCell;
+ // :: ResolvedPos
+ // A resolved position pointing in front of the head cell (the one
+ // moves when extending the selection).
+ this.$headCell = $headCell;
+ }
+
+ if ( Selection ) CellSelection.__proto__ = Selection;
+ CellSelection.prototype = Object.create( Selection && Selection.prototype );
+ CellSelection.prototype.constructor = CellSelection;
+
+ CellSelection.prototype.map = function map (doc, mapping) {
+ var $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));
+ var $headCell = doc.resolve(mapping.map(this.$headCell.pos));
+ if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {
+ var tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1);
+ if (tableChanged && this.isRowSelection())
+ { return CellSelection.rowSelection($anchorCell, $headCell) }
+ else if (tableChanged && this.isColSelection())
+ { return CellSelection.colSelection($anchorCell, $headCell) }
+ else
+ { return new CellSelection($anchorCell, $headCell) }
+ }
+ return prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"].between($anchorCell, $headCell)
+ };
+
+ // :: () → Slice
+ // Returns a rectangular slice of table rows containing the selected
+ // cells.
+ CellSelection.prototype.content = function content () {
+ var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);
+ var rect = map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start);
+ var seen = {}, rows = [];
+ for (var row = rect.top; row < rect.bottom; row++) {
+ var rowContent = [];
+ for (var index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {
+ var pos = map.map[index];
+ if (!seen[pos]) {
+ seen[pos] = true;
+ var cellRect = map.findCell(pos), cell = table.nodeAt(pos);
+ var extraLeft = rect.left - cellRect.left, extraRight = cellRect.right - rect.right;
+ if (extraLeft > 0 || extraRight > 0) {
+ var attrs = cell.attrs;
+ if (extraLeft > 0) { attrs = rmColSpan(attrs, 0, extraLeft); }
+ if (extraRight > 0) { attrs = rmColSpan(attrs, attrs.colspan - extraRight, extraRight); }
+ if (cellRect.left < rect.left) { cell = cell.type.createAndFill(attrs); }
+ else { cell = cell.type.create(attrs, cell.content); }
+ }
+ if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {
+ var attrs$1 = setAttr(cell.attrs, "rowspan", Math.min(cellRect.bottom, rect.bottom) - Math.max(cellRect.top, rect.top));
+ if (cellRect.top < rect.top) { cell = cell.type.createAndFill(attrs$1); }
+ else { cell = cell.type.create(attrs$1, cell.content); }
+ }
+ rowContent.push(cell);
+ }
+ }
+ rows.push(table.child(row).copy(prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(rowContent)));
+ }
+
+ var fragment = this.isColSelection() && this.isRowSelection() ? table : rows;
+ return new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(fragment), 1, 1)
+ };
+
+ CellSelection.prototype.replace = function replace (tr, content) {
+ if ( content === void 0 ) content = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"].empty;
+
+ var mapFrom = tr.steps.length, ranges = this.ranges;
+ for (var i = 0; i < ranges.length; i++) {
+ var ref = ranges[i];
+ var $from = ref.$from;
+ var $to = ref.$to;
+ var mapping = tr.mapping.slice(mapFrom);
+ tr.replace(mapping.map($from.pos), mapping.map($to.pos), i ? prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"].empty : content);
+ }
+ var sel = Selection.findFrom(tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)), -1);
+ if (sel) { tr.setSelection(sel); }
+ };
+
+ CellSelection.prototype.replaceWith = function replaceWith (tr, node) {
+ this.replace(tr, new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(node), 0, 0));
+ };
+
+ CellSelection.prototype.forEachCell = function forEachCell (f) {
+ var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);
+ var cells = map.cellsInRect(map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start));
+ for (var i = 0; i < cells.length; i++)
+ { f(table.nodeAt(cells[i]), start + cells[i]); }
+ };
+
+ // :: () → bool
+ // True if this selection goes all the way from the top to the
+ // bottom of the table.
+ CellSelection.prototype.isColSelection = function isColSelection () {
+ var anchorTop = this.$anchorCell.index(-1), headTop = this.$headCell.index(-1);
+ if (Math.min(anchorTop, headTop) > 0) { return false }
+ var anchorBot = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan,
+ headBot = headTop + this.$headCell.nodeAfter.attrs.rowspan;
+ return Math.max(anchorBot, headBot) == this.$headCell.node(-1).childCount
+ };
+
+ // :: (ResolvedPos, ?ResolvedPos) → CellSelection
+ // Returns the smallest column selection that covers the given anchor
+ // and head cell.
+ CellSelection.colSelection = function colSelection ($anchorCell, $headCell) {
+ if ( $headCell === void 0 ) $headCell = $anchorCell;
+
+ var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);
+ var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);
+ var doc = $anchorCell.node(0);
+ if (anchorRect.top <= headRect.top) {
+ if (anchorRect.top > 0)
+ { $anchorCell = doc.resolve(start + map.map[anchorRect.left]); }
+ if (headRect.bottom < map.height)
+ { $headCell = doc.resolve(start + map.map[map.width * (map.height - 1) + headRect.right - 1]); }
+ } else {
+ if (headRect.top > 0)
+ { $headCell = doc.resolve(start + map.map[headRect.left]); }
+ if (anchorRect.bottom < map.height)
+ { $anchorCell = doc.resolve(start + map.map[map.width * (map.height - 1) + anchorRect.right - 1]); }
+ }
+ return new CellSelection($anchorCell, $headCell)
+ };
+
+ // :: () → bool
+ // True if this selection goes all the way from the left to the
+ // right of the table.
+ CellSelection.prototype.isRowSelection = function isRowSelection () {
+ var map = TableMap.get(this.$anchorCell.node(-1)), start = this.$anchorCell.start(-1);
+ var anchorLeft = map.colCount(this.$anchorCell.pos - start),
+ headLeft = map.colCount(this.$headCell.pos - start);
+ if (Math.min(anchorLeft, headLeft) > 0) { return false }
+ var anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan,
+ headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan;
+ return Math.max(anchorRight, headRight) == map.width
+ };
+
+ CellSelection.prototype.eq = function eq (other) {
+ return other instanceof CellSelection && other.$anchorCell.pos == this.$anchorCell.pos &&
+ other.$headCell.pos == this.$headCell.pos
+ };
+
+ // :: (ResolvedPos, ?ResolvedPos) → CellSelection
+ // Returns the smallest row selection that covers the given anchor
+ // and head cell.
+ CellSelection.rowSelection = function rowSelection ($anchorCell, $headCell) {
+ if ( $headCell === void 0 ) $headCell = $anchorCell;
+
+ var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);
+ var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);
+ var doc = $anchorCell.node(0);
+ if (anchorRect.left <= headRect.left) {
+ if (anchorRect.left > 0)
+ { $anchorCell = doc.resolve(start + map.map[anchorRect.top * map.width]); }
+ if (headRect.right < map.width)
+ { $headCell = doc.resolve(start + map.map[map.width * (headRect.top + 1) - 1]); }
+ } else {
+ if (headRect.left > 0)
+ { $headCell = doc.resolve(start + map.map[headRect.top * map.width]); }
+ if (anchorRect.right < map.width)
+ { $anchorCell = doc.resolve(start + map.map[map.width * (anchorRect.top + 1) - 1]); }
+ }
+ return new CellSelection($anchorCell, $headCell)
+ };
+
+ CellSelection.prototype.toJSON = function toJSON () {
+ return {type: "cell", anchor: this.$anchorCell.pos, head: this.$headCell.pos}
+ };
+
+ CellSelection.fromJSON = function fromJSON (doc, json) {
+ return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head))
+ };
+
+ // :: (Node, number, ?number) → CellSelection
+ CellSelection.create = function create (doc, anchorCell, headCell) {
+ if ( headCell === void 0 ) headCell = anchorCell;
+
+ return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell))
+ };
+
+ CellSelection.prototype.getBookmark = function getBookmark () { return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos) };
+
+ return CellSelection;
+}(prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Selection"]));
+
+CellSelection.prototype.visible = false;
+
+prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Selection"].jsonID("cell", CellSelection);
+
+var CellBookmark = function CellBookmark(anchor, head) {
+ this.anchor = anchor;
+ this.head = head;
+};
+CellBookmark.prototype.map = function map (mapping) {
+ return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head))
+};
+CellBookmark.prototype.resolve = function resolve (doc) {
+ var $anchorCell = doc.resolve(this.anchor), $headCell = doc.resolve(this.head);
+ if ($anchorCell.parent.type.spec.tableRole == "row" &&
+ $headCell.parent.type.spec.tableRole == "row" &&
+ $anchorCell.index() < $anchorCell.parent.childCount &&
+ $headCell.index() < $headCell.parent.childCount &&
+ inSameTable($anchorCell, $headCell))
+ { return new CellSelection($anchorCell, $headCell) }
+ else
+ { return prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Selection"].near($headCell, 1) }
+};
+
+function drawCellSelection(state) {
+ if (!(state.selection instanceof CellSelection)) { return null }
+ var cells = [];
+ state.selection.forEachCell(function (node, pos) {
+ cells.push(prosemirror_view__WEBPACK_IMPORTED_MODULE_3__["Decoration"].node(pos, pos + node.nodeSize, {class: "selectedCell"}));
+ });
+ return prosemirror_view__WEBPACK_IMPORTED_MODULE_3__["DecorationSet"].create(state.doc, cells)
+}
+
+function isCellBoundarySelection(ref) {
+ var $from = ref.$from;
+ var $to = ref.$to;
+
+ if ($from.pos == $to.pos || $from.pos < $from.pos - 6) { return false } // Cheap elimination
+ var afterFrom = $from.pos, beforeTo = $to.pos, depth = $from.depth;
+ for (; depth >= 0; depth--, afterFrom++)
+ { if ($from.after(depth + 1) < $from.end(depth)) { break } }
+ for (var d = $to.depth; d >= 0; d--, beforeTo--)
+ { if ($to.before(d + 1) > $to.start(d)) { break } }
+ return afterFrom == beforeTo && /row|table/.test($from.node(depth).type.spec.tableRole)
+}
+
+function isTextSelectionAcrossCells(ref) {
+ var $from = ref.$from;
+ var $to = ref.$to;
+
+ var fromCellBoundaryNode;
+ var toCellBoundaryNode;
+
+ for (var i = $from.depth; i > 0; i--) {
+ var node = $from.node(i);
+ if (node.type.spec.tableRole === 'cell' || node.type.spec.tableRole === 'header_cell') {
+ fromCellBoundaryNode = node;
+ break;
+ }
+ }
+
+ for (var i$1 = $to.depth; i$1 > 0; i$1--) {
+ var node$1 = $to.node(i$1);
+ if (node$1.type.spec.tableRole === 'cell' || node$1.type.spec.tableRole === 'header_cell') {
+ toCellBoundaryNode = node$1;
+ break;
+ }
+ }
+
+ return fromCellBoundaryNode !== toCellBoundaryNode && $to.parentOffset === 0
+}
+
+function normalizeSelection(state, tr, allowTableNodeSelection) {
+ var sel = (tr || state).selection, doc = (tr || state).doc, normalize, role;
+ if (sel instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["NodeSelection"] && (role = sel.node.type.spec.tableRole)) {
+ if (role == "cell" || role == "header_cell") {
+ normalize = CellSelection.create(doc, sel.from);
+ } else if (role == "row") {
+ var $cell = doc.resolve(sel.from + 1);
+ normalize = CellSelection.rowSelection($cell, $cell);
+ } else if (!allowTableNodeSelection) {
+ var map = TableMap.get(sel.node), start = sel.from + 1;
+ var lastCell = start + map.map[map.width * map.height - 1];
+ normalize = CellSelection.create(doc, start + 1, lastCell);
+ }
+ } else if (sel instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"] && isCellBoundarySelection(sel)) {
+ normalize = prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"].create(doc, sel.from);
+ } else if (sel instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"] && isTextSelectionAcrossCells(sel)) {
+ normalize = prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"].create(doc, sel.$from.start(), sel.$from.end());
+ }
+ if (normalize)
+ { (tr || (tr = state.tr)).setSelection(normalize); }
+ return tr
+}
+
+// Helper for creating a schema that supports tables.
+
+function getCellAttrs(dom, extraAttrs) {
+ var widthAttr = dom.getAttribute("data-colwidth");
+ var widths = widthAttr && /^\d+(,\d+)*$/.test(widthAttr) ? widthAttr.split(",").map(function (s) { return Number(s); }) : null;
+ var colspan = Number(dom.getAttribute("colspan") || 1);
+ var result = {
+ colspan: colspan,
+ rowspan: Number(dom.getAttribute("rowspan") || 1),
+ colwidth: widths && widths.length == colspan ? widths : null
+ };
+ for (var prop in extraAttrs) {
+ var getter = extraAttrs[prop].getFromDOM;
+ var value = getter && getter(dom);
+ if (value != null) { result[prop] = value; }
+ }
+ return result
+}
+
+function setCellAttrs(node, extraAttrs) {
+ var attrs = {};
+ if (node.attrs.colspan != 1) { attrs.colspan = node.attrs.colspan; }
+ if (node.attrs.rowspan != 1) { attrs.rowspan = node.attrs.rowspan; }
+ if (node.attrs.colwidth)
+ { attrs["data-colwidth"] = node.attrs.colwidth.join(","); }
+ for (var prop in extraAttrs) {
+ var setter = extraAttrs[prop].setDOMAttr;
+ if (setter) { setter(node.attrs[prop], attrs); }
+ }
+ return attrs
+}
+
+// :: (Object) → Object
+//
+// This function creates a set of [node
+// specs](http://prosemirror.net/docs/ref/#model.SchemaSpec.nodes) for
+// `table`, `table_row`, and `table_cell` nodes types as used by this
+// module. The result can then be added to the set of nodes when
+// creating a a schema.
+//
+// options::- The following options are understood:
+//
+// tableGroup:: ?string
+// A group name (something like `"block"`) to add to the table
+// node type.
+//
+// cellContent:: string
+// The content expression for table cells.
+//
+// cellAttributes:: ?Object
+// Additional attributes to add to cells. Maps attribute names to
+// objects with the following properties:
+//
+// default:: any
+// The attribute's default value.
+//
+// getFromDOM:: ?(dom.Node) → any
+// A function to read the attribute's value from a DOM node.
+//
+// setDOMAttr:: ?(value: any, attrs: Object)
+// A function to add the attribute's value to an attribute
+// object that's used to render the cell's DOM.
+function tableNodes(options) {
+ var extraAttrs = options.cellAttributes || {};
+ var cellAttrs = {
+ colspan: {default: 1},
+ rowspan: {default: 1},
+ colwidth: {default: null}
+ };
+ for (var prop in extraAttrs)
+ { cellAttrs[prop] = {default: extraAttrs[prop].default}; }
+
+ return {
+ table: {
+ content: "table_row+",
+ tableRole: "table",
+ isolating: true,
+ group: options.tableGroup,
+ parseDOM: [{tag: "table"}],
+ toDOM: function toDOM() { return ["table", ["tbody", 0]] }
+ },
+ table_row: {
+ content: "(table_cell | table_header)*",
+ tableRole: "row",
+ parseDOM: [{tag: "tr"}],
+ toDOM: function toDOM() { return ["tr", 0] }
+ },
+ table_cell: {
+ content: options.cellContent,
+ attrs: cellAttrs,
+ tableRole: "cell",
+ isolating: true,
+ parseDOM: [{tag: "td", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],
+ toDOM: function toDOM(node) { return ["td", setCellAttrs(node, extraAttrs), 0] }
+ },
+ table_header: {
+ content: options.cellContent,
+ attrs: cellAttrs,
+ tableRole: "header_cell",
+ isolating: true,
+ parseDOM: [{tag: "th", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],
+ toDOM: function toDOM(node) { return ["th", setCellAttrs(node, extraAttrs), 0] }
+ }
+ }
+}
+
+function tableNodeTypes(schema) {
+ var result = schema.cached.tableNodeTypes;
+ if (!result) {
+ result = schema.cached.tableNodeTypes = {};
+ for (var name in schema.nodes) {
+ var type = schema.nodes[name], role = type.spec.tableRole;
+ if (role) { result[role] = type; }
+ }
+ }
+ return result
+}
+
+// Utilities used for copy/paste handling.
+
+// Utilities to help with copying and pasting table cells
+
+// : (Slice) → ?{width: number, height: number, rows: [Fragment]}
+// Get a rectangular area of cells from a slice, or null if the outer
+// nodes of the slice aren't table cells or rows.
+function pastedCells(slice) {
+ if (!slice.size) { return null }
+ var content = slice.content;
+ var openStart = slice.openStart;
+ var openEnd = slice.openEnd;
+ while (content.childCount == 1 && (openStart > 0 && openEnd > 0 || content.firstChild.type.spec.tableRole == "table")) {
+ openStart--;
+ openEnd--;
+ content = content.firstChild.content;
+ }
+ var first = content.firstChild, role = first.type.spec.tableRole;
+ var schema = first.type.schema, rows = [];
+ if (role == "row") {
+ for (var i = 0; i < content.childCount; i++) {
+ var cells = content.child(i).content;
+ var left = i ? 0 : Math.max(0, openStart - 1);
+ var right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);
+ if (left || right) { cells = fitSlice(tableNodeTypes(schema).row, new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](cells, left, right)).content; }
+ rows.push(cells);
+ }
+ } else if (role == "cell" || role == "header_cell") {
+ rows.push(openStart || openEnd ? fitSlice(tableNodeTypes(schema).row, new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](content, openStart, openEnd)).content : content);
+ } else {
+ return null
+ }
+ return ensureRectangular(schema, rows)
+}
+
+// : (Schema, [Fragment]) → {width: number, height: number, rows: [Fragment]}
+// Compute the width and height of a set of cells, and make sure each
+// row has the same number of cells.
+function ensureRectangular(schema, rows) {
+ var widths = [];
+ for (var i = 0; i < rows.length; i++) {
+ var row = rows[i];
+ for (var j = row.childCount - 1; j >= 0; j--) {
+ var ref = row.child(j).attrs;
+ var rowspan = ref.rowspan;
+ var colspan = ref.colspan;
+ for (var r = i; r < i + rowspan; r++)
+ { widths[r] = (widths[r] || 0) + colspan; }
+ }
+ }
+ var width = 0;
+ for (var r$1 = 0; r$1 < widths.length; r$1++) { width = Math.max(width, widths[r$1]); }
+ for (var r$2 = 0; r$2 < widths.length; r$2++) {
+ if (r$2 >= rows.length) { rows.push(prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty); }
+ if (widths[r$2] < width) {
+ var empty = tableNodeTypes(schema).cell.createAndFill(), cells = [];
+ for (var i$1 = widths[r$2]; i$1 < width; i$1++) { cells.push(empty); }
+ rows[r$2] = rows[r$2].append(prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(cells));
+ }
+ }
+ return {height: rows.length, width: width, rows: rows}
+}
+
+function fitSlice(nodeType, slice) {
+ var node = nodeType.createAndFill();
+ var tr = new prosemirror_transform__WEBPACK_IMPORTED_MODULE_4__["Transform"](node).replace(0, node.content.size, slice);
+ return tr.doc
+}
+
+// : ({width: number, height: number, rows: [Fragment]}, number, number) → {width: number, height: number, rows: [Fragment]}
+// Clip or extend (repeat) the given set of cells to cover the given
+// width and height. Will clip rowspan/colspan cells at the edges when
+// they stick out.
+function clipCells(ref, newWidth, newHeight) {
+ var width = ref.width;
+ var height = ref.height;
+ var rows = ref.rows;
+
+ if (width != newWidth) {
+ var added = [], newRows = [];
+ for (var row = 0; row < rows.length; row++) {
+ var frag = rows[row], cells = [];
+ for (var col = added[row] || 0, i = 0; col < newWidth; i++) {
+ var cell = frag.child(i % frag.childCount);
+ if (col + cell.attrs.colspan > newWidth)
+ { cell = cell.type.create(rmColSpan(cell.attrs, cell.attrs.colspan, col + cell.attrs.colspan - newWidth), cell.content); }
+ cells.push(cell);
+ col += cell.attrs.colspan;
+ for (var j = 1; j < cell.attrs.rowspan; j++)
+ { added[row + j] = (added[row + j] || 0) + cell.attrs.colspan; }
+ }
+ newRows.push(prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(cells));
+ }
+ rows = newRows;
+ width = newWidth;
+ }
+
+ if (height != newHeight) {
+ var newRows$1 = [];
+ for (var row$1 = 0, i$1 = 0; row$1 < newHeight; row$1++, i$1++) {
+ var cells$1 = [], source = rows[i$1 % height];
+ for (var j$1 = 0; j$1 < source.childCount; j$1++) {
+ var cell$1 = source.child(j$1);
+ if (row$1 + cell$1.attrs.rowspan > newHeight)
+ { cell$1 = cell$1.type.create(setAttr(cell$1.attrs, "rowspan", newHeight - cell$1.attrs.rowspan), cell$1.content); }
+ cells$1.push(cell$1);
+ }
+ newRows$1.push(prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(cells$1));
+ }
+ rows = newRows$1;
+ height = newHeight;
+ }
+
+ return {width: width, height: height, rows: rows}
+}
+
+// Make sure a table has at least the given width and height. Return
+// true if something was changed.
+function growTable(tr, map, table, start, width, height, mapFrom) {
+ var schema = tr.doc.type.schema, types = tableNodeTypes(schema), empty, emptyHead;
+ if (width > map.width) {
+ for (var row = 0, rowEnd = 0; row < map.height; row++) {
+ var rowNode = table.child(row);
+ rowEnd += rowNode.nodeSize;
+ var cells = [], add = (void 0);
+ if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell)
+ { add = empty || (empty = types.cell.createAndFill()); }
+ else
+ { add = emptyHead || (emptyHead = types.header_cell.createAndFill()); }
+ for (var i = map.width; i < width; i++) { cells.push(add); }
+ tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells);
+ }
+ }
+ if (height > map.height) {
+ var cells$1 = [];
+ for (var i$1 = 0, start$1 = (map.height - 1) * map.width; i$1 < Math.max(map.width, width); i$1++) {
+ var header = i$1 >= map.width ? false :
+ table.nodeAt(map.map[start$1 + i$1]).type == types.header_cell;
+ cells$1.push(header
+ ? (emptyHead || (emptyHead = types.header_cell.createAndFill()))
+ : (empty || (empty = types.cell.createAndFill())));
+ }
+
+ var emptyRow = types.row.create(null, prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(cells$1)), rows = [];
+ for (var i$2 = map.height; i$2 < height; i$2++) { rows.push(emptyRow); }
+ tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows);
+ }
+ return !!(empty || emptyHead)
+}
+
+// Make sure the given line (left, top) to (right, top) doesn't cross
+// any rowspan cells by splitting cells that cross it. Return true if
+// something changed.
+function isolateHorizontal(tr, map, table, start, left, right, top, mapFrom) {
+ if (top == 0 || top == map.height) { return false }
+ var found = false;
+ for (var col = left; col < right; col++) {
+ var index = top * map.width + col, pos = map.map[index];
+ if (map.map[index - map.width] == pos) {
+ found = true;
+ var cell = table.nodeAt(pos);
+ var ref = map.findCell(pos);
+ var cellTop = ref.top;
+ var cellLeft = ref.left;
+ tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + start), null, setAttr(cell.attrs, "rowspan", top - cellTop));
+ tr.insert(tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)),
+ cell.type.createAndFill(setAttr(cell.attrs, "rowspan", (cellTop + cell.attrs.rowspan) - top)));
+ col += cell.attrs.colspan - 1;
+ }
+ }
+ return found
+}
+
+// Make sure the given line (left, top) to (left, bottom) doesn't
+// cross any colspan cells by splitting cells that cross it. Return
+// true if something changed.
+function isolateVertical(tr, map, table, start, top, bottom, left, mapFrom) {
+ if (left == 0 || left == map.width) { return false }
+ var found = false;
+ for (var row = top; row < bottom; row++) {
+ var index = row * map.width + left, pos = map.map[index];
+ if (map.map[index - 1] == pos) {
+ found = true;
+ var cell = table.nodeAt(pos), cellLeft = map.colCount(pos);
+ var updatePos = tr.mapping.slice(mapFrom).map(pos + start);
+ tr.setNodeMarkup(updatePos, null, rmColSpan(cell.attrs, left - cellLeft, cell.attrs.colspan - (left - cellLeft)));
+ tr.insert(updatePos + cell.nodeSize, cell.type.createAndFill(rmColSpan(cell.attrs, 0, left - cellLeft)));
+ row += cell.attrs.rowspan - 1;
+ }
+ }
+ return found
+}
+
+// Insert the given set of cells (as returned by `pastedCells`) into a
+// table, at the position pointed at by rect.
+function insertCells(state, dispatch, tableStart, rect, cells) {
+ var table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc, map = TableMap.get(table);
+ var top = rect.top;
+ var left = rect.left;
+ var right = left + cells.width, bottom = top + cells.height;
+ var tr = state.tr, mapFrom = 0;
+ function recomp() {
+ table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc;
+ map = TableMap.get(table);
+ mapFrom = tr.mapping.maps.length;
+ }
+ // Prepare the table to be large enough and not have any cells
+ // crossing the boundaries of the rectangle that we want to
+ // insert into. If anything about it changes, recompute the table
+ // map so that subsequent operations can see the current shape.
+ if (growTable(tr, map, table, tableStart, right, bottom, mapFrom)) { recomp(); }
+ if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom)) { recomp(); }
+ if (isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom)) { recomp(); }
+ if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom)) { recomp(); }
+ if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom)) { recomp(); }
+
+ for (var row = top; row < bottom; row++) {
+ var from = map.positionAt(row, left, table), to = map.positionAt(row, right, table);
+ tr.replace(tr.mapping.slice(mapFrom).map(from + tableStart), tr.mapping.slice(mapFrom).map(to + tableStart),
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](cells.rows[row - top], 0, 0));
+ }
+ recomp();
+ tr.setSelection(new CellSelection(tr.doc.resolve(tableStart + map.positionAt(top, left, table)),
+ tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table))));
+ dispatch(tr);
+}
+
+// This file defines a number of helpers for wiring up user input to
+
+var handleKeyDown = Object(prosemirror_keymap__WEBPACK_IMPORTED_MODULE_2__["keydownHandler"])({
+ "ArrowLeft": arrow("horiz", -1),
+ "ArrowRight": arrow("horiz", 1),
+ "ArrowUp": arrow("vert", -1),
+ "ArrowDown": arrow("vert", 1),
+
+ "Shift-ArrowLeft": shiftArrow("horiz", -1),
+ "Shift-ArrowRight": shiftArrow("horiz", 1),
+ "Shift-ArrowUp": shiftArrow("vert", -1),
+ "Shift-ArrowDown": shiftArrow("vert", 1),
+
+ "Backspace": deleteCellSelection,
+ "Mod-Backspace": deleteCellSelection,
+ "Delete": deleteCellSelection,
+ "Mod-Delete": deleteCellSelection
+});
+
+function maybeSetSelection(state, dispatch, selection) {
+ if (selection.eq(state.selection)) { return false }
+ if (dispatch) { dispatch(state.tr.setSelection(selection).scrollIntoView()); }
+ return true
+}
+
+function arrow(axis, dir) {
+ return function (state, dispatch, view) {
+ var sel = state.selection;
+ if (sel instanceof CellSelection) {
+ return maybeSetSelection(state, dispatch, prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Selection"].near(sel.$headCell, dir))
+ }
+ if (axis != "horiz" && !sel.empty) { return false }
+ var end = atEndOfCell(view, axis, dir);
+ if (end == null) { return false }
+ if (axis == "horiz") {
+ return maybeSetSelection(state, dispatch, prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Selection"].near(state.doc.resolve(sel.head + dir), dir))
+ } else {
+ var $cell = state.doc.resolve(end), $next = nextCell($cell, axis, dir), newSel;
+ if ($next) { newSel = prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Selection"].near($next, 1); }
+ else if (dir < 0) { newSel = prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Selection"].near(state.doc.resolve($cell.before(-1)), -1); }
+ else { newSel = prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Selection"].near(state.doc.resolve($cell.after(-1)), 1); }
+ return maybeSetSelection(state, dispatch, newSel)
+ }
+ }
+}
+
+function shiftArrow(axis, dir) {
+ return function (state, dispatch, view) {
+ var sel = state.selection;
+ if (!(sel instanceof CellSelection)) {
+ var end = atEndOfCell(view, axis, dir);
+ if (end == null) { return false }
+ sel = new CellSelection(state.doc.resolve(end));
+ }
+ var $head = nextCell(sel.$headCell, axis, dir);
+ if (!$head) { return false }
+ return maybeSetSelection(state, dispatch, new CellSelection(sel.$anchorCell, $head))
+ }
+}
+
+function deleteCellSelection(state, dispatch) {
+ var sel = state.selection;
+ if (!(sel instanceof CellSelection)) { return false }
+ if (dispatch) {
+ var tr = state.tr, baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;
+ sel.forEachCell(function (cell, pos) {
+ if (!cell.content.eq(baseContent))
+ { tr.replace(tr.mapping.map(pos + 1), tr.mapping.map(pos + cell.nodeSize - 1),
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Slice"](baseContent, 0, 0)); }
+ });
+ if (tr.docChanged) { dispatch(tr); }
+ }
+ return true
+}
+
+function handleTripleClick(view, pos) {
+ var doc = view.state.doc, $cell = cellAround(doc.resolve(pos));
+ if (!$cell) { return false }
+ view.dispatch(view.state.tr.setSelection(new CellSelection($cell)));
+ return true
+}
+
+function handlePaste(view, _, slice) {
+ if (!isInTable(view.state)) { return false }
+ var cells = pastedCells(slice), sel = view.state.selection;
+ if (sel instanceof CellSelection) {
+ if (!cells) { cells = {width: 1, height: 1, rows: [prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].from(fitSlice(tableNodeTypes(view.state.schema).cell, slice))]}; }
+ var table = sel.$anchorCell.node(-1), start = sel.$anchorCell.start(-1);
+ var rect = TableMap.get(table).rectBetween(sel.$anchorCell.pos - start, sel.$headCell.pos - start);
+ cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top);
+ insertCells(view.state, view.dispatch, start, rect, cells);
+ return true
+ } else if (cells) {
+ var $cell = selectionCell(view.state), start$1 = $cell.start(-1);
+ insertCells(view.state, view.dispatch, start$1, TableMap.get($cell.node(-1)).findCell($cell.pos - start$1), cells);
+ return true
+ } else {
+ return false
+ }
+}
+
+function handleMouseDown(view, startEvent) {
+ if (startEvent.ctrlKey || startEvent.metaKey) { return }
+
+ var startDOMCell = domInCell(view, startEvent.target), $anchor;
+ if (startEvent.shiftKey && (view.state.selection instanceof CellSelection)) {
+ // Adding to an existing cell selection
+ setCellSelection(view.state.selection.$anchorCell, startEvent);
+ startEvent.preventDefault();
+ } else if (startEvent.shiftKey && startDOMCell &&
+ ($anchor = cellAround(view.state.selection.$anchor)) != null &&
+ cellUnderMouse(view, startEvent).pos != $anchor.pos) {
+ // Adding to a selection that starts in another cell (causing a
+ // cell selection to be created).
+ setCellSelection($anchor, startEvent);
+ startEvent.preventDefault();
+ } else if (!startDOMCell) {
+ // Not in a cell, let the default behavior happen.
+ return
+ }
+
+ // Create and dispatch a cell selection between the given anchor and
+ // the position under the mouse.
+ function setCellSelection($anchor, event) {
+ var $head = cellUnderMouse(view, event);
+ var starting = key.getState(view.state) == null;
+ if (!$head || !inSameTable($anchor, $head)) {
+ if (starting) { $head = $anchor; }
+ else { return }
+ }
+ var selection = new CellSelection($anchor, $head);
+ if (starting || !view.state.selection.eq(selection)) {
+ var tr = view.state.tr.setSelection(selection);
+ if (starting) { tr.setMeta(key, $anchor.pos); }
+ view.dispatch(tr);
+ }
+ }
+
+ // Stop listening to mouse motion events.
+ function stop() {
+ view.root.removeEventListener("mouseup", stop);
+ view.root.removeEventListener("dragstart", stop);
+ view.root.removeEventListener("mousemove", move);
+ if (key.getState(view.state) != null) { view.dispatch(view.state.tr.setMeta(key, -1)); }
+ }
+
+ function move(event) {
+ var anchor = key.getState(view.state), $anchor;
+ if (anchor != null) {
+ // Continuing an existing cross-cell selection
+ $anchor = view.state.doc.resolve(anchor);
+ } else if (domInCell(view, event.target) != startDOMCell) {
+ // Moving out of the initial cell -- start a new cell selection
+ $anchor = cellUnderMouse(view, startEvent);
+ if (!$anchor) { return stop() }
+ }
+ if ($anchor) { setCellSelection($anchor, event); }
+ }
+ view.root.addEventListener("mouseup", stop);
+ view.root.addEventListener("dragstart", stop);
+ view.root.addEventListener("mousemove", move);
+}
+
+// Check whether the cursor is at the end of a cell (so that further
+// motion would move out of the cell)
+function atEndOfCell(view, axis, dir) {
+ if (!(view.state.selection instanceof prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"])) { return null }
+ var ref = view.state.selection;
+ var $head = ref.$head;
+ for (var d = $head.depth - 1; d >= 0; d--) {
+ var parent = $head.node(d), index = dir < 0 ? $head.index(d) : $head.indexAfter(d);
+ if (index != (dir < 0 ? 0 : parent.childCount)) { return null }
+ if (parent.type.spec.tableRole == "cell" || parent.type.spec.tableRole == "header_cell") {
+ var cellPos = $head.before(d);
+ var dirStr = axis == "vert" ? (dir > 0 ? "down" : "up") : (dir > 0 ? "right" : "left");
+ return view.endOfTextblock(dirStr) ? cellPos : null
+ }
+ }
+ return null
+}
+
+function domInCell(view, dom) {
+ for (; dom && dom != view.dom; dom = dom.parentNode)
+ { if (dom.nodeName == "TD" || dom.nodeName == "TH") { return dom } }
+}
+
+function cellUnderMouse(view, event) {
+ var mousePos = view.posAtCoords({left: event.clientX, top: event.clientY});
+ if (!mousePos) { return null }
+ return mousePos ? cellAround(view.state.doc.resolve(mousePos.pos)) : null
+}
+
+// This file defines helpers for normalizing tables, making sure no
+
+var fixTablesKey = new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["PluginKey"]("fix-tables");
+
+// Helper for iterating through the nodes in a document that changed
+// compared to the given previous document. Useful for avoiding
+// duplicate work on each transaction.
+function changedDescendants(old, cur, offset, f) {
+ var oldSize = old.childCount, curSize = cur.childCount;
+ outer: for (var i = 0, j = 0; i < curSize; i++) {
+ var child = cur.child(i);
+ for (var scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) {
+ if (old.child(scan) == child) {
+ j = scan + 1;
+ offset += child.nodeSize;
+ continue outer
+ }
+ }
+ f(child, offset);
+ if (j < oldSize && old.child(j).sameMarkup(child))
+ { changedDescendants(old.child(j), child, offset + 1, f); }
+ else
+ { child.nodesBetween(0, child.content.size, f, offset + 1); }
+ offset += child.nodeSize;
+ }
+}
+
+// :: (EditorState, ?EditorState) → ?Transaction
+// Inspect all tables in the given state's document and return a
+// transaction that fixes them, if necessary. If `oldState` was
+// provided, that is assumed to hold a previous, known-good state,
+// which will be used to avoid re-scanning unchanged parts of the
+// document.
+function fixTables(state, oldState) {
+ var tr, check = function (node, pos) {
+ if (node.type.spec.tableRole == "table") { tr = fixTable(state, node, pos, tr); }
+ };
+ if (!oldState) { state.doc.descendants(check); }
+ else if (oldState.doc != state.doc) { changedDescendants(oldState.doc, state.doc, 0, check); }
+ return tr
+}
+
+// : (EditorState, Node, number, ?Transaction) → ?Transaction
+// Fix the given table, if necessary. Will append to the transaction
+// it was given, if non-null, or create a new one if necessary.
+function fixTable(state, table, tablePos, tr) {
+ var map = TableMap.get(table);
+ if (!map.problems) { return tr }
+ if (!tr) { tr = state.tr; }
+
+ // Track which rows we must add cells to, so that we can adjust that
+ // when fixing collisions.
+ var mustAdd = [];
+ for (var i = 0; i < map.height; i++) { mustAdd.push(0); }
+ for (var i$1 = 0; i$1 < map.problems.length; i$1++) {
+ var prob = map.problems[i$1];
+ if (prob.type == "collision") {
+ var cell = table.nodeAt(prob.pos);
+ for (var j = 0; j < cell.attrs.rowspan; j++) { mustAdd[prob.row + j] += prob.n; }
+ tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, rmColSpan(cell.attrs, cell.attrs.colspan - prob.n, prob.n));
+ } else if (prob.type == "missing") {
+ mustAdd[prob.row] += prob.n;
+ } else if (prob.type == "overlong_rowspan") {
+ var cell$1 = table.nodeAt(prob.pos);
+ tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$1.attrs, "rowspan", cell$1.attrs.rowspan - prob.n));
+ } else if (prob.type == "colwidth mismatch") {
+ var cell$2 = table.nodeAt(prob.pos);
+ tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$2.attrs, "colwidth", prob.colwidth));
+ }
+ }
+ var first, last;
+ for (var i$2 = 0; i$2 < mustAdd.length; i$2++) { if (mustAdd[i$2]) {
+ if (first == null) { first = i$2; }
+ last = i$2;
+ } }
+ // Add the necessary cells, using a heuristic for whether to add the
+ // cells at the start or end of the rows (if it looks like a 'bite'
+ // was taken out of the table, add cells at the start of the row
+ // after the bite. Otherwise add them at the end).
+ for (var i$3 = 0, pos = tablePos + 1; i$3 < map.height; i$3++) {
+ var row = table.child(i$3);
+ var end = pos + row.nodeSize;
+ var add = mustAdd[i$3];
+ if (add > 0) {
+ var tableNodeType = 'cell';
+ if (row.firstChild) {
+ tableNodeType = row.firstChild.type.spec.tableRole;
+ }
+ var nodes = [];
+ for (var j$1 = 0; j$1 < add; j$1++)
+ { nodes.push(tableNodeTypes(state.schema)[tableNodeType].createAndFill()); }
+ var side = (i$3 == 0 || first == i$3 - 1) && last == i$3 ? pos + 1 : end - 1;
+ tr.insert(tr.mapping.map(side), nodes);
+ }
+ pos = end;
+ }
+ return tr.setMeta(fixTablesKey, { fixTables: true })
+}
+
+// This file defines a number of table-related commands.
+
+// Helper to get the selected rectangle in a table, if any. Adds table
+// map, table node, and table start offset to the object for
+// convenience.
+function selectedRect(state) {
+ var sel = state.selection, $pos = selectionCell(state);
+ var table = $pos.node(-1), tableStart = $pos.start(-1), map = TableMap.get(table);
+ var rect;
+ if (sel instanceof CellSelection)
+ { rect = map.rectBetween(sel.$anchorCell.pos - tableStart, sel.$headCell.pos - tableStart); }
+ else
+ { rect = map.findCell($pos.pos - tableStart); }
+ rect.tableStart = tableStart;
+ rect.map = map;
+ rect.table = table;
+ return rect
+}
+
+function columnIsHeader(map, table, col) {
+ var headerCell = tableNodeTypes(table.type.schema).header_cell;
+ for (var row = 0; row < map.height; row++)
+ { if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)
+ { return false } }
+ return true
+}
+
+// Add a column at the given position in a table.
+function addColumn(tr, ref, col) {
+ var map = ref.map;
+ var tableStart = ref.tableStart;
+ var table = ref.table;
+
+ var refColumn = col > 0 ? -1 : 0;
+ if (columnIsHeader(map, table, col + refColumn))
+ { refColumn = col == 0 || col == map.width ? null : 0; }
+
+ for (var row = 0; row < map.height; row++) {
+ var index = row * map.width + col;
+ // If this position falls inside a col-spanning cell
+ if (col > 0 && col < map.width && map.map[index - 1] == map.map[index]) {
+ var pos = map.map[index], cell = table.nodeAt(pos);
+ tr.setNodeMarkup(tr.mapping.map(tableStart + pos), null,
+ addColSpan(cell.attrs, col - map.colCount(pos)));
+ // Skip ahead if rowspan > 1
+ row += cell.attrs.rowspan - 1;
+ } else {
+ var type = refColumn == null ? tableNodeTypes(table.type.schema).cell
+ : table.nodeAt(map.map[index + refColumn]).type;
+ var pos$1 = map.positionAt(row, col, table);
+ tr.insert(tr.mapping.map(tableStart + pos$1), type.createAndFill());
+ }
+ }
+ return tr
+}
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Command to add a column before the column with the selection.
+function addColumnBefore(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ if (dispatch) {
+ var rect = selectedRect(state);
+ dispatch(addColumn(state.tr, rect, rect.left));
+ }
+ return true
+}
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Command to add a column after the column with the selection.
+function addColumnAfter(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ if (dispatch) {
+ var rect = selectedRect(state);
+ dispatch(addColumn(state.tr, rect, rect.right));
+ }
+ return true
+}
+
+function removeColumn(tr, ref, col) {
+ var map = ref.map;
+ var table = ref.table;
+ var tableStart = ref.tableStart;
+
+ var mapStart = tr.mapping.maps.length;
+ for (var row = 0; row < map.height;) {
+ var index = row * map.width + col, pos = map.map[index], cell = table.nodeAt(pos);
+ // If this is part of a col-spanning cell
+ if ((col > 0 && map.map[index - 1] == pos) || (col < map.width - 1 && map.map[index + 1] == pos)) {
+ tr.setNodeMarkup(tr.mapping.slice(mapStart).map(tableStart + pos), null,
+ rmColSpan(cell.attrs, col - map.colCount(pos)));
+ } else {
+ var start = tr.mapping.slice(mapStart).map(tableStart + pos);
+ tr.delete(start, start + cell.nodeSize);
+ }
+ row += cell.attrs.rowspan;
+ }
+}
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Command function that removes the selected columns from a table.
+function deleteColumn(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ if (dispatch) {
+ var rect = selectedRect(state), tr = state.tr;
+ if (rect.left == 0 && rect.right == rect.map.width) { return false }
+ for (var i = rect.right - 1;; i--) {
+ removeColumn(tr, rect, i);
+ if (i == rect.left) { break }
+ rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;
+ rect.map = TableMap.get(rect.table);
+ }
+ dispatch(tr);
+ }
+ return true
+}
+
+function rowIsHeader(map, table, row) {
+ var headerCell = tableNodeTypes(table.type.schema).header_cell;
+ for (var col = 0; col < map.width; col++)
+ { if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)
+ { return false } }
+ return true
+}
+
+function addRow(tr, ref, row) {
+ var map = ref.map;
+ var tableStart = ref.tableStart;
+ var table = ref.table;
+
+ var rowPos = tableStart;
+ for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }
+ var cells = [], refRow = row > 0 ? -1 : 0;
+ if (rowIsHeader(map, table, row + refRow))
+ { refRow = row == 0 || row == map.height ? null : 0; }
+ for (var col = 0, index = map.width * row; col < map.width; col++, index++) {
+ // Covered by a rowspan cell
+ if (row > 0 && row < map.height && map.map[index] == map.map[index - map.width]) {
+ var pos = map.map[index], attrs = table.nodeAt(pos).attrs;
+ tr.setNodeMarkup(tableStart + pos, null, setAttr(attrs, "rowspan", attrs.rowspan + 1));
+ col += attrs.colspan - 1;
+ } else {
+ var type = refRow == null ? tableNodeTypes(table.type.schema).cell
+ : table.nodeAt(map.map[index + refRow * map.width]).type;
+ cells.push(type.createAndFill());
+ }
+ }
+ tr.insert(rowPos, tableNodeTypes(table.type.schema).row.create(null, cells));
+ return tr
+}
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Add a table row before the selection.
+function addRowBefore(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ if (dispatch) {
+ var rect = selectedRect(state);
+ dispatch(addRow(state.tr, rect, rect.top));
+ }
+ return true
+}
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Add a table row after the selection.
+function addRowAfter(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ if (dispatch) {
+ var rect = selectedRect(state);
+ dispatch(addRow(state.tr, rect, rect.bottom));
+ }
+ return true
+}
+
+function removeRow(tr, ref, row) {
+ var map = ref.map;
+ var table = ref.table;
+ var tableStart = ref.tableStart;
+
+ var rowPos = 0;
+ for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }
+ var nextRow = rowPos + table.child(row).nodeSize;
+
+ var mapFrom = tr.mapping.maps.length;
+ tr.delete(rowPos + tableStart, nextRow + tableStart);
+
+ for (var col = 0, index = row * map.width; col < map.width; col++, index++) {
+ var pos = map.map[index];
+ if (row > 0 && pos == map.map[index - map.width]) {
+ // If this cell starts in the row above, simply reduce its rowspan
+ var attrs = table.nodeAt(pos).attrs;
+ tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + tableStart), null, setAttr(attrs, "rowspan", attrs.rowspan - 1));
+ col += attrs.colspan - 1;
+ } else if (row < map.width && pos == map.map[index + map.width]) {
+ // Else, if it continues in the row below, it has to be moved down
+ var cell = table.nodeAt(pos);
+ var copy = cell.type.create(setAttr(cell.attrs, "rowspan", cell.attrs.rowspan - 1), cell.content);
+ var newPos = map.positionAt(row + 1, col, table);
+ tr.insert(tr.mapping.slice(mapFrom).map(tableStart + newPos), copy);
+ col += cell.attrs.colspan - 1;
+ }
+ }
+}
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Remove the selected rows from a table.
+function deleteRow(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ if (dispatch) {
+ var rect = selectedRect(state), tr = state.tr;
+ if (rect.top == 0 && rect.bottom == rect.map.height) { return false }
+ for (var i = rect.bottom - 1;; i--) {
+ removeRow(tr, rect, i);
+ if (i == rect.top) { break }
+ rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;
+ rect.map = TableMap.get(rect.table);
+ }
+ dispatch(tr);
+ }
+ return true
+}
+
+function isEmpty(cell) {
+ var c = cell.content;
+ return c.childCount == 1 && c.firstChild.isTextblock && c.firstChild.childCount == 0
+}
+
+function cellsOverlapRectangle(ref, rect) {
+ var width = ref.width;
+ var height = ref.height;
+ var map = ref.map;
+
+ var indexTop = rect.top * width + rect.left, indexLeft = indexTop;
+ var indexBottom = (rect.bottom - 1) * width + rect.left, indexRight = indexTop + (rect.right - rect.left - 1);
+ for (var i = rect.top; i < rect.bottom; i++) {
+ if (rect.left > 0 && map[indexLeft] == map[indexLeft - 1] ||
+ rect.right < width && map[indexRight] == map[indexRight + 1]) { return true }
+ indexLeft += width; indexRight += width;
+ }
+ for (var i$1 = rect.left; i$1 < rect.right; i$1++) {
+ if (rect.top > 0 && map[indexTop] == map[indexTop - width] ||
+ rect.bottom < height && map[indexBottom] == map[indexBottom + width]) { return true }
+ indexTop++; indexBottom++;
+ }
+ return false
+}
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Merge the selected cells into a single cell. Only available when
+// the selected cells' outline forms a rectangle.
+function mergeCells(state, dispatch) {
+ var sel = state.selection;
+ if (!(sel instanceof CellSelection) || sel.$anchorCell.pos == sel.$headCell.pos) { return false }
+ var rect = selectedRect(state);
+ var map = rect.map;
+ if (cellsOverlapRectangle(map, rect)) { return false }
+ if (dispatch) {
+ var tr = state.tr, seen = {}, content = prosemirror_model__WEBPACK_IMPORTED_MODULE_1__["Fragment"].empty, mergedPos, mergedCell;
+ for (var row = rect.top; row < rect.bottom; row++) {
+ for (var col = rect.left; col < rect.right; col++) {
+ var cellPos = map.map[row * map.width + col], cell = rect.table.nodeAt(cellPos);
+ if (seen[cellPos]) { continue }
+ seen[cellPos] = true;
+ if (mergedPos == null) {
+ mergedPos = cellPos;
+ mergedCell = cell;
+ } else {
+ if (!isEmpty(cell)) { content = content.append(cell.content); }
+ var mapped = tr.mapping.map(cellPos + rect.tableStart);
+ tr.delete(mapped, mapped + cell.nodeSize);
+ }
+ }
+ }
+ tr.setNodeMarkup(mergedPos + rect.tableStart, null,
+ setAttr(addColSpan(mergedCell.attrs, mergedCell.attrs.colspan, (rect.right - rect.left) - mergedCell.attrs.colspan),
+ "rowspan", rect.bottom - rect.top));
+ if (content.size) {
+ var end = mergedPos + 1 + mergedCell.content.size;
+ var start = isEmpty(mergedCell) ? mergedPos + 1 : end;
+ tr.replaceWith(start + rect.tableStart, end + rect.tableStart, content);
+ }
+ tr.setSelection(new CellSelection(tr.doc.resolve(mergedPos + rect.tableStart)));
+ dispatch(tr);
+ }
+ return true
+}
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Split a selected cell, whose rowpan or colspan is greater than one,
+// into smaller cells. Use the first cell type for the new cells.
+function splitCell(state, dispatch) {
+ var nodeTypes = tableNodeTypes(state.schema);
+ return splitCellWithType(function (ref) {
+ var node = ref.node;
+
+ return nodeTypes[node.type.spec.tableRole]
+ })(state, dispatch)
+}
+
+// :: (getCellType: ({ row: number, col: number, node: Node}) → NodeType) → (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Split a selected cell, whose rowpan or colspan is greater than one,
+// into smaller cells with the cell type (th, td) returned by getType function.
+function splitCellWithType(getCellType) {
+ return function (state, dispatch) {
+ var sel = state.selection;
+ var cellNode, cellPos;
+ if (!(sel instanceof CellSelection)) {
+ cellNode = cellWrapping(sel.$from);
+ if (!cellNode) { return false }
+ cellPos = cellAround(sel.$from).pos;
+ } else {
+ if (sel.$anchorCell.pos != sel.$headCell.pos) { return false }
+ cellNode = sel.$anchorCell.nodeAfter;
+ cellPos = sel.$anchorCell.pos;
+ }
+ if (cellNode.attrs.colspan == 1 && cellNode.attrs.rowspan == 1) {return false}
+ if (dispatch) {
+ var baseAttrs = cellNode.attrs, attrs = [], colwidth = baseAttrs.colwidth;
+ if (baseAttrs.rowspan > 1) { baseAttrs = setAttr(baseAttrs, "rowspan", 1); }
+ if (baseAttrs.colspan > 1) { baseAttrs = setAttr(baseAttrs, "colspan", 1); }
+ var rect = selectedRect(state), tr = state.tr;
+ for (var i = 0; i < rect.right - rect.left; i++)
+ { attrs.push(colwidth ? setAttr(baseAttrs, "colwidth", colwidth && colwidth[i] ? [colwidth[i]] : null) : baseAttrs); }
+ var lastCell;
+ for (var row = rect.top; row < rect.bottom; row++) {
+ var pos = rect.map.positionAt(row, rect.left, rect.table);
+ if (row == rect.top) { pos += cellNode.nodeSize; }
+ for (var col = rect.left, i$1 = 0; col < rect.right; col++, i$1++) {
+ if (col == rect.left && row == rect.top) { continue }
+ tr.insert(lastCell = tr.mapping.map(pos + rect.tableStart, 1), getCellType({ node: cellNode, row: row, col: col}).createAndFill(attrs[i$1]));
+ }
+ }
+ tr.setNodeMarkup(cellPos, getCellType({ node: cellNode, row: rect.top, col: rect.left}), attrs[0]);
+ if (sel instanceof CellSelection)
+ { tr.setSelection(new CellSelection(tr.doc.resolve(sel.$anchorCell.pos),
+ lastCell && tr.doc.resolve(lastCell))); }
+ dispatch(tr);
+ }
+ return true
+ }
+}
+
+// :: (string, any) → (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Returns a command that sets the given attribute to the given value,
+// and is only available when the currently selected cell doesn't
+// already have that attribute set to that value.
+function setCellAttr(name, value) {
+ return function(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ var $cell = selectionCell(state);
+ if ($cell.nodeAfter.attrs[name] === value) { return false }
+ if (dispatch) {
+ var tr = state.tr;
+ if (state.selection instanceof CellSelection)
+ { state.selection.forEachCell(function (node, pos) {
+ if (node.attrs[name] !== value)
+ { tr.setNodeMarkup(pos, null, setAttr(node.attrs, name, value)); }
+ }); }
+ else
+ { tr.setNodeMarkup($cell.pos, null, setAttr($cell.nodeAfter.attrs, name, value)); }
+ dispatch(tr);
+ }
+ return true
+ }
+}
+
+function deprecated_toggleHeader(type) {
+ return function(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ if (dispatch) {
+ var types = tableNodeTypes(state.schema);
+ var rect = selectedRect(state), tr = state.tr;
+ var cells = rect.map.cellsInRect(type == "column" ? new Rect(rect.left, 0, rect.right, rect.map.height) :
+ type == "row" ? new Rect(0, rect.top, rect.map.width, rect.bottom) : rect);
+ var nodes = cells.map(function (pos) { return rect.table.nodeAt(pos); });
+ for (var i = 0; i < cells.length; i++) // Remove headers, if any
+ { if (nodes[i].type == types.header_cell)
+ { tr.setNodeMarkup(rect.tableStart + cells[i], types.cell, nodes[i].attrs); } }
+ if (tr.steps.length == 0) { for (var i$1 = 0; i$1 < cells.length; i$1++) // No headers removed, add instead
+ { tr.setNodeMarkup(rect.tableStart + cells[i$1], types.header_cell, nodes[i$1].attrs); } }
+ dispatch(tr);
+ }
+ return true
+ }
+}
+
+function isHeaderEnabledByType(type, rect, types) {
+ // Get cell positions for first row or first column
+ var cellPositions = rect.map.cellsInRect({
+ left: 0,
+ top: 0,
+ right: type == "row" ? rect.map.width : 1,
+ bottom: type == "column" ? rect.map.height : 1,
+ });
+
+ for (var i = 0; i < cellPositions.length; i++) {
+ var cell = rect.table.nodeAt(cellPositions[i]);
+ if (cell && cell.type !== types.header_cell) {
+ return false
+ }
+ }
+
+ return true
+}
+
+// :: (string, ?{ useDeprecatedLogic: bool }) → (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Toggles between row/column header and normal cells (Only applies to first row/column).
+// For deprecated behavior pass `useDeprecatedLogic` in options with true.
+function toggleHeader(type, options) {
+ options = options || { useDeprecatedLogic: false };
+
+ if (options.useDeprecatedLogic)
+ { return deprecated_toggleHeader(type) }
+
+ return function(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ if (dispatch) {
+ var types = tableNodeTypes(state.schema);
+ var rect = selectedRect(state), tr = state.tr;
+
+ var isHeaderRowEnabled = isHeaderEnabledByType("row", rect, types);
+ var isHeaderColumnEnabled = isHeaderEnabledByType("column", rect, types);
+
+ var isHeaderEnabled = type === "column" ? isHeaderRowEnabled :
+ type === "row" ? isHeaderColumnEnabled : false;
+
+ var selectionStartsAt = isHeaderEnabled ? 1 : 0;
+
+ var cellsRect = type == "column" ? new Rect(0, selectionStartsAt, 1, rect.map.height) :
+ type == "row" ? new Rect(selectionStartsAt, 0, rect.map.width, 1) : rect;
+
+ var newType = type == "column" ? isHeaderColumnEnabled ? types.cell : types.header_cell :
+ type == "row" ? isHeaderRowEnabled ? types.cell : types.header_cell : types.cell;
+
+ rect.map.cellsInRect(cellsRect).forEach(function (relativeCellPos) {
+ var cellPos = relativeCellPos + rect.tableStart;
+ var cell = tr.doc.nodeAt(cellPos);
+
+ if (cell) {
+ tr.setNodeMarkup(cellPos, newType, cell.attrs);
+ }
+ });
+
+ dispatch(tr);
+ }
+ return true
+ }
+}
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Toggles whether the selected row contains header cells.
+var toggleHeaderRow = toggleHeader("row", { useDeprecatedLogic: true });
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Toggles whether the selected column contains header cells.
+var toggleHeaderColumn = toggleHeader("column", { useDeprecatedLogic: true });
+
+// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Toggles whether the selected cells are header cells.
+var toggleHeaderCell = toggleHeader("cell", { useDeprecatedLogic: true });
+
+function findNextCell($cell, dir) {
+ if (dir < 0) {
+ var before = $cell.nodeBefore;
+ if (before) { return $cell.pos - before.nodeSize }
+ for (var row = $cell.index(-1) - 1, rowEnd = $cell.before(); row >= 0; row--) {
+ var rowNode = $cell.node(-1).child(row);
+ if (rowNode.childCount) { return rowEnd - 1 - rowNode.lastChild.nodeSize }
+ rowEnd -= rowNode.nodeSize;
+ }
+ } else {
+ if ($cell.index() < $cell.parent.childCount - 1) { return $cell.pos + $cell.nodeAfter.nodeSize }
+ var table = $cell.node(-1);
+ for (var row$1 = $cell.indexAfter(-1), rowStart = $cell.after(); row$1 < table.childCount; row$1++) {
+ var rowNode$1 = table.child(row$1);
+ if (rowNode$1.childCount) { return rowStart + 1 }
+ rowStart += rowNode$1.nodeSize;
+ }
+ }
+}
+
+// :: (number) → (EditorState, dispatch: ?(tr: Transaction)) → bool
+// Returns a command for selecting the next (direction=1) or previous
+// (direction=-1) cell in a table.
+function goToNextCell(direction) {
+ return function(state, dispatch) {
+ if (!isInTable(state)) { return false }
+ var cell = findNextCell(selectionCell(state), direction);
+ if (cell == null) { return }
+ if (dispatch) {
+ var $cell = state.doc.resolve(cell);
+ dispatch(state.tr.setSelection(prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["TextSelection"].between($cell, moveCellForward($cell))).scrollIntoView());
+ }
+ return true
+ }
+}
+
+// :: (EditorState, ?(tr: Transaction)) → bool
+// Deletes the table around the selection, if any.
+function deleteTable(state, dispatch) {
+ var $pos = state.selection.$anchor;
+ for (var d = $pos.depth; d > 0; d--) {
+ var node = $pos.node(d);
+ if (node.type.spec.tableRole == "table") {
+ if (dispatch) { dispatch(state.tr.delete($pos.before(d), $pos.after(d)).scrollIntoView()); }
+ return true
+ }
+ }
+ return false
+}
+
+var TableView = function TableView(node, cellMinWidth) {
+ this.node = node;
+ this.cellMinWidth = cellMinWidth;
+ this.dom = document.createElement("div");
+ this.dom.className = "tableWrapper";
+ this.table = this.dom.appendChild(document.createElement("table"));
+ this.colgroup = this.table.appendChild(document.createElement("colgroup"));
+ updateColumns(node, this.colgroup, this.table, cellMinWidth);
+ this.contentDOM = this.table.appendChild(document.createElement("tbody"));
+};
+
+TableView.prototype.update = function update (node) {
+ if (node.type != this.node.type) { return false }
+ this.node = node;
+ updateColumns(node, this.colgroup, this.table, this.cellMinWidth);
+ return true
+};
+
+TableView.prototype.ignoreMutation = function ignoreMutation (record) {
+ return record.type == "attributes" && (record.target == this.table || this.colgroup.contains(record.target))
+};
+
+function updateColumns(node, colgroup, table, cellMinWidth, overrideCol, overrideValue) {
+ var totalWidth = 0, fixedWidth = true;
+ var nextDOM = colgroup.firstChild, row = node.firstChild;
+ for (var i = 0, col = 0; i < row.childCount; i++) {
+ var ref = row.child(i).attrs;
+ var colspan = ref.colspan;
+ var colwidth = ref.colwidth;
+ for (var j = 0; j < colspan; j++, col++) {
+ var hasWidth = overrideCol == col ? overrideValue : colwidth && colwidth[j];
+ var cssWidth = hasWidth ? hasWidth + "px" : "";
+ totalWidth += hasWidth || cellMinWidth;
+ if (!hasWidth) { fixedWidth = false; }
+ if (!nextDOM) {
+ colgroup.appendChild(document.createElement("col")).style.width = cssWidth;
+ } else {
+ if (nextDOM.style.width != cssWidth) { nextDOM.style.width = cssWidth; }
+ nextDOM = nextDOM.nextSibling;
+ }
+ }
+ }
+
+ while (nextDOM) {
+ var after = nextDOM.nextSibling;
+ nextDOM.parentNode.removeChild(nextDOM);
+ nextDOM = after;
+ }
+
+ if (fixedWidth) {
+ table.style.width = totalWidth + "px";
+ table.style.minWidth = "";
+ } else {
+ table.style.width = "";
+ table.style.minWidth = totalWidth + "px";
+ }
+}
+
+var key$1 = new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["PluginKey"]("tableColumnResizing");
+
+function columnResizing(ref) {
+ if ( ref === void 0 ) ref = {};
+ var handleWidth = ref.handleWidth; if ( handleWidth === void 0 ) handleWidth = 5;
+ var cellMinWidth = ref.cellMinWidth; if ( cellMinWidth === void 0 ) cellMinWidth = 25;
+ var View = ref.View; if ( View === void 0 ) View = TableView;
+ var lastColumnResizable = ref.lastColumnResizable; if ( lastColumnResizable === void 0 ) lastColumnResizable = true;
+
+ var plugin = new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Plugin"]({
+ key: key$1,
+ state: {
+ init: function init(_, state) {
+ this.spec.props.nodeViews[tableNodeTypes(state.schema).table.name] =
+ function (node, view) { return new View(node, cellMinWidth, view); };
+ return new ResizeState(-1, false)
+ },
+ apply: function apply(tr, prev) {
+ return prev.apply(tr)
+ }
+ },
+ props: {
+ attributes: function attributes(state) {
+ var pluginState = key$1.getState(state);
+ return pluginState.activeHandle > -1 ? {class: "resize-cursor"} : null
+ },
+
+ handleDOMEvents: {
+ mousemove: function mousemove(view, event) { handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable); },
+ mouseleave: function mouseleave(view) { handleMouseLeave(view); },
+ mousedown: function mousedown(view, event) { handleMouseDown$1(view, event, cellMinWidth); }
+ },
+
+ decorations: function decorations(state) {
+ var pluginState = key$1.getState(state);
+ if (pluginState.activeHandle > -1) { return handleDecorations(state, pluginState.activeHandle) }
+ },
+
+ nodeViews: {}
+ }
+ });
+ return plugin
+}
+
+var ResizeState = function ResizeState(activeHandle, dragging) {
+ this.activeHandle = activeHandle;
+ this.dragging = dragging;
+};
+
+ResizeState.prototype.apply = function apply (tr) {
+ var state = this, action = tr.getMeta(key$1);
+ if (action && action.setHandle != null)
+ { return new ResizeState(action.setHandle, null) }
+ if (action && action.setDragging !== undefined)
+ { return new ResizeState(state.activeHandle, action.setDragging) }
+ if (state.activeHandle > -1 && tr.docChanged) {
+ var handle = tr.mapping.map(state.activeHandle, -1);
+ if (!pointsAtCell(tr.doc.resolve(handle))) { handle = null; }
+ state = new ResizeState(handle, state.dragging);
+ }
+ return state
+};
+
+function handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable) {
+ var pluginState = key$1.getState(view.state);
+
+ if (!pluginState.dragging) {
+ var target = domCellAround(event.target), cell = -1;
+ if (target) {
+ var ref = target.getBoundingClientRect();
+ var left = ref.left;
+ var right = ref.right;
+ if (event.clientX - left <= handleWidth)
+ { cell = edgeCell(view, event, "left"); }
+ else if (right - event.clientX <= handleWidth)
+ { cell = edgeCell(view, event, "right"); }
+ }
+
+ if (cell != pluginState.activeHandle) {
+ if (!lastColumnResizable && cell !== -1) {
+ var $cell = view.state.doc.resolve(cell);
+ var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
+ var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
+
+ if (col == map.width - 1) {
+ return
+ }
+ }
+
+ updateHandle(view, cell);
+ }
+ }
+}
+
+function handleMouseLeave(view) {
+ var pluginState = key$1.getState(view.state);
+ if (pluginState.activeHandle > -1 && !pluginState.dragging) { updateHandle(view, -1); }
+}
+
+function handleMouseDown$1(view, event, cellMinWidth) {
+ var pluginState = key$1.getState(view.state);
+ if (pluginState.activeHandle == -1 || pluginState.dragging) { return false }
+
+ var cell = view.state.doc.nodeAt(pluginState.activeHandle);
+ var width = currentColWidth(view, pluginState.activeHandle, cell.attrs);
+ view.dispatch(view.state.tr.setMeta(key$1, {setDragging: {startX: event.clientX, startWidth: width}}));
+
+ function finish(event) {
+ window.removeEventListener("mouseup", finish);
+ window.removeEventListener("mousemove", move);
+ var pluginState = key$1.getState(view.state);
+ if (pluginState.dragging) {
+ updateColumnWidth(view, pluginState.activeHandle, draggedWidth(pluginState.dragging, event, cellMinWidth));
+ view.dispatch(view.state.tr.setMeta(key$1, {setDragging: null}));
+ }
+ }
+ function move(event) {
+ if (!event.which) { return finish(event) }
+ var pluginState = key$1.getState(view.state);
+ var dragged = draggedWidth(pluginState.dragging, event, cellMinWidth);
+ displayColumnWidth(view, pluginState.activeHandle, dragged, cellMinWidth);
+ }
+
+ window.addEventListener("mouseup", finish);
+ window.addEventListener("mousemove", move);
+ event.preventDefault();
+ return true
+}
+
+function currentColWidth(view, cellPos, ref) {
+ var colspan = ref.colspan;
+ var colwidth = ref.colwidth;
+
+ var width = colwidth && colwidth[colwidth.length - 1];
+ if (width) { return width }
+ var dom = view.domAtPos(cellPos);
+ var node = dom.node.childNodes[dom.offset];
+ var domWidth = node.offsetWidth, parts = colspan;
+ if (colwidth) { for (var i = 0; i < colspan; i++) { if (colwidth[i]) {
+ domWidth -= colwidth[i];
+ parts--;
+ } } }
+ return domWidth / parts
+}
+
+function domCellAround(target) {
+ while (target && target.nodeName != "TD" && target.nodeName != "TH")
+ { target = target.classList.contains("ProseMirror") ? null : target.parentNode; }
+ return target
+}
+
+function edgeCell(view, event, side) {
+ var ref = view.posAtCoords({left: event.clientX, top: event.clientY});
+ var pos = ref.pos;
+ var $cell = cellAround(view.state.doc.resolve(pos));
+ if (!$cell) { return -1 }
+ if (side == "right") { return $cell.pos }
+ var map = TableMap.get($cell.node(-1)), start = $cell.start(-1);
+ var index = map.map.indexOf($cell.pos - start);
+ return index % map.width == 0 ? -1 : start + map.map[index - 1]
+}
+
+function draggedWidth(dragging, event, cellMinWidth) {
+ var offset = event.clientX - dragging.startX;
+ return Math.max(cellMinWidth, dragging.startWidth + offset)
+}
+
+function updateHandle(view, value) {
+ view.dispatch(view.state.tr.setMeta(key$1, {setHandle: value}));
+}
+
+function updateColumnWidth(view, cell, width) {
+ var $cell = view.state.doc.resolve(cell);
+ var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
+ var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
+ var tr = view.state.tr;
+ for (var row = 0; row < map.height; row++) {
+ var mapIndex = row * map.width + col;
+ // Rowspanning cell that has already been handled
+ if (row && map.map[mapIndex] == map.map[mapIndex - map.width]) { continue }
+ var pos = map.map[mapIndex];
+ var ref = table.nodeAt(pos);
+ var attrs = ref.attrs;
+ var index = attrs.colspan == 1 ? 0 : col - map.colCount(pos);
+ if (attrs.colwidth && attrs.colwidth[index] == width) { continue }
+ var colwidth = attrs.colwidth ? attrs.colwidth.slice() : zeroes(attrs.colspan);
+ colwidth[index] = width;
+ tr.setNodeMarkup(start + pos, null, setAttr(attrs, "colwidth", colwidth));
+ }
+ if (tr.docChanged) { view.dispatch(tr); }
+}
+
+function displayColumnWidth(view, cell, width, cellMinWidth) {
+ var $cell = view.state.doc.resolve(cell);
+ var table = $cell.node(-1), start = $cell.start(-1);
+ var col = TableMap.get(table).colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
+ var dom = view.domAtPos($cell.start(-1)).node;
+ while (dom.nodeName != "TABLE") { dom = dom.parentNode; }
+ updateColumns(table, dom.firstChild, dom, cellMinWidth, col, width);
+}
+
+function zeroes(n) {
+ var result = [];
+ for (var i = 0; i < n; i++) { result.push(0); }
+ return result
+}
+
+function handleDecorations(state, cell) {
+ var decorations = [];
+ var $cell = state.doc.resolve(cell);
+ var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
+ var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan;
+ for (var row = 0; row < map.height; row++) {
+ var index = col + row * map.width - 1;
+ // For positions that are have either a different cell or the end
+ // of the table to their right, and either the top of the table or
+ // a different cell above them, add a decoration
+ if ((col == map.width || map.map[index] != map.map[index + 1]) &&
+ (row == 0 || map.map[index - 1] != map.map[index - 1 - map.width])) {
+ var cellPos = map.map[index];
+ var pos = start + cellPos + table.nodeAt(cellPos).nodeSize - 1;
+ var dom = document.createElement("div");
+ dom.className = "column-resize-handle";
+ decorations.push(prosemirror_view__WEBPACK_IMPORTED_MODULE_3__["Decoration"].widget(pos, dom));
+ }
+ }
+ return prosemirror_view__WEBPACK_IMPORTED_MODULE_3__["DecorationSet"].create(state.doc, decorations)
+}
+
+// This file defines a plugin that handles the drawing of cell
+
+// :: () → Plugin
+//
+// Creates a [plugin](http://prosemirror.net/docs/ref/#state.Plugin)
+// that, when added to an editor, enables cell-selection, handles
+// cell-based copy/paste, and makes sure tables stay well-formed (each
+// row has the same width, and cells don't overlap).
+//
+// You should probably put this plugin near the end of your array of
+// plugins, since it handles mouse and arrow key events in tables
+// rather broadly, and other plugins, like the gap cursor or the
+// column-width dragging plugin, might want to get a turn first to
+// perform more specific behavior.
+function tableEditing(ref) {
+ if ( ref === void 0 ) ref = {};
+ var allowTableNodeSelection = ref.allowTableNodeSelection; if ( allowTableNodeSelection === void 0 ) allowTableNodeSelection = false;
+
+ return new prosemirror_state__WEBPACK_IMPORTED_MODULE_0__["Plugin"]({
+ key: key,
+
+ // This piece of state is used to remember when a mouse-drag
+ // cell-selection is happening, so that it can continue even as
+ // transactions (which might move its anchor cell) come in.
+ state: {
+ init: function init() { return null },
+ apply: function apply(tr, cur) {
+ var set = tr.getMeta(key);
+ if (set != null) { return set == -1 ? null : set }
+ if (cur == null || !tr.docChanged) { return cur }
+ var ref = tr.mapping.mapResult(cur);
+ var deleted = ref.deleted;
+ var pos = ref.pos;
+ return deleted ? null : pos
+ }
+ },
+
+ props: {
+ decorations: drawCellSelection,
+
+ handleDOMEvents: {
+ mousedown: handleMouseDown
+ },
+
+ createSelectionBetween: function createSelectionBetween(view) {
+ if (key.getState(view.state) != null) { return view.state.selection }
+ },
+
+ handleTripleClick: handleTripleClick,
+
+ handleKeyDown: handleKeyDown,
+
+ handlePaste: handlePaste
+ },
+
+ appendTransaction: function appendTransaction(_, oldState, state) {
+ return normalizeSelection(state, fixTables(state, oldState), allowTableNodeSelection)
+ }
+ })
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-transform/dist/index.es.js":
+/*!*************************************************************!*\
+ !*** ./node_modules/prosemirror-transform/dist/index.es.js ***!
+ \*************************************************************/
+/*! exports provided: AddMarkStep, MapResult, Mapping, RemoveMarkStep, ReplaceAroundStep, ReplaceStep, Step, StepMap, StepResult, Transform, TransformError, canJoin, canSplit, dropPoint, findWrapping, insertPoint, joinPoint, liftTarget, replaceStep */
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "AddMarkStep", function() { return AddMarkStep; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "MapResult", function() { return MapResult; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Mapping", function() { return Mapping; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "RemoveMarkStep", function() { return RemoveMarkStep; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ReplaceAroundStep", function() { return ReplaceAroundStep; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "ReplaceStep", function() { return ReplaceStep; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Step", function() { return Step; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "StepMap", function() { return StepMap; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "StepResult", function() { return StepResult; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "Transform", function() { return Transform; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "TransformError", function() { return TransformError; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "canJoin", function() { return canJoin; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "canSplit", function() { return canSplit; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "dropPoint", function() { return dropPoint; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "findWrapping", function() { return findWrapping; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "insertPoint", function() { return insertPoint; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "joinPoint", function() { return joinPoint; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "liftTarget", function() { return liftTarget; });
+/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "replaceStep", function() { return replaceStep; });
+/* harmony import */ var prosemirror_model__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! prosemirror-model */ "./node_modules/prosemirror-model/dist/index.es.js");
+
+
+// Mappable:: interface
+// There are several things that positions can be mapped through.
+// Such objects conform to this interface.
+//
+// map:: (pos: number, assoc: ?number) → number
+// Map a position through this object. When given, `assoc` (should
+// be -1 or 1, defaults to 1) determines with which side the
+// position is associated, which determines in which direction to
+// move when a chunk of content is inserted at the mapped position.
+//
+// mapResult:: (pos: number, assoc: ?number) → MapResult
+// Map a position, and return an object containing additional
+// information about the mapping. The result's `deleted` field tells
+// you whether the position was deleted (completely enclosed in a
+// replaced range) during the mapping. When content on only one side
+// is deleted, the position itself is only considered deleted when
+// `assoc` points in the direction of the deleted content.
+
+// Recovery values encode a range index and an offset. They are
+// represented as numbers, because tons of them will be created when
+// mapping, for example, a large number of decorations. The number's
+// lower 16 bits provide the index, the remaining bits the offset.
+//
+// Note: We intentionally don't use bit shift operators to en- and
+// decode these, since those clip to 32 bits, which we might in rare
+// cases want to overflow. A 64-bit float can represent 48-bit
+// integers precisely.
+
+var lower16 = 0xffff;
+var factor16 = Math.pow(2, 16);
+
+function makeRecover(index, offset) { return index + offset * factor16 }
+function recoverIndex(value) { return value & lower16 }
+function recoverOffset(value) { return (value - (value & lower16)) / factor16 }
+
+// ::- An object representing a mapped position with extra
+// information.
+var MapResult = function MapResult(pos, deleted, recover) {
+ if ( deleted === void 0 ) deleted = false;
+ if ( recover === void 0 ) recover = null;
+
+ // :: number The mapped version of the position.
+ this.pos = pos;
+ // :: bool Tells you whether the position was deleted, that is,
+ // whether the step removed its surroundings from the document.
+ this.deleted = deleted;
+ this.recover = recover;
+};
+
+// :: class extends Mappable
+// A map describing the deletions and insertions made by a step, which
+// can be used to find the correspondence between positions in the
+// pre-step version of a document and the same position in the
+// post-step version.
+var StepMap = function StepMap(ranges, inverted) {
+ if ( inverted === void 0 ) inverted = false;
+
+ this.ranges = ranges;
+ this.inverted = inverted;
+};
+
+StepMap.prototype.recover = function recover (value) {
+ var diff = 0, index = recoverIndex(value);
+ if (!this.inverted) { for (var i = 0; i < index; i++)
+ { diff += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1]; } }
+ return this.ranges[index * 3] + diff + recoverOffset(value)
+};
+
+// : (number, ?number) → MapResult
+StepMap.prototype.mapResult = function mapResult (pos, assoc) {
+ if ( assoc === void 0 ) assoc = 1;
+ return this._map(pos, assoc, false) };
+
+// : (number, ?number) → number
+StepMap.prototype.map = function map (pos, assoc) {
+ if ( assoc === void 0 ) assoc = 1;
+ return this._map(pos, assoc, true) };
+
+StepMap.prototype._map = function _map (pos, assoc, simple) {
+ var diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
+ for (var i = 0; i < this.ranges.length; i += 3) {
+ var start = this.ranges[i] - (this.inverted ? diff : 0);
+ if (start > pos) { break }
+ var oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex], end = start + oldSize;
+ if (pos <= end) {
+ var side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;
+ var result = start + diff + (side < 0 ? 0 : newSize);
+ if (simple) { return result }
+ var recover = makeRecover(i / 3, pos - start);
+ return new MapResult(result, assoc < 0 ? pos != start : pos != end, recover)
+ }
+ diff += newSize - oldSize;
+ }
+ return simple ? pos + diff : new MapResult(pos + diff)
+};
+
+StepMap.prototype.touches = function touches (pos, recover) {
+ var diff = 0, index = recoverIndex(recover);
+ var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
+ for (var i = 0; i < this.ranges.length; i += 3) {
+ var start = this.ranges[i] - (this.inverted ? diff : 0);
+ if (start > pos) { break }
+ var oldSize = this.ranges[i + oldIndex], end = start + oldSize;
+ if (pos <= end && i == index * 3) { return true }
+ diff += this.ranges[i + newIndex] - oldSize;
+ }
+ return false
+};
+
+// :: ((oldStart: number, oldEnd: number, newStart: number, newEnd: number))
+// Calls the given function on each of the changed ranges included in
+// this map.
+StepMap.prototype.forEach = function forEach (f) {
+ var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
+ for (var i = 0, diff = 0; i < this.ranges.length; i += 3) {
+ var start = this.ranges[i], oldStart = start - (this.inverted ? diff : 0), newStart = start + (this.inverted ? 0 : diff);
+ var oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex];
+ f(oldStart, oldStart + oldSize, newStart, newStart + newSize);
+ diff += newSize - oldSize;
+ }
+};
+
+// :: () → StepMap
+// Create an inverted version of this map. The result can be used to
+// map positions in the post-step document to the pre-step document.
+StepMap.prototype.invert = function invert () {
+ return new StepMap(this.ranges, !this.inverted)
+};
+
+StepMap.prototype.toString = function toString () {
+ return (this.inverted ? "-" : "") + JSON.stringify(this.ranges)
+};
+
+// :: (n: number) → StepMap
+// Create a map that moves all positions by offset `n` (which may be
+// negative). This can be useful when applying steps meant for a
+// sub-document to a larger document, or vice-versa.
+StepMap.offset = function offset (n) {
+ return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n])
+};
+
+StepMap.empty = new StepMap([]);
+
+// :: class extends Mappable
+// A mapping represents a pipeline of zero or more [step
+// maps](#transform.StepMap). It has special provisions for losslessly
+// handling mapping positions through a series of steps in which some
+// steps are inverted versions of earlier steps. (This comes up when
+// ‘[rebasing](/docs/guide/#transform.rebasing)’ steps for
+// collaboration or history management.)
+var Mapping = function Mapping(maps, mirror, from, to) {
+ // :: [StepMap]
+ // The step maps in this mapping.
+ this.maps = maps || [];
+ // :: number
+ // The starting position in the `maps` array, used when `map` or
+ // `mapResult` is called.
+ this.from = from || 0;
+ // :: number
+ // The end position in the `maps` array.
+ this.to = to == null ? this.maps.length : to;
+ this.mirror = mirror;
+};
+
+// :: (?number, ?number) → Mapping
+// Create a mapping that maps only through a part of this one.
+Mapping.prototype.slice = function slice (from, to) {
+ if ( from === void 0 ) from = 0;
+ if ( to === void 0 ) to = this.maps.length;
+
+ return new Mapping(this.maps, this.mirror, from, to)
+};
+
+Mapping.prototype.copy = function copy () {
+ return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to)
+};
+
+// :: (StepMap, ?number)
+// Add a step map to the end of this mapping. If `mirrors` is
+// given, it should be the index of the step map that is the mirror
+// image of this one.
+Mapping.prototype.appendMap = function appendMap (map, mirrors) {
+ this.to = this.maps.push(map);
+ if (mirrors != null) { this.setMirror(this.maps.length - 1, mirrors); }
+};
+
+// :: (Mapping)
+// Add all the step maps in a given mapping to this one (preserving
+// mirroring information).
+Mapping.prototype.appendMapping = function appendMapping (mapping) {
+ for (var i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {
+ var mirr = mapping.getMirror(i);
+ this.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : null);
+ }
+};
+
+// :: (number) → ?number
+// Finds the offset of the step map that mirrors the map at the
+// given offset, in this mapping (as per the second argument to
+// `appendMap`).
+Mapping.prototype.getMirror = function getMirror (n) {
+ if (this.mirror) { for (var i = 0; i < this.mirror.length; i++)
+ { if (this.mirror[i] == n) { return this.mirror[i + (i % 2 ? -1 : 1)] } } }
+};
+
+Mapping.prototype.setMirror = function setMirror (n, m) {
+ if (!this.mirror) { this.mirror = []; }
+ this.mirror.push(n, m);
+};
+
+// :: (Mapping)
+// Append the inverse of the given mapping to this one.
+Mapping.prototype.appendMappingInverted = function appendMappingInverted (mapping) {
+ for (var i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {
+ var mirr = mapping.getMirror(i);
+ this.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : null);
+ }
+};
+
+// :: () → Mapping
+// Create an inverted version of this mapping.
+Mapping.prototype.invert = function invert () {
+ var inverse = new Mapping;
+ inverse.appendMappingInverted(this);
+ return inverse
+};
+
+// : (number, ?number) → number
+// Map a position through this mapping.
+Mapping.prototype.map = function map (pos, assoc) {
+ if ( assoc === void 0 ) assoc = 1;
+
+ if (this.mirror) { return this._map(pos, assoc, true) }
+ for (var i = this.from; i < this.to; i++)
+ { pos = this.maps[i].map(pos, assoc); }
+ return pos
+};
+
+// : (number, ?number) → MapResult
+// Map a position through this mapping, returning a mapping
+// result.
+Mapping.prototype.mapResult = function mapResult (pos, assoc) {
+ if ( assoc === void 0 ) assoc = 1;
+ return this._map(pos, assoc, false) };
+
+Mapping.prototype._map = function _map (pos, assoc, simple) {
+ var deleted = false, recoverables = null;
+
+ for (var i = this.from; i < this.to; i++) {
+ var map = this.maps[i], rec = recoverables && recoverables[i];
+ if (rec != null && map.touches(pos, rec)) {
+ pos = map.recover(rec);
+ continue
+ }
+
+ var result = map.mapResult(pos, assoc);
+ if (result.recover != null) {
+ var corr = this.getMirror(i);
+ if (corr != null && corr > i && corr < this.to) {
+ if (result.deleted) {
+ i = corr;
+ pos = this.maps[corr].recover(result.recover);
+ continue
+ } else {
+(recoverables || (recoverables = Object.create(null)))[corr] = result.recover;
+ }
+ }
+ }
+
+ if (result.deleted) { deleted = true; }
+ pos = result.pos;
+ }
+
+ return simple ? pos : new MapResult(pos, deleted)
+};
+
+function TransformError(message) {
+ var err = Error.call(this, message);
+ err.__proto__ = TransformError.prototype;
+ return err
+}
+
+TransformError.prototype = Object.create(Error.prototype);
+TransformError.prototype.constructor = TransformError;
+TransformError.prototype.name = "TransformError";
+
+// ::- Abstraction to build up and track an array of
+// [steps](#transform.Step) representing a document transformation.
+//
+// Most transforming methods return the `Transform` object itself, so
+// that they can be chained.
+var Transform = function Transform(doc) {
+ // :: Node
+ // The current document (the result of applying the steps in the
+ // transform).
+ this.doc = doc;
+ // :: [Step]
+ // The steps in this transform.
+ this.steps = [];
+ // :: [Node]
+ // The documents before each of the steps.
+ this.docs = [];
+ // :: Mapping
+ // A mapping with the maps for each of the steps in this transform.
+ this.mapping = new Mapping;
+};
+
+var prototypeAccessors = { before: { configurable: true },docChanged: { configurable: true } };
+
+// :: Node The starting document.
+prototypeAccessors.before.get = function () { return this.docs.length ? this.docs[0] : this.doc };
+
+// :: (step: Step) → this
+// Apply a new step in this transform, saving the result. Throws an
+// error when the step fails.
+Transform.prototype.step = function step (object) {
+ var result = this.maybeStep(object);
+ if (result.failed) { throw new TransformError(result.failed) }
+ return this
+};
+
+// :: (Step) → StepResult
+// Try to apply a step in this transformation, ignoring it if it
+// fails. Returns the step result.
+Transform.prototype.maybeStep = function maybeStep (step) {
+ var result = step.apply(this.doc);
+ if (!result.failed) { this.addStep(step, result.doc); }
+ return result
+};
+
+// :: bool
+// True when the document has been changed (when there are any
+// steps).
+prototypeAccessors.docChanged.get = function () {
+ return this.steps.length > 0
+};
+
+Transform.prototype.addStep = function addStep (step, doc) {
+ this.docs.push(this.doc);
+ this.steps.push(step);
+ this.mapping.appendMap(step.getMap());
+ this.doc = doc;
+};
+
+Object.defineProperties( Transform.prototype, prototypeAccessors );
+
+function mustOverride() { throw new Error("Override me") }
+
+var stepsByID = Object.create(null);
+
+// ::- A step object represents an atomic change. It generally applies
+// only to the document it was created for, since the positions
+// stored in it will only make sense for that document.
+//
+// New steps are defined by creating classes that extend `Step`,
+// overriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`
+// methods, and registering your class with a unique
+// JSON-serialization identifier using
+// [`Step.jsonID`](#transform.Step^jsonID).
+var Step = function Step () {};
+
+Step.prototype.apply = function apply (_doc) { return mustOverride() };
+
+// :: () → StepMap
+// Get the step map that represents the changes made by this step,
+// and which can be used to transform between positions in the old
+// and the new document.
+Step.prototype.getMap = function getMap () { return StepMap.empty };
+
+// :: (doc: Node) → Step
+// Create an inverted version of this step. Needs the document as it
+// was before the step as argument.
+Step.prototype.invert = function invert (_doc) { return mustOverride() };
+
+// :: (mapping: Mappable) → ?Step
+// Map this step through a mappable thing, returning either a
+// version of that step with its positions adjusted, or `null` if
+// the step was entirely deleted by the mapping.
+Step.prototype.map = function map (_mapping) { return mustOverride() };
+
+// :: (other: Step) → ?Step
+// Try to merge this step with another one, to be applied directly
+// after it. Returns the merged step when possible, null if the
+// steps can't be merged.
+Step.prototype.merge = function merge (_other) { return null };
+
+// :: () → Object
+// Create a JSON-serializeable representation of this step. When
+// defining this for a custom subclass, make sure the result object
+// includes the step type's [JSON id](#transform.Step^jsonID) under
+// the `stepType` property.
+Step.prototype.toJSON = function toJSON () { return mustOverride() };
+
+// :: (Schema, Object) → Step
+// Deserialize a step from its JSON representation. Will call
+// through to the step class' own implementation of this method.
+Step.fromJSON = function fromJSON (schema, json) {
+ if (!json || !json.stepType) { throw new RangeError("Invalid input for Step.fromJSON") }
+ var type = stepsByID[json.stepType];
+ if (!type) { throw new RangeError(("No step type " + (json.stepType) + " defined")) }
+ return type.fromJSON(schema, json)
+};
+
+// :: (string, constructor)
+// To be able to serialize steps to JSON, each step needs a string
+// ID to attach to its JSON representation. Use this method to
+// register an ID for your step classes. Try to pick something
+// that's unlikely to clash with steps from other modules.
+Step.jsonID = function jsonID (id, stepClass) {
+ if (id in stepsByID) { throw new RangeError("Duplicate use of step JSON ID " + id) }
+ stepsByID[id] = stepClass;
+ stepClass.prototype.jsonID = id;
+ return stepClass
+};
+
+// ::- The result of [applying](#transform.Step.apply) a step. Contains either a
+// new document or a failure value.
+var StepResult = function StepResult(doc, failed) {
+ // :: ?Node The transformed document.
+ this.doc = doc;
+ // :: ?string Text providing information about a failed step.
+ this.failed = failed;
+};
+
+// :: (Node) → StepResult
+// Create a successful step result.
+StepResult.ok = function ok (doc) { return new StepResult(doc, null) };
+
+// :: (string) → StepResult
+// Create a failed step result.
+StepResult.fail = function fail (message) { return new StepResult(null, message) };
+
+// :: (Node, number, number, Slice) → StepResult
+// Call [`Node.replace`](#model.Node.replace) with the given
+// arguments. Create a successful result if it succeeds, and a
+// failed one if it throws a `ReplaceError`.
+StepResult.fromReplace = function fromReplace (doc, from, to, slice) {
+ try {
+ return StepResult.ok(doc.replace(from, to, slice))
+ } catch (e) {
+ if (e instanceof prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["ReplaceError"]) { return StepResult.fail(e.message) }
+ throw e
+ }
+};
+
+// ::- Replace a part of the document with a slice of new content.
+var ReplaceStep = /*@__PURE__*/(function (Step) {
+ function ReplaceStep(from, to, slice, structure) {
+ Step.call(this);
+ this.from = from;
+ this.to = to;
+ this.slice = slice;
+ this.structure = !!structure;
+ }
+
+ if ( Step ) ReplaceStep.__proto__ = Step;
+ ReplaceStep.prototype = Object.create( Step && Step.prototype );
+ ReplaceStep.prototype.constructor = ReplaceStep;
+
+ ReplaceStep.prototype.apply = function apply (doc) {
+ if (this.structure && contentBetween(doc, this.from, this.to))
+ { return StepResult.fail("Structure replace would overwrite content") }
+ return StepResult.fromReplace(doc, this.from, this.to, this.slice)
+ };
+
+ ReplaceStep.prototype.getMap = function getMap () {
+ return new StepMap([this.from, this.to - this.from, this.slice.size])
+ };
+
+ ReplaceStep.prototype.invert = function invert (doc) {
+ return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to))
+ };
+
+ ReplaceStep.prototype.map = function map (mapping) {
+ var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
+ if (from.deleted && to.deleted) { return null }
+ return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice)
+ };
+
+ ReplaceStep.prototype.merge = function merge (other) {
+ if (!(other instanceof ReplaceStep) || other.structure != this.structure) { return null }
+
+ if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {
+ var slice = this.slice.size + other.slice.size == 0 ? prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty
+ : new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);
+ return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure)
+ } else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {
+ var slice$1 = this.slice.size + other.slice.size == 0 ? prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty
+ : new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);
+ return new ReplaceStep(other.from, this.to, slice$1, this.structure)
+ } else {
+ return null
+ }
+ };
+
+ ReplaceStep.prototype.toJSON = function toJSON () {
+ var json = {stepType: "replace", from: this.from, to: this.to};
+ if (this.slice.size) { json.slice = this.slice.toJSON(); }
+ if (this.structure) { json.structure = true; }
+ return json
+ };
+
+ ReplaceStep.fromJSON = function fromJSON (schema, json) {
+ if (typeof json.from != "number" || typeof json.to != "number")
+ { throw new RangeError("Invalid input for ReplaceStep.fromJSON") }
+ return new ReplaceStep(json.from, json.to, prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].fromJSON(schema, json.slice), !!json.structure)
+ };
+
+ return ReplaceStep;
+}(Step));
+
+Step.jsonID("replace", ReplaceStep);
+
+// ::- Replace a part of the document with a slice of content, but
+// preserve a range of the replaced content by moving it into the
+// slice.
+var ReplaceAroundStep = /*@__PURE__*/(function (Step) {
+ function ReplaceAroundStep(from, to, gapFrom, gapTo, slice, insert, structure) {
+ Step.call(this);
+ this.from = from;
+ this.to = to;
+ this.gapFrom = gapFrom;
+ this.gapTo = gapTo;
+ this.slice = slice;
+ this.insert = insert;
+ this.structure = !!structure;
+ }
+
+ if ( Step ) ReplaceAroundStep.__proto__ = Step;
+ ReplaceAroundStep.prototype = Object.create( Step && Step.prototype );
+ ReplaceAroundStep.prototype.constructor = ReplaceAroundStep;
+
+ ReplaceAroundStep.prototype.apply = function apply (doc) {
+ if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||
+ contentBetween(doc, this.gapTo, this.to)))
+ { return StepResult.fail("Structure gap-replace would overwrite content") }
+
+ var gap = doc.slice(this.gapFrom, this.gapTo);
+ if (gap.openStart || gap.openEnd)
+ { return StepResult.fail("Gap is not a flat range") }
+ var inserted = this.slice.insertAt(this.insert, gap.content);
+ if (!inserted) { return StepResult.fail("Content does not fit in gap") }
+ return StepResult.fromReplace(doc, this.from, this.to, inserted)
+ };
+
+ ReplaceAroundStep.prototype.getMap = function getMap () {
+ return new StepMap([this.from, this.gapFrom - this.from, this.insert,
+ this.gapTo, this.to - this.gapTo, this.slice.size - this.insert])
+ };
+
+ ReplaceAroundStep.prototype.invert = function invert (doc) {
+ var gap = this.gapTo - this.gapFrom;
+ return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap,
+ this.from + this.insert, this.from + this.insert + gap,
+ doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from),
+ this.gapFrom - this.from, this.structure)
+ };
+
+ ReplaceAroundStep.prototype.map = function map (mapping) {
+ var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
+ var gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1);
+ if ((from.deleted && to.deleted) || gapFrom < from.pos || gapTo > to.pos) { return null }
+ return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure)
+ };
+
+ ReplaceAroundStep.prototype.toJSON = function toJSON () {
+ var json = {stepType: "replaceAround", from: this.from, to: this.to,
+ gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert};
+ if (this.slice.size) { json.slice = this.slice.toJSON(); }
+ if (this.structure) { json.structure = true; }
+ return json
+ };
+
+ ReplaceAroundStep.fromJSON = function fromJSON (schema, json) {
+ if (typeof json.from != "number" || typeof json.to != "number" ||
+ typeof json.gapFrom != "number" || typeof json.gapTo != "number" || typeof json.insert != "number")
+ { throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON") }
+ return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo,
+ prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].fromJSON(schema, json.slice), json.insert, !!json.structure)
+ };
+
+ return ReplaceAroundStep;
+}(Step));
+
+Step.jsonID("replaceAround", ReplaceAroundStep);
+
+function contentBetween(doc, from, to) {
+ var $from = doc.resolve(from), dist = to - from, depth = $from.depth;
+ while (dist > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {
+ depth--;
+ dist--;
+ }
+ if (dist > 0) {
+ var next = $from.node(depth).maybeChild($from.indexAfter(depth));
+ while (dist > 0) {
+ if (!next || next.isLeaf) { return true }
+ next = next.firstChild;
+ dist--;
+ }
+ }
+ return false
+}
+
+function canCut(node, start, end) {
+ return (start == 0 || node.canReplace(start, node.childCount)) &&
+ (end == node.childCount || node.canReplace(0, end))
+}
+
+// :: (NodeRange) → ?number
+// Try to find a target depth to which the content in the given range
+// can be lifted. Will not go across
+// [isolating](#model.NodeSpec.isolating) parent nodes.
+function liftTarget(range) {
+ var parent = range.parent;
+ var content = parent.content.cutByIndex(range.startIndex, range.endIndex);
+ for (var depth = range.depth;; --depth) {
+ var node = range.$from.node(depth);
+ var index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);
+ if (depth < range.depth && node.canReplace(index, endIndex, content))
+ { return depth }
+ if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex)) { break }
+ }
+}
+
+// :: (NodeRange, number) → this
+// Split the content in the given range off from its parent, if there
+// is sibling content before or after it, and move it up the tree to
+// the depth specified by `target`. You'll probably want to use
+// [`liftTarget`](#transform.liftTarget) to compute `target`, to make
+// sure the lift is valid.
+Transform.prototype.lift = function(range, target) {
+ var $from = range.$from;
+ var $to = range.$to;
+ var depth = range.depth;
+
+ var gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);
+ var start = gapStart, end = gapEnd;
+
+ var before = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, openStart = 0;
+ for (var d = depth, splitting = false; d > target; d--)
+ { if (splitting || $from.index(d) > 0) {
+ splitting = true;
+ before = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from($from.node(d).copy(before));
+ openStart++;
+ } else {
+ start--;
+ } }
+ var after = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, openEnd = 0;
+ for (var d$1 = depth, splitting$1 = false; d$1 > target; d$1--)
+ { if (splitting$1 || $to.after(d$1 + 1) < $to.end(d$1)) {
+ splitting$1 = true;
+ after = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from($to.node(d$1).copy(after));
+ openEnd++;
+ } else {
+ end++;
+ } }
+
+ return this.step(new ReplaceAroundStep(start, end, gapStart, gapEnd,
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](before.append(after), openStart, openEnd),
+ before.size - openStart, true))
+};
+
+// :: (NodeRange, NodeType, ?Object, ?NodeRange) → ?[{type: NodeType, attrs: ?Object}]
+// Try to find a valid way to wrap the content in the given range in a
+// node of the given type. May introduce extra nodes around and inside
+// the wrapper node, if necessary. Returns null if no valid wrapping
+// could be found. When `innerRange` is given, that range's content is
+// used as the content to fit into the wrapping, instead of the
+// content of `range`.
+function findWrapping(range, nodeType, attrs, innerRange) {
+ if ( innerRange === void 0 ) innerRange = range;
+
+ var around = findWrappingOutside(range, nodeType);
+ var inner = around && findWrappingInside(innerRange, nodeType);
+ if (!inner) { return null }
+ return around.map(withAttrs).concat({type: nodeType, attrs: attrs}).concat(inner.map(withAttrs))
+}
+
+function withAttrs(type) { return {type: type, attrs: null} }
+
+function findWrappingOutside(range, type) {
+ var parent = range.parent;
+ var startIndex = range.startIndex;
+ var endIndex = range.endIndex;
+ var around = parent.contentMatchAt(startIndex).findWrapping(type);
+ if (!around) { return null }
+ var outer = around.length ? around[0] : type;
+ return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null
+}
+
+function findWrappingInside(range, type) {
+ var parent = range.parent;
+ var startIndex = range.startIndex;
+ var endIndex = range.endIndex;
+ var inner = parent.child(startIndex);
+ var inside = type.contentMatch.findWrapping(inner.type);
+ if (!inside) { return null }
+ var lastType = inside.length ? inside[inside.length - 1] : type;
+ var innerMatch = lastType.contentMatch;
+ for (var i = startIndex; innerMatch && i < endIndex; i++)
+ { innerMatch = innerMatch.matchType(parent.child(i).type); }
+ if (!innerMatch || !innerMatch.validEnd) { return null }
+ return inside
+}
+
+// :: (NodeRange, [{type: NodeType, attrs: ?Object}]) → this
+// Wrap the given [range](#model.NodeRange) in the given set of wrappers.
+// The wrappers are assumed to be valid in this position, and should
+// probably be computed with [`findWrapping`](#transform.findWrapping).
+Transform.prototype.wrap = function(range, wrappers) {
+ var content = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty;
+ for (var i = wrappers.length - 1; i >= 0; i--)
+ { content = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from(wrappers[i].type.create(wrappers[i].attrs, content)); }
+
+ var start = range.start, end = range.end;
+ return this.step(new ReplaceAroundStep(start, end, start, end, new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](content, 0, 0), wrappers.length, true))
+};
+
+// :: (number, ?number, NodeType, ?Object) → this
+// Set the type of all textblocks (partly) between `from` and `to` to
+// the given node type with the given attributes.
+Transform.prototype.setBlockType = function(from, to, type, attrs) {
+ var this$1 = this;
+ if ( to === void 0 ) to = from;
+
+ if (!type.isTextblock) { throw new RangeError("Type given to setBlockType should be a textblock") }
+ var mapFrom = this.steps.length;
+ this.doc.nodesBetween(from, to, function (node, pos) {
+ if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(this$1.doc, this$1.mapping.slice(mapFrom).map(pos), type)) {
+ // Ensure all markup that isn't allowed in the new node type is cleared
+ this$1.clearIncompatible(this$1.mapping.slice(mapFrom).map(pos, 1), type);
+ var mapping = this$1.mapping.slice(mapFrom);
+ var startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);
+ this$1.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1,
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from(type.create(attrs, null, node.marks)), 0, 0), 1, true));
+ return false
+ }
+ });
+ return this
+};
+
+function canChangeType(doc, pos, type) {
+ var $pos = doc.resolve(pos), index = $pos.index();
+ return $pos.parent.canReplaceWith(index, index + 1, type)
+}
+
+// :: (number, ?NodeType, ?Object, ?[Mark]) → this
+// Change the type, attributes, and/or marks of the node at `pos`.
+// When `type` isn't given, the existing node type is preserved,
+Transform.prototype.setNodeMarkup = function(pos, type, attrs, marks) {
+ var node = this.doc.nodeAt(pos);
+ if (!node) { throw new RangeError("No node at given position") }
+ if (!type) { type = node.type; }
+ var newNode = type.create(attrs, null, marks || node.marks);
+ if (node.isLeaf)
+ { return this.replaceWith(pos, pos + node.nodeSize, newNode) }
+
+ if (!type.validContent(node.content))
+ { throw new RangeError("Invalid content for node type " + type.name) }
+
+ return this.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1,
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from(newNode), 0, 0), 1, true))
+};
+
+// :: (Node, number, number, ?[?{type: NodeType, attrs: ?Object}]) → bool
+// Check whether splitting at the given position is allowed.
+function canSplit(doc, pos, depth, typesAfter) {
+ if ( depth === void 0 ) depth = 1;
+
+ var $pos = doc.resolve(pos), base = $pos.depth - depth;
+ var innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;
+ if (base < 0 || $pos.parent.type.spec.isolating ||
+ !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||
+ !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))
+ { return false }
+ for (var d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {
+ var node = $pos.node(d), index$1 = $pos.index(d);
+ if (node.type.spec.isolating) { return false }
+ var rest = node.content.cutByIndex(index$1, node.childCount);
+ var after = (typesAfter && typesAfter[i]) || node;
+ if (after != node) { rest = rest.replaceChild(0, after.type.create(after.attrs)); }
+ if (!node.canReplace(index$1 + 1, node.childCount) || !after.type.validContent(rest))
+ { return false }
+ }
+ var index = $pos.indexAfter(base);
+ var baseType = typesAfter && typesAfter[0];
+ return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type)
+}
+
+// :: (number, ?number, ?[?{type: NodeType, attrs: ?Object}]) → this
+// Split the node at the given position, and optionally, if `depth` is
+// greater than one, any number of nodes above that. By default, the
+// parts split off will inherit the node type of the original node.
+// This can be changed by passing an array of types and attributes to
+// use after the split.
+Transform.prototype.split = function(pos, depth, typesAfter) {
+ if ( depth === void 0 ) depth = 1;
+
+ var $pos = this.doc.resolve(pos), before = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, after = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty;
+ for (var d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {
+ before = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from($pos.node(d).copy(before));
+ var typeAfter = typesAfter && typesAfter[i];
+ after = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));
+ }
+ return this.step(new ReplaceStep(pos, pos, new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](before.append(after), depth, depth), true))
+};
+
+// :: (Node, number) → bool
+// Test whether the blocks before and after a given position can be
+// joined.
+function canJoin(doc, pos) {
+ var $pos = doc.resolve(pos), index = $pos.index();
+ return joinable($pos.nodeBefore, $pos.nodeAfter) &&
+ $pos.parent.canReplace(index, index + 1)
+}
+
+function joinable(a, b) {
+ return a && b && !a.isLeaf && a.canAppend(b)
+}
+
+// :: (Node, number, ?number) → ?number
+// Find an ancestor of the given position that can be joined to the
+// block before (or after if `dir` is positive). Returns the joinable
+// point, if any.
+function joinPoint(doc, pos, dir) {
+ if ( dir === void 0 ) dir = -1;
+
+ var $pos = doc.resolve(pos);
+ for (var d = $pos.depth;; d--) {
+ var before = (void 0), after = (void 0);
+ if (d == $pos.depth) {
+ before = $pos.nodeBefore;
+ after = $pos.nodeAfter;
+ } else if (dir > 0) {
+ before = $pos.node(d + 1);
+ after = $pos.node(d).maybeChild($pos.index(d) + 1);
+ } else {
+ before = $pos.node(d).maybeChild($pos.index(d) - 1);
+ after = $pos.node(d + 1);
+ }
+ if (before && !before.isTextblock && joinable(before, after)) { return pos }
+ if (d == 0) { break }
+ pos = dir < 0 ? $pos.before(d) : $pos.after(d);
+ }
+}
+
+// :: (number, ?number) → this
+// Join the blocks around the given position. If depth is 2, their
+// last and first siblings are also joined, and so on.
+Transform.prototype.join = function(pos, depth) {
+ if ( depth === void 0 ) depth = 1;
+
+ var step = new ReplaceStep(pos - depth, pos + depth, prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty, true);
+ return this.step(step)
+};
+
+// :: (Node, number, NodeType) → ?number
+// Try to find a point where a node of the given type can be inserted
+// near `pos`, by searching up the node hierarchy when `pos` itself
+// isn't a valid place but is at the start or end of a node. Return
+// null if no position was found.
+function insertPoint(doc, pos, nodeType) {
+ var $pos = doc.resolve(pos);
+ if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType)) { return pos }
+
+ if ($pos.parentOffset == 0)
+ { for (var d = $pos.depth - 1; d >= 0; d--) {
+ var index = $pos.index(d);
+ if ($pos.node(d).canReplaceWith(index, index, nodeType)) { return $pos.before(d + 1) }
+ if (index > 0) { return null }
+ } }
+ if ($pos.parentOffset == $pos.parent.content.size)
+ { for (var d$1 = $pos.depth - 1; d$1 >= 0; d$1--) {
+ var index$1 = $pos.indexAfter(d$1);
+ if ($pos.node(d$1).canReplaceWith(index$1, index$1, nodeType)) { return $pos.after(d$1 + 1) }
+ if (index$1 < $pos.node(d$1).childCount) { return null }
+ } }
+}
+
+// :: (Node, number, Slice) → ?number
+// Finds a position at or around the given position where the given
+// slice can be inserted. Will look at parent nodes' nearest boundary
+// and try there, even if the original position wasn't directly at the
+// start or end of that node. Returns null when no position was found.
+function dropPoint(doc, pos, slice) {
+ var $pos = doc.resolve(pos);
+ if (!slice.content.size) { return pos }
+ var content = slice.content;
+ for (var i = 0; i < slice.openStart; i++) { content = content.firstChild.content; }
+ for (var pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {
+ for (var d = $pos.depth; d >= 0; d--) {
+ var bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;
+ var insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);
+ if (pass == 1
+ ? $pos.node(d).canReplace(insertPos, insertPos, content)
+ : $pos.node(d).contentMatchAt(insertPos).findWrapping(content.firstChild.type))
+ { return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1) }
+ }
+ }
+ return null
+}
+
+function mapFragment(fragment, f, parent) {
+ var mapped = [];
+ for (var i = 0; i < fragment.childCount; i++) {
+ var child = fragment.child(i);
+ if (child.content.size) { child = child.copy(mapFragment(child.content, f, child)); }
+ if (child.isInline) { child = f(child, parent, i); }
+ mapped.push(child);
+ }
+ return prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].fromArray(mapped)
+}
+
+// ::- Add a mark to all inline content between two positions.
+var AddMarkStep = /*@__PURE__*/(function (Step) {
+ function AddMarkStep(from, to, mark) {
+ Step.call(this);
+ this.from = from;
+ this.to = to;
+ this.mark = mark;
+ }
+
+ if ( Step ) AddMarkStep.__proto__ = Step;
+ AddMarkStep.prototype = Object.create( Step && Step.prototype );
+ AddMarkStep.prototype.constructor = AddMarkStep;
+
+ AddMarkStep.prototype.apply = function apply (doc) {
+ var this$1 = this;
+
+ var oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);
+ var parent = $from.node($from.sharedDepth(this.to));
+ var slice = new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](mapFragment(oldSlice.content, function (node, parent) {
+ if (!parent.type.allowsMarkType(this$1.mark.type)) { return node }
+ return node.mark(this$1.mark.addToSet(node.marks))
+ }, parent), oldSlice.openStart, oldSlice.openEnd);
+ return StepResult.fromReplace(doc, this.from, this.to, slice)
+ };
+
+ AddMarkStep.prototype.invert = function invert () {
+ return new RemoveMarkStep(this.from, this.to, this.mark)
+ };
+
+ AddMarkStep.prototype.map = function map (mapping) {
+ var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
+ if (from.deleted && to.deleted || from.pos >= to.pos) { return null }
+ return new AddMarkStep(from.pos, to.pos, this.mark)
+ };
+
+ AddMarkStep.prototype.merge = function merge (other) {
+ if (other instanceof AddMarkStep &&
+ other.mark.eq(this.mark) &&
+ this.from <= other.to && this.to >= other.from)
+ { return new AddMarkStep(Math.min(this.from, other.from),
+ Math.max(this.to, other.to), this.mark) }
+ };
+
+ AddMarkStep.prototype.toJSON = function toJSON () {
+ return {stepType: "addMark", mark: this.mark.toJSON(),
+ from: this.from, to: this.to}
+ };
+
+ AddMarkStep.fromJSON = function fromJSON (schema, json) {
+ if (typeof json.from != "number" || typeof json.to != "number")
+ { throw new RangeError("Invalid input for AddMarkStep.fromJSON") }
+ return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark))
+ };
+
+ return AddMarkStep;
+}(Step));
+
+Step.jsonID("addMark", AddMarkStep);
+
+// ::- Remove a mark from all inline content between two positions.
+var RemoveMarkStep = /*@__PURE__*/(function (Step) {
+ function RemoveMarkStep(from, to, mark) {
+ Step.call(this);
+ this.from = from;
+ this.to = to;
+ this.mark = mark;
+ }
+
+ if ( Step ) RemoveMarkStep.__proto__ = Step;
+ RemoveMarkStep.prototype = Object.create( Step && Step.prototype );
+ RemoveMarkStep.prototype.constructor = RemoveMarkStep;
+
+ RemoveMarkStep.prototype.apply = function apply (doc) {
+ var this$1 = this;
+
+ var oldSlice = doc.slice(this.from, this.to);
+ var slice = new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](mapFragment(oldSlice.content, function (node) {
+ return node.mark(this$1.mark.removeFromSet(node.marks))
+ }), oldSlice.openStart, oldSlice.openEnd);
+ return StepResult.fromReplace(doc, this.from, this.to, slice)
+ };
+
+ RemoveMarkStep.prototype.invert = function invert () {
+ return new AddMarkStep(this.from, this.to, this.mark)
+ };
+
+ RemoveMarkStep.prototype.map = function map (mapping) {
+ var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
+ if (from.deleted && to.deleted || from.pos >= to.pos) { return null }
+ return new RemoveMarkStep(from.pos, to.pos, this.mark)
+ };
+
+ RemoveMarkStep.prototype.merge = function merge (other) {
+ if (other instanceof RemoveMarkStep &&
+ other.mark.eq(this.mark) &&
+ this.from <= other.to && this.to >= other.from)
+ { return new RemoveMarkStep(Math.min(this.from, other.from),
+ Math.max(this.to, other.to), this.mark) }
+ };
+
+ RemoveMarkStep.prototype.toJSON = function toJSON () {
+ return {stepType: "removeMark", mark: this.mark.toJSON(),
+ from: this.from, to: this.to}
+ };
+
+ RemoveMarkStep.fromJSON = function fromJSON (schema, json) {
+ if (typeof json.from != "number" || typeof json.to != "number")
+ { throw new RangeError("Invalid input for RemoveMarkStep.fromJSON") }
+ return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark))
+ };
+
+ return RemoveMarkStep;
+}(Step));
+
+Step.jsonID("removeMark", RemoveMarkStep);
+
+// :: (number, number, Mark) → this
+// Add the given mark to the inline content between `from` and `to`.
+Transform.prototype.addMark = function(from, to, mark) {
+ var this$1 = this;
+
+ var removed = [], added = [], removing = null, adding = null;
+ this.doc.nodesBetween(from, to, function (node, pos, parent) {
+ if (!node.isInline) { return }
+ var marks = node.marks;
+ if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {
+ var start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);
+ var newSet = mark.addToSet(marks);
+
+ for (var i = 0; i < marks.length; i++) {
+ if (!marks[i].isInSet(newSet)) {
+ if (removing && removing.to == start && removing.mark.eq(marks[i]))
+ { removing.to = end; }
+ else
+ { removed.push(removing = new RemoveMarkStep(start, end, marks[i])); }
+ }
+ }
+
+ if (adding && adding.to == start)
+ { adding.to = end; }
+ else
+ { added.push(adding = new AddMarkStep(start, end, mark)); }
+ }
+ });
+
+ removed.forEach(function (s) { return this$1.step(s); });
+ added.forEach(function (s) { return this$1.step(s); });
+ return this
+};
+
+// :: (number, number, ?union) → this
+// Remove marks from inline nodes between `from` and `to`. When `mark`
+// is a single mark, remove precisely that mark. When it is a mark type,
+// remove all marks of that type. When it is null, remove all marks of
+// any type.
+Transform.prototype.removeMark = function(from, to, mark) {
+ var this$1 = this;
+ if ( mark === void 0 ) mark = null;
+
+ var matched = [], step = 0;
+ this.doc.nodesBetween(from, to, function (node, pos) {
+ if (!node.isInline) { return }
+ step++;
+ var toRemove = null;
+ if (mark instanceof prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["MarkType"]) {
+ var found = mark.isInSet(node.marks);
+ if (found) { toRemove = [found]; }
+ } else if (mark) {
+ if (mark.isInSet(node.marks)) { toRemove = [mark]; }
+ } else {
+ toRemove = node.marks;
+ }
+ if (toRemove && toRemove.length) {
+ var end = Math.min(pos + node.nodeSize, to);
+ for (var i = 0; i < toRemove.length; i++) {
+ var style = toRemove[i], found$1 = (void 0);
+ for (var j = 0; j < matched.length; j++) {
+ var m = matched[j];
+ if (m.step == step - 1 && style.eq(matched[j].style)) { found$1 = m; }
+ }
+ if (found$1) {
+ found$1.to = end;
+ found$1.step = step;
+ } else {
+ matched.push({style: style, from: Math.max(pos, from), to: end, step: step});
+ }
+ }
+ }
+ });
+ matched.forEach(function (m) { return this$1.step(new RemoveMarkStep(m.from, m.to, m.style)); });
+ return this
+};
+
+// :: (number, NodeType, ?ContentMatch) → this
+// Removes all marks and nodes from the content of the node at `pos`
+// that don't match the given new parent node type. Accepts an
+// optional starting [content match](#model.ContentMatch) as third
+// argument.
+Transform.prototype.clearIncompatible = function(pos, parentType, match) {
+ if ( match === void 0 ) match = parentType.contentMatch;
+
+ var node = this.doc.nodeAt(pos);
+ var delSteps = [], cur = pos + 1;
+ for (var i = 0; i < node.childCount; i++) {
+ var child = node.child(i), end = cur + child.nodeSize;
+ var allowed = match.matchType(child.type, child.attrs);
+ if (!allowed) {
+ delSteps.push(new ReplaceStep(cur, end, prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty));
+ } else {
+ match = allowed;
+ for (var j = 0; j < child.marks.length; j++) { if (!parentType.allowsMarkType(child.marks[j].type))
+ { this.step(new RemoveMarkStep(cur, end, child.marks[j])); } }
+ }
+ cur = end;
+ }
+ if (!match.validEnd) {
+ var fill = match.fillBefore(prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, true);
+ this.replace(cur, cur, new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](fill, 0, 0));
+ }
+ for (var i$1 = delSteps.length - 1; i$1 >= 0; i$1--) { this.step(delSteps[i$1]); }
+ return this
+};
+
+// :: (Node, number, ?number, ?Slice) → ?Step
+// ‘Fit’ a slice into a given position in the document, producing a
+// [step](#transform.Step) that inserts it. Will return null if
+// there's no meaningful way to insert the slice here, or inserting it
+// would be a no-op (an empty slice over an empty range).
+function replaceStep(doc, from, to, slice) {
+ if ( to === void 0 ) to = from;
+ if ( slice === void 0 ) slice = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty;
+
+ if (from == to && !slice.size) { return null }
+
+ var $from = doc.resolve(from), $to = doc.resolve(to);
+ // Optimization -- avoid work if it's obvious that it's not needed.
+ if (fitsTrivially($from, $to, slice)) { return new ReplaceStep(from, to, slice) }
+ var placed = placeSlice($from, slice);
+
+ var fittedLeft = fitLeft($from, placed);
+ var fitted = fitRight($from, $to, fittedLeft);
+ if (!fitted) { return null }
+ if (fittedLeft.size != fitted.size && canMoveText($from, $to, fittedLeft)) {
+ var d = $to.depth, after = $to.after(d);
+ while (d > 1 && after == $to.end(--d)) { ++after; }
+ var fittedAfter = fitRight($from, doc.resolve(after), fittedLeft);
+ if (fittedAfter)
+ { return new ReplaceAroundStep(from, after, to, $to.end(), fittedAfter, fittedLeft.size) }
+ }
+ return fitted.size || from != to ? new ReplaceStep(from, to, fitted) : null
+}
+
+// :: (number, ?number, ?Slice) → this
+// Replace the part of the document between `from` and `to` with the
+// given `slice`.
+Transform.prototype.replace = function(from, to, slice) {
+ if ( to === void 0 ) to = from;
+ if ( slice === void 0 ) slice = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty;
+
+ var step = replaceStep(this.doc, from, to, slice);
+ if (step) { this.step(step); }
+ return this
+};
+
+// :: (number, number, union) → this
+// Replace the given range with the given content, which may be a
+// fragment, node, or array of nodes.
+Transform.prototype.replaceWith = function(from, to, content) {
+ return this.replace(from, to, new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from(content), 0, 0))
+};
+
+// :: (number, number) → this
+// Delete the content between the given positions.
+Transform.prototype.delete = function(from, to) {
+ return this.replace(from, to, prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"].empty)
+};
+
+// :: (number, union) → this
+// Insert the given content at the given position.
+Transform.prototype.insert = function(pos, content) {
+ return this.replaceWith(pos, pos, content)
+};
+
+
+
+function fitLeftInner($from, depth, placed, placedBelow) {
+ var content = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, openEnd = 0, placedHere = placed[depth];
+ if ($from.depth > depth) {
+ var inner = fitLeftInner($from, depth + 1, placed, placedBelow || placedHere);
+ openEnd = inner.openEnd + 1;
+ content = prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from($from.node(depth + 1).copy(inner.content));
+ }
+
+ if (placedHere) {
+ content = content.append(placedHere.content);
+ openEnd = placedHere.openEnd;
+ }
+ if (placedBelow) {
+ content = content.append($from.node(depth).contentMatchAt($from.indexAfter(depth)).fillBefore(prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, true));
+ openEnd = 0;
+ }
+
+ return {content: content, openEnd: openEnd}
+}
+
+function fitLeft($from, placed) {
+ var ref = fitLeftInner($from, 0, placed, false);
+ var content = ref.content;
+ var openEnd = ref.openEnd;
+ return new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](content, $from.depth, openEnd || 0)
+}
+
+function fitRightJoin(content, parent, $from, $to, depth, openStart, openEnd) {
+ var match, count = content.childCount, matchCount = count - (openEnd > 0 ? 1 : 0);
+ var parentNode = openStart < 0 ? parent : $from.node(depth);
+ if (openStart < 0)
+ { match = parentNode.contentMatchAt(matchCount); }
+ else if (count == 1 && openEnd > 0)
+ { match = parentNode.contentMatchAt(openStart ? $from.index(depth) : $from.indexAfter(depth)); }
+ else
+ { match = parentNode.contentMatchAt($from.indexAfter(depth))
+ .matchFragment(content, count > 0 && openStart ? 1 : 0, matchCount); }
+
+ var toNode = $to.node(depth);
+ if (openEnd > 0 && depth < $to.depth) {
+ var after = toNode.content.cutByIndex($to.indexAfter(depth)).addToStart(content.lastChild);
+ var joinable$1 = match.fillBefore(after, true);
+ // Can't insert content if there's a single node stretched across this gap
+ if (joinable$1 && joinable$1.size && openStart > 0 && count == 1) { joinable$1 = null; }
+
+ if (joinable$1) {
+ var inner = fitRightJoin(content.lastChild.content, content.lastChild, $from, $to,
+ depth + 1, count == 1 ? openStart - 1 : -1, openEnd - 1);
+ if (inner) {
+ var last = content.lastChild.copy(inner);
+ if (joinable$1.size)
+ { return content.cutByIndex(0, count - 1).append(joinable$1).addToEnd(last) }
+ else
+ { return content.replaceChild(count - 1, last) }
+ }
+ }
+ }
+ if (openEnd > 0)
+ { match = match.matchType((count == 1 && openStart > 0 ? $from.node(depth + 1) : content.lastChild).type); }
+
+ // If we're here, the next level can't be joined, so we see what
+ // happens if we leave it open.
+ var toIndex = $to.index(depth);
+ if (toIndex == toNode.childCount && !toNode.type.compatibleContent(parent.type)) { return null }
+ var joinable = match.fillBefore(toNode.content, true, toIndex);
+ for (var i = toIndex; joinable && i < toNode.content.childCount; i++)
+ { if (!parentNode.type.allowsMarks(toNode.content.child(i).marks)) { joinable = null; } }
+ if (!joinable) { return null }
+
+ if (openEnd > 0) {
+ var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,
+ count == 1 ? openStart - 1 : -1);
+ content = content.replaceChild(count - 1, closed);
+ }
+ content = content.append(joinable);
+ if ($to.depth > depth)
+ { content = content.addToEnd(fitRightSeparate($to, depth + 1)); }
+ return content
+}
+
+function fitRightClosed(node, openEnd, $from, depth, openStart) {
+ var match, content = node.content, count = content.childCount;
+ if (openStart >= 0)
+ { match = $from.node(depth).contentMatchAt($from.indexAfter(depth))
+ .matchFragment(content, openStart > 0 ? 1 : 0, count); }
+ else
+ { match = node.contentMatchAt(count); }
+
+ if (openEnd > 0) {
+ var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,
+ count == 1 ? openStart - 1 : -1);
+ content = content.replaceChild(count - 1, closed);
+ }
+
+ return node.copy(content.append(match.fillBefore(prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, true)))
+}
+
+function fitRightSeparate($to, depth) {
+ var node = $to.node(depth);
+ var fill = node.contentMatchAt(0).fillBefore(node.content, true, $to.index(depth));
+ if ($to.depth > depth) { fill = fill.addToEnd(fitRightSeparate($to, depth + 1)); }
+ return node.copy(fill)
+}
+
+function normalizeSlice(content, openStart, openEnd) {
+ while (openStart > 0 && openEnd > 0 && content.childCount == 1) {
+ content = content.firstChild.content;
+ openStart--;
+ openEnd--;
+ }
+ return new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](content, openStart, openEnd)
+}
+
+// : (ResolvedPos, ResolvedPos, number, Slice) → Slice
+function fitRight($from, $to, slice) {
+ var fitted = fitRightJoin(slice.content, $from.node(0), $from, $to, 0, slice.openStart, slice.openEnd);
+ if (!fitted) { return null }
+ return normalizeSlice(fitted, slice.openStart, $to.depth)
+}
+
+function fitsTrivially($from, $to, slice) {
+ return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&
+ $from.parent.canReplace($from.index(), $to.index(), slice.content)
+}
+
+function canMoveText($from, $to, slice) {
+ if (!$to.parent.isTextblock) { return false }
+
+ var parent = slice.openEnd ? nodeRight(slice.content, slice.openEnd)
+ : $from.node($from.depth - (slice.openStart - slice.openEnd));
+ if (!parent.isTextblock) { return false }
+ for (var i = $to.index(); i < $to.parent.childCount; i++)
+ { if (!parent.type.allowsMarks($to.parent.child(i).marks)) { return false } }
+ var match;
+ if (slice.openEnd) {
+ match = parent.contentMatchAt(parent.childCount);
+ } else {
+ match = parent.contentMatchAt(parent.childCount);
+ if (slice.size) { match = match.matchFragment(slice.content, slice.openStart ? 1 : 0); }
+ }
+ match = match.matchFragment($to.parent.content, $to.index());
+ return match && match.validEnd
+}
+
+function nodeRight(content, depth) {
+ for (var i = 1; i < depth; i++) { content = content.lastChild.content; }
+ return content.lastChild
+}
+
+// Algorithm for 'placing' the elements of a slice into a gap:
+//
+// We consider the content of each node that is open to the left to be
+// independently placeable. I.e. in , when the
+// paragraph on the left is open, "foo" can be placed (somewhere on
+// the left side of the replacement gap) independently from p("bar").
+//
+// So placeSlice splits up a slice into a number of sub-slices,
+// along with information on where they can be placed on the given
+// left-side edge. It works by walking the open side of the slice,
+// from the inside out, and trying to find a landing spot for each
+// element, by simultaneously scanning over the gap side. When no
+// place is found for an open node's content, it is left in that node.
+
+// : (ResolvedPos, Slice) → [{content: Fragment, openEnd: number, depth: number}]
+function placeSlice($from, slice) {
+ var frontier = new Frontier($from);
+ for (var pass = 1; slice.size && pass <= 3; pass++) {
+ var value = frontier.placeSlice(slice.content, slice.openStart, slice.openEnd, pass);
+ if (pass == 3 && value != slice && value.size) { pass = 0; } // Restart if the 3rd pass made progress but left content
+ slice = value;
+ }
+ while (frontier.open.length) { frontier.closeNode(); }
+ return frontier.placed
+}
+
+// Helper class that models the open side of the insert position,
+// keeping track of the content match and already inserted content
+// at each depth.
+var Frontier = function Frontier($pos) {
+ // : [{parent: Node, match: ContentMatch, content: Fragment, wrapper: bool, openEnd: number, depth: number}]
+ this.open = [];
+ for (var d = 0; d <= $pos.depth; d++) {
+ var parent = $pos.node(d), match = parent.contentMatchAt($pos.indexAfter(d));
+ this.open.push({parent: parent, match: match, content: prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, wrapper: false, openEnd: 0, depth: d});
+ }
+ this.placed = [];
+};
+
+// : (Fragment, number, number, number, ?Node) → Slice
+// Tries to place the content of the given slice, and returns a
+// slice containing unplaced content.
+//
+// pass 1: try to fit directly
+// pass 2: allow wrapper nodes to be introduced
+// pass 3: allow unwrapping of nodes that aren't open
+Frontier.prototype.placeSlice = function placeSlice (fragment, openStart, openEnd, pass, parent) {
+ if (openStart > 0) {
+ var first = fragment.firstChild;
+ var inner = this.placeSlice(first.content, Math.max(0, openStart - 1),
+ openEnd && fragment.childCount == 1 ? openEnd - 1 : 0,
+ pass, first);
+ if (inner.content != first.content) {
+ if (inner.content.size) {
+ fragment = fragment.replaceChild(0, first.copy(inner.content));
+ openStart = inner.openStart + 1;
+ } else {
+ if (fragment.childCount == 1) { openEnd = 0; }
+ fragment = fragment.cutByIndex(1);
+ openStart = 0;
+ }
+ }
+ }
+ var result = this.placeContent(fragment, openStart, openEnd, pass, parent);
+ if (pass > 2 && result.size && openStart == 0) {
+ var child = result.content.firstChild, single = result.content.childCount == 1;
+ this.placeContent(child.content, 0, openEnd && single ? openEnd - 1 : 0, pass, child);
+ result = single ? prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty : new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](result.content.cutByIndex(1), 0, openEnd);
+ }
+ return result
+};
+
+Frontier.prototype.placeContent = function placeContent (fragment, openStart, openEnd, pass, parent) {
+ var i = 0;
+ // Go over the fragment's children
+ for (; i < fragment.childCount; i++) {
+ var child = fragment.child(i), placed = false, last = i == fragment.childCount - 1;
+ // Try each open node in turn, starting from the innermost
+ for (var d = this.open.length - 1; d >= 0; d--) {
+ var open = this.open[d], wrap = (void 0);
+
+ // If pass > 1, it is allowed to wrap the node to help find a
+ // fit, so if findWrapping returns something, we add open
+ // nodes to the frontier for that wrapping.
+ if (pass > 1 && (wrap = open.match.findWrapping(child.type)) &&
+ !(parent && wrap.length && wrap[wrap.length - 1] == parent.type)) {
+ while (this.open.length - 1 > d) { this.closeNode(); }
+ for (var w = 0; w < wrap.length; w++) {
+ open.match = open.match.matchType(wrap[w]);
+ d++;
+ open = {parent: wrap[w].create(),
+ match: wrap[w].contentMatch,
+ content: prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, wrapper: true, openEnd: 0, depth: d + w};
+ this.open.push(open);
+ }
+ }
+
+ // See if the child fits here
+ var match = open.match.matchType(child.type);
+ if (!match) {
+ var fill = open.match.fillBefore(prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from(child));
+ if (fill) {
+ for (var j = 0; j < fill.childCount; j++) {
+ var ch = fill.child(j);
+ this.addNode(open, ch, 0);
+ match = open.match.matchFragment(ch);
+ }
+ } else if (parent && open.match.matchType(parent.type)) {
+ // Don't continue looking further up if the parent node
+ // would fit here.
+ break
+ } else {
+ continue
+ }
+ }
+
+ // Close open nodes above this one, since we're starting to
+ // add to this.
+ while (this.open.length - 1 > d) { this.closeNode(); }
+ // Strip marks from the child or close its start when necessary
+ child = child.mark(open.parent.type.allowedMarks(child.marks));
+ if (openStart) {
+ child = closeNodeStart(child, openStart, last ? openEnd : 0);
+ openStart = 0;
+ }
+ // Add the child to this open node and adjust its metadata
+ this.addNode(open, child, last ? openEnd : 0);
+ open.match = match;
+ if (last) { openEnd = 0; }
+ placed = true;
+ break
+ }
+ // As soon as we've failed to place a node we stop looking at
+ // later nodes
+ if (!placed) { break }
+ }
+ // Close the current open node if it's not the the root and we
+ // either placed up to the end of the node or the the current
+ // slice depth's node type matches the open node's type
+ if (this.open.length > 1 &&
+ (i > 0 && i == fragment.childCount ||
+ parent && this.open[this.open.length - 1].parent.type == parent.type))
+ { this.closeNode(); }
+
+ return new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](fragment.cutByIndex(i), openStart, openEnd)
+};
+
+Frontier.prototype.addNode = function addNode (open, node, openEnd) {
+ open.content = closeFragmentEnd(open.content, open.openEnd).addToEnd(node);
+ open.openEnd = openEnd;
+};
+
+Frontier.prototype.closeNode = function closeNode () {
+ var open = this.open.pop();
+ if (open.content.size == 0) ; else if (open.wrapper) {
+ this.addNode(this.open[this.open.length - 1], open.parent.copy(open.content), open.openEnd + 1);
+ } else {
+ this.placed[open.depth] = {depth: open.depth, content: open.content, openEnd: open.openEnd};
+ }
+};
+
+function closeNodeStart(node, openStart, openEnd) {
+ var content = node.content;
+ if (openStart > 1) {
+ var first = closeNodeStart(node.firstChild, openStart - 1, node.childCount == 1 ? openEnd - 1 : 0);
+ content = node.content.replaceChild(0, first);
+ }
+ var fill = node.type.contentMatch.fillBefore(content, openEnd == 0);
+ return node.copy(fill.append(content))
+}
+
+function closeNodeEnd(node, depth) {
+ var content = node.content;
+ if (depth > 1) {
+ var last = closeNodeEnd(node.lastChild, depth - 1);
+ content = node.content.replaceChild(node.childCount - 1, last);
+ }
+ var fill = node.contentMatchAt(node.childCount).fillBefore(prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, true);
+ return node.copy(content.append(fill))
+}
+
+function closeFragmentEnd(fragment, depth) {
+ return depth ? fragment.replaceChild(fragment.childCount - 1, closeNodeEnd(fragment.lastChild, depth)) : fragment
+}
+
+// :: (number, number, Slice) → this
+// Replace a range of the document with a given slice, using `from`,
+// `to`, and the slice's [`openStart`](#model.Slice.openStart) property
+// as hints, rather than fixed start and end points. This method may
+// grow the replaced area or close open nodes in the slice in order to
+// get a fit that is more in line with WYSIWYG expectations, by
+// dropping fully covered parent nodes of the replaced region when
+// they are marked [non-defining](#model.NodeSpec.defining), or
+// including an open parent node from the slice that _is_ marked as
+// [defining](#model.NodeSpec.defining).
+//
+// This is the method, for example, to handle paste. The similar
+// [`replace`](#transform.Transform.replace) method is a more
+// primitive tool which will _not_ move the start and end of its given
+// range, and is useful in situations where you need more precise
+// control over what happens.
+Transform.prototype.replaceRange = function(from, to, slice) {
+ if (!slice.size) { return this.deleteRange(from, to) }
+
+ var $from = this.doc.resolve(from), $to = this.doc.resolve(to);
+ if (fitsTrivially($from, $to, slice))
+ { return this.step(new ReplaceStep(from, to, slice)) }
+
+ var targetDepths = coveredDepths($from, this.doc.resolve(to));
+ // Can't replace the whole document, so remove 0 if it's present
+ if (targetDepths[targetDepths.length - 1] == 0) { targetDepths.pop(); }
+ // Negative numbers represent not expansion over the whole node at
+ // that depth, but replacing from $from.before(-D) to $to.pos.
+ var preferredTarget = -($from.depth + 1);
+ targetDepths.unshift(preferredTarget);
+ // This loop picks a preferred target depth, if one of the covering
+ // depths is not outside of a defining node, and adds negative
+ // depths for any depth that has $from at its start and does not
+ // cross a defining node.
+ for (var d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {
+ var spec = $from.node(d).type.spec;
+ if (spec.defining || spec.isolating) { break }
+ if (targetDepths.indexOf(d) > -1) { preferredTarget = d; }
+ else if ($from.before(d) == pos) { targetDepths.splice(1, 0, -d); }
+ }
+ // Try to fit each possible depth of the slice into each possible
+ // target depth, starting with the preferred depths.
+ var preferredTargetIndex = targetDepths.indexOf(preferredTarget);
+
+ var leftNodes = [], preferredDepth = slice.openStart;
+ for (var content = slice.content, i = 0;; i++) {
+ var node = content.firstChild;
+ leftNodes.push(node);
+ if (i == slice.openStart) { break }
+ content = node.content;
+ }
+ // Back up if the node directly above openStart, or the node above
+ // that separated only by a non-defining textblock node, is defining.
+ if (preferredDepth > 0 && leftNodes[preferredDepth - 1].type.spec.defining &&
+ $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 1].type)
+ { preferredDepth -= 1; }
+ else if (preferredDepth >= 2 && leftNodes[preferredDepth - 1].isTextblock && leftNodes[preferredDepth - 2].type.spec.defining &&
+ $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 2].type)
+ { preferredDepth -= 2; }
+
+ for (var j = slice.openStart; j >= 0; j--) {
+ var openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);
+ var insert = leftNodes[openDepth];
+ if (!insert) { continue }
+ for (var i$1 = 0; i$1 < targetDepths.length; i$1++) {
+ // Loop over possible expansion levels, starting with the
+ // preferred one
+ var targetDepth = targetDepths[(i$1 + preferredTargetIndex) % targetDepths.length], expand = true;
+ if (targetDepth < 0) { expand = false; targetDepth = -targetDepth; }
+ var parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);
+ if (parent.canReplaceWith(index, index, insert.type, insert.marks))
+ { return this.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to,
+ new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](closeFragment(slice.content, 0, slice.openStart, openDepth),
+ openDepth, slice.openEnd)) }
+ }
+ }
+
+ var startSteps = this.steps.length;
+ for (var i$2 = targetDepths.length - 1; i$2 >= 0; i$2--) {
+ this.replace(from, to, slice);
+ if (this.steps.length > startSteps) { break }
+ var depth = targetDepths[i$2];
+ if (i$2 < 0) { continue }
+ from = $from.before(depth); to = $to.after(depth);
+ }
+ return this
+};
+
+function closeFragment(fragment, depth, oldOpen, newOpen, parent) {
+ if (depth < oldOpen) {
+ var first = fragment.firstChild;
+ fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));
+ }
+ if (depth > newOpen) {
+ var match = parent.contentMatchAt(0);
+ var start = match.fillBefore(fragment).append(fragment);
+ fragment = start.append(match.matchFragment(start).fillBefore(prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].empty, true));
+ }
+ return fragment
+}
+
+// :: (number, number, Node) → this
+// Replace the given range with a node, but use `from` and `to` as
+// hints, rather than precise positions. When from and to are the same
+// and are at the start or end of a parent node in which the given
+// node doesn't fit, this method may _move_ them out towards a parent
+// that does allow the given node to be placed. When the given range
+// completely covers a parent node, this method may completely replace
+// that parent node.
+Transform.prototype.replaceRangeWith = function(from, to, node) {
+ if (!node.isInline && from == to && this.doc.resolve(from).parent.content.size) {
+ var point = insertPoint(this.doc, from, node.type);
+ if (point != null) { from = to = point; }
+ }
+ return this.replaceRange(from, to, new prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Slice"](prosemirror_model__WEBPACK_IMPORTED_MODULE_0__["Fragment"].from(node), 0, 0))
+};
+
+// :: (number, number) → this
+// Delete the given range, expanding it to cover fully covered
+// parent nodes until a valid replace is found.
+Transform.prototype.deleteRange = function(from, to) {
+ var $from = this.doc.resolve(from), $to = this.doc.resolve(to);
+ var covered = coveredDepths($from, $to);
+ for (var i = 0; i < covered.length; i++) {
+ var depth = covered[i], last = i == covered.length - 1;
+ if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)
+ { return this.delete($from.start(depth), $to.end(depth)) }
+ if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))
+ { return this.delete($from.before(depth), $to.after(depth)) }
+ }
+ for (var d = 1; d <= $from.depth && d <= $to.depth; d++) {
+ if (from - $from.start(d) == $from.depth - d && to > $from.end(d) && $to.end(d) - to != $to.depth - d)
+ { return this.delete($from.before(d), to) }
+ }
+ return this.delete(from, to)
+};
+
+// : (ResolvedPos, ResolvedPos) → [number]
+// Returns an array of all depths for which $from - $to spans the
+// whole content of the nodes at that depth.
+function coveredDepths($from, $to) {
+ var result = [], minDepth = Math.min($from.depth, $to.depth);
+ for (var d = minDepth; d >= 0; d--) {
+ var start = $from.start(d);
+ if (start < $from.pos - ($from.depth - d) ||
+ $to.end(d) > $to.pos + ($to.depth - d) ||
+ $from.node(d).type.spec.isolating ||
+ $to.node(d).type.spec.isolating) { break }
+ if (start == $to.start(d)) { result.push(d); }
+ }
+ return result
+}
+
+
+//# sourceMappingURL=index.es.js.map
+
+
+/***/ }),
+
+/***/ "./node_modules/prosemirror-utils/dist/index.js":
+/*!******************************************************!*\
+ !*** ./node_modules/prosemirror-utils/dist/index.js ***!
+ \******************************************************/
+/*! no static exports found */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var prosemirrorState = __webpack_require__(/*! prosemirror-state */ "./node_modules/prosemirror-state/dist/index.es.js");
+var prosemirrorModel = __webpack_require__(/*! prosemirror-model */ "./node_modules/prosemirror-model/dist/index.es.js");
+var prosemirrorTables = __webpack_require__(/*! prosemirror-tables */ "./node_modules/prosemirror-tables/dist/index.es.js");
+
+// :: (nodeType: union) → (tr: Transaction) → Transaction
+// Returns a new transaction that removes a node of a given `nodeType`. It will return an original transaction if parent node hasn't been found.
+//
+// ```javascript
+// dispatch(
+// removeParentNodeOfType(schema.nodes.table)(tr)
+// );
+// ```
+var removeParentNodeOfType = function removeParentNodeOfType(nodeType) {
+ return function (tr) {
+ var parent = findParentNodeOfType(nodeType)(tr.selection);
+ if (parent) {
+ return removeNodeAtPos(parent.pos)(tr);
+ }
+ return tr;
+ };
+};
+
+// :: (nodeType: union, content: union) → (tr: Transaction) → Transaction
+// Returns a new transaction that replaces parent node of a given `nodeType` with the given `content`. It will return an original transaction if either parent node hasn't been found or replacing is not possible.
+//
+// ```javascript
+// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));
+//
+// dispatch(
+// replaceParentNodeOfType(schema.nodes.table, node)(tr)
+// );
+// ```
+var replaceParentNodeOfType = function replaceParentNodeOfType(nodeType, content) {
+ return function (tr) {
+ if (!Array.isArray(nodeType)) {
+ nodeType = [nodeType];
+ }
+ for (var i = 0, count = nodeType.length; i < count; i++) {
+ var parent = findParentNodeOfType(nodeType[i])(tr.selection);
+ if (parent) {
+ var newTr = replaceNodeAtPos(parent.pos, content)(tr);
+ if (newTr !== tr) {
+ return newTr;
+ }
+ }
+ }
+ return tr;
+ };
+};
+
+// :: (tr: Transaction) → Transaction
+// Returns a new transaction that removes selected node. It will return an original transaction if current selection is not a `NodeSelection`.
+//
+// ```javascript
+// dispatch(
+// removeSelectedNode(tr)
+// );
+// ```
+var removeSelectedNode = function removeSelectedNode(tr) {
+ if (isNodeSelection(tr.selection)) {
+ var from = tr.selection.$from.pos;
+ var to = tr.selection.$to.pos;
+ return cloneTr(tr.delete(from, to));
+ }
+ return tr;
+};
+
+// :: (content: union) → (tr: Transaction) → Transaction
+// Returns a new transaction that replaces selected node with a given `node`, keeping NodeSelection on the new `node`.
+// It will return the original transaction if either current selection is not a NodeSelection or replacing is not possible.
+//
+// ```javascript
+// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));
+// dispatch(
+// replaceSelectedNode(node)(tr)
+// );
+// ```
+var replaceSelectedNode = function replaceSelectedNode(content) {
+ return function (tr) {
+ if (isNodeSelection(tr.selection)) {
+ var _tr$selection = tr.selection,
+ $from = _tr$selection.$from,
+ $to = _tr$selection.$to;
+
+ if (content instanceof prosemirrorModel.Fragment && $from.parent.canReplace($from.index(), $from.indexAfter(), content) || $from.parent.canReplaceWith($from.index(), $from.indexAfter(), content.type)) {
+ return cloneTr(tr.replaceWith($from.pos, $to.pos, content)
+ // restore node selection
+ .setSelection(new prosemirrorState.NodeSelection(tr.doc.resolve($from.pos))));
+ }
+ }
+ return tr;
+ };
+};
+
+// :: (position: number, dir: ?number) → (tr: Transaction) → Transaction
+// Returns a new transaction that tries to find a valid cursor selection starting at the given `position`
+// and searching back if `dir` is negative, and forward if positive.
+// If a valid cursor position hasn't been found, it will return the original transaction.
+//
+// ```javascript
+// dispatch(
+// setTextSelection(5)(tr)
+// );
+// ```
+var setTextSelection = function setTextSelection(position) {
+ var dir = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
+ return function (tr) {
+ var nextSelection = prosemirrorState.Selection.findFrom(tr.doc.resolve(position), dir, true);
+ if (nextSelection) {
+ return tr.setSelection(nextSelection);
+ }
+ return tr;
+ };
+};
+
+var isSelectableNode = function isSelectableNode(node) {
+ return node.type && node.type.spec.selectable;
+};
+var shouldSelectNode = function shouldSelectNode(node) {
+ return isSelectableNode(node) && node.type.isLeaf;
+};
+
+var setSelection = function setSelection(node, pos, tr) {
+ if (shouldSelectNode(node)) {
+ return tr.setSelection(new prosemirrorState.NodeSelection(tr.doc.resolve(pos)));
+ }
+ return setTextSelection(pos)(tr);
+};
+
+// :: (content: union, position: ?number, tryToReplace?: boolean) → (tr: Transaction) → Transaction
+// Returns a new transaction that inserts a given `content` at the current cursor position, or at a given `position`, if it is allowed by schema. If schema restricts such nesting, it will try to find an appropriate place for a given node in the document, looping through parent nodes up until the root document node.
+// If `tryToReplace` is true and current selection is a NodeSelection, it will replace selected node with inserted content if its allowed by schema.
+// If cursor is inside of an empty paragraph, it will try to replace that paragraph with the given content. If insertion is successful and inserted node has content, it will set cursor inside of that content.
+// It will return an original transaction if the place for insertion hasn't been found.
+//
+// ```javascript
+// const node = schema.nodes.extension.createChecked({});
+// dispatch(
+// safeInsert(node)(tr)
+// );
+// ```
+var safeInsert = function safeInsert(content, position, tryToReplace) {
+ return function (tr) {
+ var hasPosition = typeof position === 'number';
+ var $from = tr.selection.$from;
+
+ var $insertPos = hasPosition ? tr.doc.resolve(position) : isNodeSelection(tr.selection) ? tr.doc.resolve($from.pos + 1) : $from;
+ var parent = $insertPos.parent;
+
+ // try to replace selected node
+
+ if (isNodeSelection(tr.selection) && tryToReplace) {
+ var oldTr = tr;
+ tr = replaceSelectedNode(content)(tr);
+ if (oldTr !== tr) {
+ return tr;
+ }
+ }
+
+ // try to replace an empty paragraph
+ if (isEmptyParagraph(parent)) {
+ var _oldTr = tr;
+ tr = replaceParentNodeOfType(parent.type, content)(tr);
+ if (_oldTr !== tr) {
+ var pos = isSelectableNode(content) ? // for selectable node, selection position would be the position of the replaced parent
+ $insertPos.before($insertPos.depth) : $insertPos.pos;
+ return setSelection(content, pos, tr);
+ }
+ }
+
+ // given node is allowed at the current cursor position
+ if (canInsert($insertPos, content)) {
+ tr.insert($insertPos.pos, content);
+ var _pos = hasPosition ? $insertPos.pos : isSelectableNode(content) ? // for atom nodes selection position after insertion is the previous pos
+ tr.selection.$anchor.pos - 1 : tr.selection.$anchor.pos;
+ return cloneTr(setSelection(content, _pos, tr));
+ }
+
+ // looking for a place in the doc where the node is allowed
+ for (var i = $insertPos.depth; i > 0; i--) {
+ var _pos2 = $insertPos.after(i);
+ var $pos = tr.doc.resolve(_pos2);
+ if (canInsert($pos, content)) {
+ tr.insert(_pos2, content);
+ return cloneTr(setSelection(content, _pos2, tr));
+ }
+ }
+ return tr;
+ };
+};
+
+// :: (nodeType: union, type: ?union, attrs: ?union, marks?: [Mark]) → (tr: Transaction) → Transaction
+// Returns a transaction that changes the type, attributes, and/or marks of the parent node of a given `nodeType`.
+//
+// ```javascript
+// const node = schema.nodes.extension.createChecked({});
+// dispatch(
+// setParentNodeMarkup(schema.nodes.panel, null, { panelType })(tr);
+// );
+// ```
+var setParentNodeMarkup = function setParentNodeMarkup(nodeType, type, attrs, marks) {
+ return function (tr) {
+ var parent = findParentNodeOfType(nodeType)(tr.selection);
+ if (parent) {
+ return cloneTr(tr.setNodeMarkup(parent.pos, type, Object.assign({}, parent.node.attrs, attrs), marks));
+ }
+ return tr;
+ };
+};
+
+// :: (nodeType: union) → (tr: Transaction) → Transaction
+// Returns a new transaction that sets a `NodeSelection` on a parent node of a `given nodeType`.
+//
+// ```javascript
+// dispatch(
+// selectParentNodeOfType([tableCell, tableHeader])(state.tr)
+// );
+// ```
+var selectParentNodeOfType = function selectParentNodeOfType(nodeType) {
+ return function (tr) {
+ if (!isNodeSelection(tr.selection)) {
+ var parent = findParentNodeOfType(nodeType)(tr.selection);
+ if (parent) {
+ return cloneTr(tr.setSelection(prosemirrorState.NodeSelection.create(tr.doc, parent.pos)));
+ }
+ }
+ return tr;
+ };
+};
+
+// :: (tr: Transaction) → Transaction
+// Returns a new transaction that deletes previous node.
+//
+// ```javascript
+// dispatch(
+// removeNodeBefore(state.tr)
+// );
+// ```
+var removeNodeBefore = function removeNodeBefore(tr) {
+ var position = findPositionOfNodeBefore(tr.selection);
+ if (typeof position === 'number') {
+ return removeNodeAtPos(position)(tr);
+ }
+ return tr;
+};
+
+// :: (selection: Selection) → boolean
+// Checks if current selection is a `NodeSelection`.
+//
+// ```javascript
+// if (isNodeSelection(tr.selection)) {
+// // ...
+// }
+// ```
+var isNodeSelection = function isNodeSelection(selection) {
+ return selection instanceof prosemirrorState.NodeSelection;
+};
+
+// (nodeType: union) → boolean
+// Checks if the type a given `node` equals to a given `nodeType`.
+var equalNodeType = function equalNodeType(nodeType, node) {
+ return Array.isArray(nodeType) && nodeType.indexOf(node.type) > -1 || node.type === nodeType;
+};
+
+// (tr: Transaction) → Transaction
+// Creates a new transaction object from a given transaction
+var cloneTr = function cloneTr(tr) {
+ return Object.assign(Object.create(tr), tr).setTime(Date.now());
+};
+
+// (position: number, content: union) → (tr: Transaction) → Transaction
+// Returns a `replace` transaction that replaces a node at a given position with the given `content`.
+// It will return the original transaction if replacing is not possible.
+// `position` should point at the position immediately before the node.
+var replaceNodeAtPos = function replaceNodeAtPos(position, content) {
+ return function (tr) {
+ var node = tr.doc.nodeAt(position);
+ var $pos = tr.doc.resolve(position);
+ if (canReplace($pos, content)) {
+ tr = tr.replaceWith(position, position + node.nodeSize, content);
+ var start = tr.selection.$from.pos - 1;
+ // put cursor inside of the inserted node
+ tr = setTextSelection(Math.max(start, 0), -1)(tr);
+ // move cursor to the start of the node
+ tr = setTextSelection(tr.selection.$from.start())(tr);
+ return cloneTr(tr);
+ }
+ return tr;
+ };
+};
+
+// ($pos: ResolvedPos, doc: ProseMirrorNode, content: union, ) → boolean
+// Checks if replacing a node at a given `$pos` inside of the `doc` node with the given `content` is possible.
+var canReplace = function canReplace($pos, content) {
+ var node = $pos.node($pos.depth);
+ return node && node.type.validContent(content instanceof prosemirrorModel.Fragment ? content : prosemirrorModel.Fragment.from(content));
+};
+
+// (position: number) → (tr: Transaction) → Transaction
+// Returns a `delete` transaction that removes a node at a given position with the given `node`.
+// `position` should point at the position immediately before the node.
+var removeNodeAtPos = function removeNodeAtPos(position) {
+ return function (tr) {
+ var node = tr.doc.nodeAt(position);
+ return cloneTr(tr.delete(position, position + node.nodeSize));
+ };
+};
+
+// (schema: Schema) → {[key: string]: NodeType}
+// Returns a map where keys are tableRoles and values are NodeTypes.
+var tableNodeTypes = function tableNodeTypes(schema) {
+ if (schema.cached.tableNodeTypes) {
+ return schema.cached.tableNodeTypes;
+ }
+ var roles = {};
+ Object.keys(schema.nodes).forEach(function (type) {
+ var nodeType = schema.nodes[type];
+ if (nodeType.spec.tableRole) {
+ roles[nodeType.spec.tableRole] = nodeType;
+ }
+ });
+ schema.cached.tableNodeTypes = roles;
+ return roles;
+};
+
+// :: ($pos: ResolvedPos, content: union) → boolean
+// Checks if a given `content` can be inserted at the given `$pos`
+//
+// ```javascript
+// const { selection: { $from } } = state;
+// const node = state.schema.nodes.atom.createChecked();
+// if (canInsert($from, node)) {
+// // ...
+// }
+// ```
+var canInsert = function canInsert($pos, content) {
+ var index = $pos.index();
+
+ if (content instanceof prosemirrorModel.Fragment) {
+ return $pos.parent.canReplace(index, index, content);
+ } else if (content instanceof prosemirrorModel.Node) {
+ return $pos.parent.canReplaceWith(index, index, content.type);
+ }
+ return false;
+};
+
+// (node: ProseMirrorNode) → boolean
+// Checks if a given `node` is an empty paragraph
+var isEmptyParagraph = function isEmptyParagraph(node) {
+ return !node || node.type.name === 'paragraph' && node.nodeSize === 2;
+};
+
+// ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}
+// Iterates over parent nodes, returning a table node closest to a given `$pos`.
+//
+// ```javascript
+// const table = findTableClosestToPos(state.doc.resolve(10));
+// ```
+var findTableClosestToPos = function findTableClosestToPos($pos) {
+ var predicate = function predicate(node) {
+ return node.type.spec.tableRole && /table/i.test(node.type.spec.tableRole);
+ };
+ return findParentNodeClosestToPos($pos, predicate);
+};
+
+var createCell = function createCell(cellType) {
+ var cellContent = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
+
+ if (cellContent) {
+ return cellType.createChecked(null, cellContent);
+ }
+
+ return cellType.createAndFill();
+};
+
+// (rect: {left: number, right: number, top: number, bottom: number}) → (selection: Selection) → boolean
+// Checks if a given CellSelection rect is selected
+var isRectSelected = function isRectSelected(rect) {
+ return function (selection) {
+ var map = prosemirrorTables.TableMap.get(selection.$anchorCell.node(-1));
+ var start = selection.$anchorCell.start(-1);
+ var cells = map.cellsInRect(rect);
+ var selectedCells = map.cellsInRect(map.rectBetween(selection.$anchorCell.pos - start, selection.$headCell.pos - start));
+
+ for (var i = 0, count = cells.length; i < count; i++) {
+ if (selectedCells.indexOf(cells[i]) === -1) {
+ return false;
+ }
+ }
+
+ return true;
+ };
+};
+
+// This function transposes an array of array flipping the columns for rows,
+// transposition is a familiar algebra concept;
+// you can get more details here:
+// https://en.wikipedia.org/wiki/Transpose
+//
+// ```javascript
+//
+// const arr = [
+// ['a1', 'a2', 'a3'],
+// ['b1', 'b2', 'b3'],
+// ['c1', 'c2', 'c3'],
+// ['d1', 'd2', 'd3'],
+// ];
+//
+// const result = transpose(arr);
+//
+// result === [
+// ['a1', 'b1', 'c1', 'd1'],
+// ['a2', 'b2', 'c2', 'd2'],
+// ['a3', 'b3', 'c3', 'd3'],
+// ]
+// ```
+var transpose = function transpose(array) {
+ return array[0].map(function (_, i) {
+ return array.map(function (column) {
+ return column[i];
+ });
+ });
+};
+
+// :: (tableNode: Node) -> Array
+// This function will transform the table node
+// into a matrix of rows and columns respecting merged cells,
+// for example this table will be convert to the below:
+//
+// ```
+// ____________________________
+// | | | |
+// | A1 | B1 | C1 |
+// |______|______|______ ______|
+// | | | |
+// | A2 | B2 | |
+// |______|______ ______| |
+// | | | | D1 |
+// | A3 | B3 | C2 | |
+// |______|______|______|______|
+// ```
+//
+//
+// ```javascript
+// array = [
+// [A1, B1, C1, null],
+// [A2, B2, null, D1],
+// [A3. B3, C2, null],
+// ]
+// ```
+var convertTableNodeToArrayOfRows = function convertTableNodeToArrayOfRows(tableNode) {
+ var map = prosemirrorTables.TableMap.get(tableNode);
+ var rows = [];
+ for (var rowIndex = 0; rowIndex < map.height; rowIndex++) {
+ var rowCells = [];
+ var seen = {};
+
+ for (var colIndex = 0; colIndex < map.width; colIndex++) {
+ var cellPos = map.map[rowIndex * map.width + colIndex];
+ var cell = tableNode.nodeAt(cellPos);
+ var rect = map.findCell(cellPos);
+ if (seen[cellPos] || rect.top !== rowIndex) {
+ rowCells.push(null);
+ continue;
+ }
+ seen[cellPos] = true;
+
+ rowCells.push(cell);
+ }
+
+ rows.push(rowCells);
+ }
+
+ return rows;
+};
+
+// :: (tableNode: Node, tableArray: Array) -> Node
+// This function will transform a matrix of nodes
+// into table node respecting merged cells and rows configurations,
+// for example this array will be convert to the table below:
+//
+// ```javascript
+// array = [
+// [A1, B1, C1, null],
+// [A2, B2, null, D1],
+// [A3. B3, C2, null],
+// ]
+// ```
+//
+// ```
+// ____________________________
+// | | | |
+// | A1 | B1 | C1 |
+// |______|______|______ ______|
+// | | | |
+// | A2 | B2 | |
+// |______|______ ______| |
+// | | | | D1 |
+// | A3 | B3 | C2 | |
+// |______|______|______|______|
+// ```
+//
+var convertArrayOfRowsToTableNode = function convertArrayOfRowsToTableNode(tableNode, arrayOfNodes) {
+ var rowsPM = [];
+ var map = prosemirrorTables.TableMap.get(tableNode);
+ for (var rowIndex = 0; rowIndex < map.height; rowIndex++) {
+ var row = tableNode.child(rowIndex);
+ var rowCells = [];
+
+ for (var colIndex = 0; colIndex < map.width; colIndex++) {
+ if (!arrayOfNodes[rowIndex][colIndex]) {
+ continue;
+ }
+ var cellPos = map.map[rowIndex * map.width + colIndex];
+
+ var cell = arrayOfNodes[rowIndex][colIndex];
+ var oldCell = tableNode.nodeAt(cellPos);
+ var newCell = oldCell.type.createChecked(Object.assign({}, cell.attrs), cell.content, cell.marks);
+ rowCells.push(newCell);
+ }
+
+ rowsPM.push(row.type.createChecked(row.attrs, rowCells, row.marks));
+ }
+
+ var newTable = tableNode.type.createChecked(tableNode.attrs, rowsPM, tableNode.marks);
+
+ return newTable;
+};
+
+var moveTableColumn = function moveTableColumn(table, indexesOrigin, indexesTarget, direction) {
+ var rows = transpose(convertTableNodeToArrayOfRows(table.node));
+
+ rows = moveRowInArrayOfRows(rows, indexesOrigin, indexesTarget, direction);
+ rows = transpose(rows);
+
+ return convertArrayOfRowsToTableNode(table.node, rows);
+};
+
+var moveTableRow = function moveTableRow(table, indexesOrigin, indexesTarget, direction) {
+ var rows = convertTableNodeToArrayOfRows(table.node);
+
+ rows = moveRowInArrayOfRows(rows, indexesOrigin, indexesTarget, direction);
+
+ return convertArrayOfRowsToTableNode(table.node, rows);
+};
+
+var moveRowInArrayOfRows = function moveRowInArrayOfRows(rows, indexesOrigin, indexesTarget, directionOverride) {
+ var direction = indexesOrigin[0] > indexesTarget[0] ? -1 : 1;
+
+ var rowsExtracted = rows.splice(indexesOrigin[0], indexesOrigin.length);
+ var positionOffset = rowsExtracted.length % 2 === 0 ? 1 : 0;
+ var target = void 0;
+
+ if (directionOverride === -1 && direction === 1) {
+ target = indexesTarget[0] - 1;
+ } else if (directionOverride === 1 && direction === -1) {
+ target = indexesTarget[indexesTarget.length - 1] - positionOffset + 1;
+ } else {
+ target = direction === -1 ? indexesTarget[0] : indexesTarget[indexesTarget.length - 1] - positionOffset;
+ }
+
+ rows.splice.apply(rows, [target, 0].concat(rowsExtracted));
+ return rows;
+};
+
+var checkInvalidMovements = function checkInvalidMovements(originIndex, targetIndex, targets, type) {
+ var direction = originIndex > targetIndex ? -1 : 1;
+ var errorMessage = 'Target position is invalid, you can\'t move the ' + type + ' ' + originIndex + ' to ' + targetIndex + ', the target can\'t be split. You could use tryToFit option.';
+
+ if (direction === 1) {
+ if (targets.slice(0, targets.length - 1).indexOf(targetIndex) !== -1) {
+ throw new Error(errorMessage);
+ }
+ } else {
+ if (targets.slice(1).indexOf(targetIndex) !== -1) {
+ throw new Error(errorMessage);
+ }
+ }
+
+ return true;
+};
+
+// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → ?{pos: number, start: number, depth: number, node: ProseMirrorNode}
+// Iterates over parent nodes, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.
+//
+// ```javascript
+// const predicate = node => node.type === schema.nodes.blockquote;
+// const parent = findParentNode(predicate)(selection);
+// ```
+var findParentNode = function findParentNode(predicate) {
+ return function (_ref) {
+ var $from = _ref.$from;
+ return findParentNodeClosestToPos($from, predicate);
+ };
+};
+
+// :: ($pos: ResolvedPos, predicate: (node: ProseMirrorNode) → boolean) → ?{pos: number, start: number, depth: number, node: ProseMirrorNode}
+// Iterates over parent nodes starting from the given `$pos`, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.
+//
+// ```javascript
+// const predicate = node => node.type === schema.nodes.blockquote;
+// const parent = findParentNodeClosestToPos(state.doc.resolve(5), predicate);
+// ```
+var findParentNodeClosestToPos = function findParentNodeClosestToPos($pos, predicate) {
+ for (var i = $pos.depth; i > 0; i--) {
+ var node = $pos.node(i);
+ if (predicate(node)) {
+ return {
+ pos: i > 0 ? $pos.before(i) : 0,
+ start: $pos.start(i),
+ depth: i,
+ node: node
+ };
+ }
+ }
+};
+
+// :: (predicate: (node: ProseMirrorNode) → boolean, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node
+// Iterates over parent nodes, returning DOM reference of the closest node `predicate` returns truthy for.
+//
+// ```javascript
+// const domAtPos = view.domAtPos.bind(view);
+// const predicate = node => node.type === schema.nodes.table;
+// const parent = findParentDomRef(predicate, domAtPos)(selection); //