12767 lines
514 KiB
Plaintext
12767 lines
514 KiB
Plaintext
(function webpackUniversalModuleDefinition(root, factory) {
|
||
if(typeof exports === 'object' && typeof module === 'object')
|
||
module.exports = factory(require("react"), require("react/jsx-runtime"), require("@codemirror/state"), require("@codemirror/theme-one-dark"), require("@codemirror/view"));
|
||
else if(typeof define === 'function' && define.amd)
|
||
define(["react", "react/jsx-runtime", , , ], factory);
|
||
else if(typeof exports === 'object')
|
||
exports["@uiw/codemirror"] = factory(require("react"), require("react/jsx-runtime"), require("@codemirror/state"), require("@codemirror/theme-one-dark"), require("@codemirror/view"));
|
||
else
|
||
root["@uiw/codemirror"] = factory(root["React"], root["ReactJSXRuntime"], root["CM"]["@codemirror/state"], root["CM"]["@codemirror/theme-one-dark"], root["CM"]["@codemirror/view"]);
|
||
})(self, (__WEBPACK_EXTERNAL_MODULE__442__, __WEBPACK_EXTERNAL_MODULE__742__, __WEBPACK_EXTERNAL_MODULE__60__, __WEBPACK_EXTERNAL_MODULE__708__, __WEBPACK_EXTERNAL_MODULE__730__) => {
|
||
return /******/ (() => { // webpackBootstrap
|
||
/******/ "use strict";
|
||
/******/ var __webpack_modules__ = ({
|
||
|
||
/***/ 60:
|
||
/***/ ((module) => {
|
||
|
||
module.exports = __WEBPACK_EXTERNAL_MODULE__60__;
|
||
|
||
/***/ }),
|
||
|
||
/***/ 89:
|
||
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
|
||
|
||
__webpack_require__.r(__webpack_exports__);
|
||
/* harmony export */ __webpack_require__.d(__webpack_exports__, {
|
||
/* harmony export */ defaultLightThemeOption: () => (/* reexport safe */ _theme_light__WEBPACK_IMPORTED_MODULE_5__.c),
|
||
/* harmony export */ getDefaultExtensions: () => (/* binding */ getDefaultExtensions)
|
||
/* harmony export */ });
|
||
/* harmony import */ var _codemirror_commands__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(720);
|
||
/* harmony import */ var _uiw_codemirror_extensions_basic_setup__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(687);
|
||
/* harmony import */ var _codemirror_view__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(730);
|
||
/* harmony import */ var _codemirror_view__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(_codemirror_view__WEBPACK_IMPORTED_MODULE_2__);
|
||
/* harmony import */ var _codemirror_theme_one_dark__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(708);
|
||
/* harmony import */ var _codemirror_theme_one_dark__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(_codemirror_theme_one_dark__WEBPACK_IMPORTED_MODULE_3__);
|
||
/* harmony import */ var _codemirror_state__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(60);
|
||
/* harmony import */ var _codemirror_state__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(_codemirror_state__WEBPACK_IMPORTED_MODULE_4__);
|
||
/* harmony import */ var _theme_light__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(806);
|
||
/* harmony reexport (unknown) */ var __WEBPACK_REEXPORT_OBJECT__ = {};
|
||
/* harmony reexport (unknown) */ for(const __WEBPACK_IMPORT_KEY__ in _codemirror_theme_one_dark__WEBPACK_IMPORTED_MODULE_3__) if(["default","getDefaultExtensions"].indexOf(__WEBPACK_IMPORT_KEY__) < 0) __WEBPACK_REEXPORT_OBJECT__[__WEBPACK_IMPORT_KEY__] = () => _codemirror_theme_one_dark__WEBPACK_IMPORTED_MODULE_3__[__WEBPACK_IMPORT_KEY__]
|
||
/* harmony reexport (unknown) */ __webpack_require__.d(__webpack_exports__, __WEBPACK_REEXPORT_OBJECT__);
|
||
var getDefaultExtensions=function getDefaultExtensions(){var optios=arguments.length>0&&arguments[0]!==undefined?arguments[0]:{};var _optios$indentWithTab=optios.indentWithTab,defaultIndentWithTab=_optios$indentWithTab===void 0?true:_optios$indentWithTab,_optios$editable=optios.editable,editable=_optios$editable===void 0?true:_optios$editable,_optios$readOnly=optios.readOnly,readOnly=_optios$readOnly===void 0?false:_optios$readOnly,_optios$theme=optios.theme,theme=_optios$theme===void 0?'light':_optios$theme,_optios$placeholder=optios.placeholder,placeholderStr=_optios$placeholder===void 0?'':_optios$placeholder,_optios$basicSetup=optios.basicSetup,defaultBasicSetup=_optios$basicSetup===void 0?true:_optios$basicSetup;var getExtensions=[];if(defaultIndentWithTab){getExtensions.unshift(_codemirror_view__WEBPACK_IMPORTED_MODULE_2__.keymap.of([_codemirror_commands__WEBPACK_IMPORTED_MODULE_0__/* .indentWithTab */ .Yc]));}if(defaultBasicSetup){if(typeof defaultBasicSetup==='boolean'){getExtensions.unshift((0,_uiw_codemirror_extensions_basic_setup__WEBPACK_IMPORTED_MODULE_1__/* .basicSetup */ .o)());}else{getExtensions.unshift((0,_uiw_codemirror_extensions_basic_setup__WEBPACK_IMPORTED_MODULE_1__/* .basicSetup */ .o)(defaultBasicSetup));}}if(placeholderStr){getExtensions.unshift((0,_codemirror_view__WEBPACK_IMPORTED_MODULE_2__.placeholder)(placeholderStr));}switch(theme){case'light':getExtensions.push(_theme_light__WEBPACK_IMPORTED_MODULE_5__/* .defaultLightThemeOption */ .c);break;case'dark':getExtensions.push(_codemirror_theme_one_dark__WEBPACK_IMPORTED_MODULE_3__.oneDark);break;case'none':break;default:getExtensions.push(theme);break;}if(editable===false){getExtensions.push(_codemirror_view__WEBPACK_IMPORTED_MODULE_2__.EditorView.editable.of(false));}if(readOnly){getExtensions.push(_codemirror_state__WEBPACK_IMPORTED_MODULE_4__.EditorState.readOnly.of(true));}return[].concat(getExtensions);};
|
||
|
||
/***/ }),
|
||
|
||
/***/ 194:
|
||
/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
|
||
|
||
|
||
// EXPORTS
|
||
__webpack_require__.d(__webpack_exports__, {
|
||
KB: () => (/* binding */ IndentContext),
|
||
SG: () => (/* binding */ bracketMatching),
|
||
Zt: () => (/* binding */ defaultHighlightStyle),
|
||
Lv: () => (/* binding */ foldGutter),
|
||
f7: () => (/* binding */ foldKeymap),
|
||
tp: () => (/* binding */ getIndentUnit),
|
||
_v: () => (/* binding */ getIndentation),
|
||
WD: () => (/* binding */ indentOnInput),
|
||
EI: () => (/* binding */ indentString),
|
||
Xt: () => (/* binding */ indentUnit),
|
||
jU: () => (/* binding */ matchBrackets),
|
||
y9: () => (/* binding */ syntaxHighlighting),
|
||
mv: () => (/* binding */ syntaxTree)
|
||
});
|
||
|
||
// UNUSED EXPORTS: DocInput, HighlightStyle, LRLanguage, Language, LanguageDescription, LanguageSupport, ParseContext, StreamLanguage, StringStream, TreeIndentContext, bidiIsolates, bracketMatchingHandle, codeFolding, continuedIndent, defineLanguageFacet, delimitedIndent, ensureSyntaxTree, flatIndent, foldAll, foldCode, foldEffect, foldInside, foldNodeProp, foldService, foldState, foldable, foldedRanges, forceParsing, highlightingFor, indentNodeProp, indentRange, indentService, language, languageDataProp, sublanguageProp, syntaxParserRunning, syntaxTreeAvailable, toggleFold, unfoldAll, unfoldCode, unfoldEffect
|
||
|
||
// EXTERNAL MODULE: ../node_modules/@lezer/common/dist/index.js
|
||
var dist = __webpack_require__(203);
|
||
// EXTERNAL MODULE: external {"root":["CM","@codemirror/state"],"commonjs":"@codemirror/state","commonjs2":"@codemirror/state"}
|
||
var state_ = __webpack_require__(60);
|
||
// EXTERNAL MODULE: external {"root":["CM","@codemirror/view"],"commonjs":"@codemirror/view","commonjs2":"@codemirror/view"}
|
||
var view_ = __webpack_require__(730);
|
||
;// ../node_modules/@lezer/highlight/dist/index.js
|
||
|
||
|
||
let nextTagID = 0;
|
||
/**
|
||
Highlighting tags are markers that denote a highlighting category.
|
||
They are [associated](#highlight.styleTags) with parts of a syntax
|
||
tree by a language mode, and then mapped to an actual CSS style by
|
||
a [highlighter](#highlight.Highlighter).
|
||
|
||
Because syntax tree node types and highlight styles have to be
|
||
able to talk the same language, CodeMirror uses a mostly _closed_
|
||
[vocabulary](#highlight.tags) of syntax tags (as opposed to
|
||
traditional open string-based systems, which make it hard for
|
||
highlighting themes to cover all the tokens produced by the
|
||
various languages).
|
||
|
||
It _is_ possible to [define](#highlight.Tag^define) your own
|
||
highlighting tags for system-internal use (where you control both
|
||
the language package and the highlighter), but such tags will not
|
||
be picked up by regular highlighters (though you can derive them
|
||
from standard tags to allow highlighters to fall back to those).
|
||
*/
|
||
class Tag {
|
||
/**
|
||
@internal
|
||
*/
|
||
constructor(
|
||
/**
|
||
The optional name of the base tag @internal
|
||
*/
|
||
name,
|
||
/**
|
||
The set of this tag and all its parent tags, starting with
|
||
this one itself and sorted in order of decreasing specificity.
|
||
*/
|
||
set,
|
||
/**
|
||
The base unmodified tag that this one is based on, if it's
|
||
modified @internal
|
||
*/
|
||
base,
|
||
/**
|
||
The modifiers applied to this.base @internal
|
||
*/
|
||
modified) {
|
||
this.name = name;
|
||
this.set = set;
|
||
this.base = base;
|
||
this.modified = modified;
|
||
/**
|
||
@internal
|
||
*/
|
||
this.id = nextTagID++;
|
||
}
|
||
toString() {
|
||
let { name } = this;
|
||
for (let mod of this.modified)
|
||
if (mod.name)
|
||
name = `${mod.name}(${name})`;
|
||
return name;
|
||
}
|
||
static define(nameOrParent, parent) {
|
||
let name = typeof nameOrParent == "string" ? nameOrParent : "?";
|
||
if (nameOrParent instanceof Tag)
|
||
parent = nameOrParent;
|
||
if (parent === null || parent === void 0 ? void 0 : parent.base)
|
||
throw new Error("Can not derive from a modified tag");
|
||
let tag = new Tag(name, [], null, []);
|
||
tag.set.push(tag);
|
||
if (parent)
|
||
for (let t of parent.set)
|
||
tag.set.push(t);
|
||
return tag;
|
||
}
|
||
/**
|
||
Define a tag _modifier_, which is a function that, given a tag,
|
||
will return a tag that is a subtag of the original. Applying the
|
||
same modifier to a twice tag will return the same value (`m1(t1)
|
||
== m1(t1)`) and applying multiple modifiers will, regardless or
|
||
order, produce the same tag (`m1(m2(t1)) == m2(m1(t1))`).
|
||
|
||
When multiple modifiers are applied to a given base tag, each
|
||
smaller set of modifiers is registered as a parent, so that for
|
||
example `m1(m2(m3(t1)))` is a subtype of `m1(m2(t1))`,
|
||
`m1(m3(t1)`, and so on.
|
||
*/
|
||
static defineModifier(name) {
|
||
let mod = new Modifier(name);
|
||
return (tag) => {
|
||
if (tag.modified.indexOf(mod) > -1)
|
||
return tag;
|
||
return Modifier.get(tag.base || tag, tag.modified.concat(mod).sort((a, b) => a.id - b.id));
|
||
};
|
||
}
|
||
}
|
||
let nextModifierID = 0;
|
||
class Modifier {
|
||
constructor(name) {
|
||
this.name = name;
|
||
this.instances = [];
|
||
this.id = nextModifierID++;
|
||
}
|
||
static get(base, mods) {
|
||
if (!mods.length)
|
||
return base;
|
||
let exists = mods[0].instances.find(t => t.base == base && sameArray(mods, t.modified));
|
||
if (exists)
|
||
return exists;
|
||
let set = [], tag = new Tag(base.name, set, base, mods);
|
||
for (let m of mods)
|
||
m.instances.push(tag);
|
||
let configs = powerSet(mods);
|
||
for (let parent of base.set)
|
||
if (!parent.modified.length)
|
||
for (let config of configs)
|
||
set.push(Modifier.get(parent, config));
|
||
return tag;
|
||
}
|
||
}
|
||
function sameArray(a, b) {
|
||
return a.length == b.length && a.every((x, i) => x == b[i]);
|
||
}
|
||
function powerSet(array) {
|
||
let sets = [[]];
|
||
for (let i = 0; i < array.length; i++) {
|
||
for (let j = 0, e = sets.length; j < e; j++) {
|
||
sets.push(sets[j].concat(array[i]));
|
||
}
|
||
}
|
||
return sets.sort((a, b) => b.length - a.length);
|
||
}
|
||
/**
|
||
This function is used to add a set of tags to a language syntax
|
||
via [`NodeSet.extend`](#common.NodeSet.extend) or
|
||
[`LRParser.configure`](#lr.LRParser.configure).
|
||
|
||
The argument object maps node selectors to [highlighting
|
||
tags](#highlight.Tag) or arrays of tags.
|
||
|
||
Node selectors may hold one or more (space-separated) node paths.
|
||
Such a path can be a [node name](#common.NodeType.name), or
|
||
multiple node names (or `*` wildcards) separated by slash
|
||
characters, as in `"Block/Declaration/VariableName"`. Such a path
|
||
matches the final node but only if its direct parent nodes are the
|
||
other nodes mentioned. A `*` in such a path matches any parent,
|
||
but only a single level—wildcards that match multiple parents
|
||
aren't supported, both for efficiency reasons and because Lezer
|
||
trees make it rather hard to reason about what they would match.)
|
||
|
||
A path can be ended with `/...` to indicate that the tag assigned
|
||
to the node should also apply to all child nodes, even if they
|
||
match their own style (by default, only the innermost style is
|
||
used).
|
||
|
||
When a path ends in `!`, as in `Attribute!`, no further matching
|
||
happens for the node's child nodes, and the entire node gets the
|
||
given style.
|
||
|
||
In this notation, node names that contain `/`, `!`, `*`, or `...`
|
||
must be quoted as JSON strings.
|
||
|
||
For example:
|
||
|
||
```javascript
|
||
parser.configure({props: [
|
||
styleTags({
|
||
// Style Number and BigNumber nodes
|
||
"Number BigNumber": tags.number,
|
||
// Style Escape nodes whose parent is String
|
||
"String/Escape": tags.escape,
|
||
// Style anything inside Attributes nodes
|
||
"Attributes!": tags.meta,
|
||
// Add a style to all content inside Italic nodes
|
||
"Italic/...": tags.emphasis,
|
||
// Style InvalidString nodes as both `string` and `invalid`
|
||
"InvalidString": [tags.string, tags.invalid],
|
||
// Style the node named "/" as punctuation
|
||
'"/"': tags.punctuation
|
||
})
|
||
]})
|
||
```
|
||
*/
|
||
function styleTags(spec) {
|
||
let byName = Object.create(null);
|
||
for (let prop in spec) {
|
||
let tags = spec[prop];
|
||
if (!Array.isArray(tags))
|
||
tags = [tags];
|
||
for (let part of prop.split(" "))
|
||
if (part) {
|
||
let pieces = [], mode = 2 /* Mode.Normal */, rest = part;
|
||
for (let pos = 0;;) {
|
||
if (rest == "..." && pos > 0 && pos + 3 == part.length) {
|
||
mode = 1 /* Mode.Inherit */;
|
||
break;
|
||
}
|
||
let m = /^"(?:[^"\\]|\\.)*?"|[^\/!]+/.exec(rest);
|
||
if (!m)
|
||
throw new RangeError("Invalid path: " + part);
|
||
pieces.push(m[0] == "*" ? "" : m[0][0] == '"' ? JSON.parse(m[0]) : m[0]);
|
||
pos += m[0].length;
|
||
if (pos == part.length)
|
||
break;
|
||
let next = part[pos++];
|
||
if (pos == part.length && next == "!") {
|
||
mode = 0 /* Mode.Opaque */;
|
||
break;
|
||
}
|
||
if (next != "/")
|
||
throw new RangeError("Invalid path: " + part);
|
||
rest = part.slice(pos);
|
||
}
|
||
let last = pieces.length - 1, inner = pieces[last];
|
||
if (!inner)
|
||
throw new RangeError("Invalid path: " + part);
|
||
let rule = new Rule(tags, mode, last > 0 ? pieces.slice(0, last) : null);
|
||
byName[inner] = rule.sort(byName[inner]);
|
||
}
|
||
}
|
||
return ruleNodeProp.add(byName);
|
||
}
|
||
const ruleNodeProp = new dist/* NodeProp */.uY({
|
||
combine(a, b) {
|
||
let cur, root, take;
|
||
while (a || b) {
|
||
if (!a || b && a.depth >= b.depth) {
|
||
take = b;
|
||
b = b.next;
|
||
}
|
||
else {
|
||
take = a;
|
||
a = a.next;
|
||
}
|
||
if (cur && cur.mode == take.mode && !take.context && !cur.context)
|
||
continue;
|
||
let copy = new Rule(take.tags, take.mode, take.context);
|
||
if (cur)
|
||
cur.next = copy;
|
||
else
|
||
root = copy;
|
||
cur = copy;
|
||
}
|
||
return root;
|
||
}
|
||
});
|
||
class Rule {
|
||
constructor(tags, mode, context, next) {
|
||
this.tags = tags;
|
||
this.mode = mode;
|
||
this.context = context;
|
||
this.next = next;
|
||
}
|
||
get opaque() { return this.mode == 0 /* Mode.Opaque */; }
|
||
get inherit() { return this.mode == 1 /* Mode.Inherit */; }
|
||
sort(other) {
|
||
if (!other || other.depth < this.depth) {
|
||
this.next = other;
|
||
return this;
|
||
}
|
||
other.next = this.sort(other.next);
|
||
return other;
|
||
}
|
||
get depth() { return this.context ? this.context.length : 0; }
|
||
}
|
||
Rule.empty = new Rule([], 2 /* Mode.Normal */, null);
|
||
/**
|
||
Define a [highlighter](#highlight.Highlighter) from an array of
|
||
tag/class pairs. Classes associated with more specific tags will
|
||
take precedence.
|
||
*/
|
||
function tagHighlighter(tags, options) {
|
||
let map = Object.create(null);
|
||
for (let style of tags) {
|
||
if (!Array.isArray(style.tag))
|
||
map[style.tag.id] = style.class;
|
||
else
|
||
for (let tag of style.tag)
|
||
map[tag.id] = style.class;
|
||
}
|
||
let { scope, all = null } = options || {};
|
||
return {
|
||
style: (tags) => {
|
||
let cls = all;
|
||
for (let tag of tags) {
|
||
for (let sub of tag.set) {
|
||
let tagClass = map[sub.id];
|
||
if (tagClass) {
|
||
cls = cls ? cls + " " + tagClass : tagClass;
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
return cls;
|
||
},
|
||
scope
|
||
};
|
||
}
|
||
function highlightTags(highlighters, tags) {
|
||
let result = null;
|
||
for (let highlighter of highlighters) {
|
||
let value = highlighter.style(tags);
|
||
if (value)
|
||
result = result ? result + " " + value : value;
|
||
}
|
||
return result;
|
||
}
|
||
/**
|
||
Highlight the given [tree](#common.Tree) with the given
|
||
[highlighter](#highlight.Highlighter). Often, the higher-level
|
||
[`highlightCode`](#highlight.highlightCode) function is easier to
|
||
use.
|
||
*/
|
||
function highlightTree(tree, highlighter,
|
||
/**
|
||
Assign styling to a region of the text. Will be called, in order
|
||
of position, for any ranges where more than zero classes apply.
|
||
`classes` is a space separated string of CSS classes.
|
||
*/
|
||
putStyle,
|
||
/**
|
||
The start of the range to highlight.
|
||
*/
|
||
from = 0,
|
||
/**
|
||
The end of the range.
|
||
*/
|
||
to = tree.length) {
|
||
let builder = new HighlightBuilder(from, Array.isArray(highlighter) ? highlighter : [highlighter], putStyle);
|
||
builder.highlightRange(tree.cursor(), from, to, "", builder.highlighters);
|
||
builder.flush(to);
|
||
}
|
||
/**
|
||
Highlight the given tree with the given highlighter, calling
|
||
`putText` for every piece of text, either with a set of classes or
|
||
with the empty string when unstyled, and `putBreak` for every line
|
||
break.
|
||
*/
|
||
function highlightCode(code, tree, highlighter, putText, putBreak, from = 0, to = code.length) {
|
||
let pos = from;
|
||
function writeTo(p, classes) {
|
||
if (p <= pos)
|
||
return;
|
||
for (let text = code.slice(pos, p), i = 0;;) {
|
||
let nextBreak = text.indexOf("\n", i);
|
||
let upto = nextBreak < 0 ? text.length : nextBreak;
|
||
if (upto > i)
|
||
putText(text.slice(i, upto), classes);
|
||
if (nextBreak < 0)
|
||
break;
|
||
putBreak();
|
||
i = nextBreak + 1;
|
||
}
|
||
pos = p;
|
||
}
|
||
highlightTree(tree, highlighter, (from, to, classes) => {
|
||
writeTo(from, "");
|
||
writeTo(to, classes);
|
||
}, from, to);
|
||
writeTo(to, "");
|
||
}
|
||
class HighlightBuilder {
|
||
constructor(at, highlighters, span) {
|
||
this.at = at;
|
||
this.highlighters = highlighters;
|
||
this.span = span;
|
||
this.class = "";
|
||
}
|
||
startSpan(at, cls) {
|
||
if (cls != this.class) {
|
||
this.flush(at);
|
||
if (at > this.at)
|
||
this.at = at;
|
||
this.class = cls;
|
||
}
|
||
}
|
||
flush(to) {
|
||
if (to > this.at && this.class)
|
||
this.span(this.at, to, this.class);
|
||
}
|
||
highlightRange(cursor, from, to, inheritedClass, highlighters) {
|
||
let { type, from: start, to: end } = cursor;
|
||
if (start >= to || end <= from)
|
||
return;
|
||
if (type.isTop)
|
||
highlighters = this.highlighters.filter(h => !h.scope || h.scope(type));
|
||
let cls = inheritedClass;
|
||
let rule = getStyleTags(cursor) || Rule.empty;
|
||
let tagCls = highlightTags(highlighters, rule.tags);
|
||
if (tagCls) {
|
||
if (cls)
|
||
cls += " ";
|
||
cls += tagCls;
|
||
if (rule.mode == 1 /* Mode.Inherit */)
|
||
inheritedClass += (inheritedClass ? " " : "") + tagCls;
|
||
}
|
||
this.startSpan(Math.max(from, start), cls);
|
||
if (rule.opaque)
|
||
return;
|
||
let mounted = cursor.tree && cursor.tree.prop(dist/* NodeProp */.uY.mounted);
|
||
if (mounted && mounted.overlay) {
|
||
let inner = cursor.node.enter(mounted.overlay[0].from + start, 1);
|
||
let innerHighlighters = this.highlighters.filter(h => !h.scope || h.scope(mounted.tree.type));
|
||
let hasChild = cursor.firstChild();
|
||
for (let i = 0, pos = start;; i++) {
|
||
let next = i < mounted.overlay.length ? mounted.overlay[i] : null;
|
||
let nextPos = next ? next.from + start : end;
|
||
let rangeFrom = Math.max(from, pos), rangeTo = Math.min(to, nextPos);
|
||
if (rangeFrom < rangeTo && hasChild) {
|
||
while (cursor.from < rangeTo) {
|
||
this.highlightRange(cursor, rangeFrom, rangeTo, inheritedClass, highlighters);
|
||
this.startSpan(Math.min(rangeTo, cursor.to), cls);
|
||
if (cursor.to >= nextPos || !cursor.nextSibling())
|
||
break;
|
||
}
|
||
}
|
||
if (!next || nextPos > to)
|
||
break;
|
||
pos = next.to + start;
|
||
if (pos > from) {
|
||
this.highlightRange(inner.cursor(), Math.max(from, next.from + start), Math.min(to, pos), "", innerHighlighters);
|
||
this.startSpan(Math.min(to, pos), cls);
|
||
}
|
||
}
|
||
if (hasChild)
|
||
cursor.parent();
|
||
}
|
||
else if (cursor.firstChild()) {
|
||
if (mounted)
|
||
inheritedClass = "";
|
||
do {
|
||
if (cursor.to <= from)
|
||
continue;
|
||
if (cursor.from >= to)
|
||
break;
|
||
this.highlightRange(cursor, from, to, inheritedClass, highlighters);
|
||
this.startSpan(Math.min(to, cursor.to), cls);
|
||
} while (cursor.nextSibling());
|
||
cursor.parent();
|
||
}
|
||
}
|
||
}
|
||
/**
|
||
Match a syntax node's [highlight rules](#highlight.styleTags). If
|
||
there's a match, return its set of tags, and whether it is
|
||
opaque (uses a `!`) or applies to all child nodes (`/...`).
|
||
*/
|
||
function getStyleTags(node) {
|
||
let rule = node.type.prop(ruleNodeProp);
|
||
while (rule && rule.context && !node.matchContext(rule.context))
|
||
rule = rule.next;
|
||
return rule || null;
|
||
}
|
||
const t = Tag.define;
|
||
const comment = t(), dist_name = t(), typeName = t(dist_name), propertyName = t(dist_name), literal = t(), string = t(literal), number = t(literal), content = t(), heading = t(content), keyword = t(), operator = t(), punctuation = t(), bracket = t(punctuation), meta = t();
|
||
/**
|
||
The default set of highlighting [tags](#highlight.Tag).
|
||
|
||
This collection is heavily biased towards programming languages,
|
||
and necessarily incomplete. A full ontology of syntactic
|
||
constructs would fill a stack of books, and be impractical to
|
||
write themes for. So try to make do with this set. If all else
|
||
fails, [open an
|
||
issue](https://github.com/codemirror/codemirror.next) to propose a
|
||
new tag, or [define](#highlight.Tag^define) a local custom tag for
|
||
your use case.
|
||
|
||
Note that it is not obligatory to always attach the most specific
|
||
tag possible to an element—if your grammar can't easily
|
||
distinguish a certain type of element (such as a local variable),
|
||
it is okay to style it as its more general variant (a variable).
|
||
|
||
For tags that extend some parent tag, the documentation links to
|
||
the parent.
|
||
*/
|
||
const tags = {
|
||
/**
|
||
A comment.
|
||
*/
|
||
comment,
|
||
/**
|
||
A line [comment](#highlight.tags.comment).
|
||
*/
|
||
lineComment: t(comment),
|
||
/**
|
||
A block [comment](#highlight.tags.comment).
|
||
*/
|
||
blockComment: t(comment),
|
||
/**
|
||
A documentation [comment](#highlight.tags.comment).
|
||
*/
|
||
docComment: t(comment),
|
||
/**
|
||
Any kind of identifier.
|
||
*/
|
||
name: dist_name,
|
||
/**
|
||
The [name](#highlight.tags.name) of a variable.
|
||
*/
|
||
variableName: t(dist_name),
|
||
/**
|
||
A type [name](#highlight.tags.name).
|
||
*/
|
||
typeName: typeName,
|
||
/**
|
||
A tag name (subtag of [`typeName`](#highlight.tags.typeName)).
|
||
*/
|
||
tagName: t(typeName),
|
||
/**
|
||
A property or field [name](#highlight.tags.name).
|
||
*/
|
||
propertyName: propertyName,
|
||
/**
|
||
An attribute name (subtag of [`propertyName`](#highlight.tags.propertyName)).
|
||
*/
|
||
attributeName: t(propertyName),
|
||
/**
|
||
The [name](#highlight.tags.name) of a class.
|
||
*/
|
||
className: t(dist_name),
|
||
/**
|
||
A label [name](#highlight.tags.name).
|
||
*/
|
||
labelName: t(dist_name),
|
||
/**
|
||
A namespace [name](#highlight.tags.name).
|
||
*/
|
||
namespace: t(dist_name),
|
||
/**
|
||
The [name](#highlight.tags.name) of a macro.
|
||
*/
|
||
macroName: t(dist_name),
|
||
/**
|
||
A literal value.
|
||
*/
|
||
literal,
|
||
/**
|
||
A string [literal](#highlight.tags.literal).
|
||
*/
|
||
string,
|
||
/**
|
||
A documentation [string](#highlight.tags.string).
|
||
*/
|
||
docString: t(string),
|
||
/**
|
||
A character literal (subtag of [string](#highlight.tags.string)).
|
||
*/
|
||
character: t(string),
|
||
/**
|
||
An attribute value (subtag of [string](#highlight.tags.string)).
|
||
*/
|
||
attributeValue: t(string),
|
||
/**
|
||
A number [literal](#highlight.tags.literal).
|
||
*/
|
||
number,
|
||
/**
|
||
An integer [number](#highlight.tags.number) literal.
|
||
*/
|
||
integer: t(number),
|
||
/**
|
||
A floating-point [number](#highlight.tags.number) literal.
|
||
*/
|
||
float: t(number),
|
||
/**
|
||
A boolean [literal](#highlight.tags.literal).
|
||
*/
|
||
bool: t(literal),
|
||
/**
|
||
Regular expression [literal](#highlight.tags.literal).
|
||
*/
|
||
regexp: t(literal),
|
||
/**
|
||
An escape [literal](#highlight.tags.literal), for example a
|
||
backslash escape in a string.
|
||
*/
|
||
escape: t(literal),
|
||
/**
|
||
A color [literal](#highlight.tags.literal).
|
||
*/
|
||
color: t(literal),
|
||
/**
|
||
A URL [literal](#highlight.tags.literal).
|
||
*/
|
||
url: t(literal),
|
||
/**
|
||
A language keyword.
|
||
*/
|
||
keyword,
|
||
/**
|
||
The [keyword](#highlight.tags.keyword) for the self or this
|
||
object.
|
||
*/
|
||
self: t(keyword),
|
||
/**
|
||
The [keyword](#highlight.tags.keyword) for null.
|
||
*/
|
||
null: t(keyword),
|
||
/**
|
||
A [keyword](#highlight.tags.keyword) denoting some atomic value.
|
||
*/
|
||
atom: t(keyword),
|
||
/**
|
||
A [keyword](#highlight.tags.keyword) that represents a unit.
|
||
*/
|
||
unit: t(keyword),
|
||
/**
|
||
A modifier [keyword](#highlight.tags.keyword).
|
||
*/
|
||
modifier: t(keyword),
|
||
/**
|
||
A [keyword](#highlight.tags.keyword) that acts as an operator.
|
||
*/
|
||
operatorKeyword: t(keyword),
|
||
/**
|
||
A control-flow related [keyword](#highlight.tags.keyword).
|
||
*/
|
||
controlKeyword: t(keyword),
|
||
/**
|
||
A [keyword](#highlight.tags.keyword) that defines something.
|
||
*/
|
||
definitionKeyword: t(keyword),
|
||
/**
|
||
A [keyword](#highlight.tags.keyword) related to defining or
|
||
interfacing with modules.
|
||
*/
|
||
moduleKeyword: t(keyword),
|
||
/**
|
||
An operator.
|
||
*/
|
||
operator,
|
||
/**
|
||
An [operator](#highlight.tags.operator) that dereferences something.
|
||
*/
|
||
derefOperator: t(operator),
|
||
/**
|
||
Arithmetic-related [operator](#highlight.tags.operator).
|
||
*/
|
||
arithmeticOperator: t(operator),
|
||
/**
|
||
Logical [operator](#highlight.tags.operator).
|
||
*/
|
||
logicOperator: t(operator),
|
||
/**
|
||
Bit [operator](#highlight.tags.operator).
|
||
*/
|
||
bitwiseOperator: t(operator),
|
||
/**
|
||
Comparison [operator](#highlight.tags.operator).
|
||
*/
|
||
compareOperator: t(operator),
|
||
/**
|
||
[Operator](#highlight.tags.operator) that updates its operand.
|
||
*/
|
||
updateOperator: t(operator),
|
||
/**
|
||
[Operator](#highlight.tags.operator) that defines something.
|
||
*/
|
||
definitionOperator: t(operator),
|
||
/**
|
||
Type-related [operator](#highlight.tags.operator).
|
||
*/
|
||
typeOperator: t(operator),
|
||
/**
|
||
Control-flow [operator](#highlight.tags.operator).
|
||
*/
|
||
controlOperator: t(operator),
|
||
/**
|
||
Program or markup punctuation.
|
||
*/
|
||
punctuation,
|
||
/**
|
||
[Punctuation](#highlight.tags.punctuation) that separates
|
||
things.
|
||
*/
|
||
separator: t(punctuation),
|
||
/**
|
||
Bracket-style [punctuation](#highlight.tags.punctuation).
|
||
*/
|
||
bracket,
|
||
/**
|
||
Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`
|
||
tokens).
|
||
*/
|
||
angleBracket: t(bracket),
|
||
/**
|
||
Square [brackets](#highlight.tags.bracket) (usually `[` and `]`
|
||
tokens).
|
||
*/
|
||
squareBracket: t(bracket),
|
||
/**
|
||
Parentheses (usually `(` and `)` tokens). Subtag of
|
||
[bracket](#highlight.tags.bracket).
|
||
*/
|
||
paren: t(bracket),
|
||
/**
|
||
Braces (usually `{` and `}` tokens). Subtag of
|
||
[bracket](#highlight.tags.bracket).
|
||
*/
|
||
brace: t(bracket),
|
||
/**
|
||
Content, for example plain text in XML or markup documents.
|
||
*/
|
||
content,
|
||
/**
|
||
[Content](#highlight.tags.content) that represents a heading.
|
||
*/
|
||
heading,
|
||
/**
|
||
A level 1 [heading](#highlight.tags.heading).
|
||
*/
|
||
heading1: t(heading),
|
||
/**
|
||
A level 2 [heading](#highlight.tags.heading).
|
||
*/
|
||
heading2: t(heading),
|
||
/**
|
||
A level 3 [heading](#highlight.tags.heading).
|
||
*/
|
||
heading3: t(heading),
|
||
/**
|
||
A level 4 [heading](#highlight.tags.heading).
|
||
*/
|
||
heading4: t(heading),
|
||
/**
|
||
A level 5 [heading](#highlight.tags.heading).
|
||
*/
|
||
heading5: t(heading),
|
||
/**
|
||
A level 6 [heading](#highlight.tags.heading).
|
||
*/
|
||
heading6: t(heading),
|
||
/**
|
||
A prose [content](#highlight.tags.content) separator (such as a horizontal rule).
|
||
*/
|
||
contentSeparator: t(content),
|
||
/**
|
||
[Content](#highlight.tags.content) that represents a list.
|
||
*/
|
||
list: t(content),
|
||
/**
|
||
[Content](#highlight.tags.content) that represents a quote.
|
||
*/
|
||
quote: t(content),
|
||
/**
|
||
[Content](#highlight.tags.content) that is emphasized.
|
||
*/
|
||
emphasis: t(content),
|
||
/**
|
||
[Content](#highlight.tags.content) that is styled strong.
|
||
*/
|
||
strong: t(content),
|
||
/**
|
||
[Content](#highlight.tags.content) that is part of a link.
|
||
*/
|
||
link: t(content),
|
||
/**
|
||
[Content](#highlight.tags.content) that is styled as code or
|
||
monospace.
|
||
*/
|
||
monospace: t(content),
|
||
/**
|
||
[Content](#highlight.tags.content) that has a strike-through
|
||
style.
|
||
*/
|
||
strikethrough: t(content),
|
||
/**
|
||
Inserted text in a change-tracking format.
|
||
*/
|
||
inserted: t(),
|
||
/**
|
||
Deleted text.
|
||
*/
|
||
deleted: t(),
|
||
/**
|
||
Changed text.
|
||
*/
|
||
changed: t(),
|
||
/**
|
||
An invalid or unsyntactic element.
|
||
*/
|
||
invalid: t(),
|
||
/**
|
||
Metadata or meta-instruction.
|
||
*/
|
||
meta,
|
||
/**
|
||
[Metadata](#highlight.tags.meta) that applies to the entire
|
||
document.
|
||
*/
|
||
documentMeta: t(meta),
|
||
/**
|
||
[Metadata](#highlight.tags.meta) that annotates or adds
|
||
attributes to a given syntactic element.
|
||
*/
|
||
annotation: t(meta),
|
||
/**
|
||
Processing instruction or preprocessor directive. Subtag of
|
||
[meta](#highlight.tags.meta).
|
||
*/
|
||
processingInstruction: t(meta),
|
||
/**
|
||
[Modifier](#highlight.Tag^defineModifier) that indicates that a
|
||
given element is being defined. Expected to be used with the
|
||
various [name](#highlight.tags.name) tags.
|
||
*/
|
||
definition: Tag.defineModifier("definition"),
|
||
/**
|
||
[Modifier](#highlight.Tag^defineModifier) that indicates that
|
||
something is constant. Mostly expected to be used with
|
||
[variable names](#highlight.tags.variableName).
|
||
*/
|
||
constant: Tag.defineModifier("constant"),
|
||
/**
|
||
[Modifier](#highlight.Tag^defineModifier) used to indicate that
|
||
a [variable](#highlight.tags.variableName) or [property
|
||
name](#highlight.tags.propertyName) is being called or defined
|
||
as a function.
|
||
*/
|
||
function: Tag.defineModifier("function"),
|
||
/**
|
||
[Modifier](#highlight.Tag^defineModifier) that can be applied to
|
||
[names](#highlight.tags.name) to indicate that they belong to
|
||
the language's standard environment.
|
||
*/
|
||
standard: Tag.defineModifier("standard"),
|
||
/**
|
||
[Modifier](#highlight.Tag^defineModifier) that indicates a given
|
||
[names](#highlight.tags.name) is local to some scope.
|
||
*/
|
||
local: Tag.defineModifier("local"),
|
||
/**
|
||
A generic variant [modifier](#highlight.Tag^defineModifier) that
|
||
can be used to tag language-specific alternative variants of
|
||
some common tag. It is recommended for themes to define special
|
||
forms of at least the [string](#highlight.tags.string) and
|
||
[variable name](#highlight.tags.variableName) tags, since those
|
||
come up a lot.
|
||
*/
|
||
special: Tag.defineModifier("special")
|
||
};
|
||
for (let name in tags) {
|
||
let val = tags[name];
|
||
if (val instanceof Tag)
|
||
val.name = name;
|
||
}
|
||
/**
|
||
This is a highlighter that adds stable, predictable classes to
|
||
tokens, for styling with external CSS.
|
||
|
||
The following tags are mapped to their name prefixed with `"tok-"`
|
||
(for example `"tok-comment"`):
|
||
|
||
* [`link`](#highlight.tags.link)
|
||
* [`heading`](#highlight.tags.heading)
|
||
* [`emphasis`](#highlight.tags.emphasis)
|
||
* [`strong`](#highlight.tags.strong)
|
||
* [`keyword`](#highlight.tags.keyword)
|
||
* [`atom`](#highlight.tags.atom)
|
||
* [`bool`](#highlight.tags.bool)
|
||
* [`url`](#highlight.tags.url)
|
||
* [`labelName`](#highlight.tags.labelName)
|
||
* [`inserted`](#highlight.tags.inserted)
|
||
* [`deleted`](#highlight.tags.deleted)
|
||
* [`literal`](#highlight.tags.literal)
|
||
* [`string`](#highlight.tags.string)
|
||
* [`number`](#highlight.tags.number)
|
||
* [`variableName`](#highlight.tags.variableName)
|
||
* [`typeName`](#highlight.tags.typeName)
|
||
* [`namespace`](#highlight.tags.namespace)
|
||
* [`className`](#highlight.tags.className)
|
||
* [`macroName`](#highlight.tags.macroName)
|
||
* [`propertyName`](#highlight.tags.propertyName)
|
||
* [`operator`](#highlight.tags.operator)
|
||
* [`comment`](#highlight.tags.comment)
|
||
* [`meta`](#highlight.tags.meta)
|
||
* [`punctuation`](#highlight.tags.punctuation)
|
||
* [`invalid`](#highlight.tags.invalid)
|
||
|
||
In addition, these mappings are provided:
|
||
|
||
* [`regexp`](#highlight.tags.regexp),
|
||
[`escape`](#highlight.tags.escape), and
|
||
[`special`](#highlight.tags.special)[`(string)`](#highlight.tags.string)
|
||
are mapped to `"tok-string2"`
|
||
* [`special`](#highlight.tags.special)[`(variableName)`](#highlight.tags.variableName)
|
||
to `"tok-variableName2"`
|
||
* [`local`](#highlight.tags.local)[`(variableName)`](#highlight.tags.variableName)
|
||
to `"tok-variableName tok-local"`
|
||
* [`definition`](#highlight.tags.definition)[`(variableName)`](#highlight.tags.variableName)
|
||
to `"tok-variableName tok-definition"`
|
||
* [`definition`](#highlight.tags.definition)[`(propertyName)`](#highlight.tags.propertyName)
|
||
to `"tok-propertyName tok-definition"`
|
||
*/
|
||
const classHighlighter = tagHighlighter([
|
||
{ tag: tags.link, class: "tok-link" },
|
||
{ tag: tags.heading, class: "tok-heading" },
|
||
{ tag: tags.emphasis, class: "tok-emphasis" },
|
||
{ tag: tags.strong, class: "tok-strong" },
|
||
{ tag: tags.keyword, class: "tok-keyword" },
|
||
{ tag: tags.atom, class: "tok-atom" },
|
||
{ tag: tags.bool, class: "tok-bool" },
|
||
{ tag: tags.url, class: "tok-url" },
|
||
{ tag: tags.labelName, class: "tok-labelName" },
|
||
{ tag: tags.inserted, class: "tok-inserted" },
|
||
{ tag: tags.deleted, class: "tok-deleted" },
|
||
{ tag: tags.literal, class: "tok-literal" },
|
||
{ tag: tags.string, class: "tok-string" },
|
||
{ tag: tags.number, class: "tok-number" },
|
||
{ tag: [tags.regexp, tags.escape, tags.special(tags.string)], class: "tok-string2" },
|
||
{ tag: tags.variableName, class: "tok-variableName" },
|
||
{ tag: tags.local(tags.variableName), class: "tok-variableName tok-local" },
|
||
{ tag: tags.definition(tags.variableName), class: "tok-variableName tok-definition" },
|
||
{ tag: tags.special(tags.variableName), class: "tok-variableName2" },
|
||
{ tag: tags.definition(tags.propertyName), class: "tok-propertyName tok-definition" },
|
||
{ tag: tags.typeName, class: "tok-typeName" },
|
||
{ tag: tags.namespace, class: "tok-namespace" },
|
||
{ tag: tags.className, class: "tok-className" },
|
||
{ tag: tags.macroName, class: "tok-macroName" },
|
||
{ tag: tags.propertyName, class: "tok-propertyName" },
|
||
{ tag: tags.operator, class: "tok-operator" },
|
||
{ tag: tags.comment, class: "tok-comment" },
|
||
{ tag: tags.meta, class: "tok-meta" },
|
||
{ tag: tags.invalid, class: "tok-invalid" },
|
||
{ tag: tags.punctuation, class: "tok-punctuation" }
|
||
]);
|
||
|
||
|
||
|
||
;// ../node_modules/style-mod/src/style-mod.js
|
||
const C = "\u037c"
|
||
const COUNT = typeof Symbol == "undefined" ? "__" + C : Symbol.for(C)
|
||
const SET = typeof Symbol == "undefined" ? "__styleSet" + Math.floor(Math.random() * 1e8) : Symbol("styleSet")
|
||
const style_mod_top = typeof globalThis != "undefined" ? globalThis : typeof window != "undefined" ? window : {}
|
||
|
||
// :: - Style modules encapsulate a set of CSS rules defined from
|
||
// JavaScript. Their definitions are only available in a given DOM
|
||
// root after it has been _mounted_ there with `StyleModule.mount`.
|
||
//
|
||
// Style modules should be created once and stored somewhere, as
|
||
// opposed to re-creating them every time you need them. The amount of
|
||
// CSS rules generated for a given DOM root is bounded by the amount
|
||
// of style modules that were used. So to avoid leaking rules, don't
|
||
// create these dynamically, but treat them as one-time allocations.
|
||
class StyleModule {
|
||
// :: (Object<Style>, ?{finish: ?(string) → string})
|
||
// Create a style module from the given spec.
|
||
//
|
||
// When `finish` is given, it is called on regular (non-`@`)
|
||
// selectors (after `&` expansion) to compute the final selector.
|
||
constructor(spec, options) {
|
||
this.rules = []
|
||
let {finish} = options || {}
|
||
|
||
function splitSelector(selector) {
|
||
return /^@/.test(selector) ? [selector] : selector.split(/,\s*/)
|
||
}
|
||
|
||
function render(selectors, spec, target, isKeyframes) {
|
||
let local = [], isAt = /^@(\w+)\b/.exec(selectors[0]), keyframes = isAt && isAt[1] == "keyframes"
|
||
if (isAt && spec == null) return target.push(selectors[0] + ";")
|
||
for (let prop in spec) {
|
||
let value = spec[prop]
|
||
if (/&/.test(prop)) {
|
||
render(prop.split(/,\s*/).map(part => selectors.map(sel => part.replace(/&/, sel))).reduce((a, b) => a.concat(b)),
|
||
value, target)
|
||
} else if (value && typeof value == "object") {
|
||
if (!isAt) throw new RangeError("The value of a property (" + prop + ") should be a primitive value.")
|
||
render(splitSelector(prop), value, local, keyframes)
|
||
} else if (value != null) {
|
||
local.push(prop.replace(/_.*/, "").replace(/[A-Z]/g, l => "-" + l.toLowerCase()) + ": " + value + ";")
|
||
}
|
||
}
|
||
if (local.length || keyframes) {
|
||
target.push((finish && !isAt && !isKeyframes ? selectors.map(finish) : selectors).join(", ") +
|
||
" {" + local.join(" ") + "}")
|
||
}
|
||
}
|
||
|
||
for (let prop in spec) render(splitSelector(prop), spec[prop], this.rules)
|
||
}
|
||
|
||
// :: () → string
|
||
// Returns a string containing the module's CSS rules.
|
||
getRules() { return this.rules.join("\n") }
|
||
|
||
// :: () → string
|
||
// Generate a new unique CSS class name.
|
||
static newName() {
|
||
let id = style_mod_top[COUNT] || 1
|
||
style_mod_top[COUNT] = id + 1
|
||
return C + id.toString(36)
|
||
}
|
||
|
||
// :: (union<Document, ShadowRoot>, union<[StyleModule], StyleModule>, ?{nonce: ?string})
|
||
//
|
||
// Mount the given set of modules in the given DOM root, which ensures
|
||
// that the CSS rules defined by the module are available in that
|
||
// context.
|
||
//
|
||
// Rules are only added to the document once per root.
|
||
//
|
||
// Rule order will follow the order of the modules, so that rules from
|
||
// modules later in the array take precedence of those from earlier
|
||
// modules. If you call this function multiple times for the same root
|
||
// in a way that changes the order of already mounted modules, the old
|
||
// order will be changed.
|
||
//
|
||
// If a Content Security Policy nonce is provided, it is added to
|
||
// the `<style>` tag generated by the library.
|
||
static mount(root, modules, options) {
|
||
let set = root[SET], nonce = options && options.nonce
|
||
if (!set) set = new StyleSet(root, nonce)
|
||
else if (nonce) set.setNonce(nonce)
|
||
set.mount(Array.isArray(modules) ? modules : [modules], root)
|
||
}
|
||
}
|
||
|
||
let adoptedSet = new Map //<Document, StyleSet>
|
||
|
||
class StyleSet {
|
||
constructor(root, nonce) {
|
||
let doc = root.ownerDocument || root, win = doc.defaultView
|
||
if (!root.head && root.adoptedStyleSheets && win.CSSStyleSheet) {
|
||
let adopted = adoptedSet.get(doc)
|
||
if (adopted) return root[SET] = adopted
|
||
this.sheet = new win.CSSStyleSheet
|
||
adoptedSet.set(doc, this)
|
||
} else {
|
||
this.styleTag = doc.createElement("style")
|
||
if (nonce) this.styleTag.setAttribute("nonce", nonce)
|
||
}
|
||
this.modules = []
|
||
root[SET] = this
|
||
}
|
||
|
||
mount(modules, root) {
|
||
let sheet = this.sheet
|
||
let pos = 0 /* Current rule offset */, j = 0 /* Index into this.modules */
|
||
for (let i = 0; i < modules.length; i++) {
|
||
let mod = modules[i], index = this.modules.indexOf(mod)
|
||
if (index < j && index > -1) { // Ordering conflict
|
||
this.modules.splice(index, 1)
|
||
j--
|
||
index = -1
|
||
}
|
||
if (index == -1) {
|
||
this.modules.splice(j++, 0, mod)
|
||
if (sheet) for (let k = 0; k < mod.rules.length; k++)
|
||
sheet.insertRule(mod.rules[k], pos++)
|
||
} else {
|
||
while (j < index) pos += this.modules[j++].rules.length
|
||
pos += mod.rules.length
|
||
j++
|
||
}
|
||
}
|
||
|
||
if (sheet) {
|
||
if (root.adoptedStyleSheets.indexOf(this.sheet) < 0)
|
||
root.adoptedStyleSheets = [this.sheet, ...root.adoptedStyleSheets]
|
||
} else {
|
||
let text = ""
|
||
for (let i = 0; i < this.modules.length; i++)
|
||
text += this.modules[i].getRules() + "\n"
|
||
this.styleTag.textContent = text
|
||
let target = root.head || root
|
||
if (this.styleTag.parentNode != target)
|
||
target.insertBefore(this.styleTag, target.firstChild)
|
||
}
|
||
}
|
||
|
||
setNonce(nonce) {
|
||
if (this.styleTag && this.styleTag.getAttribute("nonce") != nonce)
|
||
this.styleTag.setAttribute("nonce", nonce)
|
||
}
|
||
}
|
||
|
||
// Style::Object<union<Style,string>>
|
||
//
|
||
// A style is an object that, in the simple case, maps CSS property
|
||
// names to strings holding their values, as in `{color: "red",
|
||
// fontWeight: "bold"}`. The property names can be given in
|
||
// camel-case—the library will insert a dash before capital letters
|
||
// when converting them to CSS.
|
||
//
|
||
// If you include an underscore in a property name, it and everything
|
||
// after it will be removed from the output, which can be useful when
|
||
// providing a property multiple times, for browser compatibility
|
||
// reasons.
|
||
//
|
||
// A property in a style object can also be a sub-selector, which
|
||
// extends the current context to add a pseudo-selector or a child
|
||
// selector. Such a property should contain a `&` character, which
|
||
// will be replaced by the current selector. For example `{"&:before":
|
||
// {content: '"hi"'}}`. Sub-selectors and regular properties can
|
||
// freely be mixed in a given object. Any property containing a `&` is
|
||
// assumed to be a sub-selector.
|
||
//
|
||
// Finally, a property can specify an @-block to be wrapped around the
|
||
// styles defined inside the object that's the property's value. For
|
||
// example to create a media query you can do `{"@media screen and
|
||
// (min-width: 400px)": {...}}`.
|
||
|
||
;// ../node_modules/@codemirror/language/dist/index.js
|
||
|
||
|
||
|
||
|
||
|
||
|
||
var _a;
|
||
/**
|
||
Node prop stored in a parser's top syntax node to provide the
|
||
facet that stores language-specific data for that language.
|
||
*/
|
||
const languageDataProp = /*@__PURE__*/new dist/* NodeProp */.uY();
|
||
/**
|
||
Helper function to define a facet (to be added to the top syntax
|
||
node(s) for a language via
|
||
[`languageDataProp`](https://codemirror.net/6/docs/ref/#language.languageDataProp)), that will be
|
||
used to associate language data with the language. You
|
||
probably only need this when subclassing
|
||
[`Language`](https://codemirror.net/6/docs/ref/#language.Language).
|
||
*/
|
||
function defineLanguageFacet(baseData) {
|
||
return state_.Facet.define({
|
||
combine: baseData ? values => values.concat(baseData) : undefined
|
||
});
|
||
}
|
||
/**
|
||
Syntax node prop used to register sublanguages. Should be added to
|
||
the top level node type for the language.
|
||
*/
|
||
const sublanguageProp = /*@__PURE__*/new dist/* NodeProp */.uY();
|
||
/**
|
||
A language object manages parsing and per-language
|
||
[metadata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt). Parse data is
|
||
managed as a [Lezer](https://lezer.codemirror.net) tree. The class
|
||
can be used directly, via the [`LRLanguage`](https://codemirror.net/6/docs/ref/#language.LRLanguage)
|
||
subclass for [Lezer](https://lezer.codemirror.net/) LR parsers, or
|
||
via the [`StreamLanguage`](https://codemirror.net/6/docs/ref/#language.StreamLanguage) subclass
|
||
for stream parsers.
|
||
*/
|
||
class Language {
|
||
/**
|
||
Construct a language object. If you need to invoke this
|
||
directly, first define a data facet with
|
||
[`defineLanguageFacet`](https://codemirror.net/6/docs/ref/#language.defineLanguageFacet), and then
|
||
configure your parser to [attach](https://codemirror.net/6/docs/ref/#language.languageDataProp) it
|
||
to the language's outer syntax node.
|
||
*/
|
||
constructor(
|
||
/**
|
||
The [language data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) facet
|
||
used for this language.
|
||
*/
|
||
data, parser, extraExtensions = [],
|
||
/**
|
||
A language name.
|
||
*/
|
||
name = "") {
|
||
this.data = data;
|
||
this.name = name;
|
||
// Kludge to define EditorState.tree as a debugging helper,
|
||
// without the EditorState package actually knowing about
|
||
// languages and lezer trees.
|
||
if (!state_.EditorState.prototype.hasOwnProperty("tree"))
|
||
Object.defineProperty(state_.EditorState.prototype, "tree", { get() { return syntaxTree(this); } });
|
||
this.parser = parser;
|
||
this.extension = [
|
||
language.of(this),
|
||
state_.EditorState.languageData.of((state, pos, side) => {
|
||
let top = topNodeAt(state, pos, side), data = top.type.prop(languageDataProp);
|
||
if (!data)
|
||
return [];
|
||
let base = state.facet(data), sub = top.type.prop(sublanguageProp);
|
||
if (sub) {
|
||
let innerNode = top.resolve(pos - top.from, side);
|
||
for (let sublang of sub)
|
||
if (sublang.test(innerNode, state)) {
|
||
let data = state.facet(sublang.facet);
|
||
return sublang.type == "replace" ? data : data.concat(base);
|
||
}
|
||
}
|
||
return base;
|
||
})
|
||
].concat(extraExtensions);
|
||
}
|
||
/**
|
||
Query whether this language is active at the given position.
|
||
*/
|
||
isActiveAt(state, pos, side = -1) {
|
||
return topNodeAt(state, pos, side).type.prop(languageDataProp) == this.data;
|
||
}
|
||
/**
|
||
Find the document regions that were parsed using this language.
|
||
The returned regions will _include_ any nested languages rooted
|
||
in this language, when those exist.
|
||
*/
|
||
findRegions(state) {
|
||
let lang = state.facet(language);
|
||
if ((lang === null || lang === void 0 ? void 0 : lang.data) == this.data)
|
||
return [{ from: 0, to: state.doc.length }];
|
||
if (!lang || !lang.allowsNesting)
|
||
return [];
|
||
let result = [];
|
||
let explore = (tree, from) => {
|
||
if (tree.prop(languageDataProp) == this.data) {
|
||
result.push({ from, to: from + tree.length });
|
||
return;
|
||
}
|
||
let mount = tree.prop(dist/* NodeProp */.uY.mounted);
|
||
if (mount) {
|
||
if (mount.tree.prop(languageDataProp) == this.data) {
|
||
if (mount.overlay)
|
||
for (let r of mount.overlay)
|
||
result.push({ from: r.from + from, to: r.to + from });
|
||
else
|
||
result.push({ from: from, to: from + tree.length });
|
||
return;
|
||
}
|
||
else if (mount.overlay) {
|
||
let size = result.length;
|
||
explore(mount.tree, mount.overlay[0].from + from);
|
||
if (result.length > size)
|
||
return;
|
||
}
|
||
}
|
||
for (let i = 0; i < tree.children.length; i++) {
|
||
let ch = tree.children[i];
|
||
if (ch instanceof dist/* Tree */.PH)
|
||
explore(ch, tree.positions[i] + from);
|
||
}
|
||
};
|
||
explore(syntaxTree(state), 0);
|
||
return result;
|
||
}
|
||
/**
|
||
Indicates whether this language allows nested languages. The
|
||
default implementation returns true.
|
||
*/
|
||
get allowsNesting() { return true; }
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
Language.setState = /*@__PURE__*/state_.StateEffect.define();
|
||
function topNodeAt(state, pos, side) {
|
||
let topLang = state.facet(language), tree = syntaxTree(state).topNode;
|
||
if (!topLang || topLang.allowsNesting) {
|
||
for (let node = tree; node; node = node.enter(pos, side, dist/* IterMode */.Qj.ExcludeBuffers))
|
||
if (node.type.isTop)
|
||
tree = node;
|
||
}
|
||
return tree;
|
||
}
|
||
/**
|
||
A subclass of [`Language`](https://codemirror.net/6/docs/ref/#language.Language) for use with Lezer
|
||
[LR parsers](https://lezer.codemirror.net/docs/ref#lr.LRParser)
|
||
parsers.
|
||
*/
|
||
class LRLanguage extends Language {
|
||
constructor(data, parser, name) {
|
||
super(data, parser, [], name);
|
||
this.parser = parser;
|
||
}
|
||
/**
|
||
Define a language from a parser.
|
||
*/
|
||
static define(spec) {
|
||
let data = defineLanguageFacet(spec.languageData);
|
||
return new LRLanguage(data, spec.parser.configure({
|
||
props: [languageDataProp.add(type => type.isTop ? data : undefined)]
|
||
}), spec.name);
|
||
}
|
||
/**
|
||
Create a new instance of this language with a reconfigured
|
||
version of its parser and optionally a new name.
|
||
*/
|
||
configure(options, name) {
|
||
return new LRLanguage(this.data, this.parser.configure(options), name || this.name);
|
||
}
|
||
get allowsNesting() { return this.parser.hasWrappers(); }
|
||
}
|
||
/**
|
||
Get the syntax tree for a state, which is the current (possibly
|
||
incomplete) parse tree of the active
|
||
[language](https://codemirror.net/6/docs/ref/#language.Language), or the empty tree if there is no
|
||
language available.
|
||
*/
|
||
function syntaxTree(state) {
|
||
let field = state.field(Language.state, false);
|
||
return field ? field.tree : dist/* Tree */.PH.empty;
|
||
}
|
||
/**
|
||
Try to get a parse tree that spans at least up to `upto`. The
|
||
method will do at most `timeout` milliseconds of work to parse
|
||
up to that point if the tree isn't already available.
|
||
*/
|
||
function ensureSyntaxTree(state, upto, timeout = 50) {
|
||
var _a;
|
||
let parse = (_a = state.field(Language.state, false)) === null || _a === void 0 ? void 0 : _a.context;
|
||
if (!parse)
|
||
return null;
|
||
let oldVieport = parse.viewport;
|
||
parse.updateViewport({ from: 0, to: upto });
|
||
let result = parse.isDone(upto) || parse.work(timeout, upto) ? parse.tree : null;
|
||
parse.updateViewport(oldVieport);
|
||
return result;
|
||
}
|
||
/**
|
||
Queries whether there is a full syntax tree available up to the
|
||
given document position. If there isn't, the background parse
|
||
process _might_ still be working and update the tree further, but
|
||
there is no guarantee of that—the parser will [stop
|
||
working](https://codemirror.net/6/docs/ref/#language.syntaxParserRunning) when it has spent a
|
||
certain amount of time or has moved beyond the visible viewport.
|
||
Always returns false if no language has been enabled.
|
||
*/
|
||
function syntaxTreeAvailable(state, upto = state.doc.length) {
|
||
var _a;
|
||
return ((_a = state.field(Language.state, false)) === null || _a === void 0 ? void 0 : _a.context.isDone(upto)) || false;
|
||
}
|
||
/**
|
||
Move parsing forward, and update the editor state afterwards to
|
||
reflect the new tree. Will work for at most `timeout`
|
||
milliseconds. Returns true if the parser managed get to the given
|
||
position in that time.
|
||
*/
|
||
function forceParsing(view, upto = view.viewport.to, timeout = 100) {
|
||
let success = ensureSyntaxTree(view.state, upto, timeout);
|
||
if (success != syntaxTree(view.state))
|
||
view.dispatch({});
|
||
return !!success;
|
||
}
|
||
/**
|
||
Tells you whether the language parser is planning to do more
|
||
parsing work (in a `requestIdleCallback` pseudo-thread) or has
|
||
stopped running, either because it parsed the entire document,
|
||
because it spent too much time and was cut off, or because there
|
||
is no language parser enabled.
|
||
*/
|
||
function syntaxParserRunning(view) {
|
||
var _a;
|
||
return ((_a = view.plugin(parseWorker)) === null || _a === void 0 ? void 0 : _a.isWorking()) || false;
|
||
}
|
||
/**
|
||
Lezer-style
|
||
[`Input`](https://lezer.codemirror.net/docs/ref#common.Input)
|
||
object for a [`Text`](https://codemirror.net/6/docs/ref/#state.Text) object.
|
||
*/
|
||
class DocInput {
|
||
/**
|
||
Create an input object for the given document.
|
||
*/
|
||
constructor(doc) {
|
||
this.doc = doc;
|
||
this.cursorPos = 0;
|
||
this.string = "";
|
||
this.cursor = doc.iter();
|
||
}
|
||
get length() { return this.doc.length; }
|
||
syncTo(pos) {
|
||
this.string = this.cursor.next(pos - this.cursorPos).value;
|
||
this.cursorPos = pos + this.string.length;
|
||
return this.cursorPos - this.string.length;
|
||
}
|
||
chunk(pos) {
|
||
this.syncTo(pos);
|
||
return this.string;
|
||
}
|
||
get lineChunks() { return true; }
|
||
read(from, to) {
|
||
let stringStart = this.cursorPos - this.string.length;
|
||
if (from < stringStart || to >= this.cursorPos)
|
||
return this.doc.sliceString(from, to);
|
||
else
|
||
return this.string.slice(from - stringStart, to - stringStart);
|
||
}
|
||
}
|
||
let currentContext = null;
|
||
/**
|
||
A parse context provided to parsers working on the editor content.
|
||
*/
|
||
class ParseContext {
|
||
constructor(parser,
|
||
/**
|
||
The current editor state.
|
||
*/
|
||
state,
|
||
/**
|
||
Tree fragments that can be reused by incremental re-parses.
|
||
*/
|
||
fragments = [],
|
||
/**
|
||
@internal
|
||
*/
|
||
tree,
|
||
/**
|
||
@internal
|
||
*/
|
||
treeLen,
|
||
/**
|
||
The current editor viewport (or some overapproximation
|
||
thereof). Intended to be used for opportunistically avoiding
|
||
work (in which case
|
||
[`skipUntilInView`](https://codemirror.net/6/docs/ref/#language.ParseContext.skipUntilInView)
|
||
should be called to make sure the parser is restarted when the
|
||
skipped region becomes visible).
|
||
*/
|
||
viewport,
|
||
/**
|
||
@internal
|
||
*/
|
||
skipped,
|
||
/**
|
||
This is where skipping parsers can register a promise that,
|
||
when resolved, will schedule a new parse. It is cleared when
|
||
the parse worker picks up the promise. @internal
|
||
*/
|
||
scheduleOn) {
|
||
this.parser = parser;
|
||
this.state = state;
|
||
this.fragments = fragments;
|
||
this.tree = tree;
|
||
this.treeLen = treeLen;
|
||
this.viewport = viewport;
|
||
this.skipped = skipped;
|
||
this.scheduleOn = scheduleOn;
|
||
this.parse = null;
|
||
/**
|
||
@internal
|
||
*/
|
||
this.tempSkipped = [];
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
static create(parser, state, viewport) {
|
||
return new ParseContext(parser, state, [], dist/* Tree */.PH.empty, 0, viewport, [], null);
|
||
}
|
||
startParse() {
|
||
return this.parser.startParse(new DocInput(this.state.doc), this.fragments);
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
work(until, upto) {
|
||
if (upto != null && upto >= this.state.doc.length)
|
||
upto = undefined;
|
||
if (this.tree != dist/* Tree */.PH.empty && this.isDone(upto !== null && upto !== void 0 ? upto : this.state.doc.length)) {
|
||
this.takeTree();
|
||
return true;
|
||
}
|
||
return this.withContext(() => {
|
||
var _a;
|
||
if (typeof until == "number") {
|
||
let endTime = Date.now() + until;
|
||
until = () => Date.now() > endTime;
|
||
}
|
||
if (!this.parse)
|
||
this.parse = this.startParse();
|
||
if (upto != null && (this.parse.stoppedAt == null || this.parse.stoppedAt > upto) &&
|
||
upto < this.state.doc.length)
|
||
this.parse.stopAt(upto);
|
||
for (;;) {
|
||
let done = this.parse.advance();
|
||
if (done) {
|
||
this.fragments = this.withoutTempSkipped(dist/* TreeFragment */.rr.addTree(done, this.fragments, this.parse.stoppedAt != null));
|
||
this.treeLen = (_a = this.parse.stoppedAt) !== null && _a !== void 0 ? _a : this.state.doc.length;
|
||
this.tree = done;
|
||
this.parse = null;
|
||
if (this.treeLen < (upto !== null && upto !== void 0 ? upto : this.state.doc.length))
|
||
this.parse = this.startParse();
|
||
else
|
||
return true;
|
||
}
|
||
if (until())
|
||
return false;
|
||
}
|
||
});
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
takeTree() {
|
||
let pos, tree;
|
||
if (this.parse && (pos = this.parse.parsedPos) >= this.treeLen) {
|
||
if (this.parse.stoppedAt == null || this.parse.stoppedAt > pos)
|
||
this.parse.stopAt(pos);
|
||
this.withContext(() => { while (!(tree = this.parse.advance())) { } });
|
||
this.treeLen = pos;
|
||
this.tree = tree;
|
||
this.fragments = this.withoutTempSkipped(dist/* TreeFragment */.rr.addTree(this.tree, this.fragments, true));
|
||
this.parse = null;
|
||
}
|
||
}
|
||
withContext(f) {
|
||
let prev = currentContext;
|
||
currentContext = this;
|
||
try {
|
||
return f();
|
||
}
|
||
finally {
|
||
currentContext = prev;
|
||
}
|
||
}
|
||
withoutTempSkipped(fragments) {
|
||
for (let r; r = this.tempSkipped.pop();)
|
||
fragments = cutFragments(fragments, r.from, r.to);
|
||
return fragments;
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
changes(changes, newState) {
|
||
let { fragments, tree, treeLen, viewport, skipped } = this;
|
||
this.takeTree();
|
||
if (!changes.empty) {
|
||
let ranges = [];
|
||
changes.iterChangedRanges((fromA, toA, fromB, toB) => ranges.push({ fromA, toA, fromB, toB }));
|
||
fragments = dist/* TreeFragment */.rr.applyChanges(fragments, ranges);
|
||
tree = dist/* Tree */.PH.empty;
|
||
treeLen = 0;
|
||
viewport = { from: changes.mapPos(viewport.from, -1), to: changes.mapPos(viewport.to, 1) };
|
||
if (this.skipped.length) {
|
||
skipped = [];
|
||
for (let r of this.skipped) {
|
||
let from = changes.mapPos(r.from, 1), to = changes.mapPos(r.to, -1);
|
||
if (from < to)
|
||
skipped.push({ from, to });
|
||
}
|
||
}
|
||
}
|
||
return new ParseContext(this.parser, newState, fragments, tree, treeLen, viewport, skipped, this.scheduleOn);
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
updateViewport(viewport) {
|
||
if (this.viewport.from == viewport.from && this.viewport.to == viewport.to)
|
||
return false;
|
||
this.viewport = viewport;
|
||
let startLen = this.skipped.length;
|
||
for (let i = 0; i < this.skipped.length; i++) {
|
||
let { from, to } = this.skipped[i];
|
||
if (from < viewport.to && to > viewport.from) {
|
||
this.fragments = cutFragments(this.fragments, from, to);
|
||
this.skipped.splice(i--, 1);
|
||
}
|
||
}
|
||
if (this.skipped.length >= startLen)
|
||
return false;
|
||
this.reset();
|
||
return true;
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
reset() {
|
||
if (this.parse) {
|
||
this.takeTree();
|
||
this.parse = null;
|
||
}
|
||
}
|
||
/**
|
||
Notify the parse scheduler that the given region was skipped
|
||
because it wasn't in view, and the parse should be restarted
|
||
when it comes into view.
|
||
*/
|
||
skipUntilInView(from, to) {
|
||
this.skipped.push({ from, to });
|
||
}
|
||
/**
|
||
Returns a parser intended to be used as placeholder when
|
||
asynchronously loading a nested parser. It'll skip its input and
|
||
mark it as not-really-parsed, so that the next update will parse
|
||
it again.
|
||
|
||
When `until` is given, a reparse will be scheduled when that
|
||
promise resolves.
|
||
*/
|
||
static getSkippingParser(until) {
|
||
return new class extends dist/* Parser */.iX {
|
||
createParse(input, fragments, ranges) {
|
||
let from = ranges[0].from, to = ranges[ranges.length - 1].to;
|
||
let parser = {
|
||
parsedPos: from,
|
||
advance() {
|
||
let cx = currentContext;
|
||
if (cx) {
|
||
for (let r of ranges)
|
||
cx.tempSkipped.push(r);
|
||
if (until)
|
||
cx.scheduleOn = cx.scheduleOn ? Promise.all([cx.scheduleOn, until]) : until;
|
||
}
|
||
this.parsedPos = to;
|
||
return new dist/* Tree */.PH(dist/* NodeType */.Z6.none, [], [], to - from);
|
||
},
|
||
stoppedAt: null,
|
||
stopAt() { }
|
||
};
|
||
return parser;
|
||
}
|
||
};
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
isDone(upto) {
|
||
upto = Math.min(upto, this.state.doc.length);
|
||
let frags = this.fragments;
|
||
return this.treeLen >= upto && frags.length && frags[0].from == 0 && frags[0].to >= upto;
|
||
}
|
||
/**
|
||
Get the context for the current parse, or `null` if no editor
|
||
parse is in progress.
|
||
*/
|
||
static get() { return currentContext; }
|
||
}
|
||
function cutFragments(fragments, from, to) {
|
||
return dist/* TreeFragment */.rr.applyChanges(fragments, [{ fromA: from, toA: to, fromB: from, toB: to }]);
|
||
}
|
||
class LanguageState {
|
||
constructor(
|
||
// A mutable parse state that is used to preserve work done during
|
||
// the lifetime of a state when moving to the next state.
|
||
context) {
|
||
this.context = context;
|
||
this.tree = context.tree;
|
||
}
|
||
apply(tr) {
|
||
if (!tr.docChanged && this.tree == this.context.tree)
|
||
return this;
|
||
let newCx = this.context.changes(tr.changes, tr.state);
|
||
// If the previous parse wasn't done, go forward only up to its
|
||
// end position or the end of the viewport, to avoid slowing down
|
||
// state updates with parse work beyond the viewport.
|
||
let upto = this.context.treeLen == tr.startState.doc.length ? undefined
|
||
: Math.max(tr.changes.mapPos(this.context.treeLen), newCx.viewport.to);
|
||
if (!newCx.work(20 /* Work.Apply */, upto))
|
||
newCx.takeTree();
|
||
return new LanguageState(newCx);
|
||
}
|
||
static init(state) {
|
||
let vpTo = Math.min(3000 /* Work.InitViewport */, state.doc.length);
|
||
let parseState = ParseContext.create(state.facet(language).parser, state, { from: 0, to: vpTo });
|
||
if (!parseState.work(20 /* Work.Apply */, vpTo))
|
||
parseState.takeTree();
|
||
return new LanguageState(parseState);
|
||
}
|
||
}
|
||
Language.state = /*@__PURE__*/state_.StateField.define({
|
||
create: LanguageState.init,
|
||
update(value, tr) {
|
||
for (let e of tr.effects)
|
||
if (e.is(Language.setState))
|
||
return e.value;
|
||
if (tr.startState.facet(language) != tr.state.facet(language))
|
||
return LanguageState.init(tr.state);
|
||
return value.apply(tr);
|
||
}
|
||
});
|
||
let requestIdle = (callback) => {
|
||
let timeout = setTimeout(() => callback(), 500 /* Work.MaxPause */);
|
||
return () => clearTimeout(timeout);
|
||
};
|
||
if (typeof requestIdleCallback != "undefined")
|
||
requestIdle = (callback) => {
|
||
let idle = -1, timeout = setTimeout(() => {
|
||
idle = requestIdleCallback(callback, { timeout: 500 /* Work.MaxPause */ - 100 /* Work.MinPause */ });
|
||
}, 100 /* Work.MinPause */);
|
||
return () => idle < 0 ? clearTimeout(timeout) : cancelIdleCallback(idle);
|
||
};
|
||
const isInputPending = typeof navigator != "undefined" && ((_a = navigator.scheduling) === null || _a === void 0 ? void 0 : _a.isInputPending)
|
||
? () => navigator.scheduling.isInputPending() : null;
|
||
const parseWorker = /*@__PURE__*/view_.ViewPlugin.fromClass(class ParseWorker {
|
||
constructor(view) {
|
||
this.view = view;
|
||
this.working = null;
|
||
this.workScheduled = 0;
|
||
// End of the current time chunk
|
||
this.chunkEnd = -1;
|
||
// Milliseconds of budget left for this chunk
|
||
this.chunkBudget = -1;
|
||
this.work = this.work.bind(this);
|
||
this.scheduleWork();
|
||
}
|
||
update(update) {
|
||
let cx = this.view.state.field(Language.state).context;
|
||
if (cx.updateViewport(update.view.viewport) || this.view.viewport.to > cx.treeLen)
|
||
this.scheduleWork();
|
||
if (update.docChanged || update.selectionSet) {
|
||
if (this.view.hasFocus)
|
||
this.chunkBudget += 50 /* Work.ChangeBonus */;
|
||
this.scheduleWork();
|
||
}
|
||
this.checkAsyncSchedule(cx);
|
||
}
|
||
scheduleWork() {
|
||
if (this.working)
|
||
return;
|
||
let { state } = this.view, field = state.field(Language.state);
|
||
if (field.tree != field.context.tree || !field.context.isDone(state.doc.length))
|
||
this.working = requestIdle(this.work);
|
||
}
|
||
work(deadline) {
|
||
this.working = null;
|
||
let now = Date.now();
|
||
if (this.chunkEnd < now && (this.chunkEnd < 0 || this.view.hasFocus)) { // Start a new chunk
|
||
this.chunkEnd = now + 30000 /* Work.ChunkTime */;
|
||
this.chunkBudget = 3000 /* Work.ChunkBudget */;
|
||
}
|
||
if (this.chunkBudget <= 0)
|
||
return; // No more budget
|
||
let { state, viewport: { to: vpTo } } = this.view, field = state.field(Language.state);
|
||
if (field.tree == field.context.tree && field.context.isDone(vpTo + 100000 /* Work.MaxParseAhead */))
|
||
return;
|
||
let endTime = Date.now() + Math.min(this.chunkBudget, 100 /* Work.Slice */, deadline && !isInputPending ? Math.max(25 /* Work.MinSlice */, deadline.timeRemaining() - 5) : 1e9);
|
||
let viewportFirst = field.context.treeLen < vpTo && state.doc.length > vpTo + 1000;
|
||
let done = field.context.work(() => {
|
||
return isInputPending && isInputPending() || Date.now() > endTime;
|
||
}, vpTo + (viewportFirst ? 0 : 100000 /* Work.MaxParseAhead */));
|
||
this.chunkBudget -= Date.now() - now;
|
||
if (done || this.chunkBudget <= 0) {
|
||
field.context.takeTree();
|
||
this.view.dispatch({ effects: Language.setState.of(new LanguageState(field.context)) });
|
||
}
|
||
if (this.chunkBudget > 0 && !(done && !viewportFirst))
|
||
this.scheduleWork();
|
||
this.checkAsyncSchedule(field.context);
|
||
}
|
||
checkAsyncSchedule(cx) {
|
||
if (cx.scheduleOn) {
|
||
this.workScheduled++;
|
||
cx.scheduleOn
|
||
.then(() => this.scheduleWork())
|
||
.catch(err => (0,view_.logException)(this.view.state, err))
|
||
.then(() => this.workScheduled--);
|
||
cx.scheduleOn = null;
|
||
}
|
||
}
|
||
destroy() {
|
||
if (this.working)
|
||
this.working();
|
||
}
|
||
isWorking() {
|
||
return !!(this.working || this.workScheduled > 0);
|
||
}
|
||
}, {
|
||
eventHandlers: { focus() { this.scheduleWork(); } }
|
||
});
|
||
/**
|
||
The facet used to associate a language with an editor state. Used
|
||
by `Language` object's `extension` property (so you don't need to
|
||
manually wrap your languages in this). Can be used to access the
|
||
current language on a state.
|
||
*/
|
||
const language = /*@__PURE__*/state_.Facet.define({
|
||
combine(languages) { return languages.length ? languages[0] : null; },
|
||
enables: language => [
|
||
Language.state,
|
||
parseWorker,
|
||
view_.EditorView.contentAttributes.compute([language], state => {
|
||
let lang = state.facet(language);
|
||
return lang && lang.name ? { "data-language": lang.name } : {};
|
||
})
|
||
]
|
||
});
|
||
/**
|
||
This class bundles a [language](https://codemirror.net/6/docs/ref/#language.Language) with an
|
||
optional set of supporting extensions. Language packages are
|
||
encouraged to export a function that optionally takes a
|
||
configuration object and returns a `LanguageSupport` instance, as
|
||
the main way for client code to use the package.
|
||
*/
|
||
class LanguageSupport {
|
||
/**
|
||
Create a language support object.
|
||
*/
|
||
constructor(
|
||
/**
|
||
The language object.
|
||
*/
|
||
language,
|
||
/**
|
||
An optional set of supporting extensions. When nesting a
|
||
language in another language, the outer language is encouraged
|
||
to include the supporting extensions for its inner languages
|
||
in its own set of support extensions.
|
||
*/
|
||
support = []) {
|
||
this.language = language;
|
||
this.support = support;
|
||
this.extension = [language, support];
|
||
}
|
||
}
|
||
/**
|
||
Language descriptions are used to store metadata about languages
|
||
and to dynamically load them. Their main role is finding the
|
||
appropriate language for a filename or dynamically loading nested
|
||
parsers.
|
||
*/
|
||
class LanguageDescription {
|
||
constructor(
|
||
/**
|
||
The name of this language.
|
||
*/
|
||
name,
|
||
/**
|
||
Alternative names for the mode (lowercased, includes `this.name`).
|
||
*/
|
||
alias,
|
||
/**
|
||
File extensions associated with this language.
|
||
*/
|
||
extensions,
|
||
/**
|
||
Optional filename pattern that should be associated with this
|
||
language.
|
||
*/
|
||
filename, loadFunc,
|
||
/**
|
||
If the language has been loaded, this will hold its value.
|
||
*/
|
||
support = undefined) {
|
||
this.name = name;
|
||
this.alias = alias;
|
||
this.extensions = extensions;
|
||
this.filename = filename;
|
||
this.loadFunc = loadFunc;
|
||
this.support = support;
|
||
this.loading = null;
|
||
}
|
||
/**
|
||
Start loading the the language. Will return a promise that
|
||
resolves to a [`LanguageSupport`](https://codemirror.net/6/docs/ref/#language.LanguageSupport)
|
||
object when the language successfully loads.
|
||
*/
|
||
load() {
|
||
return this.loading || (this.loading = this.loadFunc().then(support => this.support = support, err => { this.loading = null; throw err; }));
|
||
}
|
||
/**
|
||
Create a language description.
|
||
*/
|
||
static of(spec) {
|
||
let { load, support } = spec;
|
||
if (!load) {
|
||
if (!support)
|
||
throw new RangeError("Must pass either 'load' or 'support' to LanguageDescription.of");
|
||
load = () => Promise.resolve(support);
|
||
}
|
||
return new LanguageDescription(spec.name, (spec.alias || []).concat(spec.name).map(s => s.toLowerCase()), spec.extensions || [], spec.filename, load, support);
|
||
}
|
||
/**
|
||
Look for a language in the given array of descriptions that
|
||
matches the filename. Will first match
|
||
[`filename`](https://codemirror.net/6/docs/ref/#language.LanguageDescription.filename) patterns,
|
||
and then [extensions](https://codemirror.net/6/docs/ref/#language.LanguageDescription.extensions),
|
||
and return the first language that matches.
|
||
*/
|
||
static matchFilename(descs, filename) {
|
||
for (let d of descs)
|
||
if (d.filename && d.filename.test(filename))
|
||
return d;
|
||
let ext = /\.([^.]+)$/.exec(filename);
|
||
if (ext)
|
||
for (let d of descs)
|
||
if (d.extensions.indexOf(ext[1]) > -1)
|
||
return d;
|
||
return null;
|
||
}
|
||
/**
|
||
Look for a language whose name or alias matches the the given
|
||
name (case-insensitively). If `fuzzy` is true, and no direct
|
||
matchs is found, this'll also search for a language whose name
|
||
or alias occurs in the string (for names shorter than three
|
||
characters, only when surrounded by non-word characters).
|
||
*/
|
||
static matchLanguageName(descs, name, fuzzy = true) {
|
||
name = name.toLowerCase();
|
||
for (let d of descs)
|
||
if (d.alias.some(a => a == name))
|
||
return d;
|
||
if (fuzzy)
|
||
for (let d of descs)
|
||
for (let a of d.alias) {
|
||
let found = name.indexOf(a);
|
||
if (found > -1 && (a.length > 2 || !/\w/.test(name[found - 1]) && !/\w/.test(name[found + a.length])))
|
||
return d;
|
||
}
|
||
return null;
|
||
}
|
||
}
|
||
|
||
/**
|
||
Facet that defines a way to provide a function that computes the
|
||
appropriate indentation depth, as a column number (see
|
||
[`indentString`](https://codemirror.net/6/docs/ref/#language.indentString)), at the start of a given
|
||
line. A return value of `null` indicates no indentation can be
|
||
determined, and the line should inherit the indentation of the one
|
||
above it. A return value of `undefined` defers to the next indent
|
||
service.
|
||
*/
|
||
const indentService = /*@__PURE__*/state_.Facet.define();
|
||
/**
|
||
Facet for overriding the unit by which indentation happens. Should
|
||
be a string consisting entirely of the same whitespace character.
|
||
When not set, this defaults to 2 spaces.
|
||
*/
|
||
const indentUnit = /*@__PURE__*/state_.Facet.define({
|
||
combine: values => {
|
||
if (!values.length)
|
||
return " ";
|
||
let unit = values[0];
|
||
if (!unit || /\S/.test(unit) || Array.from(unit).some(e => e != unit[0]))
|
||
throw new Error("Invalid indent unit: " + JSON.stringify(values[0]));
|
||
return unit;
|
||
}
|
||
});
|
||
/**
|
||
Return the _column width_ of an indent unit in the state.
|
||
Determined by the [`indentUnit`](https://codemirror.net/6/docs/ref/#language.indentUnit)
|
||
facet, and [`tabSize`](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize) when that
|
||
contains tabs.
|
||
*/
|
||
function getIndentUnit(state) {
|
||
let unit = state.facet(indentUnit);
|
||
return unit.charCodeAt(0) == 9 ? state.tabSize * unit.length : unit.length;
|
||
}
|
||
/**
|
||
Create an indentation string that covers columns 0 to `cols`.
|
||
Will use tabs for as much of the columns as possible when the
|
||
[`indentUnit`](https://codemirror.net/6/docs/ref/#language.indentUnit) facet contains
|
||
tabs.
|
||
*/
|
||
function indentString(state, cols) {
|
||
let result = "", ts = state.tabSize, ch = state.facet(indentUnit)[0];
|
||
if (ch == "\t") {
|
||
while (cols >= ts) {
|
||
result += "\t";
|
||
cols -= ts;
|
||
}
|
||
ch = " ";
|
||
}
|
||
for (let i = 0; i < cols; i++)
|
||
result += ch;
|
||
return result;
|
||
}
|
||
/**
|
||
Get the indentation, as a column number, at the given position.
|
||
Will first consult any [indent services](https://codemirror.net/6/docs/ref/#language.indentService)
|
||
that are registered, and if none of those return an indentation,
|
||
this will check the syntax tree for the [indent node
|
||
prop](https://codemirror.net/6/docs/ref/#language.indentNodeProp) and use that if found. Returns a
|
||
number when an indentation could be determined, and null
|
||
otherwise.
|
||
*/
|
||
function getIndentation(context, pos) {
|
||
if (context instanceof state_.EditorState)
|
||
context = new IndentContext(context);
|
||
for (let service of context.state.facet(indentService)) {
|
||
let result = service(context, pos);
|
||
if (result !== undefined)
|
||
return result;
|
||
}
|
||
let tree = syntaxTree(context.state);
|
||
return tree.length >= pos ? syntaxIndentation(context, tree, pos) : null;
|
||
}
|
||
/**
|
||
Create a change set that auto-indents all lines touched by the
|
||
given document range.
|
||
*/
|
||
function indentRange(state, from, to) {
|
||
let updated = Object.create(null);
|
||
let context = new IndentContext(state, { overrideIndentation: start => { var _a; return (_a = updated[start]) !== null && _a !== void 0 ? _a : -1; } });
|
||
let changes = [];
|
||
for (let pos = from; pos <= to;) {
|
||
let line = state.doc.lineAt(pos);
|
||
pos = line.to + 1;
|
||
let indent = getIndentation(context, line.from);
|
||
if (indent == null)
|
||
continue;
|
||
if (!/\S/.test(line.text))
|
||
indent = 0;
|
||
let cur = /^\s*/.exec(line.text)[0];
|
||
let norm = indentString(state, indent);
|
||
if (cur != norm) {
|
||
updated[line.from] = indent;
|
||
changes.push({ from: line.from, to: line.from + cur.length, insert: norm });
|
||
}
|
||
}
|
||
return state.changes(changes);
|
||
}
|
||
/**
|
||
Indentation contexts are used when calling [indentation
|
||
services](https://codemirror.net/6/docs/ref/#language.indentService). They provide helper utilities
|
||
useful in indentation logic, and can selectively override the
|
||
indentation reported for some lines.
|
||
*/
|
||
class IndentContext {
|
||
/**
|
||
Create an indent context.
|
||
*/
|
||
constructor(
|
||
/**
|
||
The editor state.
|
||
*/
|
||
state,
|
||
/**
|
||
@internal
|
||
*/
|
||
options = {}) {
|
||
this.state = state;
|
||
this.options = options;
|
||
this.unit = getIndentUnit(state);
|
||
}
|
||
/**
|
||
Get a description of the line at the given position, taking
|
||
[simulated line
|
||
breaks](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)
|
||
into account. If there is such a break at `pos`, the `bias`
|
||
argument determines whether the part of the line line before or
|
||
after the break is used.
|
||
*/
|
||
lineAt(pos, bias = 1) {
|
||
let line = this.state.doc.lineAt(pos);
|
||
let { simulateBreak, simulateDoubleBreak } = this.options;
|
||
if (simulateBreak != null && simulateBreak >= line.from && simulateBreak <= line.to) {
|
||
if (simulateDoubleBreak && simulateBreak == pos)
|
||
return { text: "", from: pos };
|
||
else if (bias < 0 ? simulateBreak < pos : simulateBreak <= pos)
|
||
return { text: line.text.slice(simulateBreak - line.from), from: simulateBreak };
|
||
else
|
||
return { text: line.text.slice(0, simulateBreak - line.from), from: line.from };
|
||
}
|
||
return line;
|
||
}
|
||
/**
|
||
Get the text directly after `pos`, either the entire line
|
||
or the next 100 characters, whichever is shorter.
|
||
*/
|
||
textAfterPos(pos, bias = 1) {
|
||
if (this.options.simulateDoubleBreak && pos == this.options.simulateBreak)
|
||
return "";
|
||
let { text, from } = this.lineAt(pos, bias);
|
||
return text.slice(pos - from, Math.min(text.length, pos + 100 - from));
|
||
}
|
||
/**
|
||
Find the column for the given position.
|
||
*/
|
||
column(pos, bias = 1) {
|
||
let { text, from } = this.lineAt(pos, bias);
|
||
let result = this.countColumn(text, pos - from);
|
||
let override = this.options.overrideIndentation ? this.options.overrideIndentation(from) : -1;
|
||
if (override > -1)
|
||
result += override - this.countColumn(text, text.search(/\S|$/));
|
||
return result;
|
||
}
|
||
/**
|
||
Find the column position (taking tabs into account) of the given
|
||
position in the given string.
|
||
*/
|
||
countColumn(line, pos = line.length) {
|
||
return (0,state_.countColumn)(line, this.state.tabSize, pos);
|
||
}
|
||
/**
|
||
Find the indentation column of the line at the given point.
|
||
*/
|
||
lineIndent(pos, bias = 1) {
|
||
let { text, from } = this.lineAt(pos, bias);
|
||
let override = this.options.overrideIndentation;
|
||
if (override) {
|
||
let overriden = override(from);
|
||
if (overriden > -1)
|
||
return overriden;
|
||
}
|
||
return this.countColumn(text, text.search(/\S|$/));
|
||
}
|
||
/**
|
||
Returns the [simulated line
|
||
break](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)
|
||
for this context, if any.
|
||
*/
|
||
get simulatedBreak() {
|
||
return this.options.simulateBreak || null;
|
||
}
|
||
}
|
||
/**
|
||
A syntax tree node prop used to associate indentation strategies
|
||
with node types. Such a strategy is a function from an indentation
|
||
context to a column number (see also
|
||
[`indentString`](https://codemirror.net/6/docs/ref/#language.indentString)) or null, where null
|
||
indicates that no definitive indentation can be determined.
|
||
*/
|
||
const indentNodeProp = /*@__PURE__*/new dist/* NodeProp */.uY();
|
||
// Compute the indentation for a given position from the syntax tree.
|
||
function syntaxIndentation(cx, ast, pos) {
|
||
let stack = ast.resolveStack(pos);
|
||
let inner = ast.resolveInner(pos, -1).resolve(pos, 0).enterUnfinishedNodesBefore(pos);
|
||
if (inner != stack.node) {
|
||
let add = [];
|
||
for (let cur = inner; cur && !(cur.from < stack.node.from || cur.to > stack.node.to ||
|
||
cur.from == stack.node.from && cur.type == stack.node.type); cur = cur.parent)
|
||
add.push(cur);
|
||
for (let i = add.length - 1; i >= 0; i--)
|
||
stack = { node: add[i], next: stack };
|
||
}
|
||
return indentFor(stack, cx, pos);
|
||
}
|
||
function indentFor(stack, cx, pos) {
|
||
for (let cur = stack; cur; cur = cur.next) {
|
||
let strategy = indentStrategy(cur.node);
|
||
if (strategy)
|
||
return strategy(TreeIndentContext.create(cx, pos, cur));
|
||
}
|
||
return 0;
|
||
}
|
||
function ignoreClosed(cx) {
|
||
return cx.pos == cx.options.simulateBreak && cx.options.simulateDoubleBreak;
|
||
}
|
||
function indentStrategy(tree) {
|
||
let strategy = tree.type.prop(indentNodeProp);
|
||
if (strategy)
|
||
return strategy;
|
||
let first = tree.firstChild, close;
|
||
if (first && (close = first.type.prop(dist/* NodeProp */.uY.closedBy))) {
|
||
let last = tree.lastChild, closed = last && close.indexOf(last.name) > -1;
|
||
return cx => delimitedStrategy(cx, true, 1, undefined, closed && !ignoreClosed(cx) ? last.from : undefined);
|
||
}
|
||
return tree.parent == null ? topIndent : null;
|
||
}
|
||
function topIndent() { return 0; }
|
||
/**
|
||
Objects of this type provide context information and helper
|
||
methods to indentation functions registered on syntax nodes.
|
||
*/
|
||
class TreeIndentContext extends IndentContext {
|
||
constructor(base,
|
||
/**
|
||
The position at which indentation is being computed.
|
||
*/
|
||
pos,
|
||
/**
|
||
@internal
|
||
*/
|
||
context) {
|
||
super(base.state, base.options);
|
||
this.base = base;
|
||
this.pos = pos;
|
||
this.context = context;
|
||
}
|
||
/**
|
||
The syntax tree node to which the indentation strategy
|
||
applies.
|
||
*/
|
||
get node() { return this.context.node; }
|
||
/**
|
||
@internal
|
||
*/
|
||
static create(base, pos, context) {
|
||
return new TreeIndentContext(base, pos, context);
|
||
}
|
||
/**
|
||
Get the text directly after `this.pos`, either the entire line
|
||
or the next 100 characters, whichever is shorter.
|
||
*/
|
||
get textAfter() {
|
||
return this.textAfterPos(this.pos);
|
||
}
|
||
/**
|
||
Get the indentation at the reference line for `this.node`, which
|
||
is the line on which it starts, unless there is a node that is
|
||
_not_ a parent of this node covering the start of that line. If
|
||
so, the line at the start of that node is tried, again skipping
|
||
on if it is covered by another such node.
|
||
*/
|
||
get baseIndent() {
|
||
return this.baseIndentFor(this.node);
|
||
}
|
||
/**
|
||
Get the indentation for the reference line of the given node
|
||
(see [`baseIndent`](https://codemirror.net/6/docs/ref/#language.TreeIndentContext.baseIndent)).
|
||
*/
|
||
baseIndentFor(node) {
|
||
let line = this.state.doc.lineAt(node.from);
|
||
// Skip line starts that are covered by a sibling (or cousin, etc)
|
||
for (;;) {
|
||
let atBreak = node.resolve(line.from);
|
||
while (atBreak.parent && atBreak.parent.from == atBreak.from)
|
||
atBreak = atBreak.parent;
|
||
if (isParent(atBreak, node))
|
||
break;
|
||
line = this.state.doc.lineAt(atBreak.from);
|
||
}
|
||
return this.lineIndent(line.from);
|
||
}
|
||
/**
|
||
Continue looking for indentations in the node's parent nodes,
|
||
and return the result of that.
|
||
*/
|
||
continue() {
|
||
return indentFor(this.context.next, this.base, this.pos);
|
||
}
|
||
}
|
||
function isParent(parent, of) {
|
||
for (let cur = of; cur; cur = cur.parent)
|
||
if (parent == cur)
|
||
return true;
|
||
return false;
|
||
}
|
||
// Check whether a delimited node is aligned (meaning there are
|
||
// non-skipped nodes on the same line as the opening delimiter). And
|
||
// if so, return the opening token.
|
||
function bracketedAligned(context) {
|
||
let tree = context.node;
|
||
let openToken = tree.childAfter(tree.from), last = tree.lastChild;
|
||
if (!openToken)
|
||
return null;
|
||
let sim = context.options.simulateBreak;
|
||
let openLine = context.state.doc.lineAt(openToken.from);
|
||
let lineEnd = sim == null || sim <= openLine.from ? openLine.to : Math.min(openLine.to, sim);
|
||
for (let pos = openToken.to;;) {
|
||
let next = tree.childAfter(pos);
|
||
if (!next || next == last)
|
||
return null;
|
||
if (!next.type.isSkipped) {
|
||
if (next.from >= lineEnd)
|
||
return null;
|
||
let space = /^ */.exec(openLine.text.slice(openToken.to - openLine.from))[0].length;
|
||
return { from: openToken.from, to: openToken.to + space };
|
||
}
|
||
pos = next.to;
|
||
}
|
||
}
|
||
/**
|
||
An indentation strategy for delimited (usually bracketed) nodes.
|
||
Will, by default, indent one unit more than the parent's base
|
||
indent unless the line starts with a closing token. When `align`
|
||
is true and there are non-skipped nodes on the node's opening
|
||
line, the content of the node will be aligned with the end of the
|
||
opening node, like this:
|
||
|
||
foo(bar,
|
||
baz)
|
||
*/
|
||
function delimitedIndent({ closing, align = true, units = 1 }) {
|
||
return (context) => delimitedStrategy(context, align, units, closing);
|
||
}
|
||
function delimitedStrategy(context, align, units, closing, closedAt) {
|
||
let after = context.textAfter, space = after.match(/^\s*/)[0].length;
|
||
let closed = closing && after.slice(space, space + closing.length) == closing || closedAt == context.pos + space;
|
||
let aligned = align ? bracketedAligned(context) : null;
|
||
if (aligned)
|
||
return closed ? context.column(aligned.from) : context.column(aligned.to);
|
||
return context.baseIndent + (closed ? 0 : context.unit * units);
|
||
}
|
||
/**
|
||
An indentation strategy that aligns a node's content to its base
|
||
indentation.
|
||
*/
|
||
const flatIndent = (context) => context.baseIndent;
|
||
/**
|
||
Creates an indentation strategy that, by default, indents
|
||
continued lines one unit more than the node's base indentation.
|
||
You can provide `except` to prevent indentation of lines that
|
||
match a pattern (for example `/^else\b/` in `if`/`else`
|
||
constructs), and you can change the amount of units used with the
|
||
`units` option.
|
||
*/
|
||
function continuedIndent({ except, units = 1 } = {}) {
|
||
return (context) => {
|
||
let matchExcept = except && except.test(context.textAfter);
|
||
return context.baseIndent + (matchExcept ? 0 : units * context.unit);
|
||
};
|
||
}
|
||
const DontIndentBeyond = 200;
|
||
/**
|
||
Enables reindentation on input. When a language defines an
|
||
`indentOnInput` field in its [language
|
||
data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt), which must hold a regular
|
||
expression, the line at the cursor will be reindented whenever new
|
||
text is typed and the input from the start of the line up to the
|
||
cursor matches that regexp.
|
||
|
||
To avoid unneccesary reindents, it is recommended to start the
|
||
regexp with `^` (usually followed by `\s*`), and end it with `$`.
|
||
For example, `/^\s*\}$/` will reindent when a closing brace is
|
||
added at the start of a line.
|
||
*/
|
||
function indentOnInput() {
|
||
return state_.EditorState.transactionFilter.of(tr => {
|
||
if (!tr.docChanged || !tr.isUserEvent("input.type") && !tr.isUserEvent("input.complete"))
|
||
return tr;
|
||
let rules = tr.startState.languageDataAt("indentOnInput", tr.startState.selection.main.head);
|
||
if (!rules.length)
|
||
return tr;
|
||
let doc = tr.newDoc, { head } = tr.newSelection.main, line = doc.lineAt(head);
|
||
if (head > line.from + DontIndentBeyond)
|
||
return tr;
|
||
let lineStart = doc.sliceString(line.from, head);
|
||
if (!rules.some(r => r.test(lineStart)))
|
||
return tr;
|
||
let { state } = tr, last = -1, changes = [];
|
||
for (let { head } of state.selection.ranges) {
|
||
let line = state.doc.lineAt(head);
|
||
if (line.from == last)
|
||
continue;
|
||
last = line.from;
|
||
let indent = getIndentation(state, line.from);
|
||
if (indent == null)
|
||
continue;
|
||
let cur = /^\s*/.exec(line.text)[0];
|
||
let norm = indentString(state, indent);
|
||
if (cur != norm)
|
||
changes.push({ from: line.from, to: line.from + cur.length, insert: norm });
|
||
}
|
||
return changes.length ? [tr, { changes, sequential: true }] : tr;
|
||
});
|
||
}
|
||
|
||
/**
|
||
A facet that registers a code folding service. When called with
|
||
the extent of a line, such a function should return a foldable
|
||
range that starts on that line (but continues beyond it), if one
|
||
can be found.
|
||
*/
|
||
const foldService = /*@__PURE__*/state_.Facet.define();
|
||
/**
|
||
This node prop is used to associate folding information with
|
||
syntax node types. Given a syntax node, it should check whether
|
||
that tree is foldable and return the range that can be collapsed
|
||
when it is.
|
||
*/
|
||
const foldNodeProp = /*@__PURE__*/new dist/* NodeProp */.uY();
|
||
/**
|
||
[Fold](https://codemirror.net/6/docs/ref/#language.foldNodeProp) function that folds everything but
|
||
the first and the last child of a syntax node. Useful for nodes
|
||
that start and end with delimiters.
|
||
*/
|
||
function foldInside(node) {
|
||
let first = node.firstChild, last = node.lastChild;
|
||
return first && first.to < last.from ? { from: first.to, to: last.type.isError ? node.to : last.from } : null;
|
||
}
|
||
function syntaxFolding(state, start, end) {
|
||
let tree = syntaxTree(state);
|
||
if (tree.length < end)
|
||
return null;
|
||
let stack = tree.resolveStack(end, 1);
|
||
let found = null;
|
||
for (let iter = stack; iter; iter = iter.next) {
|
||
let cur = iter.node;
|
||
if (cur.to <= end || cur.from > end)
|
||
continue;
|
||
if (found && cur.from < start)
|
||
break;
|
||
let prop = cur.type.prop(foldNodeProp);
|
||
if (prop && (cur.to < tree.length - 50 || tree.length == state.doc.length || !isUnfinished(cur))) {
|
||
let value = prop(cur, state);
|
||
if (value && value.from <= end && value.from >= start && value.to > end)
|
||
found = value;
|
||
}
|
||
}
|
||
return found;
|
||
}
|
||
function isUnfinished(node) {
|
||
let ch = node.lastChild;
|
||
return ch && ch.to == node.to && ch.type.isError;
|
||
}
|
||
/**
|
||
Check whether the given line is foldable. First asks any fold
|
||
services registered through
|
||
[`foldService`](https://codemirror.net/6/docs/ref/#language.foldService), and if none of them return
|
||
a result, tries to query the [fold node
|
||
prop](https://codemirror.net/6/docs/ref/#language.foldNodeProp) of syntax nodes that cover the end
|
||
of the line.
|
||
*/
|
||
function foldable(state, lineStart, lineEnd) {
|
||
for (let service of state.facet(foldService)) {
|
||
let result = service(state, lineStart, lineEnd);
|
||
if (result)
|
||
return result;
|
||
}
|
||
return syntaxFolding(state, lineStart, lineEnd);
|
||
}
|
||
function mapRange(range, mapping) {
|
||
let from = mapping.mapPos(range.from, 1), to = mapping.mapPos(range.to, -1);
|
||
return from >= to ? undefined : { from, to };
|
||
}
|
||
/**
|
||
State effect that can be attached to a transaction to fold the
|
||
given range. (You probably only need this in exceptional
|
||
circumstances—usually you'll just want to let
|
||
[`foldCode`](https://codemirror.net/6/docs/ref/#language.foldCode) and the [fold
|
||
gutter](https://codemirror.net/6/docs/ref/#language.foldGutter) create the transactions.)
|
||
*/
|
||
const foldEffect = /*@__PURE__*/state_.StateEffect.define({ map: mapRange });
|
||
/**
|
||
State effect that unfolds the given range (if it was folded).
|
||
*/
|
||
const unfoldEffect = /*@__PURE__*/state_.StateEffect.define({ map: mapRange });
|
||
function selectedLines(view) {
|
||
let lines = [];
|
||
for (let { head } of view.state.selection.ranges) {
|
||
if (lines.some(l => l.from <= head && l.to >= head))
|
||
continue;
|
||
lines.push(view.lineBlockAt(head));
|
||
}
|
||
return lines;
|
||
}
|
||
/**
|
||
The state field that stores the folded ranges (as a [decoration
|
||
set](https://codemirror.net/6/docs/ref/#view.DecorationSet)). Can be passed to
|
||
[`EditorState.toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) and
|
||
[`fromJSON`](https://codemirror.net/6/docs/ref/#state.EditorState^fromJSON) to serialize the fold
|
||
state.
|
||
*/
|
||
const foldState = /*@__PURE__*/state_.StateField.define({
|
||
create() {
|
||
return view_.Decoration.none;
|
||
},
|
||
update(folded, tr) {
|
||
if (tr.isUserEvent("delete"))
|
||
tr.changes.iterChangedRanges((fromA, toA) => folded = clearTouchedFolds(folded, fromA, toA));
|
||
folded = folded.map(tr.changes);
|
||
for (let e of tr.effects) {
|
||
if (e.is(foldEffect) && !foldExists(folded, e.value.from, e.value.to)) {
|
||
let { preparePlaceholder } = tr.state.facet(foldConfig);
|
||
let widget = !preparePlaceholder ? foldWidget :
|
||
view_.Decoration.replace({ widget: new PreparedFoldWidget(preparePlaceholder(tr.state, e.value)) });
|
||
folded = folded.update({ add: [widget.range(e.value.from, e.value.to)] });
|
||
}
|
||
else if (e.is(unfoldEffect)) {
|
||
folded = folded.update({ filter: (from, to) => e.value.from != from || e.value.to != to,
|
||
filterFrom: e.value.from, filterTo: e.value.to });
|
||
}
|
||
}
|
||
// Clear folded ranges that cover the selection head
|
||
if (tr.selection)
|
||
folded = clearTouchedFolds(folded, tr.selection.main.head);
|
||
return folded;
|
||
},
|
||
provide: f => view_.EditorView.decorations.from(f),
|
||
toJSON(folded, state) {
|
||
let ranges = [];
|
||
folded.between(0, state.doc.length, (from, to) => { ranges.push(from, to); });
|
||
return ranges;
|
||
},
|
||
fromJSON(value) {
|
||
if (!Array.isArray(value) || value.length % 2)
|
||
throw new RangeError("Invalid JSON for fold state");
|
||
let ranges = [];
|
||
for (let i = 0; i < value.length;) {
|
||
let from = value[i++], to = value[i++];
|
||
if (typeof from != "number" || typeof to != "number")
|
||
throw new RangeError("Invalid JSON for fold state");
|
||
ranges.push(foldWidget.range(from, to));
|
||
}
|
||
return view_.Decoration.set(ranges, true);
|
||
}
|
||
});
|
||
function clearTouchedFolds(folded, from, to = from) {
|
||
let touched = false;
|
||
folded.between(from, to, (a, b) => { if (a < to && b > from)
|
||
touched = true; });
|
||
return !touched ? folded : folded.update({
|
||
filterFrom: from,
|
||
filterTo: to,
|
||
filter: (a, b) => a >= to || b <= from
|
||
});
|
||
}
|
||
/**
|
||
Get a [range set](https://codemirror.net/6/docs/ref/#state.RangeSet) containing the folded ranges
|
||
in the given state.
|
||
*/
|
||
function foldedRanges(state) {
|
||
return state.field(foldState, false) || RangeSet.empty;
|
||
}
|
||
function findFold(state, from, to) {
|
||
var _a;
|
||
let found = null;
|
||
(_a = state.field(foldState, false)) === null || _a === void 0 ? void 0 : _a.between(from, to, (from, to) => {
|
||
if (!found || found.from > from)
|
||
found = { from, to };
|
||
});
|
||
return found;
|
||
}
|
||
function foldExists(folded, from, to) {
|
||
let found = false;
|
||
folded.between(from, from, (a, b) => { if (a == from && b == to)
|
||
found = true; });
|
||
return found;
|
||
}
|
||
function maybeEnable(state, other) {
|
||
return state.field(foldState, false) ? other : other.concat(state_.StateEffect.appendConfig.of(codeFolding()));
|
||
}
|
||
/**
|
||
Fold the lines that are selected, if possible.
|
||
*/
|
||
const foldCode = view => {
|
||
for (let line of selectedLines(view)) {
|
||
let range = foldable(view.state, line.from, line.to);
|
||
if (range) {
|
||
view.dispatch({ effects: maybeEnable(view.state, [foldEffect.of(range), announceFold(view, range)]) });
|
||
return true;
|
||
}
|
||
}
|
||
return false;
|
||
};
|
||
/**
|
||
Unfold folded ranges on selected lines.
|
||
*/
|
||
const unfoldCode = view => {
|
||
if (!view.state.field(foldState, false))
|
||
return false;
|
||
let effects = [];
|
||
for (let line of selectedLines(view)) {
|
||
let folded = findFold(view.state, line.from, line.to);
|
||
if (folded)
|
||
effects.push(unfoldEffect.of(folded), announceFold(view, folded, false));
|
||
}
|
||
if (effects.length)
|
||
view.dispatch({ effects });
|
||
return effects.length > 0;
|
||
};
|
||
function announceFold(view, range, fold = true) {
|
||
let lineFrom = view.state.doc.lineAt(range.from).number, lineTo = view.state.doc.lineAt(range.to).number;
|
||
return view_.EditorView.announce.of(`${view.state.phrase(fold ? "Folded lines" : "Unfolded lines")} ${lineFrom} ${view.state.phrase("to")} ${lineTo}.`);
|
||
}
|
||
/**
|
||
Fold all top-level foldable ranges. Note that, in most cases,
|
||
folding information will depend on the [syntax
|
||
tree](https://codemirror.net/6/docs/ref/#language.syntaxTree), and folding everything may not work
|
||
reliably when the document hasn't been fully parsed (either
|
||
because the editor state was only just initialized, or because the
|
||
document is so big that the parser decided not to parse it
|
||
entirely).
|
||
*/
|
||
const foldAll = view => {
|
||
let { state } = view, effects = [];
|
||
for (let pos = 0; pos < state.doc.length;) {
|
||
let line = view.lineBlockAt(pos), range = foldable(state, line.from, line.to);
|
||
if (range)
|
||
effects.push(foldEffect.of(range));
|
||
pos = (range ? view.lineBlockAt(range.to) : line).to + 1;
|
||
}
|
||
if (effects.length)
|
||
view.dispatch({ effects: maybeEnable(view.state, effects) });
|
||
return !!effects.length;
|
||
};
|
||
/**
|
||
Unfold all folded code.
|
||
*/
|
||
const unfoldAll = view => {
|
||
let field = view.state.field(foldState, false);
|
||
if (!field || !field.size)
|
||
return false;
|
||
let effects = [];
|
||
field.between(0, view.state.doc.length, (from, to) => { effects.push(unfoldEffect.of({ from, to })); });
|
||
view.dispatch({ effects });
|
||
return true;
|
||
};
|
||
// Find the foldable region containing the given line, if one exists
|
||
function foldableContainer(view, lineBlock) {
|
||
// Look backwards through line blocks until we find a foldable region that
|
||
// intersects with the line
|
||
for (let line = lineBlock;;) {
|
||
let foldableRegion = foldable(view.state, line.from, line.to);
|
||
if (foldableRegion && foldableRegion.to > lineBlock.from)
|
||
return foldableRegion;
|
||
if (!line.from)
|
||
return null;
|
||
line = view.lineBlockAt(line.from - 1);
|
||
}
|
||
}
|
||
/**
|
||
Toggle folding at cursors. Unfolds if there is an existing fold
|
||
starting in that line, tries to find a foldable range around it
|
||
otherwise.
|
||
*/
|
||
const toggleFold = (view) => {
|
||
let effects = [];
|
||
for (let line of selectedLines(view)) {
|
||
let folded = findFold(view.state, line.from, line.to);
|
||
if (folded) {
|
||
effects.push(unfoldEffect.of(folded), announceFold(view, folded, false));
|
||
}
|
||
else {
|
||
let foldRange = foldableContainer(view, line);
|
||
if (foldRange)
|
||
effects.push(foldEffect.of(foldRange), announceFold(view, foldRange));
|
||
}
|
||
}
|
||
if (effects.length > 0)
|
||
view.dispatch({ effects: maybeEnable(view.state, effects) });
|
||
return !!effects.length;
|
||
};
|
||
/**
|
||
Default fold-related key bindings.
|
||
|
||
- Ctrl-Shift-[ (Cmd-Alt-[ on macOS): [`foldCode`](https://codemirror.net/6/docs/ref/#language.foldCode).
|
||
- Ctrl-Shift-] (Cmd-Alt-] on macOS): [`unfoldCode`](https://codemirror.net/6/docs/ref/#language.unfoldCode).
|
||
- Ctrl-Alt-[: [`foldAll`](https://codemirror.net/6/docs/ref/#language.foldAll).
|
||
- Ctrl-Alt-]: [`unfoldAll`](https://codemirror.net/6/docs/ref/#language.unfoldAll).
|
||
*/
|
||
const foldKeymap = [
|
||
{ key: "Ctrl-Shift-[", mac: "Cmd-Alt-[", run: foldCode },
|
||
{ key: "Ctrl-Shift-]", mac: "Cmd-Alt-]", run: unfoldCode },
|
||
{ key: "Ctrl-Alt-[", run: foldAll },
|
||
{ key: "Ctrl-Alt-]", run: unfoldAll }
|
||
];
|
||
const defaultConfig = {
|
||
placeholderDOM: null,
|
||
preparePlaceholder: null,
|
||
placeholderText: "…"
|
||
};
|
||
const foldConfig = /*@__PURE__*/state_.Facet.define({
|
||
combine(values) { return (0,state_.combineConfig)(values, defaultConfig); }
|
||
});
|
||
/**
|
||
Create an extension that configures code folding.
|
||
*/
|
||
function codeFolding(config) {
|
||
let result = [foldState, baseTheme$1];
|
||
if (config)
|
||
result.push(foldConfig.of(config));
|
||
return result;
|
||
}
|
||
function widgetToDOM(view, prepared) {
|
||
let { state } = view, conf = state.facet(foldConfig);
|
||
let onclick = (event) => {
|
||
let line = view.lineBlockAt(view.posAtDOM(event.target));
|
||
let folded = findFold(view.state, line.from, line.to);
|
||
if (folded)
|
||
view.dispatch({ effects: unfoldEffect.of(folded) });
|
||
event.preventDefault();
|
||
};
|
||
if (conf.placeholderDOM)
|
||
return conf.placeholderDOM(view, onclick, prepared);
|
||
let element = document.createElement("span");
|
||
element.textContent = conf.placeholderText;
|
||
element.setAttribute("aria-label", state.phrase("folded code"));
|
||
element.title = state.phrase("unfold");
|
||
element.className = "cm-foldPlaceholder";
|
||
element.onclick = onclick;
|
||
return element;
|
||
}
|
||
const foldWidget = /*@__PURE__*/view_.Decoration.replace({ widget: /*@__PURE__*/new class extends view_.WidgetType {
|
||
toDOM(view) { return widgetToDOM(view, null); }
|
||
} });
|
||
class PreparedFoldWidget extends view_.WidgetType {
|
||
constructor(value) {
|
||
super();
|
||
this.value = value;
|
||
}
|
||
eq(other) { return this.value == other.value; }
|
||
toDOM(view) { return widgetToDOM(view, this.value); }
|
||
}
|
||
const foldGutterDefaults = {
|
||
openText: "⌄",
|
||
closedText: "›",
|
||
markerDOM: null,
|
||
domEventHandlers: {},
|
||
foldingChanged: () => false
|
||
};
|
||
class FoldMarker extends view_.GutterMarker {
|
||
constructor(config, open) {
|
||
super();
|
||
this.config = config;
|
||
this.open = open;
|
||
}
|
||
eq(other) { return this.config == other.config && this.open == other.open; }
|
||
toDOM(view) {
|
||
if (this.config.markerDOM)
|
||
return this.config.markerDOM(this.open);
|
||
let span = document.createElement("span");
|
||
span.textContent = this.open ? this.config.openText : this.config.closedText;
|
||
span.title = view.state.phrase(this.open ? "Fold line" : "Unfold line");
|
||
return span;
|
||
}
|
||
}
|
||
/**
|
||
Create an extension that registers a fold gutter, which shows a
|
||
fold status indicator before foldable lines (which can be clicked
|
||
to fold or unfold the line).
|
||
*/
|
||
function foldGutter(config = {}) {
|
||
let fullConfig = { ...foldGutterDefaults, ...config };
|
||
let canFold = new FoldMarker(fullConfig, true), canUnfold = new FoldMarker(fullConfig, false);
|
||
let markers = view_.ViewPlugin.fromClass(class {
|
||
constructor(view) {
|
||
this.from = view.viewport.from;
|
||
this.markers = this.buildMarkers(view);
|
||
}
|
||
update(update) {
|
||
if (update.docChanged || update.viewportChanged ||
|
||
update.startState.facet(language) != update.state.facet(language) ||
|
||
update.startState.field(foldState, false) != update.state.field(foldState, false) ||
|
||
syntaxTree(update.startState) != syntaxTree(update.state) ||
|
||
fullConfig.foldingChanged(update))
|
||
this.markers = this.buildMarkers(update.view);
|
||
}
|
||
buildMarkers(view) {
|
||
let builder = new state_.RangeSetBuilder();
|
||
for (let line of view.viewportLineBlocks) {
|
||
let mark = findFold(view.state, line.from, line.to) ? canUnfold
|
||
: foldable(view.state, line.from, line.to) ? canFold : null;
|
||
if (mark)
|
||
builder.add(line.from, line.from, mark);
|
||
}
|
||
return builder.finish();
|
||
}
|
||
});
|
||
let { domEventHandlers } = fullConfig;
|
||
return [
|
||
markers,
|
||
(0,view_.gutter)({
|
||
class: "cm-foldGutter",
|
||
markers(view) { var _a; return ((_a = view.plugin(markers)) === null || _a === void 0 ? void 0 : _a.markers) || state_.RangeSet.empty; },
|
||
initialSpacer() {
|
||
return new FoldMarker(fullConfig, false);
|
||
},
|
||
domEventHandlers: {
|
||
...domEventHandlers,
|
||
click: (view, line, event) => {
|
||
if (domEventHandlers.click && domEventHandlers.click(view, line, event))
|
||
return true;
|
||
let folded = findFold(view.state, line.from, line.to);
|
||
if (folded) {
|
||
view.dispatch({ effects: unfoldEffect.of(folded) });
|
||
return true;
|
||
}
|
||
let range = foldable(view.state, line.from, line.to);
|
||
if (range) {
|
||
view.dispatch({ effects: foldEffect.of(range) });
|
||
return true;
|
||
}
|
||
return false;
|
||
}
|
||
}
|
||
}),
|
||
codeFolding()
|
||
];
|
||
}
|
||
const baseTheme$1 = /*@__PURE__*/view_.EditorView.baseTheme({
|
||
".cm-foldPlaceholder": {
|
||
backgroundColor: "#eee",
|
||
border: "1px solid #ddd",
|
||
color: "#888",
|
||
borderRadius: ".2em",
|
||
margin: "0 1px",
|
||
padding: "0 1px",
|
||
cursor: "pointer"
|
||
},
|
||
".cm-foldGutter span": {
|
||
padding: "0 1px",
|
||
cursor: "pointer"
|
||
}
|
||
});
|
||
|
||
/**
|
||
A highlight style associates CSS styles with higlighting
|
||
[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag).
|
||
*/
|
||
class HighlightStyle {
|
||
constructor(
|
||
/**
|
||
The tag styles used to create this highlight style.
|
||
*/
|
||
specs, options) {
|
||
this.specs = specs;
|
||
let modSpec;
|
||
function def(spec) {
|
||
let cls = StyleModule.newName();
|
||
(modSpec || (modSpec = Object.create(null)))["." + cls] = spec;
|
||
return cls;
|
||
}
|
||
const all = typeof options.all == "string" ? options.all : options.all ? def(options.all) : undefined;
|
||
const scopeOpt = options.scope;
|
||
this.scope = scopeOpt instanceof Language ? (type) => type.prop(languageDataProp) == scopeOpt.data
|
||
: scopeOpt ? (type) => type == scopeOpt : undefined;
|
||
this.style = tagHighlighter(specs.map(style => ({
|
||
tag: style.tag,
|
||
class: style.class || def(Object.assign({}, style, { tag: null }))
|
||
})), {
|
||
all,
|
||
}).style;
|
||
this.module = modSpec ? new StyleModule(modSpec) : null;
|
||
this.themeType = options.themeType;
|
||
}
|
||
/**
|
||
Create a highlighter style that associates the given styles to
|
||
the given tags. The specs must be objects that hold a style tag
|
||
or array of tags in their `tag` property, and either a single
|
||
`class` property providing a static CSS class (for highlighter
|
||
that rely on external styling), or a
|
||
[`style-mod`](https://github.com/marijnh/style-mod#documentation)-style
|
||
set of CSS properties (which define the styling for those tags).
|
||
|
||
The CSS rules created for a highlighter will be emitted in the
|
||
order of the spec's properties. That means that for elements that
|
||
have multiple tags associated with them, styles defined further
|
||
down in the list will have a higher CSS precedence than styles
|
||
defined earlier.
|
||
*/
|
||
static define(specs, options) {
|
||
return new HighlightStyle(specs, options || {});
|
||
}
|
||
}
|
||
const highlighterFacet = /*@__PURE__*/state_.Facet.define();
|
||
const fallbackHighlighter = /*@__PURE__*/state_.Facet.define({
|
||
combine(values) { return values.length ? [values[0]] : null; }
|
||
});
|
||
function getHighlighters(state) {
|
||
let main = state.facet(highlighterFacet);
|
||
return main.length ? main : state.facet(fallbackHighlighter);
|
||
}
|
||
/**
|
||
Wrap a highlighter in an editor extension that uses it to apply
|
||
syntax highlighting to the editor content.
|
||
|
||
When multiple (non-fallback) styles are provided, the styling
|
||
applied is the union of the classes they emit.
|
||
*/
|
||
function syntaxHighlighting(highlighter, options) {
|
||
let ext = [treeHighlighter], themeType;
|
||
if (highlighter instanceof HighlightStyle) {
|
||
if (highlighter.module)
|
||
ext.push(view_.EditorView.styleModule.of(highlighter.module));
|
||
themeType = highlighter.themeType;
|
||
}
|
||
if (options === null || options === void 0 ? void 0 : options.fallback)
|
||
ext.push(fallbackHighlighter.of(highlighter));
|
||
else if (themeType)
|
||
ext.push(highlighterFacet.computeN([view_.EditorView.darkTheme], state => {
|
||
return state.facet(view_.EditorView.darkTheme) == (themeType == "dark") ? [highlighter] : [];
|
||
}));
|
||
else
|
||
ext.push(highlighterFacet.of(highlighter));
|
||
return ext;
|
||
}
|
||
/**
|
||
Returns the CSS classes (if any) that the highlighters active in
|
||
the state would assign to the given style
|
||
[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag) and
|
||
(optional) language
|
||
[scope](https://codemirror.net/6/docs/ref/#language.HighlightStyle^define^options.scope).
|
||
*/
|
||
function highlightingFor(state, tags, scope) {
|
||
let highlighters = getHighlighters(state);
|
||
let result = null;
|
||
if (highlighters)
|
||
for (let highlighter of highlighters) {
|
||
if (!highlighter.scope || scope && highlighter.scope(scope)) {
|
||
let cls = highlighter.style(tags);
|
||
if (cls)
|
||
result = result ? result + " " + cls : cls;
|
||
}
|
||
}
|
||
return result;
|
||
}
|
||
class TreeHighlighter {
|
||
constructor(view) {
|
||
this.markCache = Object.create(null);
|
||
this.tree = syntaxTree(view.state);
|
||
this.decorations = this.buildDeco(view, getHighlighters(view.state));
|
||
this.decoratedTo = view.viewport.to;
|
||
}
|
||
update(update) {
|
||
let tree = syntaxTree(update.state), highlighters = getHighlighters(update.state);
|
||
let styleChange = highlighters != getHighlighters(update.startState);
|
||
let { viewport } = update.view, decoratedToMapped = update.changes.mapPos(this.decoratedTo, 1);
|
||
if (tree.length < viewport.to && !styleChange && tree.type == this.tree.type && decoratedToMapped >= viewport.to) {
|
||
this.decorations = this.decorations.map(update.changes);
|
||
this.decoratedTo = decoratedToMapped;
|
||
}
|
||
else if (tree != this.tree || update.viewportChanged || styleChange) {
|
||
this.tree = tree;
|
||
this.decorations = this.buildDeco(update.view, highlighters);
|
||
this.decoratedTo = viewport.to;
|
||
}
|
||
}
|
||
buildDeco(view, highlighters) {
|
||
if (!highlighters || !this.tree.length)
|
||
return view_.Decoration.none;
|
||
let builder = new state_.RangeSetBuilder();
|
||
for (let { from, to } of view.visibleRanges) {
|
||
highlightTree(this.tree, highlighters, (from, to, style) => {
|
||
builder.add(from, to, this.markCache[style] || (this.markCache[style] = view_.Decoration.mark({ class: style })));
|
||
}, from, to);
|
||
}
|
||
return builder.finish();
|
||
}
|
||
}
|
||
const treeHighlighter = /*@__PURE__*/state_.Prec.high(/*@__PURE__*/view_.ViewPlugin.fromClass(TreeHighlighter, {
|
||
decorations: v => v.decorations
|
||
}));
|
||
/**
|
||
A default highlight style (works well with light themes).
|
||
*/
|
||
const defaultHighlightStyle = /*@__PURE__*/HighlightStyle.define([
|
||
{ tag: tags.meta,
|
||
color: "#404740" },
|
||
{ tag: tags.link,
|
||
textDecoration: "underline" },
|
||
{ tag: tags.heading,
|
||
textDecoration: "underline",
|
||
fontWeight: "bold" },
|
||
{ tag: tags.emphasis,
|
||
fontStyle: "italic" },
|
||
{ tag: tags.strong,
|
||
fontWeight: "bold" },
|
||
{ tag: tags.strikethrough,
|
||
textDecoration: "line-through" },
|
||
{ tag: tags.keyword,
|
||
color: "#708" },
|
||
{ tag: [tags.atom, tags.bool, tags.url, tags.contentSeparator, tags.labelName],
|
||
color: "#219" },
|
||
{ tag: [tags.literal, tags.inserted],
|
||
color: "#164" },
|
||
{ tag: [tags.string, tags.deleted],
|
||
color: "#a11" },
|
||
{ tag: [tags.regexp, tags.escape, /*@__PURE__*/tags.special(tags.string)],
|
||
color: "#e40" },
|
||
{ tag: /*@__PURE__*/tags.definition(tags.variableName),
|
||
color: "#00f" },
|
||
{ tag: /*@__PURE__*/tags.local(tags.variableName),
|
||
color: "#30a" },
|
||
{ tag: [tags.typeName, tags.namespace],
|
||
color: "#085" },
|
||
{ tag: tags.className,
|
||
color: "#167" },
|
||
{ tag: [/*@__PURE__*/tags.special(tags.variableName), tags.macroName],
|
||
color: "#256" },
|
||
{ tag: /*@__PURE__*/tags.definition(tags.propertyName),
|
||
color: "#00c" },
|
||
{ tag: tags.comment,
|
||
color: "#940" },
|
||
{ tag: tags.invalid,
|
||
color: "#f00" }
|
||
]);
|
||
|
||
const baseTheme = /*@__PURE__*/view_.EditorView.baseTheme({
|
||
"&.cm-focused .cm-matchingBracket": { backgroundColor: "#328c8252" },
|
||
"&.cm-focused .cm-nonmatchingBracket": { backgroundColor: "#bb555544" }
|
||
});
|
||
const DefaultScanDist = 10000, DefaultBrackets = "()[]{}";
|
||
const bracketMatchingConfig = /*@__PURE__*/state_.Facet.define({
|
||
combine(configs) {
|
||
return (0,state_.combineConfig)(configs, {
|
||
afterCursor: true,
|
||
brackets: DefaultBrackets,
|
||
maxScanDistance: DefaultScanDist,
|
||
renderMatch: defaultRenderMatch
|
||
});
|
||
}
|
||
});
|
||
const matchingMark = /*@__PURE__*/view_.Decoration.mark({ class: "cm-matchingBracket" }), nonmatchingMark = /*@__PURE__*/view_.Decoration.mark({ class: "cm-nonmatchingBracket" });
|
||
function defaultRenderMatch(match) {
|
||
let decorations = [];
|
||
let mark = match.matched ? matchingMark : nonmatchingMark;
|
||
decorations.push(mark.range(match.start.from, match.start.to));
|
||
if (match.end)
|
||
decorations.push(mark.range(match.end.from, match.end.to));
|
||
return decorations;
|
||
}
|
||
const bracketMatchingState = /*@__PURE__*/state_.StateField.define({
|
||
create() { return view_.Decoration.none; },
|
||
update(deco, tr) {
|
||
if (!tr.docChanged && !tr.selection)
|
||
return deco;
|
||
let decorations = [];
|
||
let config = tr.state.facet(bracketMatchingConfig);
|
||
for (let range of tr.state.selection.ranges) {
|
||
if (!range.empty)
|
||
continue;
|
||
let match = matchBrackets(tr.state, range.head, -1, config)
|
||
|| (range.head > 0 && matchBrackets(tr.state, range.head - 1, 1, config))
|
||
|| (config.afterCursor &&
|
||
(matchBrackets(tr.state, range.head, 1, config) ||
|
||
(range.head < tr.state.doc.length && matchBrackets(tr.state, range.head + 1, -1, config))));
|
||
if (match)
|
||
decorations = decorations.concat(config.renderMatch(match, tr.state));
|
||
}
|
||
return view_.Decoration.set(decorations, true);
|
||
},
|
||
provide: f => view_.EditorView.decorations.from(f)
|
||
});
|
||
const bracketMatchingUnique = [
|
||
bracketMatchingState,
|
||
baseTheme
|
||
];
|
||
/**
|
||
Create an extension that enables bracket matching. Whenever the
|
||
cursor is next to a bracket, that bracket and the one it matches
|
||
are highlighted. Or, when no matching bracket is found, another
|
||
highlighting style is used to indicate this.
|
||
*/
|
||
function bracketMatching(config = {}) {
|
||
return [bracketMatchingConfig.of(config), bracketMatchingUnique];
|
||
}
|
||
/**
|
||
When larger syntax nodes, such as HTML tags, are marked as
|
||
opening/closing, it can be a bit messy to treat the whole node as
|
||
a matchable bracket. This node prop allows you to define, for such
|
||
a node, a ‘handle’—the part of the node that is highlighted, and
|
||
that the cursor must be on to activate highlighting in the first
|
||
place.
|
||
*/
|
||
const bracketMatchingHandle = /*@__PURE__*/new dist/* NodeProp */.uY();
|
||
function matchingNodes(node, dir, brackets) {
|
||
let byProp = node.prop(dir < 0 ? dist/* NodeProp */.uY.openedBy : dist/* NodeProp */.uY.closedBy);
|
||
if (byProp)
|
||
return byProp;
|
||
if (node.name.length == 1) {
|
||
let index = brackets.indexOf(node.name);
|
||
if (index > -1 && index % 2 == (dir < 0 ? 1 : 0))
|
||
return [brackets[index + dir]];
|
||
}
|
||
return null;
|
||
}
|
||
function findHandle(node) {
|
||
let hasHandle = node.type.prop(bracketMatchingHandle);
|
||
return hasHandle ? hasHandle(node.node) : node;
|
||
}
|
||
/**
|
||
Find the matching bracket for the token at `pos`, scanning
|
||
direction `dir`. Only the `brackets` and `maxScanDistance`
|
||
properties are used from `config`, if given. Returns null if no
|
||
bracket was found at `pos`, or a match result otherwise.
|
||
*/
|
||
function matchBrackets(state, pos, dir, config = {}) {
|
||
let maxScanDistance = config.maxScanDistance || DefaultScanDist, brackets = config.brackets || DefaultBrackets;
|
||
let tree = syntaxTree(state), node = tree.resolveInner(pos, dir);
|
||
for (let cur = node; cur; cur = cur.parent) {
|
||
let matches = matchingNodes(cur.type, dir, brackets);
|
||
if (matches && cur.from < cur.to) {
|
||
let handle = findHandle(cur);
|
||
if (handle && (dir > 0 ? pos >= handle.from && pos < handle.to : pos > handle.from && pos <= handle.to))
|
||
return matchMarkedBrackets(state, pos, dir, cur, handle, matches, brackets);
|
||
}
|
||
}
|
||
return matchPlainBrackets(state, pos, dir, tree, node.type, maxScanDistance, brackets);
|
||
}
|
||
function matchMarkedBrackets(_state, _pos, dir, token, handle, matching, brackets) {
|
||
let parent = token.parent, firstToken = { from: handle.from, to: handle.to };
|
||
let depth = 0, cursor = parent === null || parent === void 0 ? void 0 : parent.cursor();
|
||
if (cursor && (dir < 0 ? cursor.childBefore(token.from) : cursor.childAfter(token.to)))
|
||
do {
|
||
if (dir < 0 ? cursor.to <= token.from : cursor.from >= token.to) {
|
||
if (depth == 0 && matching.indexOf(cursor.type.name) > -1 && cursor.from < cursor.to) {
|
||
let endHandle = findHandle(cursor);
|
||
return { start: firstToken, end: endHandle ? { from: endHandle.from, to: endHandle.to } : undefined, matched: true };
|
||
}
|
||
else if (matchingNodes(cursor.type, dir, brackets)) {
|
||
depth++;
|
||
}
|
||
else if (matchingNodes(cursor.type, -dir, brackets)) {
|
||
if (depth == 0) {
|
||
let endHandle = findHandle(cursor);
|
||
return {
|
||
start: firstToken,
|
||
end: endHandle && endHandle.from < endHandle.to ? { from: endHandle.from, to: endHandle.to } : undefined,
|
||
matched: false
|
||
};
|
||
}
|
||
depth--;
|
||
}
|
||
}
|
||
} while (dir < 0 ? cursor.prevSibling() : cursor.nextSibling());
|
||
return { start: firstToken, matched: false };
|
||
}
|
||
function matchPlainBrackets(state, pos, dir, tree, tokenType, maxScanDistance, brackets) {
|
||
let startCh = dir < 0 ? state.sliceDoc(pos - 1, pos) : state.sliceDoc(pos, pos + 1);
|
||
let bracket = brackets.indexOf(startCh);
|
||
if (bracket < 0 || (bracket % 2 == 0) != (dir > 0))
|
||
return null;
|
||
let startToken = { from: dir < 0 ? pos - 1 : pos, to: dir > 0 ? pos + 1 : pos };
|
||
let iter = state.doc.iterRange(pos, dir > 0 ? state.doc.length : 0), depth = 0;
|
||
for (let distance = 0; !(iter.next()).done && distance <= maxScanDistance;) {
|
||
let text = iter.value;
|
||
if (dir < 0)
|
||
distance += text.length;
|
||
let basePos = pos + distance * dir;
|
||
for (let pos = dir > 0 ? 0 : text.length - 1, end = dir > 0 ? text.length : -1; pos != end; pos += dir) {
|
||
let found = brackets.indexOf(text[pos]);
|
||
if (found < 0 || tree.resolveInner(basePos + pos, 1).type != tokenType)
|
||
continue;
|
||
if ((found % 2 == 0) == (dir > 0)) {
|
||
depth++;
|
||
}
|
||
else if (depth == 1) { // Closing
|
||
return { start: startToken, end: { from: basePos + pos, to: basePos + pos + 1 }, matched: (found >> 1) == (bracket >> 1) };
|
||
}
|
||
else {
|
||
depth--;
|
||
}
|
||
}
|
||
if (dir > 0)
|
||
distance += text.length;
|
||
}
|
||
return iter.done ? { start: startToken, matched: false } : null;
|
||
}
|
||
|
||
// Counts the column offset in a string, taking tabs into account.
|
||
// Used mostly to find indentation.
|
||
function countCol(string, end, tabSize, startIndex = 0, startValue = 0) {
|
||
if (end == null) {
|
||
end = string.search(/[^\s\u00a0]/);
|
||
if (end == -1)
|
||
end = string.length;
|
||
}
|
||
let n = startValue;
|
||
for (let i = startIndex; i < end; i++) {
|
||
if (string.charCodeAt(i) == 9)
|
||
n += tabSize - (n % tabSize);
|
||
else
|
||
n++;
|
||
}
|
||
return n;
|
||
}
|
||
/**
|
||
Encapsulates a single line of input. Given to stream syntax code,
|
||
which uses it to tokenize the content.
|
||
*/
|
||
class StringStream {
|
||
/**
|
||
Create a stream.
|
||
*/
|
||
constructor(
|
||
/**
|
||
The line.
|
||
*/
|
||
string, tabSize,
|
||
/**
|
||
The current indent unit size.
|
||
*/
|
||
indentUnit, overrideIndent) {
|
||
this.string = string;
|
||
this.tabSize = tabSize;
|
||
this.indentUnit = indentUnit;
|
||
this.overrideIndent = overrideIndent;
|
||
/**
|
||
The current position on the line.
|
||
*/
|
||
this.pos = 0;
|
||
/**
|
||
The start position of the current token.
|
||
*/
|
||
this.start = 0;
|
||
this.lastColumnPos = 0;
|
||
this.lastColumnValue = 0;
|
||
}
|
||
/**
|
||
True if we are at the end of the line.
|
||
*/
|
||
eol() { return this.pos >= this.string.length; }
|
||
/**
|
||
True if we are at the start of the line.
|
||
*/
|
||
sol() { return this.pos == 0; }
|
||
/**
|
||
Get the next code unit after the current position, or undefined
|
||
if we're at the end of the line.
|
||
*/
|
||
peek() { return this.string.charAt(this.pos) || undefined; }
|
||
/**
|
||
Read the next code unit and advance `this.pos`.
|
||
*/
|
||
next() {
|
||
if (this.pos < this.string.length)
|
||
return this.string.charAt(this.pos++);
|
||
}
|
||
/**
|
||
Match the next character against the given string, regular
|
||
expression, or predicate. Consume and return it if it matches.
|
||
*/
|
||
eat(match) {
|
||
let ch = this.string.charAt(this.pos);
|
||
let ok;
|
||
if (typeof match == "string")
|
||
ok = ch == match;
|
||
else
|
||
ok = ch && (match instanceof RegExp ? match.test(ch) : match(ch));
|
||
if (ok) {
|
||
++this.pos;
|
||
return ch;
|
||
}
|
||
}
|
||
/**
|
||
Continue matching characters that match the given string,
|
||
regular expression, or predicate function. Return true if any
|
||
characters were consumed.
|
||
*/
|
||
eatWhile(match) {
|
||
let start = this.pos;
|
||
while (this.eat(match)) { }
|
||
return this.pos > start;
|
||
}
|
||
/**
|
||
Consume whitespace ahead of `this.pos`. Return true if any was
|
||
found.
|
||
*/
|
||
eatSpace() {
|
||
let start = this.pos;
|
||
while (/[\s\u00a0]/.test(this.string.charAt(this.pos)))
|
||
++this.pos;
|
||
return this.pos > start;
|
||
}
|
||
/**
|
||
Move to the end of the line.
|
||
*/
|
||
skipToEnd() { this.pos = this.string.length; }
|
||
/**
|
||
Move to directly before the given character, if found on the
|
||
current line.
|
||
*/
|
||
skipTo(ch) {
|
||
let found = this.string.indexOf(ch, this.pos);
|
||
if (found > -1) {
|
||
this.pos = found;
|
||
return true;
|
||
}
|
||
}
|
||
/**
|
||
Move back `n` characters.
|
||
*/
|
||
backUp(n) { this.pos -= n; }
|
||
/**
|
||
Get the column position at `this.pos`.
|
||
*/
|
||
column() {
|
||
if (this.lastColumnPos < this.start) {
|
||
this.lastColumnValue = countCol(this.string, this.start, this.tabSize, this.lastColumnPos, this.lastColumnValue);
|
||
this.lastColumnPos = this.start;
|
||
}
|
||
return this.lastColumnValue;
|
||
}
|
||
/**
|
||
Get the indentation column of the current line.
|
||
*/
|
||
indentation() {
|
||
var _a;
|
||
return (_a = this.overrideIndent) !== null && _a !== void 0 ? _a : countCol(this.string, null, this.tabSize);
|
||
}
|
||
/**
|
||
Match the input against the given string or regular expression
|
||
(which should start with a `^`). Return true or the regexp match
|
||
if it matches.
|
||
|
||
Unless `consume` is set to `false`, this will move `this.pos`
|
||
past the matched text.
|
||
|
||
When matching a string `caseInsensitive` can be set to true to
|
||
make the match case-insensitive.
|
||
*/
|
||
match(pattern, consume, caseInsensitive) {
|
||
if (typeof pattern == "string") {
|
||
let cased = (str) => caseInsensitive ? str.toLowerCase() : str;
|
||
let substr = this.string.substr(this.pos, pattern.length);
|
||
if (cased(substr) == cased(pattern)) {
|
||
if (consume !== false)
|
||
this.pos += pattern.length;
|
||
return true;
|
||
}
|
||
else
|
||
return null;
|
||
}
|
||
else {
|
||
let match = this.string.slice(this.pos).match(pattern);
|
||
if (match && match.index > 0)
|
||
return null;
|
||
if (match && consume !== false)
|
||
this.pos += match[0].length;
|
||
return match;
|
||
}
|
||
}
|
||
/**
|
||
Get the current token.
|
||
*/
|
||
current() { return this.string.slice(this.start, this.pos); }
|
||
}
|
||
|
||
function fullParser(spec) {
|
||
return {
|
||
name: spec.name || "",
|
||
token: spec.token,
|
||
blankLine: spec.blankLine || (() => { }),
|
||
startState: spec.startState || (() => true),
|
||
copyState: spec.copyState || defaultCopyState,
|
||
indent: spec.indent || (() => null),
|
||
languageData: spec.languageData || {},
|
||
tokenTable: spec.tokenTable || noTokens,
|
||
mergeTokens: spec.mergeTokens !== false
|
||
};
|
||
}
|
||
function defaultCopyState(state) {
|
||
if (typeof state != "object")
|
||
return state;
|
||
let newState = {};
|
||
for (let prop in state) {
|
||
let val = state[prop];
|
||
newState[prop] = (val instanceof Array ? val.slice() : val);
|
||
}
|
||
return newState;
|
||
}
|
||
const IndentedFrom = /*@__PURE__*/new WeakMap();
|
||
/**
|
||
A [language](https://codemirror.net/6/docs/ref/#language.Language) class based on a CodeMirror
|
||
5-style [streaming parser](https://codemirror.net/6/docs/ref/#language.StreamParser).
|
||
*/
|
||
class StreamLanguage extends Language {
|
||
constructor(parser) {
|
||
let data = defineLanguageFacet(parser.languageData);
|
||
let p = fullParser(parser), self;
|
||
let impl = new class extends dist/* Parser */.iX {
|
||
createParse(input, fragments, ranges) {
|
||
return new Parse(self, input, fragments, ranges);
|
||
}
|
||
};
|
||
super(data, impl, [], parser.name);
|
||
this.topNode = docID(data, this);
|
||
self = this;
|
||
this.streamParser = p;
|
||
this.stateAfter = new dist/* NodeProp */.uY({ perNode: true });
|
||
this.tokenTable = parser.tokenTable ? new TokenTable(p.tokenTable) : defaultTokenTable;
|
||
}
|
||
/**
|
||
Define a stream language.
|
||
*/
|
||
static define(spec) { return new StreamLanguage(spec); }
|
||
/**
|
||
@internal
|
||
*/
|
||
getIndent(cx) {
|
||
let from = undefined;
|
||
let { overrideIndentation } = cx.options;
|
||
if (overrideIndentation) {
|
||
from = IndentedFrom.get(cx.state);
|
||
if (from != null && from < cx.pos - 1e4)
|
||
from = undefined;
|
||
}
|
||
let start = findState(this, cx.node.tree, cx.node.from, cx.node.from, from !== null && from !== void 0 ? from : cx.pos), statePos, state;
|
||
if (start) {
|
||
state = start.state;
|
||
statePos = start.pos + 1;
|
||
}
|
||
else {
|
||
state = this.streamParser.startState(cx.unit);
|
||
statePos = cx.node.from;
|
||
}
|
||
if (cx.pos - statePos > 10000 /* C.MaxIndentScanDist */)
|
||
return null;
|
||
while (statePos < cx.pos) {
|
||
let line = cx.state.doc.lineAt(statePos), end = Math.min(cx.pos, line.to);
|
||
if (line.length) {
|
||
let indentation = overrideIndentation ? overrideIndentation(line.from) : -1;
|
||
let stream = new StringStream(line.text, cx.state.tabSize, cx.unit, indentation < 0 ? undefined : indentation);
|
||
while (stream.pos < end - line.from)
|
||
readToken(this.streamParser.token, stream, state);
|
||
}
|
||
else {
|
||
this.streamParser.blankLine(state, cx.unit);
|
||
}
|
||
if (end == cx.pos)
|
||
break;
|
||
statePos = line.to + 1;
|
||
}
|
||
let line = cx.lineAt(cx.pos);
|
||
if (overrideIndentation && from == null)
|
||
IndentedFrom.set(cx.state, line.from);
|
||
return this.streamParser.indent(state, /^\s*(.*)/.exec(line.text)[1], cx);
|
||
}
|
||
get allowsNesting() { return false; }
|
||
}
|
||
function findState(lang, tree, off, startPos, before) {
|
||
let state = off >= startPos && off + tree.length <= before && tree.prop(lang.stateAfter);
|
||
if (state)
|
||
return { state: lang.streamParser.copyState(state), pos: off + tree.length };
|
||
for (let i = tree.children.length - 1; i >= 0; i--) {
|
||
let child = tree.children[i], pos = off + tree.positions[i];
|
||
let found = child instanceof dist/* Tree */.PH && pos < before && findState(lang, child, pos, startPos, before);
|
||
if (found)
|
||
return found;
|
||
}
|
||
return null;
|
||
}
|
||
function cutTree(lang, tree, from, to, inside) {
|
||
if (inside && from <= 0 && to >= tree.length)
|
||
return tree;
|
||
if (!inside && from == 0 && tree.type == lang.topNode)
|
||
inside = true;
|
||
for (let i = tree.children.length - 1; i >= 0; i--) {
|
||
let pos = tree.positions[i], child = tree.children[i], inner;
|
||
if (pos < to && child instanceof dist/* Tree */.PH) {
|
||
if (!(inner = cutTree(lang, child, from - pos, to - pos, inside)))
|
||
break;
|
||
return !inside ? inner
|
||
: new dist/* Tree */.PH(tree.type, tree.children.slice(0, i).concat(inner), tree.positions.slice(0, i + 1), pos + inner.length);
|
||
}
|
||
}
|
||
return null;
|
||
}
|
||
function findStartInFragments(lang, fragments, startPos, endPos, editorState) {
|
||
for (let f of fragments) {
|
||
let from = f.from + (f.openStart ? 25 : 0), to = f.to - (f.openEnd ? 25 : 0);
|
||
let found = from <= startPos && to > startPos && findState(lang, f.tree, 0 - f.offset, startPos, to), tree;
|
||
if (found && found.pos <= endPos && (tree = cutTree(lang, f.tree, startPos + f.offset, found.pos + f.offset, false)))
|
||
return { state: found.state, tree };
|
||
}
|
||
return { state: lang.streamParser.startState(editorState ? getIndentUnit(editorState) : 4), tree: dist/* Tree */.PH.empty };
|
||
}
|
||
class Parse {
|
||
constructor(lang, input, fragments, ranges) {
|
||
this.lang = lang;
|
||
this.input = input;
|
||
this.fragments = fragments;
|
||
this.ranges = ranges;
|
||
this.stoppedAt = null;
|
||
this.chunks = [];
|
||
this.chunkPos = [];
|
||
this.chunk = [];
|
||
this.chunkReused = undefined;
|
||
this.rangeIndex = 0;
|
||
this.to = ranges[ranges.length - 1].to;
|
||
let context = ParseContext.get(), from = ranges[0].from;
|
||
let { state, tree } = findStartInFragments(lang, fragments, from, this.to, context === null || context === void 0 ? void 0 : context.state);
|
||
this.state = state;
|
||
this.parsedPos = this.chunkStart = from + tree.length;
|
||
for (let i = 0; i < tree.children.length; i++) {
|
||
this.chunks.push(tree.children[i]);
|
||
this.chunkPos.push(tree.positions[i]);
|
||
}
|
||
if (context && this.parsedPos < context.viewport.from - 100000 /* C.MaxDistanceBeforeViewport */ &&
|
||
ranges.some(r => r.from <= context.viewport.from && r.to >= context.viewport.from)) {
|
||
this.state = this.lang.streamParser.startState(getIndentUnit(context.state));
|
||
context.skipUntilInView(this.parsedPos, context.viewport.from);
|
||
this.parsedPos = context.viewport.from;
|
||
}
|
||
this.moveRangeIndex();
|
||
}
|
||
advance() {
|
||
let context = ParseContext.get();
|
||
let parseEnd = this.stoppedAt == null ? this.to : Math.min(this.to, this.stoppedAt);
|
||
let end = Math.min(parseEnd, this.chunkStart + 512 /* C.ChunkSize */);
|
||
if (context)
|
||
end = Math.min(end, context.viewport.to);
|
||
while (this.parsedPos < end)
|
||
this.parseLine(context);
|
||
if (this.chunkStart < this.parsedPos)
|
||
this.finishChunk();
|
||
if (this.parsedPos >= parseEnd)
|
||
return this.finish();
|
||
if (context && this.parsedPos >= context.viewport.to) {
|
||
context.skipUntilInView(this.parsedPos, parseEnd);
|
||
return this.finish();
|
||
}
|
||
return null;
|
||
}
|
||
stopAt(pos) {
|
||
this.stoppedAt = pos;
|
||
}
|
||
lineAfter(pos) {
|
||
let chunk = this.input.chunk(pos);
|
||
if (!this.input.lineChunks) {
|
||
let eol = chunk.indexOf("\n");
|
||
if (eol > -1)
|
||
chunk = chunk.slice(0, eol);
|
||
}
|
||
else if (chunk == "\n") {
|
||
chunk = "";
|
||
}
|
||
return pos + chunk.length <= this.to ? chunk : chunk.slice(0, this.to - pos);
|
||
}
|
||
nextLine() {
|
||
let from = this.parsedPos, line = this.lineAfter(from), end = from + line.length;
|
||
for (let index = this.rangeIndex;;) {
|
||
let rangeEnd = this.ranges[index].to;
|
||
if (rangeEnd >= end)
|
||
break;
|
||
line = line.slice(0, rangeEnd - (end - line.length));
|
||
index++;
|
||
if (index == this.ranges.length)
|
||
break;
|
||
let rangeStart = this.ranges[index].from;
|
||
let after = this.lineAfter(rangeStart);
|
||
line += after;
|
||
end = rangeStart + after.length;
|
||
}
|
||
return { line, end };
|
||
}
|
||
skipGapsTo(pos, offset, side) {
|
||
for (;;) {
|
||
let end = this.ranges[this.rangeIndex].to, offPos = pos + offset;
|
||
if (side > 0 ? end > offPos : end >= offPos)
|
||
break;
|
||
let start = this.ranges[++this.rangeIndex].from;
|
||
offset += start - end;
|
||
}
|
||
return offset;
|
||
}
|
||
moveRangeIndex() {
|
||
while (this.ranges[this.rangeIndex].to < this.parsedPos)
|
||
this.rangeIndex++;
|
||
}
|
||
emitToken(id, from, to, offset) {
|
||
let size = 4;
|
||
if (this.ranges.length > 1) {
|
||
offset = this.skipGapsTo(from, offset, 1);
|
||
from += offset;
|
||
let len0 = this.chunk.length;
|
||
offset = this.skipGapsTo(to, offset, -1);
|
||
to += offset;
|
||
size += this.chunk.length - len0;
|
||
}
|
||
let last = this.chunk.length - 4;
|
||
if (this.lang.streamParser.mergeTokens && size == 4 && last >= 0 &&
|
||
this.chunk[last] == id && this.chunk[last + 2] == from)
|
||
this.chunk[last + 2] = to;
|
||
else
|
||
this.chunk.push(id, from, to, size);
|
||
return offset;
|
||
}
|
||
parseLine(context) {
|
||
let { line, end } = this.nextLine(), offset = 0, { streamParser } = this.lang;
|
||
let stream = new StringStream(line, context ? context.state.tabSize : 4, context ? getIndentUnit(context.state) : 2);
|
||
if (stream.eol()) {
|
||
streamParser.blankLine(this.state, stream.indentUnit);
|
||
}
|
||
else {
|
||
while (!stream.eol()) {
|
||
let token = readToken(streamParser.token, stream, this.state);
|
||
if (token)
|
||
offset = this.emitToken(this.lang.tokenTable.resolve(token), this.parsedPos + stream.start, this.parsedPos + stream.pos, offset);
|
||
if (stream.start > 10000 /* C.MaxLineLength */)
|
||
break;
|
||
}
|
||
}
|
||
this.parsedPos = end;
|
||
this.moveRangeIndex();
|
||
if (this.parsedPos < this.to)
|
||
this.parsedPos++;
|
||
}
|
||
finishChunk() {
|
||
let tree = dist/* Tree */.PH.build({
|
||
buffer: this.chunk,
|
||
start: this.chunkStart,
|
||
length: this.parsedPos - this.chunkStart,
|
||
nodeSet,
|
||
topID: 0,
|
||
maxBufferLength: 512 /* C.ChunkSize */,
|
||
reused: this.chunkReused
|
||
});
|
||
tree = new dist/* Tree */.PH(tree.type, tree.children, tree.positions, tree.length, [[this.lang.stateAfter, this.lang.streamParser.copyState(this.state)]]);
|
||
this.chunks.push(tree);
|
||
this.chunkPos.push(this.chunkStart - this.ranges[0].from);
|
||
this.chunk = [];
|
||
this.chunkReused = undefined;
|
||
this.chunkStart = this.parsedPos;
|
||
}
|
||
finish() {
|
||
return new dist/* Tree */.PH(this.lang.topNode, this.chunks, this.chunkPos, this.parsedPos - this.ranges[0].from).balance();
|
||
}
|
||
}
|
||
function readToken(token, stream, state) {
|
||
stream.start = stream.pos;
|
||
for (let i = 0; i < 10; i++) {
|
||
let result = token(stream, state);
|
||
if (stream.pos > stream.start)
|
||
return result;
|
||
}
|
||
throw new Error("Stream parser failed to advance stream.");
|
||
}
|
||
const noTokens = /*@__PURE__*/Object.create(null);
|
||
const typeArray = [dist/* NodeType */.Z6.none];
|
||
const nodeSet = /*@__PURE__*/new dist/* NodeSet */.fI(typeArray);
|
||
const warned = [];
|
||
// Cache of node types by name and tags
|
||
const byTag = /*@__PURE__*/Object.create(null);
|
||
const defaultTable = /*@__PURE__*/Object.create(null);
|
||
for (let [legacyName, name] of [
|
||
["variable", "variableName"],
|
||
["variable-2", "variableName.special"],
|
||
["string-2", "string.special"],
|
||
["def", "variableName.definition"],
|
||
["tag", "tagName"],
|
||
["attribute", "attributeName"],
|
||
["type", "typeName"],
|
||
["builtin", "variableName.standard"],
|
||
["qualifier", "modifier"],
|
||
["error", "invalid"],
|
||
["header", "heading"],
|
||
["property", "propertyName"]
|
||
])
|
||
defaultTable[legacyName] = /*@__PURE__*/createTokenType(noTokens, name);
|
||
class TokenTable {
|
||
constructor(extra) {
|
||
this.extra = extra;
|
||
this.table = Object.assign(Object.create(null), defaultTable);
|
||
}
|
||
resolve(tag) {
|
||
return !tag ? 0 : this.table[tag] || (this.table[tag] = createTokenType(this.extra, tag));
|
||
}
|
||
}
|
||
const defaultTokenTable = /*@__PURE__*/new TokenTable(noTokens);
|
||
function warnForPart(part, msg) {
|
||
if (warned.indexOf(part) > -1)
|
||
return;
|
||
warned.push(part);
|
||
console.warn(msg);
|
||
}
|
||
function createTokenType(extra, tagStr) {
|
||
let tags$1 = [];
|
||
for (let name of tagStr.split(" ")) {
|
||
let found = [];
|
||
for (let part of name.split(".")) {
|
||
let value = (extra[part] || tags[part]);
|
||
if (!value) {
|
||
warnForPart(part, `Unknown highlighting tag ${part}`);
|
||
}
|
||
else if (typeof value == "function") {
|
||
if (!found.length)
|
||
warnForPart(part, `Modifier ${part} used at start of tag`);
|
||
else
|
||
found = found.map(value);
|
||
}
|
||
else {
|
||
if (found.length)
|
||
warnForPart(part, `Tag ${part} used as modifier`);
|
||
else
|
||
found = Array.isArray(value) ? value : [value];
|
||
}
|
||
}
|
||
for (let tag of found)
|
||
tags$1.push(tag);
|
||
}
|
||
if (!tags$1.length)
|
||
return 0;
|
||
let name = tagStr.replace(/ /g, "_"), key = name + " " + tags$1.map(t => t.id);
|
||
let known = byTag[key];
|
||
if (known)
|
||
return known.id;
|
||
let type = byTag[key] = dist/* NodeType */.Z6.define({
|
||
id: typeArray.length,
|
||
name,
|
||
props: [styleTags({ [name]: tags$1 })]
|
||
});
|
||
typeArray.push(type);
|
||
return type.id;
|
||
}
|
||
function docID(data, lang) {
|
||
let type = dist/* NodeType */.Z6.define({ id: typeArray.length, name: "Document", props: [
|
||
languageDataProp.add(() => data),
|
||
indentNodeProp.add(() => cx => lang.getIndent(cx))
|
||
], top: true });
|
||
typeArray.push(type);
|
||
return type;
|
||
}
|
||
|
||
function buildForLine(line) {
|
||
return line.length <= 4096 && /[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac\ufb50-\ufdff]/.test(line);
|
||
}
|
||
function textHasRTL(text) {
|
||
for (let i = text.iter(); !i.next().done;)
|
||
if (buildForLine(i.value))
|
||
return true;
|
||
return false;
|
||
}
|
||
function changeAddsRTL(change) {
|
||
let added = false;
|
||
change.iterChanges((fA, tA, fB, tB, ins) => {
|
||
if (!added && textHasRTL(ins))
|
||
added = true;
|
||
});
|
||
return added;
|
||
}
|
||
const alwaysIsolate = /*@__PURE__*/state_.Facet.define({ combine: values => values.some(x => x) });
|
||
/**
|
||
Make sure nodes
|
||
[marked](https://lezer.codemirror.net/docs/ref/#common.NodeProp^isolate)
|
||
as isolating for bidirectional text are rendered in a way that
|
||
isolates them from the surrounding text.
|
||
*/
|
||
function bidiIsolates(options = {}) {
|
||
let extensions = [isolateMarks];
|
||
if (options.alwaysIsolate)
|
||
extensions.push(alwaysIsolate.of(true));
|
||
return extensions;
|
||
}
|
||
const isolateMarks = /*@__PURE__*/view_.ViewPlugin.fromClass(class {
|
||
constructor(view) {
|
||
this.always = view.state.facet(alwaysIsolate) ||
|
||
view.textDirection != view_.Direction.LTR ||
|
||
view.state.facet(view_.EditorView.perLineTextDirection);
|
||
this.hasRTL = !this.always && textHasRTL(view.state.doc);
|
||
this.tree = syntaxTree(view.state);
|
||
this.decorations = this.always || this.hasRTL ? buildDeco(view, this.tree, this.always) : view_.Decoration.none;
|
||
}
|
||
update(update) {
|
||
let always = update.state.facet(alwaysIsolate) ||
|
||
update.view.textDirection != view_.Direction.LTR ||
|
||
update.state.facet(view_.EditorView.perLineTextDirection);
|
||
if (!always && !this.hasRTL && changeAddsRTL(update.changes))
|
||
this.hasRTL = true;
|
||
if (!always && !this.hasRTL)
|
||
return;
|
||
let tree = syntaxTree(update.state);
|
||
if (always != this.always || tree != this.tree || update.docChanged || update.viewportChanged) {
|
||
this.tree = tree;
|
||
this.always = always;
|
||
this.decorations = buildDeco(update.view, tree, always);
|
||
}
|
||
}
|
||
}, {
|
||
provide: plugin => {
|
||
function access(view) {
|
||
var _a, _b;
|
||
return (_b = (_a = view.plugin(plugin)) === null || _a === void 0 ? void 0 : _a.decorations) !== null && _b !== void 0 ? _b : view_.Decoration.none;
|
||
}
|
||
return [view_.EditorView.outerDecorations.of(access),
|
||
state_.Prec.lowest(view_.EditorView.bidiIsolatedRanges.of(access))];
|
||
}
|
||
});
|
||
function buildDeco(view, tree, always) {
|
||
let deco = new state_.RangeSetBuilder();
|
||
let ranges = view.visibleRanges;
|
||
if (!always)
|
||
ranges = clipRTLLines(ranges, view.state.doc);
|
||
for (let { from, to } of ranges) {
|
||
tree.iterate({
|
||
enter: node => {
|
||
let iso = node.type.prop(dist/* NodeProp */.uY.isolate);
|
||
if (iso)
|
||
deco.add(node.from, node.to, marks[iso]);
|
||
},
|
||
from, to
|
||
});
|
||
}
|
||
return deco.finish();
|
||
}
|
||
function clipRTLLines(ranges, doc) {
|
||
let cur = doc.iter(), pos = 0, result = [], last = null;
|
||
for (let { from, to } of ranges) {
|
||
if (last && last.to > from) {
|
||
from = last.to;
|
||
if (from >= to)
|
||
continue;
|
||
}
|
||
if (pos + cur.value.length < from) {
|
||
cur.next(from - (pos + cur.value.length));
|
||
pos = from;
|
||
}
|
||
for (;;) {
|
||
let start = pos, end = pos + cur.value.length;
|
||
if (!cur.lineBreak && buildForLine(cur.value)) {
|
||
if (last && last.to > start - 10)
|
||
last.to = Math.min(to, end);
|
||
else
|
||
result.push(last = { from: start, to: Math.min(to, end) });
|
||
}
|
||
if (end >= to)
|
||
break;
|
||
pos = end;
|
||
cur.next();
|
||
}
|
||
}
|
||
return result;
|
||
}
|
||
const marks = {
|
||
rtl: /*@__PURE__*/view_.Decoration.mark({ class: "cm-iso", inclusive: true, attributes: { dir: "rtl" }, bidiIsolate: view_.Direction.RTL }),
|
||
ltr: /*@__PURE__*/view_.Decoration.mark({ class: "cm-iso", inclusive: true, attributes: { dir: "ltr" }, bidiIsolate: view_.Direction.LTR }),
|
||
auto: /*@__PURE__*/view_.Decoration.mark({ class: "cm-iso", inclusive: true, attributes: { dir: "auto" }, bidiIsolate: null })
|
||
};
|
||
|
||
|
||
|
||
|
||
/***/ }),
|
||
|
||
/***/ 203:
|
||
/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
|
||
|
||
/* harmony export */ __webpack_require__.d(__webpack_exports__, {
|
||
/* harmony export */ PH: () => (/* binding */ Tree),
|
||
/* harmony export */ Qj: () => (/* binding */ IterMode),
|
||
/* harmony export */ Z6: () => (/* binding */ NodeType),
|
||
/* harmony export */ fI: () => (/* binding */ NodeSet),
|
||
/* harmony export */ iX: () => (/* binding */ Parser),
|
||
/* harmony export */ rr: () => (/* binding */ TreeFragment),
|
||
/* harmony export */ uY: () => (/* binding */ NodeProp)
|
||
/* harmony export */ });
|
||
/* unused harmony exports DefaultBufferLength, MountedTree, NodeWeakMap, TreeBuffer, TreeCursor, parseMixed */
|
||
/**
|
||
The default maximum length of a `TreeBuffer` node.
|
||
*/
|
||
const DefaultBufferLength = 1024;
|
||
let nextPropID = 0;
|
||
class Range {
|
||
constructor(from, to) {
|
||
this.from = from;
|
||
this.to = to;
|
||
}
|
||
}
|
||
/**
|
||
Each [node type](#common.NodeType) or [individual tree](#common.Tree)
|
||
can have metadata associated with it in props. Instances of this
|
||
class represent prop names.
|
||
*/
|
||
class NodeProp {
|
||
/**
|
||
Create a new node prop type.
|
||
*/
|
||
constructor(config = {}) {
|
||
this.id = nextPropID++;
|
||
this.perNode = !!config.perNode;
|
||
this.deserialize = config.deserialize || (() => {
|
||
throw new Error("This node type doesn't define a deserialize function");
|
||
});
|
||
this.combine = config.combine || null;
|
||
}
|
||
/**
|
||
This is meant to be used with
|
||
[`NodeSet.extend`](#common.NodeSet.extend) or
|
||
[`LRParser.configure`](#lr.ParserConfig.props) to compute
|
||
prop values for each node type in the set. Takes a [match
|
||
object](#common.NodeType^match) or function that returns undefined
|
||
if the node type doesn't get this prop, and the prop's value if
|
||
it does.
|
||
*/
|
||
add(match) {
|
||
if (this.perNode)
|
||
throw new RangeError("Can't add per-node props to node types");
|
||
if (typeof match != "function")
|
||
match = NodeType.match(match);
|
||
return (type) => {
|
||
let result = match(type);
|
||
return result === undefined ? null : [this, result];
|
||
};
|
||
}
|
||
}
|
||
/**
|
||
Prop that is used to describe matching delimiters. For opening
|
||
delimiters, this holds an array of node names (written as a
|
||
space-separated string when declaring this prop in a grammar)
|
||
for the node types of closing delimiters that match it.
|
||
*/
|
||
NodeProp.closedBy = new NodeProp({ deserialize: str => str.split(" ") });
|
||
/**
|
||
The inverse of [`closedBy`](#common.NodeProp^closedBy). This is
|
||
attached to closing delimiters, holding an array of node names
|
||
of types of matching opening delimiters.
|
||
*/
|
||
NodeProp.openedBy = new NodeProp({ deserialize: str => str.split(" ") });
|
||
/**
|
||
Used to assign node types to groups (for example, all node
|
||
types that represent an expression could be tagged with an
|
||
`"Expression"` group).
|
||
*/
|
||
NodeProp.group = new NodeProp({ deserialize: str => str.split(" ") });
|
||
/**
|
||
Attached to nodes to indicate these should be
|
||
[displayed](https://codemirror.net/docs/ref/#language.syntaxTree)
|
||
in a bidirectional text isolate, so that direction-neutral
|
||
characters on their sides don't incorrectly get associated with
|
||
surrounding text. You'll generally want to set this for nodes
|
||
that contain arbitrary text, like strings and comments, and for
|
||
nodes that appear _inside_ arbitrary text, like HTML tags. When
|
||
not given a value, in a grammar declaration, defaults to
|
||
`"auto"`.
|
||
*/
|
||
NodeProp.isolate = new NodeProp({ deserialize: value => {
|
||
if (value && value != "rtl" && value != "ltr" && value != "auto")
|
||
throw new RangeError("Invalid value for isolate: " + value);
|
||
return value || "auto";
|
||
} });
|
||
/**
|
||
The hash of the [context](#lr.ContextTracker.constructor)
|
||
that the node was parsed in, if any. Used to limit reuse of
|
||
contextual nodes.
|
||
*/
|
||
NodeProp.contextHash = new NodeProp({ perNode: true });
|
||
/**
|
||
The distance beyond the end of the node that the tokenizer
|
||
looked ahead for any of the tokens inside the node. (The LR
|
||
parser only stores this when it is larger than 25, for
|
||
efficiency reasons.)
|
||
*/
|
||
NodeProp.lookAhead = new NodeProp({ perNode: true });
|
||
/**
|
||
This per-node prop is used to replace a given node, or part of a
|
||
node, with another tree. This is useful to include trees from
|
||
different languages in mixed-language parsers.
|
||
*/
|
||
NodeProp.mounted = new NodeProp({ perNode: true });
|
||
/**
|
||
A mounted tree, which can be [stored](#common.NodeProp^mounted) on
|
||
a tree node to indicate that parts of its content are
|
||
represented by another tree.
|
||
*/
|
||
class MountedTree {
|
||
constructor(
|
||
/**
|
||
The inner tree.
|
||
*/
|
||
tree,
|
||
/**
|
||
If this is null, this tree replaces the entire node (it will
|
||
be included in the regular iteration instead of its host
|
||
node). If not, only the given ranges are considered to be
|
||
covered by this tree. This is used for trees that are mixed in
|
||
a way that isn't strictly hierarchical. Such mounted trees are
|
||
only entered by [`resolveInner`](#common.Tree.resolveInner)
|
||
and [`enter`](#common.SyntaxNode.enter).
|
||
*/
|
||
overlay,
|
||
/**
|
||
The parser used to create this subtree.
|
||
*/
|
||
parser) {
|
||
this.tree = tree;
|
||
this.overlay = overlay;
|
||
this.parser = parser;
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
static get(tree) {
|
||
return tree && tree.props && tree.props[NodeProp.mounted.id];
|
||
}
|
||
}
|
||
const noProps = Object.create(null);
|
||
/**
|
||
Each node in a syntax tree has a node type associated with it.
|
||
*/
|
||
class NodeType {
|
||
/**
|
||
@internal
|
||
*/
|
||
constructor(
|
||
/**
|
||
The name of the node type. Not necessarily unique, but if the
|
||
grammar was written properly, different node types with the
|
||
same name within a node set should play the same semantic
|
||
role.
|
||
*/
|
||
name,
|
||
/**
|
||
@internal
|
||
*/
|
||
props,
|
||
/**
|
||
The id of this node in its set. Corresponds to the term ids
|
||
used in the parser.
|
||
*/
|
||
id,
|
||
/**
|
||
@internal
|
||
*/
|
||
flags = 0) {
|
||
this.name = name;
|
||
this.props = props;
|
||
this.id = id;
|
||
this.flags = flags;
|
||
}
|
||
/**
|
||
Define a node type.
|
||
*/
|
||
static define(spec) {
|
||
let props = spec.props && spec.props.length ? Object.create(null) : noProps;
|
||
let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |
|
||
(spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);
|
||
let type = new NodeType(spec.name || "", props, spec.id, flags);
|
||
if (spec.props)
|
||
for (let src of spec.props) {
|
||
if (!Array.isArray(src))
|
||
src = src(type);
|
||
if (src) {
|
||
if (src[0].perNode)
|
||
throw new RangeError("Can't store a per-node prop on a node type");
|
||
props[src[0].id] = src[1];
|
||
}
|
||
}
|
||
return type;
|
||
}
|
||
/**
|
||
Retrieves a node prop for this type. Will return `undefined` if
|
||
the prop isn't present on this node.
|
||
*/
|
||
prop(prop) { return this.props[prop.id]; }
|
||
/**
|
||
True when this is the top node of a grammar.
|
||
*/
|
||
get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }
|
||
/**
|
||
True when this node is produced by a skip rule.
|
||
*/
|
||
get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }
|
||
/**
|
||
Indicates whether this is an error node.
|
||
*/
|
||
get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }
|
||
/**
|
||
When true, this node type doesn't correspond to a user-declared
|
||
named node, for example because it is used to cache repetition.
|
||
*/
|
||
get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }
|
||
/**
|
||
Returns true when this node's name or one of its
|
||
[groups](#common.NodeProp^group) matches the given string.
|
||
*/
|
||
is(name) {
|
||
if (typeof name == 'string') {
|
||
if (this.name == name)
|
||
return true;
|
||
let group = this.prop(NodeProp.group);
|
||
return group ? group.indexOf(name) > -1 : false;
|
||
}
|
||
return this.id == name;
|
||
}
|
||
/**
|
||
Create a function from node types to arbitrary values by
|
||
specifying an object whose property names are node or
|
||
[group](#common.NodeProp^group) names. Often useful with
|
||
[`NodeProp.add`](#common.NodeProp.add). You can put multiple
|
||
names, separated by spaces, in a single property name to map
|
||
multiple node names to a single value.
|
||
*/
|
||
static match(map) {
|
||
let direct = Object.create(null);
|
||
for (let prop in map)
|
||
for (let name of prop.split(" "))
|
||
direct[name] = map[prop];
|
||
return (node) => {
|
||
for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {
|
||
let found = direct[i < 0 ? node.name : groups[i]];
|
||
if (found)
|
||
return found;
|
||
}
|
||
};
|
||
}
|
||
}
|
||
/**
|
||
An empty dummy node type to use when no actual type is available.
|
||
*/
|
||
NodeType.none = new NodeType("", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);
|
||
/**
|
||
A node set holds a collection of node types. It is used to
|
||
compactly represent trees by storing their type ids, rather than a
|
||
full pointer to the type object, in a numeric array. Each parser
|
||
[has](#lr.LRParser.nodeSet) a node set, and [tree
|
||
buffers](#common.TreeBuffer) can only store collections of nodes
|
||
from the same set. A set can have a maximum of 2**16 (65536) node
|
||
types in it, so that the ids fit into 16-bit typed array slots.
|
||
*/
|
||
class NodeSet {
|
||
/**
|
||
Create a set with the given types. The `id` property of each
|
||
type should correspond to its position within the array.
|
||
*/
|
||
constructor(
|
||
/**
|
||
The node types in this set, by id.
|
||
*/
|
||
types) {
|
||
this.types = types;
|
||
for (let i = 0; i < types.length; i++)
|
||
if (types[i].id != i)
|
||
throw new RangeError("Node type ids should correspond to array positions when creating a node set");
|
||
}
|
||
/**
|
||
Create a copy of this set with some node properties added. The
|
||
arguments to this method can be created with
|
||
[`NodeProp.add`](#common.NodeProp.add).
|
||
*/
|
||
extend(...props) {
|
||
let newTypes = [];
|
||
for (let type of this.types) {
|
||
let newProps = null;
|
||
for (let source of props) {
|
||
let add = source(type);
|
||
if (add) {
|
||
if (!newProps)
|
||
newProps = Object.assign({}, type.props);
|
||
let value = add[1], prop = add[0];
|
||
if (prop.combine && prop.id in newProps)
|
||
value = prop.combine(newProps[prop.id], value);
|
||
newProps[prop.id] = value;
|
||
}
|
||
}
|
||
newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);
|
||
}
|
||
return new NodeSet(newTypes);
|
||
}
|
||
}
|
||
const CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();
|
||
/**
|
||
Options that control iteration. Can be combined with the `|`
|
||
operator to enable multiple ones.
|
||
*/
|
||
var IterMode;
|
||
(function (IterMode) {
|
||
/**
|
||
When enabled, iteration will only visit [`Tree`](#common.Tree)
|
||
objects, not nodes packed into
|
||
[`TreeBuffer`](#common.TreeBuffer)s.
|
||
*/
|
||
IterMode[IterMode["ExcludeBuffers"] = 1] = "ExcludeBuffers";
|
||
/**
|
||
Enable this to make iteration include anonymous nodes (such as
|
||
the nodes that wrap repeated grammar constructs into a balanced
|
||
tree).
|
||
*/
|
||
IterMode[IterMode["IncludeAnonymous"] = 2] = "IncludeAnonymous";
|
||
/**
|
||
By default, regular [mounted](#common.NodeProp^mounted) nodes
|
||
replace their base node in iteration. Enable this to ignore them
|
||
instead.
|
||
*/
|
||
IterMode[IterMode["IgnoreMounts"] = 4] = "IgnoreMounts";
|
||
/**
|
||
This option only applies in
|
||
[`enter`](#common.SyntaxNode.enter)-style methods. It tells the
|
||
library to not enter mounted overlays if one covers the given
|
||
position.
|
||
*/
|
||
IterMode[IterMode["IgnoreOverlays"] = 8] = "IgnoreOverlays";
|
||
})(IterMode || (IterMode = {}));
|
||
/**
|
||
A piece of syntax tree. There are two ways to approach these
|
||
trees: the way they are actually stored in memory, and the
|
||
convenient way.
|
||
|
||
Syntax trees are stored as a tree of `Tree` and `TreeBuffer`
|
||
objects. By packing detail information into `TreeBuffer` leaf
|
||
nodes, the representation is made a lot more memory-efficient.
|
||
|
||
However, when you want to actually work with tree nodes, this
|
||
representation is very awkward, so most client code will want to
|
||
use the [`TreeCursor`](#common.TreeCursor) or
|
||
[`SyntaxNode`](#common.SyntaxNode) interface instead, which provides
|
||
a view on some part of this data structure, and can be used to
|
||
move around to adjacent nodes.
|
||
*/
|
||
class Tree {
|
||
/**
|
||
Construct a new tree. See also [`Tree.build`](#common.Tree^build).
|
||
*/
|
||
constructor(
|
||
/**
|
||
The type of the top node.
|
||
*/
|
||
type,
|
||
/**
|
||
This node's child nodes.
|
||
*/
|
||
children,
|
||
/**
|
||
The positions (offsets relative to the start of this tree) of
|
||
the children.
|
||
*/
|
||
positions,
|
||
/**
|
||
The total length of this tree
|
||
*/
|
||
length,
|
||
/**
|
||
Per-node [node props](#common.NodeProp) to associate with this node.
|
||
*/
|
||
props) {
|
||
this.type = type;
|
||
this.children = children;
|
||
this.positions = positions;
|
||
this.length = length;
|
||
/**
|
||
@internal
|
||
*/
|
||
this.props = null;
|
||
if (props && props.length) {
|
||
this.props = Object.create(null);
|
||
for (let [prop, value] of props)
|
||
this.props[typeof prop == "number" ? prop : prop.id] = value;
|
||
}
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
toString() {
|
||
let mounted = MountedTree.get(this);
|
||
if (mounted && !mounted.overlay)
|
||
return mounted.tree.toString();
|
||
let children = "";
|
||
for (let ch of this.children) {
|
||
let str = ch.toString();
|
||
if (str) {
|
||
if (children)
|
||
children += ",";
|
||
children += str;
|
||
}
|
||
}
|
||
return !this.type.name ? children :
|
||
(/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +
|
||
(children.length ? "(" + children + ")" : "");
|
||
}
|
||
/**
|
||
Get a [tree cursor](#common.TreeCursor) positioned at the top of
|
||
the tree. Mode can be used to [control](#common.IterMode) which
|
||
nodes the cursor visits.
|
||
*/
|
||
cursor(mode = 0) {
|
||
return new TreeCursor(this.topNode, mode);
|
||
}
|
||
/**
|
||
Get a [tree cursor](#common.TreeCursor) pointing into this tree
|
||
at the given position and side (see
|
||
[`moveTo`](#common.TreeCursor.moveTo).
|
||
*/
|
||
cursorAt(pos, side = 0, mode = 0) {
|
||
let scope = CachedNode.get(this) || this.topNode;
|
||
let cursor = new TreeCursor(scope);
|
||
cursor.moveTo(pos, side);
|
||
CachedNode.set(this, cursor._tree);
|
||
return cursor;
|
||
}
|
||
/**
|
||
Get a [syntax node](#common.SyntaxNode) object for the top of the
|
||
tree.
|
||
*/
|
||
get topNode() {
|
||
return new TreeNode(this, 0, 0, null);
|
||
}
|
||
/**
|
||
Get the [syntax node](#common.SyntaxNode) at the given position.
|
||
If `side` is -1, this will move into nodes that end at the
|
||
position. If 1, it'll move into nodes that start at the
|
||
position. With 0, it'll only enter nodes that cover the position
|
||
from both sides.
|
||
|
||
Note that this will not enter
|
||
[overlays](#common.MountedTree.overlay), and you often want
|
||
[`resolveInner`](#common.Tree.resolveInner) instead.
|
||
*/
|
||
resolve(pos, side = 0) {
|
||
let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);
|
||
CachedNode.set(this, node);
|
||
return node;
|
||
}
|
||
/**
|
||
Like [`resolve`](#common.Tree.resolve), but will enter
|
||
[overlaid](#common.MountedTree.overlay) nodes, producing a syntax node
|
||
pointing into the innermost overlaid tree at the given position
|
||
(with parent links going through all parent structure, including
|
||
the host trees).
|
||
*/
|
||
resolveInner(pos, side = 0) {
|
||
let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);
|
||
CachedInnerNode.set(this, node);
|
||
return node;
|
||
}
|
||
/**
|
||
In some situations, it can be useful to iterate through all
|
||
nodes around a position, including those in overlays that don't
|
||
directly cover the position. This method gives you an iterator
|
||
that will produce all nodes, from small to big, around the given
|
||
position.
|
||
*/
|
||
resolveStack(pos, side = 0) {
|
||
return stackIterator(this, pos, side);
|
||
}
|
||
/**
|
||
Iterate over the tree and its children, calling `enter` for any
|
||
node that touches the `from`/`to` region (if given) before
|
||
running over such a node's children, and `leave` (if given) when
|
||
leaving the node. When `enter` returns `false`, that node will
|
||
not have its children iterated over (or `leave` called).
|
||
*/
|
||
iterate(spec) {
|
||
let { enter, leave, from = 0, to = this.length } = spec;
|
||
let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;
|
||
for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {
|
||
let entered = false;
|
||
if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {
|
||
if (c.firstChild())
|
||
continue;
|
||
entered = true;
|
||
}
|
||
for (;;) {
|
||
if (entered && leave && (anon || !c.type.isAnonymous))
|
||
leave(c);
|
||
if (c.nextSibling())
|
||
break;
|
||
if (!c.parent())
|
||
return;
|
||
entered = true;
|
||
}
|
||
}
|
||
}
|
||
/**
|
||
Get the value of the given [node prop](#common.NodeProp) for this
|
||
node. Works with both per-node and per-type props.
|
||
*/
|
||
prop(prop) {
|
||
return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;
|
||
}
|
||
/**
|
||
Returns the node's [per-node props](#common.NodeProp.perNode) in a
|
||
format that can be passed to the [`Tree`](#common.Tree)
|
||
constructor.
|
||
*/
|
||
get propValues() {
|
||
let result = [];
|
||
if (this.props)
|
||
for (let id in this.props)
|
||
result.push([+id, this.props[id]]);
|
||
return result;
|
||
}
|
||
/**
|
||
Balance the direct children of this tree, producing a copy of
|
||
which may have children grouped into subtrees with type
|
||
[`NodeType.none`](#common.NodeType^none).
|
||
*/
|
||
balance(config = {}) {
|
||
return this.children.length <= 8 /* Balance.BranchFactor */ ? this :
|
||
balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));
|
||
}
|
||
/**
|
||
Build a tree from a postfix-ordered buffer of node information,
|
||
or a cursor over such a buffer.
|
||
*/
|
||
static build(data) { return buildTree(data); }
|
||
}
|
||
/**
|
||
The empty tree
|
||
*/
|
||
Tree.empty = new Tree(NodeType.none, [], [], 0);
|
||
class FlatBufferCursor {
|
||
constructor(buffer, index) {
|
||
this.buffer = buffer;
|
||
this.index = index;
|
||
}
|
||
get id() { return this.buffer[this.index - 4]; }
|
||
get start() { return this.buffer[this.index - 3]; }
|
||
get end() { return this.buffer[this.index - 2]; }
|
||
get size() { return this.buffer[this.index - 1]; }
|
||
get pos() { return this.index; }
|
||
next() { this.index -= 4; }
|
||
fork() { return new FlatBufferCursor(this.buffer, this.index); }
|
||
}
|
||
/**
|
||
Tree buffers contain (type, start, end, endIndex) quads for each
|
||
node. In such a buffer, nodes are stored in prefix order (parents
|
||
before children, with the endIndex of the parent indicating which
|
||
children belong to it).
|
||
*/
|
||
class TreeBuffer {
|
||
/**
|
||
Create a tree buffer.
|
||
*/
|
||
constructor(
|
||
/**
|
||
The buffer's content.
|
||
*/
|
||
buffer,
|
||
/**
|
||
The total length of the group of nodes in the buffer.
|
||
*/
|
||
length,
|
||
/**
|
||
The node set used in this buffer.
|
||
*/
|
||
set) {
|
||
this.buffer = buffer;
|
||
this.length = length;
|
||
this.set = set;
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
get type() { return NodeType.none; }
|
||
/**
|
||
@internal
|
||
*/
|
||
toString() {
|
||
let result = [];
|
||
for (let index = 0; index < this.buffer.length;) {
|
||
result.push(this.childString(index));
|
||
index = this.buffer[index + 3];
|
||
}
|
||
return result.join(",");
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
childString(index) {
|
||
let id = this.buffer[index], endIndex = this.buffer[index + 3];
|
||
let type = this.set.types[id], result = type.name;
|
||
if (/\W/.test(result) && !type.isError)
|
||
result = JSON.stringify(result);
|
||
index += 4;
|
||
if (endIndex == index)
|
||
return result;
|
||
let children = [];
|
||
while (index < endIndex) {
|
||
children.push(this.childString(index));
|
||
index = this.buffer[index + 3];
|
||
}
|
||
return result + "(" + children.join(",") + ")";
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
findChild(startIndex, endIndex, dir, pos, side) {
|
||
let { buffer } = this, pick = -1;
|
||
for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {
|
||
if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {
|
||
pick = i;
|
||
if (dir > 0)
|
||
break;
|
||
}
|
||
}
|
||
return pick;
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
slice(startI, endI, from) {
|
||
let b = this.buffer;
|
||
let copy = new Uint16Array(endI - startI), len = 0;
|
||
for (let i = startI, j = 0; i < endI;) {
|
||
copy[j++] = b[i++];
|
||
copy[j++] = b[i++] - from;
|
||
let to = copy[j++] = b[i++] - from;
|
||
copy[j++] = b[i++] - startI;
|
||
len = Math.max(len, to);
|
||
}
|
||
return new TreeBuffer(copy, len, this.set);
|
||
}
|
||
}
|
||
function checkSide(side, pos, from, to) {
|
||
switch (side) {
|
||
case -2 /* Side.Before */: return from < pos;
|
||
case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;
|
||
case 0 /* Side.Around */: return from < pos && to > pos;
|
||
case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;
|
||
case 2 /* Side.After */: return to > pos;
|
||
case 4 /* Side.DontCare */: return true;
|
||
}
|
||
}
|
||
function resolveNode(node, pos, side, overlays) {
|
||
var _a;
|
||
// Move up to a node that actually holds the position, if possible
|
||
while (node.from == node.to ||
|
||
(side < 1 ? node.from >= pos : node.from > pos) ||
|
||
(side > -1 ? node.to <= pos : node.to < pos)) {
|
||
let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;
|
||
if (!parent)
|
||
return node;
|
||
node = parent;
|
||
}
|
||
let mode = overlays ? 0 : IterMode.IgnoreOverlays;
|
||
// Must go up out of overlays when those do not overlap with pos
|
||
if (overlays)
|
||
for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {
|
||
if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)
|
||
node = parent;
|
||
}
|
||
for (;;) {
|
||
let inner = node.enter(pos, side, mode);
|
||
if (!inner)
|
||
return node;
|
||
node = inner;
|
||
}
|
||
}
|
||
class BaseNode {
|
||
cursor(mode = 0) { return new TreeCursor(this, mode); }
|
||
getChild(type, before = null, after = null) {
|
||
let r = getChildren(this, type, before, after);
|
||
return r.length ? r[0] : null;
|
||
}
|
||
getChildren(type, before = null, after = null) {
|
||
return getChildren(this, type, before, after);
|
||
}
|
||
resolve(pos, side = 0) {
|
||
return resolveNode(this, pos, side, false);
|
||
}
|
||
resolveInner(pos, side = 0) {
|
||
return resolveNode(this, pos, side, true);
|
||
}
|
||
matchContext(context) {
|
||
return matchNodeContext(this.parent, context);
|
||
}
|
||
enterUnfinishedNodesBefore(pos) {
|
||
let scan = this.childBefore(pos), node = this;
|
||
while (scan) {
|
||
let last = scan.lastChild;
|
||
if (!last || last.to != scan.to)
|
||
break;
|
||
if (last.type.isError && last.from == last.to) {
|
||
node = scan;
|
||
scan = last.prevSibling;
|
||
}
|
||
else {
|
||
scan = last;
|
||
}
|
||
}
|
||
return node;
|
||
}
|
||
get node() { return this; }
|
||
get next() { return this.parent; }
|
||
}
|
||
class TreeNode extends BaseNode {
|
||
constructor(_tree, from,
|
||
// Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)
|
||
index, _parent) {
|
||
super();
|
||
this._tree = _tree;
|
||
this.from = from;
|
||
this.index = index;
|
||
this._parent = _parent;
|
||
}
|
||
get type() { return this._tree.type; }
|
||
get name() { return this._tree.type.name; }
|
||
get to() { return this.from + this._tree.length; }
|
||
nextChild(i, dir, pos, side, mode = 0) {
|
||
for (let parent = this;;) {
|
||
for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {
|
||
let next = children[i], start = positions[i] + parent.from;
|
||
if (!checkSide(side, pos, start, start + next.length))
|
||
continue;
|
||
if (next instanceof TreeBuffer) {
|
||
if (mode & IterMode.ExcludeBuffers)
|
||
continue;
|
||
let index = next.findChild(0, next.buffer.length, dir, pos - start, side);
|
||
if (index > -1)
|
||
return new BufferNode(new BufferContext(parent, next, i, start), null, index);
|
||
}
|
||
else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {
|
||
let mounted;
|
||
if (!(mode & IterMode.IgnoreMounts) && (mounted = MountedTree.get(next)) && !mounted.overlay)
|
||
return new TreeNode(mounted.tree, start, i, parent);
|
||
let inner = new TreeNode(next, start, i, parent);
|
||
return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner
|
||
: inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);
|
||
}
|
||
}
|
||
if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)
|
||
return null;
|
||
if (parent.index >= 0)
|
||
i = parent.index + dir;
|
||
else
|
||
i = dir < 0 ? -1 : parent._parent._tree.children.length;
|
||
parent = parent._parent;
|
||
if (!parent)
|
||
return null;
|
||
}
|
||
}
|
||
get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }
|
||
get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }
|
||
childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }
|
||
childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }
|
||
prop(prop) { return this._tree.prop(prop); }
|
||
enter(pos, side, mode = 0) {
|
||
let mounted;
|
||
if (!(mode & IterMode.IgnoreOverlays) && (mounted = MountedTree.get(this._tree)) && mounted.overlay) {
|
||
let rPos = pos - this.from;
|
||
for (let { from, to } of mounted.overlay) {
|
||
if ((side > 0 ? from <= rPos : from < rPos) &&
|
||
(side < 0 ? to >= rPos : to > rPos))
|
||
return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);
|
||
}
|
||
}
|
||
return this.nextChild(0, 1, pos, side, mode);
|
||
}
|
||
nextSignificantParent() {
|
||
let val = this;
|
||
while (val.type.isAnonymous && val._parent)
|
||
val = val._parent;
|
||
return val;
|
||
}
|
||
get parent() {
|
||
return this._parent ? this._parent.nextSignificantParent() : null;
|
||
}
|
||
get nextSibling() {
|
||
return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;
|
||
}
|
||
get prevSibling() {
|
||
return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;
|
||
}
|
||
get tree() { return this._tree; }
|
||
toTree() { return this._tree; }
|
||
/**
|
||
@internal
|
||
*/
|
||
toString() { return this._tree.toString(); }
|
||
}
|
||
function getChildren(node, type, before, after) {
|
||
let cur = node.cursor(), result = [];
|
||
if (!cur.firstChild())
|
||
return result;
|
||
if (before != null)
|
||
for (let found = false; !found;) {
|
||
found = cur.type.is(before);
|
||
if (!cur.nextSibling())
|
||
return result;
|
||
}
|
||
for (;;) {
|
||
if (after != null && cur.type.is(after))
|
||
return result;
|
||
if (cur.type.is(type))
|
||
result.push(cur.node);
|
||
if (!cur.nextSibling())
|
||
return after == null ? result : [];
|
||
}
|
||
}
|
||
function matchNodeContext(node, context, i = context.length - 1) {
|
||
for (let p = node; i >= 0; p = p.parent) {
|
||
if (!p)
|
||
return false;
|
||
if (!p.type.isAnonymous) {
|
||
if (context[i] && context[i] != p.name)
|
||
return false;
|
||
i--;
|
||
}
|
||
}
|
||
return true;
|
||
}
|
||
class BufferContext {
|
||
constructor(parent, buffer, index, start) {
|
||
this.parent = parent;
|
||
this.buffer = buffer;
|
||
this.index = index;
|
||
this.start = start;
|
||
}
|
||
}
|
||
class BufferNode extends BaseNode {
|
||
get name() { return this.type.name; }
|
||
get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }
|
||
get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }
|
||
constructor(context, _parent, index) {
|
||
super();
|
||
this.context = context;
|
||
this._parent = _parent;
|
||
this.index = index;
|
||
this.type = context.buffer.set.types[context.buffer.buffer[index]];
|
||
}
|
||
child(dir, pos, side) {
|
||
let { buffer } = this.context;
|
||
let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);
|
||
return index < 0 ? null : new BufferNode(this.context, this, index);
|
||
}
|
||
get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }
|
||
get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }
|
||
childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }
|
||
childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }
|
||
prop(prop) { return this.type.prop(prop); }
|
||
enter(pos, side, mode = 0) {
|
||
if (mode & IterMode.ExcludeBuffers)
|
||
return null;
|
||
let { buffer } = this.context;
|
||
let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);
|
||
return index < 0 ? null : new BufferNode(this.context, this, index);
|
||
}
|
||
get parent() {
|
||
return this._parent || this.context.parent.nextSignificantParent();
|
||
}
|
||
externalSibling(dir) {
|
||
return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);
|
||
}
|
||
get nextSibling() {
|
||
let { buffer } = this.context;
|
||
let after = buffer.buffer[this.index + 3];
|
||
if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))
|
||
return new BufferNode(this.context, this._parent, after);
|
||
return this.externalSibling(1);
|
||
}
|
||
get prevSibling() {
|
||
let { buffer } = this.context;
|
||
let parentStart = this._parent ? this._parent.index + 4 : 0;
|
||
if (this.index == parentStart)
|
||
return this.externalSibling(-1);
|
||
return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));
|
||
}
|
||
get tree() { return null; }
|
||
toTree() {
|
||
let children = [], positions = [];
|
||
let { buffer } = this.context;
|
||
let startI = this.index + 4, endI = buffer.buffer[this.index + 3];
|
||
if (endI > startI) {
|
||
let from = buffer.buffer[this.index + 1];
|
||
children.push(buffer.slice(startI, endI, from));
|
||
positions.push(0);
|
||
}
|
||
return new Tree(this.type, children, positions, this.to - this.from);
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
toString() { return this.context.buffer.childString(this.index); }
|
||
}
|
||
function iterStack(heads) {
|
||
if (!heads.length)
|
||
return null;
|
||
let pick = 0, picked = heads[0];
|
||
for (let i = 1; i < heads.length; i++) {
|
||
let node = heads[i];
|
||
if (node.from > picked.from || node.to < picked.to) {
|
||
picked = node;
|
||
pick = i;
|
||
}
|
||
}
|
||
let next = picked instanceof TreeNode && picked.index < 0 ? null : picked.parent;
|
||
let newHeads = heads.slice();
|
||
if (next)
|
||
newHeads[pick] = next;
|
||
else
|
||
newHeads.splice(pick, 1);
|
||
return new StackIterator(newHeads, picked);
|
||
}
|
||
class StackIterator {
|
||
constructor(heads, node) {
|
||
this.heads = heads;
|
||
this.node = node;
|
||
}
|
||
get next() { return iterStack(this.heads); }
|
||
}
|
||
function stackIterator(tree, pos, side) {
|
||
let inner = tree.resolveInner(pos, side), layers = null;
|
||
for (let scan = inner instanceof TreeNode ? inner : inner.context.parent; scan; scan = scan.parent) {
|
||
if (scan.index < 0) { // This is an overlay root
|
||
let parent = scan.parent;
|
||
(layers || (layers = [inner])).push(parent.resolve(pos, side));
|
||
scan = parent;
|
||
}
|
||
else {
|
||
let mount = MountedTree.get(scan.tree);
|
||
// Relevant overlay branching off
|
||
if (mount && mount.overlay && mount.overlay[0].from <= pos && mount.overlay[mount.overlay.length - 1].to >= pos) {
|
||
let root = new TreeNode(mount.tree, mount.overlay[0].from + scan.from, -1, scan);
|
||
(layers || (layers = [inner])).push(resolveNode(root, pos, side, false));
|
||
}
|
||
}
|
||
}
|
||
return layers ? iterStack(layers) : inner;
|
||
}
|
||
/**
|
||
A tree cursor object focuses on a given node in a syntax tree, and
|
||
allows you to move to adjacent nodes.
|
||
*/
|
||
class TreeCursor {
|
||
/**
|
||
Shorthand for `.type.name`.
|
||
*/
|
||
get name() { return this.type.name; }
|
||
/**
|
||
@internal
|
||
*/
|
||
constructor(node,
|
||
/**
|
||
@internal
|
||
*/
|
||
mode = 0) {
|
||
this.mode = mode;
|
||
/**
|
||
@internal
|
||
*/
|
||
this.buffer = null;
|
||
this.stack = [];
|
||
/**
|
||
@internal
|
||
*/
|
||
this.index = 0;
|
||
this.bufferNode = null;
|
||
if (node instanceof TreeNode) {
|
||
this.yieldNode(node);
|
||
}
|
||
else {
|
||
this._tree = node.context.parent;
|
||
this.buffer = node.context;
|
||
for (let n = node._parent; n; n = n._parent)
|
||
this.stack.unshift(n.index);
|
||
this.bufferNode = node;
|
||
this.yieldBuf(node.index);
|
||
}
|
||
}
|
||
yieldNode(node) {
|
||
if (!node)
|
||
return false;
|
||
this._tree = node;
|
||
this.type = node.type;
|
||
this.from = node.from;
|
||
this.to = node.to;
|
||
return true;
|
||
}
|
||
yieldBuf(index, type) {
|
||
this.index = index;
|
||
let { start, buffer } = this.buffer;
|
||
this.type = type || buffer.set.types[buffer.buffer[index]];
|
||
this.from = start + buffer.buffer[index + 1];
|
||
this.to = start + buffer.buffer[index + 2];
|
||
return true;
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
yield(node) {
|
||
if (!node)
|
||
return false;
|
||
if (node instanceof TreeNode) {
|
||
this.buffer = null;
|
||
return this.yieldNode(node);
|
||
}
|
||
this.buffer = node.context;
|
||
return this.yieldBuf(node.index, node.type);
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
toString() {
|
||
return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
enterChild(dir, pos, side) {
|
||
if (!this.buffer)
|
||
return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));
|
||
let { buffer } = this.buffer;
|
||
let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);
|
||
if (index < 0)
|
||
return false;
|
||
this.stack.push(this.index);
|
||
return this.yieldBuf(index);
|
||
}
|
||
/**
|
||
Move the cursor to this node's first child. When this returns
|
||
false, the node has no child, and the cursor has not been moved.
|
||
*/
|
||
firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }
|
||
/**
|
||
Move the cursor to this node's last child.
|
||
*/
|
||
lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }
|
||
/**
|
||
Move the cursor to the first child that ends after `pos`.
|
||
*/
|
||
childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }
|
||
/**
|
||
Move to the last child that starts before `pos`.
|
||
*/
|
||
childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }
|
||
/**
|
||
Move the cursor to the child around `pos`. If side is -1 the
|
||
child may end at that position, when 1 it may start there. This
|
||
will also enter [overlaid](#common.MountedTree.overlay)
|
||
[mounted](#common.NodeProp^mounted) trees unless `overlays` is
|
||
set to false.
|
||
*/
|
||
enter(pos, side, mode = this.mode) {
|
||
if (!this.buffer)
|
||
return this.yield(this._tree.enter(pos, side, mode));
|
||
return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);
|
||
}
|
||
/**
|
||
Move to the node's parent node, if this isn't the top node.
|
||
*/
|
||
parent() {
|
||
if (!this.buffer)
|
||
return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);
|
||
if (this.stack.length)
|
||
return this.yieldBuf(this.stack.pop());
|
||
let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
|
||
this.buffer = null;
|
||
return this.yieldNode(parent);
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
sibling(dir) {
|
||
if (!this.buffer)
|
||
return !this._tree._parent ? false
|
||
: this.yield(this._tree.index < 0 ? null
|
||
: this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));
|
||
let { buffer } = this.buffer, d = this.stack.length - 1;
|
||
if (dir < 0) {
|
||
let parentStart = d < 0 ? 0 : this.stack[d] + 4;
|
||
if (this.index != parentStart)
|
||
return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));
|
||
}
|
||
else {
|
||
let after = buffer.buffer[this.index + 3];
|
||
if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))
|
||
return this.yieldBuf(after);
|
||
}
|
||
return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;
|
||
}
|
||
/**
|
||
Move to this node's next sibling, if any.
|
||
*/
|
||
nextSibling() { return this.sibling(1); }
|
||
/**
|
||
Move to this node's previous sibling, if any.
|
||
*/
|
||
prevSibling() { return this.sibling(-1); }
|
||
atLastNode(dir) {
|
||
let index, parent, { buffer } = this;
|
||
if (buffer) {
|
||
if (dir > 0) {
|
||
if (this.index < buffer.buffer.buffer.length)
|
||
return false;
|
||
}
|
||
else {
|
||
for (let i = 0; i < this.index; i++)
|
||
if (buffer.buffer.buffer[i + 3] < this.index)
|
||
return false;
|
||
}
|
||
({ index, parent } = buffer);
|
||
}
|
||
else {
|
||
({ index, _parent: parent } = this._tree);
|
||
}
|
||
for (; parent; { index, _parent: parent } = parent) {
|
||
if (index > -1)
|
||
for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {
|
||
let child = parent._tree.children[i];
|
||
if ((this.mode & IterMode.IncludeAnonymous) ||
|
||
child instanceof TreeBuffer ||
|
||
!child.type.isAnonymous ||
|
||
hasChild(child))
|
||
return false;
|
||
}
|
||
}
|
||
return true;
|
||
}
|
||
move(dir, enter) {
|
||
if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))
|
||
return true;
|
||
for (;;) {
|
||
if (this.sibling(dir))
|
||
return true;
|
||
if (this.atLastNode(dir) || !this.parent())
|
||
return false;
|
||
}
|
||
}
|
||
/**
|
||
Move to the next node in a
|
||
[pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)
|
||
traversal, going from a node to its first child or, if the
|
||
current node is empty or `enter` is false, its next sibling or
|
||
the next sibling of the first parent node that has one.
|
||
*/
|
||
next(enter = true) { return this.move(1, enter); }
|
||
/**
|
||
Move to the next node in a last-to-first pre-order traversal. A
|
||
node is followed by its last child or, if it has none, its
|
||
previous sibling or the previous sibling of the first parent
|
||
node that has one.
|
||
*/
|
||
prev(enter = true) { return this.move(-1, enter); }
|
||
/**
|
||
Move the cursor to the innermost node that covers `pos`. If
|
||
`side` is -1, it will enter nodes that end at `pos`. If it is 1,
|
||
it will enter nodes that start at `pos`.
|
||
*/
|
||
moveTo(pos, side = 0) {
|
||
// Move up to a node that actually holds the position, if possible
|
||
while (this.from == this.to ||
|
||
(side < 1 ? this.from >= pos : this.from > pos) ||
|
||
(side > -1 ? this.to <= pos : this.to < pos))
|
||
if (!this.parent())
|
||
break;
|
||
// Then scan down into child nodes as far as possible
|
||
while (this.enterChild(1, pos, side)) { }
|
||
return this;
|
||
}
|
||
/**
|
||
Get a [syntax node](#common.SyntaxNode) at the cursor's current
|
||
position.
|
||
*/
|
||
get node() {
|
||
if (!this.buffer)
|
||
return this._tree;
|
||
let cache = this.bufferNode, result = null, depth = 0;
|
||
if (cache && cache.context == this.buffer) {
|
||
scan: for (let index = this.index, d = this.stack.length; d >= 0;) {
|
||
for (let c = cache; c; c = c._parent)
|
||
if (c.index == index) {
|
||
if (index == this.index)
|
||
return c;
|
||
result = c;
|
||
depth = d + 1;
|
||
break scan;
|
||
}
|
||
index = this.stack[--d];
|
||
}
|
||
}
|
||
for (let i = depth; i < this.stack.length; i++)
|
||
result = new BufferNode(this.buffer, result, this.stack[i]);
|
||
return this.bufferNode = new BufferNode(this.buffer, result, this.index);
|
||
}
|
||
/**
|
||
Get the [tree](#common.Tree) that represents the current node, if
|
||
any. Will return null when the node is in a [tree
|
||
buffer](#common.TreeBuffer).
|
||
*/
|
||
get tree() {
|
||
return this.buffer ? null : this._tree._tree;
|
||
}
|
||
/**
|
||
Iterate over the current node and all its descendants, calling
|
||
`enter` when entering a node and `leave`, if given, when leaving
|
||
one. When `enter` returns `false`, any children of that node are
|
||
skipped, and `leave` isn't called for it.
|
||
*/
|
||
iterate(enter, leave) {
|
||
for (let depth = 0;;) {
|
||
let mustLeave = false;
|
||
if (this.type.isAnonymous || enter(this) !== false) {
|
||
if (this.firstChild()) {
|
||
depth++;
|
||
continue;
|
||
}
|
||
if (!this.type.isAnonymous)
|
||
mustLeave = true;
|
||
}
|
||
for (;;) {
|
||
if (mustLeave && leave)
|
||
leave(this);
|
||
mustLeave = this.type.isAnonymous;
|
||
if (!depth)
|
||
return;
|
||
if (this.nextSibling())
|
||
break;
|
||
this.parent();
|
||
depth--;
|
||
mustLeave = true;
|
||
}
|
||
}
|
||
}
|
||
/**
|
||
Test whether the current node matches a given context—a sequence
|
||
of direct parent node names. Empty strings in the context array
|
||
are treated as wildcards.
|
||
*/
|
||
matchContext(context) {
|
||
if (!this.buffer)
|
||
return matchNodeContext(this.node.parent, context);
|
||
let { buffer } = this.buffer, { types } = buffer.set;
|
||
for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {
|
||
if (d < 0)
|
||
return matchNodeContext(this._tree, context, i);
|
||
let type = types[buffer.buffer[this.stack[d]]];
|
||
if (!type.isAnonymous) {
|
||
if (context[i] && context[i] != type.name)
|
||
return false;
|
||
i--;
|
||
}
|
||
}
|
||
return true;
|
||
}
|
||
}
|
||
function hasChild(tree) {
|
||
return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));
|
||
}
|
||
function buildTree(data) {
|
||
var _a;
|
||
let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;
|
||
let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;
|
||
let types = nodeSet.types;
|
||
let contextHash = 0, lookAhead = 0;
|
||
function takeNode(parentStart, minPos, children, positions, inRepeat, depth) {
|
||
let { id, start, end, size } = cursor;
|
||
let lookAheadAtStart = lookAhead, contextAtStart = contextHash;
|
||
if (size < 0) {
|
||
cursor.next();
|
||
if (size == -1 /* SpecialRecord.Reuse */) {
|
||
let node = reused[id];
|
||
children.push(node);
|
||
positions.push(start - parentStart);
|
||
return;
|
||
}
|
||
else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change
|
||
contextHash = id;
|
||
return;
|
||
}
|
||
else if (size == -4 /* SpecialRecord.LookAhead */) {
|
||
lookAhead = id;
|
||
return;
|
||
}
|
||
else {
|
||
throw new RangeError(`Unrecognized record size: ${size}`);
|
||
}
|
||
}
|
||
let type = types[id], node, buffer;
|
||
let startPos = start - parentStart;
|
||
if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {
|
||
// Small enough for a buffer, and no reused nodes inside
|
||
let data = new Uint16Array(buffer.size - buffer.skip);
|
||
let endPos = cursor.pos - buffer.size, index = data.length;
|
||
while (cursor.pos > endPos)
|
||
index = copyToBuffer(buffer.start, data, index);
|
||
node = new TreeBuffer(data, end - buffer.start, nodeSet);
|
||
startPos = buffer.start - parentStart;
|
||
}
|
||
else { // Make it a node
|
||
let endPos = cursor.pos - size;
|
||
cursor.next();
|
||
let localChildren = [], localPositions = [];
|
||
let localInRepeat = id >= minRepeatType ? id : -1;
|
||
let lastGroup = 0, lastEnd = end;
|
||
while (cursor.pos > endPos) {
|
||
if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {
|
||
if (cursor.end <= lastEnd - maxBufferLength) {
|
||
makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);
|
||
lastGroup = localChildren.length;
|
||
lastEnd = cursor.end;
|
||
}
|
||
cursor.next();
|
||
}
|
||
else if (depth > 2500 /* CutOff.Depth */) {
|
||
takeFlatNode(start, endPos, localChildren, localPositions);
|
||
}
|
||
else {
|
||
takeNode(start, endPos, localChildren, localPositions, localInRepeat, depth + 1);
|
||
}
|
||
}
|
||
if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)
|
||
makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);
|
||
localChildren.reverse();
|
||
localPositions.reverse();
|
||
if (localInRepeat > -1 && lastGroup > 0) {
|
||
let make = makeBalanced(type, contextAtStart);
|
||
node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);
|
||
}
|
||
else {
|
||
node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end, contextAtStart);
|
||
}
|
||
}
|
||
children.push(node);
|
||
positions.push(startPos);
|
||
}
|
||
function takeFlatNode(parentStart, minPos, children, positions) {
|
||
let nodes = []; // Temporary, inverted array of leaf nodes found, with absolute positions
|
||
let nodeCount = 0, stopAt = -1;
|
||
while (cursor.pos > minPos) {
|
||
let { id, start, end, size } = cursor;
|
||
if (size > 4) { // Not a leaf
|
||
cursor.next();
|
||
}
|
||
else if (stopAt > -1 && start < stopAt) {
|
||
break;
|
||
}
|
||
else {
|
||
if (stopAt < 0)
|
||
stopAt = end - maxBufferLength;
|
||
nodes.push(id, start, end);
|
||
nodeCount++;
|
||
cursor.next();
|
||
}
|
||
}
|
||
if (nodeCount) {
|
||
let buffer = new Uint16Array(nodeCount * 4);
|
||
let start = nodes[nodes.length - 2];
|
||
for (let i = nodes.length - 3, j = 0; i >= 0; i -= 3) {
|
||
buffer[j++] = nodes[i];
|
||
buffer[j++] = nodes[i + 1] - start;
|
||
buffer[j++] = nodes[i + 2] - start;
|
||
buffer[j++] = j;
|
||
}
|
||
children.push(new TreeBuffer(buffer, nodes[2] - start, nodeSet));
|
||
positions.push(start - parentStart);
|
||
}
|
||
}
|
||
function makeBalanced(type, contextHash) {
|
||
return (children, positions, length) => {
|
||
let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;
|
||
if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {
|
||
if (!lastI && last.type == type && last.length == length)
|
||
return last;
|
||
if (lookAheadProp = last.prop(NodeProp.lookAhead))
|
||
lookAhead = positions[lastI] + last.length + lookAheadProp;
|
||
}
|
||
return makeTree(type, children, positions, length, lookAhead, contextHash);
|
||
};
|
||
}
|
||
function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead, contextHash) {
|
||
let localChildren = [], localPositions = [];
|
||
while (children.length > i) {
|
||
localChildren.push(children.pop());
|
||
localPositions.push(positions.pop() + base - from);
|
||
}
|
||
children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to, contextHash));
|
||
positions.push(from - base);
|
||
}
|
||
function makeTree(type, children, positions, length, lookAhead, contextHash, props) {
|
||
if (contextHash) {
|
||
let pair = [NodeProp.contextHash, contextHash];
|
||
props = props ? [pair].concat(props) : [pair];
|
||
}
|
||
if (lookAhead > 25) {
|
||
let pair = [NodeProp.lookAhead, lookAhead];
|
||
props = props ? [pair].concat(props) : [pair];
|
||
}
|
||
return new Tree(type, children, positions, length, props);
|
||
}
|
||
function findBufferSize(maxSize, inRepeat) {
|
||
// Scan through the buffer to find previous siblings that fit
|
||
// together in a TreeBuffer, and don't contain any reused nodes
|
||
// (which can't be stored in a buffer).
|
||
// If `inRepeat` is > -1, ignore node boundaries of that type for
|
||
// nesting, but make sure the end falls either at the start
|
||
// (`maxSize`) or before such a node.
|
||
let fork = cursor.fork();
|
||
let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;
|
||
let result = { size: 0, start: 0, skip: 0 };
|
||
scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {
|
||
let nodeSize = fork.size;
|
||
// Pretend nested repeat nodes of the same type don't exist
|
||
if (fork.id == inRepeat && nodeSize >= 0) {
|
||
// Except that we store the current state as a valid return
|
||
// value.
|
||
result.size = size;
|
||
result.start = start;
|
||
result.skip = skip;
|
||
skip += 4;
|
||
size += 4;
|
||
fork.next();
|
||
continue;
|
||
}
|
||
let startPos = fork.pos - nodeSize;
|
||
if (nodeSize < 0 || startPos < minPos || fork.start < minStart)
|
||
break;
|
||
let localSkipped = fork.id >= minRepeatType ? 4 : 0;
|
||
let nodeStart = fork.start;
|
||
fork.next();
|
||
while (fork.pos > startPos) {
|
||
if (fork.size < 0) {
|
||
if (fork.size == -3 /* SpecialRecord.ContextChange */ || fork.size == -4 /* SpecialRecord.LookAhead */)
|
||
localSkipped += 4;
|
||
else
|
||
break scan;
|
||
}
|
||
else if (fork.id >= minRepeatType) {
|
||
localSkipped += 4;
|
||
}
|
||
fork.next();
|
||
}
|
||
start = nodeStart;
|
||
size += nodeSize;
|
||
skip += localSkipped;
|
||
}
|
||
if (inRepeat < 0 || size == maxSize) {
|
||
result.size = size;
|
||
result.start = start;
|
||
result.skip = skip;
|
||
}
|
||
return result.size > 4 ? result : undefined;
|
||
}
|
||
function copyToBuffer(bufferStart, buffer, index) {
|
||
let { id, start, end, size } = cursor;
|
||
cursor.next();
|
||
if (size >= 0 && id < minRepeatType) {
|
||
let startIndex = index;
|
||
if (size > 4) {
|
||
let endPos = cursor.pos - (size - 4);
|
||
while (cursor.pos > endPos)
|
||
index = copyToBuffer(bufferStart, buffer, index);
|
||
}
|
||
buffer[--index] = startIndex;
|
||
buffer[--index] = end - bufferStart;
|
||
buffer[--index] = start - bufferStart;
|
||
buffer[--index] = id;
|
||
}
|
||
else if (size == -3 /* SpecialRecord.ContextChange */) {
|
||
contextHash = id;
|
||
}
|
||
else if (size == -4 /* SpecialRecord.LookAhead */) {
|
||
lookAhead = id;
|
||
}
|
||
return index;
|
||
}
|
||
let children = [], positions = [];
|
||
while (cursor.pos > 0)
|
||
takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1, 0);
|
||
let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);
|
||
return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);
|
||
}
|
||
const nodeSizeCache = new WeakMap;
|
||
function nodeSize(balanceType, node) {
|
||
if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)
|
||
return 1;
|
||
let size = nodeSizeCache.get(node);
|
||
if (size == null) {
|
||
size = 1;
|
||
for (let child of node.children) {
|
||
if (child.type != balanceType || !(child instanceof Tree)) {
|
||
size = 1;
|
||
break;
|
||
}
|
||
size += nodeSize(balanceType, child);
|
||
}
|
||
nodeSizeCache.set(node, size);
|
||
}
|
||
return size;
|
||
}
|
||
function balanceRange(
|
||
// The type the balanced tree's inner nodes.
|
||
balanceType,
|
||
// The direct children and their positions
|
||
children, positions,
|
||
// The index range in children/positions to use
|
||
from, to,
|
||
// The start position of the nodes, relative to their parent.
|
||
start,
|
||
// Length of the outer node
|
||
length,
|
||
// Function to build the top node of the balanced tree
|
||
mkTop,
|
||
// Function to build internal nodes for the balanced tree
|
||
mkTree) {
|
||
let total = 0;
|
||
for (let i = from; i < to; i++)
|
||
total += nodeSize(balanceType, children[i]);
|
||
let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);
|
||
let localChildren = [], localPositions = [];
|
||
function divide(children, positions, from, to, offset) {
|
||
for (let i = from; i < to;) {
|
||
let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);
|
||
i++;
|
||
for (; i < to; i++) {
|
||
let nextSize = nodeSize(balanceType, children[i]);
|
||
if (groupSize + nextSize >= maxChild)
|
||
break;
|
||
groupSize += nextSize;
|
||
}
|
||
if (i == groupFrom + 1) {
|
||
if (groupSize > maxChild) {
|
||
let only = children[groupFrom]; // Only trees can have a size > 1
|
||
divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);
|
||
continue;
|
||
}
|
||
localChildren.push(children[groupFrom]);
|
||
}
|
||
else {
|
||
let length = positions[i - 1] + children[i - 1].length - groupStart;
|
||
localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));
|
||
}
|
||
localPositions.push(groupStart + offset - start);
|
||
}
|
||
}
|
||
divide(children, positions, from, to, 0);
|
||
return (mkTop || mkTree)(localChildren, localPositions, length);
|
||
}
|
||
/**
|
||
Provides a way to associate values with pieces of trees. As long
|
||
as that part of the tree is reused, the associated values can be
|
||
retrieved from an updated tree.
|
||
*/
|
||
class NodeWeakMap {
|
||
constructor() {
|
||
this.map = new WeakMap();
|
||
}
|
||
setBuffer(buffer, index, value) {
|
||
let inner = this.map.get(buffer);
|
||
if (!inner)
|
||
this.map.set(buffer, inner = new Map);
|
||
inner.set(index, value);
|
||
}
|
||
getBuffer(buffer, index) {
|
||
let inner = this.map.get(buffer);
|
||
return inner && inner.get(index);
|
||
}
|
||
/**
|
||
Set the value for this syntax node.
|
||
*/
|
||
set(node, value) {
|
||
if (node instanceof BufferNode)
|
||
this.setBuffer(node.context.buffer, node.index, value);
|
||
else if (node instanceof TreeNode)
|
||
this.map.set(node.tree, value);
|
||
}
|
||
/**
|
||
Retrieve value for this syntax node, if it exists in the map.
|
||
*/
|
||
get(node) {
|
||
return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)
|
||
: node instanceof TreeNode ? this.map.get(node.tree) : undefined;
|
||
}
|
||
/**
|
||
Set the value for the node that a cursor currently points to.
|
||
*/
|
||
cursorSet(cursor, value) {
|
||
if (cursor.buffer)
|
||
this.setBuffer(cursor.buffer.buffer, cursor.index, value);
|
||
else
|
||
this.map.set(cursor.tree, value);
|
||
}
|
||
/**
|
||
Retrieve the value for the node that a cursor currently points
|
||
to.
|
||
*/
|
||
cursorGet(cursor) {
|
||
return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);
|
||
}
|
||
}
|
||
|
||
/**
|
||
Tree fragments are used during [incremental
|
||
parsing](#common.Parser.startParse) to track parts of old trees
|
||
that can be reused in a new parse. An array of fragments is used
|
||
to track regions of an old tree whose nodes might be reused in new
|
||
parses. Use the static
|
||
[`applyChanges`](#common.TreeFragment^applyChanges) method to
|
||
update fragments for document changes.
|
||
*/
|
||
class TreeFragment {
|
||
/**
|
||
Construct a tree fragment. You'll usually want to use
|
||
[`addTree`](#common.TreeFragment^addTree) and
|
||
[`applyChanges`](#common.TreeFragment^applyChanges) instead of
|
||
calling this directly.
|
||
*/
|
||
constructor(
|
||
/**
|
||
The start of the unchanged range pointed to by this fragment.
|
||
This refers to an offset in the _updated_ document (as opposed
|
||
to the original tree).
|
||
*/
|
||
from,
|
||
/**
|
||
The end of the unchanged range.
|
||
*/
|
||
to,
|
||
/**
|
||
The tree that this fragment is based on.
|
||
*/
|
||
tree,
|
||
/**
|
||
The offset between the fragment's tree and the document that
|
||
this fragment can be used against. Add this when going from
|
||
document to tree positions, subtract it to go from tree to
|
||
document positions.
|
||
*/
|
||
offset, openStart = false, openEnd = false) {
|
||
this.from = from;
|
||
this.to = to;
|
||
this.tree = tree;
|
||
this.offset = offset;
|
||
this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);
|
||
}
|
||
/**
|
||
Whether the start of the fragment represents the start of a
|
||
parse, or the end of a change. (In the second case, it may not
|
||
be safe to reuse some nodes at the start, depending on the
|
||
parsing algorithm.)
|
||
*/
|
||
get openStart() { return (this.open & 1 /* Open.Start */) > 0; }
|
||
/**
|
||
Whether the end of the fragment represents the end of a
|
||
full-document parse, or the start of a change.
|
||
*/
|
||
get openEnd() { return (this.open & 2 /* Open.End */) > 0; }
|
||
/**
|
||
Create a set of fragments from a freshly parsed tree, or update
|
||
an existing set of fragments by replacing the ones that overlap
|
||
with a tree with content from the new tree. When `partial` is
|
||
true, the parse is treated as incomplete, and the resulting
|
||
fragment has [`openEnd`](#common.TreeFragment.openEnd) set to
|
||
true.
|
||
*/
|
||
static addTree(tree, fragments = [], partial = false) {
|
||
let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];
|
||
for (let f of fragments)
|
||
if (f.to > tree.length)
|
||
result.push(f);
|
||
return result;
|
||
}
|
||
/**
|
||
Apply a set of edits to an array of fragments, removing or
|
||
splitting fragments as necessary to remove edited ranges, and
|
||
adjusting offsets for fragments that moved.
|
||
*/
|
||
static applyChanges(fragments, changes, minGap = 128) {
|
||
if (!changes.length)
|
||
return fragments;
|
||
let result = [];
|
||
let fI = 1, nextF = fragments.length ? fragments[0] : null;
|
||
for (let cI = 0, pos = 0, off = 0;; cI++) {
|
||
let nextC = cI < changes.length ? changes[cI] : null;
|
||
let nextPos = nextC ? nextC.fromA : 1e9;
|
||
if (nextPos - pos >= minGap)
|
||
while (nextF && nextF.from < nextPos) {
|
||
let cut = nextF;
|
||
if (pos >= cut.from || nextPos <= cut.to || off) {
|
||
let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;
|
||
cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);
|
||
}
|
||
if (cut)
|
||
result.push(cut);
|
||
if (nextF.to > nextPos)
|
||
break;
|
||
nextF = fI < fragments.length ? fragments[fI++] : null;
|
||
}
|
||
if (!nextC)
|
||
break;
|
||
pos = nextC.toA;
|
||
off = nextC.toA - nextC.toB;
|
||
}
|
||
return result;
|
||
}
|
||
}
|
||
/**
|
||
A superclass that parsers should extend.
|
||
*/
|
||
class Parser {
|
||
/**
|
||
Start a parse, returning a [partial parse](#common.PartialParse)
|
||
object. [`fragments`](#common.TreeFragment) can be passed in to
|
||
make the parse incremental.
|
||
|
||
By default, the entire input is parsed. You can pass `ranges`,
|
||
which should be a sorted array of non-empty, non-overlapping
|
||
ranges, to parse only those ranges. The tree returned in that
|
||
case will start at `ranges[0].from`.
|
||
*/
|
||
startParse(input, fragments, ranges) {
|
||
if (typeof input == "string")
|
||
input = new StringInput(input);
|
||
ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];
|
||
return this.createParse(input, fragments || [], ranges);
|
||
}
|
||
/**
|
||
Run a full parse, returning the resulting tree.
|
||
*/
|
||
parse(input, fragments, ranges) {
|
||
let parse = this.startParse(input, fragments, ranges);
|
||
for (;;) {
|
||
let done = parse.advance();
|
||
if (done)
|
||
return done;
|
||
}
|
||
}
|
||
}
|
||
class StringInput {
|
||
constructor(string) {
|
||
this.string = string;
|
||
}
|
||
get length() { return this.string.length; }
|
||
chunk(from) { return this.string.slice(from); }
|
||
get lineChunks() { return false; }
|
||
read(from, to) { return this.string.slice(from, to); }
|
||
}
|
||
|
||
/**
|
||
Create a parse wrapper that, after the inner parse completes,
|
||
scans its tree for mixed language regions with the `nest`
|
||
function, runs the resulting [inner parses](#common.NestedParse),
|
||
and then [mounts](#common.NodeProp^mounted) their results onto the
|
||
tree.
|
||
*/
|
||
function parseMixed(nest) {
|
||
return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);
|
||
}
|
||
class InnerParse {
|
||
constructor(parser, parse, overlay, target, from) {
|
||
this.parser = parser;
|
||
this.parse = parse;
|
||
this.overlay = overlay;
|
||
this.target = target;
|
||
this.from = from;
|
||
}
|
||
}
|
||
function checkRanges(ranges) {
|
||
if (!ranges.length || ranges.some(r => r.from >= r.to))
|
||
throw new RangeError("Invalid inner parse ranges given: " + JSON.stringify(ranges));
|
||
}
|
||
class ActiveOverlay {
|
||
constructor(parser, predicate, mounts, index, start, target, prev) {
|
||
this.parser = parser;
|
||
this.predicate = predicate;
|
||
this.mounts = mounts;
|
||
this.index = index;
|
||
this.start = start;
|
||
this.target = target;
|
||
this.prev = prev;
|
||
this.depth = 0;
|
||
this.ranges = [];
|
||
}
|
||
}
|
||
const stoppedInner = new NodeProp({ perNode: true });
|
||
class MixedParse {
|
||
constructor(base, nest, input, fragments, ranges) {
|
||
this.nest = nest;
|
||
this.input = input;
|
||
this.fragments = fragments;
|
||
this.ranges = ranges;
|
||
this.inner = [];
|
||
this.innerDone = 0;
|
||
this.baseTree = null;
|
||
this.stoppedAt = null;
|
||
this.baseParse = base;
|
||
}
|
||
advance() {
|
||
if (this.baseParse) {
|
||
let done = this.baseParse.advance();
|
||
if (!done)
|
||
return null;
|
||
this.baseParse = null;
|
||
this.baseTree = done;
|
||
this.startInner();
|
||
if (this.stoppedAt != null)
|
||
for (let inner of this.inner)
|
||
inner.parse.stopAt(this.stoppedAt);
|
||
}
|
||
if (this.innerDone == this.inner.length) {
|
||
let result = this.baseTree;
|
||
if (this.stoppedAt != null)
|
||
result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));
|
||
return result;
|
||
}
|
||
let inner = this.inner[this.innerDone], done = inner.parse.advance();
|
||
if (done) {
|
||
this.innerDone++;
|
||
// This is a somewhat dodgy but super helpful hack where we
|
||
// patch up nodes created by the inner parse (and thus
|
||
// presumably not aliased anywhere else) to hold the information
|
||
// about the inner parse.
|
||
let props = Object.assign(Object.create(null), inner.target.props);
|
||
props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);
|
||
inner.target.props = props;
|
||
}
|
||
return null;
|
||
}
|
||
get parsedPos() {
|
||
if (this.baseParse)
|
||
return 0;
|
||
let pos = this.input.length;
|
||
for (let i = this.innerDone; i < this.inner.length; i++) {
|
||
if (this.inner[i].from < pos)
|
||
pos = Math.min(pos, this.inner[i].parse.parsedPos);
|
||
}
|
||
return pos;
|
||
}
|
||
stopAt(pos) {
|
||
this.stoppedAt = pos;
|
||
if (this.baseParse)
|
||
this.baseParse.stopAt(pos);
|
||
else
|
||
for (let i = this.innerDone; i < this.inner.length; i++)
|
||
this.inner[i].parse.stopAt(pos);
|
||
}
|
||
startInner() {
|
||
let fragmentCursor = new FragmentCursor(this.fragments);
|
||
let overlay = null;
|
||
let covered = null;
|
||
let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);
|
||
scan: for (let nest, isCovered;;) {
|
||
let enter = true, range;
|
||
if (this.stoppedAt != null && cursor.from >= this.stoppedAt) {
|
||
enter = false;
|
||
}
|
||
else if (fragmentCursor.hasNode(cursor)) {
|
||
if (overlay) {
|
||
let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);
|
||
if (match)
|
||
for (let r of match.mount.overlay) {
|
||
let from = r.from + match.pos, to = r.to + match.pos;
|
||
if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))
|
||
overlay.ranges.push({ from, to });
|
||
}
|
||
}
|
||
enter = false;
|
||
}
|
||
else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {
|
||
enter = isCovered != 2 /* Cover.Full */;
|
||
}
|
||
else if (!cursor.type.isAnonymous && (nest = this.nest(cursor, this.input)) &&
|
||
(cursor.from < cursor.to || !nest.overlay)) {
|
||
if (!cursor.tree) {
|
||
materialize(cursor);
|
||
// materialize create one more level of nesting
|
||
// we need to add depth to active overlay for going backwards
|
||
if (overlay)
|
||
overlay.depth++;
|
||
if (covered)
|
||
covered.depth++;
|
||
}
|
||
let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);
|
||
if (typeof nest.overlay == "function") {
|
||
overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);
|
||
}
|
||
else {
|
||
let ranges = punchRanges(this.ranges, nest.overlay ||
|
||
(cursor.from < cursor.to ? [new Range(cursor.from, cursor.to)] : []));
|
||
if (ranges.length)
|
||
checkRanges(ranges);
|
||
if (ranges.length || !nest.overlay)
|
||
this.inner.push(new InnerParse(nest.parser, ranges.length ? nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges)
|
||
: nest.parser.startParse(""), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges.length ? ranges[0].from : cursor.from));
|
||
if (!nest.overlay)
|
||
enter = false;
|
||
else if (ranges.length)
|
||
covered = { ranges, depth: 0, prev: covered };
|
||
}
|
||
}
|
||
else if (overlay && (range = overlay.predicate(cursor))) {
|
||
if (range === true)
|
||
range = new Range(cursor.from, cursor.to);
|
||
if (range.from < range.to) {
|
||
let last = overlay.ranges.length - 1;
|
||
if (last >= 0 && overlay.ranges[last].to == range.from)
|
||
overlay.ranges[last] = { from: overlay.ranges[last].from, to: range.to };
|
||
else
|
||
overlay.ranges.push(range);
|
||
}
|
||
}
|
||
if (enter && cursor.firstChild()) {
|
||
if (overlay)
|
||
overlay.depth++;
|
||
if (covered)
|
||
covered.depth++;
|
||
}
|
||
else {
|
||
for (;;) {
|
||
if (cursor.nextSibling())
|
||
break;
|
||
if (!cursor.parent())
|
||
break scan;
|
||
if (overlay && !--overlay.depth) {
|
||
let ranges = punchRanges(this.ranges, overlay.ranges);
|
||
if (ranges.length) {
|
||
checkRanges(ranges);
|
||
this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges[0].from));
|
||
}
|
||
overlay = overlay.prev;
|
||
}
|
||
if (covered && !--covered.depth)
|
||
covered = covered.prev;
|
||
}
|
||
}
|
||
}
|
||
}
|
||
}
|
||
function checkCover(covered, from, to) {
|
||
for (let range of covered) {
|
||
if (range.from >= to)
|
||
break;
|
||
if (range.to > from)
|
||
return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;
|
||
}
|
||
return 0 /* Cover.None */;
|
||
}
|
||
// Take a piece of buffer and convert it into a stand-alone
|
||
// TreeBuffer.
|
||
function sliceBuf(buf, startI, endI, nodes, positions, off) {
|
||
if (startI < endI) {
|
||
let from = buf.buffer[startI + 1];
|
||
nodes.push(buf.slice(startI, endI, from));
|
||
positions.push(from - off);
|
||
}
|
||
}
|
||
// This function takes a node that's in a buffer, and converts it, and
|
||
// its parent buffer nodes, into a Tree. This is again acting on the
|
||
// assumption that the trees and buffers have been constructed by the
|
||
// parse that was ran via the mix parser, and thus aren't shared with
|
||
// any other code, making violations of the immutability safe.
|
||
function materialize(cursor) {
|
||
let { node } = cursor, stack = [];
|
||
let buffer = node.context.buffer;
|
||
// Scan up to the nearest tree
|
||
do {
|
||
stack.push(cursor.index);
|
||
cursor.parent();
|
||
} while (!cursor.tree);
|
||
// Find the index of the buffer in that tree
|
||
let base = cursor.tree, i = base.children.indexOf(buffer);
|
||
let buf = base.children[i], b = buf.buffer, newStack = [i];
|
||
// Split a level in the buffer, putting the nodes before and after
|
||
// the child that contains `node` into new buffers.
|
||
function split(startI, endI, type, innerOffset, length, stackPos) {
|
||
let targetI = stack[stackPos];
|
||
let children = [], positions = [];
|
||
sliceBuf(buf, startI, targetI, children, positions, innerOffset);
|
||
let from = b[targetI + 1], to = b[targetI + 2];
|
||
newStack.push(children.length);
|
||
let child = stackPos
|
||
? split(targetI + 4, b[targetI + 3], buf.set.types[b[targetI]], from, to - from, stackPos - 1)
|
||
: node.toTree();
|
||
children.push(child);
|
||
positions.push(from - innerOffset);
|
||
sliceBuf(buf, b[targetI + 3], endI, children, positions, innerOffset);
|
||
return new Tree(type, children, positions, length);
|
||
}
|
||
base.children[i] = split(0, b.length, NodeType.none, 0, buf.length, stack.length - 1);
|
||
// Move the cursor back to the target node
|
||
for (let index of newStack) {
|
||
let tree = cursor.tree.children[index], pos = cursor.tree.positions[index];
|
||
cursor.yield(new TreeNode(tree, pos + cursor.from, index, cursor._tree));
|
||
}
|
||
}
|
||
class StructureCursor {
|
||
constructor(root, offset) {
|
||
this.offset = offset;
|
||
this.done = false;
|
||
this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);
|
||
}
|
||
// Move to the first node (in pre-order) that starts at or after `pos`.
|
||
moveTo(pos) {
|
||
let { cursor } = this, p = pos - this.offset;
|
||
while (!this.done && cursor.from < p) {
|
||
if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;
|
||
else if (!cursor.next(false))
|
||
this.done = true;
|
||
}
|
||
}
|
||
hasNode(cursor) {
|
||
this.moveTo(cursor.from);
|
||
if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {
|
||
for (let tree = this.cursor.tree;;) {
|
||
if (tree == cursor.tree)
|
||
return true;
|
||
if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)
|
||
tree = tree.children[0];
|
||
else
|
||
break;
|
||
}
|
||
}
|
||
return false;
|
||
}
|
||
}
|
||
class FragmentCursor {
|
||
constructor(fragments) {
|
||
var _a;
|
||
this.fragments = fragments;
|
||
this.curTo = 0;
|
||
this.fragI = 0;
|
||
if (fragments.length) {
|
||
let first = this.curFrag = fragments[0];
|
||
this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;
|
||
this.inner = new StructureCursor(first.tree, -first.offset);
|
||
}
|
||
else {
|
||
this.curFrag = this.inner = null;
|
||
}
|
||
}
|
||
hasNode(node) {
|
||
while (this.curFrag && node.from >= this.curTo)
|
||
this.nextFrag();
|
||
return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);
|
||
}
|
||
nextFrag() {
|
||
var _a;
|
||
this.fragI++;
|
||
if (this.fragI == this.fragments.length) {
|
||
this.curFrag = this.inner = null;
|
||
}
|
||
else {
|
||
let frag = this.curFrag = this.fragments[this.fragI];
|
||
this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;
|
||
this.inner = new StructureCursor(frag.tree, -frag.offset);
|
||
}
|
||
}
|
||
findMounts(pos, parser) {
|
||
var _a;
|
||
let result = [];
|
||
if (this.inner) {
|
||
this.inner.cursor.moveTo(pos, 1);
|
||
for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {
|
||
let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);
|
||
if (mount && mount.parser == parser) {
|
||
for (let i = this.fragI; i < this.fragments.length; i++) {
|
||
let frag = this.fragments[i];
|
||
if (frag.from >= pos.to)
|
||
break;
|
||
if (frag.tree == this.curFrag.tree)
|
||
result.push({
|
||
frag,
|
||
pos: pos.from - frag.offset,
|
||
mount
|
||
});
|
||
}
|
||
}
|
||
}
|
||
}
|
||
return result;
|
||
}
|
||
}
|
||
function punchRanges(outer, ranges) {
|
||
let copy = null, current = ranges;
|
||
for (let i = 1, j = 0; i < outer.length; i++) {
|
||
let gapFrom = outer[i - 1].to, gapTo = outer[i].from;
|
||
for (; j < current.length; j++) {
|
||
let r = current[j];
|
||
if (r.from >= gapTo)
|
||
break;
|
||
if (r.to <= gapFrom)
|
||
continue;
|
||
if (!copy)
|
||
current = copy = ranges.slice();
|
||
if (r.from < gapFrom) {
|
||
copy[j] = new Range(r.from, gapFrom);
|
||
if (r.to > gapTo)
|
||
copy.splice(j + 1, 0, new Range(gapTo, r.to));
|
||
}
|
||
else if (r.to > gapTo) {
|
||
copy[j--] = new Range(gapTo, r.to);
|
||
}
|
||
else {
|
||
copy.splice(j--, 1);
|
||
}
|
||
}
|
||
}
|
||
return current;
|
||
}
|
||
function findCoverChanges(a, b, from, to) {
|
||
let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;
|
||
let result = [];
|
||
for (;;) {
|
||
let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;
|
||
let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;
|
||
if (inA != inB) {
|
||
let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);
|
||
if (start < end)
|
||
result.push(new Range(start, end));
|
||
}
|
||
pos = Math.min(nextA, nextB);
|
||
if (pos == 1e9)
|
||
break;
|
||
if (nextA == pos) {
|
||
if (!inA)
|
||
inA = true;
|
||
else {
|
||
inA = false;
|
||
iA++;
|
||
}
|
||
}
|
||
if (nextB == pos) {
|
||
if (!inB)
|
||
inB = true;
|
||
else {
|
||
inB = false;
|
||
iB++;
|
||
}
|
||
}
|
||
}
|
||
return result;
|
||
}
|
||
// Given a number of fragments for the outer tree, and a set of ranges
|
||
// to parse, find fragments for inner trees mounted around those
|
||
// ranges, if any.
|
||
function enterFragments(mounts, ranges) {
|
||
let result = [];
|
||
for (let { pos, mount, frag } of mounts) {
|
||
let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;
|
||
let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);
|
||
if (mount.overlay) {
|
||
let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));
|
||
let changes = findCoverChanges(ranges, overlay, from, to);
|
||
for (let i = 0, pos = from;; i++) {
|
||
let last = i == changes.length, end = last ? to : changes[i].from;
|
||
if (end > pos)
|
||
result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));
|
||
if (last)
|
||
break;
|
||
pos = changes[i].to;
|
||
}
|
||
}
|
||
else {
|
||
result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));
|
||
}
|
||
}
|
||
return result;
|
||
}
|
||
|
||
|
||
|
||
|
||
/***/ }),
|
||
|
||
/***/ 236:
|
||
/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
|
||
|
||
|
||
// EXPORTS
|
||
__webpack_require__.d(__webpack_exports__, {
|
||
A: () => (/* binding */ toPropertyKey)
|
||
});
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/typeof.js
|
||
function _typeof(o) {
|
||
"@babel/helpers - typeof";
|
||
|
||
return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) {
|
||
return typeof o;
|
||
} : function (o) {
|
||
return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o;
|
||
}, _typeof(o);
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/toPrimitive.js
|
||
|
||
function toPrimitive(t, r) {
|
||
if ("object" != _typeof(t) || !t) return t;
|
||
var e = t[Symbol.toPrimitive];
|
||
if (void 0 !== e) {
|
||
var i = e.call(t, r || "default");
|
||
if ("object" != _typeof(i)) return i;
|
||
throw new TypeError("@@toPrimitive must return a primitive value.");
|
||
}
|
||
return ("string" === r ? String : Number)(t);
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js
|
||
|
||
|
||
function toPropertyKey(t) {
|
||
var i = toPrimitive(t, "string");
|
||
return "symbol" == _typeof(i) ? i : i + "";
|
||
}
|
||
|
||
|
||
/***/ }),
|
||
|
||
/***/ 289:
|
||
/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
|
||
|
||
|
||
// EXPORTS
|
||
__webpack_require__.d(__webpack_exports__, {
|
||
A: () => (/* binding */ _objectSpread2)
|
||
});
|
||
|
||
// EXTERNAL MODULE: ../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js + 2 modules
|
||
var toPropertyKey = __webpack_require__(236);
|
||
;// ../node_modules/@babel/runtime/helpers/esm/defineProperty.js
|
||
|
||
function _defineProperty(e, r, t) {
|
||
return (r = (0,toPropertyKey/* default */.A)(r)) in e ? Object.defineProperty(e, r, {
|
||
value: t,
|
||
enumerable: !0,
|
||
configurable: !0,
|
||
writable: !0
|
||
}) : e[r] = t, e;
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/objectSpread2.js
|
||
|
||
function ownKeys(e, r) {
|
||
var t = Object.keys(e);
|
||
if (Object.getOwnPropertySymbols) {
|
||
var o = Object.getOwnPropertySymbols(e);
|
||
r && (o = o.filter(function (r) {
|
||
return Object.getOwnPropertyDescriptor(e, r).enumerable;
|
||
})), t.push.apply(t, o);
|
||
}
|
||
return t;
|
||
}
|
||
function _objectSpread2(e) {
|
||
for (var r = 1; r < arguments.length; r++) {
|
||
var t = null != arguments[r] ? arguments[r] : {};
|
||
r % 2 ? ownKeys(Object(t), !0).forEach(function (r) {
|
||
_defineProperty(e, r, t[r]);
|
||
}) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) {
|
||
Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r));
|
||
});
|
||
}
|
||
return e;
|
||
}
|
||
|
||
|
||
/***/ }),
|
||
|
||
/***/ 341:
|
||
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
|
||
|
||
|
||
// EXPORTS
|
||
__webpack_require__.d(__webpack_exports__, {
|
||
Q: () => (/* binding */ ExternalChange),
|
||
q: () => (/* binding */ useCodeMirror)
|
||
});
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js
|
||
function _arrayLikeToArray(r, a) {
|
||
(null == a || a > r.length) && (a = r.length);
|
||
for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
|
||
return n;
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js
|
||
|
||
function _arrayWithoutHoles(r) {
|
||
if (Array.isArray(r)) return _arrayLikeToArray(r);
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/iterableToArray.js
|
||
function _iterableToArray(r) {
|
||
if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r);
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js
|
||
|
||
function _unsupportedIterableToArray(r, a) {
|
||
if (r) {
|
||
if ("string" == typeof r) return _arrayLikeToArray(r, a);
|
||
var t = {}.toString.call(r).slice(8, -1);
|
||
return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0;
|
||
}
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js
|
||
function _nonIterableSpread() {
|
||
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/toConsumableArray.js
|
||
|
||
|
||
|
||
|
||
function _toConsumableArray(r) {
|
||
return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread();
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js
|
||
function _arrayWithHoles(r) {
|
||
if (Array.isArray(r)) return r;
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js
|
||
function _iterableToArrayLimit(r, l) {
|
||
var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
|
||
if (null != t) {
|
||
var e,
|
||
n,
|
||
i,
|
||
u,
|
||
a = [],
|
||
f = !0,
|
||
o = !1;
|
||
try {
|
||
if (i = (t = t.call(r)).next, 0 === l) {
|
||
if (Object(t) !== t) return;
|
||
f = !1;
|
||
} else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);
|
||
} catch (r) {
|
||
o = !0, n = r;
|
||
} finally {
|
||
try {
|
||
if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return;
|
||
} finally {
|
||
if (o) throw n;
|
||
}
|
||
}
|
||
return a;
|
||
}
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/nonIterableRest.js
|
||
function _nonIterableRest() {
|
||
throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/slicedToArray.js
|
||
|
||
|
||
|
||
|
||
function _slicedToArray(r, e) {
|
||
return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest();
|
||
}
|
||
|
||
// EXTERNAL MODULE: external {"root":"React","commonjs2":"react","commonjs":"react","amd":"react"}
|
||
var external_root_React_commonjs2_react_commonjs_react_amd_react_ = __webpack_require__(442);
|
||
// EXTERNAL MODULE: external {"root":["CM","@codemirror/state"],"commonjs":"@codemirror/state","commonjs2":"@codemirror/state"}
|
||
var state_ = __webpack_require__(60);
|
||
// EXTERNAL MODULE: external {"root":["CM","@codemirror/view"],"commonjs":"@codemirror/view","commonjs2":"@codemirror/view"}
|
||
var view_ = __webpack_require__(730);
|
||
// EXTERNAL MODULE: ./src/getDefaultExtensions.ts
|
||
var getDefaultExtensions = __webpack_require__(89);
|
||
// EXTERNAL MODULE: ./src/utils.ts
|
||
var utils = __webpack_require__(369);
|
||
;// ../node_modules/@babel/runtime/helpers/esm/classCallCheck.js
|
||
function _classCallCheck(a, n) {
|
||
if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function");
|
||
}
|
||
|
||
// EXTERNAL MODULE: ../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js + 2 modules
|
||
var toPropertyKey = __webpack_require__(236);
|
||
;// ../node_modules/@babel/runtime/helpers/esm/createClass.js
|
||
|
||
function _defineProperties(e, r) {
|
||
for (var t = 0; t < r.length; t++) {
|
||
var o = r[t];
|
||
o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, (0,toPropertyKey/* default */.A)(o.key), o);
|
||
}
|
||
}
|
||
function _createClass(e, r, t) {
|
||
return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", {
|
||
writable: !1
|
||
}), e;
|
||
}
|
||
|
||
;// ./src/timeoutLatch.ts
|
||
// Setting / Unsetting timeouts for every keystroke was a significant overhead
|
||
// Inspired from https://github.com/iostreamer-X/timeout-latch
|
||
var TimeoutLatch=/*#__PURE__*/function(){function TimeoutLatch(callback,timeoutMS){_classCallCheck(this,TimeoutLatch);this.timeLeftMS=void 0;this.timeoutMS=void 0;this.isCancelled=false;this.isTimeExhausted=false;this.callbacks=[];this.timeLeftMS=timeoutMS;this.timeoutMS=timeoutMS;this.callbacks.push(callback);}return _createClass(TimeoutLatch,[{key:"tick",value:function tick(){if(!this.isCancelled&&!this.isTimeExhausted){this.timeLeftMS--;if(this.timeLeftMS<=0){this.isTimeExhausted=true;var callbacks=this.callbacks.slice();this.callbacks.length=0;callbacks.forEach(function(callback){try{callback();}catch(error){console.error('TimeoutLatch callback error:',error);}});}}}},{key:"cancel",value:function cancel(){this.isCancelled=true;this.callbacks.length=0;}},{key:"reset",value:function reset(){this.timeLeftMS=this.timeoutMS;this.isCancelled=false;this.isTimeExhausted=false;}},{key:"isDone",get:function get(){return this.isCancelled||this.isTimeExhausted;}}]);}();var Scheduler=/*#__PURE__*/function(){function Scheduler(){_classCallCheck(this,Scheduler);this.interval=null;this.latches=new Set();}return _createClass(Scheduler,[{key:"add",value:function add(latch){this.latches.add(latch);this.start();}},{key:"remove",value:function remove(latch){this.latches["delete"](latch);if(this.latches.size===0){this.stop();}}},{key:"start",value:function start(){var _this=this;if(this.interval===null){this.interval=setInterval(function(){_this.latches.forEach(function(latch){latch.tick();if(latch.isDone){_this.remove(latch);}});},1);}}},{key:"stop",value:function stop(){if(this.interval!==null){clearInterval(this.interval);this.interval=null;}}}]);}();var globalScheduler=null;var getScheduler=function getScheduler(){if(typeof window==='undefined'){return new Scheduler();}if(!globalScheduler){globalScheduler=new Scheduler();}return globalScheduler;};
|
||
;// ./src/useCodeMirror.ts
|
||
var ExternalChange=state_.Annotation.define();var TYPING_TIMOUT=200;// ms
|
||
var emptyExtensions=[];function useCodeMirror(props){var value=props.value,selection=props.selection,onChange=props.onChange,onStatistics=props.onStatistics,onCreateEditor=props.onCreateEditor,onUpdate=props.onUpdate,_props$extensions=props.extensions,extensions=_props$extensions===void 0?emptyExtensions:_props$extensions,autoFocus=props.autoFocus,_props$theme=props.theme,theme=_props$theme===void 0?'light':_props$theme,_props$height=props.height,height=_props$height===void 0?null:_props$height,_props$minHeight=props.minHeight,minHeight=_props$minHeight===void 0?null:_props$minHeight,_props$maxHeight=props.maxHeight,maxHeight=_props$maxHeight===void 0?null:_props$maxHeight,_props$width=props.width,width=_props$width===void 0?null:_props$width,_props$minWidth=props.minWidth,minWidth=_props$minWidth===void 0?null:_props$minWidth,_props$maxWidth=props.maxWidth,maxWidth=_props$maxWidth===void 0?null:_props$maxWidth,_props$placeholder=props.placeholder,placeholderStr=_props$placeholder===void 0?'':_props$placeholder,_props$editable=props.editable,editable=_props$editable===void 0?true:_props$editable,_props$readOnly=props.readOnly,readOnly=_props$readOnly===void 0?false:_props$readOnly,_props$indentWithTab=props.indentWithTab,defaultIndentWithTab=_props$indentWithTab===void 0?true:_props$indentWithTab,_props$basicSetup=props.basicSetup,defaultBasicSetup=_props$basicSetup===void 0?true:_props$basicSetup,root=props.root,initialState=props.initialState;var _useState=(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useState)(),_useState2=_slicedToArray(_useState,2),container=_useState2[0],setContainer=_useState2[1];var _useState3=(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useState)(),_useState4=_slicedToArray(_useState3,2),view=_useState4[0],setView=_useState4[1];var _useState5=(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useState)(),_useState6=_slicedToArray(_useState5,2),state=_useState6[0],setState=_useState6[1];var typingLatch=(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useState)(function(){return{current:null};})[0];var pendingUpdate=(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useState)(function(){return{current:null};})[0];var defaultThemeOption=view_.EditorView.theme({'&':{height:height,minHeight:minHeight,maxHeight:maxHeight,width:width,minWidth:minWidth,maxWidth:maxWidth},'& .cm-scroller':{height:'100% !important'}});var updateListener=view_.EditorView.updateListener.of(function(vu){if(vu.docChanged&&typeof onChange==='function'&&// Fix echoing of the remote changes:
|
||
// If transaction is market as remote we don't have to call `onChange` handler again
|
||
!vu.transactions.some(function(tr){return tr.annotation(ExternalChange);})){if(typingLatch.current){typingLatch.current.reset();}else{typingLatch.current=new TimeoutLatch(function(){if(pendingUpdate.current){var forceUpdate=pendingUpdate.current;pendingUpdate.current=null;forceUpdate();}typingLatch.current=null;},TYPING_TIMOUT);getScheduler().add(typingLatch.current);}var doc=vu.state.doc;var _value=doc.toString();onChange(_value,vu);}onStatistics&&onStatistics((0,utils/* getStatistics */.m)(vu));});var defaultExtensions=(0,getDefaultExtensions.getDefaultExtensions)({theme:theme,editable:editable,readOnly:readOnly,placeholder:placeholderStr,indentWithTab:defaultIndentWithTab,basicSetup:defaultBasicSetup});var getExtensions=[updateListener,defaultThemeOption].concat(_toConsumableArray(defaultExtensions));if(onUpdate&&typeof onUpdate==='function'){getExtensions.push(view_.EditorView.updateListener.of(onUpdate));}getExtensions=getExtensions.concat(extensions);(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useLayoutEffect)(function(){if(container&&!state){var config={doc:value,selection:selection,extensions:getExtensions};var stateCurrent=initialState?state_.EditorState.fromJSON(initialState.json,config,initialState.fields):state_.EditorState.create(config);setState(stateCurrent);if(!view){var viewCurrent=new view_.EditorView({state:stateCurrent,parent:container,root:root});setView(viewCurrent);onCreateEditor&&onCreateEditor(viewCurrent,stateCurrent);}}return function(){if(view){setState(undefined);setView(undefined);}};},[container,state]);(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useEffect)(function(){if(props.container){setContainer(props.container);}},[props.container]);(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useEffect)(function(){return function(){if(view){view.destroy();setView(undefined);}if(typingLatch.current){typingLatch.current.cancel();typingLatch.current=null;}};},[view]);(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useEffect)(function(){if(autoFocus&&view){view.focus();}},[autoFocus,view]);(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useEffect)(function(){if(view){view.dispatch({effects:state_.StateEffect.reconfigure.of(getExtensions)});}// eslint-disable-next-line react-hooks/exhaustive-deps
|
||
},[theme,extensions,height,minHeight,maxHeight,width,minWidth,maxWidth,placeholderStr,editable,readOnly,defaultIndentWithTab,defaultBasicSetup,onChange,onUpdate]);(0,external_root_React_commonjs2_react_commonjs_react_amd_react_.useEffect)(function(){if(value===undefined){return;}var currentValue=view?view.state.doc.toString():'';if(view&&value!==currentValue){var isTyping=typingLatch.current&&!typingLatch.current.isDone;var forceUpdate=function forceUpdate(){if(view&&value!==view.state.doc.toString()){view.dispatch({changes:{from:0,to:view.state.doc.toString().length,insert:value||''},annotations:[ExternalChange.of(true)]});}};if(!isTyping){forceUpdate();}else{pendingUpdate.current=forceUpdate;}}},[value,view]);return{state:state,setState:setState,view:view,setView:setView,container:container,setContainer:setContainer};}
|
||
|
||
/***/ }),
|
||
|
||
/***/ 369:
|
||
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
|
||
|
||
/* harmony export */ __webpack_require__.d(__webpack_exports__, {
|
||
/* harmony export */ m: () => (/* binding */ getStatistics)
|
||
/* harmony export */ });
|
||
var getStatistics=function getStatistics(view){return{line:view.state.doc.lineAt(view.state.selection.main.from),lineCount:view.state.doc.lines,lineBreak:view.state.lineBreak,length:view.state.doc.length,readOnly:view.state.readOnly,tabSize:view.state.tabSize,selection:view.state.selection,selectionAsSingle:view.state.selection.asSingle().main,ranges:view.state.selection.ranges,selectionCode:view.state.sliceDoc(view.state.selection.main.from,view.state.selection.main.to),selections:view.state.selection.ranges.map(function(r){return view.state.sliceDoc(r.from,r.to);}),selectedText:view.state.selection.ranges.some(function(r){return!r.empty;})};};
|
||
|
||
/***/ }),
|
||
|
||
/***/ 442:
|
||
/***/ ((module) => {
|
||
|
||
module.exports = __WEBPACK_EXTERNAL_MODULE__442__;
|
||
|
||
/***/ }),
|
||
|
||
/***/ 644:
|
||
/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
|
||
|
||
|
||
// EXPORTS
|
||
__webpack_require__.d(__webpack_exports__, {
|
||
A: () => (/* binding */ _objectWithoutProperties)
|
||
});
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js
|
||
function _objectWithoutPropertiesLoose(r, e) {
|
||
if (null == r) return {};
|
||
var t = {};
|
||
for (var n in r) if ({}.hasOwnProperty.call(r, n)) {
|
||
if (-1 !== e.indexOf(n)) continue;
|
||
t[n] = r[n];
|
||
}
|
||
return t;
|
||
}
|
||
|
||
;// ../node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js
|
||
|
||
function _objectWithoutProperties(e, t) {
|
||
if (null == e) return {};
|
||
var o,
|
||
r,
|
||
i = _objectWithoutPropertiesLoose(e, t);
|
||
if (Object.getOwnPropertySymbols) {
|
||
var n = Object.getOwnPropertySymbols(e);
|
||
for (r = 0; r < n.length; r++) o = n[r], -1 === t.indexOf(o) && {}.propertyIsEnumerable.call(e, o) && (i[o] = e[o]);
|
||
}
|
||
return i;
|
||
}
|
||
|
||
|
||
/***/ }),
|
||
|
||
/***/ 687:
|
||
/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
|
||
|
||
|
||
// EXPORTS
|
||
__webpack_require__.d(__webpack_exports__, {
|
||
o: () => (/* binding */ basicSetup),
|
||
V: () => (/* binding */ minimalSetup)
|
||
});
|
||
|
||
// EXTERNAL MODULE: external {"root":["CM","@codemirror/view"],"commonjs":"@codemirror/view","commonjs2":"@codemirror/view"}
|
||
var view_ = __webpack_require__(730);
|
||
// EXTERNAL MODULE: external {"root":["CM","@codemirror/state"],"commonjs":"@codemirror/state","commonjs2":"@codemirror/state"}
|
||
var state_ = __webpack_require__(60);
|
||
// EXTERNAL MODULE: ../node_modules/@codemirror/commands/dist/index.js
|
||
var dist = __webpack_require__(720);
|
||
;// ../node_modules/crelt/index.js
|
||
function crelt() {
|
||
var elt = arguments[0]
|
||
if (typeof elt == "string") elt = document.createElement(elt)
|
||
var i = 1, next = arguments[1]
|
||
if (next && typeof next == "object" && next.nodeType == null && !Array.isArray(next)) {
|
||
for (var name in next) if (Object.prototype.hasOwnProperty.call(next, name)) {
|
||
var value = next[name]
|
||
if (typeof value == "string") elt.setAttribute(name, value)
|
||
else if (value != null) elt[name] = value
|
||
}
|
||
i++
|
||
}
|
||
for (; i < arguments.length; i++) add(elt, arguments[i])
|
||
return elt
|
||
}
|
||
|
||
function add(elt, child) {
|
||
if (typeof child == "string") {
|
||
elt.appendChild(document.createTextNode(child))
|
||
} else if (child == null) {
|
||
} else if (child.nodeType != null) {
|
||
elt.appendChild(child)
|
||
} else if (Array.isArray(child)) {
|
||
for (var i = 0; i < child.length; i++) add(elt, child[i])
|
||
} else {
|
||
throw new RangeError("Unsupported child node: " + child)
|
||
}
|
||
}
|
||
|
||
;// ../node_modules/@codemirror/search/dist/index.js
|
||
|
||
|
||
|
||
|
||
const basicNormalize = typeof String.prototype.normalize == "function"
|
||
? x => x.normalize("NFKD") : x => x;
|
||
/**
|
||
A search cursor provides an iterator over text matches in a
|
||
document.
|
||
*/
|
||
class SearchCursor {
|
||
/**
|
||
Create a text cursor. The query is the search string, `from` to
|
||
`to` provides the region to search.
|
||
|
||
When `normalize` is given, it will be called, on both the query
|
||
string and the content it is matched against, before comparing.
|
||
You can, for example, create a case-insensitive search by
|
||
passing `s => s.toLowerCase()`.
|
||
|
||
Text is always normalized with
|
||
[`.normalize("NFKD")`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/normalize)
|
||
(when supported).
|
||
*/
|
||
constructor(text, query, from = 0, to = text.length, normalize, test) {
|
||
this.test = test;
|
||
/**
|
||
The current match (only holds a meaningful value after
|
||
[`next`](https://codemirror.net/6/docs/ref/#search.SearchCursor.next) has been called and when
|
||
`done` is false).
|
||
*/
|
||
this.value = { from: 0, to: 0 };
|
||
/**
|
||
Whether the end of the iterated region has been reached.
|
||
*/
|
||
this.done = false;
|
||
this.matches = [];
|
||
this.buffer = "";
|
||
this.bufferPos = 0;
|
||
this.iter = text.iterRange(from, to);
|
||
this.bufferStart = from;
|
||
this.normalize = normalize ? x => normalize(basicNormalize(x)) : basicNormalize;
|
||
this.query = this.normalize(query);
|
||
}
|
||
peek() {
|
||
if (this.bufferPos == this.buffer.length) {
|
||
this.bufferStart += this.buffer.length;
|
||
this.iter.next();
|
||
if (this.iter.done)
|
||
return -1;
|
||
this.bufferPos = 0;
|
||
this.buffer = this.iter.value;
|
||
}
|
||
return (0,state_.codePointAt)(this.buffer, this.bufferPos);
|
||
}
|
||
/**
|
||
Look for the next match. Updates the iterator's
|
||
[`value`](https://codemirror.net/6/docs/ref/#search.SearchCursor.value) and
|
||
[`done`](https://codemirror.net/6/docs/ref/#search.SearchCursor.done) properties. Should be called
|
||
at least once before using the cursor.
|
||
*/
|
||
next() {
|
||
while (this.matches.length)
|
||
this.matches.pop();
|
||
return this.nextOverlapping();
|
||
}
|
||
/**
|
||
The `next` method will ignore matches that partially overlap a
|
||
previous match. This method behaves like `next`, but includes
|
||
such matches.
|
||
*/
|
||
nextOverlapping() {
|
||
for (;;) {
|
||
let next = this.peek();
|
||
if (next < 0) {
|
||
this.done = true;
|
||
return this;
|
||
}
|
||
let str = (0,state_.fromCodePoint)(next), start = this.bufferStart + this.bufferPos;
|
||
this.bufferPos += (0,state_.codePointSize)(next);
|
||
let norm = this.normalize(str);
|
||
if (norm.length)
|
||
for (let i = 0, pos = start;; i++) {
|
||
let code = norm.charCodeAt(i);
|
||
let match = this.match(code, pos, this.bufferPos + this.bufferStart);
|
||
if (i == norm.length - 1) {
|
||
if (match) {
|
||
this.value = match;
|
||
return this;
|
||
}
|
||
break;
|
||
}
|
||
if (pos == start && i < str.length && str.charCodeAt(i) == code)
|
||
pos++;
|
||
}
|
||
}
|
||
}
|
||
match(code, pos, end) {
|
||
let match = null;
|
||
for (let i = 0; i < this.matches.length; i += 2) {
|
||
let index = this.matches[i], keep = false;
|
||
if (this.query.charCodeAt(index) == code) {
|
||
if (index == this.query.length - 1) {
|
||
match = { from: this.matches[i + 1], to: end };
|
||
}
|
||
else {
|
||
this.matches[i]++;
|
||
keep = true;
|
||
}
|
||
}
|
||
if (!keep) {
|
||
this.matches.splice(i, 2);
|
||
i -= 2;
|
||
}
|
||
}
|
||
if (this.query.charCodeAt(0) == code) {
|
||
if (this.query.length == 1)
|
||
match = { from: pos, to: end };
|
||
else
|
||
this.matches.push(1, pos);
|
||
}
|
||
if (match && this.test && !this.test(match.from, match.to, this.buffer, this.bufferStart))
|
||
match = null;
|
||
return match;
|
||
}
|
||
}
|
||
if (typeof Symbol != "undefined")
|
||
SearchCursor.prototype[Symbol.iterator] = function () { return this; };
|
||
|
||
const empty = { from: -1, to: -1, match: /*@__PURE__*//.*/.exec("") };
|
||
const baseFlags = "gm" + (/x/.unicode == null ? "" : "u");
|
||
/**
|
||
This class is similar to [`SearchCursor`](https://codemirror.net/6/docs/ref/#search.SearchCursor)
|
||
but searches for a regular expression pattern instead of a plain
|
||
string.
|
||
*/
|
||
class RegExpCursor {
|
||
/**
|
||
Create a cursor that will search the given range in the given
|
||
document. `query` should be the raw pattern (as you'd pass it to
|
||
`new RegExp`).
|
||
*/
|
||
constructor(text, query, options, from = 0, to = text.length) {
|
||
this.text = text;
|
||
this.to = to;
|
||
this.curLine = "";
|
||
/**
|
||
Set to `true` when the cursor has reached the end of the search
|
||
range.
|
||
*/
|
||
this.done = false;
|
||
/**
|
||
Will contain an object with the extent of the match and the
|
||
match object when [`next`](https://codemirror.net/6/docs/ref/#search.RegExpCursor.next)
|
||
sucessfully finds a match.
|
||
*/
|
||
this.value = empty;
|
||
if (/\\[sWDnr]|\n|\r|\[\^/.test(query))
|
||
return new MultilineRegExpCursor(text, query, options, from, to);
|
||
this.re = new RegExp(query, baseFlags + ((options === null || options === void 0 ? void 0 : options.ignoreCase) ? "i" : ""));
|
||
this.test = options === null || options === void 0 ? void 0 : options.test;
|
||
this.iter = text.iter();
|
||
let startLine = text.lineAt(from);
|
||
this.curLineStart = startLine.from;
|
||
this.matchPos = toCharEnd(text, from);
|
||
this.getLine(this.curLineStart);
|
||
}
|
||
getLine(skip) {
|
||
this.iter.next(skip);
|
||
if (this.iter.lineBreak) {
|
||
this.curLine = "";
|
||
}
|
||
else {
|
||
this.curLine = this.iter.value;
|
||
if (this.curLineStart + this.curLine.length > this.to)
|
||
this.curLine = this.curLine.slice(0, this.to - this.curLineStart);
|
||
this.iter.next();
|
||
}
|
||
}
|
||
nextLine() {
|
||
this.curLineStart = this.curLineStart + this.curLine.length + 1;
|
||
if (this.curLineStart > this.to)
|
||
this.curLine = "";
|
||
else
|
||
this.getLine(0);
|
||
}
|
||
/**
|
||
Move to the next match, if there is one.
|
||
*/
|
||
next() {
|
||
for (let off = this.matchPos - this.curLineStart;;) {
|
||
this.re.lastIndex = off;
|
||
let match = this.matchPos <= this.to && this.re.exec(this.curLine);
|
||
if (match) {
|
||
let from = this.curLineStart + match.index, to = from + match[0].length;
|
||
this.matchPos = toCharEnd(this.text, to + (from == to ? 1 : 0));
|
||
if (from == this.curLineStart + this.curLine.length)
|
||
this.nextLine();
|
||
if ((from < to || from > this.value.to) && (!this.test || this.test(from, to, match))) {
|
||
this.value = { from, to, match };
|
||
return this;
|
||
}
|
||
off = this.matchPos - this.curLineStart;
|
||
}
|
||
else if (this.curLineStart + this.curLine.length < this.to) {
|
||
this.nextLine();
|
||
off = 0;
|
||
}
|
||
else {
|
||
this.done = true;
|
||
return this;
|
||
}
|
||
}
|
||
}
|
||
}
|
||
const flattened = /*@__PURE__*/new WeakMap();
|
||
// Reusable (partially) flattened document strings
|
||
class FlattenedDoc {
|
||
constructor(from, text) {
|
||
this.from = from;
|
||
this.text = text;
|
||
}
|
||
get to() { return this.from + this.text.length; }
|
||
static get(doc, from, to) {
|
||
let cached = flattened.get(doc);
|
||
if (!cached || cached.from >= to || cached.to <= from) {
|
||
let flat = new FlattenedDoc(from, doc.sliceString(from, to));
|
||
flattened.set(doc, flat);
|
||
return flat;
|
||
}
|
||
if (cached.from == from && cached.to == to)
|
||
return cached;
|
||
let { text, from: cachedFrom } = cached;
|
||
if (cachedFrom > from) {
|
||
text = doc.sliceString(from, cachedFrom) + text;
|
||
cachedFrom = from;
|
||
}
|
||
if (cached.to < to)
|
||
text += doc.sliceString(cached.to, to);
|
||
flattened.set(doc, new FlattenedDoc(cachedFrom, text));
|
||
return new FlattenedDoc(from, text.slice(from - cachedFrom, to - cachedFrom));
|
||
}
|
||
}
|
||
class MultilineRegExpCursor {
|
||
constructor(text, query, options, from, to) {
|
||
this.text = text;
|
||
this.to = to;
|
||
this.done = false;
|
||
this.value = empty;
|
||
this.matchPos = toCharEnd(text, from);
|
||
this.re = new RegExp(query, baseFlags + ((options === null || options === void 0 ? void 0 : options.ignoreCase) ? "i" : ""));
|
||
this.test = options === null || options === void 0 ? void 0 : options.test;
|
||
this.flat = FlattenedDoc.get(text, from, this.chunkEnd(from + 5000 /* Chunk.Base */));
|
||
}
|
||
chunkEnd(pos) {
|
||
return pos >= this.to ? this.to : this.text.lineAt(pos).to;
|
||
}
|
||
next() {
|
||
for (;;) {
|
||
let off = this.re.lastIndex = this.matchPos - this.flat.from;
|
||
let match = this.re.exec(this.flat.text);
|
||
// Skip empty matches directly after the last match
|
||
if (match && !match[0] && match.index == off) {
|
||
this.re.lastIndex = off + 1;
|
||
match = this.re.exec(this.flat.text);
|
||
}
|
||
if (match) {
|
||
let from = this.flat.from + match.index, to = from + match[0].length;
|
||
// If a match goes almost to the end of a noncomplete chunk, try
|
||
// again, since it'll likely be able to match more
|
||
if ((this.flat.to >= this.to || match.index + match[0].length <= this.flat.text.length - 10) &&
|
||
(!this.test || this.test(from, to, match))) {
|
||
this.value = { from, to, match };
|
||
this.matchPos = toCharEnd(this.text, to + (from == to ? 1 : 0));
|
||
return this;
|
||
}
|
||
}
|
||
if (this.flat.to == this.to) {
|
||
this.done = true;
|
||
return this;
|
||
}
|
||
// Grow the flattened doc
|
||
this.flat = FlattenedDoc.get(this.text, this.flat.from, this.chunkEnd(this.flat.from + this.flat.text.length * 2));
|
||
}
|
||
}
|
||
}
|
||
if (typeof Symbol != "undefined") {
|
||
RegExpCursor.prototype[Symbol.iterator] = MultilineRegExpCursor.prototype[Symbol.iterator] =
|
||
function () { return this; };
|
||
}
|
||
function validRegExp(source) {
|
||
try {
|
||
new RegExp(source, baseFlags);
|
||
return true;
|
||
}
|
||
catch (_a) {
|
||
return false;
|
||
}
|
||
}
|
||
function toCharEnd(text, pos) {
|
||
if (pos >= text.length)
|
||
return pos;
|
||
let line = text.lineAt(pos), next;
|
||
while (pos < line.to && (next = line.text.charCodeAt(pos - line.from)) >= 0xDC00 && next < 0xE000)
|
||
pos++;
|
||
return pos;
|
||
}
|
||
|
||
function createLineDialog(view) {
|
||
let line = String(view.state.doc.lineAt(view.state.selection.main.head).number);
|
||
let input = crelt("input", { class: "cm-textfield", name: "line", value: line });
|
||
let dom = crelt("form", {
|
||
class: "cm-gotoLine",
|
||
onkeydown: (event) => {
|
||
if (event.keyCode == 27) { // Escape
|
||
event.preventDefault();
|
||
view.dispatch({ effects: dialogEffect.of(false) });
|
||
view.focus();
|
||
}
|
||
else if (event.keyCode == 13) { // Enter
|
||
event.preventDefault();
|
||
go();
|
||
}
|
||
},
|
||
onsubmit: (event) => {
|
||
event.preventDefault();
|
||
go();
|
||
}
|
||
}, crelt("label", view.state.phrase("Go to line"), ": ", input), " ", crelt("button", { class: "cm-button", type: "submit" }, view.state.phrase("go")), crelt("button", {
|
||
name: "close",
|
||
onclick: () => {
|
||
view.dispatch({ effects: dialogEffect.of(false) });
|
||
view.focus();
|
||
},
|
||
"aria-label": view.state.phrase("close"),
|
||
type: "button"
|
||
}, ["×"]));
|
||
function go() {
|
||
let match = /^([+-])?(\d+)?(:\d+)?(%)?$/.exec(input.value);
|
||
if (!match)
|
||
return;
|
||
let { state } = view, startLine = state.doc.lineAt(state.selection.main.head);
|
||
let [, sign, ln, cl, percent] = match;
|
||
let col = cl ? +cl.slice(1) : 0;
|
||
let line = ln ? +ln : startLine.number;
|
||
if (ln && percent) {
|
||
let pc = line / 100;
|
||
if (sign)
|
||
pc = pc * (sign == "-" ? -1 : 1) + (startLine.number / state.doc.lines);
|
||
line = Math.round(state.doc.lines * pc);
|
||
}
|
||
else if (ln && sign) {
|
||
line = line * (sign == "-" ? -1 : 1) + startLine.number;
|
||
}
|
||
let docLine = state.doc.line(Math.max(1, Math.min(state.doc.lines, line)));
|
||
let selection = state_.EditorSelection.cursor(docLine.from + Math.max(0, Math.min(col, docLine.length)));
|
||
view.dispatch({
|
||
effects: [dialogEffect.of(false), view_.EditorView.scrollIntoView(selection.from, { y: 'center' })],
|
||
selection,
|
||
});
|
||
view.focus();
|
||
}
|
||
return { dom };
|
||
}
|
||
const dialogEffect = /*@__PURE__*/state_.StateEffect.define();
|
||
const dialogField = /*@__PURE__*/state_.StateField.define({
|
||
create() { return true; },
|
||
update(value, tr) {
|
||
for (let e of tr.effects)
|
||
if (e.is(dialogEffect))
|
||
value = e.value;
|
||
return value;
|
||
},
|
||
provide: f => view_.showPanel.from(f, val => val ? createLineDialog : null)
|
||
});
|
||
/**
|
||
Command that shows a dialog asking the user for a line number, and
|
||
when a valid position is provided, moves the cursor to that line.
|
||
|
||
Supports line numbers, relative line offsets prefixed with `+` or
|
||
`-`, document percentages suffixed with `%`, and an optional
|
||
column position by adding `:` and a second number after the line
|
||
number.
|
||
*/
|
||
const gotoLine = view => {
|
||
let panel = (0,view_.getPanel)(view, createLineDialog);
|
||
if (!panel) {
|
||
let effects = [dialogEffect.of(true)];
|
||
if (view.state.field(dialogField, false) == null)
|
||
effects.push(state_.StateEffect.appendConfig.of([dialogField, baseTheme$1]));
|
||
view.dispatch({ effects });
|
||
panel = (0,view_.getPanel)(view, createLineDialog);
|
||
}
|
||
if (panel)
|
||
panel.dom.querySelector("input").select();
|
||
return true;
|
||
};
|
||
const baseTheme$1 = /*@__PURE__*/view_.EditorView.baseTheme({
|
||
".cm-panel.cm-gotoLine": {
|
||
padding: "2px 6px 4px",
|
||
position: "relative",
|
||
"& label": { fontSize: "80%" },
|
||
"& [name=close]": {
|
||
position: "absolute",
|
||
top: "0", bottom: "0",
|
||
right: "4px",
|
||
backgroundColor: "inherit",
|
||
border: "none",
|
||
font: "inherit",
|
||
padding: "0"
|
||
}
|
||
}
|
||
});
|
||
|
||
const defaultHighlightOptions = {
|
||
highlightWordAroundCursor: false,
|
||
minSelectionLength: 1,
|
||
maxMatches: 100,
|
||
wholeWords: false
|
||
};
|
||
const highlightConfig = /*@__PURE__*/state_.Facet.define({
|
||
combine(options) {
|
||
return (0,state_.combineConfig)(options, defaultHighlightOptions, {
|
||
highlightWordAroundCursor: (a, b) => a || b,
|
||
minSelectionLength: Math.min,
|
||
maxMatches: Math.min
|
||
});
|
||
}
|
||
});
|
||
/**
|
||
This extension highlights text that matches the selection. It uses
|
||
the `"cm-selectionMatch"` class for the highlighting. When
|
||
`highlightWordAroundCursor` is enabled, the word at the cursor
|
||
itself will be highlighted with `"cm-selectionMatch-main"`.
|
||
*/
|
||
function highlightSelectionMatches(options) {
|
||
let ext = [defaultTheme, matchHighlighter];
|
||
if (options)
|
||
ext.push(highlightConfig.of(options));
|
||
return ext;
|
||
}
|
||
const matchDeco = /*@__PURE__*/view_.Decoration.mark({ class: "cm-selectionMatch" });
|
||
const mainMatchDeco = /*@__PURE__*/view_.Decoration.mark({ class: "cm-selectionMatch cm-selectionMatch-main" });
|
||
// Whether the characters directly outside the given positions are non-word characters
|
||
function insideWordBoundaries(check, state, from, to) {
|
||
return (from == 0 || check(state.sliceDoc(from - 1, from)) != state_.CharCategory.Word) &&
|
||
(to == state.doc.length || check(state.sliceDoc(to, to + 1)) != state_.CharCategory.Word);
|
||
}
|
||
// Whether the characters directly at the given positions are word characters
|
||
function insideWord(check, state, from, to) {
|
||
return check(state.sliceDoc(from, from + 1)) == state_.CharCategory.Word
|
||
&& check(state.sliceDoc(to - 1, to)) == state_.CharCategory.Word;
|
||
}
|
||
const matchHighlighter = /*@__PURE__*/view_.ViewPlugin.fromClass(class {
|
||
constructor(view) {
|
||
this.decorations = this.getDeco(view);
|
||
}
|
||
update(update) {
|
||
if (update.selectionSet || update.docChanged || update.viewportChanged)
|
||
this.decorations = this.getDeco(update.view);
|
||
}
|
||
getDeco(view) {
|
||
let conf = view.state.facet(highlightConfig);
|
||
let { state } = view, sel = state.selection;
|
||
if (sel.ranges.length > 1)
|
||
return view_.Decoration.none;
|
||
let range = sel.main, query, check = null;
|
||
if (range.empty) {
|
||
if (!conf.highlightWordAroundCursor)
|
||
return view_.Decoration.none;
|
||
let word = state.wordAt(range.head);
|
||
if (!word)
|
||
return view_.Decoration.none;
|
||
check = state.charCategorizer(range.head);
|
||
query = state.sliceDoc(word.from, word.to);
|
||
}
|
||
else {
|
||
let len = range.to - range.from;
|
||
if (len < conf.minSelectionLength || len > 200)
|
||
return view_.Decoration.none;
|
||
if (conf.wholeWords) {
|
||
query = state.sliceDoc(range.from, range.to); // TODO: allow and include leading/trailing space?
|
||
check = state.charCategorizer(range.head);
|
||
if (!(insideWordBoundaries(check, state, range.from, range.to) &&
|
||
insideWord(check, state, range.from, range.to)))
|
||
return view_.Decoration.none;
|
||
}
|
||
else {
|
||
query = state.sliceDoc(range.from, range.to);
|
||
if (!query)
|
||
return view_.Decoration.none;
|
||
}
|
||
}
|
||
let deco = [];
|
||
for (let part of view.visibleRanges) {
|
||
let cursor = new SearchCursor(state.doc, query, part.from, part.to);
|
||
while (!cursor.next().done) {
|
||
let { from, to } = cursor.value;
|
||
if (!check || insideWordBoundaries(check, state, from, to)) {
|
||
if (range.empty && from <= range.from && to >= range.to)
|
||
deco.push(mainMatchDeco.range(from, to));
|
||
else if (from >= range.to || to <= range.from)
|
||
deco.push(matchDeco.range(from, to));
|
||
if (deco.length > conf.maxMatches)
|
||
return view_.Decoration.none;
|
||
}
|
||
}
|
||
}
|
||
return view_.Decoration.set(deco);
|
||
}
|
||
}, {
|
||
decorations: v => v.decorations
|
||
});
|
||
const defaultTheme = /*@__PURE__*/view_.EditorView.baseTheme({
|
||
".cm-selectionMatch": { backgroundColor: "#99ff7780" },
|
||
".cm-searchMatch .cm-selectionMatch": { backgroundColor: "transparent" }
|
||
});
|
||
// Select the words around the cursors.
|
||
const selectWord = ({ state, dispatch }) => {
|
||
let { selection } = state;
|
||
let newSel = state_.EditorSelection.create(selection.ranges.map(range => state.wordAt(range.head) || state_.EditorSelection.cursor(range.head)), selection.mainIndex);
|
||
if (newSel.eq(selection))
|
||
return false;
|
||
dispatch(state.update({ selection: newSel }));
|
||
return true;
|
||
};
|
||
// Find next occurrence of query relative to last cursor. Wrap around
|
||
// the document if there are no more matches.
|
||
function findNextOccurrence(state, query) {
|
||
let { main, ranges } = state.selection;
|
||
let word = state.wordAt(main.head), fullWord = word && word.from == main.from && word.to == main.to;
|
||
for (let cycled = false, cursor = new SearchCursor(state.doc, query, ranges[ranges.length - 1].to);;) {
|
||
cursor.next();
|
||
if (cursor.done) {
|
||
if (cycled)
|
||
return null;
|
||
cursor = new SearchCursor(state.doc, query, 0, Math.max(0, ranges[ranges.length - 1].from - 1));
|
||
cycled = true;
|
||
}
|
||
else {
|
||
if (cycled && ranges.some(r => r.from == cursor.value.from))
|
||
continue;
|
||
if (fullWord) {
|
||
let word = state.wordAt(cursor.value.from);
|
||
if (!word || word.from != cursor.value.from || word.to != cursor.value.to)
|
||
continue;
|
||
}
|
||
return cursor.value;
|
||
}
|
||
}
|
||
}
|
||
/**
|
||
Select next occurrence of the current selection. Expand selection
|
||
to the surrounding word when the selection is empty.
|
||
*/
|
||
const selectNextOccurrence = ({ state, dispatch }) => {
|
||
let { ranges } = state.selection;
|
||
if (ranges.some(sel => sel.from === sel.to))
|
||
return selectWord({ state, dispatch });
|
||
let searchedText = state.sliceDoc(ranges[0].from, ranges[0].to);
|
||
if (state.selection.ranges.some(r => state.sliceDoc(r.from, r.to) != searchedText))
|
||
return false;
|
||
let range = findNextOccurrence(state, searchedText);
|
||
if (!range)
|
||
return false;
|
||
dispatch(state.update({
|
||
selection: state.selection.addRange(state_.EditorSelection.range(range.from, range.to), false),
|
||
effects: view_.EditorView.scrollIntoView(range.to)
|
||
}));
|
||
return true;
|
||
};
|
||
|
||
const searchConfigFacet = /*@__PURE__*/state_.Facet.define({
|
||
combine(configs) {
|
||
return (0,state_.combineConfig)(configs, {
|
||
top: false,
|
||
caseSensitive: false,
|
||
literal: false,
|
||
regexp: false,
|
||
wholeWord: false,
|
||
createPanel: view => new SearchPanel(view),
|
||
scrollToMatch: range => view_.EditorView.scrollIntoView(range)
|
||
});
|
||
}
|
||
});
|
||
/**
|
||
Add search state to the editor configuration, and optionally
|
||
configure the search extension.
|
||
([`openSearchPanel`](https://codemirror.net/6/docs/ref/#search.openSearchPanel) will automatically
|
||
enable this if it isn't already on).
|
||
*/
|
||
function search(config) {
|
||
return config ? [searchConfigFacet.of(config), searchExtensions] : searchExtensions;
|
||
}
|
||
/**
|
||
A search query. Part of the editor's search state.
|
||
*/
|
||
class SearchQuery {
|
||
/**
|
||
Create a query object.
|
||
*/
|
||
constructor(config) {
|
||
this.search = config.search;
|
||
this.caseSensitive = !!config.caseSensitive;
|
||
this.literal = !!config.literal;
|
||
this.regexp = !!config.regexp;
|
||
this.replace = config.replace || "";
|
||
this.valid = !!this.search && (!this.regexp || validRegExp(this.search));
|
||
this.unquoted = this.unquote(this.search);
|
||
this.wholeWord = !!config.wholeWord;
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
unquote(text) {
|
||
return this.literal ? text :
|
||
text.replace(/\\([nrt\\])/g, (_, ch) => ch == "n" ? "\n" : ch == "r" ? "\r" : ch == "t" ? "\t" : "\\");
|
||
}
|
||
/**
|
||
Compare this query to another query.
|
||
*/
|
||
eq(other) {
|
||
return this.search == other.search && this.replace == other.replace &&
|
||
this.caseSensitive == other.caseSensitive && this.regexp == other.regexp &&
|
||
this.wholeWord == other.wholeWord;
|
||
}
|
||
/**
|
||
@internal
|
||
*/
|
||
create() {
|
||
return this.regexp ? new RegExpQuery(this) : new StringQuery(this);
|
||
}
|
||
/**
|
||
Get a search cursor for this query, searching through the given
|
||
range in the given state.
|
||
*/
|
||
getCursor(state, from = 0, to) {
|
||
let st = state.doc ? state : state_.EditorState.create({ doc: state });
|
||
if (to == null)
|
||
to = st.doc.length;
|
||
return this.regexp ? regexpCursor(this, st, from, to) : stringCursor(this, st, from, to);
|
||
}
|
||
}
|
||
class QueryType {
|
||
constructor(spec) {
|
||
this.spec = spec;
|
||
}
|
||
}
|
||
function stringCursor(spec, state, from, to) {
|
||
return new SearchCursor(state.doc, spec.unquoted, from, to, spec.caseSensitive ? undefined : x => x.toLowerCase(), spec.wholeWord ? stringWordTest(state.doc, state.charCategorizer(state.selection.main.head)) : undefined);
|
||
}
|
||
function stringWordTest(doc, categorizer) {
|
||
return (from, to, buf, bufPos) => {
|
||
if (bufPos > from || bufPos + buf.length < to) {
|
||
bufPos = Math.max(0, from - 2);
|
||
buf = doc.sliceString(bufPos, Math.min(doc.length, to + 2));
|
||
}
|
||
return (categorizer(charBefore(buf, from - bufPos)) != state_.CharCategory.Word ||
|
||
categorizer(charAfter(buf, from - bufPos)) != state_.CharCategory.Word) &&
|
||
(categorizer(charAfter(buf, to - bufPos)) != state_.CharCategory.Word ||
|
||
categorizer(charBefore(buf, to - bufPos)) != state_.CharCategory.Word);
|
||
};
|
||
}
|
||
class StringQuery extends QueryType {
|
||
constructor(spec) {
|
||
super(spec);
|
||
}
|
||
nextMatch(state, curFrom, curTo) {
|
||
let cursor = stringCursor(this.spec, state, curTo, state.doc.length).nextOverlapping();
|
||
if (cursor.done) {
|
||
let end = Math.min(state.doc.length, curFrom + this.spec.unquoted.length);
|
||
cursor = stringCursor(this.spec, state, 0, end).nextOverlapping();
|
||
}
|
||
return cursor.done || cursor.value.from == curFrom && cursor.value.to == curTo ? null : cursor.value;
|
||
}
|
||
// Searching in reverse is, rather than implementing an inverted search
|
||
// cursor, done by scanning chunk after chunk forward.
|
||
prevMatchInRange(state, from, to) {
|
||
for (let pos = to;;) {
|
||
let start = Math.max(from, pos - 10000 /* FindPrev.ChunkSize */ - this.spec.unquoted.length);
|
||
let cursor = stringCursor(this.spec, state, start, pos), range = null;
|
||
while (!cursor.nextOverlapping().done)
|
||
range = cursor.value;
|
||
if (range)
|
||
return range;
|
||
if (start == from)
|
||
return null;
|
||
pos -= 10000 /* FindPrev.ChunkSize */;
|
||
}
|
||
}
|
||
prevMatch(state, curFrom, curTo) {
|
||
let found = this.prevMatchInRange(state, 0, curFrom);
|
||
if (!found)
|
||
found = this.prevMatchInRange(state, Math.max(0, curTo - this.spec.unquoted.length), state.doc.length);
|
||
return found && (found.from != curFrom || found.to != curTo) ? found : null;
|
||
}
|
||
getReplacement(_result) { return this.spec.unquote(this.spec.replace); }
|
||
matchAll(state, limit) {
|
||
let cursor = stringCursor(this.spec, state, 0, state.doc.length), ranges = [];
|
||
while (!cursor.next().done) {
|
||
if (ranges.length >= limit)
|
||
return null;
|
||
ranges.push(cursor.value);
|
||
}
|
||
return ranges;
|
||
}
|
||
highlight(state, from, to, add) {
|
||
let cursor = stringCursor(this.spec, state, Math.max(0, from - this.spec.unquoted.length), Math.min(to + this.spec.unquoted.length, state.doc.length));
|
||
while (!cursor.next().done)
|
||
add(cursor.value.from, cursor.value.to);
|
||
}
|
||
}
|
||
function regexpCursor(spec, state, from, to) {
|
||
return new RegExpCursor(state.doc, spec.search, {
|
||
ignoreCase: !spec.caseSensitive,
|
||
test: spec.wholeWord ? regexpWordTest(state.charCategorizer(state.selection.main.head)) : undefined
|
||
}, from, to);
|
||
}
|
||
function charBefore(str, index) {
|
||
return str.slice((0,state_.findClusterBreak)(str, index, false), index);
|
||
}
|
||
function charAfter(str, index) {
|
||
return str.slice(index, (0,state_.findClusterBreak)(str, index));
|
||
}
|
||
function regexpWordTest(categorizer) {
|
||
return (_from, _to, match) => !match[0].length ||
|
||
(categorizer(charBefore(match.input, match.index)) != state_.CharCategory.Word ||
|
||
categorizer(charAfter(match.input, match.index)) != state_.CharCategory.Word) &&
|
||
(categorizer(charAfter(match.input, match.index + match[0].length)) != state_.CharCategory.Word ||
|
||
categorizer(charBefore(match.input, match.index + match[0].length)) != state_.CharCategory.Word);
|
||
}
|
||
class RegExpQuery extends QueryType {
|
||
nextMatch(state, curFrom, curTo) {
|
||
let cursor = regexpCursor(this.spec, state, curTo, state.doc.length).next();
|
||
if (cursor.done)
|
||
cursor = regexpCursor(this.spec, state, 0, curFrom).next();
|
||
return cursor.done ? null : cursor.value;
|
||
}
|
||
prevMatchInRange(state, from, to) {
|
||
for (let size = 1;; size++) {
|
||
let start = Math.max(from, to - size * 10000 /* FindPrev.ChunkSize */);
|
||
let cursor = regexpCursor(this.spec, state, start, to), range = null;
|
||
while (!cursor.next().done)
|
||
range = cursor.value;
|
||
if (range && (start == from || range.from > start + 10))
|
||
return range;
|
||
if (start == from)
|
||
return null;
|
||
}
|
||
}
|
||
prevMatch(state, curFrom, curTo) {
|
||
return this.prevMatchInRange(state, 0, curFrom) ||
|
||
this.prevMatchInRange(state, curTo, state.doc.length);
|
||
}
|
||
getReplacement(result) {
|
||
return this.spec.unquote(this.spec.replace).replace(/\$([$&]|\d+)/g, (m, i) => {
|
||
if (i == "&")
|
||
return result.match[0];
|
||
if (i == "$")
|
||
return "$";
|
||
for (let l = i.length; l > 0; l--) {
|
||
let n = +i.slice(0, l);
|
||
if (n > 0 && n < result.match.length)
|
||
return result.match[n] + i.slice(l);
|
||
}
|
||
return m;
|
||
});
|
||
}
|
||
matchAll(state, limit) {
|
||
let cursor = regexpCursor(this.spec, state, 0, state.doc.length), ranges = [];
|
||
while (!cursor.next().done) {
|
||
if (ranges.length >= limit)
|
||
return null;
|
||
ranges.push(cursor.value);
|
||
}
|
||
return ranges;
|
||
}
|
||
highlight(state, from, to, add) {
|
||
let cursor = regexpCursor(this.spec, state, Math.max(0, from - 250 /* RegExp.HighlightMargin */), Math.min(to + 250 /* RegExp.HighlightMargin */, state.doc.length));
|
||
while (!cursor.next().done)
|
||
add(cursor.value.from, cursor.value.to);
|
||
}
|
||
}
|
||
/**
|
||
A state effect that updates the current search query. Note that
|
||
this only has an effect if the search state has been initialized
|
||
(by including [`search`](https://codemirror.net/6/docs/ref/#search.search) in your configuration or
|
||
by running [`openSearchPanel`](https://codemirror.net/6/docs/ref/#search.openSearchPanel) at least
|
||
once).
|
||
*/
|
||
const setSearchQuery = /*@__PURE__*/state_.StateEffect.define();
|
||
const togglePanel = /*@__PURE__*/state_.StateEffect.define();
|
||
const searchState = /*@__PURE__*/state_.StateField.define({
|
||
create(state) {
|
||
return new SearchState(defaultQuery(state).create(), null);
|
||
},
|
||
update(value, tr) {
|
||
for (let effect of tr.effects) {
|
||
if (effect.is(setSearchQuery))
|
||
value = new SearchState(effect.value.create(), value.panel);
|
||
else if (effect.is(togglePanel))
|
||
value = new SearchState(value.query, effect.value ? createSearchPanel : null);
|
||
}
|
||
return value;
|
||
},
|
||
provide: f => view_.showPanel.from(f, val => val.panel)
|
||
});
|
||
/**
|
||
Get the current search query from an editor state.
|
||
*/
|
||
function getSearchQuery(state) {
|
||
let curState = state.field(searchState, false);
|
||
return curState ? curState.query.spec : defaultQuery(state);
|
||
}
|
||
/**
|
||
Query whether the search panel is open in the given editor state.
|
||
*/
|
||
function searchPanelOpen(state) {
|
||
var _a;
|
||
return ((_a = state.field(searchState, false)) === null || _a === void 0 ? void 0 : _a.panel) != null;
|
||
}
|
||
class SearchState {
|
||
constructor(query, panel) {
|
||
this.query = query;
|
||
this.panel = panel;
|
||
}
|
||
}
|
||
const matchMark = /*@__PURE__*/view_.Decoration.mark({ class: "cm-searchMatch" }), selectedMatchMark = /*@__PURE__*/view_.Decoration.mark({ class: "cm-searchMatch cm-searchMatch-selected" });
|
||
const searchHighlighter = /*@__PURE__*/view_.ViewPlugin.fromClass(class {
|
||
constructor(view) {
|
||
this.view = view;
|
||
this.decorations = this.highlight(view.state.field(searchState));
|
||
}
|
||
update(update) {
|
||
let state = update.state.field(searchState);
|
||
if (state != update.startState.field(searchState) || update.docChanged || update.selectionSet || update.viewportChanged)
|
||
this.decorations = this.highlight(state);
|
||
}
|
||
highlight({ query, panel }) {
|
||
if (!panel || !query.spec.valid)
|
||
return view_.Decoration.none;
|
||
let { view } = this;
|
||
let builder = new state_.RangeSetBuilder();
|
||
for (let i = 0, ranges = view.visibleRanges, l = ranges.length; i < l; i++) {
|
||
let { from, to } = ranges[i];
|
||
while (i < l - 1 && to > ranges[i + 1].from - 2 * 250 /* RegExp.HighlightMargin */)
|
||
to = ranges[++i].to;
|
||
query.highlight(view.state, from, to, (from, to) => {
|
||
let selected = view.state.selection.ranges.some(r => r.from == from && r.to == to);
|
||
builder.add(from, to, selected ? selectedMatchMark : matchMark);
|
||
});
|
||
}
|
||
return builder.finish();
|
||
}
|
||
}, {
|
||
decorations: v => v.decorations
|
||
});
|
||
function searchCommand(f) {
|
||
return view => {
|
||
let state = view.state.field(searchState, false);
|
||
return state && state.query.spec.valid ? f(view, state) : openSearchPanel(view);
|
||
};
|
||
}
|
||
/**
|
||
Open the search panel if it isn't already open, and move the
|
||
selection to the first match after the current main selection.
|
||
Will wrap around to the start of the document when it reaches the
|
||
end.
|
||
*/
|
||
const findNext = /*@__PURE__*/searchCommand((view, { query }) => {
|
||
let { to } = view.state.selection.main;
|
||
let next = query.nextMatch(view.state, to, to);
|
||
if (!next)
|
||
return false;
|
||
let selection = state_.EditorSelection.single(next.from, next.to);
|
||
let config = view.state.facet(searchConfigFacet);
|
||
view.dispatch({
|
||
selection,
|
||
effects: [announceMatch(view, next), config.scrollToMatch(selection.main, view)],
|
||
userEvent: "select.search"
|
||
});
|
||
selectSearchInput(view);
|
||
return true;
|
||
});
|
||
/**
|
||
Move the selection to the previous instance of the search query,
|
||
before the current main selection. Will wrap past the start
|
||
of the document to start searching at the end again.
|
||
*/
|
||
const findPrevious = /*@__PURE__*/searchCommand((view, { query }) => {
|
||
let { state } = view, { from } = state.selection.main;
|
||
let prev = query.prevMatch(state, from, from);
|
||
if (!prev)
|
||
return false;
|
||
let selection = state_.EditorSelection.single(prev.from, prev.to);
|
||
let config = view.state.facet(searchConfigFacet);
|
||
view.dispatch({
|
||
selection,
|
||
effects: [announceMatch(view, prev), config.scrollToMatch(selection.main, view)],
|
||
userEvent: "select.search"
|
||
});
|
||
selectSearchInput(view);
|
||
return true;
|
||
});
|
||
/**
|
||
Select all instances of the search query.
|
||
*/
|
||
const selectMatches = /*@__PURE__*/searchCommand((view, { query }) => {
|
||
let ranges = query.matchAll(view.state, 1000);
|
||
if (!ranges || !ranges.length)
|
||
return false;
|
||
view.dispatch({
|
||
selection: state_.EditorSelection.create(ranges.map(r => state_.EditorSelection.range(r.from, r.to))),
|
||
userEvent: "select.search.matches"
|
||
});
|
||
return true;
|
||
});
|
||
/**
|
||
Select all instances of the currently selected text.
|
||
*/
|
||
const selectSelectionMatches = ({ state, dispatch }) => {
|
||
let sel = state.selection;
|
||
if (sel.ranges.length > 1 || sel.main.empty)
|
||
return false;
|
||
let { from, to } = sel.main;
|
||
let ranges = [], main = 0;
|
||
for (let cur = new SearchCursor(state.doc, state.sliceDoc(from, to)); !cur.next().done;) {
|
||
if (ranges.length > 1000)
|
||
return false;
|
||
if (cur.value.from == from)
|
||
main = ranges.length;
|
||
ranges.push(state_.EditorSelection.range(cur.value.from, cur.value.to));
|
||
}
|
||
dispatch(state.update({
|
||
selection: state_.EditorSelection.create(ranges, main),
|
||
userEvent: "select.search.matches"
|
||
}));
|
||
return true;
|
||
};
|
||
/**
|
||
Replace the current match of the search query.
|
||
*/
|
||
const replaceNext = /*@__PURE__*/searchCommand((view, { query }) => {
|
||
let { state } = view, { from, to } = state.selection.main;
|
||
if (state.readOnly)
|
||
return false;
|
||
let match = query.nextMatch(state, from, from);
|
||
if (!match)
|
||
return false;
|
||
let next = match;
|
||
let changes = [], selection, replacement;
|
||
let effects = [];
|
||
if (next.from == from && next.to == to) {
|
||
replacement = state.toText(query.getReplacement(next));
|
||
changes.push({ from: next.from, to: next.to, insert: replacement });
|
||
next = query.nextMatch(state, next.from, next.to);
|
||
effects.push(view_.EditorView.announce.of(state.phrase("replaced match on line $", state.doc.lineAt(from).number) + "."));
|
||
}
|
||
let changeSet = view.state.changes(changes);
|
||
if (next) {
|
||
selection = state_.EditorSelection.single(next.from, next.to).map(changeSet);
|
||
effects.push(announceMatch(view, next));
|
||
effects.push(state.facet(searchConfigFacet).scrollToMatch(selection.main, view));
|
||
}
|
||
view.dispatch({
|
||
changes: changeSet,
|
||
selection,
|
||
effects,
|
||
userEvent: "input.replace"
|
||
});
|
||
return true;
|
||
});
|
||
/**
|
||
Replace all instances of the search query with the given
|
||
replacement.
|
||
*/
|
||
const replaceAll = /*@__PURE__*/searchCommand((view, { query }) => {
|
||
if (view.state.readOnly)
|
||
return false;
|
||
let changes = query.matchAll(view.state, 1e9).map(match => {
|
||
let { from, to } = match;
|
||
return { from, to, insert: query.getReplacement(match) };
|
||
});
|
||
if (!changes.length)
|
||
return false;
|
||
let announceText = view.state.phrase("replaced $ matches", changes.length) + ".";
|
||
view.dispatch({
|
||
changes,
|
||
effects: view_.EditorView.announce.of(announceText),
|
||
userEvent: "input.replace.all"
|
||
});
|
||
return true;
|
||
});
|
||
function createSearchPanel(view) {
|
||
return view.state.facet(searchConfigFacet).createPanel(view);
|
||
}
|
||
function defaultQuery(state, fallback) {
|
||
var _a, _b, _c, _d, _e;
|
||
let sel = state.selection.main;
|
||
let selText = sel.empty || sel.to > sel.from + 100 ? "" : state.sliceDoc(sel.from, sel.to);
|
||
if (fallback && !selText)
|
||
return fallback;
|
||
let config = state.facet(searchConfigFacet);
|
||
return new SearchQuery({
|
||
search: ((_a = fallback === null || fallback === void 0 ? void 0 : fallback.literal) !== null && _a !== void 0 ? _a : config.literal) ? selText : selText.replace(/\n/g, "\\n"),
|
||
caseSensitive: (_b = fallback === null || fallback === void 0 ? void 0 : fallback.caseSensitive) !== null && _b !== void 0 ? _b : config.caseSensitive,
|
||
literal: (_c = fallback === null || fallback === void 0 ? void 0 : fallback.literal) !== null && _c !== void 0 ? _c : config.literal,
|
||
regexp: (_d = fallback === null || fallback === void 0 ? void 0 : fallback.regexp) !== null && _d !== void 0 ? _d : config.regexp,
|
||
wholeWord: (_e = fallback === null || fallback === void 0 ? void 0 : fallback.wholeWord) !== null && _e !== void 0 ? _e : config.wholeWord
|
||
});
|
||
}
|
||
function getSearchInput(view) {
|
||
let panel = (0,view_.getPanel)(view, createSearchPanel);
|
||
return panel && panel.dom.querySelector("[main-field]");
|
||
}
|
||
function selectSearchInput(view) {
|
||
let input = getSearchInput(view);
|
||
if (input && input == view.root.activeElement)
|
||
input.select();
|
||
}
|
||
/**
|
||
Make sure the search panel is open and focused.
|
||
*/
|
||
const openSearchPanel = view => {
|
||
let state = view.state.field(searchState, false);
|
||
if (state && state.panel) {
|
||
let searchInput = getSearchInput(view);
|
||
if (searchInput && searchInput != view.root.activeElement) {
|
||
let query = defaultQuery(view.state, state.query.spec);
|
||
if (query.valid)
|
||
view.dispatch({ effects: setSearchQuery.of(query) });
|
||
searchInput.focus();
|
||
searchInput.select();
|
||
}
|
||
}
|
||
else {
|
||
view.dispatch({ effects: [
|
||
togglePanel.of(true),
|
||
state ? setSearchQuery.of(defaultQuery(view.state, state.query.spec)) : state_.StateEffect.appendConfig.of(searchExtensions)
|
||
] });
|
||
}
|
||
return true;
|
||
};
|
||
/**
|
||
Close the search panel.
|
||
*/
|
||
const closeSearchPanel = view => {
|
||
let state = view.state.field(searchState, false);
|
||
if (!state || !state.panel)
|
||
return false;
|
||
let panel = (0,view_.getPanel)(view, createSearchPanel);
|
||
if (panel && panel.dom.contains(view.root.activeElement))
|
||
view.focus();
|
||
view.dispatch({ effects: togglePanel.of(false) });
|
||
return true;
|
||
};
|
||
/**
|
||
Default search-related key bindings.
|
||
|
||
- Mod-f: [`openSearchPanel`](https://codemirror.net/6/docs/ref/#search.openSearchPanel)
|
||
- F3, Mod-g: [`findNext`](https://codemirror.net/6/docs/ref/#search.findNext)
|
||
- Shift-F3, Shift-Mod-g: [`findPrevious`](https://codemirror.net/6/docs/ref/#search.findPrevious)
|
||
- Mod-Alt-g: [`gotoLine`](https://codemirror.net/6/docs/ref/#search.gotoLine)
|
||
- Mod-d: [`selectNextOccurrence`](https://codemirror.net/6/docs/ref/#search.selectNextOccurrence)
|
||
*/
|
||
const searchKeymap = [
|
||
{ key: "Mod-f", run: openSearchPanel, scope: "editor search-panel" },
|
||
{ key: "F3", run: findNext, shift: findPrevious, scope: "editor search-panel", preventDefault: true },
|
||
{ key: "Mod-g", run: findNext, shift: findPrevious, scope: "editor search-panel", preventDefault: true },
|
||
{ key: "Escape", run: closeSearchPanel, scope: "editor search-panel" },
|
||
{ key: "Mod-Shift-l", run: selectSelectionMatches },
|
||
{ key: "Mod-Alt-g", run: gotoLine },
|
||
{ key: "Mod-d", run: selectNextOccurrence, preventDefault: true },
|
||
];
|
||
class SearchPanel {
|
||
constructor(view) {
|
||
this.view = view;
|
||
let query = this.query = view.state.field(searchState).query.spec;
|
||
this.commit = this.commit.bind(this);
|
||
this.searchField = crelt("input", {
|
||
value: query.search,
|
||
placeholder: phrase(view, "Find"),
|
||
"aria-label": phrase(view, "Find"),
|
||
class: "cm-textfield",
|
||
name: "search",
|
||
form: "",
|
||
"main-field": "true",
|
||
onchange: this.commit,
|
||
onkeyup: this.commit
|
||
});
|
||
this.replaceField = crelt("input", {
|
||
value: query.replace,
|
||
placeholder: phrase(view, "Replace"),
|
||
"aria-label": phrase(view, "Replace"),
|
||
class: "cm-textfield",
|
||
name: "replace",
|
||
form: "",
|
||
onchange: this.commit,
|
||
onkeyup: this.commit
|
||
});
|
||
this.caseField = crelt("input", {
|
||
type: "checkbox",
|
||
name: "case",
|
||
form: "",
|
||
checked: query.caseSensitive,
|
||
onchange: this.commit
|
||
});
|
||
this.reField = crelt("input", {
|
||
type: "checkbox",
|
||
name: "re",
|
||
form: "",
|
||
checked: query.regexp,
|
||
onchange: this.commit
|
||
});
|
||
this.wordField = crelt("input", {
|
||
type: "checkbox",
|
||
name: "word",
|
||
form: "",
|
||
checked: query.wholeWord,
|
||
onchange: this.commit
|
||
});
|
||
function button(name, onclick, content) {
|
||
return crelt("button", { class: "cm-button", name, onclick, type: "button" }, content);
|
||
}
|
||
this.dom = crelt("div", { onkeydown: (e) => this.keydown(e), class: "cm-search" }, [
|
||
this.searchField,
|
||
button("next", () => findNext(view), [phrase(view, "next")]),
|
||
button("prev", () => findPrevious(view), [phrase(view, "previous")]),
|
||
button("select", () => selectMatches(view), [phrase(view, "all")]),
|
||
crelt("label", null, [this.caseField, phrase(view, "match case")]),
|
||
crelt("label", null, [this.reField, phrase(view, "regexp")]),
|
||
crelt("label", null, [this.wordField, phrase(view, "by word")]),
|
||
...view.state.readOnly ? [] : [
|
||
crelt("br"),
|
||
this.replaceField,
|
||
button("replace", () => replaceNext(view), [phrase(view, "replace")]),
|
||
button("replaceAll", () => replaceAll(view), [phrase(view, "replace all")])
|
||
],
|
||
crelt("button", {
|
||
name: "close",
|
||
onclick: () => closeSearchPanel(view),
|
||
"aria-label": phrase(view, "close"),
|
||
type: "button"
|
||
}, ["×"])
|
||
]);
|
||
}
|
||
commit() {
|
||
let query = new SearchQuery({
|
||
search: this.searchField.value,
|
||
caseSensitive: this.caseField.checked,
|
||
regexp: this.reField.checked,
|
||
wholeWord: this.wordField.checked,
|
||
replace: this.replaceField.value,
|
||
});
|
||
if (!query.eq(this.query)) {
|
||
this.query = query;
|
||
this.view.dispatch({ effects: setSearchQuery.of(query) });
|
||
}
|
||
}
|
||
keydown(e) {
|
||
if ((0,view_.runScopeHandlers)(this.view, e, "search-panel")) {
|
||
e.preventDefault();
|
||
}
|
||
else if (e.keyCode == 13 && e.target == this.searchField) {
|
||
e.preventDefault();
|
||
(e.shiftKey ? findPrevious : findNext)(this.view);
|
||
}
|
||
else if (e.keyCode == 13 && e.target == this.replaceField) {
|
||
e.preventDefault();
|
||
replaceNext(this.view);
|
||
}
|
||
}
|
||
update(update) {
|
||
for (let tr of update.transactions)
|
||
for (let effect of tr.effects) {
|
||
if (effect.is(setSearchQuery) && !effect.value.eq(this.query))
|
||
this.setQuery(effect.value);
|
||
}
|
||
}
|
||
setQuery(query) {
|
||
this.query = query;
|
||
this.searchField.value = query.search;
|
||
this.replaceField.value = query.replace;
|
||
this.caseField.checked = query.caseSensitive;
|
||
this.reField.checked = query.regexp;
|
||
this.wordField.checked = query.wholeWord;
|
||
}
|
||
mount() {
|
||
this.searchField.select();
|
||
}
|
||
get pos() { return 80; }
|
||
get top() { return this.view.state.facet(searchConfigFacet).top; }
|
||
}
|
||
function phrase(view, phrase) { return view.state.phrase(phrase); }
|
||
const AnnounceMargin = 30;
|
||
const Break = /[\s\.,:;?!]/;
|
||
function announceMatch(view, { from, to }) {
|
||
let line = view.state.doc.lineAt(from), lineEnd = view.state.doc.lineAt(to).to;
|
||
let start = Math.max(line.from, from - AnnounceMargin), end = Math.min(lineEnd, to + AnnounceMargin);
|
||
let text = view.state.sliceDoc(start, end);
|
||
if (start != line.from) {
|
||
for (let i = 0; i < AnnounceMargin; i++)
|
||
if (!Break.test(text[i + 1]) && Break.test(text[i])) {
|
||
text = text.slice(i);
|
||
break;
|
||
}
|
||
}
|
||
if (end != lineEnd) {
|
||
for (let i = text.length - 1; i > text.length - AnnounceMargin; i--)
|
||
if (!Break.test(text[i - 1]) && Break.test(text[i])) {
|
||
text = text.slice(0, i);
|
||
break;
|
||
}
|
||
}
|
||
return view_.EditorView.announce.of(`${view.state.phrase("current match")}. ${text} ${view.state.phrase("on line")} ${line.number}.`);
|
||
}
|
||
const baseTheme = /*@__PURE__*/view_.EditorView.baseTheme({
|
||
".cm-panel.cm-search": {
|
||
padding: "2px 6px 4px",
|
||
position: "relative",
|
||
"& [name=close]": {
|
||
position: "absolute",
|
||
top: "0",
|
||
right: "4px",
|
||
backgroundColor: "inherit",
|
||
border: "none",
|
||
font: "inherit",
|
||
padding: 0,
|
||
margin: 0
|
||
},
|
||
"& input, & button, & label": {
|
||
margin: ".2em .6em .2em 0"
|
||
},
|
||
"& input[type=checkbox]": {
|
||
marginRight: ".2em"
|
||
},
|
||
"& label": {
|
||
fontSize: "80%",
|
||
whiteSpace: "pre"
|
||
}
|
||
},
|
||
"&light .cm-searchMatch": { backgroundColor: "#ffff0054" },
|
||
"&dark .cm-searchMatch": { backgroundColor: "#00ffff8a" },
|
||
"&light .cm-searchMatch-selected": { backgroundColor: "#ff6a0054" },
|
||
"&dark .cm-searchMatch-selected": { backgroundColor: "#ff00ff8a" }
|
||
});
|
||
const searchExtensions = [
|
||
searchState,
|
||
/*@__PURE__*/state_.Prec.low(searchHighlighter),
|
||
baseTheme
|
||
];
|
||
|
||
|
||
|
||
// EXTERNAL MODULE: ../node_modules/@codemirror/language/dist/index.js + 2 modules
|
||
var language_dist = __webpack_require__(194);
|
||
;// ../node_modules/@codemirror/autocomplete/dist/index.js
|
||
|
||
|
||
|
||
|
||
/**
|
||
An instance of this is passed to completion source functions.
|
||
*/
|
||
class CompletionContext {
|
||
/**
|
||
Create a new completion context. (Mostly useful for testing
|
||
completion sources—in the editor, the extension will create
|
||
these for you.)
|
||
*/
|
||
constructor(
|
||
/**
|
||
The editor state that the completion happens in.
|
||
*/
|
||
state,
|
||
/**
|
||
The position at which the completion is happening.
|
||
*/
|
||
pos,
|
||
/**
|
||
Indicates whether completion was activated explicitly, or
|
||
implicitly by typing. The usual way to respond to this is to
|
||
only return completions when either there is part of a
|
||
completable entity before the cursor, or `explicit` is true.
|
||
*/
|
||
explicit,
|
||
/**
|
||
The editor view. May be undefined if the context was created
|
||
in a situation where there is no such view available, such as
|
||
in synchronous updates via
|
||
[`CompletionResult.update`](https://codemirror.net/6/docs/ref/#autocomplete.CompletionResult.update)
|
||
or when called by test code.
|
||
*/
|
||
view) {
|
||
this.state = state;
|
||
this.pos = pos;
|
||
this.explicit = explicit;
|
||
this.view = view;
|
||
/**
|
||
@internal
|
||
*/
|
||
this.abortListeners = [];
|
||
/**
|
||
@internal
|
||
*/
|
||
this.abortOnDocChange = false;
|
||
}
|
||
/**
|
||
Get the extent, content, and (if there is a token) type of the
|
||
token before `this.pos`.
|
||
*/
|
||
tokenBefore(types) {
|
||
let token = (0,language_dist/* syntaxTree */.mv)(this.state).resolveInner(this.pos, -1);
|
||
while (token && types.indexOf(token.name) < 0)
|
||
token = token.parent;
|
||
return token ? { from: token.from, to: this.pos,
|
||
text: this.state.sliceDoc(token.from, this.pos),
|
||
type: token.type } : null;
|
||
}
|
||
/**
|
||
Get the match of the given expression directly before the
|
||
cursor.
|
||
*/
|
||
matchBefore(expr) {
|
||
let line = this.state.doc.lineAt(this.pos);
|
||
let start = Math.max(line.from, this.pos - 250);
|
||
let str = line.text.slice(start - line.from, this.pos - line.from);
|
||
let found = str.search(ensureAnchor(expr, false));
|
||
return found < 0 ? null : { from: start + found, to: this.pos, text: str.slice(found) };
|
||
}
|
||
/**
|
||
Yields true when the query has been aborted. Can be useful in
|
||
asynchronous queries to avoid doing work that will be ignored.
|
||
*/
|
||
get aborted() { return this.abortListeners == null; }
|
||
/**
|
||
Allows you to register abort handlers, which will be called when
|
||
the query is
|
||
[aborted](https://codemirror.net/6/docs/ref/#autocomplete.CompletionContext.aborted).
|
||
|
||
By default, running queries will not be aborted for regular
|
||
typing or backspacing, on the assumption that they are likely to
|
||
return a result with a
|
||
[`validFor`](https://codemirror.net/6/docs/ref/#autocomplete.CompletionResult.validFor) field that
|
||
allows the result to be used after all. Passing `onDocChange:
|
||
true` will cause this query to be aborted for any document
|
||
change.
|
||
*/
|
||
addEventListener(type, listener, options) {
|
||
if (type == "abort" && this.abortListeners) {
|
||
this.abortListeners.push(listener);
|
||
if (options && options.onDocChange)
|
||
this.abortOnDocChange = true;
|
||
}
|
||
}
|
||
}
|
||
function toSet(chars) {
|
||
let flat = Object.keys(chars).join("");
|
||
let words = /\w/.test(flat);
|
||
if (words)
|
||
flat = flat.replace(/\w/g, "");
|
||
return `[${words ? "\\w" : ""}${flat.replace(/[^\w\s]/g, "\\$&")}]`;
|
||
}
|
||
function prefixMatch(options) {
|
||
let first = Object.create(null), rest = Object.create(null);
|
||
for (let { label } of options) {
|
||
first[label[0]] = true;
|
||
for (let i = 1; i < label.length; i++)
|
||
rest[label[i]] = true;
|
||
}
|
||
let source = toSet(first) + toSet(rest) + "*$";
|
||
return [new RegExp("^" + source), new RegExp(source)];
|
||
}
|
||
/**
|
||
Given a a fixed array of options, return an autocompleter that
|
||
completes them.
|
||
*/
|
||
function completeFromList(list) {
|
||
let options = list.map(o => typeof o == "string" ? { label: o } : o);
|
||
let [validFor, match] = options.every(o => /^\w+$/.test(o.label)) ? [/\w*$/, /\w+$/] : prefixMatch(options);
|
||
return (context) => {
|
||
let token = context.matchBefore(match);
|
||
return token || context.explicit ? { from: token ? token.from : context.pos, options, validFor } : null;
|
||
};
|
||
}
|
||
/**
|
||
Wrap the given completion source so that it will only fire when the
|
||
cursor is in a syntax node with one of the given names.
|
||
*/
|
||
function ifIn(nodes, source) {
|
||
return (context) => {
|
||
for (let pos = syntaxTree(context.state).resolveInner(context.pos, -1); pos; pos = pos.parent) {
|
||
if (nodes.indexOf(pos.name) > -1)
|
||
return source(context);
|
||
if (pos.type.isTop)
|
||
break;
|
||
}
|
||
return null;
|
||
};
|
||
}
|
||
/**
|
||
Wrap the given completion source so that it will not fire when the
|
||
cursor is in a syntax node with one of the given names.
|
||
*/
|
||
function ifNotIn(nodes, source) {
|
||
return (context) => {
|
||
for (let pos = syntaxTree(context.state).resolveInner(context.pos, -1); pos; pos = pos.parent) {
|
||
if (nodes.indexOf(pos.name) > -1)
|
||
return null;
|
||
if (pos.type.isTop)
|
||
break;
|
||
}
|
||
return source(context);
|
||
};
|
||
}
|
||
class Option {
|
||
constructor(completion, source, match, score) {
|
||
this.completion = completion;
|
||
this.source = source;
|
||
this.match = match;
|
||
this.score = score;
|
||
}
|
||
}
|
||
function cur(state) { return state.selection.main.from; }
|
||
// Make sure the given regexp has a $ at its end and, if `start` is
|
||
// true, a ^ at its start.
|
||
function ensureAnchor(expr, start) {
|
||
var _a;
|
||
let { source } = expr;
|
||
let addStart = start && source[0] != "^", addEnd = source[source.length - 1] != "$";
|
||
if (!addStart && !addEnd)
|
||
return expr;
|
||
return new RegExp(`${addStart ? "^" : ""}(?:${source})${addEnd ? "$" : ""}`, (_a = expr.flags) !== null && _a !== void 0 ? _a : (expr.ignoreCase ? "i" : ""));
|
||
}
|
||
/**
|
||
This annotation is added to transactions that are produced by
|
||
picking a completion.
|
||
*/
|
||
const pickedCompletion = /*@__PURE__*/state_.Annotation.define();
|
||
/**
|
||
Helper function that returns a transaction spec which inserts a
|
||
completion's text in the main selection range, and any other
|
||
selection range that has the same text in front of it.
|
||
*/
|
||
function insertCompletionText(state, text, from, to) {
|
||
let { main } = state.selection, fromOff = from - main.from, toOff = to - main.from;
|
||
return {
|
||
...state.changeByRange(range => {
|
||
if (range != main && from != to &&
|
||
state.sliceDoc(range.from + fromOff, range.from + toOff) != state.sliceDoc(from, to))
|
||
return { range };
|
||
let lines = state.toText(text);
|
||
return {
|
||
changes: { from: range.from + fromOff, to: to == main.from ? range.to : range.from + toOff, insert: lines },
|
||
range: state_.EditorSelection.cursor(range.from + fromOff + lines.length)
|
||
};
|
||
}),
|
||
scrollIntoView: true,
|
||
userEvent: "input.complete"
|
||
};
|
||
}
|
||
const SourceCache = /*@__PURE__*/new WeakMap();
|
||
function asSource(source) {
|
||
if (!Array.isArray(source))
|
||
return source;
|
||
let known = SourceCache.get(source);
|
||
if (!known)
|
||
SourceCache.set(source, known = completeFromList(source));
|
||
return known;
|
||
}
|
||
const startCompletionEffect = /*@__PURE__*/state_.StateEffect.define();
|
||
const closeCompletionEffect = /*@__PURE__*/state_.StateEffect.define();
|
||
|
||
// A pattern matcher for fuzzy completion matching. Create an instance
|
||
// once for a pattern, and then use that to match any number of
|
||
// completions.
|
||
class FuzzyMatcher {
|
||
constructor(pattern) {
|
||
this.pattern = pattern;
|
||
this.chars = [];
|
||
this.folded = [];
|
||
// Buffers reused by calls to `match` to track matched character
|
||
// positions.
|
||
this.any = [];
|
||
this.precise = [];
|
||
this.byWord = [];
|
||
this.score = 0;
|
||
this.matched = [];
|
||
for (let p = 0; p < pattern.length;) {
|
||
let char = (0,state_.codePointAt)(pattern, p), size = (0,state_.codePointSize)(char);
|
||
this.chars.push(char);
|
||
let part = pattern.slice(p, p + size), upper = part.toUpperCase();
|
||
this.folded.push((0,state_.codePointAt)(upper == part ? part.toLowerCase() : upper, 0));
|
||
p += size;
|
||
}
|
||
this.astral = pattern.length != this.chars.length;
|
||
}
|
||
ret(score, matched) {
|
||
this.score = score;
|
||
this.matched = matched;
|
||
return this;
|
||
}
|
||
// Matches a given word (completion) against the pattern (input).
|
||
// Will return a boolean indicating whether there was a match and,
|
||
// on success, set `this.score` to the score, `this.matched` to an
|
||
// array of `from, to` pairs indicating the matched parts of `word`.
|
||
//
|
||
// The score is a number that is more negative the worse the match
|
||
// is. See `Penalty` above.
|
||
match(word) {
|
||
if (this.pattern.length == 0)
|
||
return this.ret(-100 /* Penalty.NotFull */, []);
|
||
if (word.length < this.pattern.length)
|
||
return null;
|
||
let { chars, folded, any, precise, byWord } = this;
|
||
// For single-character queries, only match when they occur right
|
||
// at the start
|
||
if (chars.length == 1) {
|
||
let first = (0,state_.codePointAt)(word, 0), firstSize = (0,state_.codePointSize)(first);
|
||
let score = firstSize == word.length ? 0 : -100 /* Penalty.NotFull */;
|
||
if (first == chars[0]) ;
|
||
else if (first == folded[0])
|
||
score += -200 /* Penalty.CaseFold */;
|
||
else
|
||
return null;
|
||
return this.ret(score, [0, firstSize]);
|
||
}
|
||
let direct = word.indexOf(this.pattern);
|
||
if (direct == 0)
|
||
return this.ret(word.length == this.pattern.length ? 0 : -100 /* Penalty.NotFull */, [0, this.pattern.length]);
|
||
let len = chars.length, anyTo = 0;
|
||
if (direct < 0) {
|
||
for (let i = 0, e = Math.min(word.length, 200); i < e && anyTo < len;) {
|
||
let next = (0,state_.codePointAt)(word, i);
|
||
if (next == chars[anyTo] || next == folded[anyTo])
|
||
any[anyTo++] = i;
|
||
i += (0,state_.codePointSize)(next);
|
||
}
|
||
// No match, exit immediately
|
||
if (anyTo < len)
|
||
return null;
|
||
}
|
||
// This tracks the extent of the precise (non-folded, not
|
||
// necessarily adjacent) match
|
||
let preciseTo = 0;
|
||
// Tracks whether there is a match that hits only characters that
|
||
// appear to be starting words. `byWordFolded` is set to true when
|
||
// a case folded character is encountered in such a match
|
||
let byWordTo = 0, byWordFolded = false;
|
||
// If we've found a partial adjacent match, these track its state
|
||
let adjacentTo = 0, adjacentStart = -1, adjacentEnd = -1;
|
||
let hasLower = /[a-z]/.test(word), wordAdjacent = true;
|
||
// Go over the option's text, scanning for the various kinds of matches
|
||
for (let i = 0, e = Math.min(word.length, 200), prevType = 0 /* Tp.NonWord */; i < e && byWordTo < len;) {
|
||
let next = (0,state_.codePointAt)(word, i);
|
||
if (direct < 0) {
|
||
if (preciseTo < len && next == chars[preciseTo])
|
||
precise[preciseTo++] = i;
|
||
if (adjacentTo < len) {
|
||
if (next == chars[adjacentTo] || next == folded[adjacentTo]) {
|
||
if (adjacentTo == 0)
|
||
adjacentStart = i;
|
||
adjacentEnd = i + 1;
|
||
adjacentTo++;
|
||
}
|
||
else {
|
||
adjacentTo = 0;
|
||
}
|
||
}
|
||
}
|
||
let ch, type = next < 0xff
|
||
? (next >= 48 && next <= 57 || next >= 97 && next <= 122 ? 2 /* Tp.Lower */ : next >= 65 && next <= 90 ? 1 /* Tp.Upper */ : 0 /* Tp.NonWord */)
|
||
: ((ch = (0,state_.fromCodePoint)(next)) != ch.toLowerCase() ? 1 /* Tp.Upper */ : ch != ch.toUpperCase() ? 2 /* Tp.Lower */ : 0 /* Tp.NonWord */);
|
||
if (!i || type == 1 /* Tp.Upper */ && hasLower || prevType == 0 /* Tp.NonWord */ && type != 0 /* Tp.NonWord */) {
|
||
if (chars[byWordTo] == next || (folded[byWordTo] == next && (byWordFolded = true)))
|
||
byWord[byWordTo++] = i;
|
||
else if (byWord.length)
|
||
wordAdjacent = false;
|
||
}
|
||
prevType = type;
|
||
i += (0,state_.codePointSize)(next);
|
||
}
|
||
if (byWordTo == len && byWord[0] == 0 && wordAdjacent)
|
||
return this.result(-100 /* Penalty.ByWord */ + (byWordFolded ? -200 /* Penalty.CaseFold */ : 0), byWord, word);
|
||
if (adjacentTo == len && adjacentStart == 0)
|
||
return this.ret(-200 /* Penalty.CaseFold */ - word.length + (adjacentEnd == word.length ? 0 : -100 /* Penalty.NotFull */), [0, adjacentEnd]);
|
||
if (direct > -1)
|
||
return this.ret(-700 /* Penalty.NotStart */ - word.length, [direct, direct + this.pattern.length]);
|
||
if (adjacentTo == len)
|
||
return this.ret(-200 /* Penalty.CaseFold */ + -700 /* Penalty.NotStart */ - word.length, [adjacentStart, adjacentEnd]);
|
||
if (byWordTo == len)
|
||
return this.result(-100 /* Penalty.ByWord */ + (byWordFolded ? -200 /* Penalty.CaseFold */ : 0) + -700 /* Penalty.NotStart */ +
|
||
(wordAdjacent ? 0 : -1100 /* Penalty.Gap */), byWord, word);
|
||
return chars.length == 2 ? null
|
||
: this.result((any[0] ? -700 /* Penalty.NotStart */ : 0) + -200 /* Penalty.CaseFold */ + -1100 /* Penalty.Gap */, any, word);
|
||
}
|
||
result(score, positions, word) {
|
||
let result = [], i = 0;
|
||
for (let pos of positions) {
|
||
let to = pos + (this.astral ? (0,state_.codePointSize)((0,state_.codePointAt)(word, pos)) : 1);
|
||
if (i && result[i - 1] == pos)
|
||
result[i - 1] = to;
|
||
else {
|
||
result[i++] = pos;
|
||
result[i++] = to;
|
||
}
|
||
}
|
||
return this.ret(score - word.length, result);
|
||
}
|
||
}
|
||
class StrictMatcher {
|
||
constructor(pattern) {
|
||
this.pattern = pattern;
|
||
this.matched = [];
|
||
this.score = 0;
|
||
this.folded = pattern.toLowerCase();
|
||
}
|
||
match(word) {
|
||
if (word.length < this.pattern.length)
|
||
return null;
|
||
let start = word.slice(0, this.pattern.length);
|
||
let match = start == this.pattern ? 0 : start.toLowerCase() == this.folded ? -200 /* Penalty.CaseFold */ : null;
|
||
if (match == null)
|
||
return null;
|
||
this.matched = [0, start.length];
|
||
this.score = match + (word.length == this.pattern.length ? 0 : -100 /* Penalty.NotFull */);
|
||
return this;
|
||
}
|
||
}
|
||
|
||
const completionConfig = /*@__PURE__*/state_.Facet.define({
|
||
combine(configs) {
|
||
return (0,state_.combineConfig)(configs, {
|
||
activateOnTyping: true,
|
||
activateOnCompletion: () => false,
|
||
activateOnTypingDelay: 100,
|
||
selectOnOpen: true,
|
||
override: null,
|
||
closeOnBlur: true,
|
||
maxRenderedOptions: 100,
|
||
defaultKeymap: true,
|
||
tooltipClass: () => "",
|
||
optionClass: () => "",
|
||
aboveCursor: false,
|
||
icons: true,
|
||
addToOptions: [],
|
||
positionInfo: defaultPositionInfo,
|
||
filterStrict: false,
|
||
compareCompletions: (a, b) => (a.sortText || a.label).localeCompare(b.sortText || b.label),
|
||
interactionDelay: 75,
|
||
updateSyncTime: 100
|
||
}, {
|
||
defaultKeymap: (a, b) => a && b,
|
||
closeOnBlur: (a, b) => a && b,
|
||
icons: (a, b) => a && b,
|
||
tooltipClass: (a, b) => c => joinClass(a(c), b(c)),
|
||
optionClass: (a, b) => c => joinClass(a(c), b(c)),
|
||
addToOptions: (a, b) => a.concat(b),
|
||
filterStrict: (a, b) => a || b,
|
||
});
|
||
}
|
||
});
|
||
function joinClass(a, b) {
|
||
return a ? b ? a + " " + b : a : b;
|
||
}
|
||
function defaultPositionInfo(view, list, option, info, space, tooltip) {
|
||
let rtl = view.textDirection == view_.Direction.RTL, left = rtl, narrow = false;
|
||
let side = "top", offset, maxWidth;
|
||
let spaceLeft = list.left - space.left, spaceRight = space.right - list.right;
|
||
let infoWidth = info.right - info.left, infoHeight = info.bottom - info.top;
|
||
if (left && spaceLeft < Math.min(infoWidth, spaceRight))
|
||
left = false;
|
||
else if (!left && spaceRight < Math.min(infoWidth, spaceLeft))
|
||
left = true;
|
||
if (infoWidth <= (left ? spaceLeft : spaceRight)) {
|
||
offset = Math.max(space.top, Math.min(option.top, space.bottom - infoHeight)) - list.top;
|
||
maxWidth = Math.min(400 /* Info.Width */, left ? spaceLeft : spaceRight);
|
||
}
|
||
else {
|
||
narrow = true;
|
||
maxWidth = Math.min(400 /* Info.Width */, (rtl ? list.right : space.right - list.left) - 30 /* Info.Margin */);
|
||
let spaceBelow = space.bottom - list.bottom;
|
||
if (spaceBelow >= infoHeight || spaceBelow > list.top) { // Below the completion
|
||
offset = option.bottom - list.top;
|
||
}
|
||
else { // Above it
|
||
side = "bottom";
|
||
offset = list.bottom - option.top;
|
||
}
|
||
}
|
||
let scaleY = (list.bottom - list.top) / tooltip.offsetHeight;
|
||
let scaleX = (list.right - list.left) / tooltip.offsetWidth;
|
||
return {
|
||
style: `${side}: ${offset / scaleY}px; max-width: ${maxWidth / scaleX}px`,
|
||
class: "cm-completionInfo-" + (narrow ? (rtl ? "left-narrow" : "right-narrow") : left ? "left" : "right")
|
||
};
|
||
}
|
||
|
||
function optionContent(config) {
|
||
let content = config.addToOptions.slice();
|
||
if (config.icons)
|
||
content.push({
|
||
render(completion) {
|
||
let icon = document.createElement("div");
|
||
icon.classList.add("cm-completionIcon");
|
||
if (completion.type)
|
||
icon.classList.add(...completion.type.split(/\s+/g).map(cls => "cm-completionIcon-" + cls));
|
||
icon.setAttribute("aria-hidden", "true");
|
||
return icon;
|
||
},
|
||
position: 20
|
||
});
|
||
content.push({
|
||
render(completion, _s, _v, match) {
|
||
let labelElt = document.createElement("span");
|
||
labelElt.className = "cm-completionLabel";
|
||
let label = completion.displayLabel || completion.label, off = 0;
|
||
for (let j = 0; j < match.length;) {
|
||
let from = match[j++], to = match[j++];
|
||
if (from > off)
|
||
labelElt.appendChild(document.createTextNode(label.slice(off, from)));
|
||
let span = labelElt.appendChild(document.createElement("span"));
|
||
span.appendChild(document.createTextNode(label.slice(from, to)));
|
||
span.className = "cm-completionMatchedText";
|
||
off = to;
|
||
}
|
||
if (off < label.length)
|
||
labelElt.appendChild(document.createTextNode(label.slice(off)));
|
||
return labelElt;
|
||
},
|
||
position: 50
|
||
}, {
|
||
render(completion) {
|
||
if (!completion.detail)
|
||
return null;
|
||
let detailElt = document.createElement("span");
|
||
detailElt.className = "cm-completionDetail";
|
||
detailElt.textContent = completion.detail;
|
||
return detailElt;
|
||
},
|
||
position: 80
|
||
});
|
||
return content.sort((a, b) => a.position - b.position).map(a => a.render);
|
||
}
|
||
function rangeAroundSelected(total, selected, max) {
|
||
if (total <= max)
|
||
return { from: 0, to: total };
|
||
if (selected < 0)
|
||
selected = 0;
|
||
if (selected <= (total >> 1)) {
|
||
let off = Math.floor(selected / max);
|
||
return { from: off * max, to: (off + 1) * max };
|
||
}
|
||
let off = Math.floor((total - selected) / max);
|
||
return { from: total - (off + 1) * max, to: total - off * max };
|
||
}
|
||
class CompletionTooltip {
|
||
constructor(view, stateField, applyCompletion) {
|
||
this.view = view;
|
||
this.stateField = stateField;
|
||
this.applyCompletion = applyCompletion;
|
||
this.info = null;
|
||
this.infoDestroy = null;
|
||
this.placeInfoReq = {
|
||
read: () => this.measureInfo(),
|
||
write: (pos) => this.placeInfo(pos),
|
||
key: this
|
||
};
|
||
this.space = null;
|
||
this.currentClass = "";
|
||
let cState = view.state.field(stateField);
|
||
let { options, selected } = cState.open;
|
||
let config = view.state.facet(completionConfig);
|
||
this.optionContent = optionContent(config);
|
||
this.optionClass = config.optionClass;
|
||
this.tooltipClass = config.tooltipClass;
|
||
this.range = rangeAroundSelected(options.length, selected, config.maxRenderedOptions);
|
||
this.dom = document.createElement("div");
|
||
this.dom.className = "cm-tooltip-autocomplete";
|
||
this.updateTooltipClass(view.state);
|
||
this.dom.addEventListener("mousedown", (e) => {
|
||
let { options } = view.state.field(stateField).open;
|
||
for (let dom = e.target, match; dom && dom != this.dom; dom = dom.parentNode) {
|
||
if (dom.nodeName == "LI" && (match = /-(\d+)$/.exec(dom.id)) && +match[1] < options.length) {
|
||
this.applyCompletion(view, options[+match[1]]);
|
||
e.preventDefault();
|
||
return;
|
||
}
|
||
}
|
||
});
|
||
this.dom.addEventListener("focusout", (e) => {
|
||
let state = view.state.field(this.stateField, false);
|
||
if (state && state.tooltip && view.state.facet(completionConfig).closeOnBlur &&
|
||
e.relatedTarget != view.contentDOM)
|
||
view.dispatch({ effects: closeCompletionEffect.of(null) });
|
||
});
|
||
this.showOptions(options, cState.id);
|
||
}
|
||
mount() { this.updateSel(); }
|
||
showOptions(options, id) {
|
||
if (this.list)
|
||
this.list.remove();
|
||
this.list = this.dom.appendChild(this.createListBox(options, id, this.range));
|
||
this.list.addEventListener("scroll", () => {
|
||
if (this.info)
|
||
this.view.requestMeasure(this.placeInfoReq);
|
||
});
|
||
}
|
||
update(update) {
|
||
var _a;
|
||
let cState = update.state.field(this.stateField);
|
||
let prevState = update.startState.field(this.stateField);
|
||
this.updateTooltipClass(update.state);
|
||
if (cState != prevState) {
|
||
let { options, selected, disabled } = cState.open;
|
||
if (!prevState.open || prevState.open.options != options) {
|
||
this.range = rangeAroundSelected(options.length, selected, update.state.facet(completionConfig).maxRenderedOptions);
|
||
this.showOptions(options, cState.id);
|
||
}
|
||
this.updateSel();
|
||
if (disabled != ((_a = prevState.open) === null || _a === void 0 ? void 0 : _a.disabled))
|
||
this.dom.classList.toggle("cm-tooltip-autocomplete-disabled", !!disabled);
|
||
}
|
||
}
|
||
updateTooltipClass(state) {
|
||
let cls = this.tooltipClass(state);
|
||
if (cls != this.currentClass) {
|
||
for (let c of this.currentClass.split(" "))
|
||
if (c)
|
||
this.dom.classList.remove(c);
|
||
for (let c of cls.split(" "))
|
||
if (c)
|
||
this.dom.classList.add(c);
|
||
this.currentClass = cls;
|
||
}
|
||
}
|
||
positioned(space) {
|
||
this.space = space;
|
||
if (this.info)
|
||
this.view.requestMeasure(this.placeInfoReq);
|
||
}
|
||
updateSel() {
|
||
let cState = this.view.state.field(this.stateField), open = cState.open;
|
||
if (open.selected > -1 && open.selected < this.range.from || open.selected >= this.range.to) {
|
||
this.range = rangeAroundSelected(open.options.length, open.selected, this.view.state.facet(completionConfig).maxRenderedOptions);
|
||
this.showOptions(open.options, cState.id);
|
||
}
|
||
let newSel = this.updateSelectedOption(open.selected);
|
||
if (newSel) {
|
||
this.destroyInfo();
|
||
let { completion } = open.options[open.selected];
|
||
let { info } = completion;
|
||
if (!info)
|
||
return;
|
||
let infoResult = typeof info === "string" ? document.createTextNode(info) : info(completion);
|
||
if (!infoResult)
|
||
return;
|
||
if ("then" in infoResult) {
|
||
infoResult.then(obj => {
|
||
if (obj && this.view.state.field(this.stateField, false) == cState)
|
||
this.addInfoPane(obj, completion);
|
||
}).catch(e => (0,view_.logException)(this.view.state, e, "completion info"));
|
||
}
|
||
else {
|
||
this.addInfoPane(infoResult, completion);
|
||
newSel.setAttribute("aria-describedby", this.info.id);
|
||
}
|
||
}
|
||
}
|
||
addInfoPane(content, completion) {
|
||
this.destroyInfo();
|
||
let wrap = this.info = document.createElement("div");
|
||
wrap.className = "cm-tooltip cm-completionInfo";
|
||
wrap.id = "cm-completionInfo-" + Math.floor(Math.random() * 0xffff).toString(16);
|
||
if (content.nodeType != null) {
|
||
wrap.appendChild(content);
|
||
this.infoDestroy = null;
|
||
}
|
||
else {
|
||
let { dom, destroy } = content;
|
||
wrap.appendChild(dom);
|
||
this.infoDestroy = destroy || null;
|
||
}
|
||
this.dom.appendChild(wrap);
|
||
this.view.requestMeasure(this.placeInfoReq);
|
||
}
|
||
updateSelectedOption(selected) {
|
||
let set = null;
|
||
for (let opt = this.list.firstChild, i = this.range.from; opt; opt = opt.nextSibling, i++) {
|
||
if (opt.nodeName != "LI" || !opt.id) {
|
||
i--; // A section header
|
||
}
|
||
else if (i == selected) {
|
||
if (!opt.hasAttribute("aria-selected")) {
|
||
opt.setAttribute("aria-selected", "true");
|
||
set = opt;
|
||
}
|
||
}
|
||
else {
|
||
if (opt.hasAttribute("aria-selected")) {
|
||
opt.removeAttribute("aria-selected");
|
||
opt.removeAttribute("aria-describedby");
|
||
}
|
||
}
|
||
}
|
||
if (set)
|
||
scrollIntoView(this.list, set);
|
||
return set;
|
||
}
|
||
measureInfo() {
|
||
let sel = this.dom.querySelector("[aria-selected]");
|
||
if (!sel || !this.info)
|
||
return null;
|
||
let listRect = this.dom.getBoundingClientRect();
|
||
let infoRect = this.info.getBoundingClientRect();
|
||
let selRect = sel.getBoundingClientRect();
|
||
let space = this.space;
|
||
if (!space) {
|
||
let docElt = this.dom.ownerDocument.documentElement;
|
||
space = { left: 0, top: 0, right: docElt.clientWidth, bottom: docElt.clientHeight };
|
||
}
|
||
if (selRect.top > Math.min(space.bottom, listRect.bottom) - 10 ||
|
||
selRect.bottom < Math.max(space.top, listRect.top) + 10)
|
||
return null;
|
||
return this.view.state.facet(completionConfig).positionInfo(this.view, listRect, selRect, infoRect, space, this.dom);
|
||
}
|
||
placeInfo(pos) {
|
||
if (this.info) {
|
||
if (pos) {
|
||
if (pos.style)
|
||
this.info.style.cssText = pos.style;
|
||
this.info.className = "cm-tooltip cm-completionInfo " + (pos.class || "");
|
||
}
|
||
else {
|
||
this.info.style.cssText = "top: -1e6px";
|
||
}
|
||
}
|
||
}
|
||
createListBox(options, id, range) {
|
||
const ul = document.createElement("ul");
|
||
ul.id = id;
|
||
ul.setAttribute("role", "listbox");
|
||
ul.setAttribute("aria-expanded", "true");
|
||
ul.setAttribute("aria-label", this.view.state.phrase("Completions"));
|
||
ul.addEventListener("mousedown", e => {
|
||
// Prevent focus change when clicking the scrollbar
|
||
if (e.target == ul)
|
||
e.preventDefault();
|
||
});
|
||
let curSection = null;
|
||
for (let i = range.from; i < range.to; i++) {
|
||
let { completion, match } = options[i], { section } = completion;
|
||
if (section) {
|
||
let name = typeof section == "string" ? section : section.name;
|
||
if (name != curSection && (i > range.from || range.from == 0)) {
|
||
curSection = name;
|
||
if (typeof section != "string" && section.header) {
|
||
ul.appendChild(section.header(section));
|
||
}
|
||
else {
|
||
let header = ul.appendChild(document.createElement("completion-section"));
|
||
header.textContent = name;
|
||
}
|
||
}
|
||
}
|
||
const li = ul.appendChild(document.createElement("li"));
|
||
li.id = id + "-" + i;
|
||
li.setAttribute("role", "option");
|
||
let cls = this.optionClass(completion);
|
||
if (cls)
|
||
li.className = cls;
|
||
for (let source of this.optionContent) {
|
||
let node = source(completion, this.view.state, this.view, match);
|
||
if (node)
|
||
li.appendChild(node);
|
||
}
|
||
}
|
||
if (range.from)
|
||
ul.classList.add("cm-completionListIncompleteTop");
|
||
if (range.to < options.length)
|
||
ul.classList.add("cm-completionListIncompleteBottom");
|
||
return ul;
|
||
}
|
||
destroyInfo() {
|
||
if (this.info) {
|
||
if (this.infoDestroy)
|
||
this.infoDestroy();
|
||
this.info.remove();
|
||
this.info = null;
|
||
}
|
||
}
|
||
destroy() {
|
||
this.destroyInfo();
|
||
}
|
||
}
|
||
function completionTooltip(stateField, applyCompletion) {
|
||
return (view) => new CompletionTooltip(view, stateField, applyCompletion);
|
||
}
|
||
function scrollIntoView(container, element) {
|
||
let parent = container.getBoundingClientRect();
|
||
let self = element.getBoundingClientRect();
|
||
let scaleY = parent.height / container.offsetHeight;
|
||
if (self.top < parent.top)
|
||
container.scrollTop -= (parent.top - self.top) / scaleY;
|
||
else if (self.bottom > parent.bottom)
|
||
container.scrollTop += (self.bottom - parent.bottom) / scaleY;
|
||
}
|
||
|
||
// Used to pick a preferred option when two options with the same
|
||
// label occur in the result.
|
||
function score(option) {
|
||
return (option.boost || 0) * 100 + (option.apply ? 10 : 0) + (option.info ? 5 : 0) +
|
||
(option.type ? 1 : 0);
|
||
}
|
||
function sortOptions(active, state) {
|
||
let options = [];
|
||
let sections = null, dynamicSectionScore = null;
|
||
let addOption = (option) => {
|
||
options.push(option);
|
||
let { section } = option.completion;
|
||
if (section) {
|
||
if (!sections)
|
||
sections = [];
|
||
let name = typeof section == "string" ? section : section.name;
|
||
if (!sections.some(s => s.name == name))
|
||
sections.push(typeof section == "string" ? { name } : section);
|
||
}
|
||
};
|
||
let conf = state.facet(completionConfig);
|
||
for (let a of active)
|
||
if (a.hasResult()) {
|
||
let getMatch = a.result.getMatch;
|
||
if (a.result.filter === false) {
|
||
for (let option of a.result.options) {
|
||
addOption(new Option(option, a.source, getMatch ? getMatch(option) : [], 1e9 - options.length));
|
||
}
|
||
}
|
||
else {
|
||
let pattern = state.sliceDoc(a.from, a.to), match;
|
||
let matcher = conf.filterStrict ? new StrictMatcher(pattern) : new FuzzyMatcher(pattern);
|
||
for (let option of a.result.options)
|
||
if (match = matcher.match(option.label)) {
|
||
let matched = !option.displayLabel ? match.matched : getMatch ? getMatch(option, match.matched) : [];
|
||
let score = match.score + (option.boost || 0);
|
||
addOption(new Option(option, a.source, matched, score));
|
||
if (typeof option.section == "object" && option.section.rank === "dynamic") {
|
||
let { name } = option.section;
|
||
if (!dynamicSectionScore)
|
||
dynamicSectionScore = Object.create(null);
|
||
dynamicSectionScore[name] = Math.max(score, dynamicSectionScore[name] || -1e9);
|
||
}
|
||
}
|
||
}
|
||
}
|
||
if (sections) {
|
||
let sectionOrder = Object.create(null), pos = 0;
|
||
let cmp = (a, b) => {
|
||
return (a.rank === "dynamic" && b.rank === "dynamic" ? dynamicSectionScore[b.name] - dynamicSectionScore[a.name] : 0) ||
|
||
(typeof a.rank == "number" ? a.rank : 1e9) - (typeof b.rank == "number" ? b.rank : 1e9) ||
|
||
(a.name < b.name ? -1 : 1);
|
||
};
|
||
for (let s of sections.sort(cmp)) {
|
||
pos -= 1e5;
|
||
sectionOrder[s.name] = pos;
|
||
}
|
||
for (let option of options) {
|
||
let { section } = option.completion;
|
||
if (section)
|
||
option.score += sectionOrder[typeof section == "string" ? section : section.name];
|
||
}
|
||
}
|
||
let result = [], prev = null;
|
||
let compare = conf.compareCompletions;
|
||
for (let opt of options.sort((a, b) => (b.score - a.score) || compare(a.completion, b.completion))) {
|
||
let cur = opt.completion;
|
||
if (!prev || prev.label != cur.label || prev.detail != cur.detail ||
|
||
(prev.type != null && cur.type != null && prev.type != cur.type) ||
|
||
prev.apply != cur.apply || prev.boost != cur.boost)
|
||
result.push(opt);
|
||
else if (score(opt.completion) > score(prev))
|
||
result[result.length - 1] = opt;
|
||
prev = opt.completion;
|
||
}
|
||
return result;
|
||
}
|
||
class CompletionDialog {
|
||
constructor(options, attrs, tooltip, timestamp, selected, disabled) {
|
||
this.options = options;
|
||
this.attrs = attrs;
|
||
this.tooltip = tooltip;
|
||
this.timestamp = timestamp;
|
||
this.selected = selected;
|
||
this.disabled = disabled;
|
||
}
|
||
setSelected(selected, id) {
|
||
return selected == this.selected || selected >= this.options.length ? this
|
||
: new CompletionDialog(this.options, makeAttrs(id, selected), this.tooltip, this.timestamp, selected, this.disabled);
|
||
}
|
||
static build(active, state, id, prev, conf, didSetActive) {
|
||
if (prev && !didSetActive && active.some(s => s.isPending))
|
||
return prev.setDisabled();
|
||
let options = sortOptions(active, state);
|
||
if (!options.length)
|
||
return prev && active.some(a => a.isPending) ? prev.setDisabled() : null;
|
||
let selected = state.facet(completionConfig).selectOnOpen ? 0 : -1;
|
||
if (prev && prev.selected != selected && prev.selected != -1) {
|
||
let selectedValue = prev.options[prev.selected].completion;
|
||
for (let i = 0; i < options.length; i++)
|
||
if (options[i].completion == selectedValue) {
|
||
selected = i;
|
||
break;
|
||
}
|
||
}
|
||
return new CompletionDialog(options, makeAttrs(id, selected), {
|
||
pos: active.reduce((a, b) => b.hasResult() ? Math.min(a, b.from) : a, 1e8),
|
||
create: createTooltip,
|
||
above: conf.aboveCursor,
|
||
}, prev ? prev.timestamp : Date.now(), selected, false);
|
||
}
|
||
map(changes) {
|
||
return new CompletionDialog(this.options, this.attrs, { ...this.tooltip, pos: changes.mapPos(this.tooltip.pos) }, this.timestamp, this.selected, this.disabled);
|
||
}
|
||
setDisabled() {
|
||
return new CompletionDialog(this.options, this.attrs, this.tooltip, this.timestamp, this.selected, true);
|
||
}
|
||
}
|
||
class CompletionState {
|
||
constructor(active, id, open) {
|
||
this.active = active;
|
||
this.id = id;
|
||
this.open = open;
|
||
}
|
||
static start() {
|
||
return new CompletionState(none, "cm-ac-" + Math.floor(Math.random() * 2e6).toString(36), null);
|
||
}
|
||
update(tr) {
|
||
let { state } = tr, conf = state.facet(completionConfig);
|
||
let sources = conf.override ||
|
||
state.languageDataAt("autocomplete", cur(state)).map(asSource);
|
||
let active = sources.map(source => {
|
||
let value = this.active.find(s => s.source == source) ||
|
||
new ActiveSource(source, this.active.some(a => a.state != 0 /* State.Inactive */) ? 1 /* State.Pending */ : 0 /* State.Inactive */);
|
||
return value.update(tr, conf);
|
||
});
|
||
if (active.length == this.active.length && active.every((a, i) => a == this.active[i]))
|
||
active = this.active;
|
||
let open = this.open, didSet = tr.effects.some(e => e.is(setActiveEffect));
|
||
if (open && tr.docChanged)
|
||
open = open.map(tr.changes);
|
||
if (tr.selection || active.some(a => a.hasResult() && tr.changes.touchesRange(a.from, a.to)) ||
|
||
!sameResults(active, this.active) || didSet)
|
||
open = CompletionDialog.build(active, state, this.id, open, conf, didSet);
|
||
else if (open && open.disabled && !active.some(a => a.isPending))
|
||
open = null;
|
||
if (!open && active.every(a => !a.isPending) && active.some(a => a.hasResult()))
|
||
active = active.map(a => a.hasResult() ? new ActiveSource(a.source, 0 /* State.Inactive */) : a);
|
||
for (let effect of tr.effects)
|
||
if (effect.is(setSelectedEffect))
|
||
open = open && open.setSelected(effect.value, this.id);
|
||
return active == this.active && open == this.open ? this : new CompletionState(active, this.id, open);
|
||
}
|
||
get tooltip() { return this.open ? this.open.tooltip : null; }
|
||
get attrs() { return this.open ? this.open.attrs : this.active.length ? baseAttrs : noAttrs; }
|
||
}
|
||
function sameResults(a, b) {
|
||
if (a == b)
|
||
return true;
|
||
for (let iA = 0, iB = 0;;) {
|
||
while (iA < a.length && !a[iA].hasResult())
|
||
iA++;
|
||
while (iB < b.length && !b[iB].hasResult())
|
||
iB++;
|
||
let endA = iA == a.length, endB = iB == b.length;
|
||
if (endA || endB)
|
||
return endA == endB;
|
||
if (a[iA++].result != b[iB++].result)
|
||
return false;
|
||
}
|
||
}
|
||
const baseAttrs = {
|
||
"aria-autocomplete": "list"
|
||
};
|
||
const noAttrs = {};
|
||
function makeAttrs(id, selected) {
|
||
let result = {
|
||
"aria-autocomplete": "list",
|
||
"aria-haspopup": "listbox",
|
||
"aria-controls": id
|
||
};
|
||
if (selected > -1)
|
||
result["aria-activedescendant"] = id + "-" + selected;
|
||
return result;
|
||
}
|
||
const none = [];
|
||
function getUpdateType(tr, conf) {
|
||
if (tr.isUserEvent("input.complete")) {
|
||
let completion = tr.annotation(pickedCompletion);
|
||
if (completion && conf.activateOnCompletion(completion))
|
||
return 4 /* UpdateType.Activate */ | 8 /* UpdateType.Reset */;
|
||
}
|
||
let typing = tr.isUserEvent("input.type");
|
||
return typing && conf.activateOnTyping ? 4 /* UpdateType.Activate */ | 1 /* UpdateType.Typing */
|
||
: typing ? 1 /* UpdateType.Typing */
|
||
: tr.isUserEvent("delete.backward") ? 2 /* UpdateType.Backspacing */
|
||
: tr.selection ? 8 /* UpdateType.Reset */
|
||
: tr.docChanged ? 16 /* UpdateType.ResetIfTouching */ : 0 /* UpdateType.None */;
|
||
}
|
||
class ActiveSource {
|
||
constructor(source, state, explicit = false) {
|
||
this.source = source;
|
||
this.state = state;
|
||
this.explicit = explicit;
|
||
}
|
||
hasResult() { return false; }
|
||
get isPending() { return this.state == 1 /* State.Pending */; }
|
||
update(tr, conf) {
|
||
let type = getUpdateType(tr, conf), value = this;
|
||
if ((type & 8 /* UpdateType.Reset */) || (type & 16 /* UpdateType.ResetIfTouching */) && this.touches(tr))
|
||
value = new ActiveSource(value.source, 0 /* State.Inactive */);
|
||
if ((type & 4 /* UpdateType.Activate */) && value.state == 0 /* State.Inactive */)
|
||
value = new ActiveSource(this.source, 1 /* State.Pending */);
|
||
value = value.updateFor(tr, type);
|
||
for (let effect of tr.effects) {
|
||
if (effect.is(startCompletionEffect))
|
||
value = new ActiveSource(value.source, 1 /* State.Pending */, effect.value);
|
||
else if (effect.is(closeCompletionEffect))
|
||
value = new ActiveSource(value.source, 0 /* State.Inactive */);
|
||
else if (effect.is(setActiveEffect))
|
||
for (let active of effect.value)
|
||
if (active.source == value.source)
|
||
value = active;
|
||
}
|
||
return value;
|
||
}
|
||
updateFor(tr, type) { return this.map(tr.changes); }
|
||
map(changes) { return this; }
|
||
touches(tr) {
|
||
return tr.changes.touchesRange(cur(tr.state));
|
||
}
|
||
}
|
||
class ActiveResult extends ActiveSource {
|
||
constructor(source, explicit, limit, result, from, to) {
|
||
super(source, 3 /* State.Result */, explicit);
|
||
this.limit = limit;
|
||
this.result = result;
|
||
this.from = from;
|
||
this.to = to;
|
||
}
|
||
hasResult() { return true; }
|
||
updateFor(tr, type) {
|
||
var _a;
|
||
if (!(type & 3 /* UpdateType.SimpleInteraction */))
|
||
return this.map(tr.changes);
|
||
let result = this.result;
|
||
if (result.map && !tr.changes.empty)
|
||
result = result.map(result, tr.changes);
|
||
let from = tr.changes.mapPos(this.from), to = tr.changes.mapPos(this.to, 1);
|
||
let pos = cur(tr.state);
|
||
if (pos > to || !result ||
|
||
(type & 2 /* UpdateType.Backspacing */) && (cur(tr.startState) == this.from || pos < this.limit))
|
||
return new ActiveSource(this.source, type & 4 /* UpdateType.Activate */ ? 1 /* State.Pending */ : 0 /* State.Inactive */);
|
||
let limit = tr.changes.mapPos(this.limit);
|
||
if (checkValid(result.validFor, tr.state, from, to))
|
||
return new ActiveResult(this.source, this.explicit, limit, result, from, to);
|
||
if (result.update &&
|
||
(result = result.update(result, from, to, new CompletionContext(tr.state, pos, false))))
|
||
return new ActiveResult(this.source, this.explicit, limit, result, result.from, (_a = result.to) !== null && _a !== void 0 ? _a : cur(tr.state));
|
||
return new ActiveSource(this.source, 1 /* State.Pending */, this.explicit);
|
||
}
|
||
map(mapping) {
|
||
if (mapping.empty)
|
||
return this;
|
||
let result = this.result.map ? this.result.map(this.result, mapping) : this.result;
|
||
if (!result)
|
||
return new ActiveSource(this.source, 0 /* State.Inactive */);
|
||
return new ActiveResult(this.source, this.explicit, mapping.mapPos(this.limit), this.result, mapping.mapPos(this.from), mapping.mapPos(this.to, 1));
|
||
}
|
||
touches(tr) {
|
||
return tr.changes.touchesRange(this.from, this.to);
|
||
}
|
||
}
|
||
function checkValid(validFor, state, from, to) {
|
||
if (!validFor)
|
||
return false;
|
||
let text = state.sliceDoc(from, to);
|
||
return typeof validFor == "function" ? validFor(text, from, to, state) : ensureAnchor(validFor, true).test(text);
|
||
}
|
||
const setActiveEffect = /*@__PURE__*/state_.StateEffect.define({
|
||
map(sources, mapping) { return sources.map(s => s.map(mapping)); }
|
||
});
|
||
const setSelectedEffect = /*@__PURE__*/state_.StateEffect.define();
|
||
const completionState = /*@__PURE__*/state_.StateField.define({
|
||
create() { return CompletionState.start(); },
|
||
update(value, tr) { return value.update(tr); },
|
||
provide: f => [
|
||
view_.showTooltip.from(f, val => val.tooltip),
|
||
view_.EditorView.contentAttributes.from(f, state => state.attrs)
|
||
]
|
||
});
|
||
function applyCompletion(view, option) {
|
||
const apply = option.completion.apply || option.completion.label;
|
||
let result = view.state.field(completionState).active.find(a => a.source == option.source);
|
||
if (!(result instanceof ActiveResult))
|
||
return false;
|
||
if (typeof apply == "string")
|
||
view.dispatch({
|
||
...insertCompletionText(view.state, apply, result.from, result.to),
|
||
annotations: pickedCompletion.of(option.completion)
|
||
});
|
||
else
|
||
apply(view, option.completion, result.from, result.to);
|
||
return true;
|
||
}
|
||
const createTooltip = /*@__PURE__*/completionTooltip(completionState, applyCompletion);
|
||
|
||
/**
|
||
Returns a command that moves the completion selection forward or
|
||
backward by the given amount.
|
||
*/
|
||
function moveCompletionSelection(forward, by = "option") {
|
||
return (view) => {
|
||
let cState = view.state.field(completionState, false);
|
||
if (!cState || !cState.open || cState.open.disabled ||
|
||
Date.now() - cState.open.timestamp < view.state.facet(completionConfig).interactionDelay)
|
||
return false;
|
||
let step = 1, tooltip;
|
||
if (by == "page" && (tooltip = (0,view_.getTooltip)(view, cState.open.tooltip)))
|
||
step = Math.max(2, Math.floor(tooltip.dom.offsetHeight /
|
||
tooltip.dom.querySelector("li").offsetHeight) - 1);
|
||
let { length } = cState.open.options;
|
||
let selected = cState.open.selected > -1 ? cState.open.selected + step * (forward ? 1 : -1) : forward ? 0 : length - 1;
|
||
if (selected < 0)
|
||
selected = by == "page" ? 0 : length - 1;
|
||
else if (selected >= length)
|
||
selected = by == "page" ? length - 1 : 0;
|
||
view.dispatch({ effects: setSelectedEffect.of(selected) });
|
||
return true;
|
||
};
|
||
}
|
||
/**
|
||
Accept the current completion.
|
||
*/
|
||
const acceptCompletion = (view) => {
|
||
let cState = view.state.field(completionState, false);
|
||
if (view.state.readOnly || !cState || !cState.open || cState.open.selected < 0 || cState.open.disabled ||
|
||
Date.now() - cState.open.timestamp < view.state.facet(completionConfig).interactionDelay)
|
||
return false;
|
||
return applyCompletion(view, cState.open.options[cState.open.selected]);
|
||
};
|
||
/**
|
||
Explicitly start autocompletion.
|
||
*/
|
||
const startCompletion = (view) => {
|
||
let cState = view.state.field(completionState, false);
|
||
if (!cState)
|
||
return false;
|
||
view.dispatch({ effects: startCompletionEffect.of(true) });
|
||
return true;
|
||
};
|
||
/**
|
||
Close the currently active completion.
|
||
*/
|
||
const closeCompletion = (view) => {
|
||
let cState = view.state.field(completionState, false);
|
||
if (!cState || !cState.active.some(a => a.state != 0 /* State.Inactive */))
|
||
return false;
|
||
view.dispatch({ effects: closeCompletionEffect.of(null) });
|
||
return true;
|
||
};
|
||
class RunningQuery {
|
||
constructor(active, context) {
|
||
this.active = active;
|
||
this.context = context;
|
||
this.time = Date.now();
|
||
this.updates = [];
|
||
// Note that 'undefined' means 'not done yet', whereas 'null' means
|
||
// 'query returned null'.
|
||
this.done = undefined;
|
||
}
|
||
}
|
||
const MaxUpdateCount = 50, MinAbortTime = 1000;
|
||
const completionPlugin = /*@__PURE__*/view_.ViewPlugin.fromClass(class {
|
||
constructor(view) {
|
||
this.view = view;
|
||
this.debounceUpdate = -1;
|
||
this.running = [];
|
||
this.debounceAccept = -1;
|
||
this.pendingStart = false;
|
||
this.composing = 0 /* CompositionState.None */;
|
||
for (let active of view.state.field(completionState).active)
|
||
if (active.isPending)
|
||
this.startQuery(active);
|
||
}
|
||
update(update) {
|
||
let cState = update.state.field(completionState);
|
||
let conf = update.state.facet(completionConfig);
|
||
if (!update.selectionSet && !update.docChanged && update.startState.field(completionState) == cState)
|
||
return;
|
||
let doesReset = update.transactions.some(tr => {
|
||
let type = getUpdateType(tr, conf);
|
||
return (type & 8 /* UpdateType.Reset */) || (tr.selection || tr.docChanged) && !(type & 3 /* UpdateType.SimpleInteraction */);
|
||
});
|
||
for (let i = 0; i < this.running.length; i++) {
|
||
let query = this.running[i];
|
||
if (doesReset ||
|
||
query.context.abortOnDocChange && update.docChanged ||
|
||
query.updates.length + update.transactions.length > MaxUpdateCount && Date.now() - query.time > MinAbortTime) {
|
||
for (let handler of query.context.abortListeners) {
|
||
try {
|
||
handler();
|
||
}
|
||
catch (e) {
|
||
(0,view_.logException)(this.view.state, e);
|
||
}
|
||
}
|
||
query.context.abortListeners = null;
|
||
this.running.splice(i--, 1);
|
||
}
|
||
else {
|
||
query.updates.push(...update.transactions);
|
||
}
|
||
}
|
||
if (this.debounceUpdate > -1)
|
||
clearTimeout(this.debounceUpdate);
|
||
if (update.transactions.some(tr => tr.effects.some(e => e.is(startCompletionEffect))))
|
||
this.pendingStart = true;
|
||
let delay = this.pendingStart ? 50 : conf.activateOnTypingDelay;
|
||
this.debounceUpdate = cState.active.some(a => a.isPending && !this.running.some(q => q.active.source == a.source))
|
||
? setTimeout(() => this.startUpdate(), delay) : -1;
|
||
if (this.composing != 0 /* CompositionState.None */)
|
||
for (let tr of update.transactions) {
|
||
if (tr.isUserEvent("input.type"))
|
||
this.composing = 2 /* CompositionState.Changed */;
|
||
else if (this.composing == 2 /* CompositionState.Changed */ && tr.selection)
|
||
this.composing = 3 /* CompositionState.ChangedAndMoved */;
|
||
}
|
||
}
|
||
startUpdate() {
|
||
this.debounceUpdate = -1;
|
||
this.pendingStart = false;
|
||
let { state } = this.view, cState = state.field(completionState);
|
||
for (let active of cState.active) {
|
||
if (active.isPending && !this.running.some(r => r.active.source == active.source))
|
||
this.startQuery(active);
|
||
}
|
||
if (this.running.length && cState.open && cState.open.disabled)
|
||
this.debounceAccept = setTimeout(() => this.accept(), this.view.state.facet(completionConfig).updateSyncTime);
|
||
}
|
||
startQuery(active) {
|
||
let { state } = this.view, pos = cur(state);
|
||
let context = new CompletionContext(state, pos, active.explicit, this.view);
|
||
let pending = new RunningQuery(active, context);
|
||
this.running.push(pending);
|
||
Promise.resolve(active.source(context)).then(result => {
|
||
if (!pending.context.aborted) {
|
||
pending.done = result || null;
|
||
this.scheduleAccept();
|
||
}
|
||
}, err => {
|
||
this.view.dispatch({ effects: closeCompletionEffect.of(null) });
|
||
(0,view_.logException)(this.view.state, err);
|
||
});
|
||
}
|
||
scheduleAccept() {
|
||
if (this.running.every(q => q.done !== undefined))
|
||
this.accept();
|
||
else if (this.debounceAccept < 0)
|
||
this.debounceAccept = setTimeout(() => this.accept(), this.view.state.facet(completionConfig).updateSyncTime);
|
||
}
|
||
// For each finished query in this.running, try to create a result
|
||
// or, if appropriate, restart the query.
|
||
accept() {
|
||
var _a;
|
||
if (this.debounceAccept > -1)
|
||
clearTimeout(this.debounceAccept);
|
||
this.debounceAccept = -1;
|
||
let updated = [];
|
||
let conf = this.view.state.facet(completionConfig), cState = this.view.state.field(completionState);
|
||
for (let i = 0; i < this.running.length; i++) {
|
||
let query = this.running[i];
|
||
if (query.done === undefined)
|
||
continue;
|
||
this.running.splice(i--, 1);
|
||
if (query.done) {
|
||
let pos = cur(query.updates.length ? query.updates[0].startState : this.view.state);
|
||
let limit = Math.min(pos, query.done.from + (query.active.explicit ? 0 : 1));
|
||
let active = new ActiveResult(query.active.source, query.active.explicit, limit, query.done, query.done.from, (_a = query.done.to) !== null && _a !== void 0 ? _a : pos);
|
||
// Replay the transactions that happened since the start of
|
||
// the request and see if that preserves the result
|
||
for (let tr of query.updates)
|
||
active = active.update(tr, conf);
|
||
if (active.hasResult()) {
|
||
updated.push(active);
|
||
continue;
|
||
}
|
||
}
|
||
let current = cState.active.find(a => a.source == query.active.source);
|
||
if (current && current.isPending) {
|
||
if (query.done == null) {
|
||
// Explicitly failed. Should clear the pending status if it
|
||
// hasn't been re-set in the meantime.
|
||
let active = new ActiveSource(query.active.source, 0 /* State.Inactive */);
|
||
for (let tr of query.updates)
|
||
active = active.update(tr, conf);
|
||
if (!active.isPending)
|
||
updated.push(active);
|
||
}
|
||
else {
|
||
// Cleared by subsequent transactions. Restart.
|
||
this.startQuery(current);
|
||
}
|
||
}
|
||
}
|
||
if (updated.length || cState.open && cState.open.disabled)
|
||
this.view.dispatch({ effects: setActiveEffect.of(updated) });
|
||
}
|
||
}, {
|
||
eventHandlers: {
|
||
blur(event) {
|
||
let state = this.view.state.field(completionState, false);
|
||
if (state && state.tooltip && this.view.state.facet(completionConfig).closeOnBlur) {
|
||
let dialog = state.open && (0,view_.getTooltip)(this.view, state.open.tooltip);
|
||
if (!dialog || !dialog.dom.contains(event.relatedTarget))
|
||
setTimeout(() => this.view.dispatch({ effects: closeCompletionEffect.of(null) }), 10);
|
||
}
|
||
},
|
||
compositionstart() {
|
||
this.composing = 1 /* CompositionState.Started */;
|
||
},
|
||
compositionend() {
|
||
if (this.composing == 3 /* CompositionState.ChangedAndMoved */) {
|
||
// Safari fires compositionend events synchronously, possibly
|
||
// from inside an update, so dispatch asynchronously to avoid reentrancy
|
||
setTimeout(() => this.view.dispatch({ effects: startCompletionEffect.of(false) }), 20);
|
||
}
|
||
this.composing = 0 /* CompositionState.None */;
|
||
}
|
||
}
|
||
});
|
||
const windows = typeof navigator == "object" && /*@__PURE__*//Win/.test(navigator.platform);
|
||
const commitCharacters = /*@__PURE__*/state_.Prec.highest(/*@__PURE__*/view_.EditorView.domEventHandlers({
|
||
keydown(event, view) {
|
||
let field = view.state.field(completionState, false);
|
||
if (!field || !field.open || field.open.disabled || field.open.selected < 0 ||
|
||
event.key.length > 1 || event.ctrlKey && !(windows && event.altKey) || event.metaKey)
|
||
return false;
|
||
let option = field.open.options[field.open.selected];
|
||
let result = field.active.find(a => a.source == option.source);
|
||
let commitChars = option.completion.commitCharacters || result.result.commitCharacters;
|
||
if (commitChars && commitChars.indexOf(event.key) > -1)
|
||
applyCompletion(view, option);
|
||
return false;
|
||
}
|
||
}));
|
||
|
||
const dist_baseTheme = /*@__PURE__*/view_.EditorView.baseTheme({
|
||
".cm-tooltip.cm-tooltip-autocomplete": {
|
||
"& > ul": {
|
||
fontFamily: "monospace",
|
||
whiteSpace: "nowrap",
|
||
overflow: "hidden auto",
|
||
maxWidth_fallback: "700px",
|
||
maxWidth: "min(700px, 95vw)",
|
||
minWidth: "250px",
|
||
maxHeight: "10em",
|
||
height: "100%",
|
||
listStyle: "none",
|
||
margin: 0,
|
||
padding: 0,
|
||
"& > li, & > completion-section": {
|
||
padding: "1px 3px",
|
||
lineHeight: 1.2
|
||
},
|
||
"& > li": {
|
||
overflowX: "hidden",
|
||
textOverflow: "ellipsis",
|
||
cursor: "pointer"
|
||
},
|
||
"& > completion-section": {
|
||
display: "list-item",
|
||
borderBottom: "1px solid silver",
|
||
paddingLeft: "0.5em",
|
||
opacity: 0.7
|
||
}
|
||
}
|
||
},
|
||
"&light .cm-tooltip-autocomplete ul li[aria-selected]": {
|
||
background: "#17c",
|
||
color: "white",
|
||
},
|
||
"&light .cm-tooltip-autocomplete-disabled ul li[aria-selected]": {
|
||
background: "#777",
|
||
},
|
||
"&dark .cm-tooltip-autocomplete ul li[aria-selected]": {
|
||
background: "#347",
|
||
color: "white",
|
||
},
|
||
"&dark .cm-tooltip-autocomplete-disabled ul li[aria-selected]": {
|
||
background: "#444",
|
||
},
|
||
".cm-completionListIncompleteTop:before, .cm-completionListIncompleteBottom:after": {
|
||
content: '"···"',
|
||
opacity: 0.5,
|
||
display: "block",
|
||
textAlign: "center"
|
||
},
|
||
".cm-tooltip.cm-completionInfo": {
|
||
position: "absolute",
|
||
padding: "3px 9px",
|
||
width: "max-content",
|
||
maxWidth: `${400 /* Info.Width */}px`,
|
||
boxSizing: "border-box",
|
||
whiteSpace: "pre-line"
|
||
},
|
||
".cm-completionInfo.cm-completionInfo-left": { right: "100%" },
|
||
".cm-completionInfo.cm-completionInfo-right": { left: "100%" },
|
||
".cm-completionInfo.cm-completionInfo-left-narrow": { right: `${30 /* Info.Margin */}px` },
|
||
".cm-completionInfo.cm-completionInfo-right-narrow": { left: `${30 /* Info.Margin */}px` },
|
||
"&light .cm-snippetField": { backgroundColor: "#00000022" },
|
||
"&dark .cm-snippetField": { backgroundColor: "#ffffff22" },
|
||
".cm-snippetFieldPosition": {
|
||
verticalAlign: "text-top",
|
||
width: 0,
|
||
height: "1.15em",
|
||
display: "inline-block",
|
||
margin: "0 -0.7px -.7em",
|
||
borderLeft: "1.4px dotted #888"
|
||
},
|
||
".cm-completionMatchedText": {
|
||
textDecoration: "underline"
|
||
},
|
||
".cm-completionDetail": {
|
||
marginLeft: "0.5em",
|
||
fontStyle: "italic"
|
||
},
|
||
".cm-completionIcon": {
|
||
fontSize: "90%",
|
||
width: ".8em",
|
||
display: "inline-block",
|
||
textAlign: "center",
|
||
paddingRight: ".6em",
|
||
opacity: "0.6",
|
||
boxSizing: "content-box"
|
||
},
|
||
".cm-completionIcon-function, .cm-completionIcon-method": {
|
||
"&:after": { content: "'ƒ'" }
|
||
},
|
||
".cm-completionIcon-class": {
|
||
"&:after": { content: "'○'" }
|
||
},
|
||
".cm-completionIcon-interface": {
|
||
"&:after": { content: "'◌'" }
|
||
},
|
||
".cm-completionIcon-variable": {
|
||
"&:after": { content: "'𝑥'" }
|
||
},
|
||
".cm-completionIcon-constant": {
|
||
"&:after": { content: "'𝐶'" }
|
||
},
|
||
".cm-completionIcon-type": {
|
||
"&:after": { content: "'𝑡'" }
|
||
},
|
||
".cm-completionIcon-enum": {
|
||
"&:after": { content: "'∪'" }
|
||
},
|
||
".cm-completionIcon-property": {
|
||
"&:after": { content: "'□'" }
|
||
},
|
||
".cm-completionIcon-keyword": {
|
||
"&:after": { content: "'🔑\uFE0E'" } // Disable emoji rendering
|
||
},
|
||
".cm-completionIcon-namespace": {
|
||
"&:after": { content: "'▢'" }
|
||
},
|
||
".cm-completionIcon-text": {
|
||
"&:after": { content: "'abc'", fontSize: "50%", verticalAlign: "middle" }
|
||
}
|
||
});
|
||
|
||
class FieldPos {
|
||
constructor(field, line, from, to) {
|
||
this.field = field;
|
||
this.line = line;
|
||
this.from = from;
|
||
this.to = to;
|
||
}
|
||
}
|
||
class FieldRange {
|
||
constructor(field, from, to) {
|
||
this.field = field;
|
||
this.from = from;
|
||
this.to = to;
|
||
}
|
||
map(changes) {
|
||
let from = changes.mapPos(this.from, -1, MapMode.TrackDel);
|
||
let to = changes.mapPos(this.to, 1, MapMode.TrackDel);
|
||
return from == null || to == null ? null : new FieldRange(this.field, from, to);
|
||
}
|
||
}
|
||
class Snippet {
|
||
constructor(lines, fieldPositions) {
|
||
this.lines = lines;
|
||
this.fieldPositions = fieldPositions;
|
||
}
|
||
instantiate(state, pos) {
|
||
let text = [], lineStart = [pos];
|
||
let lineObj = state.doc.lineAt(pos), baseIndent = /^\s*/.exec(lineObj.text)[0];
|
||
for (let line of this.lines) {
|
||
if (text.length) {
|
||
let indent = baseIndent, tabs = /^\t*/.exec(line)[0].length;
|
||
for (let i = 0; i < tabs; i++)
|
||
indent += state.facet(indentUnit);
|
||
lineStart.push(pos + indent.length - tabs);
|
||
line = indent + line.slice(tabs);
|
||
}
|
||
text.push(line);
|
||
pos += line.length + 1;
|
||
}
|
||
let ranges = this.fieldPositions.map(pos => new FieldRange(pos.field, lineStart[pos.line] + pos.from, lineStart[pos.line] + pos.to));
|
||
return { text, ranges };
|
||
}
|
||
static parse(template) {
|
||
let fields = [];
|
||
let lines = [], positions = [], m;
|
||
for (let line of template.split(/\r\n?|\n/)) {
|
||
while (m = /[#$]\{(?:(\d+)(?::([^{}]*))?|((?:\\[{}]|[^{}])*))\}/.exec(line)) {
|
||
let seq = m[1] ? +m[1] : null, rawName = m[2] || m[3] || "", found = -1;
|
||
let name = rawName.replace(/\\[{}]/g, m => m[1]);
|
||
for (let i = 0; i < fields.length; i++) {
|
||
if (seq != null ? fields[i].seq == seq : name ? fields[i].name == name : false)
|
||
found = i;
|
||
}
|
||
if (found < 0) {
|
||
let i = 0;
|
||
while (i < fields.length && (seq == null || (fields[i].seq != null && fields[i].seq < seq)))
|
||
i++;
|
||
fields.splice(i, 0, { seq, name });
|
||
found = i;
|
||
for (let pos of positions)
|
||
if (pos.field >= found)
|
||
pos.field++;
|
||
}
|
||
for (let pos of positions)
|
||
if (pos.line == lines.length && pos.from > m.index) {
|
||
let snip = m[2] ? 3 + (m[1] || "").length : 2;
|
||
pos.from -= snip;
|
||
pos.to -= snip;
|
||
}
|
||
positions.push(new FieldPos(found, lines.length, m.index, m.index + name.length));
|
||
line = line.slice(0, m.index) + rawName + line.slice(m.index + m[0].length);
|
||
}
|
||
line = line.replace(/\\([{}])/g, (_, brace, index) => {
|
||
for (let pos of positions)
|
||
if (pos.line == lines.length && pos.from > index) {
|
||
pos.from--;
|
||
pos.to--;
|
||
}
|
||
return brace;
|
||
});
|
||
lines.push(line);
|
||
}
|
||
return new Snippet(lines, positions);
|
||
}
|
||
}
|
||
let fieldMarker = /*@__PURE__*/view_.Decoration.widget({ widget: /*@__PURE__*/new class extends view_.WidgetType {
|
||
toDOM() {
|
||
let span = document.createElement("span");
|
||
span.className = "cm-snippetFieldPosition";
|
||
return span;
|
||
}
|
||
ignoreEvent() { return false; }
|
||
} });
|
||
let fieldRange = /*@__PURE__*/view_.Decoration.mark({ class: "cm-snippetField" });
|
||
class ActiveSnippet {
|
||
constructor(ranges, active) {
|
||
this.ranges = ranges;
|
||
this.active = active;
|
||
this.deco = view_.Decoration.set(ranges.map(r => (r.from == r.to ? fieldMarker : fieldRange).range(r.from, r.to)), true);
|
||
}
|
||
map(changes) {
|
||
let ranges = [];
|
||
for (let r of this.ranges) {
|
||
let mapped = r.map(changes);
|
||
if (!mapped)
|
||
return null;
|
||
ranges.push(mapped);
|
||
}
|
||
return new ActiveSnippet(ranges, this.active);
|
||
}
|
||
selectionInsideField(sel) {
|
||
return sel.ranges.every(range => this.ranges.some(r => r.field == this.active && r.from <= range.from && r.to >= range.to));
|
||
}
|
||
}
|
||
const setActive = /*@__PURE__*/state_.StateEffect.define({
|
||
map(value, changes) { return value && value.map(changes); }
|
||
});
|
||
const moveToField = /*@__PURE__*/state_.StateEffect.define();
|
||
const snippetState = /*@__PURE__*/state_.StateField.define({
|
||
create() { return null; },
|
||
update(value, tr) {
|
||
for (let effect of tr.effects) {
|
||
if (effect.is(setActive))
|
||
return effect.value;
|
||
if (effect.is(moveToField) && value)
|
||
return new ActiveSnippet(value.ranges, effect.value);
|
||
}
|
||
if (value && tr.docChanged)
|
||
value = value.map(tr.changes);
|
||
if (value && tr.selection && !value.selectionInsideField(tr.selection))
|
||
value = null;
|
||
return value;
|
||
},
|
||
provide: f => view_.EditorView.decorations.from(f, val => val ? val.deco : view_.Decoration.none)
|
||
});
|
||
function fieldSelection(ranges, field) {
|
||
return state_.EditorSelection.create(ranges.filter(r => r.field == field).map(r => state_.EditorSelection.range(r.from, r.to)));
|
||
}
|
||
/**
|
||
Convert a snippet template to a function that can
|
||
[apply](https://codemirror.net/6/docs/ref/#autocomplete.Completion.apply) it. Snippets are written
|
||
using syntax like this:
|
||
|
||
"for (let ${index} = 0; ${index} < ${end}; ${index}++) {\n\t${}\n}"
|
||
|
||
Each `${}` placeholder (you may also use `#{}`) indicates a field
|
||
that the user can fill in. Its name, if any, will be the default
|
||
content for the field.
|
||
|
||
When the snippet is activated by calling the returned function,
|
||
the code is inserted at the given position. Newlines in the
|
||
template are indented by the indentation of the start line, plus
|
||
one [indent unit](https://codemirror.net/6/docs/ref/#language.indentUnit) per tab character after
|
||
the newline.
|
||
|
||
On activation, (all instances of) the first field are selected.
|
||
The user can move between fields with Tab and Shift-Tab as long as
|
||
the fields are active. Moving to the last field or moving the
|
||
cursor out of the current field deactivates the fields.
|
||
|
||
The order of fields defaults to textual order, but you can add
|
||
numbers to placeholders (`${1}` or `${1:defaultText}`) to provide
|
||
a custom order.
|
||
|
||
To include a literal `{` or `}` in your template, put a backslash
|
||
in front of it. This will be removed and the brace will not be
|
||
interpreted as indicating a placeholder.
|
||
*/
|
||
function snippet(template) {
|
||
let snippet = Snippet.parse(template);
|
||
return (editor, completion, from, to) => {
|
||
let { text, ranges } = snippet.instantiate(editor.state, from);
|
||
let { main } = editor.state.selection;
|
||
let spec = {
|
||
changes: { from, to: to == main.from ? main.to : to, insert: Text.of(text) },
|
||
scrollIntoView: true,
|
||
annotations: completion ? [pickedCompletion.of(completion), Transaction.userEvent.of("input.complete")] : undefined
|
||
};
|
||
if (ranges.length)
|
||
spec.selection = fieldSelection(ranges, 0);
|
||
if (ranges.some(r => r.field > 0)) {
|
||
let active = new ActiveSnippet(ranges, 0);
|
||
let effects = spec.effects = [setActive.of(active)];
|
||
if (editor.state.field(snippetState, false) === undefined)
|
||
effects.push(StateEffect.appendConfig.of([snippetState, addSnippetKeymap, snippetPointerHandler, dist_baseTheme]));
|
||
}
|
||
editor.dispatch(editor.state.update(spec));
|
||
};
|
||
}
|
||
function moveField(dir) {
|
||
return ({ state, dispatch }) => {
|
||
let active = state.field(snippetState, false);
|
||
if (!active || dir < 0 && active.active == 0)
|
||
return false;
|
||
let next = active.active + dir, last = dir > 0 && !active.ranges.some(r => r.field == next + dir);
|
||
dispatch(state.update({
|
||
selection: fieldSelection(active.ranges, next),
|
||
effects: setActive.of(last ? null : new ActiveSnippet(active.ranges, next)),
|
||
scrollIntoView: true
|
||
}));
|
||
return true;
|
||
};
|
||
}
|
||
/**
|
||
A command that clears the active snippet, if any.
|
||
*/
|
||
const clearSnippet = ({ state, dispatch }) => {
|
||
let active = state.field(snippetState, false);
|
||
if (!active)
|
||
return false;
|
||
dispatch(state.update({ effects: setActive.of(null) }));
|
||
return true;
|
||
};
|
||
/**
|
||
Move to the next snippet field, if available.
|
||
*/
|
||
const nextSnippetField = /*@__PURE__*/moveField(1);
|
||
/**
|
||
Move to the previous snippet field, if available.
|
||
*/
|
||
const prevSnippetField = /*@__PURE__*/moveField(-1);
|
||
/**
|
||
Check if there is an active snippet with a next field for
|
||
`nextSnippetField` to move to.
|
||
*/
|
||
function hasNextSnippetField(state) {
|
||
let active = state.field(snippetState, false);
|
||
return !!(active && active.ranges.some(r => r.field == active.active + 1));
|
||
}
|
||
/**
|
||
Returns true if there is an active snippet and a previous field
|
||
for `prevSnippetField` to move to.
|
||
*/
|
||
function hasPrevSnippetField(state) {
|
||
let active = state.field(snippetState, false);
|
||
return !!(active && active.active > 0);
|
||
}
|
||
const defaultSnippetKeymap = [
|
||
{ key: "Tab", run: nextSnippetField, shift: prevSnippetField },
|
||
{ key: "Escape", run: clearSnippet }
|
||
];
|
||
/**
|
||
A facet that can be used to configure the key bindings used by
|
||
snippets. The default binds Tab to
|
||
[`nextSnippetField`](https://codemirror.net/6/docs/ref/#autocomplete.nextSnippetField), Shift-Tab to
|
||
[`prevSnippetField`](https://codemirror.net/6/docs/ref/#autocomplete.prevSnippetField), and Escape
|
||
to [`clearSnippet`](https://codemirror.net/6/docs/ref/#autocomplete.clearSnippet).
|
||
*/
|
||
const snippetKeymap = /*@__PURE__*/state_.Facet.define({
|
||
combine(maps) { return maps.length ? maps[0] : defaultSnippetKeymap; }
|
||
});
|
||
const addSnippetKeymap = /*@__PURE__*/state_.Prec.highest(/*@__PURE__*/view_.keymap.compute([snippetKeymap], state => state.facet(snippetKeymap)));
|
||
/**
|
||
Create a completion from a snippet. Returns an object with the
|
||
properties from `completion`, plus an `apply` function that
|
||
applies the snippet.
|
||
*/
|
||
function snippetCompletion(template, completion) {
|
||
return { ...completion, apply: snippet(template) };
|
||
}
|
||
const snippetPointerHandler = /*@__PURE__*/view_.EditorView.domEventHandlers({
|
||
mousedown(event, view) {
|
||
let active = view.state.field(snippetState, false), pos;
|
||
if (!active || (pos = view.posAtCoords({ x: event.clientX, y: event.clientY })) == null)
|
||
return false;
|
||
let match = active.ranges.find(r => r.from <= pos && r.to >= pos);
|
||
if (!match || match.field == active.active)
|
||
return false;
|
||
view.dispatch({
|
||
selection: fieldSelection(active.ranges, match.field),
|
||
effects: setActive.of(active.ranges.some(r => r.field > match.field)
|
||
? new ActiveSnippet(active.ranges, match.field) : null),
|
||
scrollIntoView: true
|
||
});
|
||
return true;
|
||
}
|
||
});
|
||
|
||
function wordRE(wordChars) {
|
||
let escaped = wordChars.replace(/[\]\-\\]/g, "\\$&");
|
||
try {
|
||
return new RegExp(`[\\p{Alphabetic}\\p{Number}_${escaped}]+`, "ug");
|
||
}
|
||
catch (_a) {
|
||
return new RegExp(`[\w${escaped}]`, "g");
|
||
}
|
||
}
|
||
function mapRE(re, f) {
|
||
return new RegExp(f(re.source), re.unicode ? "u" : "");
|
||
}
|
||
const wordCaches = /*@__PURE__*/(/* unused pure expression or super */ null && (Object.create(null)));
|
||
function wordCache(wordChars) {
|
||
return wordCaches[wordChars] || (wordCaches[wordChars] = new WeakMap);
|
||
}
|
||
function storeWords(doc, wordRE, result, seen, ignoreAt) {
|
||
for (let lines = doc.iterLines(), pos = 0; !lines.next().done;) {
|
||
let { value } = lines, m;
|
||
wordRE.lastIndex = 0;
|
||
while (m = wordRE.exec(value)) {
|
||
if (!seen[m[0]] && pos + m.index != ignoreAt) {
|
||
result.push({ type: "text", label: m[0] });
|
||
seen[m[0]] = true;
|
||
if (result.length >= 2000 /* C.MaxList */)
|
||
return;
|
||
}
|
||
}
|
||
pos += value.length + 1;
|
||
}
|
||
}
|
||
function collectWords(doc, cache, wordRE, to, ignoreAt) {
|
||
let big = doc.length >= 1000 /* C.MinCacheLen */;
|
||
let cached = big && cache.get(doc);
|
||
if (cached)
|
||
return cached;
|
||
let result = [], seen = Object.create(null);
|
||
if (doc.children) {
|
||
let pos = 0;
|
||
for (let ch of doc.children) {
|
||
if (ch.length >= 1000 /* C.MinCacheLen */) {
|
||
for (let c of collectWords(ch, cache, wordRE, to - pos, ignoreAt - pos)) {
|
||
if (!seen[c.label]) {
|
||
seen[c.label] = true;
|
||
result.push(c);
|
||
}
|
||
}
|
||
}
|
||
else {
|
||
storeWords(ch, wordRE, result, seen, ignoreAt - pos);
|
||
}
|
||
pos += ch.length + 1;
|
||
}
|
||
}
|
||
else {
|
||
storeWords(doc, wordRE, result, seen, ignoreAt);
|
||
}
|
||
if (big && result.length < 2000 /* C.MaxList */)
|
||
cache.set(doc, result);
|
||
return result;
|
||
}
|
||
/**
|
||
A completion source that will scan the document for words (using a
|
||
[character categorizer](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer)), and
|
||
return those as completions.
|
||
*/
|
||
const completeAnyWord = context => {
|
||
let wordChars = context.state.languageDataAt("wordChars", context.pos).join("");
|
||
let re = wordRE(wordChars);
|
||
let token = context.matchBefore(mapRE(re, s => s + "$"));
|
||
if (!token && !context.explicit)
|
||
return null;
|
||
let from = token ? token.from : context.pos;
|
||
let options = collectWords(context.state.doc, wordCache(wordChars), re, 50000 /* C.Range */, from);
|
||
return { from, options, validFor: mapRE(re, s => "^" + s) };
|
||
};
|
||
|
||
const defaults = {
|
||
brackets: ["(", "[", "{", "'", '"'],
|
||
before: ")]}:;>",
|
||
stringPrefixes: []
|
||
};
|
||
const closeBracketEffect = /*@__PURE__*/state_.StateEffect.define({
|
||
map(value, mapping) {
|
||
let mapped = mapping.mapPos(value, -1, state_.MapMode.TrackAfter);
|
||
return mapped == null ? undefined : mapped;
|
||
}
|
||
});
|
||
const closedBracket = /*@__PURE__*/new class extends state_.RangeValue {
|
||
};
|
||
closedBracket.startSide = 1;
|
||
closedBracket.endSide = -1;
|
||
const bracketState = /*@__PURE__*/state_.StateField.define({
|
||
create() { return state_.RangeSet.empty; },
|
||
update(value, tr) {
|
||
value = value.map(tr.changes);
|
||
if (tr.selection) {
|
||
let line = tr.state.doc.lineAt(tr.selection.main.head);
|
||
value = value.update({ filter: from => from >= line.from && from <= line.to });
|
||
}
|
||
for (let effect of tr.effects)
|
||
if (effect.is(closeBracketEffect))
|
||
value = value.update({ add: [closedBracket.range(effect.value, effect.value + 1)] });
|
||
return value;
|
||
}
|
||
});
|
||
/**
|
||
Extension to enable bracket-closing behavior. When a closeable
|
||
bracket is typed, its closing bracket is immediately inserted
|
||
after the cursor. When closing a bracket directly in front of a
|
||
closing bracket inserted by the extension, the cursor moves over
|
||
that bracket.
|
||
*/
|
||
function closeBrackets() {
|
||
return [inputHandler, bracketState];
|
||
}
|
||
const definedClosing = "()[]{}<>«»»«［］｛｝";
|
||
function closing(ch) {
|
||
for (let i = 0; i < definedClosing.length; i += 2)
|
||
if (definedClosing.charCodeAt(i) == ch)
|
||
return definedClosing.charAt(i + 1);
|
||
return (0,state_.fromCodePoint)(ch < 128 ? ch : ch + 1);
|
||
}
|
||
function config(state, pos) {
|
||
return state.languageDataAt("closeBrackets", pos)[0] || defaults;
|
||
}
|
||
const android = typeof navigator == "object" && /*@__PURE__*//Android\b/.test(navigator.userAgent);
|
||
const inputHandler = /*@__PURE__*/view_.EditorView.inputHandler.of((view, from, to, insert) => {
|
||
if ((android ? view.composing : view.compositionStarted) || view.state.readOnly)
|
||
return false;
|
||
let sel = view.state.selection.main;
|
||
if (insert.length > 2 || insert.length == 2 && (0,state_.codePointSize)((0,state_.codePointAt)(insert, 0)) == 1 ||
|
||
from != sel.from || to != sel.to)
|
||
return false;
|
||
let tr = insertBracket(view.state, insert);
|
||
if (!tr)
|
||
return false;
|
||
view.dispatch(tr);
|
||
return true;
|
||
});
|
||
/**
|
||
Command that implements deleting a pair of matching brackets when
|
||
the cursor is between them.
|
||
*/
|
||
const deleteBracketPair = ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
let conf = config(state, state.selection.main.head);
|
||
let tokens = conf.brackets || defaults.brackets;
|
||
let dont = null, changes = state.changeByRange(range => {
|
||
if (range.empty) {
|
||
let before = prevChar(state.doc, range.head);
|
||
for (let token of tokens) {
|
||
if (token == before && nextChar(state.doc, range.head) == closing((0,state_.codePointAt)(token, 0)))
|
||
return { changes: { from: range.head - token.length, to: range.head + token.length },
|
||
range: state_.EditorSelection.cursor(range.head - token.length) };
|
||
}
|
||
}
|
||
return { range: dont = range };
|
||
});
|
||
if (!dont)
|
||
dispatch(state.update(changes, { scrollIntoView: true, userEvent: "delete.backward" }));
|
||
return !dont;
|
||
};
|
||
/**
|
||
Close-brackets related key bindings. Binds Backspace to
|
||
[`deleteBracketPair`](https://codemirror.net/6/docs/ref/#autocomplete.deleteBracketPair).
|
||
*/
|
||
const closeBracketsKeymap = [
|
||
{ key: "Backspace", run: deleteBracketPair }
|
||
];
|
||
/**
|
||
Implements the extension's behavior on text insertion. If the
|
||
given string counts as a bracket in the language around the
|
||
selection, and replacing the selection with it requires custom
|
||
behavior (inserting a closing version or skipping past a
|
||
previously-closed bracket), this function returns a transaction
|
||
representing that custom behavior. (You only need this if you want
|
||
to programmatically insert brackets—the
|
||
[`closeBrackets`](https://codemirror.net/6/docs/ref/#autocomplete.closeBrackets) extension will
|
||
take care of running this for user input.)
|
||
*/
|
||
function insertBracket(state, bracket) {
|
||
let conf = config(state, state.selection.main.head);
|
||
let tokens = conf.brackets || defaults.brackets;
|
||
for (let tok of tokens) {
|
||
let closed = closing((0,state_.codePointAt)(tok, 0));
|
||
if (bracket == tok)
|
||
return closed == tok ? handleSame(state, tok, tokens.indexOf(tok + tok + tok) > -1, conf)
|
||
: handleOpen(state, tok, closed, conf.before || defaults.before);
|
||
if (bracket == closed && closedBracketAt(state, state.selection.main.from))
|
||
return handleClose(state, tok, closed);
|
||
}
|
||
return null;
|
||
}
|
||
function closedBracketAt(state, pos) {
|
||
let found = false;
|
||
state.field(bracketState).between(0, state.doc.length, from => {
|
||
if (from == pos)
|
||
found = true;
|
||
});
|
||
return found;
|
||
}
|
||
function nextChar(doc, pos) {
|
||
let next = doc.sliceString(pos, pos + 2);
|
||
return next.slice(0, (0,state_.codePointSize)((0,state_.codePointAt)(next, 0)));
|
||
}
|
||
function prevChar(doc, pos) {
|
||
let prev = doc.sliceString(pos - 2, pos);
|
||
return (0,state_.codePointSize)((0,state_.codePointAt)(prev, 0)) == prev.length ? prev : prev.slice(1);
|
||
}
|
||
function handleOpen(state, open, close, closeBefore) {
|
||
let dont = null, changes = state.changeByRange(range => {
|
||
if (!range.empty)
|
||
return { changes: [{ insert: open, from: range.from }, { insert: close, from: range.to }],
|
||
effects: closeBracketEffect.of(range.to + open.length),
|
||
range: state_.EditorSelection.range(range.anchor + open.length, range.head + open.length) };
|
||
let next = nextChar(state.doc, range.head);
|
||
if (!next || /\s/.test(next) || closeBefore.indexOf(next) > -1)
|
||
return { changes: { insert: open + close, from: range.head },
|
||
effects: closeBracketEffect.of(range.head + open.length),
|
||
range: state_.EditorSelection.cursor(range.head + open.length) };
|
||
return { range: dont = range };
|
||
});
|
||
return dont ? null : state.update(changes, {
|
||
scrollIntoView: true,
|
||
userEvent: "input.type"
|
||
});
|
||
}
|
||
function handleClose(state, _open, close) {
|
||
let dont = null, changes = state.changeByRange(range => {
|
||
if (range.empty && nextChar(state.doc, range.head) == close)
|
||
return { changes: { from: range.head, to: range.head + close.length, insert: close },
|
||
range: state_.EditorSelection.cursor(range.head + close.length) };
|
||
return dont = { range };
|
||
});
|
||
return dont ? null : state.update(changes, {
|
||
scrollIntoView: true,
|
||
userEvent: "input.type"
|
||
});
|
||
}
|
||
// Handles cases where the open and close token are the same, and
|
||
// possibly triple quotes (as in `"""abc"""`-style quoting).
|
||
function handleSame(state, token, allowTriple, config) {
|
||
let stringPrefixes = config.stringPrefixes || defaults.stringPrefixes;
|
||
let dont = null, changes = state.changeByRange(range => {
|
||
if (!range.empty)
|
||
return { changes: [{ insert: token, from: range.from }, { insert: token, from: range.to }],
|
||
effects: closeBracketEffect.of(range.to + token.length),
|
||
range: state_.EditorSelection.range(range.anchor + token.length, range.head + token.length) };
|
||
let pos = range.head, next = nextChar(state.doc, pos), start;
|
||
if (next == token) {
|
||
if (nodeStart(state, pos)) {
|
||
return { changes: { insert: token + token, from: pos },
|
||
effects: closeBracketEffect.of(pos + token.length),
|
||
range: state_.EditorSelection.cursor(pos + token.length) };
|
||
}
|
||
else if (closedBracketAt(state, pos)) {
|
||
let isTriple = allowTriple && state.sliceDoc(pos, pos + token.length * 3) == token + token + token;
|
||
let content = isTriple ? token + token + token : token;
|
||
return { changes: { from: pos, to: pos + content.length, insert: content },
|
||
range: state_.EditorSelection.cursor(pos + content.length) };
|
||
}
|
||
}
|
||
else if (allowTriple && state.sliceDoc(pos - 2 * token.length, pos) == token + token &&
|
||
(start = canStartStringAt(state, pos - 2 * token.length, stringPrefixes)) > -1 &&
|
||
nodeStart(state, start)) {
|
||
return { changes: { insert: token + token + token + token, from: pos },
|
||
effects: closeBracketEffect.of(pos + token.length),
|
||
range: state_.EditorSelection.cursor(pos + token.length) };
|
||
}
|
||
else if (state.charCategorizer(pos)(next) != state_.CharCategory.Word) {
|
||
if (canStartStringAt(state, pos, stringPrefixes) > -1 && !probablyInString(state, pos, token, stringPrefixes))
|
||
return { changes: { insert: token + token, from: pos },
|
||
effects: closeBracketEffect.of(pos + token.length),
|
||
range: state_.EditorSelection.cursor(pos + token.length) };
|
||
}
|
||
return { range: dont = range };
|
||
});
|
||
return dont ? null : state.update(changes, {
|
||
scrollIntoView: true,
|
||
userEvent: "input.type"
|
||
});
|
||
}
|
||
function nodeStart(state, pos) {
|
||
let tree = (0,language_dist/* syntaxTree */.mv)(state).resolveInner(pos + 1);
|
||
return tree.parent && tree.from == pos;
|
||
}
|
||
function probablyInString(state, pos, quoteToken, prefixes) {
|
||
let node = (0,language_dist/* syntaxTree */.mv)(state).resolveInner(pos, -1);
|
||
let maxPrefix = prefixes.reduce((m, p) => Math.max(m, p.length), 0);
|
||
for (let i = 0; i < 5; i++) {
|
||
let start = state.sliceDoc(node.from, Math.min(node.to, node.from + quoteToken.length + maxPrefix));
|
||
let quotePos = start.indexOf(quoteToken);
|
||
if (!quotePos || quotePos > -1 && prefixes.indexOf(start.slice(0, quotePos)) > -1) {
|
||
let first = node.firstChild;
|
||
while (first && first.from == node.from && first.to - first.from > quoteToken.length + quotePos) {
|
||
if (state.sliceDoc(first.to - quoteToken.length, first.to) == quoteToken)
|
||
return false;
|
||
first = first.firstChild;
|
||
}
|
||
return true;
|
||
}
|
||
let parent = node.to == pos && node.parent;
|
||
if (!parent)
|
||
break;
|
||
node = parent;
|
||
}
|
||
return false;
|
||
}
|
||
function canStartStringAt(state, pos, prefixes) {
|
||
let charCat = state.charCategorizer(pos);
|
||
if (charCat(state.sliceDoc(pos - 1, pos)) != state_.CharCategory.Word)
|
||
return pos;
|
||
for (let prefix of prefixes) {
|
||
let start = pos - prefix.length;
|
||
if (state.sliceDoc(start, pos) == prefix && charCat(state.sliceDoc(start - 1, start)) != state_.CharCategory.Word)
|
||
return start;
|
||
}
|
||
return -1;
|
||
}
|
||
|
||
/**
|
||
Returns an extension that enables autocompletion.
|
||
*/
|
||
function autocompletion(config = {}) {
|
||
return [
|
||
commitCharacters,
|
||
completionState,
|
||
completionConfig.of(config),
|
||
completionPlugin,
|
||
completionKeymapExt,
|
||
dist_baseTheme
|
||
];
|
||
}
|
||
/**
|
||
Basic keybindings for autocompletion.
|
||
|
||
- Ctrl-Space (and Alt-\` or Alt-i on macOS): [`startCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.startCompletion)
|
||
- Escape: [`closeCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.closeCompletion)
|
||
- ArrowDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true)`
|
||
- ArrowUp: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(false)`
|
||
- PageDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true, "page")`
|
||
- PageUp: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(false, "page")`
|
||
- Enter: [`acceptCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.acceptCompletion)
|
||
*/
|
||
const completionKeymap = [
|
||
{ key: "Ctrl-Space", run: startCompletion },
|
||
{ mac: "Alt-`", run: startCompletion },
|
||
{ mac: "Alt-i", run: startCompletion },
|
||
{ key: "Escape", run: closeCompletion },
|
||
{ key: "ArrowDown", run: /*@__PURE__*/moveCompletionSelection(true) },
|
||
{ key: "ArrowUp", run: /*@__PURE__*/moveCompletionSelection(false) },
|
||
{ key: "PageDown", run: /*@__PURE__*/moveCompletionSelection(true, "page") },
|
||
{ key: "PageUp", run: /*@__PURE__*/moveCompletionSelection(false, "page") },
|
||
{ key: "Enter", run: acceptCompletion }
|
||
];
|
||
const completionKeymapExt = /*@__PURE__*/state_.Prec.highest(/*@__PURE__*/view_.keymap.computeN([completionConfig], state => state.facet(completionConfig).defaultKeymap ? [completionKeymap] : []));
|
||
/**
|
||
Get the current completion status. When completions are available,
|
||
this will return `"active"`. When completions are pending (in the
|
||
process of being queried), this returns `"pending"`. Otherwise, it
|
||
returns `null`.
|
||
*/
|
||
function completionStatus(state) {
|
||
let cState = state.field(completionState, false);
|
||
return cState && cState.active.some(a => a.isPending) ? "pending"
|
||
: cState && cState.active.some(a => a.state != 0 /* State.Inactive */) ? "active" : null;
|
||
}
|
||
const completionArrayCache = /*@__PURE__*/new WeakMap;
|
||
/**
|
||
Returns the available completions as an array.
|
||
*/
|
||
function currentCompletions(state) {
|
||
var _a;
|
||
let open = (_a = state.field(completionState, false)) === null || _a === void 0 ? void 0 : _a.open;
|
||
if (!open || open.disabled)
|
||
return [];
|
||
let completions = completionArrayCache.get(open.options);
|
||
if (!completions)
|
||
completionArrayCache.set(open.options, completions = open.options.map(o => o.completion));
|
||
return completions;
|
||
}
|
||
/**
|
||
Return the currently selected completion, if any.
|
||
*/
|
||
function selectedCompletion(state) {
|
||
var _a;
|
||
let open = (_a = state.field(completionState, false)) === null || _a === void 0 ? void 0 : _a.open;
|
||
return open && !open.disabled && open.selected >= 0 ? open.options[open.selected].completion : null;
|
||
}
|
||
/**
|
||
Returns the currently selected position in the active completion
|
||
list, or null if no completions are active.
|
||
*/
|
||
function selectedCompletionIndex(state) {
|
||
var _a;
|
||
let open = (_a = state.field(completionState, false)) === null || _a === void 0 ? void 0 : _a.open;
|
||
return open && !open.disabled && open.selected >= 0 ? open.selected : null;
|
||
}
|
||
/**
|
||
Create an effect that can be attached to a transaction to change
|
||
the currently selected completion.
|
||
*/
|
||
function setSelectedCompletion(index) {
|
||
return setSelectedEffect.of(index);
|
||
}
|
||
|
||
|
||
|
||
;// ../node_modules/@codemirror/lint/dist/index.js
|
||
|
||
|
||
|
||
|
||
class SelectedDiagnostic {
|
||
constructor(from, to, diagnostic) {
|
||
this.from = from;
|
||
this.to = to;
|
||
this.diagnostic = diagnostic;
|
||
}
|
||
}
|
||
class LintState {
|
||
constructor(diagnostics, panel, selected) {
|
||
this.diagnostics = diagnostics;
|
||
this.panel = panel;
|
||
this.selected = selected;
|
||
}
|
||
static init(diagnostics, panel, state) {
|
||
// Filter the list of diagnostics for which to create markers
|
||
let diagnosticFilter = state.facet(lintConfig).markerFilter;
|
||
if (diagnosticFilter)
|
||
diagnostics = diagnosticFilter(diagnostics, state);
|
||
let sorted = diagnostics.slice().sort((a, b) => a.from - b.from || a.to - b.to);
|
||
let deco = new state_.RangeSetBuilder(), active = [], pos = 0;
|
||
let scan = state.doc.iter(), scanPos = 0, docLen = state.doc.length;
|
||
for (let i = 0;;) {
|
||
let next = i == sorted.length ? null : sorted[i];
|
||
if (!next && !active.length)
|
||
break;
|
||
let from, to;
|
||
if (active.length) {
|
||
from = pos;
|
||
to = active.reduce((p, d) => Math.min(p, d.to), next && next.from > from ? next.from : 1e8);
|
||
}
|
||
else {
|
||
from = next.from;
|
||
if (from > docLen)
|
||
break;
|
||
to = next.to;
|
||
active.push(next);
|
||
i++;
|
||
}
|
||
while (i < sorted.length) {
|
||
let next = sorted[i];
|
||
if (next.from == from && (next.to > next.from || next.to == from)) {
|
||
active.push(next);
|
||
i++;
|
||
to = Math.min(next.to, to);
|
||
}
|
||
else {
|
||
to = Math.min(next.from, to);
|
||
break;
|
||
}
|
||
}
|
||
to = Math.min(to, docLen);
|
||
let widget = false;
|
||
if (active.some(d => d.from == from && (d.to == to || to == docLen))) {
|
||
widget = from == to;
|
||
if (!widget && to - from < 10) {
|
||
let behind = from - (scanPos + scan.value.length);
|
||
if (behind > 0) {
|
||
scan.next(behind);
|
||
scanPos = from;
|
||
}
|
||
for (let check = from;;) {
|
||
if (check >= to) {
|
||
widget = true;
|
||
break;
|
||
}
|
||
if (!scan.lineBreak && scanPos + scan.value.length > check)
|
||
break;
|
||
check = scanPos + scan.value.length;
|
||
scanPos += scan.value.length;
|
||
scan.next();
|
||
}
|
||
}
|
||
}
|
||
let sev = maxSeverity(active);
|
||
if (widget) {
|
||
deco.add(from, from, view_.Decoration.widget({
|
||
widget: new DiagnosticWidget(sev),
|
||
diagnostics: active.slice()
|
||
}));
|
||
}
|
||
else {
|
||
let markClass = active.reduce((c, d) => d.markClass ? c + " " + d.markClass : c, "");
|
||
deco.add(from, to, view_.Decoration.mark({
|
||
class: "cm-lintRange cm-lintRange-" + sev + markClass,
|
||
diagnostics: active.slice(),
|
||
inclusiveEnd: active.some(a => a.to > to)
|
||
}));
|
||
}
|
||
pos = to;
|
||
if (pos == docLen)
|
||
break;
|
||
for (let i = 0; i < active.length; i++)
|
||
if (active[i].to <= pos)
|
||
active.splice(i--, 1);
|
||
}
|
||
let set = deco.finish();
|
||
return new LintState(set, panel, findDiagnostic(set));
|
||
}
|
||
}
|
||
function findDiagnostic(diagnostics, diagnostic = null, after = 0) {
|
||
let found = null;
|
||
diagnostics.between(after, 1e9, (from, to, { spec }) => {
|
||
if (diagnostic && spec.diagnostics.indexOf(diagnostic) < 0)
|
||
return;
|
||
if (!found)
|
||
found = new SelectedDiagnostic(from, to, diagnostic || spec.diagnostics[0]);
|
||
else if (spec.diagnostics.indexOf(found.diagnostic) < 0)
|
||
return false;
|
||
else
|
||
found = new SelectedDiagnostic(found.from, to, found.diagnostic);
|
||
});
|
||
return found;
|
||
}
|
||
function hideTooltip(tr, tooltip) {
|
||
let from = tooltip.pos, to = tooltip.end || from;
|
||
let result = tr.state.facet(lintConfig).hideOn(tr, from, to);
|
||
if (result != null)
|
||
return result;
|
||
let line = tr.startState.doc.lineAt(tooltip.pos);
|
||
return !!(tr.effects.some(e => e.is(setDiagnosticsEffect)) || tr.changes.touchesRange(line.from, Math.max(line.to, to)));
|
||
}
|
||
function maybeEnableLint(state, effects) {
|
||
return state.field(lintState, false) ? effects : effects.concat(state_.StateEffect.appendConfig.of(lintExtensions));
|
||
}
|
||
/**
|
||
Returns a transaction spec which updates the current set of
|
||
diagnostics, and enables the lint extension if if wasn't already
|
||
active.
|
||
*/
|
||
function setDiagnostics(state, diagnostics) {
|
||
return {
|
||
effects: maybeEnableLint(state, [setDiagnosticsEffect.of(diagnostics)])
|
||
};
|
||
}
|
||
/**
|
||
The state effect that updates the set of active diagnostics. Can
|
||
be useful when writing an extension that needs to track these.
|
||
*/
|
||
const setDiagnosticsEffect = /*@__PURE__*/state_.StateEffect.define();
|
||
const dist_togglePanel = /*@__PURE__*/state_.StateEffect.define();
|
||
const movePanelSelection = /*@__PURE__*/state_.StateEffect.define();
|
||
const lintState = /*@__PURE__*/state_.StateField.define({
|
||
create() {
|
||
return new LintState(view_.Decoration.none, null, null);
|
||
},
|
||
update(value, tr) {
|
||
if (tr.docChanged && value.diagnostics.size) {
|
||
let mapped = value.diagnostics.map(tr.changes), selected = null, panel = value.panel;
|
||
if (value.selected) {
|
||
let selPos = tr.changes.mapPos(value.selected.from, 1);
|
||
selected = findDiagnostic(mapped, value.selected.diagnostic, selPos) || findDiagnostic(mapped, null, selPos);
|
||
}
|
||
if (!mapped.size && panel && tr.state.facet(lintConfig).autoPanel)
|
||
panel = null;
|
||
value = new LintState(mapped, panel, selected);
|
||
}
|
||
for (let effect of tr.effects) {
|
||
if (effect.is(setDiagnosticsEffect)) {
|
||
let panel = !tr.state.facet(lintConfig).autoPanel ? value.panel : effect.value.length ? LintPanel.open : null;
|
||
value = LintState.init(effect.value, panel, tr.state);
|
||
}
|
||
else if (effect.is(dist_togglePanel)) {
|
||
value = new LintState(value.diagnostics, effect.value ? LintPanel.open : null, value.selected);
|
||
}
|
||
else if (effect.is(movePanelSelection)) {
|
||
value = new LintState(value.diagnostics, value.panel, effect.value);
|
||
}
|
||
}
|
||
return value;
|
||
},
|
||
provide: f => [view_.showPanel.from(f, val => val.panel),
|
||
view_.EditorView.decorations.from(f, s => s.diagnostics)]
|
||
});
|
||
/**
|
||
Returns the number of active lint diagnostics in the given state.
|
||
*/
|
||
function diagnosticCount(state) {
|
||
let lint = state.field(lintState, false);
|
||
return lint ? lint.diagnostics.size : 0;
|
||
}
|
||
const activeMark = /*@__PURE__*/view_.Decoration.mark({ class: "cm-lintRange cm-lintRange-active" });
|
||
function lintTooltip(view, pos, side) {
|
||
let { diagnostics } = view.state.field(lintState);
|
||
let found, start = -1, end = -1;
|
||
diagnostics.between(pos - (side < 0 ? 1 : 0), pos + (side > 0 ? 1 : 0), (from, to, { spec }) => {
|
||
if (pos >= from && pos <= to &&
|
||
(from == to || ((pos > from || side > 0) && (pos < to || side < 0)))) {
|
||
found = spec.diagnostics;
|
||
start = from;
|
||
end = to;
|
||
return false;
|
||
}
|
||
});
|
||
let diagnosticFilter = view.state.facet(lintConfig).tooltipFilter;
|
||
if (found && diagnosticFilter)
|
||
found = diagnosticFilter(found, view.state);
|
||
if (!found)
|
||
return null;
|
||
return {
|
||
pos: start,
|
||
end: end,
|
||
above: view.state.doc.lineAt(start).to < end,
|
||
create() {
|
||
return { dom: diagnosticsTooltip(view, found) };
|
||
}
|
||
};
|
||
}
|
||
function diagnosticsTooltip(view, diagnostics) {
|
||
return crelt("ul", { class: "cm-tooltip-lint" }, diagnostics.map(d => renderDiagnostic(view, d, false)));
|
||
}
|
||
/**
|
||
Command to open and focus the lint panel.
|
||
*/
|
||
const openLintPanel = (view) => {
|
||
let field = view.state.field(lintState, false);
|
||
if (!field || !field.panel)
|
||
view.dispatch({ effects: maybeEnableLint(view.state, [dist_togglePanel.of(true)]) });
|
||
let panel = (0,view_.getPanel)(view, LintPanel.open);
|
||
if (panel)
|
||
panel.dom.querySelector(".cm-panel-lint ul").focus();
|
||
return true;
|
||
};
|
||
/**
|
||
Command to close the lint panel, when open.
|
||
*/
|
||
const closeLintPanel = (view) => {
|
||
let field = view.state.field(lintState, false);
|
||
if (!field || !field.panel)
|
||
return false;
|
||
view.dispatch({ effects: dist_togglePanel.of(false) });
|
||
return true;
|
||
};
|
||
/**
|
||
Move the selection to the next diagnostic.
|
||
*/
|
||
const nextDiagnostic = (view) => {
|
||
let field = view.state.field(lintState, false);
|
||
if (!field)
|
||
return false;
|
||
let sel = view.state.selection.main, next = field.diagnostics.iter(sel.to + 1);
|
||
if (!next.value) {
|
||
next = field.diagnostics.iter(0);
|
||
if (!next.value || next.from == sel.from && next.to == sel.to)
|
||
return false;
|
||
}
|
||
view.dispatch({ selection: { anchor: next.from, head: next.to }, scrollIntoView: true });
|
||
return true;
|
||
};
|
||
/**
|
||
Move the selection to the previous diagnostic.
|
||
*/
|
||
const previousDiagnostic = (view) => {
|
||
let { state } = view, field = state.field(lintState, false);
|
||
if (!field)
|
||
return false;
|
||
let sel = state.selection.main;
|
||
let prevFrom, prevTo, lastFrom, lastTo;
|
||
field.diagnostics.between(0, state.doc.length, (from, to) => {
|
||
if (to < sel.to && (prevFrom == null || prevFrom < from)) {
|
||
prevFrom = from;
|
||
prevTo = to;
|
||
}
|
||
if (lastFrom == null || from > lastFrom) {
|
||
lastFrom = from;
|
||
lastTo = to;
|
||
}
|
||
});
|
||
if (lastFrom == null || prevFrom == null && lastFrom == sel.from)
|
||
return false;
|
||
view.dispatch({ selection: { anchor: prevFrom !== null && prevFrom !== void 0 ? prevFrom : lastFrom, head: prevTo !== null && prevTo !== void 0 ? prevTo : lastTo }, scrollIntoView: true });
|
||
return true;
|
||
};
|
||
/**
|
||
A set of default key bindings for the lint functionality.
|
||
|
||
- Ctrl-Shift-m (Cmd-Shift-m on macOS): [`openLintPanel`](https://codemirror.net/6/docs/ref/#lint.openLintPanel)
|
||
- F8: [`nextDiagnostic`](https://codemirror.net/6/docs/ref/#lint.nextDiagnostic)
|
||
*/
|
||
const lintKeymap = [
|
||
{ key: "Mod-Shift-m", run: openLintPanel, preventDefault: true },
|
||
{ key: "F8", run: nextDiagnostic }
|
||
];
|
||
const lintPlugin = /*@__PURE__*/(/* unused pure expression or super */ null && (ViewPlugin.fromClass(class {
|
||
constructor(view) {
|
||
this.view = view;
|
||
this.timeout = -1;
|
||
this.set = true;
|
||
let { delay } = view.state.facet(lintConfig);
|
||
this.lintTime = Date.now() + delay;
|
||
this.run = this.run.bind(this);
|
||
this.timeout = setTimeout(this.run, delay);
|
||
}
|
||
run() {
|
||
clearTimeout(this.timeout);
|
||
let now = Date.now();
|
||
if (now < this.lintTime - 10) {
|
||
this.timeout = setTimeout(this.run, this.lintTime - now);
|
||
}
|
||
else {
|
||
this.set = false;
|
||
let { state } = this.view, { sources } = state.facet(lintConfig);
|
||
if (sources.length)
|
||
batchResults(sources.map(s => Promise.resolve(s(this.view))), annotations => {
|
||
if (this.view.state.doc == state.doc)
|
||
this.view.dispatch(setDiagnostics(this.view.state, annotations.reduce((a, b) => a.concat(b))));
|
||
}, error => { logException(this.view.state, error); });
|
||
}
|
||
}
|
||
update(update) {
|
||
let config = update.state.facet(lintConfig);
|
||
if (update.docChanged || config != update.startState.facet(lintConfig) ||
|
||
config.needsRefresh && config.needsRefresh(update)) {
|
||
this.lintTime = Date.now() + config.delay;
|
||
if (!this.set) {
|
||
this.set = true;
|
||
this.timeout = setTimeout(this.run, config.delay);
|
||
}
|
||
}
|
||
}
|
||
force() {
|
||
if (this.set) {
|
||
this.lintTime = Date.now();
|
||
this.run();
|
||
}
|
||
}
|
||
destroy() {
|
||
clearTimeout(this.timeout);
|
||
}
|
||
})));
|
||
function batchResults(promises, sink, error) {
|
||
let collected = [], timeout = -1;
|
||
for (let p of promises)
|
||
p.then(value => {
|
||
collected.push(value);
|
||
clearTimeout(timeout);
|
||
if (collected.length == promises.length)
|
||
sink(collected);
|
||
else
|
||
timeout = setTimeout(() => sink(collected), 200);
|
||
}, error);
|
||
}
|
||
const lintConfig = /*@__PURE__*/state_.Facet.define({
|
||
combine(input) {
|
||
return {
|
||
sources: input.map(i => i.source).filter(x => x != null),
|
||
...(0,state_.combineConfig)(input.map(i => i.config), {
|
||
delay: 750,
|
||
markerFilter: null,
|
||
tooltipFilter: null,
|
||
needsRefresh: null,
|
||
hideOn: () => null,
|
||
}, {
|
||
delay: Math.max,
|
||
markerFilter: combineFilter,
|
||
tooltipFilter: combineFilter,
|
||
needsRefresh: (a, b) => !a ? b : !b ? a : u => a(u) || b(u),
|
||
hideOn: (a, b) => !a ? b : !b ? a : (t, x, y) => a(t, x, y) || b(t, x, y),
|
||
autoPanel: (a, b) => a || b
|
||
})
|
||
};
|
||
}
|
||
});
|
||
function combineFilter(a, b) {
|
||
return !a ? b : !b ? a : (d, s) => b(a(d, s), s);
|
||
}
|
||
/**
|
||
Given a diagnostic source, this function returns an extension that
|
||
enables linting with that source. It will be called whenever the
|
||
editor is idle (after its content changed).
|
||
|
||
Note that settings given here will apply to all linters active in
|
||
the editor. If `null` is given as source, this only configures the
|
||
lint extension.
|
||
*/
|
||
function linter(source, config = {}) {
|
||
return [
|
||
lintConfig.of({ source, config }),
|
||
lintPlugin,
|
||
lintExtensions
|
||
];
|
||
}
|
||
/**
|
||
Forces any linters [configured](https://codemirror.net/6/docs/ref/#lint.linter) to run when the
|
||
editor is idle to run right away.
|
||
*/
|
||
function forceLinting(view) {
|
||
let plugin = view.plugin(lintPlugin);
|
||
if (plugin)
|
||
plugin.force();
|
||
}
|
||
function assignKeys(actions) {
|
||
let assigned = [];
|
||
if (actions)
|
||
actions: for (let { name } of actions) {
|
||
for (let i = 0; i < name.length; i++) {
|
||
let ch = name[i];
|
||
if (/[a-zA-Z]/.test(ch) && !assigned.some(c => c.toLowerCase() == ch.toLowerCase())) {
|
||
assigned.push(ch);
|
||
continue actions;
|
||
}
|
||
}
|
||
assigned.push("");
|
||
}
|
||
return assigned;
|
||
}
|
||
function renderDiagnostic(view, diagnostic, inPanel) {
|
||
var _a;
|
||
let keys = inPanel ? assignKeys(diagnostic.actions) : [];
|
||
return crelt("li", { class: "cm-diagnostic cm-diagnostic-" + diagnostic.severity }, crelt("span", { class: "cm-diagnosticText" }, diagnostic.renderMessage ? diagnostic.renderMessage(view) : diagnostic.message), (_a = diagnostic.actions) === null || _a === void 0 ? void 0 : _a.map((action, i) => {
|
||
let fired = false, click = (e) => {
|
||
e.preventDefault();
|
||
if (fired)
|
||
return;
|
||
fired = true;
|
||
let found = findDiagnostic(view.state.field(lintState).diagnostics, diagnostic);
|
||
if (found)
|
||
action.apply(view, found.from, found.to);
|
||
};
|
||
let { name } = action, keyIndex = keys[i] ? name.indexOf(keys[i]) : -1;
|
||
let nameElt = keyIndex < 0 ? name : [name.slice(0, keyIndex),
|
||
crelt("u", name.slice(keyIndex, keyIndex + 1)),
|
||
name.slice(keyIndex + 1)];
|
||
let markClass = action.markClass ? " " + action.markClass : "";
|
||
return crelt("button", {
|
||
type: "button",
|
||
class: "cm-diagnosticAction" + markClass,
|
||
onclick: click,
|
||
onmousedown: click,
|
||
"aria-label": ` Action: ${name}${keyIndex < 0 ? "" : ` (access key "${keys[i]})"`}.`
|
||
}, nameElt);
|
||
}), diagnostic.source && crelt("div", { class: "cm-diagnosticSource" }, diagnostic.source));
|
||
}
|
||
class DiagnosticWidget extends view_.WidgetType {
|
||
constructor(sev) {
|
||
super();
|
||
this.sev = sev;
|
||
}
|
||
eq(other) { return other.sev == this.sev; }
|
||
toDOM() {
|
||
return crelt("span", { class: "cm-lintPoint cm-lintPoint-" + this.sev });
|
||
}
|
||
}
|
||
class PanelItem {
|
||
constructor(view, diagnostic) {
|
||
this.diagnostic = diagnostic;
|
||
this.id = "item_" + Math.floor(Math.random() * 0xffffffff).toString(16);
|
||
this.dom = renderDiagnostic(view, diagnostic, true);
|
||
this.dom.id = this.id;
|
||
this.dom.setAttribute("role", "option");
|
||
}
|
||
}
|
||
class LintPanel {
|
||
constructor(view) {
|
||
this.view = view;
|
||
this.items = [];
|
||
let onkeydown = (event) => {
|
||
if (event.keyCode == 27) { // Escape
|
||
closeLintPanel(this.view);
|
||
this.view.focus();
|
||
}
|
||
else if (event.keyCode == 38 || event.keyCode == 33) { // ArrowUp, PageUp
|
||
this.moveSelection((this.selectedIndex - 1 + this.items.length) % this.items.length);
|
||
}
|
||
else if (event.keyCode == 40 || event.keyCode == 34) { // ArrowDown, PageDown
|
||
this.moveSelection((this.selectedIndex + 1) % this.items.length);
|
||
}
|
||
else if (event.keyCode == 36) { // Home
|
||
this.moveSelection(0);
|
||
}
|
||
else if (event.keyCode == 35) { // End
|
||
this.moveSelection(this.items.length - 1);
|
||
}
|
||
else if (event.keyCode == 13) { // Enter
|
||
this.view.focus();
|
||
}
|
||
else if (event.keyCode >= 65 && event.keyCode <= 90 && this.selectedIndex >= 0) { // A-Z
|
||
let { diagnostic } = this.items[this.selectedIndex], keys = assignKeys(diagnostic.actions);
|
||
for (let i = 0; i < keys.length; i++)
|
||
if (keys[i].toUpperCase().charCodeAt(0) == event.keyCode) {
|
||
let found = findDiagnostic(this.view.state.field(lintState).diagnostics, diagnostic);
|
||
if (found)
|
||
diagnostic.actions[i].apply(view, found.from, found.to);
|
||
}
|
||
}
|
||
else {
|
||
return;
|
||
}
|
||
event.preventDefault();
|
||
};
|
||
let onclick = (event) => {
|
||
for (let i = 0; i < this.items.length; i++) {
|
||
if (this.items[i].dom.contains(event.target))
|
||
this.moveSelection(i);
|
||
}
|
||
};
|
||
this.list = crelt("ul", {
|
||
tabIndex: 0,
|
||
role: "listbox",
|
||
"aria-label": this.view.state.phrase("Diagnostics"),
|
||
onkeydown,
|
||
onclick
|
||
});
|
||
this.dom = crelt("div", { class: "cm-panel-lint" }, this.list, crelt("button", {
|
||
type: "button",
|
||
name: "close",
|
||
"aria-label": this.view.state.phrase("close"),
|
||
onclick: () => closeLintPanel(this.view)
|
||
}, "×"));
|
||
this.update();
|
||
}
|
||
get selectedIndex() {
|
||
let selected = this.view.state.field(lintState).selected;
|
||
if (!selected)
|
||
return -1;
|
||
for (let i = 0; i < this.items.length; i++)
|
||
if (this.items[i].diagnostic == selected.diagnostic)
|
||
return i;
|
||
return -1;
|
||
}
|
||
update() {
|
||
let { diagnostics, selected } = this.view.state.field(lintState);
|
||
let i = 0, needsSync = false, newSelectedItem = null;
|
||
let seen = new Set();
|
||
diagnostics.between(0, this.view.state.doc.length, (_start, _end, { spec }) => {
|
||
for (let diagnostic of spec.diagnostics) {
|
||
if (seen.has(diagnostic))
|
||
continue;
|
||
seen.add(diagnostic);
|
||
let found = -1, item;
|
||
for (let j = i; j < this.items.length; j++)
|
||
if (this.items[j].diagnostic == diagnostic) {
|
||
found = j;
|
||
break;
|
||
}
|
||
if (found < 0) {
|
||
item = new PanelItem(this.view, diagnostic);
|
||
this.items.splice(i, 0, item);
|
||
needsSync = true;
|
||
}
|
||
else {
|
||
item = this.items[found];
|
||
if (found > i) {
|
||
this.items.splice(i, found - i);
|
||
needsSync = true;
|
||
}
|
||
}
|
||
if (selected && item.diagnostic == selected.diagnostic) {
|
||
if (!item.dom.hasAttribute("aria-selected")) {
|
||
item.dom.setAttribute("aria-selected", "true");
|
||
newSelectedItem = item;
|
||
}
|
||
}
|
||
else if (item.dom.hasAttribute("aria-selected")) {
|
||
item.dom.removeAttribute("aria-selected");
|
||
}
|
||
i++;
|
||
}
|
||
});
|
||
while (i < this.items.length && !(this.items.length == 1 && this.items[0].diagnostic.from < 0)) {
|
||
needsSync = true;
|
||
this.items.pop();
|
||
}
|
||
if (this.items.length == 0) {
|
||
this.items.push(new PanelItem(this.view, {
|
||
from: -1, to: -1,
|
||
severity: "info",
|
||
message: this.view.state.phrase("No diagnostics")
|
||
}));
|
||
needsSync = true;
|
||
}
|
||
if (newSelectedItem) {
|
||
this.list.setAttribute("aria-activedescendant", newSelectedItem.id);
|
||
this.view.requestMeasure({
|
||
key: this,
|
||
read: () => ({ sel: newSelectedItem.dom.getBoundingClientRect(), panel: this.list.getBoundingClientRect() }),
|
||
write: ({ sel, panel }) => {
|
||
let scaleY = panel.height / this.list.offsetHeight;
|
||
if (sel.top < panel.top)
|
||
this.list.scrollTop -= (panel.top - sel.top) / scaleY;
|
||
else if (sel.bottom > panel.bottom)
|
||
this.list.scrollTop += (sel.bottom - panel.bottom) / scaleY;
|
||
}
|
||
});
|
||
}
|
||
else if (this.selectedIndex < 0) {
|
||
this.list.removeAttribute("aria-activedescendant");
|
||
}
|
||
if (needsSync)
|
||
this.sync();
|
||
}
|
||
sync() {
|
||
let domPos = this.list.firstChild;
|
||
function rm() {
|
||
let prev = domPos;
|
||
domPos = prev.nextSibling;
|
||
prev.remove();
|
||
}
|
||
for (let item of this.items) {
|
||
if (item.dom.parentNode == this.list) {
|
||
while (domPos != item.dom)
|
||
rm();
|
||
domPos = item.dom.nextSibling;
|
||
}
|
||
else {
|
||
this.list.insertBefore(item.dom, domPos);
|
||
}
|
||
}
|
||
while (domPos)
|
||
rm();
|
||
}
|
||
moveSelection(selectedIndex) {
|
||
if (this.selectedIndex < 0)
|
||
return;
|
||
let field = this.view.state.field(lintState);
|
||
let selection = findDiagnostic(field.diagnostics, this.items[selectedIndex].diagnostic);
|
||
if (!selection)
|
||
return;
|
||
this.view.dispatch({
|
||
selection: { anchor: selection.from, head: selection.to },
|
||
scrollIntoView: true,
|
||
effects: movePanelSelection.of(selection)
|
||
});
|
||
}
|
||
static open(view) { return new LintPanel(view); }
|
||
}
|
||
function svg(content, attrs = `viewBox="0 0 40 40"`) {
|
||
return `url('data:image/svg+xml,<svg xmlns="http://www.w3.org/2000/svg" ${attrs}>${encodeURIComponent(content)}</svg>')`;
|
||
}
|
||
function underline(color) {
|
||
return svg(`<path d="m0 2.5 l2 -1.5 l1 0 l2 1.5 l1 0" stroke="${color}" fill="none" stroke-width=".7"/>`, `width="6" height="3"`);
|
||
}
|
||
const lint_dist_baseTheme = /*@__PURE__*/view_.EditorView.baseTheme({
|
||
".cm-diagnostic": {
|
||
padding: "3px 6px 3px 8px",
|
||
marginLeft: "-1px",
|
||
display: "block",
|
||
whiteSpace: "pre-wrap"
|
||
},
|
||
".cm-diagnostic-error": { borderLeft: "5px solid #d11" },
|
||
".cm-diagnostic-warning": { borderLeft: "5px solid orange" },
|
||
".cm-diagnostic-info": { borderLeft: "5px solid #999" },
|
||
".cm-diagnostic-hint": { borderLeft: "5px solid #66d" },
|
||
".cm-diagnosticAction": {
|
||
font: "inherit",
|
||
border: "none",
|
||
padding: "2px 4px",
|
||
backgroundColor: "#444",
|
||
color: "white",
|
||
borderRadius: "3px",
|
||
marginLeft: "8px",
|
||
cursor: "pointer"
|
||
},
|
||
".cm-diagnosticSource": {
|
||
fontSize: "70%",
|
||
opacity: .7
|
||
},
|
||
".cm-lintRange": {
|
||
backgroundPosition: "left bottom",
|
||
backgroundRepeat: "repeat-x",
|
||
paddingBottom: "0.7px",
|
||
},
|
||
".cm-lintRange-error": { backgroundImage: /*@__PURE__*/underline("#d11") },
|
||
".cm-lintRange-warning": { backgroundImage: /*@__PURE__*/underline("orange") },
|
||
".cm-lintRange-info": { backgroundImage: /*@__PURE__*/underline("#999") },
|
||
".cm-lintRange-hint": { backgroundImage: /*@__PURE__*/underline("#66d") },
|
||
".cm-lintRange-active": { backgroundColor: "#ffdd9980" },
|
||
".cm-tooltip-lint": {
|
||
padding: 0,
|
||
margin: 0
|
||
},
|
||
".cm-lintPoint": {
|
||
position: "relative",
|
||
"&:after": {
|
||
content: '""',
|
||
position: "absolute",
|
||
bottom: 0,
|
||
left: "-2px",
|
||
borderLeft: "3px solid transparent",
|
||
borderRight: "3px solid transparent",
|
||
borderBottom: "4px solid #d11"
|
||
}
|
||
},
|
||
".cm-lintPoint-warning": {
|
||
"&:after": { borderBottomColor: "orange" }
|
||
},
|
||
".cm-lintPoint-info": {
|
||
"&:after": { borderBottomColor: "#999" }
|
||
},
|
||
".cm-lintPoint-hint": {
|
||
"&:after": { borderBottomColor: "#66d" }
|
||
},
|
||
".cm-panel.cm-panel-lint": {
|
||
position: "relative",
|
||
"& ul": {
|
||
maxHeight: "100px",
|
||
overflowY: "auto",
|
||
"& [aria-selected]": {
|
||
backgroundColor: "#ddd",
|
||
"& u": { textDecoration: "underline" }
|
||
},
|
||
"&:focus [aria-selected]": {
|
||
background_fallback: "#bdf",
|
||
backgroundColor: "Highlight",
|
||
color_fallback: "white",
|
||
color: "HighlightText"
|
||
},
|
||
"& u": { textDecoration: "none" },
|
||
padding: 0,
|
||
margin: 0
|
||
},
|
||
"& [name=close]": {
|
||
position: "absolute",
|
||
top: "0",
|
||
right: "2px",
|
||
background: "inherit",
|
||
border: "none",
|
||
font: "inherit",
|
||
padding: 0,
|
||
margin: 0
|
||
}
|
||
}
|
||
});
|
||
function severityWeight(sev) {
|
||
return sev == "error" ? 4 : sev == "warning" ? 3 : sev == "info" ? 2 : 1;
|
||
}
|
||
function maxSeverity(diagnostics) {
|
||
let sev = "hint", weight = 1;
|
||
for (let d of diagnostics) {
|
||
let w = severityWeight(d.severity);
|
||
if (w > weight) {
|
||
weight = w;
|
||
sev = d.severity;
|
||
}
|
||
}
|
||
return sev;
|
||
}
|
||
class LintGutterMarker extends view_.GutterMarker {
|
||
constructor(diagnostics) {
|
||
super();
|
||
this.diagnostics = diagnostics;
|
||
this.severity = maxSeverity(diagnostics);
|
||
}
|
||
toDOM(view) {
|
||
let elt = document.createElement("div");
|
||
elt.className = "cm-lint-marker cm-lint-marker-" + this.severity;
|
||
let diagnostics = this.diagnostics;
|
||
let diagnosticsFilter = view.state.facet(lintGutterConfig).tooltipFilter;
|
||
if (diagnosticsFilter)
|
||
diagnostics = diagnosticsFilter(diagnostics, view.state);
|
||
if (diagnostics.length)
|
||
elt.onmouseover = () => gutterMarkerMouseOver(view, elt, diagnostics);
|
||
return elt;
|
||
}
|
||
}
|
||
function trackHoverOn(view, marker) {
|
||
let mousemove = (event) => {
|
||
let rect = marker.getBoundingClientRect();
|
||
if (event.clientX > rect.left - 10 /* Hover.Margin */ && event.clientX < rect.right + 10 /* Hover.Margin */ &&
|
||
event.clientY > rect.top - 10 /* Hover.Margin */ && event.clientY < rect.bottom + 10 /* Hover.Margin */)
|
||
return;
|
||
for (let target = event.target; target; target = target.parentNode) {
|
||
if (target.nodeType == 1 && target.classList.contains("cm-tooltip-lint"))
|
||
return;
|
||
}
|
||
window.removeEventListener("mousemove", mousemove);
|
||
if (view.state.field(lintGutterTooltip))
|
||
view.dispatch({ effects: setLintGutterTooltip.of(null) });
|
||
};
|
||
window.addEventListener("mousemove", mousemove);
|
||
}
|
||
function gutterMarkerMouseOver(view, marker, diagnostics) {
|
||
function hovered() {
|
||
let line = view.elementAtHeight(marker.getBoundingClientRect().top + 5 - view.documentTop);
|
||
const linePos = view.coordsAtPos(line.from);
|
||
if (linePos) {
|
||
view.dispatch({ effects: setLintGutterTooltip.of({
|
||
pos: line.from,
|
||
above: false,
|
||
clip: false,
|
||
create() {
|
||
return {
|
||
dom: diagnosticsTooltip(view, diagnostics),
|
||
getCoords: () => marker.getBoundingClientRect()
|
||
};
|
||
}
|
||
}) });
|
||
}
|
||
marker.onmouseout = marker.onmousemove = null;
|
||
trackHoverOn(view, marker);
|
||
}
|
||
let { hoverTime } = view.state.facet(lintGutterConfig);
|
||
let hoverTimeout = setTimeout(hovered, hoverTime);
|
||
marker.onmouseout = () => {
|
||
clearTimeout(hoverTimeout);
|
||
marker.onmouseout = marker.onmousemove = null;
|
||
};
|
||
marker.onmousemove = () => {
|
||
clearTimeout(hoverTimeout);
|
||
hoverTimeout = setTimeout(hovered, hoverTime);
|
||
};
|
||
}
|
||
function markersForDiagnostics(doc, diagnostics) {
|
||
let byLine = Object.create(null);
|
||
for (let diagnostic of diagnostics) {
|
||
let line = doc.lineAt(diagnostic.from);
|
||
(byLine[line.from] || (byLine[line.from] = [])).push(diagnostic);
|
||
}
|
||
let markers = [];
|
||
for (let line in byLine) {
|
||
markers.push(new LintGutterMarker(byLine[line]).range(+line));
|
||
}
|
||
return state_.RangeSet.of(markers, true);
|
||
}
|
||
const lintGutterExtension = /*@__PURE__*/(0,view_.gutter)({
|
||
class: "cm-gutter-lint",
|
||
markers: view => view.state.field(lintGutterMarkers),
|
||
widgetMarker: (view, widget, block) => {
|
||
let diagnostics = [];
|
||
view.state.field(lintGutterMarkers).between(block.from, block.to, (from, to, value) => {
|
||
if (from > block.from && from < block.to)
|
||
diagnostics.push(...value.diagnostics);
|
||
});
|
||
return diagnostics.length ? new LintGutterMarker(diagnostics) : null;
|
||
}
|
||
});
|
||
const lintGutterMarkers = /*@__PURE__*/state_.StateField.define({
|
||
create() {
|
||
return state_.RangeSet.empty;
|
||
},
|
||
update(markers, tr) {
|
||
markers = markers.map(tr.changes);
|
||
let diagnosticFilter = tr.state.facet(lintGutterConfig).markerFilter;
|
||
for (let effect of tr.effects) {
|
||
if (effect.is(setDiagnosticsEffect)) {
|
||
let diagnostics = effect.value;
|
||
if (diagnosticFilter)
|
||
diagnostics = diagnosticFilter(diagnostics || [], tr.state);
|
||
markers = markersForDiagnostics(tr.state.doc, diagnostics.slice(0));
|
||
}
|
||
}
|
||
return markers;
|
||
}
|
||
});
|
||
const setLintGutterTooltip = /*@__PURE__*/state_.StateEffect.define();
|
||
const lintGutterTooltip = /*@__PURE__*/state_.StateField.define({
|
||
create() { return null; },
|
||
update(tooltip, tr) {
|
||
if (tooltip && tr.docChanged)
|
||
tooltip = hideTooltip(tr, tooltip) ? null : { ...tooltip, pos: tr.changes.mapPos(tooltip.pos) };
|
||
return tr.effects.reduce((t, e) => e.is(setLintGutterTooltip) ? e.value : t, tooltip);
|
||
},
|
||
provide: field => view_.showTooltip.from(field)
|
||
});
|
||
const lintGutterTheme = /*@__PURE__*/view_.EditorView.baseTheme({
|
||
".cm-gutter-lint": {
|
||
width: "1.4em",
|
||
"& .cm-gutterElement": {
|
||
padding: ".2em"
|
||
}
|
||
},
|
||
".cm-lint-marker": {
|
||
width: "1em",
|
||
height: "1em"
|
||
},
|
||
".cm-lint-marker-info": {
|
||
content: /*@__PURE__*/svg(`<path fill="#aaf" stroke="#77e" stroke-width="6" stroke-linejoin="round" d="M5 5L35 5L35 35L5 35Z"/>`)
|
||
},
|
||
".cm-lint-marker-warning": {
|
||
content: /*@__PURE__*/svg(`<path fill="#fe8" stroke="#fd7" stroke-width="6" stroke-linejoin="round" d="M20 6L37 35L3 35Z"/>`),
|
||
},
|
||
".cm-lint-marker-error": {
|
||
content: /*@__PURE__*/svg(`<circle cx="20" cy="20" r="15" fill="#f87" stroke="#f43" stroke-width="6"/>`)
|
||
},
|
||
});
|
||
const lintExtensions = [
|
||
lintState,
|
||
/*@__PURE__*/view_.EditorView.decorations.compute([lintState], state => {
|
||
let { selected, panel } = state.field(lintState);
|
||
return !selected || !panel || selected.from == selected.to ? view_.Decoration.none : view_.Decoration.set([
|
||
activeMark.range(selected.from, selected.to)
|
||
]);
|
||
}),
|
||
/*@__PURE__*/(0,view_.hoverTooltip)(lintTooltip, { hideOn: hideTooltip }),
|
||
lint_dist_baseTheme
|
||
];
|
||
const lintGutterConfig = /*@__PURE__*/state_.Facet.define({
|
||
combine(configs) {
|
||
return (0,state_.combineConfig)(configs, {
|
||
hoverTime: 300 /* Hover.Time */,
|
||
markerFilter: null,
|
||
tooltipFilter: null
|
||
});
|
||
}
|
||
});
|
||
/**
|
||
Returns an extension that installs a gutter showing markers for
|
||
each line that has diagnostics, which can be hovered over to see
|
||
the diagnostics.
|
||
*/
|
||
function lintGutter(config = {}) {
|
||
return [lintGutterConfig.of(config), lintGutterMarkers, lintGutterExtension, lintGutterTheme, lintGutterTooltip];
|
||
}
|
||
/**
|
||
Iterate over the marked diagnostics for the given editor state,
|
||
calling `f` for each of them. Note that, if the document changed
|
||
since the diagnostics were created, the `Diagnostic` object will
|
||
hold the original outdated position, whereas the `to` and `from`
|
||
arguments hold the diagnostic's current position.
|
||
*/
|
||
function forEachDiagnostic(state, f) {
|
||
let lState = state.field(lintState, false);
|
||
if (lState && lState.diagnostics.size) {
|
||
let pending = [], pendingStart = [], lastEnd = -1;
|
||
for (let iter = RangeSet.iter([lState.diagnostics]);; iter.next()) {
|
||
for (let i = 0; i < pending.length; i++)
|
||
if (!iter.value || iter.value.spec.diagnostics.indexOf(pending[i]) < 0) {
|
||
f(pending[i], pendingStart[i], lastEnd);
|
||
pending.splice(i, 1);
|
||
pendingStart.splice(i--, 1);
|
||
}
|
||
if (!iter.value)
|
||
break;
|
||
for (let d of iter.value.spec.diagnostics)
|
||
if (pending.indexOf(d) < 0) {
|
||
pending.push(d);
|
||
pendingStart.push(iter.from);
|
||
}
|
||
lastEnd = iter.to;
|
||
}
|
||
}
|
||
}
|
||
|
||
|
||
|
||
;// ../extensions/basic-setup/esm/index.js
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
/**
|
||
This is an extension value that just pulls together a number of
|
||
extensions that you might want in a basic editor. It is meant as a
|
||
convenient helper to quickly set up CodeMirror without installing
|
||
and importing a lot of separate packages.
|
||
|
||
Specifically, it includes...
|
||
|
||
- [the default command bindings](https://codemirror.net/6/docs/ref/#commands.defaultKeymap)
|
||
- [line numbers](https://codemirror.net/6/docs/ref/#view.lineNumbers)
|
||
- [special character highlighting](https://codemirror.net/6/docs/ref/#view.highlightSpecialChars)
|
||
- [the undo history](https://codemirror.net/6/docs/ref/#commands.history)
|
||
- [a fold gutter](https://codemirror.net/6/docs/ref/#language.foldGutter)
|
||
- [custom selection drawing](https://codemirror.net/6/docs/ref/#view.drawSelection)
|
||
- [drop cursor](https://codemirror.net/6/docs/ref/#view.dropCursor)
|
||
- [multiple selections](https://codemirror.net/6/docs/ref/#state.EditorState^allowMultipleSelections)
|
||
- [reindentation on input](https://codemirror.net/6/docs/ref/#language.indentOnInput)
|
||
- [the default highlight style](https://codemirror.net/6/docs/ref/#language.defaultHighlightStyle) (as fallback)
|
||
- [bracket matching](https://codemirror.net/6/docs/ref/#language.bracketMatching)
|
||
- [bracket closing](https://codemirror.net/6/docs/ref/#autocomplete.closeBrackets)
|
||
- [autocompletion](https://codemirror.net/6/docs/ref/#autocomplete.autocompletion)
|
||
- [rectangular selection](https://codemirror.net/6/docs/ref/#view.rectangularSelection) and [crosshair cursor](https://codemirror.net/6/docs/ref/#view.crosshairCursor)
|
||
- [active line highlighting](https://codemirror.net/6/docs/ref/#view.highlightActiveLine)
|
||
- [active line gutter highlighting](https://codemirror.net/6/docs/ref/#view.highlightActiveLineGutter)
|
||
- [selection match highlighting](https://codemirror.net/6/docs/ref/#search.highlightSelectionMatches)
|
||
- [search](https://codemirror.net/6/docs/ref/#search.searchKeymap)
|
||
- [linting](https://codemirror.net/6/docs/ref/#lint.lintKeymap)
|
||
|
||
(You'll probably want to add some language package to your setup
|
||
too.)
|
||
|
||
This extension does not allow customization. The idea is that,
|
||
once you decide you want to configure your editor more precisely,
|
||
you take this package's source (which is just a bunch of imports
|
||
and an array literal), copy it into your own code, and adjust it
|
||
as desired.
|
||
*/
|
||
var basicSetup = function basicSetup(options) {
|
||
if (options === void 0) {
|
||
options = {};
|
||
}
|
||
var {
|
||
crosshairCursor: initCrosshairCursor = false
|
||
} = options;
|
||
var keymaps = [];
|
||
if (options.closeBracketsKeymap !== false) {
|
||
keymaps = keymaps.concat(closeBracketsKeymap);
|
||
}
|
||
if (options.defaultKeymap !== false) {
|
||
keymaps = keymaps.concat(dist/* defaultKeymap */.pw);
|
||
}
|
||
if (options.searchKeymap !== false) {
|
||
keymaps = keymaps.concat(searchKeymap);
|
||
}
|
||
if (options.historyKeymap !== false) {
|
||
keymaps = keymaps.concat(dist/* historyKeymap */.cL);
|
||
}
|
||
if (options.foldKeymap !== false) {
|
||
keymaps = keymaps.concat(language_dist/* foldKeymap */.f7);
|
||
}
|
||
if (options.completionKeymap !== false) {
|
||
keymaps = keymaps.concat(completionKeymap);
|
||
}
|
||
if (options.lintKeymap !== false) {
|
||
keymaps = keymaps.concat(lintKeymap);
|
||
}
|
||
var extensions = [];
|
||
if (options.lineNumbers !== false) extensions.push((0,view_.lineNumbers)());
|
||
if (options.highlightActiveLineGutter !== false) extensions.push((0,view_.highlightActiveLineGutter)());
|
||
if (options.highlightSpecialChars !== false) extensions.push((0,view_.highlightSpecialChars)());
|
||
if (options.history !== false) extensions.push((0,dist/* history */.b6)());
|
||
if (options.foldGutter !== false) extensions.push((0,language_dist/* foldGutter */.Lv)());
|
||
if (options.drawSelection !== false) extensions.push((0,view_.drawSelection)());
|
||
if (options.dropCursor !== false) extensions.push((0,view_.dropCursor)());
|
||
if (options.allowMultipleSelections !== false) extensions.push(state_.EditorState.allowMultipleSelections.of(true));
|
||
if (options.indentOnInput !== false) extensions.push((0,language_dist/* indentOnInput */.WD)());
|
||
if (options.syntaxHighlighting !== false) extensions.push((0,language_dist/* syntaxHighlighting */.y9)(language_dist/* defaultHighlightStyle */.Zt, {
|
||
fallback: true
|
||
}));
|
||
if (options.bracketMatching !== false) extensions.push((0,language_dist/* bracketMatching */.SG)());
|
||
if (options.closeBrackets !== false) extensions.push(closeBrackets());
|
||
if (options.autocompletion !== false) extensions.push(autocompletion());
|
||
if (options.rectangularSelection !== false) extensions.push((0,view_.rectangularSelection)());
|
||
if (initCrosshairCursor !== false) extensions.push((0,view_.crosshairCursor)());
|
||
if (options.highlightActiveLine !== false) extensions.push((0,view_.highlightActiveLine)());
|
||
if (options.highlightSelectionMatches !== false) extensions.push(highlightSelectionMatches());
|
||
if (options.tabSize && typeof options.tabSize === 'number') extensions.push(language_dist/* indentUnit */.Xt.of(' '.repeat(options.tabSize)));
|
||
return extensions.concat([view_.keymap.of(keymaps.flat())]).filter(Boolean);
|
||
};
|
||
/**
|
||
A minimal set of extensions to create a functional editor. Only
|
||
includes [the default keymap](https://codemirror.net/6/docs/ref/#commands.defaultKeymap), [undo
|
||
history](https://codemirror.net/6/docs/ref/#commands.history), [special character
|
||
highlighting](https://codemirror.net/6/docs/ref/#view.highlightSpecialChars), [custom selection
|
||
drawing](https://codemirror.net/6/docs/ref/#view.drawSelection), and [default highlight
|
||
style](https://codemirror.net/6/docs/ref/#language.defaultHighlightStyle).
|
||
*/
|
||
var minimalSetup = function minimalSetup(options) {
|
||
if (options === void 0) {
|
||
options = {};
|
||
}
|
||
var keymaps = [];
|
||
if (options.defaultKeymap !== false) {
|
||
keymaps = keymaps.concat(dist/* defaultKeymap */.pw);
|
||
}
|
||
if (options.historyKeymap !== false) {
|
||
keymaps = keymaps.concat(dist/* historyKeymap */.cL);
|
||
}
|
||
var extensions = [];
|
||
if (options.highlightSpecialChars !== false) extensions.push((0,view_.highlightSpecialChars)());
|
||
if (options.history !== false) extensions.push((0,dist/* history */.b6)());
|
||
if (options.drawSelection !== false) extensions.push((0,view_.drawSelection)());
|
||
if (options.syntaxHighlighting !== false) extensions.push((0,language_dist/* syntaxHighlighting */.y9)(language_dist/* defaultHighlightStyle */.Zt, {
|
||
fallback: true
|
||
}));
|
||
return extensions.concat([view_.keymap.of(keymaps.flat())]).filter(Boolean);
|
||
};
|
||
|
||
/***/ }),
|
||
|
||
/***/ 708:
|
||
/***/ ((module) => {
|
||
|
||
module.exports = __WEBPACK_EXTERNAL_MODULE__708__;
|
||
|
||
/***/ }),
|
||
|
||
/***/ 720:
|
||
/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
|
||
|
||
/* harmony export */ __webpack_require__.d(__webpack_exports__, {
|
||
/* harmony export */ Yc: () => (/* binding */ indentWithTab),
|
||
/* harmony export */ b6: () => (/* binding */ history),
|
||
/* harmony export */ cL: () => (/* binding */ historyKeymap),
|
||
/* harmony export */ pw: () => (/* binding */ defaultKeymap)
|
||
/* harmony export */ });
|
||
/* unused harmony exports addCursorAbove, addCursorBelow, blockComment, blockUncomment, copyLineDown, copyLineUp, cursorCharBackward, cursorCharBackwardLogical, cursorCharForward, cursorCharForwardLogical, cursorCharLeft, cursorCharRight, cursorDocEnd, cursorDocStart, cursorGroupBackward, cursorGroupForward, cursorGroupForwardWin, cursorGroupLeft, cursorGroupRight, cursorLineBoundaryBackward, cursorLineBoundaryForward, cursorLineBoundaryLeft, cursorLineBoundaryRight, cursorLineDown, cursorLineEnd, cursorLineStart, cursorLineUp, cursorMatchingBracket, cursorPageDown, cursorPageUp, cursorSubwordBackward, cursorSubwordForward, cursorSyntaxLeft, cursorSyntaxRight, deleteCharBackward, deleteCharBackwardStrict, deleteCharForward, deleteGroupBackward, deleteGroupForward, deleteGroupForwardWin, deleteLine, deleteLineBoundaryBackward, deleteLineBoundaryForward, deleteToLineEnd, deleteToLineStart, deleteTrailingWhitespace, emacsStyleKeymap, historyField, indentLess, indentMore, indentSelection, insertBlankLine, insertNewline, insertNewlineAndIndent, insertNewlineKeepIndent, insertTab, invertedEffects, isolateHistory, lineComment, lineUncomment, moveLineDown, moveLineUp, redo, redoDepth, redoSelection, selectAll, selectCharBackward, selectCharBackwardLogical, selectCharForward, selectCharForwardLogical, selectCharLeft, selectCharRight, selectDocEnd, selectDocStart, selectGroupBackward, selectGroupForward, selectGroupForwardWin, selectGroupLeft, selectGroupRight, selectLine, selectLineBoundaryBackward, selectLineBoundaryForward, selectLineBoundaryLeft, selectLineBoundaryRight, selectLineDown, selectLineEnd, selectLineStart, selectLineUp, selectMatchingBracket, selectPageDown, selectPageUp, selectParentSyntax, selectSubwordBackward, selectSubwordForward, selectSyntaxLeft, selectSyntaxRight, simplifySelection, splitLine, standardKeymap, temporarilySetTabFocusMode, toggleBlockComment, toggleBlockCommentByLine, toggleComment, toggleLineComment, toggleTabFocusMode, transposeChars, undo, undoDepth, undoSelection */
|
||
/* harmony import */ var _codemirror_state__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(60);
|
||
/* harmony import */ var _codemirror_view__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(730);
|
||
/* harmony import */ var _codemirror_language__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(194);
|
||
/* harmony import */ var _lezer_common__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(203);
|
||
|
||
|
||
|
||
|
||
|
||
/**
|
||
Comment or uncomment the current selection. Will use line comments
|
||
if available, otherwise falling back to block comments.
|
||
*/
|
||
const toggleComment = target => {
|
||
let { state } = target, line = state.doc.lineAt(state.selection.main.from), config = getConfig(target.state, line.from);
|
||
return config.line ? toggleLineComment(target) : config.block ? toggleBlockCommentByLine(target) : false;
|
||
};
|
||
function command(f, option) {
|
||
return ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
let tr = f(option, state);
|
||
if (!tr)
|
||
return false;
|
||
dispatch(state.update(tr));
|
||
return true;
|
||
};
|
||
}
|
||
/**
|
||
Comment or uncomment the current selection using line comments.
|
||
The line comment syntax is taken from the
|
||
[`commentTokens`](https://codemirror.net/6/docs/ref/#commands.CommentTokens) [language
|
||
data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt).
|
||
*/
|
||
const toggleLineComment = /*@__PURE__*/command(changeLineComment, 0 /* CommentOption.Toggle */);
|
||
/**
|
||
Comment the current selection using line comments.
|
||
*/
|
||
const lineComment = /*@__PURE__*/(/* unused pure expression or super */ null && (command(changeLineComment, 1 /* CommentOption.Comment */)));
|
||
/**
|
||
Uncomment the current selection using line comments.
|
||
*/
|
||
const lineUncomment = /*@__PURE__*/(/* unused pure expression or super */ null && (command(changeLineComment, 2 /* CommentOption.Uncomment */)));
|
||
/**
|
||
Comment or uncomment the current selection using block comments.
|
||
The block comment syntax is taken from the
|
||
[`commentTokens`](https://codemirror.net/6/docs/ref/#commands.CommentTokens) [language
|
||
data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt).
|
||
*/
|
||
const toggleBlockComment = /*@__PURE__*/command(changeBlockComment, 0 /* CommentOption.Toggle */);
|
||
/**
|
||
Comment the current selection using block comments.
|
||
*/
|
||
const blockComment = /*@__PURE__*/(/* unused pure expression or super */ null && (command(changeBlockComment, 1 /* CommentOption.Comment */)));
|
||
/**
|
||
Uncomment the current selection using block comments.
|
||
*/
|
||
const blockUncomment = /*@__PURE__*/(/* unused pure expression or super */ null && (command(changeBlockComment, 2 /* CommentOption.Uncomment */)));
|
||
/**
|
||
Comment or uncomment the lines around the current selection using
|
||
block comments.
|
||
*/
|
||
const toggleBlockCommentByLine = /*@__PURE__*/command((o, s) => changeBlockComment(o, s, selectedLineRanges(s)), 0 /* CommentOption.Toggle */);
|
||
function getConfig(state, pos) {
|
||
let data = state.languageDataAt("commentTokens", pos, 1);
|
||
return data.length ? data[0] : {};
|
||
}
|
||
const SearchMargin = 50;
|
||
/**
|
||
Determines if the given range is block-commented in the given
|
||
state.
|
||
*/
|
||
function findBlockComment(state, { open, close }, from, to) {
|
||
let textBefore = state.sliceDoc(from - SearchMargin, from);
|
||
let textAfter = state.sliceDoc(to, to + SearchMargin);
|
||
let spaceBefore = /\s*$/.exec(textBefore)[0].length, spaceAfter = /^\s*/.exec(textAfter)[0].length;
|
||
let beforeOff = textBefore.length - spaceBefore;
|
||
if (textBefore.slice(beforeOff - open.length, beforeOff) == open &&
|
||
textAfter.slice(spaceAfter, spaceAfter + close.length) == close) {
|
||
return { open: { pos: from - spaceBefore, margin: spaceBefore && 1 },
|
||
close: { pos: to + spaceAfter, margin: spaceAfter && 1 } };
|
||
}
|
||
let startText, endText;
|
||
if (to - from <= 2 * SearchMargin) {
|
||
startText = endText = state.sliceDoc(from, to);
|
||
}
|
||
else {
|
||
startText = state.sliceDoc(from, from + SearchMargin);
|
||
endText = state.sliceDoc(to - SearchMargin, to);
|
||
}
|
||
let startSpace = /^\s*/.exec(startText)[0].length, endSpace = /\s*$/.exec(endText)[0].length;
|
||
let endOff = endText.length - endSpace - close.length;
|
||
if (startText.slice(startSpace, startSpace + open.length) == open &&
|
||
endText.slice(endOff, endOff + close.length) == close) {
|
||
return { open: { pos: from + startSpace + open.length,
|
||
margin: /\s/.test(startText.charAt(startSpace + open.length)) ? 1 : 0 },
|
||
close: { pos: to - endSpace - close.length,
|
||
margin: /\s/.test(endText.charAt(endOff - 1)) ? 1 : 0 } };
|
||
}
|
||
return null;
|
||
}
|
||
function selectedLineRanges(state) {
|
||
let ranges = [];
|
||
for (let r of state.selection.ranges) {
|
||
let fromLine = state.doc.lineAt(r.from);
|
||
let toLine = r.to <= fromLine.to ? fromLine : state.doc.lineAt(r.to);
|
||
if (toLine.from > fromLine.from && toLine.from == r.to)
|
||
toLine = r.to == fromLine.to + 1 ? fromLine : state.doc.lineAt(r.to - 1);
|
||
let last = ranges.length - 1;
|
||
if (last >= 0 && ranges[last].to > fromLine.from)
|
||
ranges[last].to = toLine.to;
|
||
else
|
||
ranges.push({ from: fromLine.from + /^\s*/.exec(fromLine.text)[0].length, to: toLine.to });
|
||
}
|
||
return ranges;
|
||
}
|
||
// Performs toggle, comment and uncomment of block comments in
|
||
// languages that support them.
|
||
function changeBlockComment(option, state, ranges = state.selection.ranges) {
|
||
let tokens = ranges.map(r => getConfig(state, r.from).block);
|
||
if (!tokens.every(c => c))
|
||
return null;
|
||
let comments = ranges.map((r, i) => findBlockComment(state, tokens[i], r.from, r.to));
|
||
if (option != 2 /* CommentOption.Uncomment */ && !comments.every(c => c)) {
|
||
return { changes: state.changes(ranges.map((range, i) => {
|
||
if (comments[i])
|
||
return [];
|
||
return [{ from: range.from, insert: tokens[i].open + " " }, { from: range.to, insert: " " + tokens[i].close }];
|
||
})) };
|
||
}
|
||
else if (option != 1 /* CommentOption.Comment */ && comments.some(c => c)) {
|
||
let changes = [];
|
||
for (let i = 0, comment; i < comments.length; i++)
|
||
if (comment = comments[i]) {
|
||
let token = tokens[i], { open, close } = comment;
|
||
changes.push({ from: open.pos - token.open.length, to: open.pos + open.margin }, { from: close.pos - close.margin, to: close.pos + token.close.length });
|
||
}
|
||
return { changes };
|
||
}
|
||
return null;
|
||
}
|
||
// Performs toggle, comment and uncomment of line comments.
|
||
function changeLineComment(option, state, ranges = state.selection.ranges) {
|
||
let lines = [];
|
||
let prevLine = -1;
|
||
for (let { from, to } of ranges) {
|
||
let startI = lines.length, minIndent = 1e9;
|
||
let token = getConfig(state, from).line;
|
||
if (!token)
|
||
continue;
|
||
for (let pos = from; pos <= to;) {
|
||
let line = state.doc.lineAt(pos);
|
||
if (line.from > prevLine && (from == to || to > line.from)) {
|
||
prevLine = line.from;
|
||
let indent = /^\s*/.exec(line.text)[0].length;
|
||
let empty = indent == line.length;
|
||
let comment = line.text.slice(indent, indent + token.length) == token ? indent : -1;
|
||
if (indent < line.text.length && indent < minIndent)
|
||
minIndent = indent;
|
||
lines.push({ line, comment, token, indent, empty, single: false });
|
||
}
|
||
pos = line.to + 1;
|
||
}
|
||
if (minIndent < 1e9)
|
||
for (let i = startI; i < lines.length; i++)
|
||
if (lines[i].indent < lines[i].line.text.length)
|
||
lines[i].indent = minIndent;
|
||
if (lines.length == startI + 1)
|
||
lines[startI].single = true;
|
||
}
|
||
if (option != 2 /* CommentOption.Uncomment */ && lines.some(l => l.comment < 0 && (!l.empty || l.single))) {
|
||
let changes = [];
|
||
for (let { line, token, indent, empty, single } of lines)
|
||
if (single || !empty)
|
||
changes.push({ from: line.from + indent, insert: token + " " });
|
||
let changeSet = state.changes(changes);
|
||
return { changes: changeSet, selection: state.selection.map(changeSet, 1) };
|
||
}
|
||
else if (option != 1 /* CommentOption.Comment */ && lines.some(l => l.comment >= 0)) {
|
||
let changes = [];
|
||
for (let { line, comment, token } of lines)
|
||
if (comment >= 0) {
|
||
let from = line.from + comment, to = from + token.length;
|
||
if (line.text[to - line.from] == " ")
|
||
to++;
|
||
changes.push({ from, to });
|
||
}
|
||
return { changes };
|
||
}
|
||
return null;
|
||
}
|
||
|
||
const fromHistory = /*@__PURE__*/_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Annotation.define();
|
||
/**
|
||
Transaction annotation that will prevent that transaction from
|
||
being combined with other transactions in the undo history. Given
|
||
`"before"`, it'll prevent merging with previous transactions. With
|
||
`"after"`, subsequent transactions won't be combined with this
|
||
one. With `"full"`, the transaction is isolated on both sides.
|
||
*/
|
||
const isolateHistory = /*@__PURE__*/_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Annotation.define();
|
||
/**
|
||
This facet provides a way to register functions that, given a
|
||
transaction, provide a set of effects that the history should
|
||
store when inverting the transaction. This can be used to
|
||
integrate some kinds of effects in the history, so that they can
|
||
be undone (and redone again).
|
||
*/
|
||
const invertedEffects = /*@__PURE__*/_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Facet.define();
|
||
const historyConfig = /*@__PURE__*/_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Facet.define({
|
||
combine(configs) {
|
||
return (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.combineConfig)(configs, {
|
||
minDepth: 100,
|
||
newGroupDelay: 500,
|
||
joinToEvent: (_t, isAdjacent) => isAdjacent,
|
||
}, {
|
||
minDepth: Math.max,
|
||
newGroupDelay: Math.min,
|
||
joinToEvent: (a, b) => (tr, adj) => a(tr, adj) || b(tr, adj)
|
||
});
|
||
}
|
||
});
|
||
const historyField_ = /*@__PURE__*/_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.StateField.define({
|
||
create() {
|
||
return HistoryState.empty;
|
||
},
|
||
update(state, tr) {
|
||
let config = tr.state.facet(historyConfig);
|
||
let fromHist = tr.annotation(fromHistory);
|
||
if (fromHist) {
|
||
let item = HistEvent.fromTransaction(tr, fromHist.selection), from = fromHist.side;
|
||
let other = from == 0 /* BranchName.Done */ ? state.undone : state.done;
|
||
if (item)
|
||
other = updateBranch(other, other.length, config.minDepth, item);
|
||
else
|
||
other = addSelection(other, tr.startState.selection);
|
||
return new HistoryState(from == 0 /* BranchName.Done */ ? fromHist.rest : other, from == 0 /* BranchName.Done */ ? other : fromHist.rest);
|
||
}
|
||
let isolate = tr.annotation(isolateHistory);
|
||
if (isolate == "full" || isolate == "before")
|
||
state = state.isolate();
|
||
if (tr.annotation(_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Transaction.addToHistory) === false)
|
||
return !tr.changes.empty ? state.addMapping(tr.changes.desc) : state;
|
||
let event = HistEvent.fromTransaction(tr);
|
||
let time = tr.annotation(_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Transaction.time), userEvent = tr.annotation(_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Transaction.userEvent);
|
||
if (event)
|
||
state = state.addChanges(event, time, userEvent, config, tr);
|
||
else if (tr.selection)
|
||
state = state.addSelection(tr.startState.selection, time, userEvent, config.newGroupDelay);
|
||
if (isolate == "full" || isolate == "after")
|
||
state = state.isolate();
|
||
return state;
|
||
},
|
||
toJSON(value) {
|
||
return { done: value.done.map(e => e.toJSON()), undone: value.undone.map(e => e.toJSON()) };
|
||
},
|
||
fromJSON(json) {
|
||
return new HistoryState(json.done.map(HistEvent.fromJSON), json.undone.map(HistEvent.fromJSON));
|
||
}
|
||
});
|
||
/**
|
||
Create a history extension with the given configuration.
|
||
*/
|
||
function history(config = {}) {
|
||
return [
|
||
historyField_,
|
||
historyConfig.of(config),
|
||
_codemirror_view__WEBPACK_IMPORTED_MODULE_1__.EditorView.domEventHandlers({
|
||
beforeinput(e, view) {
|
||
let command = e.inputType == "historyUndo" ? undo : e.inputType == "historyRedo" ? redo : null;
|
||
if (!command)
|
||
return false;
|
||
e.preventDefault();
|
||
return command(view);
|
||
}
|
||
})
|
||
];
|
||
}
|
||
/**
|
||
The state field used to store the history data. Should probably
|
||
only be used when you want to
|
||
[serialize](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) or
|
||
[deserialize](https://codemirror.net/6/docs/ref/#state.EditorState^fromJSON) state objects in a way
|
||
that preserves history.
|
||
*/
|
||
const historyField = (/* unused pure expression or super */ null && (historyField_));
|
||
function cmd(side, selection) {
|
||
return function ({ state, dispatch }) {
|
||
if (!selection && state.readOnly)
|
||
return false;
|
||
let historyState = state.field(historyField_, false);
|
||
if (!historyState)
|
||
return false;
|
||
let tr = historyState.pop(side, state, selection);
|
||
if (!tr)
|
||
return false;
|
||
dispatch(tr);
|
||
return true;
|
||
};
|
||
}
|
||
/**
|
||
Undo a single group of history events. Returns false if no group
|
||
was available.
|
||
*/
|
||
const undo = /*@__PURE__*/cmd(0 /* BranchName.Done */, false);
|
||
/**
|
||
Redo a group of history events. Returns false if no group was
|
||
available.
|
||
*/
|
||
const redo = /*@__PURE__*/cmd(1 /* BranchName.Undone */, false);
|
||
/**
|
||
Undo a change or selection change.
|
||
*/
|
||
const undoSelection = /*@__PURE__*/cmd(0 /* BranchName.Done */, true);
|
||
/**
|
||
Redo a change or selection change.
|
||
*/
|
||
const redoSelection = /*@__PURE__*/cmd(1 /* BranchName.Undone */, true);
|
||
function depth(side) {
|
||
return function (state) {
|
||
let histState = state.field(historyField_, false);
|
||
if (!histState)
|
||
return 0;
|
||
let branch = side == 0 /* BranchName.Done */ ? histState.done : histState.undone;
|
||
return branch.length - (branch.length && !branch[0].changes ? 1 : 0);
|
||
};
|
||
}
|
||
/**
|
||
The amount of undoable change events available in a given state.
|
||
*/
|
||
const undoDepth = /*@__PURE__*/(/* unused pure expression or super */ null && (depth(0 /* BranchName.Done */)));
|
||
/**
|
||
The amount of redoable change events available in a given state.
|
||
*/
|
||
const redoDepth = /*@__PURE__*/(/* unused pure expression or super */ null && (depth(1 /* BranchName.Undone */)));
|
||
// History events store groups of changes or effects that need to be
|
||
// undone/redone together.
|
||
class HistEvent {
|
||
constructor(
|
||
// The changes in this event. Normal events hold at least one
|
||
// change or effect. But it may be necessary to store selection
|
||
// events before the first change, in which case a special type of
|
||
// instance is created which doesn't hold any changes, with
|
||
// changes == startSelection == undefined
|
||
changes,
|
||
// The effects associated with this event
|
||
effects,
|
||
// Accumulated mapping (from addToHistory==false) that should be
|
||
// applied to events below this one.
|
||
mapped,
|
||
// The selection before this event
|
||
startSelection,
|
||
// Stores selection changes after this event, to be used for
|
||
// selection undo/redo.
|
||
selectionsAfter) {
|
||
this.changes = changes;
|
||
this.effects = effects;
|
||
this.mapped = mapped;
|
||
this.startSelection = startSelection;
|
||
this.selectionsAfter = selectionsAfter;
|
||
}
|
||
setSelAfter(after) {
|
||
return new HistEvent(this.changes, this.effects, this.mapped, this.startSelection, after);
|
||
}
|
||
toJSON() {
|
||
var _a, _b, _c;
|
||
return {
|
||
changes: (_a = this.changes) === null || _a === void 0 ? void 0 : _a.toJSON(),
|
||
mapped: (_b = this.mapped) === null || _b === void 0 ? void 0 : _b.toJSON(),
|
||
startSelection: (_c = this.startSelection) === null || _c === void 0 ? void 0 : _c.toJSON(),
|
||
selectionsAfter: this.selectionsAfter.map(s => s.toJSON())
|
||
};
|
||
}
|
||
static fromJSON(json) {
|
||
return new HistEvent(json.changes && _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.ChangeSet.fromJSON(json.changes), [], json.mapped && _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.ChangeDesc.fromJSON(json.mapped), json.startSelection && _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.fromJSON(json.startSelection), json.selectionsAfter.map(_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.fromJSON));
|
||
}
|
||
// This does not check `addToHistory` and such, it assumes the
|
||
// transaction needs to be converted to an item. Returns null when
|
||
// there are no changes or effects in the transaction.
|
||
static fromTransaction(tr, selection) {
|
||
let effects = none;
|
||
for (let invert of tr.startState.facet(invertedEffects)) {
|
||
let result = invert(tr);
|
||
if (result.length)
|
||
effects = effects.concat(result);
|
||
}
|
||
if (!effects.length && tr.changes.empty)
|
||
return null;
|
||
return new HistEvent(tr.changes.invert(tr.startState.doc), effects, undefined, selection || tr.startState.selection, none);
|
||
}
|
||
static selection(selections) {
|
||
return new HistEvent(undefined, none, undefined, undefined, selections);
|
||
}
|
||
}
|
||
function updateBranch(branch, to, maxLen, newEvent) {
|
||
let start = to + 1 > maxLen + 20 ? to - maxLen - 1 : 0;
|
||
let newBranch = branch.slice(start, to);
|
||
newBranch.push(newEvent);
|
||
return newBranch;
|
||
}
|
||
function isAdjacent(a, b) {
|
||
let ranges = [], isAdjacent = false;
|
||
a.iterChangedRanges((f, t) => ranges.push(f, t));
|
||
b.iterChangedRanges((_f, _t, f, t) => {
|
||
for (let i = 0; i < ranges.length;) {
|
||
let from = ranges[i++], to = ranges[i++];
|
||
if (t >= from && f <= to)
|
||
isAdjacent = true;
|
||
}
|
||
});
|
||
return isAdjacent;
|
||
}
|
||
function eqSelectionShape(a, b) {
|
||
return a.ranges.length == b.ranges.length &&
|
||
a.ranges.filter((r, i) => r.empty != b.ranges[i].empty).length === 0;
|
||
}
|
||
function conc(a, b) {
|
||
return !a.length ? b : !b.length ? a : a.concat(b);
|
||
}
|
||
const none = [];
|
||
const MaxSelectionsPerEvent = 200;
|
||
function addSelection(branch, selection) {
|
||
if (!branch.length) {
|
||
return [HistEvent.selection([selection])];
|
||
}
|
||
else {
|
||
let lastEvent = branch[branch.length - 1];
|
||
let sels = lastEvent.selectionsAfter.slice(Math.max(0, lastEvent.selectionsAfter.length - MaxSelectionsPerEvent));
|
||
if (sels.length && sels[sels.length - 1].eq(selection))
|
||
return branch;
|
||
sels.push(selection);
|
||
return updateBranch(branch, branch.length - 1, 1e9, lastEvent.setSelAfter(sels));
|
||
}
|
||
}
|
||
// Assumes the top item has one or more selectionAfter values
|
||
function popSelection(branch) {
|
||
let last = branch[branch.length - 1];
|
||
let newBranch = branch.slice();
|
||
newBranch[branch.length - 1] = last.setSelAfter(last.selectionsAfter.slice(0, last.selectionsAfter.length - 1));
|
||
return newBranch;
|
||
}
|
||
// Add a mapping to the top event in the given branch. If this maps
|
||
// away all the changes and effects in that item, drop it and
|
||
// propagate the mapping to the next item.
|
||
function addMappingToBranch(branch, mapping) {
|
||
if (!branch.length)
|
||
return branch;
|
||
let length = branch.length, selections = none;
|
||
while (length) {
|
||
let event = mapEvent(branch[length - 1], mapping, selections);
|
||
if (event.changes && !event.changes.empty || event.effects.length) { // Event survived mapping
|
||
let result = branch.slice(0, length);
|
||
result[length - 1] = event;
|
||
return result;
|
||
}
|
||
else { // Drop this event, since there's no changes or effects left
|
||
mapping = event.mapped;
|
||
length--;
|
||
selections = event.selectionsAfter;
|
||
}
|
||
}
|
||
return selections.length ? [HistEvent.selection(selections)] : none;
|
||
}
|
||
function mapEvent(event, mapping, extraSelections) {
|
||
let selections = conc(event.selectionsAfter.length ? event.selectionsAfter.map(s => s.map(mapping)) : none, extraSelections);
|
||
// Change-less events don't store mappings (they are always the last event in a branch)
|
||
if (!event.changes)
|
||
return HistEvent.selection(selections);
|
||
let mappedChanges = event.changes.map(mapping), before = mapping.mapDesc(event.changes, true);
|
||
let fullMapping = event.mapped ? event.mapped.composeDesc(before) : before;
|
||
return new HistEvent(mappedChanges, _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.StateEffect.mapEffects(event.effects, mapping), fullMapping, event.startSelection.map(before), selections);
|
||
}
|
||
const joinableUserEvent = /^(input\.type|delete)($|\.)/;
|
||
class HistoryState {
|
||
constructor(done, undone, prevTime = 0, prevUserEvent = undefined) {
|
||
this.done = done;
|
||
this.undone = undone;
|
||
this.prevTime = prevTime;
|
||
this.prevUserEvent = prevUserEvent;
|
||
}
|
||
isolate() {
|
||
return this.prevTime ? new HistoryState(this.done, this.undone) : this;
|
||
}
|
||
addChanges(event, time, userEvent, config, tr) {
|
||
let done = this.done, lastEvent = done[done.length - 1];
|
||
if (lastEvent && lastEvent.changes && !lastEvent.changes.empty && event.changes &&
|
||
(!userEvent || joinableUserEvent.test(userEvent)) &&
|
||
((!lastEvent.selectionsAfter.length &&
|
||
time - this.prevTime < config.newGroupDelay &&
|
||
config.joinToEvent(tr, isAdjacent(lastEvent.changes, event.changes))) ||
|
||
// For compose (but not compose.start) events, always join with previous event
|
||
userEvent == "input.type.compose")) {
|
||
done = updateBranch(done, done.length - 1, config.minDepth, new HistEvent(event.changes.compose(lastEvent.changes), conc(_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.StateEffect.mapEffects(event.effects, lastEvent.changes), lastEvent.effects), lastEvent.mapped, lastEvent.startSelection, none));
|
||
}
|
||
else {
|
||
done = updateBranch(done, done.length, config.minDepth, event);
|
||
}
|
||
return new HistoryState(done, none, time, userEvent);
|
||
}
|
||
addSelection(selection, time, userEvent, newGroupDelay) {
|
||
let last = this.done.length ? this.done[this.done.length - 1].selectionsAfter : none;
|
||
if (last.length > 0 &&
|
||
time - this.prevTime < newGroupDelay &&
|
||
userEvent == this.prevUserEvent && userEvent && /^select($|\.)/.test(userEvent) &&
|
||
eqSelectionShape(last[last.length - 1], selection))
|
||
return this;
|
||
return new HistoryState(addSelection(this.done, selection), this.undone, time, userEvent);
|
||
}
|
||
addMapping(mapping) {
|
||
return new HistoryState(addMappingToBranch(this.done, mapping), addMappingToBranch(this.undone, mapping), this.prevTime, this.prevUserEvent);
|
||
}
|
||
pop(side, state, onlySelection) {
|
||
let branch = side == 0 /* BranchName.Done */ ? this.done : this.undone;
|
||
if (branch.length == 0)
|
||
return null;
|
||
let event = branch[branch.length - 1], selection = event.selectionsAfter[0] || state.selection;
|
||
if (onlySelection && event.selectionsAfter.length) {
|
||
return state.update({
|
||
selection: event.selectionsAfter[event.selectionsAfter.length - 1],
|
||
annotations: fromHistory.of({ side, rest: popSelection(branch), selection }),
|
||
userEvent: side == 0 /* BranchName.Done */ ? "select.undo" : "select.redo",
|
||
scrollIntoView: true
|
||
});
|
||
}
|
||
else if (!event.changes) {
|
||
return null;
|
||
}
|
||
else {
|
||
let rest = branch.length == 1 ? none : branch.slice(0, branch.length - 1);
|
||
if (event.mapped)
|
||
rest = addMappingToBranch(rest, event.mapped);
|
||
return state.update({
|
||
changes: event.changes,
|
||
selection: event.startSelection,
|
||
effects: event.effects,
|
||
annotations: fromHistory.of({ side, rest, selection }),
|
||
filter: false,
|
||
userEvent: side == 0 /* BranchName.Done */ ? "undo" : "redo",
|
||
scrollIntoView: true
|
||
});
|
||
}
|
||
}
|
||
}
|
||
HistoryState.empty = /*@__PURE__*/new HistoryState(none, none);
|
||
/**
|
||
Default key bindings for the undo history.
|
||
|
||
- Mod-z: [`undo`](https://codemirror.net/6/docs/ref/#commands.undo).
|
||
- Mod-y (Mod-Shift-z on macOS) + Ctrl-Shift-z on Linux: [`redo`](https://codemirror.net/6/docs/ref/#commands.redo).
|
||
- Mod-u: [`undoSelection`](https://codemirror.net/6/docs/ref/#commands.undoSelection).
|
||
- Alt-u (Mod-Shift-u on macOS): [`redoSelection`](https://codemirror.net/6/docs/ref/#commands.redoSelection).
|
||
*/
|
||
const historyKeymap = [
|
||
{ key: "Mod-z", run: undo, preventDefault: true },
|
||
{ key: "Mod-y", mac: "Mod-Shift-z", run: redo, preventDefault: true },
|
||
{ linux: "Ctrl-Shift-z", run: redo, preventDefault: true },
|
||
{ key: "Mod-u", run: undoSelection, preventDefault: true },
|
||
{ key: "Alt-u", mac: "Mod-Shift-u", run: redoSelection, preventDefault: true }
|
||
];
|
||
|
||
function updateSel(sel, by) {
|
||
return _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.create(sel.ranges.map(by), sel.mainIndex);
|
||
}
|
||
function setSel(state, selection) {
|
||
return state.update({ selection, scrollIntoView: true, userEvent: "select" });
|
||
}
|
||
function moveSel({ state, dispatch }, how) {
|
||
let selection = updateSel(state.selection, how);
|
||
if (selection.eq(state.selection, true))
|
||
return false;
|
||
dispatch(setSel(state, selection));
|
||
return true;
|
||
}
|
||
function rangeEnd(range, forward) {
|
||
return _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(forward ? range.to : range.from);
|
||
}
|
||
function cursorByChar(view, forward) {
|
||
return moveSel(view, range => range.empty ? view.moveByChar(range, forward) : rangeEnd(range, forward));
|
||
}
|
||
function ltrAtCursor(view) {
|
||
return view.textDirectionAt(view.state.selection.main.head) == _codemirror_view__WEBPACK_IMPORTED_MODULE_1__.Direction.LTR;
|
||
}
|
||
/**
|
||
Move the selection one character to the left (which is backward in
|
||
left-to-right text, forward in right-to-left text).
|
||
*/
|
||
const cursorCharLeft = view => cursorByChar(view, !ltrAtCursor(view));
|
||
/**
|
||
Move the selection one character to the right.
|
||
*/
|
||
const cursorCharRight = view => cursorByChar(view, ltrAtCursor(view));
|
||
/**
|
||
Move the selection one character forward.
|
||
*/
|
||
const cursorCharForward = view => cursorByChar(view, true);
|
||
/**
|
||
Move the selection one character backward.
|
||
*/
|
||
const cursorCharBackward = view => cursorByChar(view, false);
|
||
function byCharLogical(state, range, forward) {
|
||
let pos = range.head, line = state.doc.lineAt(pos);
|
||
if (pos == (forward ? line.to : line.from))
|
||
pos = forward ? Math.min(state.doc.length, line.to + 1) : Math.max(0, line.from - 1);
|
||
else
|
||
pos = line.from + findClusterBreak(line.text, pos - line.from, forward);
|
||
return EditorSelection.cursor(pos, forward ? -1 : 1);
|
||
}
|
||
function moveByCharLogical(target, forward) {
|
||
return moveSel(target, range => range.empty ? byCharLogical(target.state, range, forward) : rangeEnd(range, forward));
|
||
}
|
||
/**
|
||
Move the selection one character forward, in logical
|
||
(non-text-direction-aware) string index order.
|
||
*/
|
||
const cursorCharForwardLogical = target => moveByCharLogical(target, true);
|
||
/**
|
||
Move the selection one character backward, in logical string index
|
||
order.
|
||
*/
|
||
const cursorCharBackwardLogical = target => moveByCharLogical(target, false);
|
||
function cursorByGroup(view, forward) {
|
||
return moveSel(view, range => range.empty ? view.moveByGroup(range, forward) : rangeEnd(range, forward));
|
||
}
|
||
/**
|
||
Move the selection to the left across one group of word or
|
||
non-word (but also non-space) characters.
|
||
*/
|
||
const cursorGroupLeft = view => cursorByGroup(view, !ltrAtCursor(view));
|
||
/**
|
||
Move the selection one group to the right.
|
||
*/
|
||
const cursorGroupRight = view => cursorByGroup(view, ltrAtCursor(view));
|
||
/**
|
||
Move the selection one group forward.
|
||
*/
|
||
const cursorGroupForward = view => cursorByGroup(view, true);
|
||
/**
|
||
Move the selection one group backward.
|
||
*/
|
||
const cursorGroupBackward = view => cursorByGroup(view, false);
|
||
function toGroupStart(view, pos, start) {
|
||
let categorize = view.state.charCategorizer(pos);
|
||
let cat = categorize(start), initial = cat != CharCategory.Space;
|
||
return (next) => {
|
||
let nextCat = categorize(next);
|
||
if (nextCat != CharCategory.Space)
|
||
return initial && nextCat == cat;
|
||
initial = false;
|
||
return true;
|
||
};
|
||
}
|
||
/**
|
||
Move the cursor one group forward in the default Windows style,
|
||
where it moves to the start of the next group.
|
||
*/
|
||
const cursorGroupForwardWin = view => {
|
||
return moveSel(view, range => range.empty
|
||
? view.moveByChar(range, true, start => toGroupStart(view, range.head, start))
|
||
: rangeEnd(range, true));
|
||
};
|
||
const segmenter = typeof Intl != "undefined" && Intl.Segmenter ?
|
||
/*@__PURE__*/new (Intl.Segmenter)(undefined, { granularity: "word" }) : null;
|
||
function moveBySubword(view, range, forward) {
|
||
let categorize = view.state.charCategorizer(range.from);
|
||
let cat = CharCategory.Space, pos = range.from, steps = 0;
|
||
let done = false, sawUpper = false, sawLower = false;
|
||
let step = (next) => {
|
||
if (done)
|
||
return false;
|
||
pos += forward ? next.length : -next.length;
|
||
let nextCat = categorize(next), ahead;
|
||
if (nextCat == CharCategory.Word && next.charCodeAt(0) < 128 && /[\W_]/.test(next))
|
||
nextCat = -1; // Treat word punctuation specially
|
||
if (cat == CharCategory.Space)
|
||
cat = nextCat;
|
||
if (cat != nextCat)
|
||
return false;
|
||
if (cat == CharCategory.Word) {
|
||
if (next.toLowerCase() == next) {
|
||
if (!forward && sawUpper)
|
||
return false;
|
||
sawLower = true;
|
||
}
|
||
else if (sawLower) {
|
||
if (forward)
|
||
return false;
|
||
done = true;
|
||
}
|
||
else {
|
||
if (sawUpper && forward && categorize(ahead = view.state.sliceDoc(pos, pos + 1)) == CharCategory.Word &&
|
||
ahead.toLowerCase() == ahead)
|
||
return false;
|
||
sawUpper = true;
|
||
}
|
||
}
|
||
steps++;
|
||
return true;
|
||
};
|
||
let end = view.moveByChar(range, forward, start => {
|
||
step(start);
|
||
return step;
|
||
});
|
||
if (segmenter && cat == CharCategory.Word && end.from == range.from + steps * (forward ? 1 : -1)) {
|
||
let from = Math.min(range.head, end.head), to = Math.max(range.head, end.head);
|
||
let skipped = view.state.sliceDoc(from, to);
|
||
if (skipped.length > 1 && /[\u4E00-\uffff]/.test(skipped)) {
|
||
let segments = Array.from(segmenter.segment(skipped));
|
||
if (segments.length > 1) {
|
||
if (forward)
|
||
return EditorSelection.cursor(range.head + segments[1].index, -1);
|
||
return EditorSelection.cursor(end.head + segments[segments.length - 1].index, 1);
|
||
}
|
||
}
|
||
}
|
||
return end;
|
||
}
|
||
function cursorBySubword(view, forward) {
|
||
return moveSel(view, range => range.empty ? moveBySubword(view, range, forward) : rangeEnd(range, forward));
|
||
}
|
||
/**
|
||
Move the selection one group or camel-case subword forward.
|
||
*/
|
||
const cursorSubwordForward = view => cursorBySubword(view, true);
|
||
/**
|
||
Move the selection one group or camel-case subword backward.
|
||
*/
|
||
const cursorSubwordBackward = view => cursorBySubword(view, false);
|
||
function interestingNode(state, node, bracketProp) {
|
||
if (node.type.prop(bracketProp))
|
||
return true;
|
||
let len = node.to - node.from;
|
||
return len && (len > 2 || /[^\s,.;:]/.test(state.sliceDoc(node.from, node.to))) || node.firstChild;
|
||
}
|
||
function moveBySyntax(state, start, forward) {
|
||
let pos = (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .syntaxTree */ .mv)(state).resolveInner(start.head);
|
||
let bracketProp = forward ? _lezer_common__WEBPACK_IMPORTED_MODULE_3__/* .NodeProp */ .uY.closedBy : _lezer_common__WEBPACK_IMPORTED_MODULE_3__/* .NodeProp */ .uY.openedBy;
|
||
// Scan forward through child nodes to see if there's an interesting
|
||
// node ahead.
|
||
for (let at = start.head;;) {
|
||
let next = forward ? pos.childAfter(at) : pos.childBefore(at);
|
||
if (!next)
|
||
break;
|
||
if (interestingNode(state, next, bracketProp))
|
||
pos = next;
|
||
else
|
||
at = forward ? next.to : next.from;
|
||
}
|
||
let bracket = pos.type.prop(bracketProp), match, newPos;
|
||
if (bracket && (match = forward ? (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .matchBrackets */ .jU)(state, pos.from, 1) : (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .matchBrackets */ .jU)(state, pos.to, -1)) && match.matched)
|
||
newPos = forward ? match.end.to : match.end.from;
|
||
else
|
||
newPos = forward ? pos.to : pos.from;
|
||
return _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(newPos, forward ? -1 : 1);
|
||
}
|
||
/**
|
||
Move the cursor over the next syntactic element to the left.
|
||
*/
|
||
const cursorSyntaxLeft = view => moveSel(view, range => moveBySyntax(view.state, range, !ltrAtCursor(view)));
|
||
/**
|
||
Move the cursor over the next syntactic element to the right.
|
||
*/
|
||
const cursorSyntaxRight = view => moveSel(view, range => moveBySyntax(view.state, range, ltrAtCursor(view)));
|
||
function cursorByLine(view, forward) {
|
||
return moveSel(view, range => {
|
||
if (!range.empty)
|
||
return rangeEnd(range, forward);
|
||
let moved = view.moveVertically(range, forward);
|
||
return moved.head != range.head ? moved : view.moveToLineBoundary(range, forward);
|
||
});
|
||
}
|
||
/**
|
||
Move the selection one line up.
|
||
*/
|
||
const cursorLineUp = view => cursorByLine(view, false);
|
||
/**
|
||
Move the selection one line down.
|
||
*/
|
||
const cursorLineDown = view => cursorByLine(view, true);
|
||
function pageInfo(view) {
|
||
let selfScroll = view.scrollDOM.clientHeight < view.scrollDOM.scrollHeight - 2;
|
||
let marginTop = 0, marginBottom = 0, height;
|
||
if (selfScroll) {
|
||
for (let source of view.state.facet(_codemirror_view__WEBPACK_IMPORTED_MODULE_1__.EditorView.scrollMargins)) {
|
||
let margins = source(view);
|
||
if (margins === null || margins === void 0 ? void 0 : margins.top)
|
||
marginTop = Math.max(margins === null || margins === void 0 ? void 0 : margins.top, marginTop);
|
||
if (margins === null || margins === void 0 ? void 0 : margins.bottom)
|
||
marginBottom = Math.max(margins === null || margins === void 0 ? void 0 : margins.bottom, marginBottom);
|
||
}
|
||
height = view.scrollDOM.clientHeight - marginTop - marginBottom;
|
||
}
|
||
else {
|
||
height = (view.dom.ownerDocument.defaultView || window).innerHeight;
|
||
}
|
||
return { marginTop, marginBottom, selfScroll,
|
||
height: Math.max(view.defaultLineHeight, height - 5) };
|
||
}
|
||
function cursorByPage(view, forward) {
|
||
let page = pageInfo(view);
|
||
let { state } = view, selection = updateSel(state.selection, range => {
|
||
return range.empty ? view.moveVertically(range, forward, page.height)
|
||
: rangeEnd(range, forward);
|
||
});
|
||
if (selection.eq(state.selection))
|
||
return false;
|
||
let effect;
|
||
if (page.selfScroll) {
|
||
let startPos = view.coordsAtPos(state.selection.main.head);
|
||
let scrollRect = view.scrollDOM.getBoundingClientRect();
|
||
let scrollTop = scrollRect.top + page.marginTop, scrollBottom = scrollRect.bottom - page.marginBottom;
|
||
if (startPos && startPos.top > scrollTop && startPos.bottom < scrollBottom)
|
||
effect = _codemirror_view__WEBPACK_IMPORTED_MODULE_1__.EditorView.scrollIntoView(selection.main.head, { y: "start", yMargin: startPos.top - scrollTop });
|
||
}
|
||
view.dispatch(setSel(state, selection), { effects: effect });
|
||
return true;
|
||
}
|
||
/**
|
||
Move the selection one page up.
|
||
*/
|
||
const cursorPageUp = view => cursorByPage(view, false);
|
||
/**
|
||
Move the selection one page down.
|
||
*/
|
||
const cursorPageDown = view => cursorByPage(view, true);
|
||
function moveByLineBoundary(view, start, forward) {
|
||
let line = view.lineBlockAt(start.head), moved = view.moveToLineBoundary(start, forward);
|
||
if (moved.head == start.head && moved.head != (forward ? line.to : line.from))
|
||
moved = view.moveToLineBoundary(start, forward, false);
|
||
if (!forward && moved.head == line.from && line.length) {
|
||
let space = /^\s*/.exec(view.state.sliceDoc(line.from, Math.min(line.from + 100, line.to)))[0].length;
|
||
if (space && start.head != line.from + space)
|
||
moved = _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(line.from + space);
|
||
}
|
||
return moved;
|
||
}
|
||
/**
|
||
Move the selection to the next line wrap point, or to the end of
|
||
the line if there isn't one left on this line.
|
||
*/
|
||
const cursorLineBoundaryForward = view => moveSel(view, range => moveByLineBoundary(view, range, true));
|
||
/**
|
||
Move the selection to previous line wrap point, or failing that to
|
||
the start of the line. If the line is indented, and the cursor
|
||
isn't already at the end of the indentation, this will move to the
|
||
end of the indentation instead of the start of the line.
|
||
*/
|
||
const cursorLineBoundaryBackward = view => moveSel(view, range => moveByLineBoundary(view, range, false));
|
||
/**
|
||
Move the selection one line wrap point to the left.
|
||
*/
|
||
const cursorLineBoundaryLeft = view => moveSel(view, range => moveByLineBoundary(view, range, !ltrAtCursor(view)));
|
||
/**
|
||
Move the selection one line wrap point to the right.
|
||
*/
|
||
const cursorLineBoundaryRight = view => moveSel(view, range => moveByLineBoundary(view, range, ltrAtCursor(view)));
|
||
/**
|
||
Move the selection to the start of the line.
|
||
*/
|
||
const cursorLineStart = view => moveSel(view, range => _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(view.lineBlockAt(range.head).from, 1));
|
||
/**
|
||
Move the selection to the end of the line.
|
||
*/
|
||
const cursorLineEnd = view => moveSel(view, range => _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(view.lineBlockAt(range.head).to, -1));
|
||
function toMatchingBracket(state, dispatch, extend) {
|
||
let found = false, selection = updateSel(state.selection, range => {
|
||
let matching = (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .matchBrackets */ .jU)(state, range.head, -1)
|
||
|| (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .matchBrackets */ .jU)(state, range.head, 1)
|
||
|| (range.head > 0 && (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .matchBrackets */ .jU)(state, range.head - 1, 1))
|
||
|| (range.head < state.doc.length && (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .matchBrackets */ .jU)(state, range.head + 1, -1));
|
||
if (!matching || !matching.end)
|
||
return range;
|
||
found = true;
|
||
let head = matching.start.from == range.head ? matching.end.to : matching.end.from;
|
||
return extend ? _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.range(range.anchor, head) : _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(head);
|
||
});
|
||
if (!found)
|
||
return false;
|
||
dispatch(setSel(state, selection));
|
||
return true;
|
||
}
|
||
/**
|
||
Move the selection to the bracket matching the one it is currently
|
||
on, if any.
|
||
*/
|
||
const cursorMatchingBracket = ({ state, dispatch }) => toMatchingBracket(state, dispatch, false);
|
||
/**
|
||
Extend the selection to the bracket matching the one the selection
|
||
head is currently on, if any.
|
||
*/
|
||
const selectMatchingBracket = ({ state, dispatch }) => toMatchingBracket(state, dispatch, true);
|
||
function extendSel(target, how) {
|
||
let selection = updateSel(target.state.selection, range => {
|
||
let head = how(range);
|
||
return _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.range(range.anchor, head.head, head.goalColumn, head.bidiLevel || undefined);
|
||
});
|
||
if (selection.eq(target.state.selection))
|
||
return false;
|
||
target.dispatch(setSel(target.state, selection));
|
||
return true;
|
||
}
|
||
function selectByChar(view, forward) {
|
||
return extendSel(view, range => view.moveByChar(range, forward));
|
||
}
|
||
/**
|
||
Move the selection head one character to the left, while leaving
|
||
the anchor in place.
|
||
*/
|
||
const selectCharLeft = view => selectByChar(view, !ltrAtCursor(view));
|
||
/**
|
||
Move the selection head one character to the right.
|
||
*/
|
||
const selectCharRight = view => selectByChar(view, ltrAtCursor(view));
|
||
/**
|
||
Move the selection head one character forward.
|
||
*/
|
||
const selectCharForward = view => selectByChar(view, true);
|
||
/**
|
||
Move the selection head one character backward.
|
||
*/
|
||
const selectCharBackward = view => selectByChar(view, false);
|
||
/**
|
||
Move the selection head one character forward by logical
|
||
(non-direction aware) string index order.
|
||
*/
|
||
const selectCharForwardLogical = target => extendSel(target, range => byCharLogical(target.state, range, true));
|
||
/**
|
||
Move the selection head one character backward by logical string
|
||
index order.
|
||
*/
|
||
const selectCharBackwardLogical = target => extendSel(target, range => byCharLogical(target.state, range, false));
|
||
function selectByGroup(view, forward) {
|
||
return extendSel(view, range => view.moveByGroup(range, forward));
|
||
}
|
||
/**
|
||
Move the selection head one [group](https://codemirror.net/6/docs/ref/#commands.cursorGroupLeft) to
|
||
the left.
|
||
*/
|
||
const selectGroupLeft = view => selectByGroup(view, !ltrAtCursor(view));
|
||
/**
|
||
Move the selection head one group to the right.
|
||
*/
|
||
const selectGroupRight = view => selectByGroup(view, ltrAtCursor(view));
|
||
/**
|
||
Move the selection head one group forward.
|
||
*/
|
||
const selectGroupForward = view => selectByGroup(view, true);
|
||
/**
|
||
Move the selection head one group backward.
|
||
*/
|
||
const selectGroupBackward = view => selectByGroup(view, false);
|
||
/**
|
||
Move the selection head one group forward in the default Windows
|
||
style, skipping to the start of the next group.
|
||
*/
|
||
const selectGroupForwardWin = view => {
|
||
return extendSel(view, range => view.moveByChar(range, true, start => toGroupStart(view, range.head, start)));
|
||
};
|
||
function selectBySubword(view, forward) {
|
||
return extendSel(view, range => moveBySubword(view, range, forward));
|
||
}
|
||
/**
|
||
Move the selection head one group or camel-case subword forward.
|
||
*/
|
||
const selectSubwordForward = view => selectBySubword(view, true);
|
||
/**
|
||
Move the selection head one group or subword backward.
|
||
*/
|
||
const selectSubwordBackward = view => selectBySubword(view, false);
|
||
/**
|
||
Move the selection head over the next syntactic element to the left.
|
||
*/
|
||
const selectSyntaxLeft = view => extendSel(view, range => moveBySyntax(view.state, range, !ltrAtCursor(view)));
|
||
/**
|
||
Move the selection head over the next syntactic element to the right.
|
||
*/
|
||
const selectSyntaxRight = view => extendSel(view, range => moveBySyntax(view.state, range, ltrAtCursor(view)));
|
||
function selectByLine(view, forward) {
|
||
return extendSel(view, range => view.moveVertically(range, forward));
|
||
}
|
||
/**
|
||
Move the selection head one line up.
|
||
*/
|
||
const selectLineUp = view => selectByLine(view, false);
|
||
/**
|
||
Move the selection head one line down.
|
||
*/
|
||
const selectLineDown = view => selectByLine(view, true);
|
||
function selectByPage(view, forward) {
|
||
return extendSel(view, range => view.moveVertically(range, forward, pageInfo(view).height));
|
||
}
|
||
/**
|
||
Move the selection head one page up.
|
||
*/
|
||
const selectPageUp = view => selectByPage(view, false);
|
||
/**
|
||
Move the selection head one page down.
|
||
*/
|
||
const selectPageDown = view => selectByPage(view, true);
|
||
/**
|
||
Move the selection head to the next line boundary.
|
||
*/
|
||
const selectLineBoundaryForward = view => extendSel(view, range => moveByLineBoundary(view, range, true));
|
||
/**
|
||
Move the selection head to the previous line boundary.
|
||
*/
|
||
const selectLineBoundaryBackward = view => extendSel(view, range => moveByLineBoundary(view, range, false));
|
||
/**
|
||
Move the selection head one line boundary to the left.
|
||
*/
|
||
const selectLineBoundaryLeft = view => extendSel(view, range => moveByLineBoundary(view, range, !ltrAtCursor(view)));
|
||
/**
|
||
Move the selection head one line boundary to the right.
|
||
*/
|
||
const selectLineBoundaryRight = view => extendSel(view, range => moveByLineBoundary(view, range, ltrAtCursor(view)));
|
||
/**
|
||
Move the selection head to the start of the line.
|
||
*/
|
||
const selectLineStart = view => extendSel(view, range => _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(view.lineBlockAt(range.head).from));
|
||
/**
|
||
Move the selection head to the end of the line.
|
||
*/
|
||
const selectLineEnd = view => extendSel(view, range => _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(view.lineBlockAt(range.head).to));
|
||
/**
|
||
Move the selection to the start of the document.
|
||
*/
|
||
const cursorDocStart = ({ state, dispatch }) => {
|
||
dispatch(setSel(state, { anchor: 0 }));
|
||
return true;
|
||
};
|
||
/**
|
||
Move the selection to the end of the document.
|
||
*/
|
||
const cursorDocEnd = ({ state, dispatch }) => {
|
||
dispatch(setSel(state, { anchor: state.doc.length }));
|
||
return true;
|
||
};
|
||
/**
|
||
Move the selection head to the start of the document.
|
||
*/
|
||
const selectDocStart = ({ state, dispatch }) => {
|
||
dispatch(setSel(state, { anchor: state.selection.main.anchor, head: 0 }));
|
||
return true;
|
||
};
|
||
/**
|
||
Move the selection head to the end of the document.
|
||
*/
|
||
const selectDocEnd = ({ state, dispatch }) => {
|
||
dispatch(setSel(state, { anchor: state.selection.main.anchor, head: state.doc.length }));
|
||
return true;
|
||
};
|
||
/**
|
||
Select the entire document.
|
||
*/
|
||
const selectAll = ({ state, dispatch }) => {
|
||
dispatch(state.update({ selection: { anchor: 0, head: state.doc.length }, userEvent: "select" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Expand the selection to cover entire lines.
|
||
*/
|
||
const selectLine = ({ state, dispatch }) => {
|
||
let ranges = selectedLineBlocks(state).map(({ from, to }) => _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.range(from, Math.min(to + 1, state.doc.length)));
|
||
dispatch(state.update({ selection: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.create(ranges), userEvent: "select" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Select the next syntactic construct that is larger than the
|
||
selection. Note that this will only work insofar as the language
|
||
[provider](https://codemirror.net/6/docs/ref/#language.language) you use builds up a full
|
||
syntax tree.
|
||
*/
|
||
const selectParentSyntax = ({ state, dispatch }) => {
|
||
let selection = updateSel(state.selection, range => {
|
||
let tree = (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .syntaxTree */ .mv)(state), stack = tree.resolveStack(range.from, 1);
|
||
if (range.empty) {
|
||
let stackBefore = tree.resolveStack(range.from, -1);
|
||
if (stackBefore.node.from >= stack.node.from && stackBefore.node.to <= stack.node.to)
|
||
stack = stackBefore;
|
||
}
|
||
for (let cur = stack; cur; cur = cur.next) {
|
||
let { node } = cur;
|
||
if (((node.from < range.from && node.to >= range.to) ||
|
||
(node.to > range.to && node.from <= range.from)) &&
|
||
cur.next)
|
||
return _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.range(node.to, node.from);
|
||
}
|
||
return range;
|
||
});
|
||
if (selection.eq(state.selection))
|
||
return false;
|
||
dispatch(setSel(state, selection));
|
||
return true;
|
||
};
|
||
function addCursorVertically(view, forward) {
|
||
let { state } = view, sel = state.selection, ranges = state.selection.ranges.slice();
|
||
for (let range of state.selection.ranges) {
|
||
let line = state.doc.lineAt(range.head);
|
||
if (forward ? line.to < view.state.doc.length : line.from > 0)
|
||
for (let cur = range;;) {
|
||
let next = view.moveVertically(cur, forward);
|
||
if (next.head < line.from || next.head > line.to) {
|
||
if (!ranges.some(r => r.head == next.head))
|
||
ranges.push(next);
|
||
break;
|
||
}
|
||
else if (next.head == cur.head) {
|
||
break;
|
||
}
|
||
else {
|
||
cur = next;
|
||
}
|
||
}
|
||
}
|
||
if (ranges.length == sel.ranges.length)
|
||
return false;
|
||
view.dispatch(setSel(state, _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.create(ranges, ranges.length - 1)));
|
||
return true;
|
||
}
|
||
/**
|
||
Expand the selection by adding a cursor above the heads of
|
||
currently selected ranges.
|
||
*/
|
||
const addCursorAbove = view => addCursorVertically(view, false);
|
||
/**
|
||
Expand the selection by adding a cursor below the heads of
|
||
currently selected ranges.
|
||
*/
|
||
const addCursorBelow = view => addCursorVertically(view, true);
|
||
/**
|
||
Simplify the current selection. When multiple ranges are selected,
|
||
reduce it to its main range. Otherwise, if the selection is
|
||
non-empty, convert it to a cursor selection.
|
||
*/
|
||
const simplifySelection = ({ state, dispatch }) => {
|
||
let cur = state.selection, selection = null;
|
||
if (cur.ranges.length > 1)
|
||
selection = _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.create([cur.main]);
|
||
else if (!cur.main.empty)
|
||
selection = _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.create([_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(cur.main.head)]);
|
||
if (!selection)
|
||
return false;
|
||
dispatch(setSel(state, selection));
|
||
return true;
|
||
};
|
||
function deleteBy(target, by) {
|
||
if (target.state.readOnly)
|
||
return false;
|
||
let event = "delete.selection", { state } = target;
|
||
let changes = state.changeByRange(range => {
|
||
let { from, to } = range;
|
||
if (from == to) {
|
||
let towards = by(range);
|
||
if (towards < from) {
|
||
event = "delete.backward";
|
||
towards = skipAtomic(target, towards, false);
|
||
}
|
||
else if (towards > from) {
|
||
event = "delete.forward";
|
||
towards = skipAtomic(target, towards, true);
|
||
}
|
||
from = Math.min(from, towards);
|
||
to = Math.max(to, towards);
|
||
}
|
||
else {
|
||
from = skipAtomic(target, from, false);
|
||
to = skipAtomic(target, to, true);
|
||
}
|
||
return from == to ? { range } : { changes: { from, to }, range: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(from, from < range.head ? -1 : 1) };
|
||
});
|
||
if (changes.changes.empty)
|
||
return false;
|
||
target.dispatch(state.update(changes, {
|
||
scrollIntoView: true,
|
||
userEvent: event,
|
||
effects: event == "delete.selection" ? _codemirror_view__WEBPACK_IMPORTED_MODULE_1__.EditorView.announce.of(state.phrase("Selection deleted")) : undefined
|
||
}));
|
||
return true;
|
||
}
|
||
function skipAtomic(target, pos, forward) {
|
||
if (target instanceof _codemirror_view__WEBPACK_IMPORTED_MODULE_1__.EditorView)
|
||
for (let ranges of target.state.facet(_codemirror_view__WEBPACK_IMPORTED_MODULE_1__.EditorView.atomicRanges).map(f => f(target)))
|
||
ranges.between(pos, pos, (from, to) => {
|
||
if (from < pos && to > pos)
|
||
pos = forward ? to : from;
|
||
});
|
||
return pos;
|
||
}
|
||
const deleteByChar = (target, forward, byIndentUnit) => deleteBy(target, range => {
|
||
let pos = range.from, { state } = target, line = state.doc.lineAt(pos), before, targetPos;
|
||
if (byIndentUnit && !forward && pos > line.from && pos < line.from + 200 &&
|
||
!/[^ \t]/.test(before = line.text.slice(0, pos - line.from))) {
|
||
if (before[before.length - 1] == "\t")
|
||
return pos - 1;
|
||
let col = (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.countColumn)(before, state.tabSize), drop = col % (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .getIndentUnit */ .tp)(state) || (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .getIndentUnit */ .tp)(state);
|
||
for (let i = 0; i < drop && before[before.length - 1 - i] == " "; i++)
|
||
pos--;
|
||
targetPos = pos;
|
||
}
|
||
else {
|
||
targetPos = (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.findClusterBreak)(line.text, pos - line.from, forward, forward) + line.from;
|
||
if (targetPos == pos && line.number != (forward ? state.doc.lines : 1))
|
||
targetPos += forward ? 1 : -1;
|
||
else if (!forward && /[\ufe00-\ufe0f]/.test(line.text.slice(targetPos - line.from, pos - line.from)))
|
||
targetPos = (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.findClusterBreak)(line.text, targetPos - line.from, false, false) + line.from;
|
||
}
|
||
return targetPos;
|
||
});
|
||
/**
|
||
Delete the selection, or, for cursor selections, the character or
|
||
indentation unit before the cursor.
|
||
*/
|
||
const deleteCharBackward = view => deleteByChar(view, false, true);
|
||
/**
|
||
Delete the selection or the character before the cursor. Does not
|
||
implement any extended behavior like deleting whole indentation
|
||
units in one go.
|
||
*/
|
||
const deleteCharBackwardStrict = view => deleteByChar(view, false, false);
|
||
/**
|
||
Delete the selection or the character after the cursor.
|
||
*/
|
||
const deleteCharForward = view => deleteByChar(view, true, false);
|
||
const deleteByGroup = (target, forward) => deleteBy(target, range => {
|
||
let pos = range.head, { state } = target, line = state.doc.lineAt(pos);
|
||
let categorize = state.charCategorizer(pos);
|
||
for (let cat = null;;) {
|
||
if (pos == (forward ? line.to : line.from)) {
|
||
if (pos == range.head && line.number != (forward ? state.doc.lines : 1))
|
||
pos += forward ? 1 : -1;
|
||
break;
|
||
}
|
||
let next = (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.findClusterBreak)(line.text, pos - line.from, forward) + line.from;
|
||
let nextChar = line.text.slice(Math.min(pos, next) - line.from, Math.max(pos, next) - line.from);
|
||
let nextCat = categorize(nextChar);
|
||
if (cat != null && nextCat != cat)
|
||
break;
|
||
if (nextChar != " " || pos != range.head)
|
||
cat = nextCat;
|
||
pos = next;
|
||
}
|
||
return pos;
|
||
});
|
||
/**
|
||
Delete the selection or backward until the end of the next
|
||
[group](https://codemirror.net/6/docs/ref/#view.EditorView.moveByGroup), only skipping groups of
|
||
whitespace when they consist of a single space.
|
||
*/
|
||
const deleteGroupBackward = target => deleteByGroup(target, false);
|
||
/**
|
||
Delete the selection or forward until the end of the next group.
|
||
*/
|
||
const deleteGroupForward = target => deleteByGroup(target, true);
|
||
/**
|
||
Variant of [`deleteGroupForward`](https://codemirror.net/6/docs/ref/#commands.deleteGroupForward)
|
||
that uses the Windows convention of also deleting the whitespace
|
||
after a word.
|
||
*/
|
||
const deleteGroupForwardWin = view => deleteBy(view, range => view.moveByChar(range, true, start => toGroupStart(view, range.head, start)).head);
|
||
/**
|
||
Delete the selection, or, if it is a cursor selection, delete to
|
||
the end of the line. If the cursor is directly at the end of the
|
||
line, delete the line break after it.
|
||
*/
|
||
const deleteToLineEnd = view => deleteBy(view, range => {
|
||
let lineEnd = view.lineBlockAt(range.head).to;
|
||
return range.head < lineEnd ? lineEnd : Math.min(view.state.doc.length, range.head + 1);
|
||
});
|
||
/**
|
||
Delete the selection, or, if it is a cursor selection, delete to
|
||
the start of the line. If the cursor is directly at the start of the
|
||
line, delete the line break before it.
|
||
*/
|
||
const deleteToLineStart = view => deleteBy(view, range => {
|
||
let lineStart = view.lineBlockAt(range.head).from;
|
||
return range.head > lineStart ? lineStart : Math.max(0, range.head - 1);
|
||
});
|
||
/**
|
||
Delete the selection, or, if it is a cursor selection, delete to
|
||
the start of the line or the next line wrap before the cursor.
|
||
*/
|
||
const deleteLineBoundaryBackward = view => deleteBy(view, range => {
|
||
let lineStart = view.moveToLineBoundary(range, false).head;
|
||
return range.head > lineStart ? lineStart : Math.max(0, range.head - 1);
|
||
});
|
||
/**
|
||
Delete the selection, or, if it is a cursor selection, delete to
|
||
the end of the line or the next line wrap after the cursor.
|
||
*/
|
||
const deleteLineBoundaryForward = view => deleteBy(view, range => {
|
||
let lineStart = view.moveToLineBoundary(range, true).head;
|
||
return range.head < lineStart ? lineStart : Math.min(view.state.doc.length, range.head + 1);
|
||
});
|
||
/**
|
||
Delete all whitespace directly before a line end from the
|
||
document.
|
||
*/
|
||
const deleteTrailingWhitespace = ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
let changes = [];
|
||
for (let pos = 0, prev = "", iter = state.doc.iter();;) {
|
||
iter.next();
|
||
if (iter.lineBreak || iter.done) {
|
||
let trailing = prev.search(/\s+$/);
|
||
if (trailing > -1)
|
||
changes.push({ from: pos - (prev.length - trailing), to: pos });
|
||
if (iter.done)
|
||
break;
|
||
prev = "";
|
||
}
|
||
else {
|
||
prev = iter.value;
|
||
}
|
||
pos += iter.value.length;
|
||
}
|
||
if (!changes.length)
|
||
return false;
|
||
dispatch(state.update({ changes, userEvent: "delete" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Replace each selection range with a line break, leaving the cursor
|
||
on the line before the break.
|
||
*/
|
||
const splitLine = ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
let changes = state.changeByRange(range => {
|
||
return { changes: { from: range.from, to: range.to, insert: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Text.of(["", ""]) },
|
||
range: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(range.from) };
|
||
});
|
||
dispatch(state.update(changes, { scrollIntoView: true, userEvent: "input" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Flip the characters before and after the cursor(s).
|
||
*/
|
||
const transposeChars = ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
let changes = state.changeByRange(range => {
|
||
if (!range.empty || range.from == 0 || range.from == state.doc.length)
|
||
return { range };
|
||
let pos = range.from, line = state.doc.lineAt(pos);
|
||
let from = pos == line.from ? pos - 1 : (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.findClusterBreak)(line.text, pos - line.from, false) + line.from;
|
||
let to = pos == line.to ? pos + 1 : (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.findClusterBreak)(line.text, pos - line.from, true) + line.from;
|
||
return { changes: { from, to, insert: state.doc.slice(pos, to).append(state.doc.slice(from, pos)) },
|
||
range: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(to) };
|
||
});
|
||
if (changes.changes.empty)
|
||
return false;
|
||
dispatch(state.update(changes, { scrollIntoView: true, userEvent: "move.character" }));
|
||
return true;
|
||
};
|
||
function selectedLineBlocks(state) {
|
||
let blocks = [], upto = -1;
|
||
for (let range of state.selection.ranges) {
|
||
let startLine = state.doc.lineAt(range.from), endLine = state.doc.lineAt(range.to);
|
||
if (!range.empty && range.to == endLine.from)
|
||
endLine = state.doc.lineAt(range.to - 1);
|
||
if (upto >= startLine.number) {
|
||
let prev = blocks[blocks.length - 1];
|
||
prev.to = endLine.to;
|
||
prev.ranges.push(range);
|
||
}
|
||
else {
|
||
blocks.push({ from: startLine.from, to: endLine.to, ranges: [range] });
|
||
}
|
||
upto = endLine.number + 1;
|
||
}
|
||
return blocks;
|
||
}
|
||
function moveLine(state, dispatch, forward) {
|
||
if (state.readOnly)
|
||
return false;
|
||
let changes = [], ranges = [];
|
||
for (let block of selectedLineBlocks(state)) {
|
||
if (forward ? block.to == state.doc.length : block.from == 0)
|
||
continue;
|
||
let nextLine = state.doc.lineAt(forward ? block.to + 1 : block.from - 1);
|
||
let size = nextLine.length + 1;
|
||
if (forward) {
|
||
changes.push({ from: block.to, to: nextLine.to }, { from: block.from, insert: nextLine.text + state.lineBreak });
|
||
for (let r of block.ranges)
|
||
ranges.push(_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.range(Math.min(state.doc.length, r.anchor + size), Math.min(state.doc.length, r.head + size)));
|
||
}
|
||
else {
|
||
changes.push({ from: nextLine.from, to: block.from }, { from: block.to, insert: state.lineBreak + nextLine.text });
|
||
for (let r of block.ranges)
|
||
ranges.push(_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.range(r.anchor - size, r.head - size));
|
||
}
|
||
}
|
||
if (!changes.length)
|
||
return false;
|
||
dispatch(state.update({
|
||
changes,
|
||
scrollIntoView: true,
|
||
selection: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.create(ranges, state.selection.mainIndex),
|
||
userEvent: "move.line"
|
||
}));
|
||
return true;
|
||
}
|
||
/**
|
||
Move the selected lines up one line.
|
||
*/
|
||
const moveLineUp = ({ state, dispatch }) => moveLine(state, dispatch, false);
|
||
/**
|
||
Move the selected lines down one line.
|
||
*/
|
||
const moveLineDown = ({ state, dispatch }) => moveLine(state, dispatch, true);
|
||
function copyLine(state, dispatch, forward) {
|
||
if (state.readOnly)
|
||
return false;
|
||
let changes = [];
|
||
for (let block of selectedLineBlocks(state)) {
|
||
if (forward)
|
||
changes.push({ from: block.from, insert: state.doc.slice(block.from, block.to) + state.lineBreak });
|
||
else
|
||
changes.push({ from: block.to, insert: state.lineBreak + state.doc.slice(block.from, block.to) });
|
||
}
|
||
dispatch(state.update({ changes, scrollIntoView: true, userEvent: "input.copyline" }));
|
||
return true;
|
||
}
|
||
/**
|
||
Create a copy of the selected lines. Keep the selection in the top copy.
|
||
*/
|
||
const copyLineUp = ({ state, dispatch }) => copyLine(state, dispatch, false);
|
||
/**
|
||
Create a copy of the selected lines. Keep the selection in the bottom copy.
|
||
*/
|
||
const copyLineDown = ({ state, dispatch }) => copyLine(state, dispatch, true);
|
||
/**
|
||
Delete selected lines.
|
||
*/
|
||
const deleteLine = view => {
|
||
if (view.state.readOnly)
|
||
return false;
|
||
let { state } = view, changes = state.changes(selectedLineBlocks(state).map(({ from, to }) => {
|
||
if (from > 0)
|
||
from--;
|
||
else if (to < state.doc.length)
|
||
to++;
|
||
return { from, to };
|
||
}));
|
||
let selection = updateSel(state.selection, range => {
|
||
let dist = undefined;
|
||
if (view.lineWrapping) {
|
||
let block = view.lineBlockAt(range.head), pos = view.coordsAtPos(range.head, range.assoc || 1);
|
||
if (pos)
|
||
dist = (block.bottom + view.documentTop) - pos.bottom + view.defaultLineHeight / 2;
|
||
}
|
||
return view.moveVertically(range, true, dist);
|
||
}).map(changes);
|
||
view.dispatch({ changes, selection, scrollIntoView: true, userEvent: "delete.line" });
|
||
return true;
|
||
};
|
||
/**
|
||
Replace the selection with a newline.
|
||
*/
|
||
const insertNewline = ({ state, dispatch }) => {
|
||
dispatch(state.update(state.replaceSelection(state.lineBreak), { scrollIntoView: true, userEvent: "input" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Replace the selection with a newline and the same amount of
|
||
indentation as the line above.
|
||
*/
|
||
const insertNewlineKeepIndent = ({ state, dispatch }) => {
|
||
dispatch(state.update(state.changeByRange(range => {
|
||
let indent = /^\s*/.exec(state.doc.lineAt(range.from).text)[0];
|
||
return {
|
||
changes: { from: range.from, to: range.to, insert: state.lineBreak + indent },
|
||
range: EditorSelection.cursor(range.from + indent.length + 1)
|
||
};
|
||
}), { scrollIntoView: true, userEvent: "input" }));
|
||
return true;
|
||
};
|
||
function isBetweenBrackets(state, pos) {
|
||
if (/\(\)|\[\]|\{\}/.test(state.sliceDoc(pos - 1, pos + 1)))
|
||
return { from: pos, to: pos };
|
||
let context = (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .syntaxTree */ .mv)(state).resolveInner(pos);
|
||
let before = context.childBefore(pos), after = context.childAfter(pos), closedBy;
|
||
if (before && after && before.to <= pos && after.from >= pos &&
|
||
(closedBy = before.type.prop(_lezer_common__WEBPACK_IMPORTED_MODULE_3__/* .NodeProp */ .uY.closedBy)) && closedBy.indexOf(after.name) > -1 &&
|
||
state.doc.lineAt(before.to).from == state.doc.lineAt(after.from).from &&
|
||
!/\S/.test(state.sliceDoc(before.to, after.from)))
|
||
return { from: before.to, to: after.from };
|
||
return null;
|
||
}
|
||
/**
|
||
Replace the selection with a newline and indent the newly created
|
||
line(s). If the current line consists only of whitespace, this
|
||
will also delete that whitespace. When the cursor is between
|
||
matching brackets, an additional newline will be inserted after
|
||
the cursor.
|
||
*/
|
||
const insertNewlineAndIndent = /*@__PURE__*/newlineAndIndent(false);
|
||
/**
|
||
Create a blank, indented line below the current line.
|
||
*/
|
||
const insertBlankLine = /*@__PURE__*/newlineAndIndent(true);
|
||
function newlineAndIndent(atEof) {
|
||
return ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
let changes = state.changeByRange(range => {
|
||
let { from, to } = range, line = state.doc.lineAt(from);
|
||
let explode = !atEof && from == to && isBetweenBrackets(state, from);
|
||
if (atEof)
|
||
from = to = (to <= line.to ? line : state.doc.lineAt(to)).to;
|
||
let cx = new _codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .IndentContext */ .KB(state, { simulateBreak: from, simulateDoubleBreak: !!explode });
|
||
let indent = (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .getIndentation */ ._v)(cx, from);
|
||
if (indent == null)
|
||
indent = (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.countColumn)(/^\s*/.exec(state.doc.lineAt(from).text)[0], state.tabSize);
|
||
while (to < line.to && /\s/.test(line.text[to - line.from]))
|
||
to++;
|
||
if (explode)
|
||
({ from, to } = explode);
|
||
else if (from > line.from && from < line.from + 100 && !/\S/.test(line.text.slice(0, from)))
|
||
from = line.from;
|
||
let insert = ["", (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .indentString */ .EI)(state, indent)];
|
||
if (explode)
|
||
insert.push((0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .indentString */ .EI)(state, cx.lineIndent(line.from, -1)));
|
||
return { changes: { from, to, insert: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.Text.of(insert) },
|
||
range: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.cursor(from + 1 + insert[1].length) };
|
||
});
|
||
dispatch(state.update(changes, { scrollIntoView: true, userEvent: "input" }));
|
||
return true;
|
||
};
|
||
}
|
||
function changeBySelectedLine(state, f) {
|
||
let atLine = -1;
|
||
return state.changeByRange(range => {
|
||
let changes = [];
|
||
for (let pos = range.from; pos <= range.to;) {
|
||
let line = state.doc.lineAt(pos);
|
||
if (line.number > atLine && (range.empty || range.to > line.from)) {
|
||
f(line, changes, range);
|
||
atLine = line.number;
|
||
}
|
||
pos = line.to + 1;
|
||
}
|
||
let changeSet = state.changes(changes);
|
||
return { changes,
|
||
range: _codemirror_state__WEBPACK_IMPORTED_MODULE_0__.EditorSelection.range(changeSet.mapPos(range.anchor, 1), changeSet.mapPos(range.head, 1)) };
|
||
});
|
||
}
|
||
/**
|
||
Auto-indent the selected lines. This uses the [indentation service
|
||
facet](https://codemirror.net/6/docs/ref/#language.indentService) as source for auto-indent
|
||
information.
|
||
*/
|
||
const indentSelection = ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
let updated = Object.create(null);
|
||
let context = new _codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .IndentContext */ .KB(state, { overrideIndentation: start => {
|
||
let found = updated[start];
|
||
return found == null ? -1 : found;
|
||
} });
|
||
let changes = changeBySelectedLine(state, (line, changes, range) => {
|
||
let indent = (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .getIndentation */ ._v)(context, line.from);
|
||
if (indent == null)
|
||
return;
|
||
if (!/\S/.test(line.text))
|
||
indent = 0;
|
||
let cur = /^\s*/.exec(line.text)[0];
|
||
let norm = (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .indentString */ .EI)(state, indent);
|
||
if (cur != norm || range.from < line.from + cur.length) {
|
||
updated[line.from] = indent;
|
||
changes.push({ from: line.from, to: line.from + cur.length, insert: norm });
|
||
}
|
||
});
|
||
if (!changes.changes.empty)
|
||
dispatch(state.update(changes, { userEvent: "indent" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Add a [unit](https://codemirror.net/6/docs/ref/#language.indentUnit) of indentation to all selected
|
||
lines.
|
||
*/
|
||
const indentMore = ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
dispatch(state.update(changeBySelectedLine(state, (line, changes) => {
|
||
changes.push({ from: line.from, insert: state.facet(_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .indentUnit */ .Xt) });
|
||
}), { userEvent: "input.indent" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Remove a [unit](https://codemirror.net/6/docs/ref/#language.indentUnit) of indentation from all
|
||
selected lines.
|
||
*/
|
||
const indentLess = ({ state, dispatch }) => {
|
||
if (state.readOnly)
|
||
return false;
|
||
dispatch(state.update(changeBySelectedLine(state, (line, changes) => {
|
||
let space = /^\s*/.exec(line.text)[0];
|
||
if (!space)
|
||
return;
|
||
let col = (0,_codemirror_state__WEBPACK_IMPORTED_MODULE_0__.countColumn)(space, state.tabSize), keep = 0;
|
||
let insert = (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .indentString */ .EI)(state, Math.max(0, col - (0,_codemirror_language__WEBPACK_IMPORTED_MODULE_2__/* .getIndentUnit */ .tp)(state)));
|
||
while (keep < space.length && keep < insert.length && space.charCodeAt(keep) == insert.charCodeAt(keep))
|
||
keep++;
|
||
changes.push({ from: line.from + keep, to: line.from + space.length, insert: insert.slice(keep) });
|
||
}), { userEvent: "delete.dedent" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Enables or disables
|
||
[tab-focus mode](https://codemirror.net/6/docs/ref/#view.EditorView.setTabFocusMode). While on, this
|
||
prevents the editor's key bindings from capturing Tab or
|
||
Shift-Tab, making it possible for the user to move focus out of
|
||
the editor with the keyboard.
|
||
*/
|
||
const toggleTabFocusMode = view => {
|
||
view.setTabFocusMode();
|
||
return true;
|
||
};
|
||
/**
|
||
Temporarily enables [tab-focus
|
||
mode](https://codemirror.net/6/docs/ref/#view.EditorView.setTabFocusMode) for two seconds or until
|
||
another key is pressed.
|
||
*/
|
||
const temporarilySetTabFocusMode = view => {
|
||
view.setTabFocusMode(2000);
|
||
return true;
|
||
};
|
||
/**
|
||
Insert a tab character at the cursor or, if something is selected,
|
||
use [`indentMore`](https://codemirror.net/6/docs/ref/#commands.indentMore) to indent the entire
|
||
selection.
|
||
*/
|
||
const insertTab = ({ state, dispatch }) => {
|
||
if (state.selection.ranges.some(r => !r.empty))
|
||
return indentMore({ state, dispatch });
|
||
dispatch(state.update(state.replaceSelection("\t"), { scrollIntoView: true, userEvent: "input" }));
|
||
return true;
|
||
};
|
||
/**
|
||
Array of key bindings containing the Emacs-style bindings that are
|
||
available on macOS by default.
|
||
|
||
- Ctrl-b: [`cursorCharLeft`](https://codemirror.net/6/docs/ref/#commands.cursorCharLeft) ([`selectCharLeft`](https://codemirror.net/6/docs/ref/#commands.selectCharLeft) with Shift)
|
||
- Ctrl-f: [`cursorCharRight`](https://codemirror.net/6/docs/ref/#commands.cursorCharRight) ([`selectCharRight`](https://codemirror.net/6/docs/ref/#commands.selectCharRight) with Shift)
|
||
- Ctrl-p: [`cursorLineUp`](https://codemirror.net/6/docs/ref/#commands.cursorLineUp) ([`selectLineUp`](https://codemirror.net/6/docs/ref/#commands.selectLineUp) with Shift)
|
||
- Ctrl-n: [`cursorLineDown`](https://codemirror.net/6/docs/ref/#commands.cursorLineDown) ([`selectLineDown`](https://codemirror.net/6/docs/ref/#commands.selectLineDown) with Shift)
|
||
- Ctrl-a: [`cursorLineStart`](https://codemirror.net/6/docs/ref/#commands.cursorLineStart) ([`selectLineStart`](https://codemirror.net/6/docs/ref/#commands.selectLineStart) with Shift)
|
||
- Ctrl-e: [`cursorLineEnd`](https://codemirror.net/6/docs/ref/#commands.cursorLineEnd) ([`selectLineEnd`](https://codemirror.net/6/docs/ref/#commands.selectLineEnd) with Shift)
|
||
- Ctrl-d: [`deleteCharForward`](https://codemirror.net/6/docs/ref/#commands.deleteCharForward)
|
||
- Ctrl-h: [`deleteCharBackward`](https://codemirror.net/6/docs/ref/#commands.deleteCharBackward)
|
||
- Ctrl-k: [`deleteToLineEnd`](https://codemirror.net/6/docs/ref/#commands.deleteToLineEnd)
|
||
- Ctrl-Alt-h: [`deleteGroupBackward`](https://codemirror.net/6/docs/ref/#commands.deleteGroupBackward)
|
||
- Ctrl-o: [`splitLine`](https://codemirror.net/6/docs/ref/#commands.splitLine)
|
||
- Ctrl-t: [`transposeChars`](https://codemirror.net/6/docs/ref/#commands.transposeChars)
|
||
- Ctrl-v: [`cursorPageDown`](https://codemirror.net/6/docs/ref/#commands.cursorPageDown)
|
||
- Alt-v: [`cursorPageUp`](https://codemirror.net/6/docs/ref/#commands.cursorPageUp)
|
||
*/
|
||
const emacsStyleKeymap = [
|
||
{ key: "Ctrl-b", run: cursorCharLeft, shift: selectCharLeft, preventDefault: true },
|
||
{ key: "Ctrl-f", run: cursorCharRight, shift: selectCharRight },
|
||
{ key: "Ctrl-p", run: cursorLineUp, shift: selectLineUp },
|
||
{ key: "Ctrl-n", run: cursorLineDown, shift: selectLineDown },
|
||
{ key: "Ctrl-a", run: cursorLineStart, shift: selectLineStart },
|
||
{ key: "Ctrl-e", run: cursorLineEnd, shift: selectLineEnd },
|
||
{ key: "Ctrl-d", run: deleteCharForward },
|
||
{ key: "Ctrl-h", run: deleteCharBackward },
|
||
{ key: "Ctrl-k", run: deleteToLineEnd },
|
||
{ key: "Ctrl-Alt-h", run: deleteGroupBackward },
|
||
{ key: "Ctrl-o", run: splitLine },
|
||
{ key: "Ctrl-t", run: transposeChars },
|
||
{ key: "Ctrl-v", run: cursorPageDown },
|
||
];
|
||
/**
|
||
An array of key bindings closely sticking to platform-standard or
|
||
widely used bindings. (This includes the bindings from
|
||
[`emacsStyleKeymap`](https://codemirror.net/6/docs/ref/#commands.emacsStyleKeymap), with their `key`
|
||
property changed to `mac`.)
|
||
|
||
- ArrowLeft: [`cursorCharLeft`](https://codemirror.net/6/docs/ref/#commands.cursorCharLeft) ([`selectCharLeft`](https://codemirror.net/6/docs/ref/#commands.selectCharLeft) with Shift)
|
||
- ArrowRight: [`cursorCharRight`](https://codemirror.net/6/docs/ref/#commands.cursorCharRight) ([`selectCharRight`](https://codemirror.net/6/docs/ref/#commands.selectCharRight) with Shift)
|
||
- Ctrl-ArrowLeft (Alt-ArrowLeft on macOS): [`cursorGroupLeft`](https://codemirror.net/6/docs/ref/#commands.cursorGroupLeft) ([`selectGroupLeft`](https://codemirror.net/6/docs/ref/#commands.selectGroupLeft) with Shift)
|
||
- Ctrl-ArrowRight (Alt-ArrowRight on macOS): [`cursorGroupRight`](https://codemirror.net/6/docs/ref/#commands.cursorGroupRight) ([`selectGroupRight`](https://codemirror.net/6/docs/ref/#commands.selectGroupRight) with Shift)
|
||
- Cmd-ArrowLeft (on macOS): [`cursorLineStart`](https://codemirror.net/6/docs/ref/#commands.cursorLineStart) ([`selectLineStart`](https://codemirror.net/6/docs/ref/#commands.selectLineStart) with Shift)
|
||
- Cmd-ArrowRight (on macOS): [`cursorLineEnd`](https://codemirror.net/6/docs/ref/#commands.cursorLineEnd) ([`selectLineEnd`](https://codemirror.net/6/docs/ref/#commands.selectLineEnd) with Shift)
|
||
- ArrowUp: [`cursorLineUp`](https://codemirror.net/6/docs/ref/#commands.cursorLineUp) ([`selectLineUp`](https://codemirror.net/6/docs/ref/#commands.selectLineUp) with Shift)
|
||
- ArrowDown: [`cursorLineDown`](https://codemirror.net/6/docs/ref/#commands.cursorLineDown) ([`selectLineDown`](https://codemirror.net/6/docs/ref/#commands.selectLineDown) with Shift)
|
||
- Cmd-ArrowUp (on macOS): [`cursorDocStart`](https://codemirror.net/6/docs/ref/#commands.cursorDocStart) ([`selectDocStart`](https://codemirror.net/6/docs/ref/#commands.selectDocStart) with Shift)
|
||
- Cmd-ArrowDown (on macOS): [`cursorDocEnd`](https://codemirror.net/6/docs/ref/#commands.cursorDocEnd) ([`selectDocEnd`](https://codemirror.net/6/docs/ref/#commands.selectDocEnd) with Shift)
|
||
- Ctrl-ArrowUp (on macOS): [`cursorPageUp`](https://codemirror.net/6/docs/ref/#commands.cursorPageUp) ([`selectPageUp`](https://codemirror.net/6/docs/ref/#commands.selectPageUp) with Shift)
|
||
- Ctrl-ArrowDown (on macOS): [`cursorPageDown`](https://codemirror.net/6/docs/ref/#commands.cursorPageDown) ([`selectPageDown`](https://codemirror.net/6/docs/ref/#commands.selectPageDown) with Shift)
|
||
- PageUp: [`cursorPageUp`](https://codemirror.net/6/docs/ref/#commands.cursorPageUp) ([`selectPageUp`](https://codemirror.net/6/docs/ref/#commands.selectPageUp) with Shift)
|
||
- PageDown: [`cursorPageDown`](https://codemirror.net/6/docs/ref/#commands.cursorPageDown) ([`selectPageDown`](https://codemirror.net/6/docs/ref/#commands.selectPageDown) with Shift)
|
||
- Home: [`cursorLineBoundaryBackward`](https://codemirror.net/6/docs/ref/#commands.cursorLineBoundaryBackward) ([`selectLineBoundaryBackward`](https://codemirror.net/6/docs/ref/#commands.selectLineBoundaryBackward) with Shift)
|
||
- End: [`cursorLineBoundaryForward`](https://codemirror.net/6/docs/ref/#commands.cursorLineBoundaryForward) ([`selectLineBoundaryForward`](https://codemirror.net/6/docs/ref/#commands.selectLineBoundaryForward) with Shift)
|
||
- Ctrl-Home (Cmd-Home on macOS): [`cursorDocStart`](https://codemirror.net/6/docs/ref/#commands.cursorDocStart) ([`selectDocStart`](https://codemirror.net/6/docs/ref/#commands.selectDocStart) with Shift)
|
||
- Ctrl-End (Cmd-Home on macOS): [`cursorDocEnd`](https://codemirror.net/6/docs/ref/#commands.cursorDocEnd) ([`selectDocEnd`](https://codemirror.net/6/docs/ref/#commands.selectDocEnd) with Shift)
|
||
- Enter and Shift-Enter: [`insertNewlineAndIndent`](https://codemirror.net/6/docs/ref/#commands.insertNewlineAndIndent)
|
||
- Ctrl-a (Cmd-a on macOS): [`selectAll`](https://codemirror.net/6/docs/ref/#commands.selectAll)
|
||
- Backspace: [`deleteCharBackward`](https://codemirror.net/6/docs/ref/#commands.deleteCharBackward)
|
||
- Delete: [`deleteCharForward`](https://codemirror.net/6/docs/ref/#commands.deleteCharForward)
|
||
- Ctrl-Backspace (Alt-Backspace on macOS): [`deleteGroupBackward`](https://codemirror.net/6/docs/ref/#commands.deleteGroupBackward)
|
||
- Ctrl-Delete (Alt-Delete on macOS): [`deleteGroupForward`](https://codemirror.net/6/docs/ref/#commands.deleteGroupForward)
|
||
- Cmd-Backspace (macOS): [`deleteLineBoundaryBackward`](https://codemirror.net/6/docs/ref/#commands.deleteLineBoundaryBackward).
|
||
- Cmd-Delete (macOS): [`deleteLineBoundaryForward`](https://codemirror.net/6/docs/ref/#commands.deleteLineBoundaryForward).
|
||
*/
|
||
const standardKeymap = /*@__PURE__*/[
|
||
{ key: "ArrowLeft", run: cursorCharLeft, shift: selectCharLeft, preventDefault: true },
|
||
{ key: "Mod-ArrowLeft", mac: "Alt-ArrowLeft", run: cursorGroupLeft, shift: selectGroupLeft, preventDefault: true },
|
||
{ mac: "Cmd-ArrowLeft", run: cursorLineBoundaryLeft, shift: selectLineBoundaryLeft, preventDefault: true },
|
||
{ key: "ArrowRight", run: cursorCharRight, shift: selectCharRight, preventDefault: true },
|
||
{ key: "Mod-ArrowRight", mac: "Alt-ArrowRight", run: cursorGroupRight, shift: selectGroupRight, preventDefault: true },
|
||
{ mac: "Cmd-ArrowRight", run: cursorLineBoundaryRight, shift: selectLineBoundaryRight, preventDefault: true },
|
||
{ key: "ArrowUp", run: cursorLineUp, shift: selectLineUp, preventDefault: true },
|
||
{ mac: "Cmd-ArrowUp", run: cursorDocStart, shift: selectDocStart },
|
||
{ mac: "Ctrl-ArrowUp", run: cursorPageUp, shift: selectPageUp },
|
||
{ key: "ArrowDown", run: cursorLineDown, shift: selectLineDown, preventDefault: true },
|
||
{ mac: "Cmd-ArrowDown", run: cursorDocEnd, shift: selectDocEnd },
|
||
{ mac: "Ctrl-ArrowDown", run: cursorPageDown, shift: selectPageDown },
|
||
{ key: "PageUp", run: cursorPageUp, shift: selectPageUp },
|
||
{ key: "PageDown", run: cursorPageDown, shift: selectPageDown },
|
||
{ key: "Home", run: cursorLineBoundaryBackward, shift: selectLineBoundaryBackward, preventDefault: true },
|
||
{ key: "Mod-Home", run: cursorDocStart, shift: selectDocStart },
|
||
{ key: "End", run: cursorLineBoundaryForward, shift: selectLineBoundaryForward, preventDefault: true },
|
||
{ key: "Mod-End", run: cursorDocEnd, shift: selectDocEnd },
|
||
{ key: "Enter", run: insertNewlineAndIndent, shift: insertNewlineAndIndent },
|
||
{ key: "Mod-a", run: selectAll },
|
||
{ key: "Backspace", run: deleteCharBackward, shift: deleteCharBackward, preventDefault: true },
|
||
{ key: "Delete", run: deleteCharForward, preventDefault: true },
|
||
{ key: "Mod-Backspace", mac: "Alt-Backspace", run: deleteGroupBackward, preventDefault: true },
|
||
{ key: "Mod-Delete", mac: "Alt-Delete", run: deleteGroupForward, preventDefault: true },
|
||
{ mac: "Mod-Backspace", run: deleteLineBoundaryBackward, preventDefault: true },
|
||
{ mac: "Mod-Delete", run: deleteLineBoundaryForward, preventDefault: true }
|
||
].concat(/*@__PURE__*/emacsStyleKeymap.map(b => ({ mac: b.key, run: b.run, shift: b.shift })));
|
||
/**
|
||
The default keymap. Includes all bindings from
|
||
[`standardKeymap`](https://codemirror.net/6/docs/ref/#commands.standardKeymap) plus the following:
|
||
|
||
- Alt-ArrowLeft (Ctrl-ArrowLeft on macOS): [`cursorSyntaxLeft`](https://codemirror.net/6/docs/ref/#commands.cursorSyntaxLeft) ([`selectSyntaxLeft`](https://codemirror.net/6/docs/ref/#commands.selectSyntaxLeft) with Shift)
|
||
- Alt-ArrowRight (Ctrl-ArrowRight on macOS): [`cursorSyntaxRight`](https://codemirror.net/6/docs/ref/#commands.cursorSyntaxRight) ([`selectSyntaxRight`](https://codemirror.net/6/docs/ref/#commands.selectSyntaxRight) with Shift)
|
||
- Alt-ArrowUp: [`moveLineUp`](https://codemirror.net/6/docs/ref/#commands.moveLineUp)
|
||
- Alt-ArrowDown: [`moveLineDown`](https://codemirror.net/6/docs/ref/#commands.moveLineDown)
|
||
- Shift-Alt-ArrowUp: [`copyLineUp`](https://codemirror.net/6/docs/ref/#commands.copyLineUp)
|
||
- Shift-Alt-ArrowDown: [`copyLineDown`](https://codemirror.net/6/docs/ref/#commands.copyLineDown)
|
||
- Ctrl-Alt-ArrowUp (Cmd-Alt-ArrowUp on macOS): [`addCursorAbove`](https://codemirror.net/6/docs/ref/#commands.addCursorAbove).
|
||
- Ctrl-Alt-ArrowDown (Cmd-Alt-ArrowDown on macOS): [`addCursorBelow`](https://codemirror.net/6/docs/ref/#commands.addCursorBelow).
|
||
- Escape: [`simplifySelection`](https://codemirror.net/6/docs/ref/#commands.simplifySelection)
|
||
- Ctrl-Enter (Cmd-Enter on macOS): [`insertBlankLine`](https://codemirror.net/6/docs/ref/#commands.insertBlankLine)
|
||
- Alt-l (Ctrl-l on macOS): [`selectLine`](https://codemirror.net/6/docs/ref/#commands.selectLine)
|
||
- Ctrl-i (Cmd-i on macOS): [`selectParentSyntax`](https://codemirror.net/6/docs/ref/#commands.selectParentSyntax)
|
||
- Ctrl-[ (Cmd-[ on macOS): [`indentLess`](https://codemirror.net/6/docs/ref/#commands.indentLess)
|
||
- Ctrl-] (Cmd-] on macOS): [`indentMore`](https://codemirror.net/6/docs/ref/#commands.indentMore)
|
||
- Ctrl-Alt-\\ (Cmd-Alt-\\ on macOS): [`indentSelection`](https://codemirror.net/6/docs/ref/#commands.indentSelection)
|
||
- Shift-Ctrl-k (Shift-Cmd-k on macOS): [`deleteLine`](https://codemirror.net/6/docs/ref/#commands.deleteLine)
|
||
- Shift-Ctrl-\\ (Shift-Cmd-\\ on macOS): [`cursorMatchingBracket`](https://codemirror.net/6/docs/ref/#commands.cursorMatchingBracket)
|
||
- Ctrl-/ (Cmd-/ on macOS): [`toggleComment`](https://codemirror.net/6/docs/ref/#commands.toggleComment).
|
||
- Shift-Alt-a: [`toggleBlockComment`](https://codemirror.net/6/docs/ref/#commands.toggleBlockComment).
|
||
- Ctrl-m (Alt-Shift-m on macOS): [`toggleTabFocusMode`](https://codemirror.net/6/docs/ref/#commands.toggleTabFocusMode).
|
||
*/
|
||
const defaultKeymap = /*@__PURE__*/[
|
||
{ key: "Alt-ArrowLeft", mac: "Ctrl-ArrowLeft", run: cursorSyntaxLeft, shift: selectSyntaxLeft },
|
||
{ key: "Alt-ArrowRight", mac: "Ctrl-ArrowRight", run: cursorSyntaxRight, shift: selectSyntaxRight },
|
||
{ key: "Alt-ArrowUp", run: moveLineUp },
|
||
{ key: "Shift-Alt-ArrowUp", run: copyLineUp },
|
||
{ key: "Alt-ArrowDown", run: moveLineDown },
|
||
{ key: "Shift-Alt-ArrowDown", run: copyLineDown },
|
||
{ key: "Mod-Alt-ArrowUp", run: addCursorAbove },
|
||
{ key: "Mod-Alt-ArrowDown", run: addCursorBelow },
|
||
{ key: "Escape", run: simplifySelection },
|
||
{ key: "Mod-Enter", run: insertBlankLine },
|
||
{ key: "Alt-l", mac: "Ctrl-l", run: selectLine },
|
||
{ key: "Mod-i", run: selectParentSyntax, preventDefault: true },
|
||
{ key: "Mod-[", run: indentLess },
|
||
{ key: "Mod-]", run: indentMore },
|
||
{ key: "Mod-Alt-\\", run: indentSelection },
|
||
{ key: "Shift-Mod-k", run: deleteLine },
|
||
{ key: "Shift-Mod-\\", run: cursorMatchingBracket },
|
||
{ key: "Mod-/", run: toggleComment },
|
||
{ key: "Alt-A", run: toggleBlockComment },
|
||
{ key: "Ctrl-m", mac: "Shift-Alt-m", run: toggleTabFocusMode },
|
||
].concat(standardKeymap);
|
||
/**
|
||
A binding that binds Tab to [`indentMore`](https://codemirror.net/6/docs/ref/#commands.indentMore) and
|
||
Shift-Tab to [`indentLess`](https://codemirror.net/6/docs/ref/#commands.indentLess).
|
||
Please see the [Tab example](../../examples/tab/) before using
|
||
this.
|
||
*/
|
||
const indentWithTab = { key: "Tab", run: indentMore, shift: indentLess };
|
||
|
||
|
||
|
||
|
||
/***/ }),
|
||
|
||
/***/ 730:
|
||
/***/ ((module) => {
|
||
|
||
module.exports = __WEBPACK_EXTERNAL_MODULE__730__;
|
||
|
||
/***/ }),
|
||
|
||
/***/ 742:
|
||
/***/ ((module) => {
|
||
|
||
module.exports = __WEBPACK_EXTERNAL_MODULE__742__;
|
||
|
||
/***/ }),
|
||
|
||
/***/ 806:
|
||
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
|
||
|
||
/* harmony export */ __webpack_require__.d(__webpack_exports__, {
|
||
/* harmony export */ c: () => (/* binding */ defaultLightThemeOption)
|
||
/* harmony export */ });
|
||
/* harmony import */ var _codemirror_view__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(730);
|
||
/* harmony import */ var _codemirror_view__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_codemirror_view__WEBPACK_IMPORTED_MODULE_0__);
|
||
var defaultLightThemeOption=_codemirror_view__WEBPACK_IMPORTED_MODULE_0__.EditorView.theme({'&':{backgroundColor:'#fff'}},{dark:false});
|
||
|
||
/***/ })
|
||
|
||
/******/ });
|
||
/************************************************************************/
|
||
/******/ // The module cache
|
||
/******/ var __webpack_module_cache__ = {};
|
||
/******/
|
||
/******/ // The require function
|
||
/******/ function __webpack_require__(moduleId) {
|
||
/******/ // Check if module is in cache
|
||
/******/ var cachedModule = __webpack_module_cache__[moduleId];
|
||
/******/ if (cachedModule !== undefined) {
|
||
/******/ return cachedModule.exports;
|
||
/******/ }
|
||
/******/ // Create a new module (and put it into the cache)
|
||
/******/ var module = __webpack_module_cache__[moduleId] = {
|
||
/******/ // no module.id needed
|
||
/******/ // no module.loaded needed
|
||
/******/ exports: {}
|
||
/******/ };
|
||
/******/
|
||
/******/ // Execute the module function
|
||
/******/ __webpack_modules__[moduleId](module, module.exports, __webpack_require__);
|
||
/******/
|
||
/******/ // Return the exports of the module
|
||
/******/ return module.exports;
|
||
/******/ }
|
||
/******/
|
||
/************************************************************************/
|
||
/******/ /* webpack/runtime/compat get default export */
|
||
/******/ (() => {
|
||
/******/ // getDefaultExport function for compatibility with non-harmony modules
|
||
/******/ __webpack_require__.n = (module) => {
|
||
/******/ var getter = module && module.__esModule ?
|
||
/******/ () => (module['default']) :
|
||
/******/ () => (module);
|
||
/******/ __webpack_require__.d(getter, { a: getter });
|
||
/******/ return getter;
|
||
/******/ };
|
||
/******/ })();
|
||
/******/
|
||
/******/ /* webpack/runtime/define property getters */
|
||
/******/ (() => {
|
||
/******/ // define getter functions for harmony exports
|
||
/******/ __webpack_require__.d = (exports, definition) => {
|
||
/******/ for(var key in definition) {
|
||
/******/ if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {
|
||
/******/ Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });
|
||
/******/ }
|
||
/******/ }
|
||
/******/ };
|
||
/******/ })();
|
||
/******/
|
||
/******/ /* webpack/runtime/hasOwnProperty shorthand */
|
||
/******/ (() => {
|
||
/******/ __webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))
|
||
/******/ })();
|
||
/******/
|
||
/******/ /* webpack/runtime/make namespace object */
|
||
/******/ (() => {
|
||
/******/ // define __esModule on exports
|
||
/******/ __webpack_require__.r = (exports) => {
|
||
/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
|
||
/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
|
||
/******/ }
|
||
/******/ Object.defineProperty(exports, '__esModule', { value: true });
|
||
/******/ };
|
||
/******/ })();
|
||
/******/
|
||
/************************************************************************/
|
||
var __webpack_exports__ = {};
|
||
__webpack_require__.r(__webpack_exports__);
|
||
/* harmony export */ __webpack_require__.d(__webpack_exports__, {
|
||
/* harmony export */ ExternalChange: () => (/* reexport safe */ _useCodeMirror__WEBPACK_IMPORTED_MODULE_3__.Q),
|
||
/* harmony export */ basicSetup: () => (/* reexport safe */ _uiw_codemirror_extensions_basic_setup__WEBPACK_IMPORTED_MODULE_7__.o),
|
||
/* harmony export */ "default": () => (src),
|
||
/* harmony export */ getStatistics: () => (/* reexport safe */ _utils__WEBPACK_IMPORTED_MODULE_9__.m),
|
||
/* harmony export */ minimalSetup: () => (/* reexport safe */ _uiw_codemirror_extensions_basic_setup__WEBPACK_IMPORTED_MODULE_7__.V),
|
||
/* harmony export */ useCodeMirror: () => (/* reexport safe */ _useCodeMirror__WEBPACK_IMPORTED_MODULE_3__.q)
|
||
/* harmony export */ });
|
||
/* harmony import */ var _home_runner_work_react_codemirror_react_codemirror_node_modules_babel_runtime_helpers_esm_objectSpread2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(289);
|
||
/* harmony import */ var _home_runner_work_react_codemirror_react_codemirror_node_modules_babel_runtime_helpers_esm_objectWithoutProperties_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(644);
|
||
/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(442);
|
||
/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_2__);
|
||
/* harmony import */ var _useCodeMirror__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(341);
|
||
/* harmony import */ var react_jsx_runtime__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(742);
|
||
/* harmony import */ var react_jsx_runtime__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(react_jsx_runtime__WEBPACK_IMPORTED_MODULE_4__);
|
||
/* harmony import */ var _codemirror_view__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(730);
|
||
/* harmony import */ var _codemirror_view__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_codemirror_view__WEBPACK_IMPORTED_MODULE_5__);
|
||
/* harmony reexport (unknown) */ var __WEBPACK_REEXPORT_OBJECT__ = {};
|
||
/* harmony reexport (unknown) */ for(const __WEBPACK_IMPORT_KEY__ in _codemirror_view__WEBPACK_IMPORTED_MODULE_5__) if(__WEBPACK_IMPORT_KEY__ !== "default") __WEBPACK_REEXPORT_OBJECT__[__WEBPACK_IMPORT_KEY__] = () => _codemirror_view__WEBPACK_IMPORTED_MODULE_5__[__WEBPACK_IMPORT_KEY__]
|
||
/* harmony reexport (unknown) */ __webpack_require__.d(__webpack_exports__, __WEBPACK_REEXPORT_OBJECT__);
|
||
/* harmony import */ var _codemirror_state__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(60);
|
||
/* harmony import */ var _codemirror_state__WEBPACK_IMPORTED_MODULE_6___default = /*#__PURE__*/__webpack_require__.n(_codemirror_state__WEBPACK_IMPORTED_MODULE_6__);
|
||
/* harmony reexport (unknown) */ var __WEBPACK_REEXPORT_OBJECT__ = {};
|
||
/* harmony reexport (unknown) */ for(const __WEBPACK_IMPORT_KEY__ in _codemirror_state__WEBPACK_IMPORTED_MODULE_6__) if(__WEBPACK_IMPORT_KEY__ !== "default") __WEBPACK_REEXPORT_OBJECT__[__WEBPACK_IMPORT_KEY__] = () => _codemirror_state__WEBPACK_IMPORTED_MODULE_6__[__WEBPACK_IMPORT_KEY__]
|
||
/* harmony reexport (unknown) */ __webpack_require__.d(__webpack_exports__, __WEBPACK_REEXPORT_OBJECT__);
|
||
/* harmony import */ var _uiw_codemirror_extensions_basic_setup__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(687);
|
||
/* harmony import */ var _getDefaultExtensions__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(89);
|
||
/* harmony reexport (unknown) */ var __WEBPACK_REEXPORT_OBJECT__ = {};
|
||
/* harmony reexport (unknown) */ for(const __WEBPACK_IMPORT_KEY__ in _getDefaultExtensions__WEBPACK_IMPORTED_MODULE_8__) if(["default","basicSetup","minimalSetup","ExternalChange","useCodeMirror"].indexOf(__WEBPACK_IMPORT_KEY__) < 0) __WEBPACK_REEXPORT_OBJECT__[__WEBPACK_IMPORT_KEY__] = () => _getDefaultExtensions__WEBPACK_IMPORTED_MODULE_8__[__WEBPACK_IMPORT_KEY__]
|
||
/* harmony reexport (unknown) */ __webpack_require__.d(__webpack_exports__, __WEBPACK_REEXPORT_OBJECT__);
|
||
/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(369);
|
||
var _excluded=["className","value","selection","extensions","onChange","onStatistics","onCreateEditor","onUpdate","autoFocus","theme","height","minHeight","maxHeight","width","minWidth","maxWidth","basicSetup","placeholder","indentWithTab","editable","readOnly","root","initialState"];var ReactCodeMirror=/*#__PURE__*/(0,react__WEBPACK_IMPORTED_MODULE_2__.forwardRef)(function(props,ref){var className=props.className,_props$value=props.value,value=_props$value===void 0?'':_props$value,selection=props.selection,_props$extensions=props.extensions,extensions=_props$extensions===void 0?[]:_props$extensions,onChange=props.onChange,onStatistics=props.onStatistics,onCreateEditor=props.onCreateEditor,onUpdate=props.onUpdate,autoFocus=props.autoFocus,_props$theme=props.theme,theme=_props$theme===void 0?'light':_props$theme,height=props.height,minHeight=props.minHeight,maxHeight=props.maxHeight,width=props.width,minWidth=props.minWidth,maxWidth=props.maxWidth,basicSetup=props.basicSetup,placeholder=props.placeholder,indentWithTab=props.indentWithTab,editable=props.editable,readOnly=props.readOnly,root=props.root,initialState=props.initialState,other=(0,_home_runner_work_react_codemirror_react_codemirror_node_modules_babel_runtime_helpers_esm_objectWithoutProperties_js__WEBPACK_IMPORTED_MODULE_1__/* ["default"] */ .A)(props,_excluded);var editor=(0,react__WEBPACK_IMPORTED_MODULE_2__.useRef)(null);var _useCodeMirror=(0,_useCodeMirror__WEBPACK_IMPORTED_MODULE_3__/* .useCodeMirror */ .q)({root:root,value:value,autoFocus:autoFocus,theme:theme,height:height,minHeight:minHeight,maxHeight:maxHeight,width:width,minWidth:minWidth,maxWidth:maxWidth,basicSetup:basicSetup,placeholder:placeholder,indentWithTab:indentWithTab,editable:editable,readOnly:readOnly,selection:selection,onChange:onChange,onStatistics:onStatistics,onCreateEditor:onCreateEditor,onUpdate:onUpdate,extensions:extensions,initialState:initialState}),state=_useCodeMirror.state,view=_useCodeMirror.view,container=_useCodeMirror.container,setContainer=_useCodeMirror.setContainer;(0,react__WEBPACK_IMPORTED_MODULE_2__.useImperativeHandle)(ref,function(){return{editor:editor.current,state:state,view:view};},[editor,container,state,view]);var setEditorRef=(0,react__WEBPACK_IMPORTED_MODULE_2__.useCallback)(function(el){editor.current=el;setContainer(el);},[setContainer]);// check type of value
|
||
if(typeof value!=='string'){throw new Error("value must be typeof string but got ".concat(typeof value));}var defaultClassNames=typeof theme==='string'?"cm-theme-".concat(theme):'cm-theme';return/*#__PURE__*/(0,react_jsx_runtime__WEBPACK_IMPORTED_MODULE_4__.jsx)("div",(0,_home_runner_work_react_codemirror_react_codemirror_node_modules_babel_runtime_helpers_esm_objectSpread2_js__WEBPACK_IMPORTED_MODULE_0__/* ["default"] */ .A)({ref:setEditorRef,className:"".concat(defaultClassNames).concat(className?" ".concat(className):'')},other));});ReactCodeMirror.displayName='CodeMirror';/* harmony default export */ const src = (ReactCodeMirror);
|
||
/******/ return __webpack_exports__;
|
||
/******/ })()
|
||
;
|
||
}); |